;;
let total_time () = List.fold_left (+.) 0. !l;;
-let test filename query output =
- Printf.eprintf "Parsing document : %!";
- let v = time Tree.Binary.parse_xml_uri filename in
- Tree.Binary.print_xml_fast stderr v
-
let main filename query output =
Printf.eprintf "Parsing document : %!";
MM(v,__LOCATION__);
a := Some (v);
a := None;
- Tree.Binary.print_xml_fast stderr v;
Printf.eprintf "Parsing query : ";
let query = try
time
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 "TopDown (No BackTrack) : \n";
time (fun v -> ignore (TopDown.accept auto v)) v;
- P(Printf.eprintf "Max states in TopDownNOBT : %i\n%!" auto.max_states);
+ Printf.eprintf "Number of nodes in the result set : %i\n" (BST.cardinal auto.result);
begin
- match output with
+ match output with
| None -> ()
| Some f ->
let oc = open_out f in
output_string oc "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n";
BST.iter (fun t -> Tree.Binary.print_xml_fast oc t;
- output_string oc "\n------------------";
- output_char oc '\n') auto.result) ();
+ output_char oc '\n') auto.result) ();
end;
Printf.eprintf "Total time : %fms\n Coherence : %i\n%!" (total_time())
;;
-
let argc = Array.length Sys.argv;;
if (argc < 3 || argc >4)
then
;;
-test Sys.argv.(1) Sys.argv.(2) (if argc == 4 then Some Sys.argv.(3) else None) ;;
+main Sys.argv.(1) Sys.argv.(2) (if argc == 4 then Some Sys.argv.(3) else None) ;;
+
+Printf.eprintf "\n=================================================\nDEBUGGING\n%!";
+Tree.DEBUGTREE.print_stats Format.err_formatter;;
+