| toArray(Object[], int) |  | 0% | | 0% | 2 | 2 | 9 | 9 | 1 | 1 |
| subList(int, int) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| indexOf(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 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 |
| tailSet(Object, boolean) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$comparator$0(Object, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| higher(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ceiling(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| floor(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lower(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| comparator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| BTreeSet.BTreeDescRange(BTreeSet.BTreeRange) |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| slice(BTree.Dir) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |