java.lang.Object
com.carrotsearch.hppc.ByteArrayDeque
- All Implemented Interfaces:
Accountable
,ByteCollection
,ByteContainer
,ByteDeque
,Preallocable
,Cloneable
,Iterable<ByteCursor>
@Generated(date="2024-06-04T15:20:17+0200",
value="KTypeArrayDeque.java")
public class ByteArrayDeque
extends Object
implements ByteDeque, Preallocable, Cloneable, Accountable
An array-backed
ByteDeque
.-
Field Summary
FieldsModifier and TypeFieldDescriptionbyte[]
Internal array for storing elements of the deque.int
The index of the element at the head of the deque or an arbitrary number equal to tail if the deque is empty.protected final ArraySizingStrategy
Buffer resizing strategy.int
The index at which the next element would be added to the tail of the deque. -
Constructor Summary
ConstructorsConstructorDescriptionNew instance with sane defaults.ByteArrayDeque
(int expectedElements) New instance with sane defaults.ByteArrayDeque
(int expectedElements, ArraySizingStrategy resizer) New instance with sane defaults.ByteArrayDeque
(ByteContainer container) Creates a new deque from elements of another container, appending elements at the end of the deque in the iteration order. -
Method Summary
Modifier and TypeMethodDescriptionvoid
addFirst
(byte e1) Inserts the specified element at the front of this deque.final void
addFirst
(byte... elements) Vararg-signature method for adding elements at the front of this deque.int
addFirst
(ByteContainer container) Inserts all elements from the given container to the front of this deque.int
addFirst
(Iterable<? extends ByteCursor> iterable) Inserts all elements from the given iterable to the front of this deque.void
addLast
(byte e1) Inserts the specified element at the end of this deque.final void
addLast
(byte... elements) Vararg-signature method for adding elements at the end of this deque.int
addLast
(ByteContainer container) Inserts all elements from the given container to the end of this deque.int
addLast
(Iterable<? extends ByteCursor> iterable) Inserts all elements from the given iterable to the end of this deque.int
bufferIndexOf
(byte e1) Return the index of the first (counting from head) element equal toe1
.void
clear()
Removes all elements from this collection.clone()
Clone this object.boolean
contains
(byte e) Lookup a given element in the container.<T extends ByteProcedure>
TdescendingForEach
(T procedure) Appliesprocedure
to all elements of this deque, tail to head.Returns a cursor over the values of this deque (in tail to head order).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
(ByteArrayDeque other) Compare order-aligned elements against anotherByteDeque
.boolean
Returnstrue
only if the other object is an instance of the same class and with the same elements.<T extends ByteProcedure>
TforEach
(T procedure) Applies aprocedure
to all container elements.static ByteArrayDeque
from
(byte... elements) Create a new deque by pushing a variable number of arguments to the end of it.byte
getFirst()
Retrieves the first element of this deque but does not remove it.byte
getLast()
Retrieves the last element of this deque but does not remove it.int
hashCode()
boolean
isEmpty()
Shortcut forsize() == 0
.iterator()
Returns a cursor over the values of this deque (in head to tail order).int
lastBufferIndexOf
(byte e1) Return the index of the last (counting from tail) element equal toe1
.protected static int
oneLeft
(int index, int modulus) Move one index to the left, wrapping around buffer.protected static int
oneRight
(int index, int modulus) Move one index to the right, wrapping around buffer.long
Allocated memory estimationlong
Bytes that is actually been usedvoid
release()
Release internal buffers of this deque and reallocate with the default buffer.int
removeAll
(byte e1) Removes all occurrences ofe
from this collection.int
Default implementation uses a predicate for removal.int
removeAll
(BytePredicate predicate) Removes all elements in this collection for which the given predicate returnstrue
.void
removeAtBufferIndex
(int index) Removes the element atindex
in the internal {#linkbuffer
array, returning its value.byte
Retrieves and removes the first element of this deque.int
removeFirst
(byte e1) Removes the first element that equalse
.byte
Retrieves and removes the last element of this deque.int
removeLast
(byte e1) Removes the last element that equalse
.int
Default implementation uses a predicate for retaining.int
retainAll
(BytePredicate predicate) Default implementation redirects toByteCollection.removeAll(BytePredicate)
and negates the predicate.int
size()
Return the current number of elements in this container.byte[]
toArray()
Default implementation of copying to an array.byte[]
toArray
(byte[] target) Copies elements of this deque to an array.toString()
Convert the contents of this container to a human-friendly string.Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface com.carrotsearch.hppc.ByteCollection
removeAll, retainAll, retainAll
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
buffer
public byte[] bufferInternal array for storing elements of the deque. -
head
public int headThe index of the element at the head of the deque or an arbitrary number equal to tail if the deque is empty. -
tail
public int tailThe index at which the next element would be added to the tail of the deque. -
resizer
Buffer resizing strategy.
-
-
Constructor Details
-
ByteArrayDeque
public ByteArrayDeque()New instance with sane defaults. -
ByteArrayDeque
public ByteArrayDeque(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements
- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
ByteArrayDeque
New instance with sane defaults.- Parameters:
expectedElements
- The expected number of elements guaranteed not to cause buffer expansion (inclusive).resizer
- Underlying buffer sizing strategy.
-
ByteArrayDeque
Creates a new deque from elements of another container, appending elements at the end of the deque in the iteration order.
-
-
Method Details
-
addFirst
public void addFirst(byte e1) Inserts the specified element at the front of this deque. -
addFirst
public final void addFirst(byte... elements) Vararg-signature method for adding elements at the front of this deque.This method is handy, but costly if used in tight loops (anonymous array passing)
- Parameters:
elements
- The elements to add.
-
addFirst
Inserts all elements from the given container to the front of this deque.- Parameters:
container
- The container to iterate over.- Returns:
- Returns the number of elements actually added as a result of this call.
-
addFirst
Inserts all elements from the given iterable to the front of this deque.- Parameters:
iterable
- The iterable to iterate over.- Returns:
- Returns the number of elements actually added as a result of this call.
-
addLast
public void addLast(byte e1) Inserts the specified element at the end of this deque. -
addLast
public final void addLast(byte... elements) Vararg-signature method for adding elements at the end of this deque.This method is handy, but costly if used in tight loops (anonymous array passing)
- Parameters:
elements
- The elements to iterate over.
-
addLast
Inserts all elements from the given container to the end of this deque.- Parameters:
container
- The container to iterate over.- Returns:
- Returns the number of elements actually added as a result of this call.
-
addLast
Inserts all elements from the given iterable to the end of this deque.- Parameters:
iterable
- The iterable to iterate over.- Returns:
- Returns the number of elements actually added as a result of this call.
-
removeFirst
public byte removeFirst()Retrieves and removes the first element of this deque.- Specified by:
removeFirst
in interfaceByteDeque
- Returns:
- the head (first) element of this deque.
-
removeLast
public byte removeLast()Retrieves and removes the last element of this deque.- Specified by:
removeLast
in interfaceByteDeque
- Returns:
- the tail of this deque.
-
getFirst
public byte getFirst()Retrieves the first element of this deque but does not remove it. -
getLast
public byte getLast()Retrieves the last element of this deque but does not remove it. -
removeFirst
public int removeFirst(byte e1) Removes the first element that equalse
.- Specified by:
removeFirst
in interfaceByteDeque
- Returns:
- The deleted element's index or
-1
if the element was not found.
-
bufferIndexOf
public int bufferIndexOf(byte e1) Return the index of the first (counting from head) element equal toe1
. The index points to thebuffer
array.- Parameters:
e1
- The element to look for.- Returns:
- Returns the index of the first element equal to
e1
or-1
if not found.
-
removeLast
public int removeLast(byte e1) Removes the last element that equalse
.- Specified by:
removeLast
in interfaceByteDeque
- Returns:
- The deleted element's index or
-1
if the element was not found.
-
lastBufferIndexOf
public int lastBufferIndexOf(byte e1) Return the index of the last (counting from tail) element equal toe1
. The index points to thebuffer
array.- Parameters:
e1
- The element to look for.- Returns:
- Returns the index of the first element equal to
e1
or-1
if not found.
-
removeAll
public int removeAll(byte e1) Removes all occurrences ofe
from this collection.- Specified by:
removeAll
in interfaceByteCollection
- Parameters:
e1
- Element to be removed from this collection, if present.- Returns:
- The number of removed elements as a result of this call.
-
removeAtBufferIndex
public void removeAtBufferIndex(int index) Removes the element atindex
in the internal {#linkbuffer
array, returning its value. -
isEmpty
public boolean isEmpty()Shortcut forsize() == 0
.- Specified by:
isEmpty
in interfaceByteContainer
-
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 interfaceByteContainer
-
clear
public void clear()Removes all elements from this collection.The internal array buffers are not released as a result of this call.
- Specified by:
clear
in interfaceByteCollection
- See Also:
-
release
public void release()Release internal buffers of this deque and reallocate with the default buffer.- Specified by:
release
in interfaceByteCollection
- See Also:
-
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. -
toArray
public byte[] toArray()Default implementation of copying to an array.- Specified by:
toArray
in interfaceByteContainer
-
toArray
public byte[] toArray(byte[] target) Copies elements of this deque to an array. The content of thetarget
array is filled from index 0 (head of the queue) to indexsize() - 1
(tail of the queue).- Parameters:
target
- The target array must be large enough to hold all elements.- Returns:
- Returns the target argument for chaining.
-
clone
Clone this object. The returned clone will reuse the same hash function and array resizing strategy. -
oneLeft
protected static int oneLeft(int index, int modulus) Move one index to the left, wrapping around buffer. -
oneRight
protected static int oneRight(int index, int modulus) Move one index to the right, wrapping around buffer. -
ramBytesAllocated
public long ramBytesAllocated()Description copied from interface:Accountable
Allocated memory estimation- Specified by:
ramBytesAllocated
in interfaceAccountable
- Returns:
- Ram allocated in bytes
-
ramBytesUsed
public long ramBytesUsed()Description copied from interface:Accountable
Bytes that is actually been used- Specified by:
ramBytesUsed
in interfaceAccountable
- Returns:
- Ram used in bytes
-
iterator
Returns a cursor over the values of this deque (in head to tail order). The iterator is implemented as a cursor and it returns the same cursor instance on every call toIterator.next()
(to avoid boxing of primitive types). To read the current value (or index in the deque's buffer) use the cursor's public fields. An example is shown below.for (IntValueCursor c : intDeque) { System.out.println("buffer index=" + c.index + " value=" + c.value); }
- Specified by:
iterator
in interfaceByteContainer
- Specified by:
iterator
in interfaceIterable<ByteCursor>
-
descendingIterator
Returns a cursor over the values of this deque (in tail to head order). The iterator is implemented as a cursor and it returns the same cursor instance on every call toIterator.next()
(to avoid boxing of primitive types). To read the current value (or index in the deque's buffer) use the cursor's public fields. An example is shown below.for (Iterator<IntCursor> i = intDeque.descendingIterator(); i.hasNext();) { final IntCursor c = i.next(); System.out.println("buffer index=" + c.index + " value=" + c.value); }
- Specified by:
descendingIterator
in interfaceByteDeque
- Returns:
- An iterator over elements in this deque in tail-to-head order.
-
forEach
Applies aprocedure
to all container elements. Returns the argument (any subclass ofByteProcedure
. 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 interfaceByteContainer
-
forEach
Applies apredicate
to container elements as long, as the predicate returnstrue
. The iteration is interrupted otherwise.- Specified by:
forEach
in interfaceByteContainer
-
descendingForEach
Appliesprocedure
to all elements of this deque, tail to head.- Specified by:
descendingForEach
in interfaceByteDeque
-
descendingForEach
Applies apredicate
to container elements as long, as the predicate returnstrue
. The iteration is interrupted otherwise.- Specified by:
descendingForEach
in interfaceByteDeque
-
removeAll
Removes all elements in this collection for which the given predicate returnstrue
.- Specified by:
removeAll
in interfaceByteCollection
- Returns:
- Returns the number of removed elements.
-
contains
public boolean contains(byte e) 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 interfaceByteContainer
- Returns:
- Returns
true
if this container has an element equal toe
.
-
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 order-aligned elements against anotherByteDeque
. -
from
Create a new deque by pushing a variable number of arguments to the end of it. -
removeAll
Default implementation uses a predicate for removal.- Specified by:
removeAll
in interfaceByteCollection
- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation uses a predicate for retaining.- Specified by:
retainAll
in interfaceByteCollection
- Returns:
- Returns the number of removed elements.
-
retainAll
Default implementation redirects toByteCollection.removeAll(BytePredicate)
and negates the predicate.- Specified by:
retainAll
in interfaceByteCollection
- Returns:
- Returns the number of removed elements.
-
toString
Convert the contents of this container to a human-friendly string.
-