feat: correct greedy/lazy and inplace/functional, split into multiple inputs

src/lib/solvers/illinois.ml

@@ -54,7 +54,7 @@ let make_check_root rdir f0 f1 =
   let check = get_check_root rdir in
   (fun i -> check f0.{i} f1.{i})
            **)
-   
+
 (* update roots and returns true if there was at least one root *)
 (* between f0 and f1 for one component of index [i in [0..length f0 - 1]] *)
 (* update [roots] *)
@@ -85,7 +85,7 @@ type zcfn  = float -> Zls.carray -> Zls.carray -> unit
 
 (* type of a session with the solver *)
 (*  zx = g(t, c) yields the values of system zero-crossing expressions
-    
+
     f0/t0 are the zero-crossing expression values at the last mesh point
     f1/t1 are the zero-crossing expression values at the next mesh point
 
@@ -129,16 +129,16 @@ let initialize_only nroots g =
   {
     g = g;
     bothf_valid  = false;
-    
+
     f0 = Zls.cmake nroots;
     t0 = 0.0;
-    
+
     f1 = Zls.cmake nroots;
     t1 = 0.0;
-    
+
     fta = Zls.cmake nroots;
     ftb = Zls.cmake nroots;
-    
+
     calc_zc = get_check_root Up;
   }
 
@@ -224,8 +224,8 @@ let find ({ g = g; bothf_valid = bothf_valid;
 
   (* Searches between (t_left, f_left) and (t_right, f_right) to find the
      leftmost (t_mid, f_mid):
-    
-          | 
+
+          |
           |                                      f_right
           |
           |                  f_mid
@@ -323,7 +323,7 @@ let find ({ g = g; bothf_valid = bothf_valid;
     | SearchLeft  -> begin
         let (t, v, f0', fta', ftb') =
           seek (t0, f0, fta, t1, None, 1.0, 0) in
-        
+
         s.t0  <- t;
         s.f0  <- f0';
         s.bothf_valid <- v;
@@ -337,12 +337,12 @@ let find ({ g = g; bothf_valid = bothf_valid;
 (* the main function of this module *)
 (* locate a root *)
 let find s (dky, c) roots = find s (dky, c) roots
-                          
+
 (* is there a root? [has_root s: bool] is true is there is a change in sign *)
 (* for one component [i in [0..length f0 - 1]] beetwen [f0.(i)] and [f1.(i)] *)
 let has_roots { bothf_valid = bothf_valid; t0; f0; t1; f1; calc_zc = calc_zc }
   = bothf_valid && (check_interval calc_zc f0 f1 <> SearchRight)
-		    
+
 let takeoff { bothf_valid = bothf_valid; f0; f1 } =
   bothf_valid && (takeoff f0 f1)
 
@@ -351,7 +351,7 @@ let takeoff { bothf_valid = bothf_valid; f0; f1 } =
 (* with function [find] when the signal is taking off from [0.0] to a *)
 (* strictly positive value *)
 let find_takeoff ({ f0; f1 } as s) roots =
-  let calc_zc x0 x1 = 
+  let calc_zc x0 x1 =
     if (x0 = 0.0) && (x1 > 0.0) then 1l else 0l in
   let b = update_roots calc_zc f0 f1 roots in
   if b then begin s.t1 <- s.t0; s.f1 <- s.f0; s.ftb <- s.fta end;

src/lib/solvers/odexx.ml

@@ -40,10 +40,10 @@ sig (* {{{ *)
        size(b)  = ns x ns
                   (but only the lower strictly triangular entries)
        size(e)  = ns
-       size(bi) = ns x po 
+       size(bi) = ns x po
                   (where po is the order of the interpolating polynomial)
    *)
-     
+
 
 end (* }}} *)
 
@@ -322,7 +322,7 @@ struct (* {{{1 *)
     s.time <- nextt;
     s.h <- nexth;
     s.time
-    
+
   let get_dky { last_time = t; time = t'; h = h; yold = y; k = k } yi ti kd =
 
     if kd > 0 then
@@ -334,7 +334,7 @@ struct (* {{{1 *)
       failwith
         (Printf.sprintf
            "get_dky: requested time %.24e is out of range\n\ [%.24e,...,%.24e]"
-           ti t t'); 
+           ti t t');
 
     let h  = t' -. t        in
     let th = (ti -. t) /. h in
@@ -358,9 +358,9 @@ struct (* {{{1 *)
   let copy ({ last_time; time; h; yold; k } as s) =
     { s with last_time; time; h; yold = Zls.copy yold; k = Zls.copy_matrix k }
 
-  let blit { last_time = l1; time = t1; h = h1; yold = yhold1; k = k1 } 
+  let blit { last_time = l1; time = t1; h = h1; yold = yhold1; k = k1 }
       ({ last_time; time; h; yold; k } as s2) =
-    s2.last_time <- l1; s2.time <- t1; 
+    s2.last_time <- l1; s2.time <- t1;
     Zls.blit yhold1 yold; Zls.blit_matrix k1 k
 
 end (* }}} *)