Adds multiple elements, possibly overwriting the oldest elements in the stack.
Adds multiple elements, possibly overwriting the oldest elements in the stack. If the given iterable contains more elements that this stack can hold, then only the last maxSize elements will end up in the stack.
Pushes an element, possibly forcing out the oldest element in the stack.
Gets the element from the specified index in constant time.
Gets the element from the specified index in constant time.
Inserts an element 'i' positions down in the stack.
Inserts an element 'i' positions down in the stack. An 'i' value of 0 is the same as calling this += elem. This is a O(n) operation as elements need to be shifted around.
Removes the top element in the stack.
(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.
Replaces an element in the stack.
A "stack" with a bounded size. If you push a new element on the top when the stack is full, the oldest element gets dropped off the bottom.