forked from pool/ocaml-facile
Olaf Hering
ddc83c687c
- Remove obsolete ocaml-4.patch OBS-URL: https://build.opensuse.org/package/show/devel:languages:ocaml/ocaml-facile?expand=0&rev=18
82 lines
2.6 KiB
Diff
82 lines
2.6 KiB
Diff
--- /dev/null
|
|
+++ b/dune-project
|
|
@@ -0,0 +1,2 @@
|
|
+(lang dune 1.11)
|
|
+(name facile)
|
|
--- /dev/null
|
|
+++ b/lib/dune
|
|
@@ -0,0 +1,5 @@
|
|
+(library
|
|
+ (public_name facile)
|
|
+ (libraries stdlib-shims)
|
|
+ (ocamlopt_flags (-unsafe -noassert -inline 10))
|
|
+)
|
|
--- a/lib/fcl_cstr.ml
|
|
+++ b/lib/fcl_cstr.ml
|
|
@@ -50,7 +50,7 @@ let create ?(name = "anonymous") ?(nb_wa
|
|
and nb_solved = Fcl_stak.ref 0 in
|
|
let update i =
|
|
if update i then
|
|
- if Pervasives.not solved.(i) then begin
|
|
+ if Stdlib.not solved.(i) then begin
|
|
Fcl_stak.set nb_solved (Fcl_stak.get nb_solved + 1);
|
|
array_set_true solved i
|
|
end in
|
|
--- a/lib/fcl_fdArray.ml
|
|
+++ b/lib/fcl_fdArray.ml
|
|
@@ -299,7 +299,7 @@ let get array index =
|
|
let (mi, ma) =
|
|
Array.fold_left
|
|
(fun (mi, ma) e ->
|
|
- (Pervasives.min mi (Fd.min e), Pervasives.max ma (Fd.max e)))
|
|
+ (Stdlib.min mi (Fd.min e), Stdlib.max ma (Fd.max e)))
|
|
(max_int, min_int) array in
|
|
if mi = ma then Fd.int mi else
|
|
let value = Fd.create (Fcl_domain.interval mi ma) in
|
|
--- a/lib/fcl_misc.ml
|
|
+++ b/lib/fcl_misc.ml
|
|
@@ -50,9 +50,9 @@ module Operators = struct
|
|
x - y
|
|
*)
|
|
|
|
- let (+) = Pervasives.(+)
|
|
- let (-) = Pervasives.(-)
|
|
- let ( * ) = Pervasives.( * )
|
|
+ let (+) = Stdlib.(+)
|
|
+ let (-) = Stdlib.(-)
|
|
+ let ( * ) = Stdlib.( * )
|
|
|
|
let (=+) x y = x := !x + y
|
|
let (=+.) x y = x := !x +. y
|
|
--- a/lib/fcl_nonlinear.ml
|
|
+++ b/lib/fcl_nonlinear.ml
|
|
@@ -274,7 +274,7 @@ let min_max_of_div_for_div a b z =
|
|
let min_max_of_remainder x y =
|
|
let r_abs_max =
|
|
let min_y, max_y = Fd.min_max y in
|
|
- max (Pervasives.abs min_y) (Pervasives.abs max_y) - 1 in
|
|
+ max (Stdlib.abs min_y) (Stdlib.abs max_y) - 1 in
|
|
if Fd.min x >= 0 then (0, r_abs_max)
|
|
else if Fd.max x <= 0 then ((0 - r_abs_max), 0)
|
|
else ((0 - r_abs_max), r_abs_max)
|
|
--- a/lib/fcl_sorting.ml
|
|
+++ b/lib/fcl_sorting.ml
|
|
@@ -355,7 +355,7 @@ let sortp a =
|
|
else
|
|
let inf, sup =
|
|
Array.fold_left
|
|
- (fun (inf, sup) x -> Pervasives.min (Fd.min x) inf, Pervasives.max (Fd.max x) sup) (max_int, min_int) a in
|
|
+ (fun (inf, sup) x -> Stdlib.min (Fd.min x) inf, Stdlib.max (Fd.max x) sup) (max_int, min_int) a in
|
|
let d = Fd.array n inf sup
|
|
and p = Fd.array n 0 (n - 1) in
|
|
Fcl_cstr.post (cstr a ~p:(Some p) d);
|
|
@@ -368,7 +368,7 @@ let sort a =
|
|
else
|
|
let inf, sup =
|
|
Array.fold_left
|
|
- (fun (inf, sup) x -> Pervasives.min (Fd.min x) inf, Pervasives.max (Fd.max x) sup) (max_int, min_int) a in
|
|
+ (fun (inf, sup) x -> Stdlib.min (Fd.min x) inf, Stdlib.max (Fd.max x) sup) (max_int, min_int) a in
|
|
let d = Fd.array n inf sup in
|
|
Fcl_cstr.post (cstr a d);
|
|
d;;
|