@Generated(date="2023-04-24T17:14:49+0800",
value="KTypeArrayList.java")
public class IntArrayList
extends AbstractIntCollection
implements IntIndexedContainer, Preallocable, java.lang.Cloneable
| Modifier and Type | Class and Description |
|---|---|
(package private) static class |
IntArrayList.ValueIterator
An iterator implementation for
iterator(). |
| Modifier and Type | Field and Description |
|---|---|
int[] |
buffer
Internal array for storing the list.
|
int |
elementsCount
Current number of elements stored in
buffer. |
static int[] |
EMPTY_ARRAY
An immutable empty buffer (array).
|
protected ArraySizingStrategy |
resizer
Buffer resizing strategy.
|
| Constructor and Description |
|---|
IntArrayList()
New instance with sane defaults.
|
IntArrayList(int expectedElements)
New instance with sane defaults.
|
IntArrayList(int expectedElements,
ArraySizingStrategy resizer)
New instance with sane defaults.
|
IntArrayList(IntContainer container)
Creates a new list from the elements of another container in its
iteration order.
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(int... elements)
Vararg-signature method for adding elements at the end of the list.
|
void |
add(int e1)
Adds an element to the end of this container (the last index is incremented
by one).
|
void |
add(int[] elements,
int start,
int length)
Add all elements from a range of given array to the list.
|
void |
add(int e1,
int e2)
Appends two elements at the end of the list.
|
int |
addAll(IntContainer container)
Adds all elements from another container.
|
int |
addAll(java.lang.Iterable<? extends IntCursor> iterable)
Adds all elements from another iterable.
|
void |
clear()
Sets the number of stored elements to zero.
|
IntArrayList |
clone()
Clone this object.
|
boolean |
contains(int e1)
Lookup a given element in the container.
|
protected void |
ensureBufferSpace(int expectedAdditions)
Ensures the internal buffer has enough free slots to store
expectedAdditions. |
void |
ensureCapacity(int expectedElements)
Ensure this container can hold at least the given number of elements
without resizing its buffers.
|
protected boolean |
equalElements(IntArrayList other)
Compare index-aligned elements against another
IntIndexedContainer. |
boolean |
equals(java.lang.Object obj)
Returns
true only if the other object is an instance of
the same class and with the same elements. |
<T extends IntPredicate> |
forEach(T predicate)
Applies a
predicate to container elements as long, as the
predicate returns true. |
<T extends IntProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
<T extends IntPredicate> |
forEach(T predicate,
int fromIndex,
int toIndex)
Applies
predicate to a slice of the list,
fromIndex, inclusive, to toIndex, exclusive, or
until predicate returns false. |
<T extends IntProcedure> |
forEach(T procedure,
int fromIndex,
int toIndex)
Applies
procedure to a slice of the list,
fromIndex, inclusive, to toIndex, exclusive. |
static IntArrayList |
from(int... elements)
Create a list from a variable number of arguments or an array of
int. |
int |
get(int index) |
int |
hashCode() |
int |
indexOf(int e1)
Returns the index of the first occurrence of the specified element in this
list, or -1 if this list does not contain the element.
|
void |
insert(int index,
int e1)
Inserts the specified element at the specified position in this list.
|
boolean |
isEmpty()
Shortcut for
size() == 0. |
java.util.Iterator<IntCursor> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
lastIndexOf(int e1)
Returns the index of the last occurrence of the specified element in this
list, or -1 if this list does not contain the element.
|
void |
release()
Sets the number of stored elements to zero and releases the internal
storage array.
|
int |
remove(int index)
Removes the element at the specified position in this container and returns
it.
|
int |
removeAll(int e1)
Removes all occurrences of
e from this collection. |
int |
removeAll(IntPredicate predicate)
Removes all elements in this collection for which the given predicate
returns
true. |
int |
removeFirst(int e1)
Removes the first element that equals
e1, returning its
deleted position or -1 if the element was not found. |
int |
removeLast(int e1)
Removes the last element that equals
e1, returning its deleted
position or -1 if the element was not found. |
void |
removeRange(int fromIndex,
int toIndex)
Removes from this container all of the elements with indexes between
fromIndex, inclusive, and toIndex, exclusive. |
void |
resize(int newSize)
Truncate or expand the list to the new size.
|
int |
set(int index,
int e1)
Replaces the element at the specified position in this list with the
specified element.
|
int |
size()
Return the current number of elements in this container.
|
int[] |
toArray()
Default implementation of copying to an array.
|
void |
trimToSize()
Trim the internal buffer to the current size.
|
removeAll, retainAll, retainAll, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitremoveAll, retainAll, retainAllpublic static final int[] EMPTY_ARRAY
public int[] buffer
size()).public int elementsCount
buffer.protected final ArraySizingStrategy resizer
public IntArrayList()
public IntArrayList(int expectedElements)
expectedElements - The expected number of elements guaranteed not to cause buffer
expansion (inclusive).public IntArrayList(int expectedElements,
ArraySizingStrategy resizer)
expectedElements - The expected number of elements guaranteed not to cause buffer
expansion (inclusive).resizer - Underlying buffer sizing strategy.public IntArrayList(IntContainer container)
public void add(int e1)
add in interface IntIndexedContainerpublic void add(int e1,
int e2)
add (vararg-version) or access the buffer directly (tight
loop).public void add(int[] elements,
int start,
int length)
public final void add(int... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public int addAll(IntContainer container)
public int addAll(java.lang.Iterable<? extends IntCursor> iterable)
public void insert(int index,
int e1)
insert in interface IntIndexedContainerindex - The index at which the element should be inserted, shifting any
existing and subsequent elements to the right.public int get(int index)
get in interface IntIndexedContainerindex from the list.public int set(int index,
int e1)
set in interface IntIndexedContainerpublic int remove(int index)
remove in interface IntIndexedContainerIntIndexedContainer.removeFirst(int),
IntIndexedContainer.removeLast(int),
IntCollection.removeAll(int)public void removeRange(int fromIndex,
int toIndex)
fromIndex, inclusive, and toIndex, exclusive.removeRange in interface IntIndexedContainerpublic int removeFirst(int e1)
e1, returning its
deleted position or -1 if the element was not found.removeFirst in interface IntIndexedContainerpublic int removeLast(int e1)
e1, returning its deleted
position or -1 if the element was not found.removeLast in interface IntIndexedContainerpublic int removeAll(int e1)
e from this collection.removeAll in interface IntCollectione1 - Element to be removed from this collection, if present.public boolean contains(int e1)
contains in interface IntContainertrue if this container has an element equal to
e.public int indexOf(int e1)
indexOf in interface IntIndexedContainerpublic int lastIndexOf(int e1)
lastIndexOf in interface IntIndexedContainerpublic boolean isEmpty()
size() == 0.isEmpty in interface IntContainerpublic void ensureCapacity(int expectedElements)
ensureCapacity in interface PreallocableexpectedElements - The total number of elements, inclusive.protected void ensureBufferSpace(int expectedAdditions)
expectedAdditions. Increases internal buffer size if needed.public void resize(int newSize)
trimToSize() if you need a
truncated buffer), but the truncated values will be reset to the default
value (zero). If the list is expanded, the elements beyond the current size
are initialized with JVM-defaults (zero or null values).public int size()
O(n) time, although
implementing classes should try to maintain the current size and return in
constant time.size in interface IntContainerpublic void trimToSize()
public void clear()
elementsCount field to zero.clear in interface IntCollectionIntCollection.release()public void release()
release in interface IntCollectionIntCollection.clear()public int[] toArray()
The returned array is sized to match exactly the number of elements of the stack.
toArray in interface IntContainertoArray in class AbstractIntCollectionpublic IntArrayList clone()
clone in class java.lang.Objectpublic int hashCode()
hashCode in class java.lang.Objectpublic boolean equals(java.lang.Object obj)
true only if the other object is an instance of
the same class and with the same elements.equals in class java.lang.Objectprotected boolean equalElements(IntArrayList other)
IntIndexedContainer.public java.util.Iterator<IntCursor> iterator()
The iterator is implemented as a cursor and it returns the same cursor
instance on every call to Iterator.next() (to avoid boxing of
primitive types). To read the current list's value (or index in the list)
use the cursor's public fields. An example is shown below.
for (IntCursor<int> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface IntContaineriterator in interface java.lang.Iterable<IntCursor>public <T extends IntProcedure> T forEach(T procedure)
procedure to all container elements. Returns the
argument (any subclass of IntProcedure. This lets the caller to
call methods of the argument by chaining the call (even if the argument is
an anonymous type) to retrieve computed values, for example (IntContainer):
int count = container.forEach(new IntProcedure() {
int count; // this is a field declaration in an anonymous class.
public void apply(int value) {
count++;
}
}).count;
forEach in interface IntContainerpublic <T extends IntProcedure> T forEach(T procedure, int fromIndex, int toIndex)
procedure to a slice of the list,
fromIndex, inclusive, to toIndex, exclusive.public int removeAll(IntPredicate predicate)
true.removeAll in interface IntCollectionpublic <T extends IntPredicate> T forEach(T predicate)
predicate to container elements as long, as the
predicate returns true. The iteration is interrupted
otherwise.forEach in interface IntContainerpublic <T extends IntPredicate> T forEach(T predicate, int fromIndex, int toIndex)
predicate to a slice of the list,
fromIndex, inclusive, to toIndex, exclusive, or
until predicate returns false.public static IntArrayList from(int... elements)
int.
The elements are copied from the argument to the internal buffer.