reindent code

src/core/CCFun.mli

@@ -33,12 +33,12 @@ val flip : ('a -> 'b -> 'c) -> 'b -> 'a -> 'c
 (** Reverse the order of arguments for a binary function. *)
 
 val curry : ('a * 'b -> 'c) -> 'a -> 'b -> 'c
- (** Convert a function which accepts a pair of arguments into a function which accepts two arguments.
+(** Convert a function which accepts a pair of arguments into a function which accepts two arguments.
     [curry f x y] is [f (x,y)]. *)
 
 val uncurry : ('a -> 'b -> 'c) -> ('a * 'b) -> 'c
- (** Convert a function which accepts a two arguments into a function which accepts a pair of arguments.
-     [uncurry f (x,y)] is  [f x y]. *)
+(** Convert a function which accepts a two arguments into a function which accepts a pair of arguments.
+    [uncurry f (x,y)] is  [f x y]. *)
 
 val tap : ('a -> _) -> 'a -> 'a
 (** [tap f x] evaluates [f x], discards it, then returns [x]. Useful

src/core/CCOpt.mli

@@ -141,7 +141,7 @@ module Infix : sig
   val (<+>) : 'a t -> 'a t -> 'a t
   (** [a <+> b] is [a] if [a] is [Some _], [b] otherwise. *)
 
-  end
+end
 
 (** {2 Conversion and IO} *)
 

src/core/CCParse.mli

@@ -370,7 +370,7 @@ module Infix : sig
       in case of success, applies [f] to the result. *)
 
   val (<*>) : ('a -> 'b) t -> 'a t -> 'b t
- (** Applicative. *)
+  (** Applicative. *)
 
   val (<* ) : 'a t -> _ t -> 'a t
   (** [a <* b] parses [a] into [x], parses [b] and ignores its result,
@@ -382,10 +382,10 @@ module Infix : sig
 
   val (<|>) : 'a t -> 'a t -> 'a t
   (** [a <|> b] tries to parse [a], and if [a] fails without
-    consuming any input, backtracks and tries
-    to parse [b], otherwise it fails as [a].
-    See {!try_} to ensure [a] does not consume anything (but it is best
-    to avoid wrapping large parsers with {!try_}). *)
+      consuming any input, backtracks and tries
+      to parse [b], otherwise it fails as [a].
+      See {!try_} to ensure [a] does not consume anything (but it is best
+      to avoid wrapping large parsers with {!try_}). *)
 
   val (<?>) : 'a t -> string -> 'a t
   (** [a <?> msg] behaves like [a], but if [a] fails without

src/core/CCResult.mli

@@ -167,12 +167,12 @@ module Infix : sig
 
   val (>>=) : ('a, 'err) t -> ('a -> ('b, 'err) t) -> ('b, 'err) t
   (** Monadic composition. [e >>= f] proceeds as [f x] if [e] is [Ok x]
-    or returns [e] if [e] is an [Error]. *)
+      or returns [e] if [e] is an [Error]. *)
 
   val (<*>) : ('a -> 'b, 'err) t -> ('a, 'err) t -> ('b, 'err) t
   (** [a <*> b] evaluates [a] and [b], and, in case of success, returns
-    [Ok (a b)]. Otherwise, it fails, and the error of [a] is chosen
-    over the error of [b] if both fail. *)
+      [Ok (a b)]. Otherwise, it fails, and the error of [a] is chosen
+      over the error of [b] if both fail. *)
 end
 
 (** {2 Collections} *)

src/core/CCSet.mli

@@ -49,7 +49,7 @@ module type S = sig
   val of_seq : elt sequence -> t
   (** Build a set from the given [sequence] of elements. *)
 
- val add_seq : t -> elt sequence -> t
+  val add_seq : t -> elt sequence -> t
   (** @since 0.14 *)
 
   val to_seq : t -> elt sequence
@@ -68,7 +68,7 @@ module type S = sig
   val pp :
     ?start:string -> ?stop:string -> ?sep:string ->
     elt printer -> t printer
-  (** Print the set *)
+    (** Print the set *)
 
 end