This class does not store null elements.
| Access | Constructor and Description |
|---|---|
| public | |
| public | |
| public | |
| public |
| Modifier and Type | Method and Description |
|---|---|
| public void | |
| public static <E> OrderedHashSet | |
| public static <E> OrderedHashSet | |
| private void | |
| public E | |
| public int | |
| public int | |
| public int | |
| public int | |
| public int | |
| public boolean | |
| public int | |
| public boolean | remove(E key)
Overrides org. Implements org. returns true if removed |
| public E | remove(int index)
Overrides org. Implements org. returns true if removed |
| public E | |
| public Object[] | |
| public <T> T[] |
| OrderedHashSet | back to summary |
|---|---|
| public OrderedHashSet() | |
| OrderedHashSet | back to summary |
|---|---|
| public OrderedHashSet(int initialCapacity) | |
| OrderedHashSet | back to summary |
|---|---|
| public OrderedHashSet(int initialCapacity, ObjectComparator<E> comparator) | |
| OrderedHashSet | back to summary |
|---|---|
| public OrderedHashSet(E[] valueList) | |
| add | back to summary |
|---|---|
| public void add(int index, E key) Implements org. | |
| add | back to summary |
|---|---|
| public static <E> OrderedHashSet add value to first. if value is null return first (which can be null), else if first is null return a new set and add the value | |
| addAll | back to summary |
|---|---|
| public static <E> OrderedHashSet add all elements of second to first. if second is null return first (which can be null), else if first is null return a new set and add the elements of second | |
| checkRange | back to summary |
|---|---|
| private void checkRange(int i) | |
| get | back to summary |
|---|---|
| public E get(int index) Overrides org. Implements org. | |
| getCommonElementCount | back to summary |
|---|---|
| public int getCommonElementCount(Set<E> other) Overrides org. | |
| getIndex | back to summary |
|---|---|
| public int getIndex(Object key) | |
| getLargestIndex | back to summary |
|---|---|
| public int getLargestIndex(OrderedHashSet<E> other) | |
| getSmallestIndex | back to summary |
|---|---|
| public int getSmallestIndex(OrderedHashSet<E> other) | |
| indexOf | back to summary |
|---|---|
| public int indexOf(Object key) | |
| insert | back to summary |
|---|---|
| public boolean insert(int index, E key) throws IndexOutOfBoundsException | |
| lastIndexOf | back to summary |
|---|---|
| public int lastIndexOf(Object o) | |
| remove | back to summary |
|---|---|
| public boolean remove(E key) Overrides org. Implements org. Doc from org. returns true if removed | |
| remove | back to summary |
|---|---|
| public E remove(int index) Overrides org. Implements org. Doc from org. returns true if removed | |
| set | back to summary |
|---|---|
| public E set(int index, E key) Implements org. | |
| toArray | back to summary |
|---|---|
| public Object[] toArray() Overrides org. | |
| toArray | back to summary |
|---|---|
| public <T> T[] toArray(T[] array) Overrides org. | |