diff options
| author |  ppedrot <ppedrot@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2012-09-14 19:13:19 +0000 |
|---|---|---|
| committer | ppedrot <ppedrot@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2012-09-14 19:13:19 +0000 |
| commit | 8cc623262c625bda20e97c75f9ba083ae8e7760d (patch) | |
| tree | 3e7ef244636612606a574a21e4f8acaab828d517 /lib/rtree.ml | |
| parent | 6eaff635db797d1f9225b22196832c1bb76c0d94 (diff) | |
As r15801: putting everything from Util.array_* to CArray.*.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@15804 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'lib/rtree.ml')
| -rw-r--r-- | lib/rtree.ml | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/rtree.ml b/lib/rtree.ml index 18ba9d0ef..130bbcf2f 100644 --- a/lib/rtree.ml +++ b/lib/rtree.ml @@ -103,13 +103,13 @@ let rec map f t = match t with let smartmap f t = match t with Param _ -> t | Node (a,sons) -> - let a'=f a and sons' = Util.array_smartmap (map f) sons in + let a'=f a and sons' = Util.Array.smartmap (map f) sons in if a'==a && sons'==sons then t else Node (a',sons') | Rec(j,defs) -> - let defs' = Util.array_smartmap (map f) defs in + let defs' = Util.Array.smartmap (map f) defs in if defs'==defs then t else @@ -134,7 +134,7 @@ let is_infinite t = fold (fun seen t is_inf -> seen || (match t with - Node(_,v) -> array_exists is_inf v + Node(_,v) -> Array.exists is_inf v | Param _ -> false | _ -> assert false)) t @@ -154,7 +154,7 @@ let compare_rtree f = fold2 else if b > 0 then true else match expand t1, expand t2 with Node(_,v1), Node(_,v2) when Array.length v1 = Array.length v2 -> - array_for_all2 cmp v1 v2 + Array.for_all2 cmp v1 v2 | _ -> false) let eq_rtree cmp t1 t2 = |