| symmetricDifference(Set, Set) |  | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| capacity(int) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| addAll(Collection, Iterator) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| intersection(Set, Set) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| union(Set, Set) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| difference(Set, Set) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| differenceInTreeSets(Set, Set) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| addAll(TreeSet, Iterable) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| newHashSet(Iterable) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| newHashSet(Object[]) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newTreeSet(Iterable) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newHashSet(Iterator) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| newHashSetWithExpectedSize(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newConcurrentHashSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newHashSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newTreeSet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| cast(Iterable) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |