pub fn pushBackSliceBounded(deque: *Self, items: []const T) error deque: *Selfitems: []const T238
239
240
241 pub fn pushBackSliceBounded(deque: *Self, items: []const T) error{OutOfMemory}!void {
if (deque.buffer.len - deque.len < items.len) return error.OutOfMemory;
return deque.pushBackSliceAssumeCapacity(items);
}
Add
itemsto the back of the deque. This is equivalent to iteratingitemsin order and callingpushBackon every single entry.Never invalidates element pointers.
If the deque lacks unused capacity for the additional items, returns
error.OutOfMemory.