1 (******************************************************************************)
2 (* SXSI : XPath evaluator *)
3 (* Kim Nguyen (Kim.Nguyen@nicta.com.au) *)
4 (* Copyright NICTA 2008 *)
5 (* Distributed under the terms of the LGPL (see LICENCE) *)
6 (******************************************************************************)
11 external init_lib : unit -> unit = "sxsi_cpp_init"
13 exception CPlusPlusError of string
15 let () = Callback.register_exception "CPlusPlusError" (CPlusPlusError "")
19 type node = [ `Tree ] Node.t
24 external register_tag : tree -> string -> Tag.t = "caml_xml_tree_register_tag"
26 external tag_name : tree -> Tag.t -> string = "caml_xml_tree_get_tag_name"
28 let tag t = (); fun s ->
31 | "<@>" -> Tag.attribute
32 | "" -> Tag.document_node
33 | "<@$>" -> Tag.attribute_data
34 | _ -> register_tag t s
38 if t == Tag.pcdata then "<$>"
39 else if t == Tag.attribute_data then "<@$>"
40 else if t == Tag.attribute then "<@>"
41 else if t == Tag.nullt then "<!NIL!>"
48 Tag.to_string = to_string t;
49 Tag.translate = translate
55 external create : unit -> t = "caml_xml_tree_builder_create"
56 external open_document : t -> bool -> int -> bool -> int -> unit = "caml_xml_tree_builder_open_document"
57 external close_document : t -> tree = "caml_xml_tree_builder_close_document"
58 external open_tag : t -> string -> unit = "caml_xml_tree_builder_new_open_tag"
59 external close_tag : t -> string -> unit = "caml_xml_tree_builder_new_closing_tag"
60 external text : t -> string -> unit = "caml_xml_tree_builder_new_text"
66 (c == '\n' || c == '\t' || c == ' ') && loop len (i+1)
70 loop (String.length s) 0
74 let event_counter = ref 0 in
77 if !event_counter land 0xffffff == 0 then
78 Printf.eprintf "Current position: %i\n%!" (Expat.get_current_byte_index parser_))
81 if Buffer.length t > 0 then begin
82 let s = Buffer.contents t in
91 let output_attr b name value =
92 let atname = "<@>" ^ name in
99 let start_element_handler parser_ b t tag attr_list =
100 display_count parser_;
107 List.iter (fun (name, value) -> output_attr b name value) l;
111 let end_element_handler parser_ b t tag =
112 display_count parser_;
116 let character_data_handler parser_ _ t text =
117 display_count parser_;
118 Buffer.add_string t text
120 let create_parser () =
121 let buf = Buffer.create 512 in
122 let build = create () in
123 let parser_ = Expat.parser_create ~encoding:None in
127 Printf.eprintf "Finished Parsing\n%!";
128 Printf.eprintf "Started Index construction\n%!";
129 let r = close_document build in
130 Printf.eprintf "Finished Index construction\n%!";
133 Expat.set_start_element_handler parser_ (start_element_handler parser_ build buf);
134 Expat.set_end_element_handler parser_ (end_element_handler parser_ build buf);
135 Expat.set_character_data_handler parser_ (character_data_handler parser_ build buf);
136 Printf.eprintf "Started Parsing\n%!";
137 open_document build !Options.index_empty_texts !Options.sample_factor
138 !Options.disable_text_collection !Options.text_index_type;
143 let parser_, finalizer = create_parser () in
144 Expat.parse parser_ s;
147 let parse_file file =
148 let in_chan = open_in file in
149 let buffer = String.create 4096 in
150 let parser_, finalizer = create_parser () in
154 let read = input in_chan buffer 0 4096 in
155 if read == 0 then raise End_of_file else
156 Expat.parse_sub parser_ buffer 0 read;
160 | End_of_file -> close_in in_chan
170 type bit_vector = string
172 external bool_of_int : int -> bool = "%identity"
173 external int_of_bool : bool -> int = "%identity"
175 let bit_vector_unsafe_get v i =
177 (((Char.code (String.unsafe_get v (i lsr 3))) lsr (i land 7)) land 1)
178 let chr (c:int) : char = Obj.magic (c land 0xff)
179 let bit_vector_unsafe_set v i b =
181 let c = Char.code v.[j] in
182 let bit = int_of_bool b in
183 let mask = bit lsl (i land 7) in
184 if b then v.[j] <- chr (c lor mask) else v.[j] <- (chr (c land (lnot mask)))
186 let bit_vector_create n =
187 let len = if n <= 0 then 0 else (n - 1) / 8 + 1 in
188 String.make len '\000'
192 elements: Ptset.Int.t;
193 attributes: Ptset.Int.t;
194 attribute_array : Tag.t array;
195 children : Ptset.Int.t array;
196 siblings : Ptset.Int.t array;
197 descendants: Ptset.Int.t array;
198 followings: Ptset.Int.t array;
202 let tag_operations t = mk_tag_ops t.doc
204 external parse_xml_uri : string -> int -> bool -> bool -> int -> tree = "caml_call_shredder_uri"
205 external parse_xml_string : string -> int -> bool -> bool -> int -> tree = "caml_call_shredder_string"
207 external tree_print_xml_fast3 : tree -> [`Tree ] Node.t -> Unix.file_descr -> unit = "caml_xml_tree_print"
208 let print_xml t n fd =
209 tree_print_xml_fast3 t.doc n fd
212 external tree_save : tree -> Unix.file_descr -> string -> unit = "caml_xml_tree_save"
213 external tree_load : Unix.file_descr -> string -> bool -> int -> tree = "caml_xml_tree_load"
215 external nullt : unit -> 'a Node.t = "caml_xml_tree_nullt"
217 let nil : [`Tree ] Node.t = Node.nil
218 let root : [`Tree ] Node.t = Node.null
222 external unordered_set_alloc : int -> unordered_set = "caml_unordered_set_alloc"
223 external unordered_set_length : unordered_set -> int = "caml_unordered_set_length"
224 external unordered_set_insert : unordered_set -> int -> unit = "caml_unordered_set_set" "noalloc"
226 module HPtset = Hashtbl.Make(Ptset.Int)
228 let vector_htbl = HPtset.create MED_H_SIZE
230 let unordered_set_of_set s =
232 HPtset.find vector_htbl s
235 let v = unordered_set_alloc (Ptset.Int.cardinal s) in
236 let _ = Ptset.Int.iter (fun e -> unordered_set_insert v e) s in
237 HPtset.add vector_htbl s v; v
239 let ptset_to_vector = unordered_set_of_set
241 (** tree interface *)
243 external tree_root : tree -> [`Tree] Node.t = "caml_xml_tree_root" "noalloc"
246 external tree_first_child : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_first_child" "noalloc"
247 let first_child t n = tree_first_child t.doc n
249 external tree_first_element : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_first_element" "noalloc"
250 let first_element t n = tree_first_element t.doc n
252 external tree_tagged_child : tree -> [`Tree] Node.t -> Tag.t -> [`Tree] Node.t = "caml_xml_tree_tagged_child" "noalloc"
253 let tagged_child t n tag = tree_tagged_child t.doc n tag
255 external tree_select_child : tree -> [`Tree ] Node.t -> unordered_set -> [`Tree] Node.t = "caml_xml_tree_select_child" "noalloc"
256 let select_child t n tag_set = tree_select_child t.doc n tag_set
258 external tree_last_child : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_last_child" "noalloc"
259 let last_child t n = tree_last_child t.doc n
262 external tree_next_sibling : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_next_sibling" "noalloc"
263 let next_sibling t n = tree_next_sibling t.doc n
265 external tree_next_element : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_next_element" "noalloc"
266 let next_element t n = tree_next_element t.doc n
268 external tree_next_node_before : tree -> [`Tree] Node.t -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_next_node_before" "noalloc"
269 let next_node_before t n ctx = tree_next_node_before t.doc n ctx
271 external tree_tagged_following_sibling : tree -> [`Tree] Node.t -> Tag.t -> [`Tree] Node.t = "caml_xml_tree_tagged_following_sibling" "noalloc"
272 let tagged_following_sibling t n tag = tree_tagged_following_sibling t.doc n tag
274 external tree_select_following_sibling : tree -> [`Tree ] Node.t -> unordered_set -> [`Tree] Node.t = "caml_xml_tree_select_following_sibling" "noalloc"
275 let select_following_sibling t n tag_set = tree_select_following_sibling t.doc n tag_set
277 external tree_prev_sibling : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_prev_sibling" "noalloc"
278 let prev_sibling t n = tree_prev_sibling t.doc n
282 external tree_tagged_descendant : tree -> [`Tree ] Node.t -> Tag.t -> [`Tree ] Node.t = "caml_xml_tree_tagged_descendant" "noalloc"
283 let tagged_descendant t n tag = tree_tagged_descendant t.doc n tag
285 external tree_tagged_next : tree -> [`Tree ] Node.t -> Tag.t -> [`Tree ] Node.t = "caml_xml_tree_tagged_next" "noalloc"
286 let tagged_next t n tag = tree_tagged_next t.doc n tag
288 external tree_select_descendant : tree -> [`Tree ] Node.t -> unordered_set -> [`Tree] Node.t = "caml_xml_tree_select_descendant" "noalloc"
289 let select_descendant t n tag_set = tree_select_descendant t.doc n tag_set
291 external tree_tagged_following_before : tree -> [`Tree ] Node.t -> Tag.t -> [`Tree ] Node.t -> [`Tree ] Node.t = "caml_xml_tree_tagged_following_before" "noalloc"
292 let tagged_following_before t n tag ctx = tree_tagged_following_before t.doc n tag ctx
294 external tree_select_following_before : tree -> [`Tree ] Node.t -> unordered_set -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_select_following_before" "noalloc"
295 let select_following_before t n tag_set ctx = tree_select_following_before t.doc n tag_set ctx
297 external tree_parent : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_parent" "noalloc"
298 let parent t n = tree_parent t.doc n
300 external tree_binary_parent : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_binary_parent"
302 let binary_parent t n = tree_binary_parent t.doc n
305 external tree_tag : tree -> [`Tree] Node.t -> Tag.t = "caml_xml_tree_tag" "noalloc"
306 let tag t n = tree_tag t.doc n
308 external tree_is_first_child : tree -> [ `Tree ] Node.t -> bool = "caml_xml_tree_is_first_child" "noalloc"
309 let is_first_child t n = tree_is_first_child t.doc n
311 external tree_is_right_descendant : tree -> [ `Tree ] Node.t -> [`Tree] Node.t -> bool =
312 "caml_xml_tree_is_right_descendant" "noalloc"
314 let is_right_descendant t n1 n2 = tree_is_right_descendant t.doc n1 n2
317 let node_tags t = Ptset.Int.add Tag.document_node t.descendants.(Tag.document_node)
319 let attribute_tags t = t.attributes
321 let element_tags t = t.elements
324 t.children.(tag), t.descendants.(tag), t.siblings.(tag), t.followings.(tag)
327 let dump_tag_table t =
328 eprintf "Child tags:\n%!";
330 (fun tag set -> eprintf "%s: %a\n%!"
331 (Tag.to_string tag) TagSet.print (TagSet.inj_positive set))
333 eprintf "-----------------------------\n%!";
334 eprintf "Descendant tags:\n%!";
336 (fun tag set -> eprintf "%s: %a\n%!"
337 (Tag.to_string tag) TagSet.print (TagSet.inj_positive set))
339 eprintf "-----------------------------\n%!";
340 eprintf "Sibling tags:\n%!";
342 (fun tag set -> eprintf "%s: %a\n%!"
343 (Tag.to_string tag) TagSet.print (TagSet.inj_positive set))
345 eprintf "-----------------------------\n%!";
346 eprintf "Following tags:\n%!";
348 (fun tag set -> eprintf "%s: %a\n%!"
349 (Tag.to_string tag) TagSet.print (TagSet.inj_positive set))
351 eprintf "-----------------------------\n%!"
354 external tree_subtree_tags : tree -> [`Tree] Node.t -> Tag.t -> int = "caml_xml_tree_subtree_tags" "noalloc"
355 let subtree_tags t n tag = tree_subtree_tags t.doc n tag
357 external tree_subtree_size : tree -> [`Tree] Node.t -> int = "caml_xml_tree_subtree_size" "noalloc"
358 let subtree_size t n = tree_subtree_size t.doc n
360 let subtree_elements t node =
361 let size = tree_subtree_size t.doc node - 1 in
363 else let size = size - (tree_subtree_tags t.doc node Tag.pcdata) in
364 if size < 2 then size else
365 let acc = ref size in
366 for i = 0 to Array.length t.attribute_array - 1 do
367 acc := !acc - tree_subtree_tags t.doc node t.attribute_array.(i)
371 external tree_closing : tree -> [`Tree] Node.t -> [`Tree] Node.t = "caml_xml_tree_closing" "noalloc"
372 let closing t n = tree_closing t.doc n
374 external tree_num_tags : tree -> int = "caml_xml_tree_num_tags" "noalloc"
375 let num_tags t = tree_num_tags t.doc
377 external tree_size : tree -> int = "caml_xml_tree_size" "noalloc"
378 let size t = tree_size t.doc
383 let rec loop left node acc_d total_d num_leaves =
385 (acc_d+total_d,if left then num_leaves+1 else num_leaves)
387 let d,td = loop true (tree_first_child tree node) (acc_d+1) total_d num_leaves in
388 loop false (tree_next_sibling tree node) (acc_d) d td
390 let a,b = loop true root 0 0 0
392 Printf.eprintf "Average depth: %f, number of leaves %i\n%!" ((float_of_int a)/. (float_of_int b)) b
400 external hash : t -> int = "%identity"
401 external uid : t -> Uid.t = "%identity"
402 external equal : t -> t -> bool = "%eq"
403 external make : t -> int = "%identity"
404 external node : t -> int = "%identity"
405 external stats : unit -> unit = "%identity"
408 let to_ptset s = fold (Ptset.Int.add) s Ptset.Int.empty
412 Hashtbl.Make(struct type t = TagS.t * TagS.t
414 HASHINT2(Uid.to_int x.TagS.Node.id,
415 Uid.to_int y.TagS.Node.id)
422 Hashtbl.Make(struct type t = Tag.t * TagS.t
424 HASHINT2(x, Uid.to_int y.TagS.Node.id)
431 let add_cache = TagTSCache.create 1023
432 let union_cache = TSTSCache.create 1023
433 let subset_cache = TSTSCache.create 1023
436 TSTSCache.clear union_cache;
437 TSTSCache.clear subset_cache;
438 TagTSCache.clear add_cache
441 (x == y) || (x == TagS.empty) ||
442 if y == TagS.empty then false
446 TSTSCache.find subset_cache key
449 let z = TagS.subset x y in
450 TSTSCache.add subset_cache key z; z
452 let order ((x, y) as z) =
453 if x.TagS.Node.id <= y.TagS.Node.id then z
457 if _subset x y then y
458 else if _subset y x then x
460 let key = order (x, y) in
462 TSTSCache.find union_cache key
465 let z = TagS.union x y in
466 TSTSCache.add union_cache key z; z
471 TagTSCache.find add_cache key
474 let z = TagS.add t s in
475 TagTSCache.add add_cache key z;z
477 let child_sibling_labels tree =
478 let table_c = Array.create (tree_num_tags tree) TagS.empty in
479 let table_n = Array.copy table_c in
481 if node == nil then TagS.empty
483 let children = loop (tree_first_child tree node) in
484 let tag = tree_tag tree node in
486 let tc = table_c.(tag) in
487 if _subset children tc then ()
488 else table_c.(tag) <- _union tc children
490 let siblings = loop (tree_next_sibling tree node) in
492 let tn = table_n.(tag) in
493 if _subset siblings tn then ()
494 else table_n.(tag) <- _union tn siblings
501 let descendant_labels tree =
502 let table_d = Array.create (tree_num_tags tree) TagS.empty in
504 if node == nil then TagS.empty else
505 let d1 = loop (tree_first_child tree node) in
506 let d2 = loop (tree_next_sibling tree node) in
507 let tag = tree_tag tree node in
509 let td = table_d.(tag) in
510 if _subset d1 td then ()
511 else table_d.(tag) <- _union td d1;
513 _add tag (_union d1 d2)
518 let collect_labels tree =
519 let table_f = Array.create (tree_num_tags tree) TagS.empty in
520 let table_n = Array.copy table_f in
521 let table_c = Array.copy table_f in
522 let table_d = Array.copy table_f in
523 let rec loop node foll_siblings descendants followings =
524 if node == nil then foll_siblings, descendants, followings else
525 let tag = tree_tag tree node in
527 let tf = table_f.(tag) in
528 if _subset followings tf then ()
529 else table_f.(tag) <- _union tf followings in
531 let tn = table_n.(tag) in
532 if _subset foll_siblings tn then ()
533 else table_n.(tag) <- _union tn foll_siblings in
534 let children, n_descendants, n_followings =
535 loop (tree_last_child tree node) TagS.empty TagS.empty followings
538 let tc = table_c.(tag) in
539 if _subset children tc then ()
540 else table_c.(tag) <- _union tc children
543 let td = table_d.(tag) in
544 if _subset n_descendants td then ()
545 else table_d.(tag) <- _union td n_descendants
547 loop (tree_prev_sibling tree node)
548 (_add tag foll_siblings)
549 (_add tag (_union n_descendants descendants))
550 (_add tag n_followings)
552 ignore (loop root TagS.empty TagS.empty TagS.empty);
553 table_f, table_n, table_c, table_d
556 let is_nil t = t == nil
557 let is_node t = t != nil
558 let is_root t = t == root
561 eprintf "Initializing tag structure\n%!";
562 let _ = Tag.init (mk_tag_ops t) in
563 eprintf "Starting tag table construction\n%!";
564 let f, n, c, d = time collect_labels t ~msg:"Building tag relationship table" in
565 let c = Array.map TagS.to_ptset c in
566 let n = Array.map TagS.to_ptset n in
567 let f = Array.map TagS.to_ptset f in
568 let d = Array.map TagS.to_ptset d in
569 let () = clear_cache () in
570 let attributes = Ptset.Int.add Tag.attribute d.(Tag.attribute) in
571 let elements = Ptset.Int.add Tag.document_node
572 (Ptset.Int.remove Tag.pcdata
573 (Ptset.Int.diff d.(Tag.document_node) attributes))
576 attributes = attributes;
577 attribute_array = Array.of_list (Ptset.Int.elements attributes);
587 let parse_xml_uri str = node_of_t (TreeBuilder.parse_file str)
588 let parse_xml_string str = node_of_t (TreeBuilder.parse_string str)
590 let size t = tree_size t.doc;;
592 let magic_string = "SXSI_INDEX"
593 let version_string = "3"
596 Unix.lseek fd 0 Unix.SEEK_CUR
598 let pr_pos fd = Printf.eprintf "At position %i\n%!" (pos fd)
601 let sl = String.length s in
602 let ssl = Printf.sprintf "%020i" sl in
603 ignore (Unix.write fd ssl 0 20);
604 ignore (Unix.write fd s 0 (String.length s))
606 let rec really_read fd buffer start length =
607 if length <= 0 then () else
608 match Unix.read fd buffer start length with
609 0 -> raise End_of_file
610 | r -> really_read fd buffer (start + r) (length - r);;
613 let buffer = String.create 20 in
614 let _ = really_read fd buffer 0 20 in
615 let size = int_of_string buffer in
616 let buffer = String.create size in
617 let _ = really_read fd buffer 0 size in
620 let save_tag_table channel t =
621 let t = Array.map (fun s -> Array.of_list (Ptset.Int.elements s)) t in
622 Marshal.to_channel channel t []
625 let fd = Unix.openfile str [ Unix.O_WRONLY;Unix.O_TRUNC;Unix.O_CREAT] 0o644 in
626 let out_c = Unix.out_channel_of_descr fd in
627 let index_prefix = Filename.chop_suffix str ".srx" in
628 let _ = set_binary_mode_out out_c true in
629 output_string out_c magic_string;
630 output_char out_c '\n';
631 output_string out_c version_string;
632 output_char out_c '\n';
633 save_tag_table out_c t.children;
634 save_tag_table out_c t.siblings;
635 save_tag_table out_c t.descendants;
636 save_tag_table out_c t.followings;
637 (* we need to move the fd to the correct position *)
639 ignore (Unix.lseek fd (pos_out out_c) Unix.SEEK_SET);
640 tree_save t.doc fd index_prefix;
643 let load_tag_table channel =
644 let table : int array array = Marshal.from_channel channel in
645 Array.map (fun a -> Ptset.Int.from_list (Array.to_list a)) table
647 let load ?(sample=64) ?(load_text=true) str =
648 let fd = Unix.openfile str [ Unix.O_RDONLY ] 0o644 in
649 let in_c = Unix.in_channel_of_descr fd in
650 let index_prefix = Filename.chop_suffix str ".srx" in
651 let _ = set_binary_mode_in in_c true in
653 (let ms = input_line in_c in if ms <> magic_string then failwith "Invalid index file");
654 (let vs = input_line in_c in if vs <> version_string then failwith "Invalid version file");
655 let c = load_tag_table in_c in
656 let s = load_tag_table in_c in
657 let d = load_tag_table in_c in
658 let f = load_tag_table in_c in
661 let c, s, d, f = time ~msg:"Loading tag table"(load_table) () in
662 ignore(Unix.lseek fd (pos_in in_c) Unix.SEEK_SET);
663 let xml_tree = tree_load fd index_prefix load_text sample in
664 let () = Tag.init (Obj.magic xml_tree) in
665 let attributes = Ptset.Int.add Tag.attribute d.(Tag.attribute) in
666 let elements = Ptset.Int.add Tag.document_node
667 (Ptset.Int.remove Tag.pcdata
668 (Ptset.Int.diff d.(Tag.document_node) attributes))
670 let tree = { doc = xml_tree;
671 attributes = attributes;
672 attribute_array = Array.of_list (Ptset.Int.elements attributes);
685 let equal a b = a == b
689 | i -> Printf.sprintf "Node (%i)" i
691 let dump_node t = nts (Node.to_int t)
695 type query_result = { bv : bit_vector;
699 external tree_flush : tree -> Unix.file_descr -> unit = "caml_xml_tree_flush"
700 let flush t fd = tree_flush t.doc fd
702 external text_prefix : tree -> string -> bool -> query_result = "caml_text_collection_prefix_bv"
703 let text_prefix t s b = text_prefix t.doc s b
705 external text_suffix : tree -> string -> bool -> query_result = "caml_text_collection_suffix_bv"
706 let text_suffix t s b = text_suffix t.doc s b
708 external text_equals : tree -> string -> bool -> query_result = "caml_text_collection_equals_bv"
709 let text_equals t s b = text_equals t.doc s b
711 external text_contains : tree -> string -> bool -> query_result = "caml_text_collection_contains_bv"
712 let text_contains t s b = text_contains t.doc s b
715 module Predicate = Hcons.Make (
718 type t = (_t -> node -> bool) ref
719 let hash t = Hashtbl.hash t
720 let equal t1 t2 = t1 == t2
723 let string_of_query query =
725 | `Prefix -> "starts-with"
726 | `Suffix -> "ends-with"
727 | `Equals -> "equals"
728 | `Contains -> "contains"
731 let query_fun = function
732 | `Prefix -> text_prefix
733 | `Suffix -> text_suffix
734 | `Equals -> text_equals
735 | `Contains -> text_contains
738 let _pred_cache = Hashtbl.create 17
740 let mk_pred query s =
741 let f = query_fun query in
742 let memo = ref (fun _ _ -> failwith "Undefined") in
743 memo := begin fun tree node ->
745 try Hashtbl.find _pred_cache (query,s) with
747 time ~count:1 ~msg:(Printf.sprintf "Computing text query %s(%s)"
748 (string_of_query query) s)
751 let bv = results.bv in
752 memo := begin fun _ n ->
754 bit_vector_unsafe_get bv (Node.to_int n)
756 D_TRACE_(Printf.eprintf "Result of memoized call to query %s is %b for node %i\n" s b (Node.to_int n));
759 let b = bit_vector_unsafe_get bv (Node.to_int node) in
760 D_TRACE_(Printf.eprintf "Result is %b for node %i\n" b (Node.to_int node));
766 let full_text_prefix t s = (text_prefix t s true).pos
768 let full_text_suffix t s = (text_suffix t s true).pos
770 let full_text_equals t s = (text_equals t s true).pos
772 let full_text_contains t s = (text_contains t s true).pos
774 let full_text_query q t s =
775 let res = (query_fun q) t s true in
776 Hashtbl.replace _pred_cache (q,s) res;