- newHashSet
Creates a mutable HashSet instance initially containing the given elements.Note: if elements are non
- newLinkedHashSet
Creates a mutable LinkedHashSet instance containing the given elements in order.
Note: if mutability
- newTreeSet
Creates a mutable, empty TreeSet instance with the given comparator.Note: if mutability is not requi
- union
Returns an unmodifiable view of the union of two sets. The returned set contains
all elements that a
- filter
Returns the elements of a SortedSet, unfiltered, that satisfy a predicate. The
returned set is a liv
- intersection
Returns an unmodifiable view of the intersection of two sets. The returned set
contains all elements
- newHashSetWithExpectedSize
Returns a new hash set using the smallest initial table size that can hold
expectedSizeelements with
- newIdentityHashSet
Creates an empty Set that uses identity to determine equality. It compares
object references, instea
- cartesianProduct
Returns every possible list that can be formed by choosing one element from each
of the given sets i
- difference
Returns an unmodifiable view of the difference of two sets. The returned set
contains all elements t
- equalsImpl
An implementation for Set#equals(Object).
- hashCodeImpl
An implementation for Set#hashCode().
