public class IntArrayList extends AbstractIntList 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 FormAbstractIntList.IntRandomAccessSubList, AbstractIntList.IntSubList| Modifier and Type | Field and Description |
|---|---|
protected int[] |
a
The backing array.
|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
protected int |
size
The current actual size of the list (never greater than the backing-array length).
|
| Modifier | Constructor and Description |
|---|---|
|
IntArrayList()
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
|
IntArrayList(java.util.Collection<? extends java.lang.Integer> c)
Creates a new array list and fills it with a given collection.
|
|
IntArrayList(int capacity)
Creates a new array list with given capacity.
|
|
IntArrayList(int[] a)
Creates a new array list and fills it with the elements of a given array.
|
protected |
IntArrayList(int[] a,
boolean wrapped)
Creates a new array list using a given array.
|
|
IntArrayList(int[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array.
|
|
IntArrayList(IntCollection c)
Creates a new array list and fills it with a given type-specific collection.
|
|
IntArrayList(it.unimi.dsi.fastutil.ints.IntIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator..
|
|
IntArrayList(IntList l)
Creates a new array list and fills it with a given type-specific list.
|
|
IntArrayList(java.util.Iterator<? extends java.lang.Integer> i)
Creates a new array list and fills it with the elements returned by an iterator..
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(int k)
Ensures that this collection contains the specified element (optional operation).
|
void |
add(int index,
int k)
Inserts the specified element at the specified position in this list (optional operation).
|
boolean |
addAll(int index,
IntCollection 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,
IntList 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,
int[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
IntArrayList |
clone() |
int |
compareTo(IntArrayList l)
Compares this array list to another array list.
|
int |
compareTo(java.util.List<? extends java.lang.Integer> l)
Compares this list to another object.
|
int[] |
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(IntArrayList l)
Compares this type-specific array list to another one.
|
boolean |
equals(java.lang.Object o) |
void |
forEach(java.util.function.IntConsumer 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,
int[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls.
|
int |
getInt(int index)
Returns the element at the specified position in this list.
|
int |
indexOf(int 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() |
int |
lastIndexOf(int 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.
|
IntListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
static IntArrayList |
of()
Creates a new empty array list.
|
static IntArrayList |
of(int... init)
Creates an array list using an array of elements.
|
boolean |
rem(int k)
Removes a single instance of the specified element from this collection, if it is present (optional operation).
|
boolean |
removeAll(IntCollection 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.
|
boolean |
removeIf(java.util.function.IntPredicate filter)
Remove from this collection all elements which satisfy the given predicate.
|
int |
removeInt(int index)
Removes the element at the specified position in this list (optional operation).
|
int |
set(int index,
int k)
Replaces the element at the specified position in this list with the specified element (optional operation).
|
void |
setElements(int index,
int[] 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(it.unimi.dsi.fastutil.ints.IntComparator comp)
Sort a list using a type-specific comparator.
|
it.unimi.dsi.fastutil.ints.IntSpliterator |
spliterator()
Returns a type-specific spliterator on the elements of this list.
|
IntList |
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. |
int[] |
toArray(int[] 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.
|
static IntArrayList |
toList(java.util.stream.IntStream stream)
Collects the result of a primitive
Stream into a new ArrayList. |
static IntArrayList |
toListWithExpectedSize(java.util.stream.IntStream stream,
int expectedSize)
Collects the result of a primitive
Stream into a new ArrayList, potentially pre-allocated to handle the given size. |
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(it.unimi.dsi.fastutil.ints.IntComparator comp)
Sorts this list using a sort not assured to be stable.
|
static IntArrayList |
wrap(int[] a)
Wraps a given array into an array list.
|
static IntArrayList |
wrap(int[] a,
int length)
Wraps a given array into an array list of given size.
|
addAll, addAll, addAll, addElements, contains, ensureIndex, ensureRestrictedIndex, hashCode, iterator, listIterator, peekInt, popInt, push, replaceAll, toIntArray, topInt, toStringadd, contains, containsAll, containsAll, forEach, remove, removeAll, removeIf, retainAll, retainAll, toIntArrayfinalize, getClass, notify, notifyAll, wait, wait, waitadd, add, addAll, contains, get, indexOf, lastIndexOf, of, of, of, remove, remove, replaceAll, replaceAll, set, setElements, setElements, sort, unstableSortcontainsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeIf, removeIf, retainAll, stream, toIntArrayforEach, forEachpublic static final int DEFAULT_INITIAL_CAPACITY
protected transient int[] a
protected int size
protected IntArrayList(int[] a,
boolean wrapped)
This constructor is only meant to be used by the wrapping methods.
a - the array that will be used to back this array list.public IntArrayList(int capacity)
capacity - the initial capacity of the array list (may be 0).public IntArrayList()
DEFAULT_INITIAL_CAPACITY capacity.public IntArrayList(java.util.Collection<? extends java.lang.Integer> c)
c - a collection that will be used to fill the array list.public IntArrayList(IntCollection c)
c - a type-specific collection that will be used to fill the array list.public IntArrayList(IntList l)
l - a type-specific list that will be used to fill the array list.public IntArrayList(int[] a)
a - an array whose elements will be used to fill the array list.public IntArrayList(int[] 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 IntArrayList(java.util.Iterator<? extends java.lang.Integer> i)
i - an iterator whose returned elements will fill the array list.public IntArrayList(it.unimi.dsi.fastutil.ints.IntIterator i)
i - a type-specific iterator whose returned elements will fill the array list.public int[] elements()
public static IntArrayList wrap(int[] 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 IntArrayList wrap(int[] 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 IntArrayList of()
public static IntArrayList of(int... init)
of in interface IntListinit - a the array the will become the new backing array of the array list.wrap(int[], int)public static IntArrayList toList(java.util.stream.IntStream stream)
Stream into a new ArrayList.
This method performs a terminal operation on the given Stream
public static IntArrayList toListWithExpectedSize(java.util.stream.IntStream stream, int expectedSize)
Stream into a new ArrayList, potentially pre-allocated to handle the given size.
This method performs a terminal operation on the given Stream
public void ensureCapacity(int capacity)
capacity - the new minimum capacity for this array list.public void add(int index,
int k)
AbstractIntListadd in interface IntListadd in class AbstractIntListList.add(int,Object)public boolean add(int k)
AbstractIntListadd in interface IntCollectionadd in interface IntListadd in class AbstractIntListCollection.add(Object)public int getInt(int index)
IntListpublic int indexOf(int k)
IntListindexOf in interface IntListindexOf in class AbstractIntListList.indexOf(Object)public int lastIndexOf(int k)
IntListlastIndexOf in interface IntListlastIndexOf in class AbstractIntListList.lastIndexOf(Object)public int removeInt(int index)
AbstractIntListremoveInt in interface IntListremoveInt in class AbstractIntListList.remove(int)public boolean rem(int k)
AbstractIntListrem in interface IntCollectionrem in class AbstractIntListList.remove(Object)public int set(int index,
int k)
AbstractIntListset in interface IntListset in class AbstractIntListList.set(int,Object)public void clear()
AbstractIntListclear in interface java.util.Collection<java.lang.Integer>clear in interface java.util.List<java.lang.Integer>clear in class AbstractIntListpublic int size()
size in interface java.util.Collection<java.lang.Integer>size in interface java.util.List<java.lang.Integer>size in class java.util.AbstractCollection<java.lang.Integer>public void size(int size)
IntListIf 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 IntListsize in class AbstractIntListsize - the new size.public boolean isEmpty()
isEmpty in interface it.unimi.dsi.fastutil.Stack<java.lang.Integer>isEmpty in interface java.util.Collection<java.lang.Integer>isEmpty in interface java.util.List<java.lang.Integer>isEmpty in class java.util.AbstractCollection<java.lang.Integer>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 IntList subList(int from, int to)
IntListfrom, inclusive, to the index to, exclusive.subList in interface IntListsubList in interface java.util.List<java.lang.Integer>subList in class AbstractIntListList.subList(int,int)public void getElements(int from,
int[] a,
int offset,
int length)
getElements in interface IntListgetElements in class AbstractIntListfrom - 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 IntListremoveElements in class AbstractIntListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
int[] a,
int offset,
int length)
addElements in interface IntListaddElements in class AbstractIntListindex - 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,
int[] a,
int offset,
int length)
setElements in interface IntListsetElements in class AbstractIntListindex - 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(java.util.function.IntConsumer action)
AbstractIntListIterable
until all elements have been processed or the action throws an
exception.forEach in interface IntIterableforEach in class AbstractIntListaction - the action to be performed for each element.Iterable.forEach(java.util.function.Consumer)public boolean addAll(int index,
IntCollection c)
IntListaddAll in interface IntListaddAll in class AbstractIntListList.addAll(int,java.util.Collection)public boolean addAll(int index,
IntList l)
IntListpublic boolean removeAll(IntCollection c)
IntCollectionremoveAll in interface IntCollectionremoveAll in class AbstractIntCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.removeAll(Collection)public boolean removeIf(java.util.function.IntPredicate filter)
IntCollectionremoveIf in interface IntCollectionfilter - a predicate which returns true for elements to be
removed.true if any elements were removed.Collection.removeIf(java.util.function.Predicate)public int[] toArray(int[] a)
IntCollectionNote 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 IntCollectiontoArray in class AbstractIntLista - if this array is big enough, it will be used to store this collection.Collection.toArray(Object[])public IntListIterator listIterator(int index)
AbstractIntListlistIterator in interface IntListlistIterator in interface java.util.List<java.lang.Integer>listIterator in class AbstractIntListList.listIterator(int)public it.unimi.dsi.fastutil.ints.IntSpliterator 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 IntCollectionspliterator in interface IntIterablespliterator in interface IntListspliterator in interface java.lang.Iterable<java.lang.Integer>spliterator in interface java.util.Collection<java.lang.Integer>spliterator in interface java.util.List<java.lang.Integer>public void sort(it.unimi.dsi.fastutil.ints.IntComparator comp)
IntListPass null to sort using natural ordering.
public void unstableSort(it.unimi.dsi.fastutil.ints.IntComparator comp)
IntListPass 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 IntListpublic IntArrayList clone()
clone in class java.lang.Objectpublic boolean equals(IntArrayList l)
l - a type-specific array list.public boolean equals(java.lang.Object o)
equals in interface java.util.Collection<java.lang.Integer>equals in interface java.util.List<java.lang.Integer>equals in class AbstractIntListpublic int compareTo(IntArrayList l)
l - an array list.public int compareTo(java.util.List<? extends java.lang.Integer> l)
AbstractIntListList, this method performs a lexicographical comparison; otherwise,
it throws a ClassCastException.compareTo in interface java.lang.Comparable<java.util.List<? extends java.lang.Integer>>compareTo in class AbstractIntListl - 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.