public 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 increasing its current length by 50%), 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.ShortRandomAccessSubList, AbstractShortList.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(java.util.Collection<? extends java.lang.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(java.util.Iterator<? extends java.lang.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)
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(java.util.List<? extends java.lang.Short> l)
Compares this list to another object.
|
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(java.lang.Object o) |
boolean |
equals(ShortArrayList l)
Compares this type-specific array list to another one.
|
void |
forEach(ShortConsumer action)
Performs the given action for each element of this type-specific
Iterable
until all elements have been processed or the action throws an
exception. |
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.
|
static ShortArrayList |
of()
Creates a new empty array list.
|
static ShortArrayList |
of(short... init)
Creates an array list using an array of elements.
|
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.
|
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).
|
void |
setElements(int index,
short[] a,
int offset,
int length)
Sets elements to this type-specific list using optimized system calls.
|
int |
size() |
void |
size(int size)
Sets the size of this list.
|
void |
sort(ShortComparator comp)
Sort a list using a type-specific comparator.
|
ShortSpliterator |
spliterator()
Returns a type-specific spliterator on the elements of this list.
|
ShortList |
subList(int from,
int to)
Returns a type-specific view of the portion of this list from the index
from , inclusive, to the index to , exclusive. |
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.
|
void |
unstableSort(ShortComparator comp)
Sorts this list using a sort not assured to be stable.
|
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.
|
addAll, addAll, addAll, addElements, contains, hashCode, iterator, listIterator, peekShort, popShort, push, topShort, toShortArray, toString
add, contains, containsAll, containsAll, remove, removeAll, retainAll, retainAll, toShortArray
add, add, addAll, contains, get, indexOf, lastIndexOf, of, of, of, remove, remove, replaceAll, replaceAll, replaceAll, set, setElements, setElements, sort, unstableSort
containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeIf, removeIf, removeIf, retainAll, stream, toShortArray
forEach, forEach
peek, pop, push, top
public 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 static ShortArrayList of()
public static ShortArrayList of(short... init)
of
in interface ShortList
init
- a the array the will become the new backing array of the array list.wrap(short[], int)
public void ensureCapacity(int capacity)
capacity
- the new minimum capacity for this array list.public void add(int index, short k)
AbstractShortList
add
in interface ShortList
add
in class AbstractShortList
List.add(int,Object)
public boolean add(short k)
AbstractShortList
add
in interface ShortCollection
add
in interface ShortList
add
in class AbstractShortList
Collection.add(Object)
public short getShort(int index)
ShortList
public int indexOf(short k)
ShortList
indexOf
in interface ShortList
indexOf
in class AbstractShortList
List.indexOf(Object)
public int lastIndexOf(short k)
ShortList
lastIndexOf
in interface ShortList
lastIndexOf
in class AbstractShortList
List.lastIndexOf(Object)
public short removeShort(int index)
AbstractShortList
removeShort
in interface ShortList
removeShort
in class AbstractShortList
List.remove(int)
public boolean rem(short k)
AbstractShortList
rem
in interface ShortCollection
rem
in class AbstractShortList
List.remove(Object)
public short set(int index, short k)
AbstractShortList
set
in interface ShortList
set
in class AbstractShortList
List.set(int,Object)
public void clear()
AbstractShortList
clear
in interface java.util.Collection<java.lang.Short>
clear
in interface java.util.List<java.lang.Short>
clear
in class AbstractShortList
public 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 ShortList
size
in class AbstractShortList
size
- the new size.public boolean isEmpty()
Stack
isEmpty
in interface Stack<java.lang.Short>
isEmpty
in interface java.util.Collection<java.lang.Short>
isEmpty
in interface java.util.List<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 ShortList subList(int from, int to)
ShortList
from
, inclusive, to the index to
, exclusive.subList
in interface ShortList
subList
in interface java.util.List<java.lang.Short>
subList
in class AbstractShortList
List.subList(int,int)
public void getElements(int from, short[] a, int offset, int length)
getElements
in interface ShortList
getElements
in class AbstractShortList
from
- 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 ShortList
removeElements
in class AbstractShortList
from
- the start index (inclusive).to
- the end index (exclusive).public void addElements(int index, short[] a, int offset, int length)
addElements
in interface ShortList
addElements
in class AbstractShortList
index
- 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 void setElements(int index, short[] a, int offset, int length)
setElements
in interface ShortList
setElements
in class AbstractShortList
index
- the index at which to start setting elements.a
- the array containing the elements.offset
- the offset of the first element to add.length
- the number of elements to add.public void forEach(ShortConsumer action)
AbstractShortList
Iterable
until all elements have been processed or the action throws an
exception.forEach
in interface ShortIterable
forEach
in class AbstractShortList
action
- the action to be performed for each element.Iterable.forEach(java.util.function.Consumer)
public boolean addAll(int index, ShortCollection c)
ShortList
addAll
in interface ShortList
addAll
in class AbstractShortList
List.addAll(int,java.util.Collection)
public boolean addAll(int index, ShortList l)
ShortList
public boolean removeAll(ShortCollection c)
ShortCollection
removeAll
in interface ShortCollection
removeAll
in class AbstractShortCollection
c
- a type-specific collection.true
if this collection changed as a result of the call.Collection.removeAll(Collection)
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 ShortCollection
toArray
in class AbstractShortList
a
- if this array is big enough, it will be used to store this collection.Collection.toArray(Object[])
public ShortListIterator listIterator(int index)
AbstractShortList
listIterator
in interface ShortList
listIterator
in interface java.util.List<java.lang.Short>
listIterator
in class AbstractShortList
List.listIterator(int)
public ShortSpliterator spliterator()
List spliterators must report at least Spliterator.SIZED
and Spliterator.ORDERED
.
See List.spliterator()
for more documentation on the requirements
of the returned spliterator.
The returned spliterator is late-binding; it will track structural changes
after the current index, up until the first trySplit()
,
at which point the maximum index will be fixed.
Structural changes before the current index or after the first
trySplit()
will result in unspecified behavior.
spliterator
in interface ShortCollection
spliterator
in interface ShortIterable
spliterator
in interface ShortList
spliterator
in interface java.lang.Iterable<java.lang.Short>
spliterator
in interface java.util.Collection<java.lang.Short>
spliterator
in interface java.util.List<java.lang.Short>
public void sort(ShortComparator comp)
ShortList
Pass null
to sort using natural ordering.
public void unstableSort(ShortComparator comp)
ShortList
Pass null
to sort using natural ordering.
This differs from List.sort(java.util.Comparator)
in that the results are
not assured to be stable, but may be a bit faster.
Unless a subclass specifies otherwise, the results of the method if the list is concurrently modified during the sort are unspecified.
unstableSort
in interface ShortList
public ShortArrayList clone()
clone
in class java.lang.Object
public boolean equals(ShortArrayList l)
l
- a type-specific array list.public boolean equals(java.lang.Object o)
equals
in interface java.util.Collection<java.lang.Short>
equals
in interface java.util.List<java.lang.Short>
equals
in class AbstractShortList
public int compareTo(ShortArrayList l)
l
- an array list.public int compareTo(java.util.List<? extends java.lang.Short> l)
AbstractShortList
List
, this method performs a lexicographical comparison; otherwise,
it throws a ClassCastException
.compareTo
in interface java.lang.Comparable<java.util.List<? extends java.lang.Short>>
compareTo
in class AbstractShortList
l
- a list.List
, a negative integer,
zero, or a positive integer as this list is lexicographically less than, equal
to, or greater than the argument.