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

insertAssumeCapacity

Public Function
std.array_list.Aligned.insertAssumeCapacity
pub fn insertAssumeCapacity(self: *Self, index: usize, item: T) void

Insert item at index index. Moves list[index .. list.len] to higher indices to make room. If index is equal to the length of the list this operation is equivalent to appendAssumeCapacity. This operation is O(N). Invalidates pre-existing pointers to elements at and after index. Asserts that the list has capacity for one additional item. Asserts that the index is in bounds or equal to the length.

Params

  • self: *Self
  • index: usize
  • item: T

File

array_list.zig:822
822
823
824
825
826
827
828
        pub fn insertAssumeCapacity(self: *Self, index: usize, item: T) void {
            self.pointer_stability.assertUnlocked();
            assert(self.items.len < self.capacity);
            self.items.len += 1;
            @memmove(self.items[index + 1 .. self.items.len], self.items[index .. self.items.len - 1]);
            self.items[index] = item;
        }