10 val var : (int*State.t) -> t
11 val close : ((int*State.t), t) Hashtbl.t -> t -> t
12 val is_open : t -> bool
13 val singleton : elt -> t
14 val cons : elt -> t -> t
15 val snoc : t -> elt -> t
16 val concat : t -> t -> t
17 val concat3 : t -> t -> t -> t
18 val concat4 : t -> t -> t -> t -> t
19 val conscat : elt -> t -> t -> t
20 val conscat3 : elt -> t -> t -> t -> t
21 val conscat4 : elt -> t -> t -> t -> t -> t
22 val subtree_tags : Tree.t -> elt -> Tag.t -> t
23 val subtree_elements : Tree.t -> elt -> t
24 val iter : ( elt -> unit) -> t -> unit
25 val fold : ( elt -> 'a -> 'a) -> t -> 'a -> 'a
27 val serialize : string -> bool -> Tree.t -> t -> unit
31 module Count : S with type t = int =
43 let concat x y = x + y
44 let concat3 x y z = x + y + z
45 let concat4 x y z t = x + y + z + t
46 let conscat _ x y = 1 + x + y
47 let conscat3 _ x y z = 1 + x + y + z
48 let conscat4 _ x y z t = 1 + x + y + z + t
49 let subtree_tags tree node tag = Tree.subtree_tags tree node tag
50 let subtree_elements tree node = Tree.subtree_elements tree node
51 let iter _ _ = failwith "iter not implemented"
52 let fold _ _ _ = failwith "fold not implemented"
53 let map _ _ = failwith "map not implemented"
55 let serialize f b _ x =
57 if not b then output_string o "<xml_result>\n";
58 output_string o (string_of_int x);
60 if not b then output_string o "</xml_result>\n";
66 | Cons of Tree.node * clist
67 | Concat of clist * clist
68 | ConsCat of Tree.node * clist * clist
69 | SubtreeTags of Tree.t * Tree.node * Tag.t
70 | SubtreeElts of Tree.t * Tree.node
73 type 'a mat = { mutable clist : clist;
74 mutable length : int }
76 module Mat : S with type t = Tree.node mat =
78 type t = Tree.node mat
81 let empty = { clist = Nil; length = 0 }
82 let singleton e = { clist = Cons(e, Nil) ; length = 1 }
83 let cons e l = { clist = Cons(e, l.clist); length = l.length + 1 }
85 let ll1 = l1.length in
86 if ll1 == 0 then l2 else
87 let ll2 = l2.length in if ll2 == 0 then l1 else
88 { clist = Concat(l1.clist, l2.clist); length = ll1 + ll2 }
90 let snoc l e = concat l (singleton e)
91 let concat3 l1 l2 l3 = concat l1 (concat l2 l3)
92 let concat4 l1 l2 l3 l4 = concat (concat l1 l2) (concat l3 l4)
98 let ll1 = l1.length in
99 if ll1 == 0 then cons e l2 else
100 let ll2 = l2.length in if ll2 == 0 then cons e l1 else
101 { clist = ConsCat(e, l1.clist, l2.clist); length = 1 + ll1 + ll2 }
103 (* let conscat e l1 l2 = cons e (concat l1 l2) *)
105 let conscat3 e l1 l2 l3 = conscat e l1 (concat l2 l3)
106 let conscat4 e l1 l2 l3 l4 = conscat e l1 (concat l2 (concat l3 l4))
108 let subtree_tags tree node tag =
109 let len = Tree.subtree_tags tree node tag in
110 if len == 0 then empty
112 { clist = SubtreeTags(tree, node, tag);
115 let subtree_elements tree node =
116 let len = Tree.subtree_elements tree node in
117 if len == 0 then empty
119 { clist = SubtreeElts(tree, node);
122 let fst_tagged tree t tag =
123 if Tree.tag tree t == tag then t
124 else Tree.tagged_descendant tree t tag
127 let fst_element tree t =
128 let tag = Tree.tag tree t in
129 if tag == Tag.document_node then
130 Tree.first_element tree t
134 let element_fold f tree t acc =
135 let rec loop node acc =
136 if node == Tree.nil then acc
138 let acc = f node acc in
139 let acc' = loop (Tree.first_element tree node) acc in
140 loop (Tree.next_element tree node) acc'
142 let t' = Tree.first_element tree t in loop t' acc
144 let element_iter f tree t =
145 let newf = fun e () -> f e in
146 element_fold newf tree t ()
148 let tag_fold f tree t tag acc =
149 let rec loop close node acc =
150 if node > Tree.nil && node < close then acc
152 let acc = f node acc in
153 loop close (Tree.tagged_next tree node tag) acc
155 let t' = fst_tagged tree t tag in
156 loop (Tree.closing tree t) t' acc
158 let tag_iter f tree t tag =
159 let rec loop close node =
160 if node > Tree.nil && node < close then begin
162 loop close (Tree.tagged_next tree node tag);
165 let t' = fst_tagged tree t tag in
166 loop (Tree.closing tree t) t'
172 | Cons(e, ll) -> loop ll (f e acc)
173 | Concat(l1, l2) -> loop l2 (loop l1 acc)
174 | ConsCat(e, l1, l2) -> loop l2 (loop l1 (f e acc))
175 | SubtreeTags(tree, t, tag) -> tag_fold f tree t tag acc
176 | SubtreeElts(tree, t) -> element_fold f tree t acc
184 | Cons(e, l) -> f e; loop l
185 | Concat(l1, l2) -> loop l1; loop l2
186 | ConsCat(e, l1, l2) -> f e; loop l1; loop l2
187 | SubtreeTags(tree, t, tag) -> tag_iter f tree t tag
188 | SubtreeElts(tree, t) ->
189 element_iter f tree t
193 let length l = l.length
195 let serialize name b v l =
197 if name = "-" then Unix.stdout, ignore
199 Unix.openfile name [ Unix.O_WRONLY; Unix.O_TRUNC; Unix.O_CREAT ] 0o666,
202 if not b then ignore (Unix.write fd "<xml_result>\n" 0 13);
203 if l.length > 0 then begin
204 iter (fun node -> Tree.print_xml v node fd) l;
207 if not b then ignore (Unix.write fd "</xml_result>\n" 0 14);
211 let rec debug_clist =
213 Nil -> Printf.eprintf "Nil"
215 Printf.eprintf "Cons(%i," (Obj.magic e);
218 | Concat(clist1, clist2) ->
219 Printf.eprintf "Concat(";
224 | ConsCat(_, clist1, clist2) ->
225 Printf.eprintf "Concat(";
231 | SubtreeTags(tree, node, tag) ->
232 Printf.eprintf "SubtreeTags(tree, %i, %s)"
235 | SubtreeElts(tree, node) ->
236 Printf.eprintf "SubtreeElts(tree, %i)"
239 let debug l = debug_clist l.clist
243 module Partial(N : S) : S =
247 type t = { env : ((int*State.t), t) Hashtbl.t;
252 | Var of (int * State.t)
255 | Concat of list * list
258 let dummy = Hashtbl.create 0
259 let empty = { env = dummy;
262 let is_open t = t.opened
267 Lambda { t with env = h; opened = false } }
269 let singleton i = { empty with elem = Cons(i, Nil) }
270 let cons e t = { t with elem = Cons(e, t.elem) }
272 { t1 with elem = Concat (t1.elem, t2.elem) }
274 let snoc t e = concat t (singleton e)
275 let concat3 t1 t2 t3 = concat t1 (concat t2 t3)
276 let concat4 t1 t2 t3 t4 = concat (concat t1 t2) (concat t3 t4)
277 let conscat e t1 t2 = cons e (concat t1 t2)
278 let conscat3 e t1 t2 t3 = cons e (concat3 t1 t2 t3)
279 let conscat4 e t1 t2 t3 t4 = cons e (concat4 t1 t2 t3 t4)
280 let subtree_tags _ = failwith "not implemented"
281 let subtree_elements _ = failwith "not_implemented"
285 loop_list t.env t.elem
286 and loop_list h = function
288 | Var i -> loop (Hashtbl.find h i)
289 | Cons (e, l) -> f e; loop_list h l
290 | Concat (l1, l2) -> loop_list h l1; loop_list h l2
297 loop_list t.env acc t.elem
298 and loop_list h acc = function
300 | Var i -> loop (try Hashtbl.find h i with Not_found -> let a,b = i in Printf.eprintf "%i,%i not found\n%!" a b; empty) acc
301 | Cons (e, l) -> loop_list h (f e acc) l
302 | Concat (l1, l2) -> loop_list h (loop_list h acc l1) l2
303 | Lambda t -> loop t acc
309 Hashtbl.iter (fun (i,j) t ->
310 Format.eprintf "%i, %a ->" i State.print j;
312 Format.eprintf "----------------\n%!";
315 and dump_list = function
317 | Var (i,j) -> Format.eprintf "Var(%i, %a) " i State.print j;
318 | Cons (e, l) -> Format.eprintf "%i " (Node.to_int e); dump_list l
319 | Concat (l1, l2) -> dump_list l1 ; dump_list l2
323 let length t = fold (fun _ acc -> 1 + acc) t 0
327 { empty with elem = Var i; opened = true }
329 let serialize _ = failwith "not implemented"