Brunobkr/llama.cpp_AlgMor24_github

1import max from "./max.js";2import maxIndex from "./maxIndex.js";3import min from "./min.js";4import minIndex from "./minIndex.js";5import quickselect from "./quickselect.js";6import number, {numbers} from "./number.js";7import {ascendingDefined} from "./sort.js";8import greatest from "./greatest.js";9 10export default function quantile(values, p, valueof) {11  values = Float64Array.from(numbers(values, valueof));12  if (!(n = values.length) || isNaN(p = +p)) return;13  if (p <= 0 || n < 2) return min(values);14  if (p >= 1) return max(values);15  var n,16      i = (n - 1) * p,17      i0 = Math.floor(i),18      value0 = max(quickselect(values, i0).subarray(0, i0 + 1)),19      value1 = min(values.subarray(i0 + 1));20  return value0 + (value1 - value0) * (i - i0);21}22 23export function quantileSorted(values, p, valueof = number) {24  if (!(n = values.length) || isNaN(p = +p)) return;25  if (p <= 0 || n < 2) return +valueof(values[0], 0, values);26  if (p >= 1) return +valueof(values[n - 1], n - 1, values);27  var n,28      i = (n - 1) * p,29      i0 = Math.floor(i),30      value0 = +valueof(values[i0], i0, values),31      value1 = +valueof(values[i0 + 1], i0 + 1, values);32  return value0 + (value1 - value0) * (i - i0);33}34 35export function quantileIndex(values, p, valueof = number) {36  if (isNaN(p = +p)) return;37  numbers = Float64Array.from(values, (_, i) => number(valueof(values[i], i, values)));38  if (p <= 0) return minIndex(numbers);39  if (p >= 1) return maxIndex(numbers);40  var numbers,41      index = Uint32Array.from(values, (_, i) => i),42      j = numbers.length - 1,43      i = Math.floor(j * p);44  quickselect(index, i, 0, j, (i, j) => ascendingDefined(numbers[i], numbers[j]));45  i = greatest(index.subarray(0, i + 1), (i) => numbers[i]);46  return i >= 0 ? i : -1;47}48