| Interface | Description |
|---|---|
| ReferenceSet<K> |
A type-specific
Set; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceSortedSet<K> |
A type-specific
SortedSet; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Class | Description |
|---|---|
| AbstractReferenceSet<K> |
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractReferenceSortedSet<K> |
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| ReferenceArraySet<K> |
A simple, brute-force implementation of a set based on a backing array.
|
| ReferenceLinkedOpenHashSet<K> |
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ReferenceOpenHashSet<K> |
A type-specific hash set with with a fast, small-footprint implementation.
|
| ReferenceSets |
A class providing static methods and objects that do useful things with type-specific sets.
|
| ReferenceSets.EmptySet<K> |
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ReferenceSets.Singleton<K> |
An immutable class representing a type-specific singleton set.
|
| ReferenceSets.SynchronizedSet<K> |
A synchronized wrapper class for sets.
|
| ReferenceSets.UnmodifiableSet<K> |
An unmodifiable wrapper class for sets.
|
| ReferenceSortedSets |
A class providing static methods and objects that do useful things with type-specific sorted sets.
|
| ReferenceSortedSets.EmptySet<K> |
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| ReferenceSortedSets.Singleton<K> |
A class representing a singleton sorted set.
|
| ReferenceSortedSets.SynchronizedSortedSet<K> |
A synchronized wrapper class for sorted sets.
|
| ReferenceSortedSets.UnmodifiableSortedSet<K> |
An unmodifiable wrapper class for sorted sets.
|