line |
true |
false |
branch |
44
|
0 |
0 |
unless @_ == 1 |
46
|
0 |
0 |
unless $n <= &maximumNumberOfKeys() |
52
|
0 |
1131074 |
unless @_ == 1 |
54
|
0 |
1131074 |
unless $n <= &maximumNumberOfKeys() + 1 |
60
|
0 |
85 |
unless $tree |
67
|
0 |
912539 |
unless @_ == 1 |
73
|
0 |
115760 |
unless @_ > 0 |
74
|
0 |
115760 |
unless @{$tree->keys} <= &maximumNumberOfKeys() |
80
|
0 |
1129141 |
unless @_ == 3 |
84
|
0 |
1129141 |
if $c > &maximumNumberOfKeys() |
85
|
1006230 |
122911 |
unless $c == &maximumNumberOfKeys() |
95
|
51181 |
71730 |
&maximumNumberOfKeys() % 2 == 0 ? : |
102
|
38112 |
84799 |
unless ($isLeaf) |
108
|
115052 |
7859 |
if (not $isRoot) { } |
111
|
115052 |
100807 |
if ($n[$i] == $node) |
129
|
0 |
235001 |
unless @_ == 2 |
136
|
0 |
894190 |
unless my(@k) = @{$tree->keys} |
138
|
341371 |
552819 |
if ($key < $k[0]) |
139
|
82183 |
259188 |
unless my $n = $tree->node->[0] |
144
|
330467 |
222352 |
if ($key > $k[-1]) |
145
|
85045 |
245422 |
unless my $n = $tree->node->[-1] |
152
|
50 |
553435 |
if ($s == 0) { } |
|
222302 |
331133 |
elsif ($s < 0) { } |
156
|
67723 |
154579 |
unless my $n = $tree->node->[$i] |
169
|
0 |
481951 |
unless @_ == 2 |
174
|
2222 |
1668240 |
unless my(@k) = @{$tree->keys} |
176
|
584667 |
1083573 |
if ($key < $k[0]) |
177
|
97726 |
486941 |
unless $tree = $tree->node->[0] |
181
|
549170 |
534403 |
if ($key > $k[-1]) |
182
|
103964 |
445206 |
unless $tree = $tree->node->[-1] |
188
|
241488 |
861888 |
if $s == 0 |
189
|
292915 |
568973 |
if ($s < 0) |
190
|
36551 |
256364 |
unless $tree = $tree->node->[$i] |
201
|
0 |
405125 |
unless @_ == 1 |
|
0 |
405125 |
unless my $p = $tree->up |
203
|
405125 |
564501 |
if $n[$i] == $tree |
209
|
0 |
72402 |
unless @_ == 2 |
211
|
0 |
72402 |
unless my $p = $node->up |
214
|
9243 |
63159 |
if ($dir) { } |
215
|
0 |
9243 |
unless $i < @{$p->node} - 1 |
219
|
4211 |
5032 |
if (not &leaf($node)) |
225
|
0 |
63159 |
unless $i > 0 |
231
|
22320 |
40839 |
if (not &leaf($node)) |
240
|
0 |
113244 |
unless @_ == 2 |
242
|
0 |
113244 |
unless &halfFull($n) |
243
|
0 |
113244 |
unless my $p = $n->up |
244
|
0 |
113244 |
if &halfFull($p) and $p->up |
248
|
22489 |
90755 |
if ($dir) { } |
249
|
0 |
22489 |
unless $i < @{$p->node} - 1 |
252
|
0 |
22489 |
unless &halfFull($r) |
255
|
7320 |
15169 |
unless (&leaf($n)) |
262
|
0 |
90755 |
unless $i > 0 |
265
|
0 |
90755 |
unless &halfFull($l) |
268
|
24576 |
66179 |
unless (&leaf($n)) |
278
|
153914 |
31732 |
if (my $i = &indexInParent($tree)) { } |
280
|
153914 |
0 |
if (&halfFull(my $r = $tree)) |
281
|
90755 |
63159 |
$l->halfFull ? : |
286
|
31732 |
0 |
if (&halfFull(my $l = $tree)) |
287
|
22489 |
9243 |
&halfFull($r) ? : |
294
|
0 |
398702 |
unless @_ == 1 |
296
|
205416 |
193286 |
unless &halfFull($tree) |
297
|
0 |
193286 |
unless my $p = $tree->up |
299
|
163134 |
30152 |
if ($p->up) { } |
|
7640 |
22512 |
elsif (@{$p->keys} == 1 and &halfFull(my $l = $p->node->[0]) and &halfFull(my $r = $p->node->[1])) { } |
319
|
84314 |
51835 |
if &leaf($tree) |
328
|
46451 |
25610 |
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 |
250403 |
if ($k->[$j] == $key) |
374
|
0 |
240493 |
unless @_ == 2 |
375
|
127494 |
112999 |
if (&leaf($tree)) { } |
|
45364 |
67635 |
elsif ($i > 0) { } |
394
|
0 |
240493 |
unless @_ == 2 |
400
|
204939 |
545566 |
if ($key < $k->[0]) { } |
|
189405 |
356161 |
elsif ($key > $k->[-1]) { } |
401
|
0 |
204939 |
unless $tree = $tree->node->[0] |
404
|
0 |
189405 |
unless $tree = $tree->node->[-1] |
408
|
240493 |
414491 |
if ((my $s = $key <=> $k->[$i]) == 0) { } |
|
115668 |
298823 |
elsif ($s < 0) { } |
414
|
0 |
115668 |
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 |
10234 |
if ((my $s = $key <=> $k->[$i]) == 0) { } |
|
3902 |
6332 |
elsif ($s > 0) { } |
452
|
50 |
234951 |
if ($compare == 0) { } |
456
|
85045 |
149906 |
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) |
2001
|
0 |
1 |
if eval "eof(${p}::DATA)" |
2003
|
0 |
1 |
if $@ |
2004
|
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) |
2005
|
0 |
1 |
if $@ |