pub fn pushFrontBounded(deque: *Self, item: T) error deque: *Selfitem: T126
127
128
129 pub fn pushFrontBounded(deque: *Self, item: T) error{OutOfMemory}!void {
if (deque.buffer.len - deque.len == 0) return error.OutOfMemory;
return deque.pushFrontAssumeCapacity(item);
}
Add one item to the front of the deque.
Never invalidates element pointers.
If the deque lacks unused capacity for the additional item, returns
error.OutOfMemory.