feature. See also
. The project being documented here (as the example) is the Zig library itself.
block.findFirstForward
fn findFirstForward(
comptime T: type,
items: []T,
value: T,
range: Range,
unique: usize,
context: anytype,
comptime lessThan: fn (@TypeOf(context), lhs: T, rhs: T) bool,
) usize
File
Code
fn findFirstForward(
comptime T: type,
items: []T,
value: T,
range: Range,
unique: usize,
context: anytype,
comptime lessThan: fn (@TypeOf(context), lhs: T, rhs: T) bool,
) usize {
if (range.length() == 0) return range.start;
const skip = @max(range.length() / unique, @as(usize, 1));
var index = range.start + skip;
while (lessThan(context, items[index - 1], value)) : (index += skip) {
if (index >= range.end - skip) {
return binaryFirst(T, items, value, Range.init(index, range.end), context, lessThan);
}
}
return binaryFirst(T, items, value, Range.init(index - skip, index), context, lessThan);
}