(******************************************************************************)
open Ata
+INCLUDE "utils.ml"
+let () = init_timer();;
-let l = ref [] ;;
-let time f x =
- let t1 = Unix.gettimeofday () in
- let r = f x in
- let t2 = Unix.gettimeofday () in
- let t = (1000. *. (t2 -. t1)) in
- l:= t::!l;
- Printf.eprintf " %fms\n%!" t ;
- r
-;;
-let total_time () = List.fold_left (+.) 0. !l;;
let enabled_gc = Gc.get()
let disabled_gc = { Gc.get() with
Gc.max_overhead = 1000000;
Gc.space_overhead = 100 }
+
+
+
+
let main v query_string output =
+
let _ = Tag.init (Tree.tag_pool v) in
Printf.eprintf "Parsing query : ";
let query = try
let auto,ltags,contains = time (XPath.Compile.compile ~querystring:query_string) query in
let _ = Ata.dump Format.err_formatter auto in
let _ = Printf.eprintf "%!" in
- let jump_to =
+ let jump_to =
match contains with
None -> (max_int,`NOTHING)
| Some s ->
time (Tree.init_naive_contains v) s
end;(r,`CONTAINS(s))
in
+ let test_list = jump_to in
+ (*
let test_list =
if (!Options.backward) then begin
Printf.eprintf "Finding min occurences : ";
else acc) jump_to) ltags
end
else (max_int,`NOTHING)
- in
+ in*)
let _ = if (snd test_list) != `NOTHING then
let occ,s1,s2 = match test_list with
| (x,`TAG (tag)) -> (x, "tag", (Tag.to_string tag))
in ()
else
let result = time (top_down auto) v in
- let rcount = IdSet.length result in
+ let rcount = GResult.length result in
Printf.eprintf "Number of nodes in the result set : %i\n" rcount;
Printf.eprintf "\n%!";
begin
time( fun () ->
let oc = open_out f in
output_string oc "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n";
- IdSet.iter (fun t ->
+ GResult.iter (fun t ->
Tree.print_xml_fast oc v t;
output_char oc '\n';
Options.parse_cmdline();;
-let v =
+let v =
if (Filename.check_suffix !Options.input_file ".srx")
then
begin