| line |
true |
false |
branch |
|
28
|
0 |
100 |
unless $self->n($args->{'n'}) |
|
49
|
0 |
745 |
ref $factors eq 'ARRAY' ? : |
|
101
|
90 |
9 |
if ($lb_sq_factors->exists($largest_factor)) |
|
115
|
44 |
46 |
if ($low_square_val != $high_square_val) { } |
|
168
|
1144 |
493 |
if ($min_id < 0 or $min_id > $id) |
|
189
|
398 |
175 |
unless defined $self->_base->[$id] |
|
203
|
10 |
90 |
if ($self->_n_sq_factors->is_square) { } |
|
|
44 |
46 |
elsif (defined(my $ret = $self->_check_largest_factor_in_between)) { } |
|
254
|
411 |
33 |
if ($min_id >= 0) |
|
263
|
1311 |
1850 |
if ($j == $min_id or not defined $self->_base->[$j]) |
|
267
|
414 |
1436 |
if ($self->_base->[$j]->exists($min_p)) |
|
286
|
338 |
481 |
if (not $self->_prime_exists($p)) { } |
|
293
|
387 |
94 |
if (defined $self->_base->[$id]) |
|
309
|
45 |
600 |
if ($i_vec->is_square) |
|
320
|
156 |
444 |
if ($self->n > 2 and $i_vec->first == $i) |
|
332
|
201 |
444 |
unless my $i_vec = $self->_get_i_vec($i) |
|
340
|
46 |
398 |
if ($self->_try_to_form_n) { } |
|
358
|
46 |
599 |
if (defined(my $ret = $self->_solve_iteration($i))) |