line |
true |
false |
branch |
44
|
0 |
0 |
unless @_ == 1 |
46
|
0 |
0 |
unless $n <= &maximumNumberOfKeys() |
52
|
0 |
1149745 |
unless @_ == 1 |
54
|
0 |
1149745 |
unless $n <= &maximumNumberOfKeys() + 1 |
60
|
0 |
83 |
unless $tree |
67
|
0 |
908406 |
unless @_ == 1 |
73
|
0 |
118478 |
unless @_ > 0 |
74
|
0 |
118478 |
unless @{$tree->keys} <= &maximumNumberOfKeys() |
80
|
0 |
1128164 |
unless @_ == 1 |
82
|
1001845 |
126319 |
unless @{$node->keys} == &maximumNumberOfKeys() |
91
|
51820 |
74499 |
&maximumNumberOfKeys() % 2 == 0 ? : |
98
|
39018 |
87301 |
if (my(@n) = @{$node->node}) |
103
|
118477 |
7842 |
if ($p != $node) { } |
106
|
118477 |
101547 |
if ($n[$i] == $node) |
124
|
0 |
234992 |
unless @_ == 2 |
130
|
0 |
893222 |
unless my(@k) = @{$tree->keys} |
132
|
341773 |
551449 |
if ($key < $k[0]) |
133
|
83860 |
257913 |
unless my $n = $tree->node->[0] |
138
|
331651 |
219798 |
if ($key > $k[-1]) |
139
|
88923 |
242728 |
unless my $n = $tree->node->[-1] |
146
|
50 |
548687 |
if ($s == 0) { } |
|
219748 |
328939 |
elsif ($s < 0) { } |
150
|
62159 |
157589 |
unless my $n = $tree->node->[$i] |
162
|
0 |
481951 |
unless @_ == 2 |
167
|
2222 |
1679918 |
unless my(@k) = @{$tree->keys} |
169
|
581049 |
1098869 |
if ($key < $k[0]) |
170
|
95642 |
485407 |
unless $tree = $tree->node->[0] |
174
|
561478 |
537391 |
if ($key > $k[-1]) |
175
|
106560 |
454918 |
unless $tree = $tree->node->[-1] |
181
|
241488 |
866978 |
if $s == 0 |
182
|
295903 |
571075 |
if ($s < 0) |
183
|
36039 |
259864 |
unless $tree = $tree->node->[$i] |
193
|
0 |
411111 |
unless @_ == 1 |
|
0 |
411111 |
unless my $p = $tree->up |
195
|
411111 |
576182 |
if $n[$i] == $tree |
201
|
0 |
71973 |
unless @_ == 2 |
203
|
0 |
71973 |
unless my $p = $node->up |
206
|
9260 |
62713 |
if ($dir) { } |
207
|
0 |
9260 |
unless $i < @{$p->node} - 1 |
211
|
4637 |
4623 |
if (not &leaf($node)) |
217
|
0 |
62713 |
unless $i > 0 |
223
|
22719 |
39994 |
if (not &leaf($node)) |
232
|
0 |
116670 |
unless @_ == 2 |
234
|
0 |
116670 |
unless &halfFull($n) |
235
|
0 |
116670 |
unless my $p = $n->up |
236
|
0 |
116670 |
if &halfFull($p) and $p->up |
240
|
22720 |
93950 |
if ($dir) { } |
241
|
0 |
22720 |
unless $i < @{$p->node} - 1 |
244
|
0 |
22720 |
unless &halfFull($r) |
247
|
7264 |
15456 |
unless (&leaf($n)) |
254
|
0 |
93950 |
unless $i > 0 |
257
|
0 |
93950 |
unless &halfFull($l) |
260
|
25553 |
68397 |
unless (&leaf($n)) |
270
|
156663 |
31980 |
if (my $i = &indexInParent($tree)) { } |
272
|
156663 |
0 |
if (&halfFull(my $r = $tree)) |
273
|
93950 |
62713 |
$l->halfFull ? : |
278
|
31980 |
0 |
if (&halfFull(my $l = $tree)) |
279
|
22720 |
9260 |
&halfFull($r) ? : |
286
|
0 |
401559 |
unless @_ == 1 |
288
|
205291 |
196268 |
unless &halfFull($tree) |
289
|
0 |
196268 |
unless my $p = $tree->up |
291
|
165991 |
30277 |
if ($p->up) { } |
|
7625 |
22652 |
elsif (@{$p->keys} == 1 and &halfFull(my $l = $p->node->[0]) and &halfFull(my $r = $p->node->[1])) { } |
311
|
81055 |
51149 |
if &leaf($tree) |
320
|
44937 |
23998 |
if &leaf($tree) |
329
|
476 |
1815 |
if (&leaf($tree)) |
330
|
471 |
5 |
if @{$tree->keys} |
340
|
1 |
5 |
unless $tree->up or @{$tree->keys} |
342
|
24 |
30 |
unless $tree->up |
350
|
0 |
240493 |
unless @_ == 2 |
351
|
0 |
240493 |
unless &leaf($tree) |
353
|
235568 |
4925 |
if $tree->up |
356
|
240493 |
254692 |
if ($k->[$j] == $key) |
366
|
0 |
240493 |
unless @_ == 2 |
367
|
132259 |
108234 |
if (&leaf($tree)) { } |
|
43850 |
64384 |
elsif ($i > 0) { } |
386
|
0 |
240493 |
unless @_ == 2 |
392
|
206183 |
553685 |
if ($key < $k->[0]) { } |
|
195379 |
358306 |
elsif ($key > $k->[-1]) { } |
393
|
0 |
206183 |
unless $tree = $tree->node->[0] |
396
|
0 |
195379 |
unless $tree = $tree->node->[-1] |
400
|
240493 |
417880 |
if ((my $s = $key <=> $k->[$i]) == 0) { } |
|
117813 |
300067 |
elsif ($s < 0) { } |
406
|
0 |
117813 |
unless $tree = $tree->node->[$i] |
417
|
0 |
243487 |
unless @_ == 3 |
419
|
2294 |
241193 |
if (not my $n = @{$tree->keys}) { } |
|
6201 |
234992 |
elsif ($n < &maximumNumberOfKeys() and @{$tree->node} == 0) { } |
427
|
0 |
10095 |
if ((my $s = $key <=> $k->[$i]) == 0) { } |
|
3881 |
6214 |
elsif ($s > 0) { } |
444
|
50 |
234942 |
if ($compare == 0) { } |
448
|
88923 |
146019 |
if $compare > 0 |
458
|
0 |
260 |
unless @_ == 1 |
474
|
0 |
33460 |
unless @_ >= 1 |
475
|
0 |
33460 |
unless my $C = $iter->node |
489
|
260 |
33200 |
unless (defined $iter->pos) |
491
|
3 |
0 |
@{$C->keys} ? : |
|
257 |
3 |
$l ? : |
497
|
16403 |
15525 |
if $i < @{$p->keys} |
503
|
16797 |
16403 |
if (&leaf($C)) { } |
504
|
134 |
16663 |
$i < @{$C->keys} ? : |
507
|
16403 |
0 |
$i < @{$C->node} ? : |
513
|
0 |
65 |
unless @_ == 1 |
529
|
0 |
2210 |
unless @_ >= 1 |
530
|
0 |
2210 |
unless my $C = $iter->node |
544
|
65 |
2145 |
unless (defined $iter->pos) |
546
|
3 |
0 |
@{$C->keys} ? : |
|
62 |
3 |
$l ? : |
553
|
1023 |
874 |
if $i > 0 |
559
|
1122 |
1023 |
if (&leaf($C)) { } |
560
|
34 |
1088 |
$i > 0 ? : |
563
|
1023 |
0 |
$i >= 0 ? : |
569
|
0 |
2 |
unless $tree |
574
|
10 |
6 |
unless $D and $D > $d |
580
|
48 |
16 |
if length $s < $l |
587
|
0 |
2 |
if @title |
593
|
0 |
4 |
unless $tree |
598
|
0 |
112 |
unless $t and $t->keys and @{$t->keys} |
603
|
0 |
0 |
if defined $i and $i == $j and $tree == $t |
607
|
112 |
0 |
if (my $nodes = $t->node) |
619
|
0 |
11 |
unless @_ == 1 |
624
|
1 |
54 |
unless $t and $t->keys and my(@k) = @{$t->keys} |
626
|
54 |
0 |
if (my $nodes = $t->node) |
1796
|
1 |
0 |
if eval "eof(${p}::DATA)" |
1798
|
0 |
0 |
if $@ |
1800
|
0 |
0 |
if $@ |
1830
|
0 |
6 |
unless ref $tree |
1831
|
2 |
4 |
$flat ? : |
1832
|
6 |
0 |
unless $develop |
1834
|
0 |
0 |
unless $s |
1861
|
0 |
462 |
unless $t->find($k) == $t{$k} |
1862
|
0 |
462 |
if defined $t->find($k) |
1863
|
0 |
462 |
if $t->height > $h |
1865
|
0 |
2 |
unless $t->height == 0 |
1880
|
0 |
240000 |
unless $t->find($k) == $t{$k} |
1881
|
0 |
240000 |
if defined $t->find($k) |