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

pushFrontSliceAssumeCapacity

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

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.

Asserts that the deque can hold the additional items.

Params

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

File

deque.zig:207
207
208
209
210
211
212
213
214
215
216
217
218
        pub fn pushFrontSliceAssumeCapacity(deque: *Self, items: []const T) void {
            assert(deque.buffer.len - deque.len >= items.len);
            if (deque.head < items.len) {
                @memcpy(deque.buffer[0..deque.head], items[items.len - deque.head ..]);
                deque.head = deque.buffer.len - items.len + deque.head;
                @memcpy(deque.buffer[deque.head..], items.ptr);
            } else {
                deque.head -= items.len;
                @memcpy(deque.buffer[deque.head..][0..items.len], items);
            }
            deque.len += items.len;
        }