| line |
true |
false |
branch |
|
52
|
0 |
0 |
if (@_) |
|
58
|
0 |
1 |
if (@_) |
|
89
|
6 |
10 |
if (not $$cost_hash_ref{$cost_key}) { } |
|
109
|
9 |
7 |
if ($antecedent) |
|
123
|
0 |
0 |
if (not $$cost_hash_ref{$cost_key}) { } |
|
151
|
0 |
0 |
if ($$cost_hash_ref{$cost_key}) |
|
167
|
0 |
7 |
if (not @cost_keys) { } |
|
195
|
0 |
4 |
if (not $$cost_hash_ref{$cost_key}) { } |
|
206
|
3 |
1 |
if ($$avltree->is_empty) |
|
213
|
1 |
3 |
if ($antecedent) |
|
231
|
0 |
5 |
unless (@cost_keys) |
|
238
|
0 |
5 |
unless ($lowest_cost_key) |
|
243
|
0 |
5 |
if (not $$cost_hash_ref{$lowest_cost_key}) { } |
|
253
|
1 |
4 |
if ($$avltree->is_empty) |
|
259
|
3 |
2 |
if ($antecedent) |
|
284
|
0 |
6 |
unless (@cost_keys) |
|
291
|
0 |
6 |
unless ($lowest_cost_key) |
|
296
|
0 |
6 |
if (not $$cost_hash_ref{$lowest_cost_key}) { } |
|
324
|
0 |
0 |
unless (@cost_keys) |
|
332
|
0 |
0 |
if ($obj1_str eq $obj2_str) |
|
343
|
0 |
0 |
if ($obj_phrase eq $phrase) { } |
|
355
|
0 |
0 |
unless ($highest_cost_key) |
|
359
|
0 |
0 |
if (not $$cost_hash_ref{$highest_cost_key}) { } |
|
389
|
0 |
0 |
if ($key != 0) |
|
397
|
0 |
0 |
if ($least_depth == 0) { } |
|
400
|
0 |
0 |
unless ($highest_cost_key) |
|
422
|
0 |
0 |
if ($queue_key = &$queue_keys_iterator()) { } |
|
432
|
0 |
0 |
if (not defined $next_smallest) { } |
|
450
|
0 |
0 |
if (not $obj) { } |
|
463
|
0 |
0 |
if ($obj) { } |
|
467
|
0 |
0 |
if ($antecedent) |
|
471
|
0 |
0 |
if ($$avltree->is_empty) |
|
490
|
0 |
0 |
if (not @$array) { } |
|
498
|
0 |
0 |
if ($largest < $$array[$i]) |
|
511
|
0 |
0 |
if (not @$array) { } |
|
519
|
0 |
0 |
if ($$array[$i] < $val and $largest < $$array[$i]) |
|
524
|
0 |
0 |
if ($largest != -1) { } |
|
541
|
0 |
0 |
if (not @$array) { } |
|
549
|
0 |
0 |
if ($$array[$i] > $val and $$array[$i] < $smallest) |
|
554
|
0 |
0 |
if ($smallest != $max) { } |
|
567
|
0 |
0 |
if (not @$array) { } |
|
574
|
0 |
0 |
if ($smallest > $$array[$i]) |
|
603
|
3 |
6 |
if (fp_equal($obj1, $obj2, 10)) |
|
606
|
3 |
3 |
if ($obj1 < $obj2) |