tiny.simd.vqPartialSort

1pub fn partialSort(2    comptime Key: type,3    comptime direction: key.Direction,4    values: []Key,5    k: usize,6) Error!void {7    if (k > values.len) return error.InvalidK;8    var scratch = network.Scratch{};9    var state = initialState(values.len);10    const valid = values.len - partition.nanToBack(Key, values);11    const prefix = @min(k, valid);12    if (prefix < valid) {13        selectRange(Key, direction, values[0..valid], prefix, &scratch, &state, maximum_levels);14    }15    sortRange(Key, direction, values[0..prefix], &scratch, &state, maximum_levels);16}

1pub const vqPartialSort = sort.partialSort;