- match output with
- | None -> ()
- | Some f ->
-
- Printf.eprintf "Serializing results : ";
- time( fun () ->
- 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_char oc '\n') auto.result) ();
- end;
- Printf.eprintf "Total time : %fms\n Coherence : %i\n%!" (total_time())
+ if !Options.count_only then
+ failwith "Count only not implemented in this version"
+ else
+ let _ = Gc.set ({ Gc.get() with Gc.max_overhead = 1000000; Gc.space_overhead = 100 }) in
+ let result = time (if !Options.time then run_time auto else run auto) v in
+ Printf.eprintf "Number of nodes in the result set : %i\n" (TS.length result);
+ Printf.eprintf "\n%!";
+ begin
+ match output with
+ | None -> ()
+ | Some f ->
+ Printf.eprintf "Serializing results : ";
+ time( fun () ->
+ let oc = open_out f in
+ output_string oc "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n";
+ TS.rev_iter (fun t -> output_string oc "----------\n";
+ Tree.Binary.print_xml_fast oc t;
+ output_char oc '\n') result) ();
+ end;
+ end;
+ Printf.eprintf "Total running time : %fms\n%!" (total_time())