Returns the capacity of this queue.
Returns true if the queue is at capacity.
Pushes a new element in the queue.
Pushes a new element in the queue. On overflow, it starts to evict old elements from the queue.
the number of elements that were evicted in case of overflow or zero otherwise
Pushes the given sequence of elements on the queue.
Pushes the given sequence of elements on the queue. On overflow, it starts to evict old elements from the queue.
Returns the first element in the queue, and removes this element from the queue.
Returns the first element in the queue, and removes this element from the queue.
the first element of the queue.
java.util.NoSuchElementException
in case the queue is empty
Given an array, polls as many available elements in it as
can fit and returns the number of elements that were copied,
a number that will be equal to min(queue.length, array.length)
.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.