Implement a new automaton run (non optimized) with cleaner semantics w.r.t. ranked...

[tatoo.git] / src / tatoo.ml

diff --git a/src/tatoo.ml b/src/tatoo.ml
index d8c3e09..eac804a 100644 (file)
--- a/src/tatoo.ml
+++ b/src/tatoo.ml
@@ -106,7 +106,8 @@ let main () =
 
   let module Naive = Run.Make(Naive_tree) in
   let result_list =
-    let root = [ Naive_tree.root doc] in
+    let root = Sequence.create () in
+    let () = Sequence.add (Naive_tree.root doc) root in
     let f, msg =
       match !Options.parallel, !Options.compose with
         true, true ->
@@ -127,10 +128,10 @@ let main () =
       output_string output (string_of_int !count);
       output_string output "\" >\n";
       if !Options.count then begin
-        output_string output (string_of_int (List.length results));
+        output_string output (string_of_int (Sequence.length results));
         output_char output '\n';
       end else
-        List.iter (fun n ->
+        Sequence.iter (fun n ->
           Naive_tree.print_xml output doc n;
           output_char output '\n'
         ) results;