1) Utiliser bitvector pour preserver l'ordre pendant l'evaluation

[tatoo.git] / src / table_driver.ml

diff --git a/src/table_driver.ml b/src/table_driver.ml
index f690b74..d42743e 100644 (file)
--- a/src/table_driver.ml
+++ b/src/table_driver.ml
@@ -30,8 +30,11 @@ let main () =
   let mini_qtree_list = 
     List.map (fun qtree -> Query_tree.minimize_qtree qtree) query_tree_list 
   in
+  let root = Bitvector.create (Naive_tree.size doc) in
+  Bitvector.set root 0 true;
   List.iter ( fun q -> 
-    let res = eval_qtree doc [ (Naive_tree.root doc) ] q in
+    let v = eval_qtree doc root q in
+    let res = decode_bit doc v in
     print_string "<xml_result num=\"1\" >\n";
     print_node_list doc res;
     print_string "</xml_result>\n";