| line |
true |
false |
branch |
|
63
|
0 |
0 |
if (@_) |
|
69
|
0 |
0 |
if (@_) |
|
75
|
0 |
0 |
if (@_) |
|
81
|
0 |
0 |
if (@_) |
|
87
|
0 |
0 |
if (@_) |
|
93
|
0 |
0 |
if (@_) |
|
117
|
0 |
2 |
unless (defined $state_eval_func) |
|
120
|
0 |
2 |
unless (defined $state_goal_p_func) |
|
123
|
0 |
2 |
unless (defined $state_num_successors_func) |
|
126
|
0 |
2 |
unless (defined $state_successors_iterator) |
|
143
|
0 |
2 |
unless (&Scalar::Util::looks_like_number($fcost)) |
|
150
|
0 |
2 |
unless (&Scalar::Util::looks_like_number($num_successors)) |
|
161
|
0 |
2 |
unless ($succ_classname eq $classname) |
|
186
|
0 |
1 |
unless (defined $str_function) |
|
239
|
0 |
1 |
if ($$priority_queue->is_empty or not $$priority_queue) { } |
|
254
|
6 |
0 |
if (not $DEBUG) { } |
|
265
|
1 |
5 |
if ($best->$goal_p) { } |
|
|
0 |
5 |
elsif ($$best{'_f_cost'} >= $max_cost) { } |
|
277
|
5 |
0 |
if ($succ) |
|
279
|
0 |
5 |
if ($succ->depth >= $max_depth and not $succ->$goal_p) { } |
|
291
|
5 |
0 |
if ($best->is_completed) |
|
316
|
0 |
0 |
if ($obj_path_str eq $str) { } |
|
330
|
5 |
0 |
if ($best->need_fval_change) |
|
338
|
4 |
0 |
if ($antecedent->is_on_queue and $antecedent->need_fval_change) |
|
349
|
5 |
0 |
if ($best->need_fval_change) |
|
355
|
5 |
0 |
if ($best->need_fval_change) |
|
360
|
4 |
0 |
if ($was_on_queue{$i} and $antecedent->need_fval_change) |
|
364
|
4 |
0 |
if ($antecedent->need_fval_change) |
|
388
|
0 |
5 |
if ($best->all_in_memory) |
|
390
|
0 |
0 |
unless ($best->is_completed) |
|
399
|
0 |
0 |
if ($obj_str eq $str) { } |
|
411
|
0 |
0 |
if ($$best{'_depth'} != 0) |
|
417
|
0 |
0 |
if ($antecedent) |
|
424
|
0 |
5 |
unless ($succ) |
|
435
|
0 |
5 |
if ($num_states_in_queue > $max_states_in_queue) |
|
438
|
0 |
0 |
unless ($shcl_obj) |
|
442
|
0 |
0 |
if ($antecedent) |
|
464
|
5 |
0 |
if ($succ) { } |
|
488
|
5 |
0 |
$n1 > $n2 ? : |
|
499
|
0 |
0 |
if ($a_seq eq $b_seq) { } |
|
|
0 |
0 |
elsif ($a_seq lt $b_seq) { } |