X-Git-Url: http://git.nguyen.vg/gitweb/?p=tatoo.git;a=blobdiff_plain;f=src%2Ftable.ml;fp=src%2Ftable.ml;h=91bb85e87c90e3e05756a133adecf75a0ec2bb5a;hp=f6e7749b1427200a38ec07f7ccc485637472c90c;hb=1340a75b9441bac6cbd54c30bd214664ee11a8ed;hpb=29eaf0ea22dbf0a169d7e6e8619a2f21d358d873

diff --git a/src/table.ml b/src/table.ml
index f6e7749..91bb85e 100644
--- a/src/table.ml
+++ b/src/table.ml
@@ -17,14 +17,14 @@ and op = Union | Inter | Diff
   parametres : tree  l'arbre xml
                n     un noeud
                m     move   
-  retour :un noeud qui correspond à la relation r
+  retour :un noeud qui correspond ॆ la relation r
 *)
 
 let print_node_list tree l =
   List.iter (fun node ->
-    Naive_tree.print_xml stdout tree node
-  ) l;
-  print_newline() 
+    Naive_tree.print_xml stdout tree node;
+    print_newline() 
+  ) l
 
 let rec print_query_tree fmt q =
   match q with
@@ -57,7 +57,7 @@ let rec eval_relation tree m n =
   parametres : tree  l'arbre xml
                ls    l'ensemble de noeuds
                m     move   
-  retour : l'ensemble de noeuds qui correspondent à la relation r
+  retour : l'ensemble de noeuds qui correspondent ॆ la relation r
 *)
 
 
@@ -75,7 +75,7 @@ let rec eval_move tree ls m =
   parametres : tree  l'arbre xml
                ls    l'ensemble de noeuds
                m     move   
-  retour : l'ensemble de noeuds qui correspondent à des relations lr
+  retour : l'ensemble de noeuds qui correspondent ॆ des relations lr
 *)
 
 and eval_star tree ls lr =
@@ -100,7 +100,7 @@ and eval_star tree ls lr =
   parametres : tree  l'arbre xml
                ls    l'ensemble de noeuds
                a     axis   
-  retour : l'ensemble de noeuds qui correspondent à l'axe
+  retour : l'ensemble de noeuds qui correspondent ॆ l'axe
 *)
 
 let keep_elements t l =
@@ -110,7 +110,7 @@ let keep_elements t l =
 let rec eval_axis tree ls a =
   let open Xpath.Ast in
       let res =
-     (* let ls =  List.sort ( fun a b -> compare (Naive_tree.preorder tree a ) (Naive_tree.preorder tree b ) ) ls in écrir  dans la log!!!!!*)
+     (* let ls =  List.sort ( fun a b -> compare (Naive_tree.preorder tree a ) (Naive_tree.preorder tree b ) ) ls in ़crir  dans la log!!!!!*)
 	match a with
 	    Self -> ls