public class ArrayHashSet<E> extends Object implements Cloneable, Collection<E>, List<E>
Object.hashCode() for O(1) operations, see below.List functionality,
ie List.indexOf(java.lang.Object)
and List.get(int), hence object identity can be implemented.get(java.lang.Object)RecursiveLock.| Constructor and Description |
|---|
ArrayHashSet() |
ArrayHashSet(int initialCapacity) |
ArrayHashSet(int initialCapacity,
float loadFactor) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E element)
Add element at the end of this list, if it is not contained yet.
|
void |
add(int index,
E element)
Add element at the given index in this list, if it is not contained yet.
|
boolean |
addAll(Collection<? extends E> c)
Add all elements of given
Collection at the end of this list. |
boolean |
addAll(int index,
Collection<? extends E> c) |
void |
clear() |
Object |
clone() |
boolean |
contains(Object element)
Test for containment
This is an O(1) operation. |
boolean |
containsAll(Collection<?> c)
Test for containment of given
Collection
This is an O(n) operation, over the given Collection size. |
boolean |
containsSafe(Object element)
Test for containment
This is an O(n) operation, using equals operation over the list. |
boolean |
equals(Object arrayHashSet)
This is an O(n) operation.
|
E |
get(int index) |
E |
get(Object key)
Identity method allowing to get the identical object, using the internal hash map.
|
ArrayList<E> |
getData()
Returns this object ordered ArrayList.
|
HashMap<E,E> |
getMap()
Returns this object hash map.
|
E |
getOrAdd(E key)
Identity method allowing to get the identical object, using the internal hash map.
If the key is not yet contained, add it. |
int |
hashCode()
This is an O(n) operation over the size of this list.
|
int |
indexOf(Object element) |
boolean |
isEmpty() |
Iterator<E> |
iterator() |
int |
lastIndexOf(Object o)
Since this list is unique, equivalent to
indexOf(java.lang.Object). |
ListIterator<E> |
listIterator() |
ListIterator<E> |
listIterator(int index) |
E |
remove(int index)
Remove element at given index from this list.
|
boolean |
remove(Object element)
Remove element from this list.
|
boolean |
removeAll(Collection<?> c)
Remove all elements of given
Collection from this list. |
boolean |
retainAll(Collection<?> c)
Retain all elements of the given
Collection c, ie
remove all elements not contained by the given Collection c. |
E |
set(int index,
E element) |
int |
size() |
List<E> |
subList(int fromIndex,
int toIndex) |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
ArrayList<E> |
toArrayList() |
String |
toString() |
public ArrayHashSet()
public ArrayHashSet(int initialCapacity)
public ArrayHashSet(int initialCapacity,
float loadFactor)
public final Object clone()
public final ArrayList<E> getData()
public final HashMap<E,E> getMap()
public final void clear()
public final boolean add(E element)
public final boolean remove(Object element)
public final boolean addAll(Collection<? extends E> c)
Collection at the end of this list.
public final boolean contains(Object element)
public final boolean containsAll(Collection<?> c)
Collection
containsAll in interface Collection<E>containsAll in interface List<E>public final boolean removeAll(Collection<?> c)
Collection from this list.
public final boolean retainAll(Collection<?> c)
Collection c, ie
remove all elements not contained by the given Collection c.
public final boolean equals(Object arrayHashSet)
public final int hashCode()
hashCode in interface Collection<E>hashCode in interface List<E>hashCode in class ObjectList.hashCode(),
ie hashing all elements of this list.public final boolean isEmpty()
public final int size()
public final Object[] toArray()
public final <T> T[] toArray(T[] a)
public final void add(int index,
E element)
add in interface List<E>IllegalArgumentException - if the given element was already containedpublic final boolean addAll(int index,
Collection<? extends E> c)
addAll in interface List<E>UnsupportedOperationExceptionpublic final E set(int index, E element)
set in interface List<E>UnsupportedOperationExceptionpublic final E remove(int index)
public final int lastIndexOf(Object o)
indexOf(java.lang.Object).
lastIndexOf in interface List<E>public final ListIterator<E> listIterator()
listIterator in interface List<E>public final ListIterator<E> listIterator(int index)
listIterator in interface List<E>public final ArrayList<E> toArrayList()
public final E get(Object key)
key - hash source to find the identical Object within this listkey hash code,
or null if not containedpublic final E getOrAdd(E key)
key is not yet contained, add it.
key - hash source to find the identical Object within this listkey hash code,
or add the given key and return it.public final boolean containsSafe(Object element)
contains(java.lang.Object) and containsSafe(java.lang.Object)
shall have the same result.