@burdenoff/microfe-devportal 2026.1107.3 → 2026.1108.2

package/dist/node_modules/d3-array/dist/d3-array.js

@@ -0,0 +1,204 @@
+// node_modules/d3-array/dist/d3-array.mjs
+function e(e, t) {
+	return e == null || t == null ? NaN : e < t ? -1 : e > t ? 1 : e >= t ? 0 : NaN;
+}
+function t(e, t) {
+	return e == null || t == null ? NaN : t < e ? -1 : t > e ? 1 : t >= e ? 0 : NaN;
+}
+function n(n) {
+	let i, a, o;
+	n.length === 2 ? (i = n === e || n === t ? n : r, a = n, o = n) : (i = e, a = (t, r) => e(n(t), r), o = (e, t) => n(e) - t);
+	function s(e, t, n = 0, r = e.length) {
+		if (n < r) {
+			if (i(t, t) !== 0) return r;
+			do {
+				let i = n + r >>> 1;
+				a(e[i], t) < 0 ? n = i + 1 : r = i;
+			} while (n < r);
+		}
+		return n;
+	}
+	function c(e, t, n = 0, r = e.length) {
+		if (n < r) {
+			if (i(t, t) !== 0) return r;
+			do {
+				let i = n + r >>> 1;
+				a(e[i], t) <= 0 ? n = i + 1 : r = i;
+			} while (n < r);
+		}
+		return n;
+	}
+	function l(e, t, n = 0, r = e.length) {
+		let i = s(e, t, n, r - 1);
+		return i > n && o(e[i - 1], t) > -o(e[i], t) ? i - 1 : i;
+	}
+	return {
+		left: s,
+		center: l,
+		right: c
+	};
+}
+function r() {
+	return 0;
+}
+function i(e) {
+	return e === null ? NaN : +e;
+}
+function* a(e, t) {
+	if (t === void 0) for (let t of e) t != null && (t = +t) >= t && (yield t);
+	else {
+		let n = -1;
+		for (let r of e) (r = t(r, ++n, e)) != null && (r = +r) >= r && (yield r);
+	}
+}
+var o = n(e), s = o.right;
+o.left, n(i).center;
+var c = class extends Map {
+	constructor(e, t = f) {
+		if (super(), Object.defineProperties(this, {
+			_intern: { value: /* @__PURE__ */ new Map() },
+			_key: { value: t }
+		}), e != null) for (let [t, n] of e) this.set(t, n);
+	}
+	get(e) {
+		return super.get(l(this, e));
+	}
+	has(e) {
+		return super.has(l(this, e));
+	}
+	set(e, t) {
+		return super.set(u(this, e), t);
+	}
+	delete(e) {
+		return super.delete(d(this, e));
+	}
+};
+function l({ _intern: e, _key: t }, n) {
+	let r = t(n);
+	return e.has(r) ? e.get(r) : n;
+}
+function u({ _intern: e, _key: t }, n) {
+	let r = t(n);
+	return e.has(r) ? e.get(r) : (e.set(r, n), n);
+}
+function d({ _intern: e, _key: t }, n) {
+	let r = t(n);
+	return e.has(r) && (n = e.get(r), e.delete(r)), n;
+}
+function f(e) {
+	return typeof e == "object" && e ? e.valueOf() : e;
+}
+function p(t = e) {
+	if (t === e) return m;
+	if (typeof t != "function") throw TypeError("compare is not a function");
+	return (e, n) => {
+		let r = t(e, n);
+		return r || r === 0 ? r : (t(n, n) === 0) - (t(e, e) === 0);
+	};
+}
+function m(e, t) {
+	return (e == null || !(e >= e)) - (t == null || !(t >= t)) || (e < t ? -1 : +(e > t));
+}
+Array.prototype.slice;
+var h = Math.sqrt(50), g = Math.sqrt(10), _ = Math.sqrt(2);
+function v(e, t, n) {
+	let r = (t - e) / Math.max(0, n), i = Math.floor(Math.log10(r)), a = r / 10 ** i, o = a >= h ? 10 : a >= g ? 5 : a >= _ ? 2 : 1, s, c, l;
+	return i < 0 ? (l = 10 ** -i / o, s = Math.round(e * l), c = Math.round(t * l), s / l < e && ++s, c / l > t && --c, l = -l) : (l = 10 ** i * o, s = Math.round(e / l), c = Math.round(t / l), s * l < e && ++s, c * l > t && --c), c < s && .5 <= n && n < 2 ? v(e, t, n * 2) : [
+		s,
+		c,
+		l
+	];
+}
+function y(e, t, n) {
+	if (t = +t, e = +e, n = +n, !(n > 0)) return [];
+	if (e === t) return [e];
+	let r = t < e, [i, a, o] = r ? v(t, e, n) : v(e, t, n);
+	if (!(a >= i)) return [];
+	let s = a - i + 1, c = Array(s);
+	if (r) {
+		if (o < 0) for (let e = 0; e < s; ++e) c[e] = (a - e) / -o;
+		else for (let e = 0; e < s; ++e) c[e] = (a - e) * o;
+	} else if (o < 0) for (let e = 0; e < s; ++e) c[e] = (i + e) / -o;
+	else for (let e = 0; e < s; ++e) c[e] = (i + e) * o;
+	return c;
+}
+function b(e, t, n) {
+	return t = +t, e = +e, n = +n, v(e, t, n)[2];
+}
+function x(e, t, n) {
+	t = +t, e = +e, n = +n;
+	let r = t < e, i = r ? b(t, e, n) : b(e, t, n);
+	return (r ? -1 : 1) * (i < 0 ? 1 / -i : i);
+}
+function S(e, t) {
+	let n;
+	if (t === void 0) for (let t of e) t != null && (n < t || n === void 0 && t >= t) && (n = t);
+	else {
+		let r = -1;
+		for (let i of e) (i = t(i, ++r, e)) != null && (n < i || n === void 0 && i >= i) && (n = i);
+	}
+	return n;
+}
+function C(e, t) {
+	let n;
+	if (t === void 0) for (let t of e) t != null && (n > t || n === void 0 && t >= t) && (n = t);
+	else {
+		let r = -1;
+		for (let i of e) (i = t(i, ++r, e)) != null && (n > i || n === void 0 && i >= i) && (n = i);
+	}
+	return n;
+}
+function w(e, t, n = 0, r = Infinity, i) {
+	if (t = Math.floor(t), n = Math.floor(Math.max(0, n)), r = Math.floor(Math.min(e.length - 1, r)), !(n <= t && t <= r)) return e;
+	for (i = i === void 0 ? m : p(i); r > n;) {
+		if (r - n > 600) {
+			let a = r - n + 1, o = t - n + 1, s = Math.log(a), c = .5 * Math.exp(2 * s / 3), l = .5 * Math.sqrt(s * c * (a - c) / a) * (o - a / 2 < 0 ? -1 : 1), u = Math.max(n, Math.floor(t - o * c / a + l)), d = Math.min(r, Math.floor(t + (a - o) * c / a + l));
+			w(e, t, u, d, i);
+		}
+		let a = e[t], o = n, s = r;
+		for (T(e, n, t), i(e[r], a) > 0 && T(e, n, r); o < s;) {
+			for (T(e, o, s), ++o, --s; i(e[o], a) < 0;) ++o;
+			for (; i(e[s], a) > 0;) --s;
+		}
+		i(e[n], a) === 0 ? T(e, n, s) : (++s, T(e, s, r)), s <= t && (n = s + 1), t <= s && (r = s - 1);
+	}
+	return e;
+}
+function T(e, t, n) {
+	let r = e[t];
+	e[t] = e[n], e[n] = r;
+}
+function E(e, t, n) {
+	if (e = Float64Array.from(a(e, n)), (r = e.length) && !isNaN(t = +t)) {
+		if (t <= 0 || r < 2) return C(e);
+		if (t >= 1) return S(e);
+		var r, i = (r - 1) * t, o = Math.floor(i), s = S(w(e, o).subarray(0, o + 1));
+		return s + (C(e.subarray(o + 1)) - s) * (i - o);
+	}
+}
+function D(e, t, n = i) {
+	if ((r = e.length) && !isNaN(t = +t)) {
+		if (t <= 0 || r < 2) return +n(e[0], 0, e);
+		if (t >= 1) return +n(e[r - 1], r - 1, e);
+		var r, a = (r - 1) * t, o = Math.floor(a), s = +n(e[o], o, e);
+		return s + (+n(e[o + 1], o + 1, e) - s) * (a - o);
+	}
+}
+function O(e, t, n) {
+	e = +e, t = +t, n = (i = arguments.length) < 2 ? (t = e, e = 0, 1) : i < 3 ? 1 : +n;
+	for (var r = -1, i = Math.max(0, Math.ceil((t - e) / n)) | 0, a = Array(i); ++r < i;) a[r] = e + r * n;
+	return a;
+}
+function k(e) {
+	return function(t, n = 0, r = t.length) {
+		let i = r - (n = +n);
+		for (; i;) {
+			let r = e() * i-- | 0, a = t[i + n];
+			t[i + n] = t[r + n], t[r + n] = a;
+		}
+		return t;
+	};
+}
+export { c as InternMap, e as ascending, s as bisect, s as bisectRight, n as bisector, t as descending, S as max, C as min, E as quantile, D as quantileSorted, w as quickselect, O as range, k as shuffler, b as tickIncrement, x as tickStep, y as ticks };
+
+//# sourceMappingURL=d3-array.js.map

package/dist/node_modules/d3-array/dist/d3-array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"d3-array.js","names":["ascending","a","b","descending","bisector","compare1","compare2","delta","f","zero","d","x","left","lo","hi","mid","right","center","number","numbers","valueof","value","values","index","ascendingBisect","bisectRight","InternMap","keyof","key","entries","intern_get","intern_set","intern_delete","_key","_intern","compareDefined","compare","ascendingDefined","e10","e5","e2","tickSpec","step","stop","start","count","power","error","factor","i1","i2","inc","ticks","reverse","n","i","tickIncrement","tickStep","max","min","quickselect","k","array","m","z","s","sd","newLeft","newRight","t","j","swap","quantile","p","i0","value0","quantileSorted","range","shuffler","random"],"sources":["../../../../node_modules/d3-array/dist/d3-array.mjs"],"sourcesContent":["// https://d3js.org/d3-array/ v3.2.5 Copyright 2010-2026 Mike Bostock\nfunction ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n\nfunction descending(a, b) {\n  return a == null || b == null ? NaN\n    : b < a ? -1\n    : b > a ? 1\n    : b >= a ? 0\n    : NaN;\n}\n\nfunction bisector(f) {\n  let compare1, compare2, delta;\n\n  // If an accessor is specified, promote it to a comparator. In this case we\n  // can test whether the search value is (self-) comparable. We can’t do this\n  // for a comparator (except for specific, known comparators) because we can’t\n  // tell if the comparator is symmetric, and an asymmetric comparator can’t be\n  // used to test whether a single value is comparable.\n  if (f.length !== 2) {\n    compare1 = ascending;\n    compare2 = (d, x) => ascending(f(d), x);\n    delta = (d, x) => f(d) - x;\n  } else {\n    compare1 = f === ascending || f === descending ? f : zero;\n    compare2 = f;\n    delta = f;\n  }\n\n  function left(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function right(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) <= 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function center(a, x, lo = 0, hi = a.length) {\n    const i = left(a, x, lo, hi - 1);\n    return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;\n  }\n\n  return {left, center, right};\n}\n\nfunction zero() {\n  return 0;\n}\n\nfunction number(x) {\n  return x === null ? NaN : +x;\n}\n\nfunction* numbers(values, valueof) {\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  }\n}\n\nconst ascendingBisect = bisector(ascending);\nconst bisectRight = ascendingBisect.right;\nconst bisectLeft = ascendingBisect.left;\nconst bisectCenter = bisector(number).center;\n\nfunction blur(values, r) {\n  if (!((r = +r) >= 0)) throw new RangeError(\"invalid r\");\n  let length = values.length;\n  if (!((length = Math.floor(length)) >= 0)) throw new RangeError(\"invalid length\");\n  if (!length || !r) return values;\n  const blur = blurf(r);\n  const temp = values.slice();\n  blur(values, temp, 0, length, 1);\n  blur(temp, values, 0, length, 1);\n  blur(values, temp, 0, length, 1);\n  return values;\n}\n\nconst blur2 = Blur2(blurf);\n\nconst blurImage = Blur2(blurfImage);\n\nfunction Blur2(blur) {\n  return function(data, rx, ry = rx) {\n    if (!((rx = +rx) >= 0)) throw new RangeError(\"invalid rx\");\n    if (!((ry = +ry) >= 0)) throw new RangeError(\"invalid ry\");\n    let {data: values, width, height} = data;\n    if (!((width = Math.floor(width)) >= 0)) throw new RangeError(\"invalid width\");\n    if (!((height = Math.floor(height !== undefined ? height : values.length / width)) >= 0)) throw new RangeError(\"invalid height\");\n    if (!width || !height || (!rx && !ry)) return data;\n    const blurx = rx && blur(rx);\n    const blury = ry && blur(ry);\n    const temp = values.slice();\n    if (blurx && blury) {\n      blurh(blurx, temp, values, width, height);\n      blurh(blurx, values, temp, width, height);\n      blurh(blurx, temp, values, width, height);\n      blurv(blury, values, temp, width, height);\n      blurv(blury, temp, values, width, height);\n      blurv(blury, values, temp, width, height);\n    } else if (blurx) {\n      blurh(blurx, values, temp, width, height);\n      blurh(blurx, temp, values, width, height);\n      blurh(blurx, values, temp, width, height);\n    } else if (blury) {\n      blurv(blury, values, temp, width, height);\n      blurv(blury, temp, values, width, height);\n      blurv(blury, values, temp, width, height);\n    }\n    return data;\n  };\n}\n\nfunction blurh(blur, T, S, w, h) {\n  for (let y = 0, n = w * h; y < n;) {\n    blur(T, S, y, y += w, 1);\n  }\n}\n\nfunction blurv(blur, T, S, w, h) {\n  for (let x = 0, n = w * h; x < w; ++x) {\n    blur(T, S, x, x + n, w);\n  }\n}\n\nfunction blurfImage(radius) {\n  const blur = blurf(radius);\n  return (T, S, start, stop, step) => {\n    start <<= 2, stop <<= 2, step <<= 2;\n    blur(T, S, start + 0, stop + 0, step);\n    blur(T, S, start + 1, stop + 1, step);\n    blur(T, S, start + 2, stop + 2, step);\n    blur(T, S, start + 3, stop + 3, step);\n  };\n}\n\n// Given a target array T, a source array S, sets each value T[i] to the average\n// of {S[i - r], …, S[i], …, S[i + r]}, where r = ⌊radius⌋, start <= i < stop,\n// for each i, i + step, i + 2 * step, etc., and where S[j] is clamped between\n// S[start] (inclusive) and S[stop] (exclusive). If the given radius is not an\n// integer, S[i - r - 1] and S[i + r + 1] are added to the sum, each weighted\n// according to r - ⌊radius⌋.\nfunction blurf(radius) {\n  const radius0 = Math.floor(radius);\n  if (radius0 === radius) return bluri(radius);\n  const t = radius - radius0;\n  const w = 2 * radius + 1;\n  return (T, S, start, stop, step) => { // stop must be aligned!\n    if (!((stop -= step) >= start)) return; // inclusive stop\n    let sum = radius0 * S[start];\n    const s0 = step * radius0;\n    const s1 = s0 + step;\n    for (let i = start, j = start + s0; i < j; i += step) {\n      sum += S[Math.min(stop, i)];\n    }\n    for (let i = start, j = stop; i <= j; i += step) {\n      sum += S[Math.min(stop, i + s0)];\n      T[i] = (sum + t * (S[Math.max(start, i - s1)] + S[Math.min(stop, i + s1)])) / w;\n      sum -= S[Math.max(start, i - s0)];\n    }\n  };\n}\n\n// Like blurf, but optimized for integer radius.\nfunction bluri(radius) {\n  const w = 2 * radius + 1;\n  return (T, S, start, stop, step) => { // stop must be aligned!\n    if (!((stop -= step) >= start)) return; // inclusive stop\n    let sum = radius * S[start];\n    const s = step * radius;\n    for (let i = start, j = start + s; i < j; i += step) {\n      sum += S[Math.min(stop, i)];\n    }\n    for (let i = start, j = stop; i <= j; i += step) {\n      sum += S[Math.min(stop, i + s)];\n      T[i] = sum / w;\n      sum -= S[Math.max(start, i - s)];\n    }\n  };\n}\n\nfunction count(values, valueof) {\n  let count = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count;\n      }\n    }\n  }\n  return count;\n}\n\nfunction length$1(array) {\n  return array.length | 0;\n}\n\nfunction empty(length) {\n  return !(length > 0);\n}\n\nfunction arrayify(values) {\n  return typeof values !== \"object\" || \"length\" in values ? values : Array.from(values);\n}\n\nfunction reducer(reduce) {\n  return values => reduce(...values);\n}\n\nfunction cross(...values) {\n  const reduce = typeof values[values.length - 1] === \"function\" && reducer(values.pop());\n  values = values.map(arrayify);\n  const lengths = values.map(length$1);\n  const j = values.length - 1;\n  const index = new Array(j + 1).fill(0);\n  const product = [];\n  if (j < 0 || lengths.some(empty)) return product;\n  while (true) {\n    product.push(index.map((j, i) => values[i][j]));\n    let i = j;\n    while (++index[i] === lengths[i]) {\n      if (i === 0) return reduce ? product.map(reduce) : product;\n      index[i--] = 0;\n    }\n  }\n}\n\nfunction cumsum(values, valueof) {\n  var sum = 0, index = 0;\n  return Float64Array.from(values, valueof === undefined\n    ? v => (sum += +v || 0)\n    : v => (sum += +valueof(v, index++, values) || 0));\n}\n\nfunction variance(values, valueof) {\n  let count = 0;\n  let delta;\n  let mean = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        delta = value - mean;\n        mean += delta / ++count;\n        sum += delta * (value - mean);\n      }\n    }\n  }\n  if (count > 1) return sum / (count - 1);\n}\n\nfunction deviation(values, valueof) {\n  const v = variance(values, valueof);\n  return v ? Math.sqrt(v) : v;\n}\n\nfunction extent(values, valueof) {\n  let min;\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null) {\n        if (min === undefined) {\n          if (value >= value) min = max = value;\n        } else {\n          if (min > value) min = value;\n          if (max < value) max = value;\n        }\n      }\n    }\n  }\n  return [min, max];\n}\n\n// https://github.com/python/cpython/blob/a74eea238f5baba15797e2e8b570d153bc8690a7/Modules/mathmodule.c#L1423\nclass Adder {\n  constructor() {\n    this._partials = new Float64Array(32);\n    this._n = 0;\n  }\n  add(x) {\n    const p = this._partials;\n    let i = 0;\n    for (let j = 0; j < this._n && j < 32; j++) {\n      const y = p[j],\n        hi = x + y,\n        lo = Math.abs(x) < Math.abs(y) ? x - (hi - y) : y - (hi - x);\n      if (lo) p[i++] = lo;\n      x = hi;\n    }\n    p[i] = x;\n    this._n = i + 1;\n    return this;\n  }\n  valueOf() {\n    const p = this._partials;\n    let n = this._n, x, y, lo, hi = 0;\n    if (n > 0) {\n      hi = p[--n];\n      while (n > 0) {\n        x = hi;\n        y = p[--n];\n        hi = x + y;\n        lo = y - (hi - x);\n        if (lo) break;\n      }\n      if (n > 0 && ((lo < 0 && p[n - 1] < 0) || (lo > 0 && p[n - 1] > 0))) {\n        y = lo * 2;\n        x = hi + y;\n        if (y == x - hi) hi = x;\n      }\n    }\n    return hi;\n  }\n}\n\nfunction fsum(values, valueof) {\n  const adder = new Adder();\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value = +value) {\n        adder.add(value);\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if (value = +valueof(value, ++index, values)) {\n        adder.add(value);\n      }\n    }\n  }\n  return +adder;\n}\n\nfunction fcumsum(values, valueof) {\n  const adder = new Adder();\n  let index = -1;\n  return Float64Array.from(values, valueof === undefined\n      ? v => adder.add(+v || 0)\n      : v => adder.add(+valueof(v, ++index, values) || 0)\n  );\n}\n\nclass InternMap extends Map {\n  constructor(entries, key = keyof) {\n    super();\n    Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});\n    if (entries != null) for (const [key, value] of entries) this.set(key, value);\n  }\n  get(key) {\n    return super.get(intern_get(this, key));\n  }\n  has(key) {\n    return super.has(intern_get(this, key));\n  }\n  set(key, value) {\n    return super.set(intern_set(this, key), value);\n  }\n  delete(key) {\n    return super.delete(intern_delete(this, key));\n  }\n}\n\nclass InternSet extends Set {\n  constructor(values, key = keyof) {\n    super();\n    Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});\n    if (values != null) for (const value of values) this.add(value);\n  }\n  has(value) {\n    return super.has(intern_get(this, value));\n  }\n  add(value) {\n    return super.add(intern_set(this, value));\n  }\n  delete(value) {\n    return super.delete(intern_delete(this, value));\n  }\n}\n\nfunction intern_get({_intern, _key}, value) {\n  const key = _key(value);\n  return _intern.has(key) ? _intern.get(key) : value;\n}\n\nfunction intern_set({_intern, _key}, value) {\n  const key = _key(value);\n  if (_intern.has(key)) return _intern.get(key);\n  _intern.set(key, value);\n  return value;\n}\n\nfunction intern_delete({_intern, _key}, value) {\n  const key = _key(value);\n  if (_intern.has(key)) {\n    value = _intern.get(key);\n    _intern.delete(key);\n  }\n  return value;\n}\n\nfunction keyof(value) {\n  return value !== null && typeof value === \"object\" ? value.valueOf() : value;\n}\n\nfunction identity(x) {\n  return x;\n}\n\nfunction group(values, ...keys) {\n  return nest(values, identity, identity, keys);\n}\n\nfunction groups(values, ...keys) {\n  return nest(values, Array.from, identity, keys);\n}\n\nfunction flatten$1(groups, keys) {\n  for (let i = 1, n = keys.length; i < n; ++i) {\n    groups = groups.flatMap(g => g.pop().map(([key, value]) => [...g, key, value]));\n  }\n  return groups;\n}\n\nfunction flatGroup(values, ...keys) {\n  return flatten$1(groups(values, ...keys), keys);\n}\n\nfunction flatRollup(values, reduce, ...keys) {\n  return flatten$1(rollups(values, reduce, ...keys), keys);\n}\n\nfunction rollup(values, reduce, ...keys) {\n  return nest(values, identity, reduce, keys);\n}\n\nfunction rollups(values, reduce, ...keys) {\n  return nest(values, Array.from, reduce, keys);\n}\n\nfunction index(values, ...keys) {\n  return nest(values, identity, unique, keys);\n}\n\nfunction indexes(values, ...keys) {\n  return nest(values, Array.from, unique, keys);\n}\n\nfunction unique(values) {\n  if (values.length !== 1) throw new Error(\"duplicate key\");\n  return values[0];\n}\n\nfunction nest(values, map, reduce, keys) {\n  return (function regroup(values, i) {\n    if (i >= keys.length) return reduce(values);\n    const groups = new InternMap();\n    const keyof = keys[i++];\n    let index = -1;\n    for (const value of values) {\n      const key = keyof(value, ++index, values);\n      const group = groups.get(key);\n      if (group) group.push(value);\n      else groups.set(key, [value]);\n    }\n    for (const [key, values] of groups) {\n      groups.set(key, regroup(values, i));\n    }\n    return map(groups);\n  })(values, 0);\n}\n\nfunction permute(source, keys) {\n  return Array.from(keys, key => source[key]);\n}\n\nfunction sort(values, ...F) {\n  if (typeof values[Symbol.iterator] !== \"function\") throw new TypeError(\"values is not iterable\");\n  values = Array.from(values);\n  let [f] = F;\n  if ((f && f.length !== 2) || F.length > 1) {\n    const index = Uint32Array.from(values, (d, i) => i);\n    if (F.length > 1) {\n      F = F.map(f => values.map(f));\n      index.sort((i, j) => {\n        for (const f of F) {\n          const c = ascendingDefined(f[i], f[j]);\n          if (c) return c;\n        }\n      });\n    } else {\n      f = values.map(f);\n      index.sort((i, j) => ascendingDefined(f[i], f[j]));\n    }\n    return permute(values, index);\n  }\n  return values.sort(compareDefined(f));\n}\n\nfunction compareDefined(compare = ascending) {\n  if (compare === ascending) return ascendingDefined;\n  if (typeof compare !== \"function\") throw new TypeError(\"compare is not a function\");\n  return (a, b) => {\n    const x = compare(a, b);\n    if (x || x === 0) return x;\n    return (compare(b, b) === 0) - (compare(a, a) === 0);\n  };\n}\n\nfunction ascendingDefined(a, b) {\n  return (a == null || !(a >= a)) - (b == null || !(b >= b)) || (a < b ? -1 : a > b ? 1 : 0);\n}\n\nfunction groupSort(values, reduce, key) {\n  return (reduce.length !== 2\n    ? sort(rollup(values, reduce, key), (([ak, av], [bk, bv]) => ascending(av, bv) || ascending(ak, bk)))\n    : sort(group(values, key), (([ak, av], [bk, bv]) => reduce(av, bv) || ascending(ak, bk))))\n    .map(([key]) => key);\n}\n\nvar array = Array.prototype;\n\nvar slice = array.slice;\n\nfunction constant(x) {\n  return () => x;\n}\n\nconst e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nfunction tickSpec(start, stop, count) {\n  const step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log10(step)),\n      error = step / Math.pow(10, power),\n      factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;\n  let i1, i2, inc;\n  if (power < 0) {\n    inc = Math.pow(10, -power) / factor;\n    i1 = Math.round(start * inc);\n    i2 = Math.round(stop * inc);\n    if (i1 / inc < start) ++i1;\n    if (i2 / inc > stop) --i2;\n    inc = -inc;\n  } else {\n    inc = Math.pow(10, power) * factor;\n    i1 = Math.round(start / inc);\n    i2 = Math.round(stop / inc);\n    if (i1 * inc < start) ++i1;\n    if (i2 * inc > stop) --i2;\n  }\n  if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);\n  return [i1, i2, inc];\n}\n\nfunction ticks(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  if (!(count > 0)) return [];\n  if (start === stop) return [start];\n  const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);\n  if (!(i2 >= i1)) return [];\n  const n = i2 - i1 + 1, ticks = new Array(n);\n  if (reverse) {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;\n  } else {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;\n  }\n  return ticks;\n}\n\nfunction tickIncrement(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  return tickSpec(start, stop, count)[2];\n}\n\nfunction tickStep(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);\n  return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);\n}\n\nfunction nice(start, stop, count) {\n  let prestep;\n  while (true) {\n    const step = tickIncrement(start, stop, count);\n    if (step === prestep || step === 0 || !isFinite(step)) {\n      return [start, stop];\n    } else if (step > 0) {\n      const i = Math.ceil(start / step);\n      const j = Math.floor(stop / step);\n      start = (i - (i * step > start)) * step;\n      stop = (j + (j * step < stop)) * step;\n    } else if (step < 0) {\n      const s = -step;\n      const i = Math.ceil(start * s);\n      const j = Math.floor(stop * s);\n      start = (i - (i / s > start)) / s;\n      stop = (j + (j / s < stop)) / s;\n    }\n    prestep = step;\n  }\n}\n\nfunction thresholdSturges(values) {\n  return Math.max(1, Math.ceil(Math.log(count(values)) / Math.LN2) + 1);\n}\n\nfunction bin() {\n  var value = identity,\n      domain = extent,\n      threshold = thresholdSturges;\n\n  function histogram(data) {\n    if (!Array.isArray(data)) data = Array.from(data);\n\n    var i,\n        n = data.length,\n        x,\n        step,\n        values = new Array(n);\n\n    for (i = 0; i < n; ++i) {\n      values[i] = value(data[i], i, data);\n    }\n\n    var xz = domain(values),\n        x0 = xz[0],\n        x1 = xz[1],\n        tz = threshold(values, x0, x1);\n\n    // Convert number of thresholds into uniform thresholds, and nice the\n    // default domain accordingly.\n    if (!Array.isArray(tz)) {\n      const max = x1, tn = +tz;\n      if (domain === extent) [x0, x1] = nice(x0, x1, tn);\n      tz = ticks(x0, x1, tn);\n\n      // If the domain is aligned with the first tick (which it will by\n      // default), then we can use quantization rather than bisection to bin\n      // values, which is substantially faster.\n      if (tz[0] <= x0) step = tickIncrement(x0, x1, tn);\n\n      // If the last threshold is coincident with the domain’s upper bound, the\n      // last bin will be zero-width. If the default domain is used, and this\n      // last threshold is coincident with the maximum input value, we can\n      // extend the niced upper bound by one tick to ensure uniform bin widths;\n      // otherwise, we simply remove the last threshold. Note that we don’t\n      // coerce values or the domain to numbers, and thus must be careful to\n      // compare order (>=) rather than strict equality (===)!\n      if (tz[tz.length - 1] >= x1) {\n        if (max >= x1 && domain === extent) {\n          const step = tickIncrement(x0, x1, tn);\n          if (isFinite(step)) {\n            if (step > 0) {\n              x1 = (Math.floor(x1 / step) + 1) * step;\n            } else if (step < 0) {\n              x1 = (Math.ceil(x1 * -step) + 1) / -step;\n            }\n          }\n        } else {\n          tz.pop();\n        }\n      }\n    }\n\n    // Remove any thresholds outside the domain.\n    // Be careful not to mutate an array owned by the user!\n    var m = tz.length, a = 0, b = m;\n    while (tz[a] <= x0) ++a;\n    while (tz[b - 1] > x1) --b;\n    if (a || b < m) tz = tz.slice(a, b), m = b - a;\n\n    var bins = new Array(m + 1),\n        bin;\n\n    // Initialize bins.\n    for (i = 0; i <= m; ++i) {\n      bin = bins[i] = [];\n      bin.x0 = i > 0 ? tz[i - 1] : x0;\n      bin.x1 = i < m ? tz[i] : x1;\n    }\n\n    // Assign data to bins by value, ignoring any outside the domain.\n    if (isFinite(step)) {\n      if (step > 0) {\n        for (i = 0; i < n; ++i) {\n          if ((x = values[i]) != null && x0 <= x && x <= x1) {\n            bins[Math.min(m, Math.floor((x - x0) / step))].push(data[i]);\n          }\n        }\n      } else if (step < 0) {\n        for (i = 0; i < n; ++i) {\n          if ((x = values[i]) != null && x0 <= x && x <= x1) {\n            const j = Math.floor((x0 - x) * step);\n            bins[Math.min(m, j + (tz[j] <= x))].push(data[i]); // handle off-by-one due to rounding\n          }\n        }\n      }\n    } else {\n      for (i = 0; i < n; ++i) {\n        if ((x = values[i]) != null && x0 <= x && x <= x1) {\n          bins[bisectRight(tz, x, 0, m)].push(data[i]);\n        }\n      }\n    }\n\n    return bins;\n  }\n\n  histogram.value = function(_) {\n    return arguments.length ? (value = typeof _ === \"function\" ? _ : constant(_), histogram) : value;\n  };\n\n  histogram.domain = function(_) {\n    return arguments.length ? (domain = typeof _ === \"function\" ? _ : constant([_[0], _[1]]), histogram) : domain;\n  };\n\n  histogram.thresholds = function(_) {\n    return arguments.length ? (threshold = typeof _ === \"function\" ? _ : constant(Array.isArray(_) ? slice.call(_) : _), histogram) : threshold;\n  };\n\n  return histogram;\n}\n\nfunction max(values, valueof) {\n  let max;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value;\n      }\n    }\n  }\n  return max;\n}\n\nfunction maxIndex(values, valueof) {\n  let max;\n  let maxIndex = -1;\n  let index = -1;\n  if (valueof === undefined) {\n    for (const value of values) {\n      ++index;\n      if (value != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value, maxIndex = index;\n      }\n    }\n  } else {\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (max < value || (max === undefined && value >= value))) {\n        max = value, maxIndex = index;\n      }\n    }\n  }\n  return maxIndex;\n}\n\nfunction min(values, valueof) {\n  let min;\n  if (valueof === undefined) {\n    for (const value of values) {\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value;\n      }\n    }\n  }\n  return min;\n}\n\nfunction minIndex(values, valueof) {\n  let min;\n  let minIndex = -1;\n  let index = -1;\n  if (valueof === undefined) {\n    for (const value of values) {\n      ++index;\n      if (value != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value, minIndex = index;\n      }\n    }\n  } else {\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null\n          && (min > value || (min === undefined && value >= value))) {\n        min = value, minIndex = index;\n      }\n    }\n  }\n  return minIndex;\n}\n\n// Based on https://github.com/mourner/quickselect\n// ISC license, Copyright 2018 Vladimir Agafonkin.\nfunction quickselect(array, k, left = 0, right = Infinity, compare) {\n  k = Math.floor(k);\n  left = Math.floor(Math.max(0, left));\n  right = Math.floor(Math.min(array.length - 1, right));\n\n  if (!(left <= k && k <= right)) return array;\n\n  compare = compare === undefined ? ascendingDefined : compareDefined(compare);\n\n  while (right > left) {\n    if (right - left > 600) {\n      const n = right - left + 1;\n      const m = k - left + 1;\n      const z = Math.log(n);\n      const s = 0.5 * Math.exp(2 * z / 3);\n      const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n      const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n      const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n      quickselect(array, k, newLeft, newRight, compare);\n    }\n\n    const t = array[k];\n    let i = left;\n    let j = right;\n\n    swap(array, left, k);\n    if (compare(array[right], t) > 0) swap(array, left, right);\n\n    while (i < j) {\n      swap(array, i, j), ++i, --j;\n      while (compare(array[i], t) < 0) ++i;\n      while (compare(array[j], t) > 0) --j;\n    }\n\n    if (compare(array[left], t) === 0) swap(array, left, j);\n    else ++j, swap(array, j, right);\n\n    if (j <= k) left = j + 1;\n    if (k <= j) right = j - 1;\n  }\n\n  return array;\n}\n\nfunction swap(array, i, j) {\n  const t = array[i];\n  array[i] = array[j];\n  array[j] = t;\n}\n\nfunction greatest(values, compare = ascending) {\n  let max;\n  let defined = false;\n  if (compare.length === 1) {\n    let maxValue;\n    for (const element of values) {\n      const value = compare(element);\n      if (defined\n          ? ascending(value, maxValue) > 0\n          : ascending(value, value) === 0) {\n        max = element;\n        maxValue = value;\n        defined = true;\n      }\n    }\n  } else {\n    for (const value of values) {\n      if (defined\n          ? compare(value, max) > 0\n          : compare(value, value) === 0) {\n        max = value;\n        defined = true;\n      }\n    }\n  }\n  return max;\n}\n\nfunction quantile(values, p, valueof) {\n  values = Float64Array.from(numbers(values, valueof));\n  if (!(n = values.length) || isNaN(p = +p)) return;\n  if (p <= 0 || n < 2) return min(values);\n  if (p >= 1) return max(values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = max(quickselect(values, i0).subarray(0, i0 + 1)),\n      value1 = min(values.subarray(i0 + 1));\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nfunction quantileSorted(values, p, valueof = number) {\n  if (!(n = values.length) || isNaN(p = +p)) return;\n  if (p <= 0 || n < 2) return +valueof(values[0], 0, values);\n  if (p >= 1) return +valueof(values[n - 1], n - 1, values);\n  var n,\n      i = (n - 1) * p,\n      i0 = Math.floor(i),\n      value0 = +valueof(values[i0], i0, values),\n      value1 = +valueof(values[i0 + 1], i0 + 1, values);\n  return value0 + (value1 - value0) * (i - i0);\n}\n\nfunction quantileIndex(values, p, valueof = number) {\n  if (isNaN(p = +p)) return;\n  numbers = Float64Array.from(values, (_, i) => number(valueof(values[i], i, values)));\n  if (p <= 0) return minIndex(numbers);\n  if (p >= 1) return maxIndex(numbers);\n  var numbers,\n      index = Uint32Array.from(values, (_, i) => i),\n      j = numbers.length - 1,\n      i = Math.floor(j * p);\n  quickselect(index, i, 0, j, (i, j) => ascendingDefined(numbers[i], numbers[j]));\n  i = greatest(index.subarray(0, i + 1), (i) => numbers[i]);\n  return i >= 0 ? i : -1;\n}\n\nfunction thresholdFreedmanDiaconis(values, min, max) {\n  const c = count(values), d = quantile(values, 0.75) - quantile(values, 0.25);\n  return c && d ? Math.ceil((max - min) / (2 * d * Math.pow(c, -1 / 3))) : 1;\n}\n\nfunction thresholdScott(values, min, max) {\n  const c = count(values), d = deviation(values);\n  return c && d ? Math.ceil((max - min) * Math.cbrt(c) / (3.49 * d)) : 1;\n}\n\nfunction mean(values, valueof) {\n  let count = 0;\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        ++count, sum += value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        ++count, sum += value;\n      }\n    }\n  }\n  if (count) return sum / count;\n}\n\nfunction median(values, valueof) {\n  return quantile(values, 0.5, valueof);\n}\n\nfunction medianIndex(values, valueof) {\n  return quantileIndex(values, 0.5, valueof);\n}\n\nfunction* flatten(arrays) {\n  for (const array of arrays) {\n    yield* array;\n  }\n}\n\nfunction merge(arrays) {\n  return Array.from(flatten(arrays));\n}\n\nfunction mode(values, valueof) {\n  const counts = new InternMap();\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && value >= value) {\n        counts.set(value, (counts.get(value) || 0) + 1);\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && value >= value) {\n        counts.set(value, (counts.get(value) || 0) + 1);\n      }\n    }\n  }\n  let modeValue;\n  let modeCount = 0;\n  for (const [value, count] of counts) {\n    if (count > modeCount) {\n      modeCount = count;\n      modeValue = value;\n    }\n  }\n  return modeValue;\n}\n\nfunction pairs(values, pairof = pair) {\n  const pairs = [];\n  let previous;\n  let first = false;\n  for (const value of values) {\n    if (first) pairs.push(pairof(previous, value));\n    previous = value;\n    first = true;\n  }\n  return pairs;\n}\n\nfunction pair(a, b) {\n  return [a, b];\n}\n\nfunction range(start, stop, step) {\n  start = +start, stop = +stop, step = (n = arguments.length) < 2 ? (stop = start, start = 0, 1) : n < 3 ? 1 : +step;\n\n  var i = -1,\n      n = Math.max(0, Math.ceil((stop - start) / step)) | 0,\n      range = new Array(n);\n\n  while (++i < n) {\n    range[i] = start + i * step;\n  }\n\n  return range;\n}\n\nfunction rank(values, valueof = ascending) {\n  if (typeof values[Symbol.iterator] !== \"function\") throw new TypeError(\"values is not iterable\");\n  let V = Array.from(values);\n  const R = new Float64Array(V.length);\n  if (valueof.length !== 2) V = V.map(valueof), valueof = ascending;\n  const compareIndex = (i, j) => valueof(V[i], V[j]);\n  let k, r;\n  values = Uint32Array.from(V, (_, i) => i);\n  // Risky chaining due to Safari 14 https://github.com/d3/d3-array/issues/123\n  values.sort(valueof === ascending ? (i, j) => ascendingDefined(V[i], V[j]) : compareDefined(compareIndex));\n  values.forEach((j, i) => {\n      const c = compareIndex(j, k === undefined ? j : k);\n      if (c >= 0) {\n        if (k === undefined || c > 0) k = j, r = i;\n        R[j] = r;\n      } else {\n        R[j] = NaN;\n      }\n    });\n  return R;\n}\n\nfunction least(values, compare = ascending) {\n  let min;\n  let defined = false;\n  if (compare.length === 1) {\n    let minValue;\n    for (const element of values) {\n      const value = compare(element);\n      if (defined\n          ? ascending(value, minValue) < 0\n          : ascending(value, value) === 0) {\n        min = element;\n        minValue = value;\n        defined = true;\n      }\n    }\n  } else {\n    for (const value of values) {\n      if (defined\n          ? compare(value, min) < 0\n          : compare(value, value) === 0) {\n        min = value;\n        defined = true;\n      }\n    }\n  }\n  return min;\n}\n\nfunction leastIndex(values, compare = ascending) {\n  if (compare.length === 1) return minIndex(values, compare);\n  let minValue;\n  let min = -1;\n  let index = -1;\n  for (const value of values) {\n    ++index;\n    if (min < 0\n        ? compare(value, value) === 0\n        : compare(value, minValue) < 0) {\n      minValue = value;\n      min = index;\n    }\n  }\n  return min;\n}\n\nfunction greatestIndex(values, compare = ascending) {\n  if (compare.length === 1) return maxIndex(values, compare);\n  let maxValue;\n  let max = -1;\n  let index = -1;\n  for (const value of values) {\n    ++index;\n    if (max < 0\n        ? compare(value, value) === 0\n        : compare(value, maxValue) > 0) {\n      maxValue = value;\n      max = index;\n    }\n  }\n  return max;\n}\n\nfunction scan(values, compare) {\n  const index = leastIndex(values, compare);\n  return index < 0 ? undefined : index;\n}\n\nvar shuffle = shuffler(Math.random);\n\nfunction shuffler(random) {\n  return function shuffle(array, i0 = 0, i1 = array.length) {\n    let m = i1 - (i0 = +i0);\n    while (m) {\n      const i = random() * m-- | 0, t = array[m + i0];\n      array[m + i0] = array[i + i0];\n      array[i + i0] = t;\n    }\n    return array;\n  };\n}\n\nfunction sum(values, valueof) {\n  let sum = 0;\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value = +value) {\n        sum += value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if (value = +valueof(value, ++index, values)) {\n        sum += value;\n      }\n    }\n  }\n  return sum;\n}\n\nfunction transpose(matrix) {\n  if (!(n = matrix.length)) return [];\n  for (var i = -1, m = min(matrix, length), transpose = new Array(m); ++i < m;) {\n    for (var j = -1, n, row = transpose[i] = new Array(n); ++j < n;) {\n      row[j] = matrix[j][i];\n    }\n  }\n  return transpose;\n}\n\nfunction length(d) {\n  return d.length;\n}\n\nfunction zip() {\n  return transpose(arguments);\n}\n\nfunction every(values, test) {\n  if (typeof test !== \"function\") throw new TypeError(\"test is not a function\");\n  let index = -1;\n  for (const value of values) {\n    if (!test(value, ++index, values)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction some(values, test) {\n  if (typeof test !== \"function\") throw new TypeError(\"test is not a function\");\n  let index = -1;\n  for (const value of values) {\n    if (test(value, ++index, values)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction filter(values, test) {\n  if (typeof test !== \"function\") throw new TypeError(\"test is not a function\");\n  const array = [];\n  let index = -1;\n  for (const value of values) {\n    if (test(value, ++index, values)) {\n      array.push(value);\n    }\n  }\n  return array;\n}\n\nfunction map(values, mapper) {\n  if (typeof values[Symbol.iterator] !== \"function\") throw new TypeError(\"values is not iterable\");\n  if (typeof mapper !== \"function\") throw new TypeError(\"mapper is not a function\");\n  return Array.from(values, (value, index) => mapper(value, index, values));\n}\n\nfunction reduce(values, reducer, value) {\n  if (typeof reducer !== \"function\") throw new TypeError(\"reducer is not a function\");\n  const iterator = values[Symbol.iterator]();\n  let done, next, index = -1;\n  if (arguments.length < 3) {\n    ({done, value} = iterator.next());\n    if (done) return;\n    ++index;\n  }\n  while (({done, value: next} = iterator.next()), !done) {\n    value = reducer(value, next, ++index, values);\n  }\n  return value;\n}\n\nfunction reverse(values) {\n  if (typeof values[Symbol.iterator] !== \"function\") throw new TypeError(\"values is not iterable\");\n  return Array.from(values).reverse();\n}\n\nfunction difference(values, ...others) {\n  values = new InternSet(values);\n  for (const other of others) {\n    for (const value of other) {\n      values.delete(value);\n    }\n  }\n  return values;\n}\n\nfunction disjoint(values, other) {\n  const iterator = other[Symbol.iterator](), set = new InternSet();\n  for (const v of values) {\n    if (set.has(v)) return false;\n    let value, done;\n    while (({value, done} = iterator.next())) {\n      if (done) break;\n      if (Object.is(v, value)) return false;\n      set.add(value);\n    }\n  }\n  return true;\n}\n\nfunction intersection(values, ...others) {\n  values = new InternSet(values);\n  others = others.map(set);\n  out: for (const value of values) {\n    for (const other of others) {\n      if (!other.has(value)) {\n        values.delete(value);\n        continue out;\n      }\n    }\n  }\n  return values;\n}\n\nfunction set(values) {\n  return values instanceof InternSet ? values : new InternSet(values);\n}\n\nfunction superset(values, other) {\n  const iterator = values[Symbol.iterator](), set = new Set();\n  for (const o of other) {\n    const io = intern(o);\n    if (set.has(io)) continue;\n    let value, done;\n    while (({value, done} = iterator.next())) {\n      if (done) return false;\n      const ivalue = intern(value);\n      set.add(ivalue);\n      if (Object.is(io, ivalue)) break;\n    }\n  }\n  return true;\n}\n\nfunction intern(value) {\n  return value !== null && typeof value === \"object\" ? value.valueOf() : value;\n}\n\nfunction subset(values, other) {\n  return superset(other, values);\n}\n\nfunction union(...others) {\n  const set = new InternSet();\n  for (const other of others) {\n    for (const o of other) {\n      set.add(o);\n    }\n  }\n  return set;\n}\n\nexport { Adder, InternMap, InternSet, ascending, bin, bisectRight as bisect, bisectCenter, bisectLeft, bisectRight, bisector, blur, blur2, blurImage, count, cross, cumsum, descending, deviation, difference, disjoint, every, extent, fcumsum, filter, flatGroup, flatRollup, fsum, greatest, greatestIndex, group, groupSort, groups, bin as histogram, index, indexes, intersection, least, leastIndex, map, max, maxIndex, mean, median, medianIndex, merge, min, minIndex, mode, nice, pairs, permute, quantile, quantileIndex, quantileSorted, quickselect, range, rank, reduce, reverse, rollup, rollups, scan, shuffle, shuffler, some, sort, subset, sum, superset, thresholdFreedmanDiaconis, thresholdScott, thresholdSturges, tickIncrement, tickStep, ticks, transpose, union, variance, zip };\n"],"ignoreList":[0],"mappings":";AACA,SAASA,EAAU,GAAG,GAAG;CACvB,OAAOC,KAAK,QAAQC,KAAK,OAAO,MAAMD,IAAIC,IAAI,KAAKD,IAAIC,IAAI,IAAID,KAAKC,IAAI,IAAI;AAC9E;AAEA,SAASC,EAAW,GAAG,GAAG;CACxB,OAAOF,KAAK,QAAQC,KAAK,OAAO,MAC5BA,IAAID,IAAI,KACRC,IAAID,IAAI,IACRC,KAAKD,IAAI,IACT;AACN;AAEA,SAASG,EAAS,GAAG;CACnB,IAAIC,GAAUC,GAAUC;CAOxB,AAAIC,EAAE,WAAW,KAKf,IAAWA,MAAMR,KAAaQ,MAAML,IAAaK,IAAIC,GACrD,IAAWD,GACX,IAAQA,MANR,IAAWR,GACX,KAAY,GAAG,MAAMA,EAAUQ,EAAEE,CAAC,GAAGC,CAAC,GACtC,KAAS,GAAG,MAAMH,EAAEE,CAAC,IAAIC;CAO3B,SAASC,EAAK,GAAG,GAAG,IAAK,GAAG,IAAKX,EAAE,QAAQ;EACzC,IAAIY,IAAKC,GAAI;GACX,IAAIT,EAASM,GAAGA,CAAC,MAAM,GAAG,OAAOG;GACjC,GAAG;IACD,IAAMC,IAAOF,IAAKC,MAAQ;IAC1B,AAAIR,EAASL,EAAEc,IAAMJ,CAAC,IAAI,IAAG,IAAKI,IAAM,IACnC,IAAKA;GACZ,SAASF,IAAKC;EAChB;EACA,OAAOD;CACT;CAEA,SAASG,EAAM,GAAG,GAAG,IAAK,GAAG,IAAKf,EAAE,QAAQ;EAC1C,IAAIY,IAAKC,GAAI;GACX,IAAIT,EAASM,GAAGA,CAAC,MAAM,GAAG,OAAOG;GACjC,GAAG;IACD,IAAMC,IAAOF,IAAKC,MAAQ;IAC1B,AAAIR,EAASL,EAAEc,IAAMJ,CAAC,KAAK,IAAG,IAAKI,IAAM,IACpC,IAAKA;GACZ,SAASF,IAAKC;EAChB;EACA,OAAOD;CACT;CAEA,SAASI,EAAO,GAAG,GAAG,IAAK,GAAG,IAAKhB,EAAE,QAAQ;EAC3C,IAAM,IAAIW,EAAKX,GAAGU,GAAGE,GAAIC,IAAK,CAAC;EAC/B,OAAO,IAAID,KAAMN,EAAMN,EAAE,IAAI,IAAIU,CAAC,IAAI,CAACJ,EAAMN,EAAE,IAAIU,CAAC,IAAI,IAAI,IAAI;CAClE;CAEA,OAAO;EAAC;EAAM;EAAQ;CAAK;AAC7B;AAEA,SAASF,IAAO;CACd,OAAO;AACT;AAEA,SAASS,EAAO,GAAG;CACjB,OAAOP,MAAM,OAAO,MAAM,CAACA;AAC7B;AAEA,UAAUQ,EAAQ,GAAQ,GAAS;CACjC,IAAIC,MAAY,KAAA,GACT,KAAA,IAAIC,KAASC,GAChB,AAAID,KAAS,SAAS,IAAQ,CAACA,MAAUA,MACvC,MAAMA;MAGL;EACL,IAAIE,IAAQ;EACZ,KAAK,IAAIF,KAASC,GAChB,CAAK,IAAQF,EAAQC,GAAO,EAAEE,GAAOD,CAAM,MAAM,SAAS,IAAQ,CAACD,MAAUA,MAC3E,MAAMA;CAGZ;AACF;AAEA,IAAMG,IAAkBpB,EAASJ,CAAS,GACpCyB,IAAcD,EAAgB;AACjBA,EAAgB,MACdpB,EAASc,CAAM,CAAC,CAAC;AAqTtC,IAAMQ,IAAN,cAAwB,IAAI;CAC1B,YAAY,GAAS,IAAMC,GAAO;EAGhC,IAFA,MAAM,GACN,OAAO,iBAAiB,MAAM;GAAC,SAAS,EAAC,uBAAO,IAAI,IAAI,EAAC;GAAG,MAAM,EAAC,OAAOC,EAAG;EAAC,CAAC,GAC3EC,KAAW,MAAM,KAAK,IAAM,CAACD,GAAKP,MAAUQ,GAAS,KAAK,IAAID,GAAKP,CAAK;CAC9E;CACA,IAAI,GAAK;EACP,OAAO,MAAM,IAAIS,EAAW,MAAMF,CAAG,CAAC;CACxC;CACA,IAAI,GAAK;EACP,OAAO,MAAM,IAAIE,EAAW,MAAMF,CAAG,CAAC;CACxC;CACA,IAAI,GAAK,GAAO;EACd,OAAO,MAAM,IAAIG,EAAW,MAAMH,CAAG,GAAGP,CAAK;CAC/C;CACA,OAAO,GAAK;EACV,OAAO,MAAM,OAAOW,EAAc,MAAMJ,CAAG,CAAC;CAC9C;AACF;AAmBA,SAASE,EAAW,EAAC,YAAS,WAAO,GAAO;CAC1C,IAAMF,IAAMK,EAAKZ,CAAK;CACtB,OAAOa,EAAQ,IAAIN,CAAG,IAAIM,EAAQ,IAAIN,CAAG,IAAIP;AAC/C;AAEA,SAASU,EAAW,EAAC,YAAS,WAAO,GAAO;CAC1C,IAAMH,IAAMK,EAAKZ,CAAK;CAGtB,OAFIa,EAAQ,IAAIN,CAAG,IAAUM,EAAQ,IAAIN,CAAG,KAC5CM,EAAQ,IAAIN,GAAKP,CAAK,GACfA;AACT;AAEA,SAASW,EAAc,EAAC,YAAS,WAAO,GAAO;CAC7C,IAAMJ,IAAMK,EAAKZ,CAAK;CAKtB,OAJIa,EAAQ,IAAIN,CAAG,MACjB,IAAQM,EAAQ,IAAIN,CAAG,GACvBM,EAAQ,OAAON,CAAG,IAEbP;AACT;AAEA,SAASM,EAAM,GAAO;CACpB,OAAyB,OAAON,KAAU,YAAnCA,IAA8CA,EAAM,QAAQ,IAAIA;AACzE;AAgGA,SAASc,EAAe,IAAUnC,GAAW;CAC3C,IAAIoC,MAAYpC,GAAW,OAAOqC;CAClC,IAAI,OAAOD,KAAY,YAAY,MAAU,UAAU,2BAA2B;CAClF,QAAQ,GAAG,MAAM;EACf,IAAMzB,IAAIyB,EAAQnC,GAAGC,CAAC;EAEtB,OADIS,KAAKA,MAAM,IAAUA,KACjByB,EAAQlC,GAAGA,CAAC,MAAM,MAAMkC,EAAQnC,GAAGA,CAAC,MAAM;CACpD;AACF;AAEA,SAASoC,EAAiB,GAAG,GAAG;CAC9B,QAAQpC,KAAK,QAAQ,EAAEA,KAAKA,OAAOC,KAAK,QAAQ,EAAEA,KAAKA,QAAQD,IAAIC,IAAI,KAAK,MAAIA;AAClF;AASY,MAAM,UAEA;AAMlB,IAAMoC,IAAM,KAAK,KAAK,EAAE,GACpBC,IAAK,KAAK,KAAK,EAAE,GACjBC,IAAK,KAAK,KAAK,CAAC;AAEpB,SAASC,EAAS,GAAO,GAAM,GAAO;CACpC,IAAMC,KAAQC,IAAOC,KAAS,KAAK,IAAI,GAAGC,CAAK,GAC3CC,IAAQ,KAAK,MAAM,KAAK,MAAMJ,CAAI,CAAC,GACnCK,IAAQL,IAAgB,MAAII,GAC5BE,IAASD,KAAST,IAAM,KAAKS,KAASR,IAAK,IAAIQ,KAASP,IAAK,IAAI,GACjES,GAAIC,GAAIC;CAgBZ,OAfIL,IAAQ,KACV,IAAe,MAAI,CAACA,IAASE,GAC7B,IAAK,KAAK,MAAMJ,IAAQO,CAAG,GAC3B,IAAK,KAAK,MAAMR,IAAOQ,CAAG,GACtBF,IAAKE,IAAMP,KAAO,EAAEK,GACpBC,IAAKC,IAAMR,KAAM,EAAEO,GACvB,IAAM,CAACC,MAEP,IAAe,MAAIL,IAASE,GAC5B,IAAK,KAAK,MAAMJ,IAAQO,CAAG,GAC3B,IAAK,KAAK,MAAMR,IAAOQ,CAAG,GACtBF,IAAKE,IAAMP,KAAO,EAAEK,GACpBC,IAAKC,IAAMR,KAAM,EAAEO,IAErBA,IAAKD,KAAM,MAAOJ,KAASA,IAAQ,IAAUJ,EAASG,GAAOD,GAAME,IAAQ,CAAC,IACzE;EAACI;EAAIC;EAAIC;CAAG;AACrB;AAEA,SAASC,EAAM,GAAO,GAAM,GAAO;CAEjC,IADA,IAAO,CAACT,GAAM,IAAQ,CAACC,GAAO,IAAQ,CAACC,GACnC,EAAEA,IAAQ,IAAI,OAAO,CAAC;CAC1B,IAAID,MAAUD,GAAM,OAAO,CAACC,CAAK;CACjC,IAAMS,IAAUV,IAAOC,GAAO,CAACK,GAAIC,GAAIC,KAAOE,IAAUZ,EAASE,GAAMC,GAAOC,CAAK,IAAIJ,EAASG,GAAOD,GAAME,CAAK;CAClH,IAAI,EAAEK,KAAMD,IAAK,OAAO,CAAC;CACzB,IAAMK,IAAIJ,IAAKD,IAAK,GAAGG,IAAY,MAAME,CAAC;CAC1C,IAAID,GAAS;EACX,IAAIF,IAAM,GAAG,KAAK,IAAII,IAAI,GAAGA,IAAID,GAAG,EAAEC,GAAG,EAAMA,MAAML,IAAKK,KAAK,CAACJ;OAC3D,KAAK,IAAII,IAAI,GAAGA,IAAID,GAAG,EAAEC,GAAG,EAAMA,MAAML,IAAKK,KAAKJ;CACzD,OACE,IAAIA,IAAM,GAAG,KAAK,IAAII,IAAI,GAAGA,IAAID,GAAG,EAAEC,GAAG,EAAMA,MAAMN,IAAKM,KAAK,CAACJ;MAC3D,KAAK,IAAII,IAAI,GAAGA,IAAID,GAAG,EAAEC,GAAG,EAAMA,MAAMN,IAAKM,KAAKJ;CAEzD,OAAOC;AACT;AAEA,SAASI,EAAc,GAAO,GAAM,GAAO;CAEzC,OADA,IAAO,CAACb,GAAM,IAAQ,CAACC,GAAO,IAAQ,CAACC,GAChCJ,EAASG,GAAOD,GAAME,CAAK,CAAC,CAAC;AACtC;AAEA,SAASY,EAAS,GAAO,GAAM,GAAO;CACpC,IAAO,CAACd,GAAM,IAAQ,CAACC,GAAO,IAAQ,CAACC;CACvC,IAAMQ,IAAUV,IAAOC,GAAOO,IAAME,IAAUG,EAAcb,GAAMC,GAAOC,CAAK,IAAIW,EAAcZ,GAAOD,GAAME,CAAK;CAClH,QAAQQ,IAAU,KAAK,MAAMF,IAAM,IAAI,IAAI,CAACA,IAAMA;AACpD;AAiJA,SAASO,EAAI,GAAQ,GAAS;CAC5B,IAAIA;CACJ,IAAItC,MAAY,KAAA,GACT,KAAA,IAAMC,KAASC,GAClB,AAAID,KAAS,SACLqC,IAAMrC,KAAUqC,MAAQ,KAAA,KAAarC,KAASA,OACpD,IAAMA;MAGL;EACL,IAAIE,IAAQ;EACZ,KAAK,IAAIF,KAASC,GAChB,CAAK,IAAQF,EAAQC,GAAO,EAAEE,GAAOD,CAAM,MAAM,SACzCoC,IAAMrC,KAAUqC,MAAQ,KAAA,KAAarC,KAASA,OACpD,IAAMA;CAGZ;CACA,OAAOqC;AACT;AAyBA,SAASC,EAAI,GAAQ,GAAS;CAC5B,IAAIA;CACJ,IAAIvC,MAAY,KAAA,GACT,KAAA,IAAMC,KAASC,GAClB,AAAID,KAAS,SACLsC,IAAMtC,KAAUsC,MAAQ,KAAA,KAAatC,KAASA,OACpD,IAAMA;MAGL;EACL,IAAIE,IAAQ;EACZ,KAAK,IAAIF,KAASC,GAChB,CAAK,IAAQF,EAAQC,GAAO,EAAEE,GAAOD,CAAM,MAAM,SACzCqC,IAAMtC,KAAUsC,MAAQ,KAAA,KAAatC,KAASA,OACpD,IAAMA;CAGZ;CACA,OAAOsC;AACT;AA2BA,SAASC,EAAY,GAAO,GAAG,IAAO,GAAG,IAAQ,UAAU,GAAS;CAKlE,IAJA,IAAI,KAAK,MAAMC,CAAC,GAChB,IAAO,KAAK,MAAM,KAAK,IAAI,GAAGjD,CAAI,CAAC,GACnC,IAAQ,KAAK,MAAM,KAAK,IAAIkD,EAAM,SAAS,GAAG9C,CAAK,CAAC,GAEhD,EAAEJ,KAAQiD,KAAKA,KAAK7C,IAAQ,OAAO8C;CAIvC,KAFA,IAAU1B,MAAY,KAAA,IAAYC,IAAmBF,EAAeC,CAAO,GAEpEpB,IAAQJ,IAAM;EACnB,IAAII,IAAQJ,IAAO,KAAK;GACtB,IAAM0C,IAAItC,IAAQJ,IAAO,GACnBmD,IAAIF,IAAIjD,IAAO,GACfoD,IAAI,KAAK,IAAIV,CAAC,GACdW,IAAI,KAAM,KAAK,IAAI,IAAID,IAAI,CAAC,GAC5BE,IAAK,KAAM,KAAK,KAAKF,IAAIC,KAAKX,IAAIW,KAAKX,CAAC,KAAKS,IAAIT,IAAI,IAAI,IAAI,KAAK,IAClEa,IAAU,KAAK,IAAIvD,GAAM,KAAK,MAAMiD,IAAIE,IAAIE,IAAIX,IAAIY,CAAE,CAAC,GACvDE,IAAW,KAAK,IAAIpD,GAAO,KAAK,MAAM6C,KAAKP,IAAIS,KAAKE,IAAIX,IAAIY,CAAE,CAAC;GACrE,EAAYJ,GAAOD,GAAGM,GAASC,GAAUhC,CAAO;EAClD;EAEA,IAAMiC,IAAIP,EAAMD,IACZN,IAAI3C,GACJ0D,IAAItD;EAKR,KAHAuD,EAAKT,GAAOlD,GAAMiD,CAAC,GACfzB,EAAQ0B,EAAM9C,IAAQqD,CAAC,IAAI,KAAGE,EAAKT,GAAOlD,GAAMI,CAAK,GAElDuC,IAAIe,IAAG;GAEZ,KADAC,EAAKT,GAAOP,GAAGe,CAAC,GAAG,EAAEf,GAAG,EAAEe,GACnBlC,EAAQ0B,EAAMP,IAAIc,CAAC,IAAI,IAAG,EAAEd;GACnC,OAAOnB,EAAQ0B,EAAMQ,IAAID,CAAC,IAAI,IAAG,EAAEC;EACrC;EAMA,AAJIlC,EAAQ0B,EAAMlD,IAAOyD,CAAC,MAAM,IAAGE,EAAKT,GAAOlD,GAAM0D,CAAC,KACjD,EAAEA,GAAGC,EAAKT,GAAOQ,GAAGtD,CAAK,IAE1BsD,KAAKT,MAAG,IAAOS,IAAI,IACnBT,KAAKS,MAAG,IAAQA,IAAI;CAC1B;CAEA,OAAOR;AACT;AAEA,SAASS,EAAK,GAAO,GAAG,GAAG;CACzB,IAAMF,IAAIP,EAAMP;CAEhB,AADA,EAAMA,KAAKO,EAAMQ,IACjB,EAAMA,KAAKD;AACb;AA8BA,SAASG,EAAS,GAAQ,GAAG,GAAS;CAEpC,IADA,IAAS,aAAa,KAAKrD,EAAQG,GAAQF,CAAO,CAAC,IAC7C,IAAIE,EAAO,WAAW,OAAM,IAAI,CAACmD,CAAC,GACxC;MAAIA,KAAK,KAAKnB,IAAI,GAAG,OAAOK,EAAIrC,CAAM;EACtC,IAAImD,KAAK,GAAG,OAAOf,EAAIpC,CAAM;EAC7B,IAAIgC,GACA,KAAKA,IAAI,KAAKmB,GACdC,IAAK,KAAK,MAAM,CAAC,GACjBC,IAASjB,EAAIE,EAAYtC,GAAQoD,CAAE,CAAC,CAAC,SAAS,GAAGA,IAAK,CAAC,CAAC;EAE5D,OAAOC,KADMhB,EAAIrC,EAAO,SAASoD,IAAK,CAAC,CACjB,IAAIC,MAAW,IAAID;CAPH;AAQxC;AAEA,SAASE,EAAe,GAAQ,GAAG,IAAU1D,GAAQ;CACnD,KAAM,IAAII,EAAO,WAAW,OAAM,IAAI,CAACmD,CAAC,GACxC;MAAIA,KAAK,KAAKnB,IAAI,GAAG,OAAO,CAAClC,EAAQE,EAAO,IAAI,GAAGA,CAAM;EACzD,IAAImD,KAAK,GAAG,OAAO,CAACrD,EAAQE,EAAOgC,IAAI,IAAIA,IAAI,GAAGhC,CAAM;EACxD,IAAIgC,GACAC,KAAKD,IAAI,KAAKmB,GACdC,IAAK,KAAK,MAAMnB,CAAC,GACjBoB,IAAS,CAACvD,EAAQE,EAAOoD,IAAKA,GAAIpD,CAAM;EAE5C,OAAOqD,KAAU,CADHvD,EAAQE,EAAOoD,IAAK,IAAIA,IAAK,GAAGpD,CAAM,IAC1BqD,MAAWpB,IAAImB;CAPgB;AAQ3D;AA2GA,SAASG,EAAM,GAAO,GAAM,GAAM;CAChC,IAAQ,CAACjC,GAAO,IAAO,CAACD,GAAM,KAAQ,IAAI,UAAU,UAAU,KAAK,IAAOC,GAAO,IAAQ,GAAG,KAAKU,IAAI,IAAI,IAAI,CAACZ;CAM9G,KAJA,IAAIa,IAAI,IACJD,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMX,IAAOC,KAASF,CAAI,CAAC,IAAI,GACpDmC,IAAY,MAAMvB,CAAC,GAEhB,EAAEC,IAAID,IACX,EAAMC,KAAKX,IAAQW,IAAIb;CAGzB,OAAOmC;AACT;AA6FA,SAASC,EAAS,GAAQ;CACxB,OAAO,SAAiB,GAAO,IAAK,GAAG,IAAKhB,EAAM,QAAQ;EACxD,IAAIC,IAAId,KAAM,IAAK,CAACyB;EACpB,OAAOX,IAAG;GACR,IAAMR,IAAIwB,EAAO,IAAI,MAAM,GAAGV,IAAIP,EAAMC,IAAIW;GAE5C,AADA,EAAMX,IAAIW,KAAMZ,EAAMP,IAAImB,IAC1B,EAAMnB,IAAImB,KAAML;EAClB;EACA,OAAOP;CACT;AACF"}