Base implementation of Set.
This class provides a base implementation of a Set that depends only
on the abstract members: add, contains, lookup, remove,
iterator, length and toSet.
Some of the methods assume that toSet creates a modifiable set.
If using this base class for an unmodifiable set,
where toSet should return an unmodifiable set,
it's necessary to reimplement
retainAll, union, intersection and difference.
Implementations of Set using this base should consider also implementing
clear in constant time. The default implementation works by removing every
element.
true if there are no elements in this collection. [...]
value to the set. [...]
elements to this Set. [...]
test. [...]
R instances. [...]
value is in the set.
other.
other. [...]
indexth element. [...]
test. [...]
test. [...]
other. [...]
f to each element of this collection in iteration
order.
other. [...]
test. [...]
object is in the set, return it. [...]
f on each element of this Iterable in iteration order. [...]
value from the set. Returns true if value was
in the set. Returns false otherwise. The method has no effect
if value value was not in the set.
elements from this set.
test.
elements. [...]
test.
test. [...]
count elements. [...]
Iterable that skips leading elements while test is satisfied. [...]
count first elements of this iterable. [...]
test. [...]
other. [...]
test. [...]
T. [...]
Set to a string as {each, element, as, string}. [...]