java.lang.Object
com.carrotsearch.hppc.ObjectArrayList<KType>
- All Implemented Interfaces:
Accountable,ObjectCollection<KType>,ObjectContainer<KType>,ObjectIndexedContainer<KType>,Preallocable,Cloneable,Iterable<ObjectCursor<KType>>,RandomAccess
- Direct Known Subclasses:
ObjectStack
@Generated(date="2024-06-04T15:20:17+0200",
value="KTypeArrayList.java")
public class ObjectArrayList<KType>
extends Object
implements ObjectIndexedContainer<KType>, Preallocable, Cloneable, Accountable
An array-backed list of Objects.
-
Field Summary
FieldsModifier and TypeFieldDescriptionObject[]Internal array for storing the list.intCurrent number of elements stored inbuffer.static final Object[]An immutable empty buffer (array).protected final ArraySizingStrategyBuffer resizing strategy. -
Constructor Summary
ConstructorsConstructorDescriptionNew instance with sane defaults.ObjectArrayList(int expectedElements) New instance with sane defaults.ObjectArrayList(int expectedElements, ArraySizingStrategy resizer) New instance with sane defaults.ObjectArrayList(ObjectContainer<? extends KType> container) Creates a new list from the elements of another container in its iteration order. -
Method Summary
Modifier and TypeMethodDescriptionvoidAdds an element to the end of this container (the last index is incremented by one).final voidVararg-signature method for adding elements at the end of the list.voidAdd all elements from a range of given array to the list.voidAppends two elements at the end of the list.intaddAll(ObjectContainer<? extends KType> container) Adds all elements from another container.intaddAll(Iterable<? extends ObjectCursor<? extends KType>> iterable) Adds all elements from another iterable.voidclear()Sets the number of stored elements to zero.clone()Clone this object.booleanLookup 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(ObjectArrayList<?> other) Compare index-aligned elements against anotherObjectIndexedContainer.booleanReturnstrueonly if the other object is an instance of the same class and with the same elements.protected boolean<T extends ObjectProcedure<? super KType>>
TforEach(T procedure) Applies aprocedureto all container elements.<T extends ObjectProcedure<? super KType>>
TforEach(T procedure, int fromIndex, int toIndex) Appliesprocedureto a slice of the list,fromIndex, inclusive, totoIndex, exclusive.static <KType> ObjectArrayList<KType> from(KType... elements) Create a list from a variable number of arguments or an array ofObject.get(int index) inthashCode()intReturns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.voidInserts 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(KType 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(ObjectLookupContainer<? super KType> c) Default implementation uses a predicate for removal.intremoveAll(ObjectPredicate<? super KType> predicate) Removes all elements in this collection for which the given predicate returnstrue.intRemoves all occurrences ofefrom this collection.removeAt(int index) Removes the element at the specified position in this container and returns it.booleanremoveElement(KType e1) Removes the first element that equalse1, returning whether an element has been removed.intremoveFirst(KType e1) Removes the first element that equalse1, returning its deleted position or-1if the element was not found.Removes and returns the last element of this container.intremoveLast(KType 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.intretainAll(ObjectLookupContainer<? super KType> c) Default implementation uses a predicate for retaining.intretainAll(ObjectPredicate<? super KType> predicate) Default implementation redirects toObjectCollection.removeAll(ObjectPredicate)and negates the predicate.reverse()Reverses the elements in this container and returns this container.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.Object[]toArray()Default implementation of copying to an array.<T> T[]Copies all elements of this container to a dynamically created array of the given component type.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 java.lang.Iterable
forEach, spliteratorMethods inherited from interface com.carrotsearch.hppc.ObjectCollection
removeAll, retainAll, retainAllMethods inherited from interface com.carrotsearch.hppc.ObjectContainer
toArray
-
Field Details
-
Constructor Details
-
ObjectArrayList
public ObjectArrayList()New instance with sane defaults. -
ObjectArrayList
public ObjectArrayList(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
ObjectArrayList
New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).resizer- Underlying buffer sizing strategy.
-
ObjectArrayList
Creates a new list from the elements of another container in its iteration order.
-
-
Method Details
-
add
Adds an element to the end of this container (the last index is incremented by one).- Specified by:
addin interfaceObjectIndexedContainer<KType>
-
add
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
Add all elements from a range of given array to the list. -
add
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
Inserts the specified element at the specified position in this list.- Specified by:
insertin interfaceObjectIndexedContainer<KType>- Parameters:
index- The index at which the element should be inserted, shifting any existing and subsequent elements to the right.
-
get
- Specified by:
getin interfaceObjectIndexedContainer<KType>- Returns:
- Returns the element at index
indexfrom the list.
-
set
Replaces the element at the specified position in this list with the specified element.- Specified by:
setin interfaceObjectIndexedContainer<KType>- Returns:
- Returns the previous value in the list.
-
removeAt
Removes the element at the specified position in this container and returns it.- Specified by:
removeAtin interfaceObjectIndexedContainer<KType>- See Also:
-
removeLast
Removes and returns the last element of this container. This container must not be empty.- Specified by:
removeLastin interfaceObjectIndexedContainer<KType>
-
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 interfaceObjectIndexedContainer<KType>
-
removeElement
Removes the first element that equalse1, returning whether an element has been removed.- Specified by:
removeElementin interfaceObjectIndexedContainer<KType>
-
removeFirst
Removes the first element that equalse1, returning its deleted position or-1if the element was not found.- Specified by:
removeFirstin interfaceObjectIndexedContainer<KType>
-
removeLast
Removes the last element that equalse1, returning its deleted position or-1if the element was not found.- Specified by:
removeLastin interfaceObjectIndexedContainer<KType>
-
removeAll
Removes all occurrences ofefrom this collection.- Specified by:
removeAllin interfaceObjectCollection<KType>- Parameters:
e1- Element to be removed from this collection, if present.- Returns:
- The number of removed elements as a result of this call.
-
contains
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 interfaceObjectContainer<KType>- Returns:
- Returns
trueif this container has an element equal toe.
-
indexOf
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 interfaceObjectIndexedContainer<KType>
-
lastIndexOf
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 interfaceObjectIndexedContainer<KType>
-
isEmpty
public boolean isEmpty()Shortcut forsize() == 0.- Specified by:
isEmptyin interfaceObjectContainer<KType>
-
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 interfaceObjectContainer<KType>
-
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 interfaceObjectCollection<KType>- See Also:
-
release
public void release()Sets the number of stored elements to zero and releases the internal storage array.- Specified by:
releasein interfaceObjectCollection<KType>- See Also:
-
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 interfaceObjectContainer<KType>
-
stream
Returns this container elements as a stream.- Specified by:
streamin interfaceObjectIndexedContainer<KType>
-
sort
Sorts the elements in this container and returns this container.- Specified by:
sortin interfaceObjectIndexedContainer<KType>
-
reverse
Reverses the elements in this container and returns this container.- Specified by:
reversein interfaceObjectIndexedContainer<KType>
-
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. Equality comparison is performed with this object'sequals(Object, Object)method. -
equalElements
Compare index-aligned elements against anotherObjectIndexedContainer. Equality comparison is performed with this object'sequals(Object, Object)method. -
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 (ObjectCursor<Object> c : container) { System.out.println("index=" + c.index + " value=" + c.value); } -
forEach
Applies aprocedureto all container elements. Returns the argument (any subclass ofObjectProcedure. 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 interfaceObjectContainer<KType>
-
forEach
public <T extends ObjectProcedure<? super KType>> T forEach(T procedure, int fromIndex, int toIndex) 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 interfaceObjectCollection<KType>- 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 interfaceObjectContainer<KType>
-
forEach
public <T extends ObjectPredicate<? super KType>> T forEach(T predicate, int fromIndex, int toIndex) 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 ofObject. The elements are copied from the argument to the internal buffer. -
removeAll
Default implementation uses a predicate for removal.- Specified by:
removeAllin interfaceObjectCollection<KType>- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation uses a predicate for retaining.- Specified by:
retainAllin interfaceObjectCollection<KType>- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation redirects toObjectCollection.removeAll(ObjectPredicate)and negates the predicate.- Specified by:
retainAllin interfaceObjectCollection<KType>- Returns:
- Returns the number of removed elements.
-
toArray
Description copied from interface:ObjectContainerCopies all elements of this container to a dynamically created array of the given component type.- Specified by:
toArrayin interfaceObjectContainer<KType>
-
toString
Convert the contents of this container to a human-friendly string. -
equals
-