Branch Coverage

blib/lib/Lingua/AlSetLib.pm
Criterion Covered Total %
branch 0 100 0.0


line true false branch
18 0 0 if (@$array > 0)
22 0 0 if ($sortedArray[$i] == $former + 1) { }
46 0 0 if (@$array > 0)
53 0 0 if ($sortedArray[$i] == $former + 1) { }
56 0 0 if ($currentLength > $greatestLength)
64 0 0 if ($currentLength > $greatestLength)
85 0 0 if (@wsrc > 1)
102 0 0 if ($ibm1_st == 0)
117 0 0 if ($numArray >= $numSub)
122 0 0 if ($$refToSubArray[$subi] ne $$refToArray[$i + $subi])
125 0 0 unless ($failed)
146 0 0 if (exists $d{$key}) { }
155 0 0 wantarray ? :
164 0 0 if ($high == -1 or $aValue > $$array[-1])
181 0 0 if ($aValue == $found) { }
0 0 elsif ($aValue > $found) { }
208 0 0 if (ref $a eq 'HASH')
216 0 0 unless (ref $a and ref $b)
224 0 0 if (not defined $keyGen) { }
241 0 0 if (ref $b eq 'HASH') { }
278 0 0 if (exists $$bMatches{$ai})
285 0 0 if ($k and $$thresh[$k] > $j and $$thresh[$k - 1] < $j) { }
295 0 0 if (defined $k)
297 0 0 $k ? :
304 0 0 if (@$thresh) { }
0 0 elsif ($counting) { }
306 0 0 if $counting
317 0 0 wantarray ? :
329 0 0 if (defined $$matchVector[$i])
334 0 0 wantarray ? :
348 0 0 if ($m >= $n and $m != 0 and $n != 0) { }
0 0 elsif ($m < $n and $m != 0 and $n != 0) { }
377 0 0 if (defined $bLine) { }
395 0 0 if ($ai == $lastA + 1 and $bi <= $lastB)
397 0 0 if (defined $finishedACallback) { }
409 0 0 if ($bi == $lastB + 1 and $ai <= $lastA)
411 0 0 if (defined $finishedBCallback) { }
422 0 0 if $ai <= $lastA
423 0 0 if $bi <= $lastB
446 0 0 if 0 < @$hunk
453 0 0 wantarray ? :
461 0 0 if ($a > $b) { }
467 0 0 if ($a < $b) { }
475 0 0 if (scalar @array == 0)
478 0 0 if (scalar @array == 1)
488 0 0 if ($array[$i] < $array[$i + 1]) { }
497 0 0 if (scalar(@array) % 2 != 0)
498 0 0 if ($min_cand[0] < $array[$r + 1]) { }
506 0 0 if ($min_cand[$i] < $m)
513 0 0 if ($max_cand[$i] > $m)