- let auto = time XPath.Compile.compile query in
- XPath.Ast.print Format.err_formatter query;
- Format.eprintf "\n%!";
-(* Format.eprintf "Internal rep of the tree is :\n%!";
- Tree.Binary.dump v; *)
- Printf.eprintf "Execution time : ";
- time (fun v -> ignore (TopDown.accept auto v)) v;
- Printf.eprintf "Number of nodes in the result set : %i\n" (BST.cardinal auto.result);
+ let auto,ltags,contains = time XPath.Compile.compile query in
+ let _ = Ata.dump Format.err_formatter auto in
+ let _ = Printf.eprintf "%!" in
+ let _ = match contains with
+ None -> ()
+ | Some s ->
+ let r = Tree.Binary.count v s
+ in
+ Printf.eprintf "Global count is %i, using " r;
+ if r < 60000 then begin
+ Printf.eprintf "TextCollection contains\nCalling global contains : ";
+ time (Tree.Binary.init_contains v) s
+ end
+ else begin
+ Printf.eprintf "Naive contains\nCalling global contains : ";
+ time (Tree.Binary.init_naive_contains v) s
+ end
+ in
+ Printf.eprintf "Execution time %s : " (if !Options.count_only then "(counting only)" else "");