SET

The familiar set abstraction.
No duplicate elements permitted.
May or may not be ordered.
Extends the Collection interface.

Skeletal Set implementation.

A high-performance Set implementation backed by a bit vector.
All elements of each EnumSet instance must be elements of a single enum type.

Hash table implementation of the Set interface.
The best all-around implementation of the Set interface.

Hash table and linked list implementation of the Set interface.
An insertion-ordered Set implementation that runs nearly as fast as HashSet.

A set whose elements are automatically sorted,
either in their natural ordering (see the Comparable interface)
or by a Comparator object provided when a SortedSet instance is created.
Extends the Set interface.

A SortedSet extended with navigation methods
reporting closest matches for given search targets.
A NavigableSet may be accessed and traversed
in either ascending or descending order.

Red-black tree implementation of the NavigableSet interface.

Skips list implementation of the NavigableSet interface.

A Set implementation backed by a copy-on-write array.
This implementation is similar to CopyOnWriteArrayList.
Unlike most Set implementations, the add, remove,
and contains methods require time proportional to the size of the set.
This implementation is well suited to maintaining event-handler lists that must prevent duplicates.

Implementing this interface allows an object
to be the target of the "foreach" statement.

A group of objects.
No assumptions are made about the order of the collection (if any)
or whether it can contain duplicate elements.

Skeletal Collection implementation that is
neither a set nor a list (such as a "bag" or multiset).

Concurrent

extends

implements

extends

implements

extends

extends

extends

extends

extends

extends

extends

extends

implements

implements

extends