X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=src%2Fptset.ml;h=ee0370a12390e7c42e6c63e3571b51e524e5ecab;hb=6b66008811639324be623a42037b60e02056772c;hp=774b9fc5fa6846d298adb282baff3197c3c5e717;hpb=cb29d45b3a79233581292a2ef172151b1ff489cb;p=tatoo.git

diff --git a/src/ptset.ml b/src/ptset.ml
index 774b9fc..ee0370a 100644
--- a/src/ptset.ml
+++ b/src/ptset.ml
@@ -14,6 +14,10 @@
 (*                                                                     *)
 (***********************************************************************)
 
+(*
+  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
@@ -119,10 +123,10 @@ struct
     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
@@ -182,14 +186,14 @@ struct
     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