List based Queue.
Keeps a cyclic buffer of elements, and grows to a larger buffer when it fills up. This guarantees constant time peek and remove operations, and amortized constant time add operations.
The structure is efficient for any queue or stack usage.
ListQueue
containing all elements
. [...]
ListQueue
from elements
. [...]
true
if there are no elements in this collection. [...]
Iterator
that allows iterating the elements of this
Iterable
. [...]
value
at the end of the queue.
iterable
at the end of the queue. The
length of the queue is extended by the length of iterable
.
value
at the beginning of the queue.
value
at the end of the queue.
R
instances, if necessary. [...]
index
th element. [...]
f
to each element of this collection in iteration
order.
value
from the queue. [...]
test
. [...]
test
. [...]
test
. [...]
element
. [...]
test
. [...]
test
. [...]
other
. [...]
test
. [...]
f
on each element of this Iterable
in iteration order. [...]
test
. [...]
count
elements. [...]
Iterable
that skips leading elements while test
is satisfied. [...]
count
first elements of this iterable. [...]
test
. [...]
test
. [...]
T
. [...]