ShortCollection, ShortIterable, ShortList, ShortStack, Stack<java.lang.Short>, java.io.Serializable, java.lang.Cloneable, java.lang.Comparable<java.util.List<? extends java.lang.Short>>, java.lang.Iterable<java.lang.Short>, java.util.Collection<java.lang.Short>, java.util.List<java.lang.Short>, java.util.RandomAccesspublic class ShortArrayList extends AbstractShortList implements java.util.RandomAccess, java.lang.Cloneable, java.io.Serializable
This class implements a lightweight, fast, open, optimized, reuse-oriented
version of array-based lists. Instances of this class represent a list with
an array that is enlarged as needed when new entries are created (by doubling
its current length), but is never made smaller (even on a
clear()). A family of trimming methods lets you
control the size of the backing array; this is particularly useful if you
reuse instances of this class. Range checks are equivalent to those of
java.util's classes, but they are delayed as much as possible. The
backing array is exposed by the elements() method.
This class implements the bulk methods removeElements(),
addElements() and getElements() using high-performance system
calls (e.g., System.arraycopy() instead of expensive loops.
ArrayList,
Serialized FormAbstractShortList.ShortSubList| Modifier and Type | Field | Description |
|---|---|---|
static int |
DEFAULT_INITIAL_CAPACITY |
The initial default capacity of an array list.
|
| Constructor | Description |
|---|---|
ShortArrayList() |
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
ShortArrayList(int capacity) |
Creates a new array list with given capacity.
|
ShortArrayList(short[] a) |
Creates a new array list and fills it with the elements of a given array.
|
ShortArrayList(short[] a,
int offset,
int length) |
Creates a new array list and fills it with the elements of a given array.
|
ShortArrayList(ShortCollection c) |
Creates a new array list and fills it with a given type-specific collection.
|
ShortArrayList(ShortIterator i) |
Creates a new array list and fills it with the elements returned by a
type-specific iterator..
|
ShortArrayList(ShortList l) |
Creates a new array list and fills it with a given type-specific list.
|
ShortArrayList(java.util.Collection<? extends java.lang.Short> c) |
Creates a new array list and fills it with a given collection.
|
ShortArrayList(java.util.Iterator<? extends java.lang.Short> i) |
Creates a new array list and fills it with the elements returned by an
iterator..
|
| Modifier and Type | Method | Description |
|---|---|---|
void |
add(int index,
short k) |
Inserts the specified element at the specified position in this list
(optional operation).
|
boolean |
add(short k) |
Ensures that this collection contains the specified element (optional
operation).
|
boolean |
addAll(int index,
ShortCollection c) |
Inserts all of the elements in the specified type-specific collection into
this type-specific list at the specified position (optional operation).
|
boolean |
addAll(int index,
ShortList l) |
Inserts all of the elements in the specified type-specific list into this
type-specific list at the specified position (optional operation).
|
void |
addElements(int index,
short[] a,
int offset,
int length) |
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
|
ShortArrayList |
clone() |
|
int |
compareTo(ShortArrayList l) |
Compares this array list to another array list.
|
short[] |
elements() |
Returns the backing array of this list.
|
void |
ensureCapacity(int capacity) |
Ensures that this array list can contain the given number of entries without
resizing.
|
boolean |
equals(ShortArrayList l) |
Compares this type-specific array list to another one.
|
void |
getElements(int from,
short[] a,
int offset,
int length) |
Copies element of this type-specific list into the given array using
optimized system calls.
|
short |
getShort(int index) |
Returns the element at the specified position in this list.
|
int |
indexOf(short k) |
Returns the index of the first occurrence of the specified element in this
list, or -1 if this list does not contain the element.
|
boolean |
isEmpty() |
Checks whether the stack is empty.
|
int |
lastIndexOf(short k) |
Returns the index of the last occurrence of the specified element in this
list, or -1 if this list does not contain the element.
|
ShortListIterator |
listIterator(int index) |
Returns a type-specific list iterator on the list starting at a given index.
|
boolean |
rem(short k) |
Removes a single instance of the specified element from this collection, if
it is present (optional operation).
|
boolean |
removeAll(ShortCollection c) |
Remove from this collection all elements in the given type-specific
collection.
|
boolean |
removeAll(java.util.Collection<?> c) |
|
void |
removeElements(int from,
int to) |
Removes elements of this type-specific list using optimized system calls.
|
short |
removeShort(int index) |
Removes the element at the specified position in this list (optional
operation).
|
short |
set(int index,
short k) |
Replaces the element at the specified position in this list with the
specified element (optional operation).
|
int |
size() |
|
void |
size(int size) |
Sets the size of this list.
|
short[] |
toArray(short[] a) |
Returns an array containing all of the elements in this collection; the
runtime type of the returned array is that of the specified array.
|
void |
trim() |
Trims this array list so that the capacity is equal to the size.
|
void |
trim(int n) |
Trims the backing array if it is too large.
|
static ShortArrayList |
wrap(short[] a) |
Wraps a given array into an array list.
|
static ShortArrayList |
wrap(short[] a,
int length) |
Wraps a given array into an array list of given size.
|
add, contains, containsAll, remove, retainAll, toShortArray, toShortArrayaddAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, hashCode, iterator, listIterator, peekShort, popShort, push, subList, topShort, toStringcontainsAll, replaceAll, retainAll, sort, spliterator, toArray, toArraycontainsAll, removeIf, removeIf, retainAll, toShortArray, toShortArrayforEach, forEachadd, add, contains, get, indexOf, lastIndexOf, remove, remove, setpeek, pop, push, toppublic static final int DEFAULT_INITIAL_CAPACITY
public ShortArrayList(int capacity)
capacity - the initial capacity of the array list (may be 0).public ShortArrayList()
DEFAULT_INITIAL_CAPACITY capacity.public ShortArrayList(java.util.Collection<? extends java.lang.Short> c)
c - a collection that will be used to fill the array list.public ShortArrayList(ShortCollection c)
c - a type-specific collection that will be used to fill the array
list.public ShortArrayList(ShortList l)
l - a type-specific list that will be used to fill the array list.public ShortArrayList(short[] a)
a - an array whose elements will be used to fill the array list.public ShortArrayList(short[] a,
int offset,
int length)
a - an array whose elements will be used to fill the array list.offset - the first element to use.length - the number of elements to use.public ShortArrayList(java.util.Iterator<? extends java.lang.Short> i)
i - an iterator whose returned elements will fill the array list.public ShortArrayList(ShortIterator i)
i - a type-specific iterator whose returned elements will fill the
array list.public short[] elements()
public static ShortArrayList wrap(short[] a, int length)
Note it is guaranteed that the type of the array returned by
elements() will be the same (see the comments in the class
documentation).
a - an array to wrap.length - the length of the resulting array list.public static ShortArrayList wrap(short[] a)
Note it is guaranteed that the type of the array returned by
elements() will be the same (see the comments in the class
documentation).
a - an array to wrap.public void ensureCapacity(int capacity)
capacity - the new minimum capacity for this array list.public void add(int index,
short k)
AbstractShortList
This implementation always throws an UnsupportedOperationException.
add in interface ShortListadd in class AbstractShortListList.add(int,Object)public boolean add(short k)
AbstractShortList
This implementation always throws an UnsupportedOperationException.
This implementation delegates to the type-specific version of
List.add(int, Object).
add in interface ShortCollectionadd in interface ShortListadd in class AbstractShortListCollection.add(Object)public short getShort(int index)
ShortListpublic int indexOf(short k)
ShortListindexOf in interface ShortListindexOf in class AbstractShortListList.indexOf(Object)public int lastIndexOf(short k)
ShortListlastIndexOf in interface ShortListlastIndexOf in class AbstractShortListList.lastIndexOf(Object)public short removeShort(int index)
AbstractShortList
This implementation always throws an UnsupportedOperationException.
removeShort in interface ShortListremoveShort in class AbstractShortListList.remove(int)public boolean rem(short k)
AbstractShortList
This implementation delegates to indexOf().
rem in interface ShortCollectionrem in class AbstractShortListList.remove(Object)public short set(int index,
short k)
AbstractShortList
This implementation always throws an UnsupportedOperationException.
set in interface ShortListset in class AbstractShortListList.set(int,Object)public void clear()
AbstractShortList
This implementation delegates to AbstractShortList.removeElements(int, int).
clear in interface java.util.Collection<java.lang.Short>clear in interface java.util.List<java.lang.Short>clear in class AbstractShortListpublic int size()
size in interface java.util.Collection<java.lang.Short>size in interface java.util.List<java.lang.Short>size in class java.util.AbstractCollection<java.lang.Short>public void size(int size)
ShortList
If the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null/false.
size in interface ShortListsize in class AbstractShortListsize - the new size.public boolean isEmpty()
StackisEmpty in interface java.util.Collection<java.lang.Short>isEmpty in interface java.util.List<java.lang.Short>isEmpty in interface Stack<java.lang.Short>isEmpty in class java.util.AbstractCollection<java.lang.Short>public void trim()
ArrayList.trimToSize()public void trim(int n)
n, this
method does nothing. Otherwise, it trims the array length to the maximum
between n and size().
This method is useful when reusing lists. Clearing a list leaves the array length untouched. If you are reusing a list many times, you can call this method with a typical size to avoid keeping around a very large array just because of a few large transient lists.
n - the threshold for the trimming.public void getElements(int from,
short[] a,
int offset,
int length)
getElements in interface ShortListgetElements in class AbstractShortListfrom - the start index (inclusive).a - the destination array.offset - the offset into the destination array where to store the first
element copied.length - the number of elements to be copied.public void removeElements(int from,
int to)
removeElements in interface ShortListremoveElements in class AbstractShortListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
short[] a,
int offset,
int length)
addElements in interface ShortListaddElements in class AbstractShortListindex - the index at which to add elements.a - the array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public short[] toArray(short[] a)
ShortCollection
Note that, contrarily to Collection.toArray(Object[]), this methods
just writes all elements of this collection: no special value will be added
after the last one.
toArray in interface ShortCollectiontoArray in class AbstractShortCollectiona - if this array is big enough, it will be used to store this
collection.Collection.toArray(Object[])public boolean addAll(int index,
ShortCollection c)
ShortListaddAll in interface ShortListaddAll in class AbstractShortListList.addAll(int,java.util.Collection)public boolean addAll(int index,
ShortList l)
AbstractShortList
This implementation delegates to the type-specific version of
List.addAll(int, Collection).
addAll in interface ShortListaddAll in class AbstractShortListList.add(int,Object)public boolean removeAll(ShortCollection c)
ShortCollectionremoveAll in interface ShortCollectionremoveAll in class AbstractShortCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.removeAll(Collection)public boolean removeAll(java.util.Collection<?> c)
removeAll in interface java.util.Collection<java.lang.Short>removeAll in interface java.util.List<java.lang.Short>removeAll in class java.util.AbstractCollection<java.lang.Short>public ShortListIterator listIterator(int index)
AbstractShortListThis implementation is based on the random-access methods.
listIterator in interface java.util.List<java.lang.Short>listIterator in interface ShortListlistIterator in class AbstractShortListList.listIterator(int)public ShortArrayList clone()
public boolean equals(ShortArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a type-specific array list.public int compareTo(ShortArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - an array list.