java.lang.Object
com.carrotsearch.hppc.DoubleArrayList
- All Implemented Interfaces:
Accountable,DoubleCollection,DoubleContainer,DoubleIndexedContainer,Preallocable,Cloneable,Iterable<DoubleCursor>,RandomAccess
- Direct Known Subclasses:
DoubleStack
@Generated(date="2024-06-04T15:20:17+0200",
value="KTypeArrayList.java")
public class DoubleArrayList
extends Object
implements DoubleIndexedContainer, Preallocable, Cloneable, Accountable
An array-backed list of doubles.
-
Field Summary
FieldsModifier and TypeFieldDescriptiondouble[]Internal array for storing the list.intCurrent number of elements stored inbuffer.static final double[]An immutable empty buffer (array).protected final ArraySizingStrategyBuffer resizing strategy. -
Constructor Summary
ConstructorsConstructorDescriptionNew instance with sane defaults.DoubleArrayList(int expectedElements) New instance with sane defaults.DoubleArrayList(int expectedElements, ArraySizingStrategy resizer) New instance with sane defaults.DoubleArrayList(DoubleContainer container) Creates a new list from the elements of another container in its iteration order. -
Method Summary
Modifier and TypeMethodDescriptionvoidadd(double e1) Adds an element to the end of this container (the last index is incremented by one).final voidadd(double... elements) Vararg-signature method for adding elements at the end of the list.voidadd(double[] elements, int start, int length) Add all elements from a range of given array to the list.voidadd(double e1, double e2) Appends two elements at the end of the list.intaddAll(DoubleContainer container) Adds all elements from another container.intaddAll(Iterable<? extends DoubleCursor> iterable) Adds all elements from another iterable.voidclear()Sets the number of stored elements to zero.clone()Clone this object.booleancontains(double 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(DoubleArrayList other) Compare index-aligned elements against anotherDoubleIndexedContainer.booleanReturnstrueonly if the other object is an instance of the same class and with the same elements.<T extends DoubleProcedure>
TforEach(T procedure) Applies aprocedureto all container elements.<T extends DoubleProcedure>
TforEach(T procedure, int fromIndex, int toIndex) Appliesprocedureto a slice of the list,fromIndex, inclusive, totoIndex, exclusive.static DoubleArrayListfrom(double... elements) Create a list from a variable number of arguments or an array ofdouble.doubleget(int index) inthashCode()intindexOf(double 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, double 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(double 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(double e1) Removes all occurrences ofefrom this collection.intDefault implementation uses a predicate for removal.intremoveAll(DoublePredicate predicate) Removes all elements in this collection for which the given predicate returnstrue.doubleremoveAt(int index) Removes the element at the specified position in this container and returns it.booleanremoveElement(double e1) Removes the first element that equalse1, returning whether an element has been removed.intremoveFirst(double e1) Removes the first element that equalse1, returning its deleted position or-1if the element was not found.doubleRemoves and returns the last element of this container.intremoveLast(double 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(DoublePredicate predicate) Default implementation redirects toDoubleCollection.removeAll(DoublePredicate)and negates the predicate.reverse()Reverses the elements in this container and returns this container.doubleset(int index, double 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.double[]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.DoubleCollection
removeAll, retainAll, retainAllMethods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
EMPTY_ARRAY
public static final double[] EMPTY_ARRAYAn immutable empty buffer (array). -
buffer
public double[] 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
-
DoubleArrayList
public DoubleArrayList()New instance with sane defaults. -
DoubleArrayList
public DoubleArrayList(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
DoubleArrayList
New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).resizer- Underlying buffer sizing strategy.
-
DoubleArrayList
Creates a new list from the elements of another container in its iteration order.
-
-
Method Details
-
add
public void add(double e1) Adds an element to the end of this container (the last index is incremented by one).- Specified by:
addin interfaceDoubleIndexedContainer
-
add
public void add(double e1, double 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(double[] elements, int start, int length) Add all elements from a range of given array to the list. -
add
public final void add(double... 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, double e1) Inserts the specified element at the specified position in this list.- Specified by:
insertin interfaceDoubleIndexedContainer- Parameters:
index- The index at which the element should be inserted, shifting any existing and subsequent elements to the right.
-
get
public double get(int index) - Specified by:
getin interfaceDoubleIndexedContainer- Returns:
- Returns the element at index
indexfrom the list.
-
set
public double set(int index, double e1) Replaces the element at the specified position in this list with the specified element.- Specified by:
setin interfaceDoubleIndexedContainer- Returns:
- Returns the previous value in the list.
-
removeAt
public double removeAt(int index) Removes the element at the specified position in this container and returns it.- Specified by:
removeAtin interfaceDoubleIndexedContainer- See Also:
-
removeLast
public double removeLast()Removes and returns the last element of this container. This container must not be empty.- Specified by:
removeLastin interfaceDoubleIndexedContainer
-
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 interfaceDoubleIndexedContainer
-
removeElement
public boolean removeElement(double e1) Removes the first element that equalse1, returning whether an element has been removed.- Specified by:
removeElementin interfaceDoubleIndexedContainer
-
removeFirst
public int removeFirst(double e1) Removes the first element that equalse1, returning its deleted position or-1if the element was not found.- Specified by:
removeFirstin interfaceDoubleIndexedContainer
-
removeLast
public int removeLast(double e1) Removes the last element that equalse1, returning its deleted position or-1if the element was not found.- Specified by:
removeLastin interfaceDoubleIndexedContainer
-
removeAll
public int removeAll(double e1) Removes all occurrences ofefrom this collection.- Specified by:
removeAllin interfaceDoubleCollection- 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(double 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 interfaceDoubleContainer- Returns:
- Returns
trueif this container has an element equal toe.
-
indexOf
public int indexOf(double 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 interfaceDoubleIndexedContainer
-
lastIndexOf
public int lastIndexOf(double 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 interfaceDoubleIndexedContainer
-
isEmpty
public boolean isEmpty()Shortcut forsize() == 0.- Specified by:
isEmptyin interfaceDoubleContainer
-
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 interfaceDoubleContainer
-
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 interfaceDoubleCollection- See Also:
-
release
public void release()Sets the number of stored elements to zero and releases the internal storage array.- Specified by:
releasein interfaceDoubleCollection- See Also:
-
toArray
public double[] 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 interfaceDoubleContainer
-
stream
Description copied from interface:DoubleIndexedContainerReturns this container elements as a stream.- Specified by:
streamin interfaceDoubleIndexedContainer
-
sort
Sorts the elements in this container and returns this container.- Specified by:
sortin interfaceDoubleIndexedContainer
-
reverse
Reverses the elements in this container and returns this container.- Specified by:
reversein interfaceDoubleIndexedContainer
-
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 anotherDoubleIndexedContainer. -
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 (DoubleCursor<double> c : container) { System.out.println("index=" + c.index + " value=" + c.value); }- Specified by:
iteratorin interfaceDoubleContainer- Specified by:
iteratorin interfaceIterable<DoubleCursor>
-
forEach
Applies aprocedureto all container elements. Returns the argument (any subclass ofDoubleProcedure. 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 interfaceDoubleContainer
-
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 interfaceDoubleCollection- 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 interfaceDoubleContainer
-
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 ofdouble. The elements are copied from the argument to the internal buffer. -
removeAll
Default implementation uses a predicate for removal.- Specified by:
removeAllin interfaceDoubleCollection- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation uses a predicate for retaining.- Specified by:
retainAllin interfaceDoubleCollection- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation redirects toDoubleCollection.removeAll(DoublePredicate)and negates the predicate.- Specified by:
retainAllin interfaceDoubleCollection- Returns:
- Returns the number of removed elements.
-
toString
Convert the contents of this container to a human-friendly string.
-