@piwitests/server 0.25.0 → 0.26.0

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/greatest.js

@@ -1,29 +0,0 @@
-import ascending from "./ascending.js";
-
-export default function greatest(values, compare = ascending) {
-  let max;
-  let defined = false;
-  if (compare.length === 1) {
-    let maxValue;
-    for (const element of values) {
-      const value = compare(element);
-      if (defined
-          ? ascending(value, maxValue) > 0
-          : ascending(value, value) === 0) {
-        max = element;
-        maxValue = value;
-        defined = true;
-      }
-    }
-  } else {
-    for (const value of values) {
-      if (defined
-          ? compare(value, max) > 0
-          : compare(value, value) === 0) {
-        max = value;
-        defined = true;
-      }
-    }
-  }
-  return max;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/greatestIndex.js

@@ -1,19 +0,0 @@
-import ascending from "./ascending.js";
-import maxIndex from "./maxIndex.js";
-
-export default function greatestIndex(values, compare = ascending) {
-  if (compare.length === 1) return maxIndex(values, compare);
-  let maxValue;
-  let max = -1;
-  let index = -1;
-  for (const value of values) {
-    ++index;
-    if (max < 0
-        ? compare(value, value) === 0
-        : compare(value, maxValue) > 0) {
-      maxValue = value;
-      max = index;
-    }
-  }
-  return max;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/group.js

@@ -1,65 +0,0 @@
-import {InternMap} from "internmap";
-import identity from "./identity.js";
-
-export default function group(values, ...keys) {
-  return nest(values, identity, identity, keys);
-}
-
-export function groups(values, ...keys) {
-  return nest(values, Array.from, identity, keys);
-}
-
-function flatten(groups, keys) {
-  for (let i = 1, n = keys.length; i < n; ++i) {
-    groups = groups.flatMap(g => g.pop().map(([key, value]) => [...g, key, value]));
-  }
-  return groups;
-}
-
-export function flatGroup(values, ...keys) {
-  return flatten(groups(values, ...keys), keys);
-}
-
-export function flatRollup(values, reduce, ...keys) {
-  return flatten(rollups(values, reduce, ...keys), keys);
-}
-
-export function rollup(values, reduce, ...keys) {
-  return nest(values, identity, reduce, keys);
-}
-
-export function rollups(values, reduce, ...keys) {
-  return nest(values, Array.from, reduce, keys);
-}
-
-export function index(values, ...keys) {
-  return nest(values, identity, unique, keys);
-}
-
-export function indexes(values, ...keys) {
-  return nest(values, Array.from, unique, keys);
-}
-
-function unique(values) {
-  if (values.length !== 1) throw new Error("duplicate key");
-  return values[0];
-}
-
-function nest(values, map, reduce, keys) {
-  return (function regroup(values, i) {
-    if (i >= keys.length) return reduce(values);
-    const groups = new InternMap();
-    const keyof = keys[i++];
-    let index = -1;
-    for (const value of values) {
-      const key = keyof(value, ++index, values);
-      const group = groups.get(key);
-      if (group) group.push(value);
-      else groups.set(key, [value]);
-    }
-    for (const [key, values] of groups) {
-      groups.set(key, regroup(values, i));
-    }
-    return map(groups);
-  })(values, 0);
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/groupSort.js

@@ -1,10 +0,0 @@
-import ascending from "./ascending.js";
-import group, {rollup} from "./group.js";
-import sort from "./sort.js";
-
-export default function groupSort(values, reduce, key) {
-  return (reduce.length !== 2
-    ? sort(rollup(values, reduce, key), (([ak, av], [bk, bv]) => ascending(av, bv) || ascending(ak, bk)))
-    : sort(group(values, key), (([ak, av], [bk, bv]) => reduce(av, bv) || ascending(ak, bk))))
-    .map(([key]) => key);
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/identity.js

@@ -1,3 +0,0 @@
-export default function identity(x) {
-  return x;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/index.js

@@ -1,57 +0,0 @@
-export {default as bisect, bisectRight, bisectLeft, bisectCenter} from "./bisect.js";
-export {default as ascending} from "./ascending.js";
-export {default as bisector} from "./bisector.js";
-export {blur, blur2, blurImage} from "./blur.js";
-export {default as count} from "./count.js";
-export {default as cross} from "./cross.js";
-export {default as cumsum} from "./cumsum.js";
-export {default as descending} from "./descending.js";
-export {default as deviation} from "./deviation.js";
-export {default as extent} from "./extent.js";
-export {Adder, fsum, fcumsum} from "./fsum.js";
-export {default as group, flatGroup, flatRollup, groups, index, indexes, rollup, rollups} from "./group.js";
-export {default as groupSort} from "./groupSort.js";
-export {default as bin, default as histogram} from "./bin.js"; // Deprecated; use bin.
-export {default as thresholdFreedmanDiaconis} from "./threshold/freedmanDiaconis.js";
-export {default as thresholdScott} from "./threshold/scott.js";
-export {default as thresholdSturges} from "./threshold/sturges.js";
-export {default as max} from "./max.js";
-export {default as maxIndex} from "./maxIndex.js";
-export {default as mean} from "./mean.js";
-export {default as median, medianIndex} from "./median.js";
-export {default as merge} from "./merge.js";
-export {default as min} from "./min.js";
-export {default as minIndex} from "./minIndex.js";
-export {default as mode} from "./mode.js";
-export {default as nice} from "./nice.js";
-export {default as pairs} from "./pairs.js";
-export {default as permute} from "./permute.js";
-export {default as quantile, quantileIndex, quantileSorted} from "./quantile.js";
-export {default as quickselect} from "./quickselect.js";
-export {default as range} from "./range.js";
-export {default as rank} from "./rank.js";
-export {default as least} from "./least.js";
-export {default as leastIndex} from "./leastIndex.js";
-export {default as greatest} from "./greatest.js";
-export {default as greatestIndex} from "./greatestIndex.js";
-export {default as scan} from "./scan.js"; // Deprecated; use leastIndex.
-export {default as shuffle, shuffler} from "./shuffle.js";
-export {default as sum} from "./sum.js";
-export {default as ticks, tickIncrement, tickStep} from "./ticks.js";
-export {default as transpose} from "./transpose.js";
-export {default as variance} from "./variance.js";
-export {default as zip} from "./zip.js";
-export {default as every} from "./every.js";
-export {default as some} from "./some.js";
-export {default as filter} from "./filter.js";
-export {default as map} from "./map.js";
-export {default as reduce} from "./reduce.js";
-export {default as reverse} from "./reverse.js";
-export {default as sort} from "./sort.js";
-export {default as difference} from "./difference.js";
-export {default as disjoint} from "./disjoint.js";
-export {default as intersection} from "./intersection.js";
-export {default as subset} from "./subset.js";
-export {default as superset} from "./superset.js";
-export {default as union} from "./union.js";
-export {InternMap, InternSet} from "internmap";

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/intersection.js

@@ -1,19 +0,0 @@
-import {InternSet} from "internmap";
-
-export default function intersection(values, ...others) {
-  values = new InternSet(values);
-  others = others.map(set);
-  out: for (const value of values) {
-    for (const other of others) {
-      if (!other.has(value)) {
-        values.delete(value);
-        continue out;
-      }
-    }
-  }
-  return values;
-}
-
-function set(values) {
-  return values instanceof InternSet ? values : new InternSet(values);
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/least.js

@@ -1,29 +0,0 @@
-import ascending from "./ascending.js";
-
-export default function least(values, compare = ascending) {
-  let min;
-  let defined = false;
-  if (compare.length === 1) {
-    let minValue;
-    for (const element of values) {
-      const value = compare(element);
-      if (defined
-          ? ascending(value, minValue) < 0
-          : ascending(value, value) === 0) {
-        min = element;
-        minValue = value;
-        defined = true;
-      }
-    }
-  } else {
-    for (const value of values) {
-      if (defined
-          ? compare(value, min) < 0
-          : compare(value, value) === 0) {
-        min = value;
-        defined = true;
-      }
-    }
-  }
-  return min;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/leastIndex.js

@@ -1,19 +0,0 @@
-import ascending from "./ascending.js";
-import minIndex from "./minIndex.js";
-
-export default function leastIndex(values, compare = ascending) {
-  if (compare.length === 1) return minIndex(values, compare);
-  let minValue;
-  let min = -1;
-  let index = -1;
-  for (const value of values) {
-    ++index;
-    if (min < 0
-        ? compare(value, value) === 0
-        : compare(value, minValue) < 0) {
-      minValue = value;
-      min = index;
-    }
-  }
-  return min;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/map.js

@@ -1,5 +0,0 @@
-export default function map(values, mapper) {
-  if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
-  if (typeof mapper !== "function") throw new TypeError("mapper is not a function");
-  return Array.from(values, (value, index) => mapper(value, index, values));
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/max.js

@@ -1,20 +0,0 @@
-export default function max(values, valueof) {
-  let max;
-  if (valueof === undefined) {
-    for (const value of values) {
-      if (value != null
-          && (max < value || (max === undefined && value >= value))) {
-        max = value;
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null
-          && (max < value || (max === undefined && value >= value))) {
-        max = value;
-      }
-    }
-  }
-  return max;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/maxIndex.js

@@ -1,22 +0,0 @@
-export default function maxIndex(values, valueof) {
-  let max;
-  let maxIndex = -1;
-  let index = -1;
-  if (valueof === undefined) {
-    for (const value of values) {
-      ++index;
-      if (value != null
-          && (max < value || (max === undefined && value >= value))) {
-        max = value, maxIndex = index;
-      }
-    }
-  } else {
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null
-          && (max < value || (max === undefined && value >= value))) {
-        max = value, maxIndex = index;
-      }
-    }
-  }
-  return maxIndex;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/mean.js

@@ -1,19 +0,0 @@
-export default function mean(values, valueof) {
-  let count = 0;
-  let sum = 0;
-  if (valueof === undefined) {
-    for (let value of values) {
-      if (value != null && (value = +value) >= value) {
-        ++count, sum += value;
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
-        ++count, sum += value;
-      }
-    }
-  }
-  if (count) return sum / count;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/median.js

@@ -1,9 +0,0 @@
-import quantile, {quantileIndex} from "./quantile.js";
-
-export default function median(values, valueof) {
-  return quantile(values, 0.5, valueof);
-}
-
-export function medianIndex(values, valueof) {
-  return quantileIndex(values, 0.5, valueof);
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/merge.js

@@ -1,9 +0,0 @@
-function* flatten(arrays) {
-  for (const array of arrays) {
-    yield* array;
-  }
-}
-
-export default function merge(arrays) {
-  return Array.from(flatten(arrays));
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/min.js

@@ -1,20 +0,0 @@
-export default function min(values, valueof) {
-  let min;
-  if (valueof === undefined) {
-    for (const value of values) {
-      if (value != null
-          && (min > value || (min === undefined && value >= value))) {
-        min = value;
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null
-          && (min > value || (min === undefined && value >= value))) {
-        min = value;
-      }
-    }
-  }
-  return min;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/minIndex.js

@@ -1,22 +0,0 @@
-export default function minIndex(values, valueof) {
-  let min;
-  let minIndex = -1;
-  let index = -1;
-  if (valueof === undefined) {
-    for (const value of values) {
-      ++index;
-      if (value != null
-          && (min > value || (min === undefined && value >= value))) {
-        min = value, minIndex = index;
-      }
-    }
-  } else {
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null
-          && (min > value || (min === undefined && value >= value))) {
-        min = value, minIndex = index;
-      }
-    }
-  }
-  return minIndex;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/mode.js

@@ -1,28 +0,0 @@
-import {InternMap} from "internmap";
-
-export default function mode(values, valueof) {
-  const counts = new InternMap();
-  if (valueof === undefined) {
-    for (let value of values) {
-      if (value != null && value >= value) {
-        counts.set(value, (counts.get(value) || 0) + 1);
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null && value >= value) {
-        counts.set(value, (counts.get(value) || 0) + 1);
-      }
-    }
-  }
-  let modeValue;
-  let modeCount = 0;
-  for (const [value, count] of counts) {
-    if (count > modeCount) {
-      modeCount = count;
-      modeValue = value;
-    }
-  }
-  return modeValue;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/nice.js

@@ -1,18 +0,0 @@
-import {tickIncrement} from "./ticks.js";
-
-export default function nice(start, stop, count) {
-  let prestep;
-  while (true) {
-    const step = tickIncrement(start, stop, count);
-    if (step === prestep || step === 0 || !isFinite(step)) {
-      return [start, stop];
-    } else if (step > 0) {
-      start = Math.floor(start / step) * step;
-      stop = Math.ceil(stop / step) * step;
-    } else if (step < 0) {
-      start = Math.ceil(start * step) / step;
-      stop = Math.floor(stop * step) / step;
-    }
-    prestep = step;
-  }
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/number.js

@@ -1,20 +0,0 @@
-export default function number(x) {
-  return x === null ? NaN : +x;
-}
-
-export function* numbers(values, valueof) {
-  if (valueof === undefined) {
-    for (let value of values) {
-      if (value != null && (value = +value) >= value) {
-        yield value;
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
-        yield value;
-      }
-    }
-  }
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/pairs.js

@@ -1,15 +0,0 @@
-export default function pairs(values, pairof = pair) {
-  const pairs = [];
-  let previous;
-  let first = false;
-  for (const value of values) {
-    if (first) pairs.push(pairof(previous, value));
-    previous = value;
-    first = true;
-  }
-  return pairs;
-}
-
-export function pair(a, b) {
-  return [a, b];
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/permute.js

@@ -1,3 +0,0 @@
-export default function permute(source, keys) {
-  return Array.from(keys, key => source[key]);
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/quantile.js

@@ -1,47 +0,0 @@
-import max from "./max.js";
-import maxIndex from "./maxIndex.js";
-import min from "./min.js";
-import minIndex from "./minIndex.js";
-import quickselect from "./quickselect.js";
-import number, {numbers} from "./number.js";
-import {ascendingDefined} from "./sort.js";
-import greatest from "./greatest.js";
-
-export default function quantile(values, p, valueof) {
-  values = Float64Array.from(numbers(values, valueof));
-  if (!(n = values.length) || isNaN(p = +p)) return;
-  if (p <= 0 || n < 2) return min(values);
-  if (p >= 1) return max(values);
-  var n,
-      i = (n - 1) * p,
-      i0 = Math.floor(i),
-      value0 = max(quickselect(values, i0).subarray(0, i0 + 1)),
-      value1 = min(values.subarray(i0 + 1));
-  return value0 + (value1 - value0) * (i - i0);
-}
-
-export function quantileSorted(values, p, valueof = number) {
-  if (!(n = values.length) || isNaN(p = +p)) return;
-  if (p <= 0 || n < 2) return +valueof(values[0], 0, values);
-  if (p >= 1) return +valueof(values[n - 1], n - 1, values);
-  var n,
-      i = (n - 1) * p,
-      i0 = Math.floor(i),
-      value0 = +valueof(values[i0], i0, values),
-      value1 = +valueof(values[i0 + 1], i0 + 1, values);
-  return value0 + (value1 - value0) * (i - i0);
-}
-
-export function quantileIndex(values, p, valueof = number) {
-  if (isNaN(p = +p)) return;
-  numbers = Float64Array.from(values, (_, i) => number(valueof(values[i], i, values)));
-  if (p <= 0) return minIndex(numbers);
-  if (p >= 1) return maxIndex(numbers);
-  var numbers,
-      index = Uint32Array.from(values, (_, i) => i),
-      j = numbers.length - 1,
-      i = Math.floor(j * p);
-  quickselect(index, i, 0, j, (i, j) => ascendingDefined(numbers[i], numbers[j]));
-  i = greatest(index.subarray(0, i + 1), (i) => numbers[i]);
-  return i >= 0 ? i : -1;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/quickselect.js

@@ -1,53 +0,0 @@
-import {ascendingDefined, compareDefined} from "./sort.js";
-
-// Based on https://github.com/mourner/quickselect
-// ISC license, Copyright 2018 Vladimir Agafonkin.
-export default function quickselect(array, k, left = 0, right = Infinity, compare) {
-  k = Math.floor(k);
-  left = Math.floor(Math.max(0, left));
-  right = Math.floor(Math.min(array.length - 1, right));
-
-  if (!(left <= k && k <= right)) return array;
-
-  compare = compare === undefined ? ascendingDefined : compareDefined(compare);
-
-  while (right > left) {
-    if (right - left > 600) {
-      const n = right - left + 1;
-      const m = k - left + 1;
-      const z = Math.log(n);
-      const s = 0.5 * Math.exp(2 * z / 3);
-      const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
-      const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
-      const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
-      quickselect(array, k, newLeft, newRight, compare);
-    }
-
-    const t = array[k];
-    let i = left;
-    let j = right;
-
-    swap(array, left, k);
-    if (compare(array[right], t) > 0) swap(array, left, right);
-
-    while (i < j) {
-      swap(array, i, j), ++i, --j;
-      while (compare(array[i], t) < 0) ++i;
-      while (compare(array[j], t) > 0) --j;
-    }
-
-    if (compare(array[left], t) === 0) swap(array, left, j);
-    else ++j, swap(array, j, right);
-
-    if (j <= k) left = j + 1;
-    if (k <= j) right = j - 1;
-  }
-
-  return array;
-}
-
-function swap(array, i, j) {
-  const t = array[i];
-  array[i] = array[j];
-  array[j] = t;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/range.js

@@ -1,13 +0,0 @@
-export default function range(start, stop, step) {
-  start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step;
-
-  var i = -1,
-      n = Math.max(0, Math.ceil((stop - start) / step)) | 0,
-      range = new Array(n);
-
-  while (++i < n) {
-    range[i] = start + i * step;
-  }
-
-  return range;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/rank.js

@@ -1,24 +0,0 @@
-import ascending from "./ascending.js";
-import {ascendingDefined, compareDefined} from "./sort.js";
-
-export default function rank(values, valueof = ascending) {
-  if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
-  let V = Array.from(values);
-  const R = new Float64Array(V.length);
-  if (valueof.length !== 2) V = V.map(valueof), valueof = ascending;
-  const compareIndex = (i, j) => valueof(V[i], V[j]);
-  let k, r;
-  values = Uint32Array.from(V, (_, i) => i);
-  // Risky chaining due to Safari 14 https://github.com/d3/d3-array/issues/123
-  values.sort(valueof === ascending ? (i, j) => ascendingDefined(V[i], V[j]) : compareDefined(compareIndex));
-  values.forEach((j, i) => {
-      const c = compareIndex(j, k === undefined ? j : k);
-      if (c >= 0) {
-        if (k === undefined || c > 0) k = j, r = i;
-        R[j] = r;
-      } else {
-        R[j] = NaN;
-      }
-    });
-  return R;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/reduce.js

@@ -1,14 +0,0 @@
-export default function reduce(values, reducer, value) {
-  if (typeof reducer !== "function") throw new TypeError("reducer is not a function");
-  const iterator = values[Symbol.iterator]();
-  let done, next, index = -1;
-  if (arguments.length < 3) {
-    ({done, value} = iterator.next());
-    if (done) return;
-    ++index;
-  }
-  while (({done, value: next} = iterator.next()), !done) {
-    value = reducer(value, next, ++index, values);
-  }
-  return value;
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/reverse.js

@@ -1,4 +0,0 @@
-export default function reverse(values) {
-  if (typeof values[Symbol.iterator] !== "function") throw new TypeError("values is not iterable");
-  return Array.from(values).reverse();
-}

package/.output/server/node_modules/.nitro/d3-array@3.2.4/src/scan.js

@@ -1,6 +0,0 @@
-import leastIndex from "./leastIndex.js";
-
-export default function scan(values, compare) {
-  const index = leastIndex(values, compare);
-  return index < 0 ? undefined : index;
-}