3 val all_nodes : Naive_tree.t -> Naive_tree.node list
4 (** [all_nodes t] returns all the nodes in the tree [t].
5 Returns an empty list if there are no nodes in the tree.
8 val element_by_tag : Naive_tree.t -> QNameSet.t -> Naive_tree.node list
9 (** [element_by_tag t tag] returns all the nodes whose tag equal to [tag] in the tree [t]. *)
11 val compile_single_path : Xpath.Ast.single_path -> Table.query_tree
12 (** il y a un cycle si on met la definition de query_tree dans le fichier [Query_tree.ml]
13 [compile_single_path spath] returns un query_tree built with [spath]
16 val compile_xpath : Xpath.Ast.path -> Table.query_tree
17 (** [compile_xpath path] returns un query_tree built with [xpath]
20 val union_list : Naive_tree.t ->Naive_tree.node list -> Naive_tree.node list -> Naive_tree.node list
21 (** union two lists without duplicating
24 val inter_list : Naive_tree.t ->Naive_tree.node list -> Naive_tree.node list -> Naive_tree.node list
25 (** make a list without duplicating by using the intersection of two lists
28 val diff_list : Naive_tree.t ->Naive_tree.node list -> Naive_tree.node list -> Naive_tree.node list
29 (** difference two lists without duplicating
32 val eval_query_tree : Naive_tree.t -> Naive_tree.node list ->Table.query_tree -> Naive_tree.node list
33 (** [eval_query_tree tree start q] returns the set of nodes that evaluate by the query_tree [q].
34 [start] the set of nodes departing.