projects
/
tatoo.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
supprimer (List.rev p) dans la fonction compile_path_rev
[tatoo.git]
/
src
/
table.ml
diff --git
a/src/table.ml
b/src/table.ml
index
f6e7749
..
91bb85e
100644
(file)
--- 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
parametres : tree l'arbre xml
n un noeud
m move
- retour :un noeud qui correspond à la relation r
+ retour :un noeud qui correspond à
¥
\86
la relation r
*)
let print_node_list tree l =
List.iter (fun node ->
*)
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
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
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 à
¥
\86
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
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 à
¥
\86
des relations lr
*)
and eval_star tree ls 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
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 à
¥
\86
l'axe
*)
let keep_elements t l =
*)
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 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
match a with
Self -> ls