Imported Upstream snapshot 8.3~beta0+13298

1 files changed, 10 insertions, 10 deletions

diff --git a/lib/explore.ml b/lib/explore.ml
index 7e6de0c4..76049509 100644
--- a/lib/explore.ml
+++ b/lib/explore.ml
@@ -6,7 +6,7 @@
 (*         *       GNU Lesser General Public License Version 2.1        *)
 (************************************************************************)
 
-(*i $Id: explore.ml 6066 2004-09-06 22:54:50Z barras $ i*)
+(*i $Id$ i*)
 
 open Format
 
@@ -23,7 +23,7 @@ module Make = functor(S : SearchProblem) -> struct
 
   type position = int list
 
-  let pp_position p = 
+  let pp_position p =
     let rec pp_rec = function
       | [] -> ()
       | [i] -> printf "%d" i
@@ -33,21 +33,21 @@ module Make = functor(S : SearchProblem) -> struct
 
   (*s Depth first search. *)
 
-  let rec depth_first s = 
+  let rec depth_first s =
     if S.success s then s else depth_first_many (S.branching s)
   and depth_first_many = function
     | [] -> raise Not_found
     | [s] -> depth_first s
     | s :: l -> try depth_first s with Not_found -> depth_first_many l
 
-  let debug_depth_first s = 
+  let debug_depth_first s =
     let rec explore p s =
       pp_position p; S.pp s;
       if S.success s then s else explore_many 1 p (S.branching s)
     and explore_many i p = function
       | [] -> raise Not_found
       | [s] -> explore (i::p) s
-      | s :: l -> 
+      | s :: l ->
 	  try explore (i::p) s with Not_found -> explore_many (succ i) p l
     in
     explore [1] s
@@ -66,7 +66,7 @@ module Make = functor(S : SearchProblem) -> struct
     | h, x::t -> x, (h,t)
     | h, [] -> match List.rev h with x::t -> x, ([],t) | [] -> raise Empty
 
-  let breadth_first s = 
+  let breadth_first s =
     let rec explore q =
       let (s, q') = try pop q with Empty -> raise Not_found in
       enqueue q' (S.branching s)
@@ -76,15 +76,15 @@ module Make = functor(S : SearchProblem) -> struct
     in
     enqueue empty [s]
 
-  let debug_breadth_first s = 
+  let debug_breadth_first s =
     let rec explore q =
-      let ((p,s), q') = try pop q with Empty -> raise Not_found in 
+      let ((p,s), q') = try pop q with Empty -> raise Not_found in
       enqueue 1 p q' (S.branching s)
     and enqueue i p q = function
-      | [] -> 
+      | [] ->
 	  explore q
       | s :: l ->
-	  let ps = i::p in 
+	  let ps = i::p in
 	  pp_position ps; S.pp s;
 	  if S.success s then s else enqueue (succ i) p (push (ps,s) q) l
     in