ArraySortedSet
public class ArraySortedSet<E> extends ArraySortedSet<E>
ArraySortedSet
is an array implementation of the
SortedSet
interface. This implementation has
significantly lower memory overhead than TreeSet
(about 4 bytes per element vs. 40 bytes per element) and is
intended to be a replacement for the use of TreeSet
for sets containing under 3000 elements. The main drawback of the array implementation is its worst-case performance characteristics when adding or removing elements in reverse sorted order.
This implementation does not support null
elements.
Constructor and Description |
---|
ArraySortedSet()
Deprecated.
Construct a new
ArraySortedSet of default size, using
the default sorting order of the objects added to the set. |
ArraySortedSet(java.util.Collection<? extends E> initialContents,
java.util.Comparator<? super E> comparator)
Deprecated.
Construct a new
ArraySortedSet with the given contents
and comparator. |
ArraySortedSet(java.util.Comparator<? super E> comparator)
Deprecated.
Construct a new
ArraySortedSet of default size, using
the specified comparator. |
ArraySortedSet(E[] initialContents,
java.util.Comparator<? super E> comparator)
Deprecated.
Construct a new
ArraySortedSet with the given contents
and comparator. |
ArraySortedSet(int initialSize)
Deprecated.
Construct a new
ArraySortedSet of specified size, using
the default sorting order of the objects addded to the set. |
ArraySortedSet(int initialSize,
java.util.Comparator<? super E> comparator)
Deprecated.
Construct a new
ArraySortedSet of specified size, using
the specified comparator. |
Modifier and Type | Method and Description |
---|---|
protected ArraySortedSet<E> |
newArraySortedSet(int initialSize,
java.util.Comparator<? super E> comparator)
Deprecated.
|
add, addAll, clear, clone, comparator, contains, first, headSet, intern, isEmpty, iterator, last, lookup, remove, size, subSet, tailSet, toArray, toArray, trimToSize
public ArraySortedSet()
ArraySortedSet
of default size, using
the default sorting order of the objects added to the set.public ArraySortedSet(int initialSize)
ArraySortedSet
of specified size, using
the default sorting order of the objects addded to the set.initialSize
- the initial capacity of the setpublic ArraySortedSet(java.util.Comparator<? super E> comparator)
ArraySortedSet
of default size, using
the specified comparator.comparator
- the comparator to usepublic ArraySortedSet(int initialSize, java.util.Comparator<? super E> comparator)
ArraySortedSet
of specified size, using
the specified comparator.initialSize
- the initial capacity of the setcomparator
- the comparator to usepublic ArraySortedSet(E[] initialContents, java.util.Comparator<? super E> comparator)
ArraySortedSet
with the given contents
and comparator. All objects in the array will be added to the set.initialContents
- the initial contents to add to the setcomparator
- the comparator to usepublic ArraySortedSet(java.util.Collection<? extends E> initialContents, java.util.Comparator<? super E> comparator)
ArraySortedSet
with the given contents
and comparator. All objects in the collection will be added to the set.initialContents
- the initial contents to add to the setcomparator
- the comparator to use.protected ArraySortedSet<E> newArraySortedSet(int initialSize, java.util.Comparator<? super E> comparator)
newArraySortedSet
in class ArraySortedSet<E>