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. Private Function

unguardedInsertionContext

Private Function
std.sort.pdq.unguardedInsertionContext
fn unguardedInsertionContext(a: usize, b: usize, context: anytype) void

Insertion sort that assumes items[a-1] exists and is <= all elements in [a, b), allowing the inner loop to skip the bounds check.

Params

  • a: usize
  • b: usize
  • context

File

sort/pdq.zig:140
140
141
142
143
144
145
146
147
148
fn unguardedInsertionContext(a: usize, b: usize, context: anytype) void {
    var i = a + 1;
    while (i < b) : (i += 1) {
        var j = i;
        while (context.lessThan(j, j - 1)) : (j -= 1) {
            context.swap(j, j - 1);
        }
    }
}