+ 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 "\nTiming first_child/next_sibling on sxsi %!" in
+ let c = time (Tree.benchmark_fcns) v in
+ let _ = Printf.eprintf "Traversed %i nodes\n" c in
+ let _ = Printf.eprintf "\nTiming first_element/next_element on sxsi %!" in
+ let c = time (Tree.benchmark_fene) v in
+ let _ = Printf.eprintf "Traversed %i nodes\n" c in
+ let _ = Printf.eprintf "\nTiming last_child/prev_sibling on sxsi %!" in
+ let _ = time (Tree.benchmark_lcps) v in
+ let tag = "keyword" in
+ let _ = Printf.eprintf "\nTiming jump to <%s> on sxsi %!" tag in
+ let _ = time (Tree.benchmark_jump v) (Tag.tag tag) in
+ (* let _ = Printf.eprintf "\nTiming pointer allocation (preorder) %!" in
+ let pointers = time (build_pointers v) PREORDER in
+ let _ = Printf.eprintf "\nTiming pointer iteration %!" in
+ let i = time (iter_pointers) pointers in
+ let _ = Printf.eprintf "Traversed %i pointers\nTiming pointer deallocation %!" i in
+ let _ = time (free_pointers) pointers in
+
+
+ let _ = Printf.eprintf "\nTiming pointer allocation (inorder) %!" in
+ let pointers = time (build_pointers v) INORDER in
+ let _ = Printf.eprintf "\nTiming pointer iteration %!" in
+ let i = time (iter_pointers) pointers in
+ let _ = Printf.eprintf "Traversed %i pointers\nTiming pointer deallocation %!" i in
+ let _ = time (free_pointers) pointers in
+
+ let _ = Printf.eprintf "\nTiming pointer allocation (postorder) %!" in
+ let pointers = time (build_pointers v) POSTORDER in
+ let _ = Printf.eprintf "\nTiming pointer iteration %!" in
+ let i = time (iter_pointers) pointers in
+ let _ = Printf.eprintf "Traversed %i pointers\nTiming pointer deallocation %!" i in
+ let _ = time (free_pointers) pointers in *)
+
+ let _ = Printf.eprintf "\nTiming iterative_traversal on sxsi %!" in
+ let c = time (Tree.benchmark_iter) v in
+ let _ = Printf.eprintf "Traversed %i nodes\n" c in
+
+
+
+
+
+
+(* let _ = Printf.eprintf "Timing //keyword :" in