| mergeAll(int) |  | 0% | | 0% | 16 | 16 | 42 | 42 | 1 | 1 |
| addAll(Collection) | | 0% | | 0% | 6 | 6 | 8 | 8 | 1 | 1 |
| mergeAll(Iterable, int) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| reverse() | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| BTree.Builder(BTree.Builder) | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| add(Object) |  | 74% | | 68% | 3 | 9 | 3 | 15 | 0 | 1 |
| BTree.Builder() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| equalComparators(Comparator, Comparator) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| isNaturalComparator(Comparator) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| autoEnforce() | | 83% | | 80% | 2 | 6 | 1 | 13 | 0 | 1 |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| copy() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| resolve(BTree.Builder.Resolver) | | 100% | | 83% | 1 | 4 | 0 | 10 | 0 | 1 |
| BTree.Builder(Comparator, int) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
| build() | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| reuse(Comparator) | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| sort() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| BTree.Builder(Comparator) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setQuickResolver(BTree.Builder.QuickResolver) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| reuse() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| auto(boolean) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |