Branch Coverage

blib/lib/Algorithm/Combinatorics.pm
Criterion Covered Total %
branch 76 96 79.1


line true false branch
37 0 66 if $k < 0
38 16 50 if $k == 0
39 0 50 if ($k > @$data)
46 50 31126 __next_combination(\@indices, @$data - 1) == -1 ? :
57 0 34 if $k < 0
58 8 26 if $k == 0
62 26 24122 __next_combination_with_repetition(\@indices, @$data - 1) == -1 ? :
72 33 9 if defined $k
77 9 65594 if $finished
79 9 65585 if @$subset == 0
90 0 66 if $k < 0
91 16 50 if $k == 0
92 0 50 if ($k > @$data)
99 16 34 if @$data == $k
104 34 30782 __next_variation(\@indices, \@used, @$data - 1) == -1 ? :
116 0 68 if $k < 0
117 16 52 if $k == 0
121 52 67034 __next_variation_with_repetition(\@indices, @$data - 1) == -1 ? :
133 0 0 if $k < 0
134 0 0 if $k == 0
145 0 0 __next_variation_with_repetition_gray_code(\@indices, \@focus_pointers, \@directions, @$data - 1) == -1 ? :
156 2 23 if @$data == 0
160 23 40339 __next_permutation(\@indices) == -1 ? :
171 2 9 if @$data == 0
172 4 5 if @$data == 1 or @$data == 2
176 5 40331 __next_permutation(\@indices) == -1 ? :
186 0 0 if @$data == 0
191 0 0 __next_permutation_heap(\@a, \@c) == -1 ? :
202 4 20 if @$data == 0
203 4 16 if @$data == 1
207 6 10 if @$data % 2
209 16 296690 __next_derangement(\@indices) == -1 ? :
220 26 16 if (defined $k) { }
231 2 10 if @$data == 0
236 10 137158 __next_partition(\@k, \@M) == -1 ? :
248 0 26 if $p < 0
249 4 22 if @$data == 0 and $p == 0
250 4 18 if $p == 0
252 0 18 if ($p > @$data)
263 18 179873 __next_partition_of_size_p(\@k, \@M, $p) == -1 ? :
300 13 393 unless (defined $data)
303 6 387 unless ($k_is_not_required or defined $k)
308 13 374 if (not defined $type or $type ne 'ARRAY')
312 0 374 if not $k_is_not_required and $k < 0
324 325 0 if (defined $w) { }
325 152 173 if ($w) { }
348 4 70 $tuple ? :
369 308 17 if (defined $first_seq) { }