argMin

Function parameters

Parameters

T:type
items:[]const T
context:anytype
lessThan:fn (@TypeOf(context), lhs: T, rhs: T) bool

Type definitions in this namespace

Types

Mode

Functions in this namespace

Functions

block
pdq
pdqContext
insertion: Stable in-place sort.
insertionContext: Stable in-place sort.
heap: Unstable in-place sort.
heapContext: Unstable in-place sort.
asc: Use to generate a comparator function for a given type.
desc: Use to generate a comparator function for a given type.
binarySearch: Returns the index of an element in `items` returning `.eq` when given to `compareFn`.
lowerBound: Returns the index of the first element in `items` that is greater than or equal to `context`,
upperBound: Returns the index of the first element in `items` that is greater than `context`, as determined
partitionPoint: Returns the index of the partition point of `items` in relation to the given predicate.
equalRange: Returns a tuple of the lower and upper indices in `items` between which all
argMin
min
argMax
max
isSorted

Source

Implementation

pub fn argMin(
    comptime T: type,
    items: []const T,
    context: anytype,
    comptime lessThan: fn (@TypeOf(context), lhs: T, rhs: T) bool,
) ?usize {
    if (items.len == 0) {
        return null;
    }

    var smallest = items[0];
    var smallest_index: usize = 0;
    for (items[1..], 0..) |item, i| {
        if (lessThan(context, item, smallest)) {
            smallest = item;
            smallest_index = i + 1;
        }
    }

    return smallest_index;
}