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

insertBounded

Public Function
std.array_list.Aligned.insertBounded
pub fn insertBounded(self: *Self, i: usize, item: T) error

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 index is in bounds or equal to the length. If the list lacks unused capacity for the additional item, returns error.OutOfMemory.

Params

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

File

array_list.zig:838
838
839
840
841
        pub fn insertBounded(self: *Self, i: usize, item: T) error{OutOfMemory}!void {
            if (self.capacity - self.items.len == 0) return error.OutOfMemory;
            return insertAssumeCapacity(self, i, item);
        }