public class ShortArrayList extends AbstractShortList implements RandomAccess, Cloneable, 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 and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
| Constructor and Description |
|---|
ShortArrayList()
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
ShortArrayList(Collection<? extends Short> c)
Creates a new array list and fills it with a given collection.
|
ShortArrayList(int capacity)
Creates a new array list with given capacity.
|
ShortArrayList(Iterator<? extends Short> i)
Creates a new array list and fills it with the elements returned by an
iterator..
|
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.
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(int index,
short k) |
boolean |
add(short k) |
boolean |
addAll(int index,
ShortCollection c)
Delegates to a more generic method.
|
boolean |
addAll(int index,
ShortList l)
Delegates to a more generic method.
|
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) |
int |
indexOf(short k) |
boolean |
isEmpty()
Checks whether the stack is empty.
|
int |
lastIndexOf(short k) |
ShortListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given
index.
|
boolean |
rem(short k)
|
boolean |
removeAll(Collection<?> c)
Remove from this collection all elements in the given collection.
|
boolean |
removeAll(ShortCollection c)
Remove from this collection all elements in the given type-specific
collection.
|
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
short |
removeShort(int index) |
short |
set(int index,
short k) |
int |
size() |
void |
size(int size)
Sets the size of this list.
|
short[] |
toShortArray(short[] a)
Returns a primitive type array containing the items of this collection.
|
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, addAll, addAll, addAll, addAll, addElements, compareTo, contains, equals, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, peekShort, pop, popShort, push, push, remove, remove, set, shortListIterator, shortListIterator, shortSubList, subList, top, topShort, toStringadd, contains, containsAll, containsAll, rem, retainAll, retainAll, shortIterator, toArray, toArray, toArray, toShortArrayadd, contains, containsAll, replaceAll, retainAll, sort, spliterator, toArray, toArraycontainsAll, retainAll, shortIterator, toArray, toArray, toShortArrayparallelStream, removeIf, streampublic 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(Collection<? extends 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(Iterator<? extends 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)
add in interface ShortListadd in class AbstractShortListList.add(int,Object)public boolean add(short k)
add in interface ShortCollectionadd in interface ShortListadd in class AbstractShortListCollection.add(Object)public short getShort(int index)
getShort in interface ShortListList.get(int)public int indexOf(short k)
indexOf in interface ShortListindexOf in class AbstractShortListList.indexOf(Object)public int lastIndexOf(short k)
lastIndexOf in interface ShortListlastIndexOf in class AbstractShortListList.lastIndexOf(Object)public short removeShort(int index)
removeShort in interface ShortListremoveShort in class AbstractShortListList.remove(int)public boolean rem(short k)
ShortCollectionremove(), but the clash with
the similarly named index-based method in the List
interface forces us to use a distinguished name. For simplicity, the set
interfaces reinstates remove().rem in interface ShortCollectionrem in class AbstractShortListCollection.remove(Object)public short set(int index,
short k)
set in interface ShortListset in class AbstractShortListList.set(int,Object)public void clear()
clear in interface Collection<Short>clear in interface List<Short>clear in class AbstractCollection<Short>public int size()
size in interface Collection<Short>size in interface List<Short>size in class AbstractCollection<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()
Stackpublic 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[] toShortArray(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.
toShortArray in interface ShortCollectiontoShortArray 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)
AbstractShortListaddAll in interface ShortListaddAll in class AbstractShortListList.add(int,Object)public boolean addAll(int index,
ShortList l)
AbstractShortListaddAll in interface ShortListaddAll in class AbstractShortListList.add(int,Object)public boolean removeAll(ShortCollection c)
AbstractShortCollectionremoveAll 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(Collection<?> c)
AbstractShortCollectionremoveAll in interface Collection<Short>removeAll in interface List<Short>removeAll in class AbstractShortCollectionc - a collection.true if this collection changed as a result of the
call.public ShortListIterator listIterator(int index)
ShortListlistIterator in interface ShortListlistIterator in interface List<Short>listIterator 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.