diff --git a/docs/-kubit/kubit.collections.deque/-double-deque/-double-deque.html b/docs/-kubit/kubit.collections.deque/-double-deque/-double-deque.html new file mode 100644 index 0000000..3b42802 --- /dev/null +++ b/docs/-kubit/kubit.collections.deque/-double-deque/-double-deque.html @@ -0,0 +1,130 @@ + + +
+ +Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from last to first, invoking action for each element.
DoubleDeque is a double-ended queue for Double values backed by a circular buffer.
Amortized O(1) insertion/removal at both ends.
Indexed access, insertion and removal are supported (may shift elements internally).
Not thread-safe: synchronize externally if multiple threads mutate concurrently.
if initialCapacity is negative.
Returns a live MutableList view backed by this deque. Structural changes are reflected both ways.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from first to last, passing the logical index and value to action.
Iterates elements from last to first, invoking action for each element.
Iterates elements from last to first, passing the logical index and value to action.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the last element.
Removes and returns the last element, or null if the deque is empty.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the first element.
if the deque is empty.
Removes and returns the last element, or null if the deque is empty.
Removes and returns the last element.
if the deque is empty.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from last to first, invoking action for each element.
FloatDeque is a double-ended queue for Float values backed by a circular buffer.
Amortized O(1) insertion/removal at both ends.
Indexed access, insertion and removal are supported (may shift elements internally).
Not thread-safe: synchronize externally if multiple threads mutate concurrently.
if initialCapacity is negative.
Returns a live MutableList view backed by this deque. Structural changes are reflected both ways.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from first to last, passing the logical index and value to action.
Iterates elements from last to first, invoking action for each element.
Iterates elements from last to first, passing the logical index and value to action.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the last element.
Removes and returns the last element, or null if the deque is empty.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the first element.
if the deque is empty.
Removes and returns the last element, or null if the deque is empty.
Removes and returns the last element.
if the deque is empty.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from last to first, invoking action for each element.
IntDeque is a double-ended queue for Int values backed by a circular buffer.
Amortized O(1) insertion/removal at both ends.
Indexed access, insertion and removal are supported (may shift elements internally).
Not thread-safe: synchronize externally if multiple threads mutate concurrently.
if initialCapacity is negative.
Returns a live MutableList view backed by this deque. Structural changes are reflected both ways.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from first to last, passing the logical index and value to action.
Iterates elements from last to first, invoking action for each element.
Iterates elements from last to first, passing the logical index and value to action.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the last element.
Removes and returns the last element, or null if the deque is empty.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the first element.
if the deque is empty.
Removes and returns the last element, or null if the deque is empty.
Removes and returns the last element.
if the deque is empty.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from last to first, invoking action for each element.
LongDeque is a double-ended queue for Long values backed by a circular buffer.
Amortized O(1) insertion/removal at both ends.
Indexed access, insertion and removal are supported (may shift elements internally).
Not thread-safe: synchronize externally if multiple threads mutate concurrently.
if initialCapacity is negative.
Returns a live MutableList view backed by this deque. Structural changes are reflected both ways.
Dequeues and returns the front element (queue-style). Alias for removeFirst.
Returns the first element, or null if this deque is empty.
Iterates elements from first to last, passing the logical index and value to action.
Iterates elements from last to first, invoking action for each element.
Iterates elements from last to first, passing the logical index and value to action.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the last element.
Removes and returns the last element, or null if the deque is empty.
Returns true if this deque contains one or more elements.
Returns the index of the last occurrence of value, or -1 if not found.
Returns the last element, or null if this deque is empty.
Pops and returns the front element (stack-style). Alias for removeFirst.
Removes and returns the first element, or null if the deque is empty.
Removes and returns the first element.
if the deque is empty.
Removes and returns the last element, or null if the deque is empty.
Removes and returns the last element.
if the deque is empty.
Returns a live MutableList view backed by this deque. Structural changes are reflected both ways.
DoubleDeque is a double-ended queue for Double values backed by a circular buffer.
FloatDeque is a double-ended queue for Float values backed by a circular buffer.
Returns a live MutableList view backed by this deque. Structural changes are reflected both ways.
Performs the given action for each element in this sublist, providing its index relative to this sublist.
This method is faster and more efficient than List.forEachIndexed.
The function to be executed
Performs the given action for each element in this sublist, providing its index relative to this sublist.
This method is faster and more efficient than List.forEachIndexed.
The function to be executed