-
-let rec eval_query_tree tree start q =
- let resultat =
- begin
- try
- Hashtbl.find table_query_tree q
- with Not_found ->
- let res =
- match q.desc with
- | Start -> start
- | Dom -> all_nodes tree
- | Tag (t,k) -> element_by_tag tree t k
- | Axis (a,q1) -> let ls = eval_query_tree tree start q1 in
- eval_axis tree ls a
- | Binop (op,q1,q2)-> begin
- let ls1 = eval_query_tree tree start q1 in
- let ls2 = eval_query_tree tree start q2 in
- match op with
- | Union -> union_list tree ls1 ls2
- | Inter -> inter_list tree ls1 ls2
- | Diff -> diff_list tree ls1 ls2
- end
- in
- let res = List.sort (Table.compare_node tree) res in
- Hashtbl.add table_query_tree q res;
- compteur := !compteur + (List.length res);
- res
- end
- in
- debug tree q resultat;
- resultat
-