| subSet(NavigableSet, Range) |  | 0% | | 0% | 14 | 14 | 18 | 18 | 1 | 1 |
| immutableEnumSet(Iterable) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| combinations(Set, int) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| filter(Set, Predicate) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| filter(SortedSet, Predicate) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| filter(NavigableSet, Predicate) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| removeAllImpl(Set, Collection) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| complementOf(Collection) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| newLinkedHashSet(Iterable) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| removeAllImpl(Set, Iterator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| newCopyOnWriteArraySet(Iterable) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| complementOf(Collection, Class) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| union(Set, Set) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| intersection(Set, Set) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| difference(Set, Set) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| symmetricDifference(Set, Set) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newHashSet(Iterable) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| newEnumSet(Iterable, Class) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| makeComplementByHand(Collection, Class) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newHashSet(Iterator) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newConcurrentHashSet(Iterable) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newTreeSet(Comparator) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newLinkedHashSetWithExpectedSize(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| equalsImpl(Set, Object) |  | 82% | | 75% | 2 | 5 | 3 | 8 | 0 | 1 |
| immutableEnumSet(Enum, Enum[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| powerSet(Set) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newCopyOnWriteArraySet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| cartesianProduct(Set[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newIdentityHashSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newSetFromMap(Map) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| cartesianProduct(List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| synchronizedNavigableSet(NavigableSet) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| unmodifiableNavigableSet(NavigableSet) | | 84% | | 50% | 2 | 3 | 1 | 3 | 0 | 1 |
| toImmutableEnumSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newConcurrentHashSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| hashCodeImpl(Set) | | 96% | | 75% | 1 | 3 | 0 | 5 | 0 | 1 |
| newHashSet(Object[]) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| newTreeSet(Iterable) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| newHashSetWithExpectedSize(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| newHashSet() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| newLinkedHashSet() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| newTreeSet() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |