Remplacer la fonction List.sort par les fonctions d'evaluations. La liste de fonction...

[tatoo.git] / src / query_tree.mli

diff --git a/src/query_tree.mli b/src/query_tree.mli
index 9afa1ad..e578beb 100644 (file)
--- a/src/query_tree.mli
+++ b/src/query_tree.mli
@@ -1,9 +1,11 @@
+val compteur : int ref
+
 val all_nodes : Naive_tree.t -> Naive_tree.node list
 (** [all_nodes t] returns all the nodes in the tree [t].
     Returns an empty list if there are no nodes in the tree.
  *)
 
-val element_by_tag : Naive_tree.t -> QNameSet.t -> Naive_tree.node list
+val element_by_tag : Naive_tree.t -> QNameSet.t -> Tree.NodeKind.t -> Naive_tree.node list
 (** [element_by_tag t tag] returns all the nodes whose tag equal to [tag] in the tree [t]. *)
 
 val compile_single_path : Xpath.Ast.single_path -> Table.query_tree 
@@ -14,7 +16,7 @@ val compile_single_path : Xpath.Ast.single_path -> Table.query_tree
 val compile_xpath : Xpath.Ast.path -> Table.query_tree 
 (** [compile_xpath path] returns un query_tree built with [xpath]
 *)
-
+(*
 val union_list : Naive_tree.t ->Naive_tree.node list -> Naive_tree.node list -> Naive_tree.node list
 (** union two lists without duplicating
 *)
@@ -32,3 +34,7 @@ val eval_query_tree : Naive_tree.t -> Naive_tree.node list ->Table.query_tree ->
     [start] the set of nodes departing.
     [q] query_tree
 *)
+*)
+val minimize_qtree : Table.query_tree -> Table.query_tree
+
+val eval_qtree : Naive_tree.t -> Naive_tree.node list ->Table.query_tree -> Naive_tree.node list