| prepend(Object[], Object) |  | 0% | | 0% | 5 | 5 | 33 | 33 | 1 | 1 |
| redistributeOverflowAndDrain() | | 0% | | 0% | 2 | 2 | 18 | 18 | 1 | 1 |
| drainAndPropagate(Object[], BTree.BranchBuilder) | | 0% | | 0% | 10 | 10 | 20 | 20 | 1 | 1 |
| copyPrecedingNoOverflow(Object[], int, int[], int, int) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| copyPreceding(Object[], int, int, int) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| setOverflowSizeMap(Object[], int) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| overflow(Object) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| setRedistributedSizeMap(Object[], int) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| copySizeMapToSizes(int[], int, int[], int, int) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| propagateOverflow() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| setDrainSizeMap(Object[], int, Object[], int) |  | 68% | | 50% | 3 | 5 | 1 | 10 | 0 | 1 |
| drain() | | 77% | | 50% | 2 | 3 | 4 | 13 | 0 | 1 |
| addChild(Object[]) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| addKey(Object) | | 80% | | 50% | 1 | 2 | 1 | 4 | 0 | 1 |
| BTree.BranchBuilder(BTree.LeafOrBranchBuilder) | | 90% | | 75% | 1 | 3 | 0 | 6 | 0 | 1 |
| setImperfectSizeMap(Object[], int) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| addChildAndNextKey(Object[], int, Object) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| addChild(Object[], int) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| recordSizeOfChild(int) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| producesOnlyDense() | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |