val merge : merge_conf -> elt -> t -> t -> t
val mk_quick_tag_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> Tag.t -> (elt -> elt -> 'a*t array)
val mk_quick_star_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> (elt -> elt -> 'a*t array)
+
end
module Integer : ResultSet =
let mk_quick_star_loop _ sl ss tree = ();
fun t ctx ->
(sl, Array.make ss (Tree.subtree_elements tree t))
-
+
end
module IdSet : ResultSet=
let _ = Printf.eprintf "Number of nodes %i\n%!" (Tree.size v) in
(* let _ = test_text v in *)
(* let _ = Tree.stats v in *)
-(* let _ = Printf.eprintf "Timing first_child/next_sibling %!" in *)
-(* let _ = time ~count:1 (Tree.benchmark_fcns) v in *)
+ let _ = Printf.eprintf "Timing first_child/next_sibling %!" in
+ let _ = time ~count:3 (Tree.benchmark_fcns) v in
(* let _ = Printf.eprintf "Timing last_child/prev_sibling %!" in
let _ = time (Tree.benchmark_lcps) v in
let _ = Printf.eprintf "Timing jump to a %!" in