383 |
compute_stats (); |
compute_stats (); |
384 |
let len = Array.length ngood_propositions in |
let len = Array.length ngood_propositions in |
385 |
buf_int buf len; |
buf_int buf len; |
|
if !verbose_redirector then lprintf_n () "Stats:"; |
|
386 |
for i = 0 to len - 1 do |
for i = 0 to len - 1 do |
|
if !verbose_redirector then lprintf_nl2 " Good[%d] = %Ld\n" i ngood_propositions.(i); |
|
|
if !verbose_redirector then lprintf_nl2 " Bad[%d] = %Ld\n" i nbad_propositions.(i); |
|
387 |
buf_int64 buf ngood_propositions.(i); |
buf_int64 buf ngood_propositions.(i); |
388 |
buf_int64 buf nbad_propositions.(i) |
buf_int64 buf nbad_propositions.(i) |
389 |
done; |
done; |
390 |
let len = Fifo.length propositions in |
let len = Fifo.length propositions in |
|
if !verbose_redirector then lprintf_nl2 " Waiting propositions: %d\n" len; |
|
391 |
buf_int buf len; |
buf_int buf len; |
392 |
let len = ref 0 in |
let len = ref 0 in |
393 |
Hashtbl.iter (fun _ _ -> incr len) neighbours; |
Hashtbl.iter (fun _ _ -> incr len) neighbours; |
|
if !verbose_redirector then lprintf_nl2 " Total neighbours: %d\n" !len; |
|
394 |
buf_int buf !len |
buf_int buf !len |
395 |
) |
) |