Branch Coverage

blib/lib/Tree/Multi.pm
Criterion Covered Total %
branch 197 270 72.9


line true false branch
44 0 0 unless @_ == 1
46 0 0 unless $n <= &maximumNumberOfKeys()
52 0 1137926 unless @_ == 1
54 0 1137926 unless $n <= &maximumNumberOfKeys() + 1
60 0 85 unless $tree
67 0 908216 unless @_ == 1
73 0 115178 unless @_ > 0
74 0 115178 unless @{$tree->keys} <= &maximumNumberOfKeys()
80 0 1128648 unless @_ == 3
84 0 1128648 if $c > &maximumNumberOfKeys()
85 1005293 123355 unless $c == &maximumNumberOfKeys()
95 50856 72499 &maximumNumberOfKeys() % 2 == 0 ? :
102 37918 85437 unless ($isLeaf)
108 115521 7834 if (not $isRoot) { }
111 115521 98683 if ($n[$i] == $node)
129 0 235001 unless @_ == 2
136 0 893697 unless my(@k) = @{$tree->keys}
138 341877 551820 if ($key < $k[0])
139 83587 258290 unless my $n = $tree->node->[0]
144 330303 221517 if ($key > $k[-1])
145 83894 246409 unless my $n = $tree->node->[-1]
152 50 552474 if ($s == 0) { }
221467 331007 elsif ($s < 0) { }
156 67470 153997 unless my $n = $tree->node->[$i]
169 0 481951 unless @_ == 2
174 2222 1676350 unless my(@k) = @{$tree->keys}
176 582390 1093960 if ($key < $k[0])
177 98264 484126 unless $tree = $tree->node->[0]
181 553865 540095 if ($key > $k[-1])
182 105460 448405 unless $tree = $tree->node->[-1]
188 241488 870264 if $s == 0
189 298607 571657 if ($s < 0)
190 34517 264090 unless $tree = $tree->node->[$i]
201 0 408893 unless @_ == 1
0 408893 unless my $p = $tree->up
203 408893 569059 if $n[$i] == $tree
209 0 73817 unless @_ == 2
211 0 73817 unless my $p = $node->up
214 9320 64497 if ($dir) { }
215 0 9320 unless $i < @{$p->node} - 1
219 4602 4718 if (not &leaf($node))
225 0 64497 unless $i > 0
231 22078 42419 if (not &leaf($node))
240 0 113713 unless @_ == 2
242 0 113713 unless &halfFull($n)
243 0 113713 unless my $p = $n->up
244 0 113713 if &halfFull($p) and $p->up
248 22341 91372 if ($dir) { }
249 0 22341 unless $i < @{$p->node} - 1
252 0 22341 unless &halfFull($r)
255 7126 15215 unless (&leaf($n))
262 0 91372 unless $i > 0
265 0 91372 unless &halfFull($l)
268 24601 66771 unless (&leaf($n))
278 155869 31661 if (my $i = &indexInParent($tree)) { }
280 155869 0 if (&halfFull(my $r = $tree))
281 91372 64497 $l->halfFull ? :
286 31661 0 if (&halfFull(my $l = $tree))
287 22341 9320 &halfFull($r) ? :
294 0 400589 unless @_ == 1
296 205444 195145 unless &halfFull($tree)
297 0 195145 unless my $p = $tree->up
299 165021 30124 if ($p->up) { }
7615 22509 elsif (@{$p->keys} == 1 and &halfFull(my $l = $p->node->[0]) and &halfFull(my $r = $p->node->[1])) { }
319 81282 50590 if &leaf($tree)
328 45828 24303 if &leaf($tree)
337 476 1815 if (&leaf($tree))
338 471 5 if @{$tree->keys}
348 1 8 unless $tree->up or @{$tree->keys}
350 61 64 unless $tree->up
358 0 240493 unless @_ == 2
359 0 240493 unless &leaf($tree)
361 235568 4925 if $tree->up
364 240493 253028 if ($k->[$j] == $key)
374 0 240493 unless @_ == 2
375 131149 109344 if (&leaf($tree)) { }
44741 64603 elsif ($i > 0) { }
394 0 240493 unless @_ == 2
400 204955 552696 if ($key < $k->[0]) { }
192075 360621 elsif ($key > $k->[-1]) { }
401 0 204955 unless $tree = $tree->node->[0]
404 0 192075 unless $tree = $tree->node->[-1]
408 240493 420824 if ((my $s = $key <=> $k->[$i]) == 0) { }
120128 300696 elsif ($s < 0) { }
414 0 120128 unless $tree = $tree->node->[$i]
425 0 243524 unless @_ == 3
427 2296 241228 if (not my $n = @{$tree->keys}) { }
6227 235001 elsif ($n < &maximumNumberOfKeys() and @{$tree->node} == 0) { }
435 0 10391 if ((my $s = $key <=> $k->[$i]) == 0) { }
3877 6514 elsif ($s > 0) { }
452 50 234951 if ($compare == 0) { }
456 83894 151057 if $compare > 0
466 0 263 unless @_ == 1
482 0 33522 unless @_ == 1
483 0 33522 unless my $C = $iter->node
497 263 33259 unless (defined $iter->pos)
499 3 0 @{$C->keys} ? :
260 3 $l ? :
505 16408 15528 if $i < @{$p->keys}
511 16851 16408 if (&leaf($C)) { }
512 180 16671 $i < @{$C->keys} ? :
521 0 65 unless @_ == 1
537 0 2210 unless @_ == 1
538 0 2210 unless my $C = $iter->node
552 65 2145 unless (defined $iter->pos)
554 3 0 @{$C->keys} ? :
62 3 $l ? :
561 1023 874 if $i > 0
567 1122 1023 if (&leaf($C)) { }
568 34 1088 $i > 0 ? :
571 1023 0 $i >= 0 ? :
577 0 4 unless $tree
582 44 9 unless $D and $D > $d
588 122 53 if length $s < $l
595 0 4 if @title
601 0 4 unless $tree
606 0 112 unless $t and $t->keys and @{$t->keys}
611 0 0 if defined $i and $i == $j and $tree == $t
615 112 0 if (my $nodes = $t->node)
627 0 11 unless @_ == 1
632 1 54 unless $t and $t->keys and my(@k) = @{$t->keys}
634 54 0 if (my $nodes = $t->node)
2006 0 1 if eval "eof(${p}::DATA)"
2008 0 1 if $@
2009 0 8 unless ref $tree
4 4 $flat ? :
8 0 unless $develop
0 0 unless $s
0 462 unless $t->find($k) == $t{$k}
0 462 if defined $t->find($k)
0 462 if $t->height > $h
0 2 unless $t->height == 0
0 240000 unless $t->find($k) == $t{$k}
0 240000 if defined $t->find($k)
2010 0 1 if $@