Package com.carrotsearch.hppc
Class LongArrayList
java.lang.Object
com.carrotsearch.hppc.AbstractLongCollection
com.carrotsearch.hppc.LongArrayList
- All Implemented Interfaces:
LongCollection
,LongContainer
,LongIndexedContainer
,Preallocable
,Cloneable
,Iterable<LongCursor>
,RandomAccess
- Direct Known Subclasses:
LongStack
@Generated(date="2024-02-21T10:44:44+0000",
value="KTypeArrayList.java")
public class LongArrayList
extends AbstractLongCollection
implements LongIndexedContainer, Preallocable, Cloneable
An array-backed list of longs.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) static final class
An iterator implementation foriterator()
. -
Field Summary
FieldsModifier and TypeFieldDescriptionlong[]
Internal array for storing the list.int
Current number of elements stored inbuffer
.static final long[]
An immutable empty buffer (array).protected final ArraySizingStrategy
Buffer resizing strategy. -
Constructor Summary
ConstructorsConstructorDescriptionNew instance with sane defaults.LongArrayList
(int expectedElements) New instance with sane defaults.LongArrayList
(int expectedElements, ArraySizingStrategy resizer) New instance with sane defaults.LongArrayList
(LongContainer container) Creates a new list from the elements of another container in its iteration order. -
Method Summary
Modifier and TypeMethodDescriptionvoid
add
(long e1) Adds an element to the end of this container (the last index is incremented by one).final void
add
(long... elements) Vararg-signature method for adding elements at the end of the list.void
add
(long[] elements, int start, int length) Add all elements from a range of given array to the list.void
add
(long e1, long e2) Appends two elements at the end of the list.int
addAll
(LongContainer container) Adds all elements from another container.int
addAll
(Iterable<? extends LongCursor> iterable) Adds all elements from another iterable.void
clear()
Sets the number of stored elements to zero.clone()
Clone this object.boolean
contains
(long e1) Lookup a given element in the container.protected void
ensureBufferSpace
(int expectedAdditions) Ensures the internal buffer has enough free slots to storeexpectedAdditions
.void
ensureCapacity
(int expectedElements) Ensure this container can hold at least the given number of elements without resizing its buffers.protected boolean
equalElements
(LongArrayList other) Compare index-aligned elements against anotherLongIndexedContainer
.boolean
Returnstrue
only if the other object is an instance of the same class and with the same elements.<T extends LongProcedure>
TforEach
(T procedure) Applies aprocedure
to all container elements.<T extends LongProcedure>
TforEach
(T procedure, int fromIndex, int toIndex) Appliesprocedure
to a slice of the list,fromIndex
, inclusive, totoIndex
, exclusive.static LongArrayList
from
(long... elements) Create a list from a variable number of arguments or an array oflong
.long
get
(int index) int
hashCode()
int
indexOf
(long 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, long e1) Inserts the specified element at the specified position in this list.boolean
isEmpty()
Shortcut forsize() == 0
.iterator()
Returns an iterator to a cursor traversing the collection.int
lastIndexOf
(long 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.long
remove
(int index) Removes the element at the specified position in this container and returns it.int
removeAll
(long e1) Removes all occurrences ofe
from this collection.int
removeAll
(LongPredicate predicate) Removes all elements in this collection for which the given predicate returnstrue
.int
removeFirst
(long e1) Removes the first element that equalse1
, returning its deleted position or-1
if the element was not found.int
removeLast
(long e1) Removes the last element that equalse1
, 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 betweenfromIndex
, inclusive, andtoIndex
, exclusive.void
resize
(int newSize) Truncate or expand the list to the new size.long
set
(int index, long 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.long[]
toArray()
Default implementation of copying to an array.void
Trim the internal buffer to the current size.Methods inherited from class com.carrotsearch.hppc.AbstractLongCollection
removeAll, retainAll, retainAll, toString
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
Methods inherited from interface com.carrotsearch.hppc.LongCollection
removeAll, retainAll, retainAll
-
Field Details
-
EMPTY_ARRAY
public static final long[] EMPTY_ARRAYAn immutable empty buffer (array). -
buffer
public long[] 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
-
LongArrayList
public LongArrayList()New instance with sane defaults. -
LongArrayList
public LongArrayList(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements
- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
LongArrayList
New instance with sane defaults.- Parameters:
expectedElements
- The expected number of elements guaranteed not to cause buffer expansion (inclusive).resizer
- Underlying buffer sizing strategy.
-
LongArrayList
Creates a new list from the elements of another container in its iteration order.
-
-
Method Details
-
add
public void add(long e1) Adds an element to the end of this container (the last index is incremented by one).- Specified by:
add
in interfaceLongIndexedContainer
-
add
public void add(long e1, long 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(long[] elements, int start, int length) Add all elements from a range of given array to the list. -
add
public final void add(long... 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, long e1) Inserts the specified element at the specified position in this list.- Specified by:
insert
in interfaceLongIndexedContainer
- Parameters:
index
- The index at which the element should be inserted, shifting any existing and subsequent elements to the right.
-
get
public long get(int index) - Specified by:
get
in interfaceLongIndexedContainer
- Returns:
- Returns the element at index
index
from the list.
-
set
public long set(int index, long e1) Replaces the element at the specified position in this list with the specified element.- Specified by:
set
in interfaceLongIndexedContainer
- Returns:
- Returns the previous value in the list.
-
remove
public long remove(int index) Removes the element at the specified position in this container and returns it.- Specified by:
remove
in interfaceLongIndexedContainer
- See Also:
-
removeRange
public void removeRange(int fromIndex, int toIndex) Removes from this container all of the elements with indexes betweenfromIndex
, inclusive, andtoIndex
, exclusive.- Specified by:
removeRange
in interfaceLongIndexedContainer
-
removeFirst
public int removeFirst(long e1) Removes the first element that equalse1
, returning its deleted position or-1
if the element was not found.- Specified by:
removeFirst
in interfaceLongIndexedContainer
-
removeLast
public int removeLast(long e1) Removes the last element that equalse1
, returning its deleted position or-1
if the element was not found.- Specified by:
removeLast
in interfaceLongIndexedContainer
-
removeAll
public int removeAll(long e1) Removes all occurrences ofe
from this collection.- Specified by:
removeAll
in interfaceLongCollection
- 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(long 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:
contains
in interfaceLongContainer
- Returns:
- Returns
true
if this container has an element equal toe
.
-
indexOf
public int indexOf(long 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:
indexOf
in interfaceLongIndexedContainer
-
lastIndexOf
public int lastIndexOf(long 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:
lastIndexOf
in interfaceLongIndexedContainer
-
isEmpty
public boolean isEmpty()Shortcut forsize() == 0
.- Specified by:
isEmpty
in interfaceLongContainer
-
ensureCapacity
public void ensureCapacity(int expectedElements) Ensure this container can hold at least the given number of elements without resizing its buffers.- Specified by:
ensureCapacity
in 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 ornull
values). -
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:
size
in interfaceLongContainer
-
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 theelementsCount
field to zero.- Specified by:
clear
in interfaceLongCollection
- See Also:
-
release
public void release()Sets the number of stored elements to zero and releases the internal storage array.- Specified by:
release
in interfaceLongCollection
- See Also:
-
toArray
public long[] 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:
toArray
in interfaceLongContainer
- Overrides:
toArray
in classAbstractLongCollection
-
clone
Clone this object. The returned clone will reuse the same hash function and array resizing strategy. -
hashCode
public int hashCode() -
equals
Returnstrue
only if the other object is an instance of the same class and with the same elements. -
equalElements
Compare index-aligned elements against anotherLongIndexedContainer
. -
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 (LongCursor<long> c : container) { System.out.println("index=" + c.index + " value=" + c.value); }
- Specified by:
iterator
in interfaceIterable<LongCursor>
- Specified by:
iterator
in interfaceLongContainer
-
forEach
Applies aprocedure
to all container elements. Returns the argument (any subclass ofLongProcedure
. 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:
forEach
in interfaceLongContainer
-
forEach
Appliesprocedure
to a slice of the list,fromIndex
, inclusive, totoIndex
, exclusive. -
removeAll
Removes all elements in this collection for which the given predicate returnstrue
.- Specified by:
removeAll
in interfaceLongCollection
- Returns:
- Returns the number of removed elements.
-
forEach
Applies apredicate
to container elements as long, as the predicate returnstrue
. The iteration is interrupted otherwise.- Specified by:
forEach
in interfaceLongContainer
-
forEach
Appliespredicate
to 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 oflong
. The elements are copied from the argument to the internal buffer.
-