java.lang.Object
com.carrotsearch.hppc.IntArrayList
- All Implemented Interfaces:
Accountable,IntCollection,IntContainer,IntIndexedContainer,Preallocable,Cloneable,Iterable<IntCursor>,RandomAccess
- Direct Known Subclasses:
IntStack
@Generated(date="2024-06-04T15:20:17+0200",
value="KTypeArrayList.java")
public class IntArrayList
extends Object
implements IntIndexedContainer, Preallocable, Cloneable, Accountable
An array-backed list of ints.
-
Field Summary
FieldsModifier and TypeFieldDescriptionint[]Internal array for storing the list.intCurrent number of elements stored inbuffer.static final int[]An immutable empty buffer (array).protected final ArraySizingStrategyBuffer resizing strategy. -
Constructor Summary
ConstructorsConstructorDescriptionNew 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. -
Method Summary
Modifier and TypeMethodDescriptionvoidadd(int e1) Adds an element to the end of this container (the last index is incremented by one).final voidadd(int... elements) Vararg-signature method for adding elements at the end of the list.voidadd(int[] elements, int start, int length) Add all elements from a range of given array to the list.voidadd(int e1, int e2) Appends two elements at the end of the list.intaddAll(IntContainer container) Adds all elements from another container.intAdds all elements from another iterable.voidclear()Sets the number of stored elements to zero.clone()Clone this object.booleancontains(int e1) Lookup a given element in the container.protected voidensureBufferSpace(int expectedAdditions) Ensures the internal buffer has enough free slots to storeexpectedAdditions.voidensureCapacity(int expectedElements) Ensure this container can hold at least the given number of elements without resizing its buffers.protected booleanequalElements(IntArrayList other) Compare index-aligned elements against anotherIntIndexedContainer.booleanReturnstrueonly if the other object is an instance of the same class and with the same elements.<T extends IntProcedure>
TforEach(T procedure) Applies aprocedureto all container elements.<T extends IntProcedure>
TforEach(T procedure, int fromIndex, int toIndex) Appliesprocedureto a slice of the list,fromIndex, inclusive, totoIndex, exclusive.static IntArrayListfrom(int... elements) Create a list from a variable number of arguments or an array ofint.intget(int index) inthashCode()intindexOf(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.voidinsert(int index, int e1) Inserts the specified element at the specified position in this list.booleanisEmpty()Shortcut forsize() == 0.iterator()Returns an iterator to a cursor traversing the collection.intlastIndexOf(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.longAllocated memory estimationlongBytes that is actually been usedvoidrelease()Sets the number of stored elements to zero and releases the internal storage array.intremoveAll(int e1) Removes all occurrences ofefrom this collection.intDefault implementation uses a predicate for removal.intremoveAll(IntPredicate predicate) Removes all elements in this collection for which the given predicate returnstrue.intremoveAt(int index) Removes the element at the specified position in this container and returns it.booleanremoveElement(int e1) Removes the first element that equalse1, returning whether an element has been removed.intremoveFirst(int e1) Removes the first element that equalse1, returning its deleted position or-1if the element was not found.intRemoves and returns the last element of this container.intremoveLast(int e1) Removes the last element that equalse1, returning its deleted position or-1if the element was not found.voidremoveRange(int fromIndex, int toIndex) Removes from this container all of the elements with indexes betweenfromIndex, inclusive, andtoIndex, exclusive.voidresize(int newSize) Truncate or expand the list to the new size.intDefault implementation uses a predicate for retaining.intretainAll(IntPredicate predicate) Default implementation redirects toIntCollection.removeAll(IntPredicate)and negates the predicate.reverse()Reverses the elements in this container and returns this container.intset(int index, int e1) Replaces the element at the specified position in this list with the specified element.intsize()Return the current number of elements in this container.sort()Sorts the elements in this container and returns this container.stream()Returns this container elements as a stream.int[]toArray()Default implementation of copying to an array.toString()Convert the contents of this container to a human-friendly string.voidTrim the internal buffer to the current size.Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface com.carrotsearch.hppc.IntCollection
removeAll, retainAll, retainAllMethods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
EMPTY_ARRAY
public static final int[] EMPTY_ARRAYAn immutable empty buffer (array). -
buffer
public int[] bufferInternal array for storing the list. The array may be larger than the current size (size()). -
elementsCount
public int elementsCountCurrent number of elements stored inbuffer. -
resizer
Buffer resizing strategy.
-
-
Constructor Details
-
IntArrayList
public IntArrayList()New instance with sane defaults. -
IntArrayList
public IntArrayList(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
IntArrayList
New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).resizer- Underlying buffer sizing strategy.
-
IntArrayList
Creates a new list from the elements of another container in its iteration order.
-
-
Method Details
-
add
public void add(int e1) Adds an element to the end of this container (the last index is incremented by one).- Specified by:
addin interfaceIntIndexedContainer
-
add
public void add(int e1, int e2) Appends two elements at the end of the list. To add more than two elements, useadd(vararg-version) or access the buffer directly (tight loop). -
add
public void add(int[] elements, int start, int length) Add all elements from a range of given array to the list. -
add
public final void add(int... elements) Vararg-signature method for adding elements at the end of the list.This method is handy, but costly if used in tight loops (anonymous array passing)
-
addAll
Adds all elements from another container. -
addAll
Adds all elements from another iterable. -
insert
public void insert(int index, int e1) Inserts the specified element at the specified position in this list.- Specified by:
insertin interfaceIntIndexedContainer- Parameters:
index- The index at which the element should be inserted, shifting any existing and subsequent elements to the right.
-
get
public int get(int index) - Specified by:
getin interfaceIntIndexedContainer- Returns:
- Returns the element at index
indexfrom the list.
-
set
public int set(int index, int e1) Replaces the element at the specified position in this list with the specified element.- Specified by:
setin interfaceIntIndexedContainer- Returns:
- Returns the previous value in the list.
-
removeAt
public int removeAt(int index) Removes the element at the specified position in this container and returns it.- Specified by:
removeAtin interfaceIntIndexedContainer- See Also:
-
removeLast
public int removeLast()Removes and returns the last element of this container. This container must not be empty.- Specified by:
removeLastin interfaceIntIndexedContainer
-
removeRange
public void removeRange(int fromIndex, int toIndex) Removes from this container all of the elements with indexes betweenfromIndex, inclusive, andtoIndex, exclusive.- Specified by:
removeRangein interfaceIntIndexedContainer
-
removeElement
public boolean removeElement(int e1) Removes the first element that equalse1, returning whether an element has been removed.- Specified by:
removeElementin interfaceIntIndexedContainer
-
removeFirst
public int removeFirst(int e1) Removes the first element that equalse1, returning its deleted position or-1if the element was not found.- Specified by:
removeFirstin interfaceIntIndexedContainer
-
removeLast
public int removeLast(int e1) Removes the last element that equalse1, returning its deleted position or-1if the element was not found.- Specified by:
removeLastin interfaceIntIndexedContainer
-
removeAll
public int removeAll(int e1) Removes all occurrences ofefrom this collection.- Specified by:
removeAllin interfaceIntCollection- Parameters:
e1- Element to be removed from this collection, if present.- Returns:
- The number of removed elements as a result of this call.
-
contains
public boolean contains(int e1) Lookup a given element in the container. This operation has no speed guarantees (may be linear with respect to the size of this container).- Specified by:
containsin interfaceIntContainer- Returns:
- Returns
trueif this container has an element equal toe.
-
indexOf
public 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.- Specified by:
indexOfin interfaceIntIndexedContainer
-
lastIndexOf
public 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.- Specified by:
lastIndexOfin interfaceIntIndexedContainer
-
isEmpty
public boolean isEmpty()Shortcut forsize() == 0.- Specified by:
isEmptyin interfaceIntContainer
-
ensureCapacity
public void ensureCapacity(int expectedElements) Ensure this container can hold at least the given number of elements without resizing its buffers.- Specified by:
ensureCapacityin interfacePreallocable- Parameters:
expectedElements- The total number of elements, inclusive.
-
ensureBufferSpace
protected void ensureBufferSpace(int expectedAdditions) Ensures the internal buffer has enough free slots to storeexpectedAdditions. Increases internal buffer size if needed. -
resize
public void resize(int newSize) Truncate or expand the list to the new size. If the list is truncated, the buffer will not be reallocated (usetrimToSize()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 ornullvalues). -
size
public int size()Return the current number of elements in this container. The time for calculating the container's size may takeO(n)time, although implementing classes should try to maintain the current size and return in constant time.- Specified by:
sizein interfaceIntContainer
-
trimToSize
public void trimToSize()Trim the internal buffer to the current size. -
clear
public void clear()Sets the number of stored elements to zero. Releases and initializes the internal storage array to default values. To clear the list without cleaning the buffer, simply set theelementsCountfield to zero.- Specified by:
clearin interfaceIntCollection- See Also:
-
release
public void release()Sets the number of stored elements to zero and releases the internal storage array.- Specified by:
releasein interfaceIntCollection- See Also:
-
toArray
public int[] toArray()Default implementation of copying to an array.The returned array is sized to match exactly the number of elements of the stack.
- Specified by:
toArrayin interfaceIntContainer
-
stream
Description copied from interface:IntIndexedContainerReturns this container elements as a stream.- Specified by:
streamin interfaceIntIndexedContainer
-
sort
Sorts the elements in this container and returns this container.- Specified by:
sortin interfaceIntIndexedContainer
-
reverse
Reverses the elements in this container and returns this container.- Specified by:
reversein interfaceIntIndexedContainer
-
clone
Clone this object. The returned clone will reuse the same hash function and array resizing strategy. -
hashCode
public int hashCode() -
equals
Returnstrueonly if the other object is an instance of the same class and with the same elements. -
equalElements
Compare index-aligned elements against anotherIntIndexedContainer. -
ramBytesAllocated
public long ramBytesAllocated()Description copied from interface:AccountableAllocated memory estimation- Specified by:
ramBytesAllocatedin interfaceAccountable- Returns:
- Ram allocated in bytes
-
ramBytesUsed
public long ramBytesUsed()Description copied from interface:AccountableBytes that is actually been used- Specified by:
ramBytesUsedin interfaceAccountable- Returns:
- Ram used in bytes
-
iterator
Returns an iterator to a cursor traversing the collection. The order of traversal is not defined. More than one cursor may be active at a time. The behavior of iterators is undefined if structural changes are made to the underlying collection.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); }- Specified by:
iteratorin interfaceIntContainer- Specified by:
iteratorin interfaceIterable<IntCursor>
-
forEach
Applies aprocedureto all container elements. Returns the argument (any subclass ofIntProcedure. 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;- Specified by:
forEachin interfaceIntContainer
-
forEach
Appliesprocedureto a slice of the list,fromIndex, inclusive, totoIndex, exclusive. -
removeAll
Removes all elements in this collection for which the given predicate returnstrue.- Specified by:
removeAllin interfaceIntCollection- Returns:
- Returns the number of removed elements.
-
forEach
Applies apredicateto container elements as long, as the predicate returnstrue. The iteration is interrupted otherwise.- Specified by:
forEachin interfaceIntContainer
-
forEach
Appliespredicateto a slice of the list,fromIndex, inclusive, totoIndex, exclusive, or until predicate returnsfalse. -
from
Create a list from a variable number of arguments or an array ofint. The elements are copied from the argument to the internal buffer. -
removeAll
Default implementation uses a predicate for removal.- Specified by:
removeAllin interfaceIntCollection- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation uses a predicate for retaining.- Specified by:
retainAllin interfaceIntCollection- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation redirects toIntCollection.removeAll(IntPredicate)and negates the predicate.- Specified by:
retainAllin interfaceIntCollection- Returns:
- Returns the number of removed elements.
-
toString
Convert the contents of this container to a human-friendly string.
-