(* *)
(***********************************************************************)
+(*
+ Time-stamp: <Last modified on 2013-01-30 19:07:53 CET by Kim Nguyen>
+*)
+
(* Modified by Kim Nguyen *)
(* The Patricia trees are themselves deeply hash-consed. The module
provides a Make (and Weak) functor to build hash-consed patricia
loop 7
let hbit = Array.init 256 naive_highest_bit
- (*
- external clz : int -> int = "caml_clz" "noalloc"
- external leading_bit : int -> int = "caml_leading_bit" "noalloc"
- *)
+ (*
+ external clz : int -> int = "caml_clz" "noalloc"
+ external leading_bit : int -> int = "caml_leading_bit" "noalloc"
+ *)
let highest_bit x =
try
let n = (x) lsr 24 in
in
rmv t
- (* should run in O(1) thanks to Hash consing *)
+ (* should run in O(1) thanks to hash consing *)
let equal a b = Node.equal a b
let compare a b = (Uid.to_int (Node.uid a)) - (Uid.to_int (Node.uid b))
let rec merge s t =
- if (equal s t) (* This is cheap thanks to hash-consing *)
+ if equal s t (* This is cheap thanks to hash-consing *)
then s
else
match Node.node s, Node.node t with