cleanup

src/lib/biocaml_intervalTree.ml

@@ -233,19 +233,3 @@ let find_closest lo hi t = match find_closest_aux lo hi t with
     Some (n,_) -> node_contents n
   | None -> raise Empty_tree
 
-(*
-let find_closest lo hi = function
-  | Empty -> None
-  | Node n ->
-    let queue = Queue.create () 
-    and optdist = ref max_int 
-    and optnode = ref None in
-    Queue.add t queue ;
-    while not (Queue.is_empty t) do
-      match Queue.pop queue with
-	  
-    done
-
-*)
-
-(* let rec find_kclosest k lo hi t =  *)

src/lib/biocaml_intervalTree.mli

@@ -37,5 +37,7 @@ val find_closest : int -> int -> 'a t -> int * int * 'a
     Raises [Empty_tree] if [t] is empty *)
 
 val print : 'a t -> unit
+(** Used for debugging purpose, should be removed in the long run *)
 
 val check_integrity : 'a t -> unit
+(** Used for debugging purpose, should be removed in the long run *)