Zig 0.17.0-dev (Split by item)

Shortcut keys
?
Show these tips
S
Focus search field
Esc
Clear focus & close tips
U
Jump to source code
↑
Move up in search results
↓
Move down in search results
↵
Go to active search result
This is an example of documentation generated by ZigDoc, an alternative to Zig's built-in Auto Doc feature. See also examples in other modes/formats. The project being documented here (as the example) is the Zig standard library. Public Function

pushFrontSliceBounded

Public Function
std.deque.Deque.pushFrontSliceBounded
pub fn pushFrontSliceBounded(deque: *Self, items: []const T) error

Add items to the front of the deque. This is equivalent to iterating items in reverse and calling pushFront on every single entry.

Never invalidates element pointers.

If the deque lacks unused capacity for the additional items, returns error.OutOfMemory.

Params

  • deque: *Self
  • items: []const T

File

deque.zig:195
195
196
197
198
        pub fn pushFrontSliceBounded(deque: *Self, items: []const T) error{OutOfMemory}!void {
            if (deque.buffer.len - deque.len < items.len) return error.OutOfMemory;
            return deque.pushFrontSliceAssumeCapacity(items);
        }