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