| subList(int, int) |  | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| toArray(Object[], int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| get(int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| subSet(Object, boolean, Object, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| headSet(Object, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| BTreeSet.BTreeRange(BTreeSet.BTreeRange) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| lower(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| floor(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ceiling(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| higher(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| BTreeSet.BTreeRange(Object[], Comparator, Object, boolean, Object, boolean) |  | 73% | | 75% | 2 | 5 | 0 | 6 | 0 | 1 |
| maybe(int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| toArray(Object[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| BTreeSet.BTreeRange(BTreeSet.BTreeRange, BTreeSet.BTreeRange) | | 85% | | 50% | 1 | 2 | 0 | 3 | 0 | 1 |
| BTreeSet.BTreeRange(Object[], Comparator, int, int) | | 80% | | 50% | 1 | 2 | 1 | 6 | 0 | 1 |
| indexOf(Object) | | 97% | | 70% | 3 | 6 | 0 | 10 | 0 | 1 |
| outOfBounds(int) | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| tailSet(Object, boolean) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| slice(BTree.Dir) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| BTreeSet.BTreeRange(Object[], Comparator) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| isEmpty() | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| descendingSet() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |