une version marché et correcte avec bitvector

[tatoo.git] / src / query_tree.ml

diff --git a/src/query_tree.ml b/src/query_tree.ml
index d9a226f..679d992 100644 (file)
--- a/src/query_tree.ml
+++ b/src/query_tree.ml
@@ -146,12 +146,12 @@ let rec eval_qtree tree start q =
        let res =
        match q.desc with
          | Start -> start
-         | Dom -> (* Bitvector.create true (Naive_tree.size tree)*)
-           let v = Bitvector.create (Naive_tree.size tree) in
+         | Dom -> Bitvector.create ~init:true (Naive_tree.size tree)
+           (*let v = Bitvector.create (Naive_tree.size tree) in
            for i=0 to (Bitvector.length v)-1 do
              Bitvector.set v i true
            done;
-           v
+           v*)
          | Tag (t,k) -> element_by_tag tree t k                     
          | Axis (a,q1) -> let v = eval_qtree tree start q1 in
                           eval_axis tree v a