T - the type of stored elementspublic final class ArrayStorage<T> extends AbstractList<T> implements RandomAccess, Serializable, Cloneable
Object[] array. Mainly used (and useful) for heavily generic and array-based
data storage. Extends/Implements some convenient classes/interfaces.modCount| Constructor and Description |
|---|
ArrayStorage(Collection<? extends T> collection) |
ArrayStorage(int size) |
ArrayStorage(int size,
Supplier<T> supplier) |
| Modifier and Type | Method and Description |
|---|---|
ArrayStorage<T> |
clone() |
boolean |
equals(Object o) |
T |
get(int index) |
int |
hashCode() |
T |
set(int index,
T element) |
int |
size() |
add, add, addAll, clear, indexOf, iterator, lastIndexOf, listIterator, listIterator, remove, removeRange, subListaddAll, contains, containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitaddAll, contains, containsAll, isEmpty, remove, removeAll, replaceAll, retainAll, sort, spliterator, toArray, toArrayparallelStream, removeIf, streampublic ArrayStorage(int size)
public ArrayStorage(Collection<? extends T> collection)
public T get(int index)
public int size()
size in interface Collection<T>size in interface List<T>size in class AbstractCollection<T>public ArrayStorage<T> clone()
public boolean equals(Object o)
equals in interface Collection<T>equals in interface List<T>equals in class AbstractList<T>public int hashCode()
hashCode in interface Collection<T>hashCode in interface List<T>hashCode in class AbstractList<T>Copyright © 2019. All rights reserved.