reindentation

Author: c-cube

src/core/CCArray.ml

@@ -62,8 +62,8 @@ let fold_while f acc a =
     if i < Array.length a then
       let acc, cont = f acc a.(i) in
       match cont with
-      | `Stop -> acc
-      | `Continue -> fold_while_i f acc (i+1)
+        | `Stop -> acc
+        | `Continue -> fold_while_i f acc (i+1)
     else acc
   in fold_while_i f acc 0
 
@@ -106,7 +106,7 @@ let sorted cmp a =
 (*$= & ~cmp:(=) ~printer:Q.Print.(array int)
   [||] (sorted Pervasives.compare [||])
   [|0;1;2;3;4|] (sorted Pervasives.compare [|3;2;1;4;0|])
-  *)
+*)
 
 (*$Q
   Q.(array int) (fun a -> \
@@ -160,7 +160,7 @@ let rev a =
   rev [| 1; 2; 3 |] = [| 3; 2; 1 |]
   rev [| 1; 2; |] = [| 2; 1 |]
   rev [| |] = [| |]
-  *)
+*)
 
 let rec find_aux f a i =
   if i = Array.length a then None
@@ -229,27 +229,27 @@ let flat_map f a =
 let rec _lookup_rec ~cmp k a i j =
   if i>j then raise Not_found
   else if i=j
-    then if cmp k a.(i) = 0
-      then i
-      else raise Not_found
+  then if cmp k a.(i) = 0
+    then i
+    else raise Not_found
   else
     let middle = (j+i)/2 in
     match cmp k a.(middle) with
-    | 0 -> middle
-    | n when n<0 -> _lookup_rec ~cmp k a i (middle-1)
-    | _ -> _lookup_rec ~cmp k a (middle+1) j
+      | 0 -> middle
+      | n when n<0 -> _lookup_rec ~cmp k a i (middle-1)
+      | _ -> _lookup_rec ~cmp k a (middle+1) j
 
 let _lookup_exn ~cmp k a i j =
   if i>j then raise Not_found;
   match cmp k a.(i) with
-  | 0 -> i
-  | n when n<0 -> raise Not_found (* too low *)
-  | _ when i=j -> raise Not_found (* too high *)
-  | _ ->
+    | 0 -> i
+    | n when n<0 -> raise Not_found (* too low *)
+    | _ when i=j -> raise Not_found (* too high *)
+    | _ ->
       match cmp k a.(j) with
-      | 0 -> j
-      | n when n<0 -> _lookup_rec ~cmp k a (i+1) (j-1)
-      | _ -> raise Not_found  (* too high *)
+        | 0 -> j
+        | n when n<0 -> _lookup_rec ~cmp k a (i+1) (j-1)
+        | _ -> raise Not_found  (* too high *)
 
 let lookup_exn ?(cmp=Pervasives.compare) k a =
   _lookup_exn ~cmp k a 0 (Array.length a-1)
@@ -371,8 +371,8 @@ let (--) i j =
 let (--^) i j =
   if i=j then [| |]
   else if i>j
-    then Array.init (i-j) (fun k -> i-k)
-    else Array.init (j-i) (fun k -> i+k)
+  then Array.init (i-j) (fun k -> i-k)
+  else Array.init (j-i) (fun k -> i+k)
 
 (*$Q
   Q.(pair small_int small_int) (fun (a,b) -> \
@@ -540,7 +540,7 @@ module SortGeneric(A : MONO_ARRAY) = struct
     in
     let rand = Rand.make seed_ in
     (* sort slice.
-      There is a chance that the two pivots are equal, but it's unlikely. *)
+       There is a chance that the two pivots are equal, but it's unlikely. *)
     let rec sort_slice_ ~st a i j =
       if j-i>10 then (
         st.l <- i;
@@ -565,7 +565,7 @@ module SortGeneric(A : MONO_ARRAY) = struct
             swap_ a st.k st.g;
             st.g <- st.g - 1;
             (* the element swapped from the right might be in the first situation.
-              that is, < p  (we know it's <= q already) *)
+               that is, < p  (we know it's <= q already) *)
             if cmp (A.get a st.k) p < 0 then (
               if st.k <> st.l then swap_ a st.k st.l;
               st.l <- st.l + 1
@@ -588,9 +588,9 @@ end
 
 
 let sort_generic (type arr)(type elt)
-(module A : MONO_ARRAY with type t = arr and type elt = elt)
-?(cmp=Pervasives.compare) a
-=
+    (module A : MONO_ARRAY with type t = arr and type elt = elt)
+    ?(cmp=Pervasives.compare) a
+  =
   let module S = SortGeneric(A) in
   S.sort ~cmp a
 

src/core/CCArray_slice.ml

@@ -75,12 +75,12 @@ let rec _compare cmp a1 i1 j1 a2 i2 j2 =
   if i1 = j1
   then if i2=j2 then 0 else -1
   else if i2=j2
-    then 1
-    else
-      let c = cmp a1.(i1) a2.(i2) in
-      if c = 0
-        then _compare cmp a1 (i1+1) j1 a2 (i2+1) j2
-        else c
+  then 1
+  else
+    let c = cmp a1.(i1) a2.(i2) in
+    if c = 0
+    then _compare cmp a1 (i1+1) j1 a2 (i2+1) j2
+    else c
 
 let equal eq a b =
   length a = length b && _equal eq a.arr a.i a.j b.arr b.i b.j
@@ -105,8 +105,8 @@ let fold_while f acc a =
     if i < Array.length a.arr && i < a.j then
       let acc, cont = f acc a.arr.(i) in
       match cont with
-      | `Stop -> acc
-      | `Continue -> fold_while_i f acc (i+1)
+        | `Stop -> acc
+        | `Continue -> fold_while_i f acc (i+1)
     else acc
   in fold_while_i f acc a.i
 
@@ -157,44 +157,44 @@ let rec _find f a i j =
 let rec _lookup_rec ~cmp k a i j =
   if i>j then raise Not_found
   else if i=j
-    then if cmp k a.(i) = 0
-      then i
-      else raise Not_found
+  then if cmp k a.(i) = 0
+    then i
+    else raise Not_found
   else
     let middle = (j+i)/2 in
     match cmp k a.(middle) with
-    | 0 -> middle
-    | n when n<0 -> _lookup_rec ~cmp k a i (middle-1)
-    | _ -> _lookup_rec ~cmp k a (middle+1) j
+      | 0 -> middle
+      | n when n<0 -> _lookup_rec ~cmp k a i (middle-1)
+      | _ -> _lookup_rec ~cmp k a (middle+1) j
 
 let _lookup_exn ~cmp k a i j =
   if i>j then raise Not_found;
   match cmp k a.(i) with
-  | 0 -> i
-  | n when n<0 -> raise Not_found (* too low *)
-  | _ when i=j -> raise Not_found (* too high *)
-  | _ ->
+    | 0 -> i
+    | n when n<0 -> raise Not_found (* too low *)
+    | _ when i=j -> raise Not_found (* too high *)
+    | _ ->
       match cmp k a.(j) with
-      | 0 -> j
-      | n when n<0 -> _lookup_rec ~cmp k a (i+1) (j-1)
-      | _ -> raise Not_found  (* too high *)
+        | 0 -> j
+        | n when n<0 -> _lookup_rec ~cmp k a (i+1) (j-1)
+        | _ -> raise Not_found  (* too high *)
 
 let bsearch_ ~cmp x arr i j =
   let rec aux i j =
     if i > j
-      then `Just_after j
-      else
-        let middle = i + (j - i) / 2 in (* avoid overflow *)
-        match cmp x arr.(middle) with
+    then `Just_after j
+    else
+      let middle = i + (j - i) / 2 in (* avoid overflow *)
+      match cmp x arr.(middle) with
         | 0 -> `At middle
         | n when n<0 -> aux i (middle - 1)
         | _ -> aux (middle + 1) j
   in
   if i>=j then `Empty
   else match cmp arr.(i) x, cmp arr.(j) x with
-  | n, _ when n>0 -> `All_bigger
-  | _, n when n<0 -> `All_lower
-  | _ -> aux i j
+    | n, _ when n>0 -> `All_bigger
+    | _, n when n<0 -> `All_lower
+    | _ -> aux i j
 
 let rec _for_all p a i j =
   i = j || (p a.(i) && _for_all p a (i+1) j)
@@ -267,7 +267,7 @@ let rec _to_klist a i j () =
 let reverse_in_place a = _reverse_in_place a.arr a.i ~len:(length a)
 
 (*$T
-let a = 1--6 in let s = make a 2 ~len:3 in \
+  let a = 1--6 in let s = make a 2 ~len:3 in \
   reverse_in_place s; a = [| 1; 2; 5; 4; 3; 6 |]
 *)
 
@@ -343,7 +343,7 @@ let find_idx p a =
 
 (*$=
   (Some (1,"c")) (find_idx ((=) "c") (make [| "a"; "b"; "c" |] 1 2))
-  *)
+*)
 
 let lookup_exn ?(cmp=Pervasives.compare) k a =
   _lookup_exn ~cmp k a.arr a.i (a.j-1) - a.i
@@ -354,7 +354,7 @@ let lookup ?(cmp=Pervasives.compare) k a =
 
 (*$=
   (Some 1) (lookup "c" (make [| "a"; "b"; "c" |] 1 2))
-  *)
+*)
 
 let bsearch ?(cmp=Pervasives.compare) k a =
   match bsearch_ ~cmp k a.arr a.i (a.j - 1) with
@@ -373,7 +373,7 @@ let exists2 p a b =
   _exists2 p a.arr b.arr a.i b.i ~len:(min (length a) (length b))
 
 (*$T
-exists2 (=) (make [| 1;2;3;4 |] 1 ~len:2) (make [| 0;1;3;4 |] 1 ~len:3)
+  exists2 (=) (make [| 1;2;3;4 |] 1 ~len:2) (make [| 0;1;3;4 |] 1 ~len:3)
 *)
 
 let _iter2 f a b i j ~len =

src/core/CCChar.ml

@@ -2,7 +2,7 @@
 
 (** {1 Utils around char}
 
-  @since 0.14 *)
+    @since 0.14 *)
 
 type t = char
 

src/core/CCChar.mli

@@ -2,7 +2,7 @@
 
 (** {1 Utils around char}
 
-  @since 0.14 *)
+    @since 0.14 *)
 
 type t = char
 

src/core/CCFloat.mli

@@ -2,7 +2,7 @@
 (* This file is free software, part of containers. See file "license" for more details. *)
 
 (** {1 Basic Float functions}
-@since 0.6.1 *)
+    @since 0.6.1 *)
 
 type t = float
 type fpclass = Pervasives.fpclass =

src/core/CCFormat.ml

@@ -40,12 +40,12 @@ let string_quoted fmt s = Format.fprintf fmt "\"%s\"" s
 
 let list ?(sep=return ",@ ") pp fmt l =
   let rec pp_list l = match l with
-  | x::((_::_) as l) ->
-    pp fmt x;
-    sep fmt ();
-    pp_list l
-  | x::[] -> pp fmt x
-  | [] -> ()
+    | x::((_::_) as l) ->
+      pp fmt x;
+      sep fmt ();
+      pp_list l
+    | x::[] -> pp fmt x
+    | [] -> ()
   in
   pp_list l
 
@@ -152,7 +152,7 @@ let tee a b =
   Format.fprintf fmt "coucou@.";
   assert_equal ~printer:CCFun.id "coucou\n" (Buffer.contents buf1);
   assert_equal ~printer:CCFun.id "coucou\n" (Buffer.contents buf2);
-  *)
+*)
 
 let to_file filename format =
   let oc = open_out filename in
@@ -262,9 +262,9 @@ let set_color_tag_handling ppf =
   let functions = pp_get_formatter_tag_functions ppf () in
   let st = Stack.create () in (* stack of styles *)
   let functions' = {functions with
-    mark_open_tag=(mark_open_tag st ~or_else:functions.mark_open_tag);
-    mark_close_tag=(mark_close_tag st ~or_else:functions.mark_close_tag);
-  } in
+                      mark_open_tag=(mark_open_tag st ~or_else:functions.mark_open_tag);
+                      mark_close_tag=(mark_close_tag st ~or_else:functions.mark_close_tag);
+                   } in
   pp_set_mark_tags ppf true; (* enable tags *)
   pp_set_formatter_tag_functions ppf functions'
 

src/core/CCFormat.mli

@@ -3,7 +3,7 @@
 
 (** {1 Helpers for Format}
 
-@since 0.8 *)
+    @since 0.8 *)
 
 type 'a sequence = ('a -> unit) -> unit
 
@@ -48,7 +48,7 @@ val opt : 'a printer -> 'a option printer
 val pair : ?sep:unit printer -> 'a printer -> 'b printer -> ('a * 'b) printer
 val triple : ?sep:unit printer -> 'a printer -> 'b printer -> 'c printer -> ('a * 'b * 'c) printer
 val quad : ?sep:unit printer -> 'a printer -> 'b printer ->
-            'c printer -> 'd printer -> ('a * 'b * 'c * 'd) printer
+  'c printer -> 'd printer -> ('a * 'b * 'c * 'd) printer
 
 val within : string -> string -> 'a printer -> 'a printer
 (** [within a b p] wraps [p] inside the strings [a] and [b]. Convenient,
@@ -105,13 +105,13 @@ val some : 'a printer -> 'a option printer
 
 (** {2 ANSI codes}
 
-  Use ANSI escape codes https://en.wikipedia.org/wiki/ANSI_escape_code
-  to put some colors on the terminal.
+    Use ANSI escape codes https://en.wikipedia.org/wiki/ANSI_escape_code
+    to put some colors on the terminal.
 
-  This uses {b tags} in format strings to specify the style. Current styles
-  are the following:
+    This uses {b tags} in format strings to specify the style. Current styles
+    are the following:
 
-  {ul
+    {ul
     {- "reset" resets style}
     {- "black" }
     {- "red" }
@@ -130,19 +130,19 @@ val some : 'a printer -> 'a option printer
     {- "Magenta" bold magenta }
     {- "Cyan" bold cyan }
     {- "White" bold white }
-  }
+    }
 
-  Example:
+    Example:
 
-  {[
-    set_color_default true;;
+    {[
+      set_color_default true;;
 
-    Format.printf
-      "what is your @{<White>favorite color@}? @{<blue>blue@}! No, @{<red>red@}! Ahhhhhhh@.";;
-   ]}
+      Format.printf
+        "what is your @{<White>favorite color@}? @{<blue>blue@}! No, @{<red>red@}! Ahhhhhhh@.";;
+    ]}
 
-  {b status: experimental}
-  @since 0.15 *)
+    {b status: experimental}
+    @since 0.15 *)
 
 val set_color_tag_handling : t -> unit
 (** adds functions to support color tags to the given formatter.