| toArray(Object[], int) |  | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| hashCode() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| containsAll(Collection) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| copy(SortedSet, Comparator) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| subList(int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 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 |
| descendingSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| subSet(Object, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| last() | | 0% | | n/a | 1 | 1 | 1 | 1 | 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 |
| of(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| of(Comparable) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| builder(Comparator, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toArray() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toArray(Object[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| headSet(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| tailSet(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lastIndexOf(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingIterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| spliterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| addAll(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| addAll(int, Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| retainAll(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeAll(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| clear() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pollFirst() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pollLast() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| add(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| remove(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| set(int, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| add(int, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| remove(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| listIterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| listIterator(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| tree() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| BTreeSet(Object[], Comparator) |  | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| contains(Object) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| slice(BTree.Dir) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| indexOf(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| of(Comparator, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| wrap(Object[], Comparator) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| empty(Comparator) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| get(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| builder(Comparator) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isEmpty() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| iterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| first() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| comparator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |