-
-
-
-let rec compare_query_tree q1 q2 =
- q1.id==q2.id|| match q1.desc,q2.desc with
- | Binop(op1,qt1,qt2),Binop(op2,qt3,qt4)->op1==op2&& ((compare_query_tree qt1 qt3 && compare_query_tree qt2 qt4)
- || (compare_query_tree qt1 qt4 && compare_query_tree qt2 qt3))
- | Axis(a1,qt1),Axis(a2,qt2) -> compare_axis a1 a2 && compare_query_tree qt1 qt2
- | Tag(t1,k1),Tag(t2,k2) ->t1==t2&& k1==k2
- | Dom,Dom | Start,Start ->true
- | _,_ ->false
-
-and compare_axis a1 a2 =
- match a1,a2 with
- Self ,Self | Attribute, Attribute | Child , Child | Parent , Parent
- | FollowingSibling , FollowingSibling
- | PrecedingSibling , PrecedingSibling
- | Preceding , Preceding | Following , Following -> true
- | Descendant b1, Descendant b2 -> b1==b2
- | Ancestor b1, Ancestor b2 -> b1==b2
- | _,_ -> false
-
-
-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
-