@sophistry/charts 0.0.0-stage → 0.1.0

package/dist/math-CSHNpGej.js

@@ -0,0 +1,3648 @@
+import { c as e } from "./voxels-9lJ2TZS4.js";
+import { TAU as t, axisTimeZone as n, calendarAxis as r, clamp01 as i, clampNonNegative as a, delaunayTriangleIndices as o, finiteOrZero as s, finiteValues as c, hashUnit as l, maxOf as u, minOf as d, mix as f, polarPoint as p, stitchSegments as m, wrapAngle as h } from "@sophistry/core/internal";
+import { areaCurvePath as g, clamp as _, closedCurvePath as v, formatTick as y, niceStep as b, tickValues as x } from "@sophistry/core/geometry";
+import { deviation as S, extent as C, max as w, mean as T, median as E, min as D, quantile as O, sum as k, variance as A } from "d3-array";
+import { cluster as ee, hierarchy as te, pack as ne, partition as re, tree as ie, treemap as ae, treemapBinary as oe, treemapDice as se, treemapResquarify as ce, treemapSlice as le, treemapSliceDice as ue, treemapSquarify as de } from "d3-hierarchy";
+//#region src/math/ordinal.ts
+function fe(e) {
+	let t = /* @__PURE__ */ new Set();
+	for (let n of e) n != null && (typeof n == "number" && Number.isNaN(n) || t.add(n));
+	return [...t];
+}
+function pe(e, t, n = {}) {
+	if (t.length === 0) throw RangeError("ordinalColorScale: `range` needs at least one colour.");
+	let r = fe(e), i = /* @__PURE__ */ new Map();
+	r.forEach((e, t) => {
+		i.set(e, t);
+	});
+	let a = n.unknown ?? t[0], o = (e) => e == null ? -1 : i.get(e) ?? -1, s = ((e) => {
+		let n = o(e);
+		return n < 0 ? a : t[n % t.length];
+	});
+	return Object.defineProperties(s, {
+		domain: {
+			value: r,
+			enumerable: !0
+		},
+		range: {
+			value: t,
+			enumerable: !0
+		},
+		index: {
+			value: o,
+			enumerable: !0
+		}
+	}), s;
+}
+var me = Object.freeze([
+	"#e69f00",
+	"#56b4e9",
+	"#009e73",
+	"#f0e442",
+	"#0072b2",
+	"#d55e00",
+	"#cc79a7",
+	"#999999"
+]), he = Object.freeze([
+	"#4e79a7",
+	"#f28e2c",
+	"#e15759",
+	"#76b7b2",
+	"#59a14f",
+	"#edc949",
+	"#af7aa1",
+	"#ff9da7",
+	"#9c755f",
+	"#bab0ab"
+]), ge = Object.freeze([
+	"#4269d0",
+	"#efb118",
+	"#ff725c",
+	"#6cc5b0",
+	"#3ca951",
+	"#ff8ab7",
+	"#a463f2",
+	"#97bbf5",
+	"#9c6b4e",
+	"#9498a0"
+]);
+function _e(e, t, n) {
+	let r = [];
+	if (t) {
+		let n = /* @__PURE__ */ new Map();
+		for (let i = 0; i < e; i++) {
+			let e = t(i) ?? `#${i}`, a = n.get(e) ?? 0;
+			n.set(e, a + 1), r.push(a === 0 ? e : `${String(e)}#${a + 1}`);
+		}
+		return r;
+	}
+	if (n) {
+		let t = /* @__PURE__ */ new Map();
+		for (let i = 0; i < e; i++) {
+			let e = n(i), a = t.get(e) ?? 0;
+			t.set(e, a + 1), r.push(`${typeof e}:${String(e)}\u0001${a}`);
+		}
+		return r;
+	}
+	for (let t = 0; t < e; t++) r.push(t);
+	return r;
+}
+//#endregion
+//#region src/math/join.ts
+function ve(e, t) {
+	let n = /* @__PURE__ */ new Map();
+	e.forEach((e, t) => {
+		n.has(e) || n.set(e, t);
+	});
+	let r = /* @__PURE__ */ new Map();
+	t.forEach((e, t) => {
+		r.has(e) || r.set(e, t);
+	});
+	let i = [...n.keys()], a = !1;
+	for (let e of r.keys()) n.has(e) || (i.push(e), a = !0);
+	let o = !1;
+	for (let e of n.keys()) if (!r.has(e)) {
+		o = !0;
+		break;
+	}
+	return {
+		keys: i,
+		from: n,
+		to: r,
+		enters: a,
+		exits: o
+	};
+}
+var j = [0, 1];
+function ye(e) {
+	return e < .5 ? 4 * e * e * e : 1 - (-2 * e + 2) ** 3 / 2;
+}
+function be(e = {}) {
+	if (e.staging === "together") return {
+		exit: j,
+		expand: j,
+		update: j,
+		contract: j,
+		enter: j,
+		eased: !1
+	};
+	let t = !!(e.exits || e.expand), n = !!(e.enters || e.contract), r = 1 / (1 + +!!t + +!!n), i = t ? r : 0, a = n ? 1 - r : 1, o = [0, i], s = [i, a], c = [a, 1];
+	return {
+		exit: o,
+		expand: o,
+		update: s,
+		contract: c,
+		enter: c,
+		eased: !0
+	};
+}
+function xe(e, t) {
+	return e[1] > e[0] ? e : t;
+}
+function M(e, t, n = !1) {
+	let [r, i] = t;
+	if (!(e > r)) return +(e >= r && i <= r);
+	if (e >= i) return 1;
+	let a = (e - r) / (i - r);
+	return n ? ye(a) : a;
+}
+function Se(e, t, n, r, i, a) {
+	let o = Math.min(.95, Math.max(0, a || 0));
+	if (o === 0 || i <= 1) return M(e, t, n);
+	let s = (M(e, t, !1) - o * Math.min(Math.max(r, 0), i - 1) / (i - 1)) / (1 - o), c = s > 0 ? s < 1 ? s : 1 : 0;
+	return n ? ye(c) : c;
+}
+function Ce(e, t) {
+	let n = Math.min(e[0], e[1]), r = Math.max(e[0], e[1]), i = Math.min(t[0], t[1]), a = Math.max(t[0], t[1]);
+	return n === i && r === a ? "none" : i <= n && a >= r ? "expand" : n <= i && r >= a ? "contract" : "shift";
+}
+function we(e, t) {
+	return t === "expand" ? e.expand : t === "contract" ? e.contract : e.update;
+}
+//#endregion
+//#region src/math/range.ts
+var Te = 5, Ee = .25;
+function De(e, t, n, r, i) {
+	let a = Ee * i * (1 + 1e-9);
+	return [e - n <= a ? n : e, r - t <= a ? r : t];
+}
+function Oe(e, t = {}) {
+	return ke(e, {
+		zero: !0,
+		targetTicks: t.targetTicks
+	});
+}
+function ke(e, t = {}) {
+	let r = t.type ?? "linear", i = e.filter((e) => r === "log" ? e > 0 && Number.isFinite(e) : Number.isFinite(e)), a = i.length > 0 ? d(i) : void 0, o = i.length > 0 ? u(i) : void 0;
+	if (r === "log") return Me(a, o, t.base ?? 10, t.nice);
+	if (r === "time" || r === "utc") return Ne(a, o, n(r, t.timeZone), t);
+	let s = a ?? 0, c = o ?? 0;
+	if (t.zero && (s = Math.min(0, s), c = Math.max(0, c)), [s, c] = N(s, c, t.margin, t.zero), s === c) {
+		if (s === 0) return [
+			0,
+			1,
+			1
+		];
+		let e = Math.abs(s) * .1;
+		s -= t.zero && s >= 0 ? 0 : e, c += t.zero && c <= 0 ? 0 : e;
+	}
+	if (t.nice === !1) return [s, c];
+	let l = b(c - s, t.targetTicks ?? Te), f = Math.floor(s / l) * l, p = Math.ceil(c / l) * l;
+	return t.nice === "tight" ? [...De(s, c, f, p, l), l] : [
+		f,
+		p,
+		l
+	];
+}
+var Ae = [
+	1,
+	2,
+	2.5,
+	5
+];
+function je(e, t, n, r = {}) {
+	let i = Math.min(e[0], e[1]), a = Math.max(e[0], e[1]), o = a - i, s = t.filter((e) => Number.isFinite(e));
+	if (!(o > 0) || !Number.isFinite(o) || s.length < 2) return;
+	let c = d(s), l = u(s), f = (l - c) / (s.length - 1) / o;
+	if (!(f > 0)) return;
+	let p = r.opposite ? (a - l) / o : (c - i) / o, m = p / f - Math.floor(p / f + 1e-9), h = n.filter((e) => Number.isFinite(e)), g = h.length > 0 ? d(h) : 0, _ = h.length > 0 ? u(h) : 0;
+	if (r.zero && (g = Math.min(0, g), _ = Math.max(0, _)), [g, _] = N(g, _, r.margin, r.zero), g === _) {
+		if (g === 0) _ = 1;
+		else {
+			let e = Math.abs(g) * .1;
+			g -= r.zero && g >= 0 ? 0 : e, _ += r.zero && _ <= 0 ? 0 : e;
+		}
+	}
+	let v = (_ - g) * f, y = Math.floor(Math.log10(v)) - 1, b = (e) => Number(e.toPrecision(12)) + 0;
+	for (let e = 0; e < 40; e++, y++) for (let e of Ae) {
+		let t = e * 10 ** y;
+		if (t < v * (1 - 1e-9)) continue;
+		let n = t / f, r = t * (Math.floor(g / t + m + 1e-9) - m);
+		if (r + n >= _ - Math.abs(_) * 1e-12) return [
+			b(r),
+			b(r + n),
+			t
+		];
+	}
+}
+function N(e, t, n, r) {
+	let i = t - e;
+	if (!(n && n > 0) || !(i > 0)) return [e, t];
+	let a = i * n;
+	return [r && e === 0 ? e : e - a, r && t === 0 ? t : t + a];
+}
+function Me(e, t, n, r) {
+	if (e === void 0 || t === void 0 || !(n > 1)) return [1, n > 1 ? n : 10];
+	let i = Math.log(n);
+	if (r === "tight" && t > e) {
+		let r = Math.log(e) / i, a = Math.log(t) / i, [o, s] = De(r, a, Math.floor(r + 1e-9), Math.ceil(a - 1e-9), 1);
+		return [o === r ? e : n ** o, s === a ? t : n ** s];
+	}
+	let a = n ** Math.floor(Math.log(e) / i + 1e-9), o = n ** Math.ceil(Math.log(t) / i - 1e-9);
+	return o <= a && (o = a * n), [a, o];
+}
+var P = 864e5;
+function Ne(e, t, n, i) {
+	if (e === void 0 || t === void 0) return [0, P];
+	let a = e, o = t;
+	if (a === o && (a -= P / 2, o += P / 2), [a, o] = N(a, o, i.margin, !1), i.nice === !1) return [a, o];
+	let s = i.targetTicks ?? Te, [c, l] = r(a, o, n).nice(s);
+	if (i.nice === "tight") {
+		let e = r(c, l, n).ticks(s), t = e.length > 1 ? (e[e.length - 1] - e[0]) / (e.length - 1) : l - c;
+		return De(a, o, c, l, t);
+	}
+	return [c, l];
+}
+//#endregion
+//#region src/math/legend.ts
+function Pe(e, t) {
+	let { rowHeight: n, swatchWidth: r, swatchGap: i, itemGap: a } = t, o = t.titleWidth !== void 0, s = o ? n : 0, c = [], l = (e) => r + i + Math.max(0, e), u = o ? Math.max(0, t.titleWidth ?? 0) : 0, d = 0;
+	if (t.direction === "column") e.forEach((e, t) => {
+		let a = -s - n * (t + .5);
+		c.push({
+			swatch: {
+				x: r / 2,
+				y: a
+			},
+			label: {
+				x: r + i,
+				y: a
+			}
+		}), u = Math.max(u, l(e));
+	}), d = e.length;
+	else {
+		let o = t.maxWidth ?? Infinity, f = 0, p = 0;
+		e.forEach((e, t) => {
+			let d = l(e);
+			t > 0 && f + d > o && (p += 1, f = 0);
+			let m = -s - n * (p + .5);
+			c.push({
+				swatch: {
+					x: f + r / 2,
+					y: m
+				},
+				label: {
+					x: f + r + i,
+					y: m
+				}
+			}), u = Math.max(u, f + d), f += d + a;
+		}), d = e.length === 0 ? 0 : p + 1;
+	}
+	return {
+		items: c,
+		title: o ? {
+			x: 0,
+			y: -n / 2
+		} : void 0,
+		width: u,
+		height: s + d * n
+	};
+}
+function Fe(e, t, n) {
+	let { rowHeight: r, gap: i, itemGap: a } = n, o = Math.max(0, n.pad ?? 0), s = n.titleWidth !== void 0, c = s ? r : 0, l = (t) => Math.max(0, e[t] ?? 0), u = (e) => Math.max(0, t[e] ?? 0), d = (e) => Math.max(r, 2 * l(e) + 2 * o), f = [], p = s ? Math.max(0, n.titleWidth ?? 0) : 0, m = c;
+	if (n.direction === "column") {
+		let t = 0;
+		for (let n = 0; n < e.length; n++) t = Math.max(t, l(n));
+		let n = -c;
+		for (let r = 0; r < e.length; r++) {
+			let e = d(r), a = n - e / 2;
+			f.push({
+				center: {
+					x: t,
+					y: a
+				},
+				label: {
+					x: 2 * t + i,
+					y: a
+				}
+			}), p = Math.max(p, 2 * t + i + u(r)), n -= e;
+		}
+		m = -n;
+	} else {
+		let t = 0;
+		for (let n = 0; n < e.length; n++) t = Math.max(t, d(n));
+		let r = n.maxWidth ?? Infinity, o = 0, s = 0;
+		for (let n = 0; n < e.length; n++) {
+			let e = 2 * l(n) + i + u(n);
+			n > 0 && o + e > r && (s += 1, o = 0);
+			let d = -c - t * (s + .5);
+			f.push({
+				center: {
+					x: o + l(n),
+					y: d
+				},
+				label: {
+					x: o + 2 * l(n) + i,
+					y: d
+				}
+			}), p = Math.max(p, o + e), o += e + a;
+		}
+		m = c + (e.length === 0 ? 0 : (s + 1) * t);
+	}
+	return {
+		items: f,
+		title: s ? {
+			x: 0,
+			y: -r / 2
+		} : void 0,
+		width: p,
+		height: m
+	};
+}
+//#endregion
+//#region src/math/symbol.ts
+var Ie = [
+	"circle",
+	"square",
+	"triangle",
+	"diamond",
+	"cross",
+	"star"
+], Le = .381966;
+function Re(e, t, n, r) {
+	let i = Math.PI * r * r, a = (e, r) => ({
+		x: t + e,
+		y: n + r
+	});
+	switch (e) {
+		case "square": {
+			let e = Math.sqrt(i) / 2;
+			return [
+				a(-e, -e),
+				a(e, -e),
+				a(e, e),
+				a(-e, e)
+			];
+		}
+		case "diamond": {
+			let e = Math.sqrt(i / 2);
+			return [
+				a(0, -e),
+				a(e, 0),
+				a(0, e),
+				a(-e, 0)
+			];
+		}
+		case "triangle": {
+			let e = Math.sqrt(4 * i / Math.sqrt(3)), t = e * Math.sqrt(3) / 2;
+			return [
+				a(-e / 2, -t / 3),
+				a(e / 2, -t / 3),
+				a(0, 2 * t / 3)
+			];
+		}
+		case "cross": {
+			let e = Math.sqrt(i / 5), t = e / 2, n = 3 * e / 2;
+			return [
+				a(-t, -n),
+				a(t, -n),
+				a(t, -t),
+				a(n, -t),
+				a(n, t),
+				a(t, t),
+				a(t, n),
+				a(-t, n),
+				a(-t, t),
+				a(-n, t),
+				a(-n, -t),
+				a(-t, -t)
+			];
+		}
+		case "star": {
+			let e = Math.sqrt(i / (5 * Le * Math.sin(Math.PI / 5))), t = e * Le;
+			return Array.from({ length: 10 }, (n, r) => {
+				let i = r % 2 == 0 ? e : t, o = Math.PI / 2 + r * Math.PI / 5;
+				return a(i * Math.cos(o), i * Math.sin(o));
+			});
+		}
+		default: return Array.from({ length: 32 }, (e, t) => {
+			let n = t * 2 * Math.PI / 32;
+			return a(r * Math.cos(n), r * Math.sin(n));
+		});
+	}
+}
+//#endregion
+//#region src/math/bubble.ts
+var ze = 0, Be = 1;
+function Ve(e, t = {}) {
+	let n = e.map(a), r = t.minRadius ?? ze, i = t.maxRadius ?? Be, o = t.maxValue ?? u(n, 0);
+	return o > 0 ? n.map((e) => r + (i - r) * Math.sqrt(e / o)) : n.map(() => r);
+}
+function He(e, t = 3) {
+	if (!(e > 0) || !Number.isFinite(e)) return [];
+	let n = Math.max(1, Math.floor(t)), r = Math.min(2, n);
+	for (let t = n; t <= n * 4; t++) {
+		let i = x([0, e], { count: t }).filter((e) => e > 0);
+		if (i.length >= r) return i.slice(-n);
+	}
+	return [e];
+}
+//#endregion
+//#region src/math/reveal.ts
+function F(e) {
+	let t = Infinity, n = -Infinity;
+	for (let r of e) for (let { x: e } of r) Number.isFinite(e) && (e < t && (t = e), e > n && (n = e));
+	return t <= n ? [t, n] : void 0;
+}
+function Ue(e, t, n) {
+	let r = (n - e.x) / (t.x - e.x);
+	return {
+		x: n,
+		y: e.y + (t.y - e.y) * r
+	};
+}
+function We(e, t) {
+	let n = [], r = [], i = () => {
+		r.length > 1 && n.push(r), r = [];
+	};
+	for (let n = 0; n < e.length; n++) {
+		let a = e[n], o = a.x <= t;
+		if (n === 0) {
+			o && r.push(a);
+			continue;
+		}
+		let s = e[n - 1], c = s.x <= t;
+		c && o ? r.push(a) : c ? (r.push(Ue(s, a, t)), i()) : o && r.push(Ue(s, a, t), a);
+	}
+	return i(), n;
+}
+function Ge(e, t) {
+	let n = e.length;
+	if (n < 3) return [];
+	let r = e[0], i = e[n - 1], a = r.x === i.x && r.y === i.y, o = a ? e.slice(0, -1) : e, s = [];
+	for (let e = 0; e < o.length; e++) {
+		let n = o[e], r = o[(e + o.length - 1) % o.length], i = n.x <= t;
+		i !== r.x <= t && s.push(Ue(r, n, t)), i && s.push(n);
+	}
+	return s.length < 3 ? [] : (a && s.push(s[0]), s);
+}
+function I(e, t) {
+	return t[0] + (t[1] - t[0]) * e;
+}
+function Ke(e, t) {
+	if (!(t > 0)) return [];
+	if (t >= 1) return e.map((e) => [...e]);
+	let n = F(e);
+	if (!n) return [];
+	let r = I(t, n);
+	return e.flatMap((e) => We(e, r));
+}
+function qe(e, t) {
+	if (!(t > 0)) return [];
+	if (t >= 1) return e.map((e) => [...e]);
+	let n = F(e);
+	if (!n) return [];
+	let r = I(t, n);
+	return e.map((e) => Ge(e, r)).filter((e) => e.length > 0);
+}
+function Je(e, t) {
+	if (t >= 1) return;
+	let n = F(e);
+	if (!n) return;
+	let r = Infinity, i = -Infinity;
+	for (let t of e) for (let { y: e } of t) Number.isFinite(e) && (e < r && (r = e), e > i && (i = e));
+	let a = Math.max(n[1] - n[0], i - r, 1), o = n[0] - a;
+	return {
+		minX: o,
+		maxX: t > 0 ? I(t, n) : o,
+		minY: r - a,
+		maxY: i + a
+	};
+}
+//#endregion
+//#region src/math/bar.ts
+var Ye = .6;
+function Xe(e, t, n, r = Ye) {
+	if (!Number.isFinite(t)) return null;
+	let i = e + .5, a = r / 2;
+	return {
+		x0: i - a,
+		x1: i + a,
+		y0: Math.min(n, t),
+		y1: Math.max(n, t)
+	};
+}
+//#endregion
+//#region src/math/barLabels.ts
+var Ze = .5;
+function Qe(e, t, n, r, i) {
+	let a = (e) => i ? e.maxY - e.minY : e.maxX - e.minX, o = (e) => i ? e.maxX - e.minX : e.maxY - e.minY, s = (i ? n.height : n.width) + 2 * r, c = (i ? n.width : n.height) + 2 * r;
+	if (!(s > 0) || !(c > 0)) return 0;
+	let l = a(e);
+	return !(o(e) >= c) || !(l >= s) ? 0 : l >= a(t) - 1e-9 ? 1 : Math.min(1, (l - s) / (Ze * s));
+}
+function $e(e, t, n) {
+	let r = /* @__PURE__ */ new Map(), i = (e, t) => `${t > 0 ? "+" : "-"}${typeof e}:${String(e)}`;
+	return t.forEach((t, a) => {
+		let o = n[a];
+		if (!Number.isFinite(t) || t === 0 || !Number.isFinite(o)) return;
+		let s = i(e[a], t), c = r.get(s);
+		c ? (c.total += t, (t > 0 ? o > n[c.outer] : o < n[c.outer]) && (c.outer = a)) : r.set(s, {
+			total: t,
+			outer: a
+		});
+	}), t.map((t, a) => {
+		if (!Number.isFinite(t) || t === 0 || !Number.isFinite(n[a])) return;
+		let o = r.get(i(e[a], t));
+		return o ? {
+			total: o.total,
+			outer: o.outer === a
+		} : void 0;
+	});
+}
+function et(e, t) {
+	let n = e.totals?.[t];
+	return {
+		share: e.normalized ? e.values[t] - (e.bases?.[t] ?? 0) : e.stacked ? e.own[t] : e.values[t],
+		total: n?.outer ? n.total : void 0
+	};
+}
+function tt(e, t, n) {
+	let r = e.total !== void 0 && t.total !== void 0 ? f(e.total, t.total, n) : n < .5 ? e.total : t.total;
+	return {
+		share: f(e.share, t.share, n),
+		total: r
+	};
+}
+function nt(e) {
+	let t = /^-?\d*(?:\.(\d+))?(?:e([+-]?\d+))?$/i.exec(y(e));
+	return t ? Math.max(0, (t[1]?.length ?? 0) - Number(t[2] ?? 0)) : 0;
+}
+//#endregion
+//#region src/math/aggregate.ts
+function L(e, t) {
+	if (typeof t == "function") return t([...e]);
+	if (t === "count") return e.length;
+	let n = c(e);
+	if (t === "sum") return k(n);
+	if (n.length === 0) return NaN;
+	switch (t) {
+		case "mean": return T(n) ?? NaN;
+		case "median": return E(n) ?? NaN;
+		case "min": return D(n) ?? NaN;
+		case "max": return w(n) ?? NaN;
+		case "first": return n[0];
+		case "last": return n[n.length - 1];
+		case "deviation": return S(n) ?? NaN;
+		case "variance": return A(n) ?? NaN;
+	}
+	return NaN;
+}
+function rt(e, t = {}) {
+	let n = Math.max(1, Math.floor(t.k ?? 3)), r = t.anchor ?? "middle", i = t.reduce ?? "mean", a = r === "start" ? 0 : r === "end" ? n - 1 : Math.floor((n - 1) / 2);
+	return e.map((r, o) => {
+		let s = o - a, l = s + n;
+		if (t.strict) {
+			if (s < 0 || l > e.length) return NaN;
+			let t = e.slice(s, l);
+			return t.every((e) => Number.isFinite(e)) ? L(t, i) : NaN;
+		}
+		let u = c(e.slice(Math.max(0, s), Math.min(e.length, l)));
+		return u.length === 0 ? NaN : L(u, i);
+	});
+}
+function it(e, t = "first") {
+	let n = c(e), r = (t) => e.map((e) => Number.isFinite(e) ? t(e) : NaN);
+	if (t === "extent") {
+		let e = D(n) ?? NaN, t = w(n) ?? NaN;
+		return r((n) => t > e ? (n - e) / (t - e) : NaN);
+	}
+	if (t === "deviation") {
+		let e = T(n) ?? NaN, t = S(n) ?? NaN;
+		return r((n) => t > 0 ? (n - e) / t : NaN);
+	}
+	let i = typeof t == "number" ? t : L(n, t);
+	return r((e) => Number.isFinite(i) && i !== 0 ? e / i : NaN);
+}
+//#endregion
+//#region src/math/dodge.ts
+function at(e, t, n = .1) {
+	let r = Math.max(1, Math.floor(t)), a = Number.isFinite(n) ? i(n) : 0;
+	return [(e + a / 2) / r, (e + 1 - a / 2) / r];
+}
+function ot(e, t, n = {}) {
+	let r = n.side ?? "both", i = Math.max(0, n.gap ?? 0), a = (e) => {
+		let n = typeof t == "number" ? t : t[e] ?? 0;
+		return Number.isFinite(n) ? Math.max(0, n) : 0;
+	}, o = e.map(() => NaN), s = e.map((e, t) => t).filter((t) => Number.isFinite(e[t])).sort((t, n) => e[t] - e[n] || t - n), c = 0;
+	for (let e of s) c = Math.max(c, a(e));
+	let l = [], u = 0, d = (e) => r === "both" || (r === "positive" ? e >= -1e-12 : e <= 1e-12);
+	for (let t of s) {
+		let n = e[t], r = a(t), s = r + c + i;
+		for (; u < l.length && n - e[l[u]] >= s;) u++;
+		let f = l.slice(u).filter((t) => {
+			let o = r + a(t) + i;
+			return Math.abs(n - e[t]) < o;
+		}), p = [0];
+		for (let t of f) {
+			let s = r + a(t) + i, c = n - e[t], l = Math.sqrt(Math.max(0, s * s - c * c));
+			p.push(o[t] + l, o[t] - l);
+		}
+		let m = (t) => f.every((s) => {
+			let c = r + a(s) + i, l = n - e[s], u = t - o[s];
+			return l * l + u * u >= c * c - 1e-9;
+		}), h = NaN;
+		for (let e of p) d(e) && m(e) && (Number.isNaN(h) || Math.abs(e) < Math.abs(h) - 1e-12 || Math.abs(Math.abs(e) - Math.abs(h)) <= 1e-12 && e > h) && (h = e);
+		o[t] = Number.isNaN(h) ? 0 : h, l.push(t);
+	}
+	return o;
+}
+//#endregion
+//#region src/math/shared/binning.ts
+function R(e, t, n, r, i) {
+	if (n !== void 0) return {
+		n: Math.max(1, Math.floor(n)),
+		max: t
+	};
+	if (r !== void 0 && Number.isFinite(r) && r > 0) {
+		let n = Math.max(1, Math.ceil((t - e) / r - 1e-9));
+		return {
+			n,
+			max: e + n * r
+		};
+	}
+	return {
+		n: Math.max(1, Math.floor(i)),
+		max: t
+	};
+}
+function z(e, t) {
+	return e === t ? [e - .5, t + .5] : [e, t];
+}
+function B(e, t, n, r) {
+	let i = n - t, a = Math.floor((e - t) / i * r), o = Math.min(r - 1, Math.max(0, a));
+	for (; o < r - 1 && e >= st(t, n, r, o + 1);) o++;
+	for (; o > 0 && e < st(t, n, r, o);) o--;
+	return o;
+}
+function st(e, t, n, r) {
+	return e + (t - e) * r / n;
+}
+function ct(e, t, n) {
+	let r = Array(n + 1);
+	for (let i = 0; i <= n; i++) r[i] = st(e, t, n, i);
+	return r;
+}
+//#endregion
+//#region src/math/histogram.ts
+var lt = 10;
+function ut(e, t = {}) {
+	let n = c(e), [r, i] = t.range ?? C(n), a = t.range?.[2];
+	(r === void 0 || i === void 0) && (r = 0, i = 1), [r, i] = z(r, i);
+	let o = R(r, i, t.binCount, a, 10), s = o.n;
+	i = o.max;
+	let l = ct(r, i, s), u = Array(s).fill(0);
+	for (let e of n) e < r || e > i || u[B(e, r, i, s)]++;
+	return {
+		edges: l,
+		counts: u
+	};
+}
+//#endregion
+//#region src/math/jitter.ts
+function dt(e, t = {}) {
+	let n = Number.isFinite(t.width) ? t.width ?? 1 : 1, r = t.seed ?? 0;
+	return e.map((e) => (l(e, r) - .5) * n);
+}
+//#endregion
+//#region src/math/regression.ts
+var ft = .95, pt = 50;
+function mt(e, t, n = {}) {
+	let r = Math.max(0, Math.floor(n.degree ?? 1)), i = xt(e, t), a = i.length, o = r + 1;
+	if (a <= o) return [];
+	let s = i.map(([e]) => e), c = d(s), l = u(s), f = (c + l) / 2, p = l > c ? (l - c) / 2 : 1, m = (e) => {
+		let t = (e - f) / p;
+		return Array.from({ length: o }, (e, n) => t ** n);
+	}, h = Array.from({ length: o }, () => Array(o).fill(0)), g = Array(o).fill(0);
+	for (let [e, t] of i) {
+		let n = m(e);
+		for (let e = 0; e < o; e++) {
+			g[e] += n[e] * t;
+			for (let t = 0; t < o; t++) h[e][t] += n[e] * n[t];
+		}
+	}
+	let _ = St(h);
+	if (!_) return [];
+	let v = _.map((e) => e.reduce((e, t, n) => e + t * g[n], 0)), y = (e) => e.reduce((e, t, n) => e + t * v[n], 0), b = n.level ?? ft, x = i.reduce((e, [t, n]) => e + (n - y(m(t))) ** 2, 0), S = Math.sqrt(x / (a - o)), C = b > 0 && b < 1 ? V((1 + b) / 2, a - o) : 0, [w, T] = n.domain ?? [c, l], E = Math.max(2, Math.floor(n.samples ?? pt));
+	return Array.from({ length: E }, (e, t) => {
+		let n = w + (T - w) * t / (E - 1), r = m(n), i = y(r), a = 0;
+		for (let e = 0; e < o; e++) for (let t = 0; t < o; t++) a += r[e] * _[e][t] * r[t];
+		let s = C * S * Math.sqrt(Math.max(0, a));
+		return {
+			x: n,
+			y: i,
+			low: i - s,
+			high: i + s
+		};
+	});
+}
+function ht(e, t, n = {}) {
+	return gt(e, t, {
+		...n,
+		level: 0
+	}).map(({ x: e, y: t }) => ({
+		x: e,
+		y: t
+	}));
+}
+function gt(e, t, n = {}) {
+	let r = xt(e, t).sort((e, t) => e[0] - t[0]), i = r.length;
+	if (i < 2) return [];
+	let a = Math.min(1, Math.max(0, n.bandwidth ?? .3)), o = Math.min(i, Math.max(2, Math.ceil(a * i))), s = Math.max(0, Math.floor(n.iterations ?? 0) || 0), c = r.map(([e]) => e), l = r.map(([, e]) => e), u = Array(i).fill(1);
+	for (let e = 0; e < s; e++) {
+		let e = c.map((e, t) => l[t] - _t(c, l, e, o, u).y), t = e.map(Math.abs), n = 6 * vt(t), r = t.reduce((e, t) => e + t, 0) / i;
+		if (!(n > 1e-7 * r) || !(r > 0)) break;
+		u = e.map((e) => {
+			let t = e / n;
+			return Math.abs(t) < 1 ? (1 - t * t) ** 2 : 0;
+		});
+	}
+	let d = n.level ?? ft, f = 0, p = 0;
+	if (d > 0 && d < 1 && i > 3) {
+		let e = 0, t = 0, n = 0;
+		c.forEach((r, i) => {
+			let a = _t(c, l, r, o, u), s = 0, d = 0;
+			a.indices.forEach((e, t) => {
+				let n = a.weights[t];
+				d += n * n, e === i && (s = n);
+			}), e += d - 2 * s + 1;
+			let f = l[i] - a.y;
+			Number.isFinite(f) && (t += u[i] * f * f, n += u[i]);
+		}), e > 1e-9 && n > 0 && (f = Math.sqrt(t / n * i / e), p = V((1 + d) / 2, Math.max(1, e)));
+	}
+	let m = c[0], h = c[i - 1], g = Math.max(2, Math.floor(n.samples ?? pt));
+	return Array.from({ length: g }, (e, t) => {
+		let n = m + (h - m) * t / (g - 1), r = _t(c, l, n, o, u);
+		if (!(p > 0 && f > 0) || !Number.isFinite(r.y)) return {
+			x: n,
+			y: r.y,
+			low: r.y,
+			high: r.y
+		};
+		let i = Math.sqrt(r.weights.reduce((e, t) => e + t * t, 0)), a = p * f * i;
+		return {
+			x: n,
+			y: r.y,
+			low: r.y - a,
+			high: r.y + a
+		};
+	});
+}
+function _t(e, t, n, r, i) {
+	let a = e.map((e, t) => ({
+		i: t,
+		d: Math.abs(e - n)
+	})).sort((e, t) => e.d - t.d || e.i - t.i).slice(0, r), o = a[a.length - 1].d * 1.000001 || 1, s = a.map((e) => e.i), c = a.map((e) => (1 - (e.d / o) ** 3) ** 3 * i[e.i]), l = c.reduce((e, t) => e + t, 0);
+	if (!(l > 0)) return {
+		y: NaN,
+		indices: s,
+		weights: c.map(() => 0)
+	};
+	let u = 0;
+	for (let t = 0; t < c.length; t++) u += c[t] * e[s[t]];
+	u /= l;
+	let d = 0;
+	for (let t = 0; t < c.length; t++) d += c[t] * (e[s[t]] - u) ** 2;
+	let f = d / l > 1e-12, p = c.map((t, r) => t / l + (f ? (n - u) * t * (e[s[r]] - u) / d : 0)), m = 0;
+	for (let e = 0; e < p.length; e++) m += p[e] * t[s[e]];
+	return {
+		y: m,
+		indices: s,
+		weights: p
+	};
+}
+function vt(e) {
+	let t = [...e].sort((e, t) => e - t), n = Math.floor(t.length / 2);
+	return t.length % 2 == 0 ? (t[n - 1] + t[n]) / 2 : t[n];
+}
+function yt(e, t = "ci", n = ft) {
+	let r = c(e), i = r.length;
+	if (i === 0) return {
+		mean: NaN,
+		low: NaN,
+		high: NaN,
+		n: 0
+	};
+	let a = T(r) ?? NaN;
+	if (i === 1) return {
+		mean: a,
+		low: a,
+		high: a,
+		n: i
+	};
+	let o = Math.sqrt(r.reduce((e, t) => e + (t - a) ** 2, 0) / (i - 1)), s = o / Math.sqrt(i), l = t === "sd" ? o : t === "se" ? s : s * V((1 + n) / 2, i - 1);
+	return {
+		mean: a,
+		low: a - l,
+		high: a + l,
+		n: i
+	};
+}
+function V(e, t) {
+	if (!(e > 0 && e < 1) || !(t >= 1)) return NaN;
+	if (t === 1) return Math.tan(Math.PI * (e - .5));
+	if (t === 2) return (2 * e - 1) / Math.sqrt(2 * e * (1 - e));
+	let n = bt(e), r = n * n, i = (r + 1) * n * .25, a = ((5 * r + 16) * r + 3) * n * (1 / 96), o = (((3 * r + 19) * r + 17) * r - 15) * n * (1 / 384), s = ((((79 * r + 776) * r + 1482) * r - 1920) * r - 945) * n;
+	return n + i / t + a / t ** 2 + o / t ** 3 + s / (92160 * t ** 4);
+}
+function bt(e) {
+	let t = [
+		-39.69683028665376,
+		220.9460984245205,
+		-275.9285104469687,
+		138.357751867269,
+		-30.66479806614716,
+		2.506628277459239
+	], n = [
+		-54.47609879822406,
+		161.5858368580409,
+		-155.6989798598866,
+		66.80131188771972,
+		-13.28068155288572
+	], r = [
+		-.007784894002430293,
+		-.3223964580411365,
+		-2.400758277161838,
+		-2.549732539343734,
+		4.374664141464968,
+		2.938163982698783
+	], i = [
+		.007784695709041462,
+		.3224671290700398,
+		2.445134137142996,
+		3.754408661907416
+	];
+	if (e < .02425) {
+		let t = Math.sqrt(-2 * Math.log(e));
+		return (((((r[0] * t + r[1]) * t + r[2]) * t + r[3]) * t + r[4]) * t + r[5]) / ((((i[0] * t + i[1]) * t + i[2]) * t + i[3]) * t + 1);
+	}
+	if (e > .97575) return -bt(1 - e);
+	let a = e - .5, o = a * a;
+	return (((((t[0] * o + t[1]) * o + t[2]) * o + t[3]) * o + t[4]) * o + t[5]) * a / (((((n[0] * o + n[1]) * o + n[2]) * o + n[3]) * o + n[4]) * o + 1);
+}
+function xt(e, t) {
+	let n = [], r = Math.min(e.length, t.length);
+	for (let i = 0; i < r; i++) Number.isFinite(e[i]) && Number.isFinite(t[i]) && n.push([e[i], t[i]]);
+	return n;
+}
+function St(e) {
+	let t = e.length, n = e.map((e, n) => [...e, ...Array.from({ length: t }, (e, t) => +(n === t))]);
+	for (let e = 0; e < t; e++) {
+		let r = e;
+		for (let i = e + 1; i < t; i++) Math.abs(n[i][e]) > Math.abs(n[r][e]) && (r = i);
+		if (Math.abs(n[r][e]) < 1e-12) return null;
+		[n[e], n[r]] = [n[r], n[e]];
+		let i = n[e][e];
+		for (let r = 0; r < 2 * t; r++) n[e][r] /= i;
+		for (let r = 0; r < t; r++) {
+			if (r === e) continue;
+			let i = n[r][e];
+			if (i !== 0) for (let a = 0; a < 2 * t; a++) n[r][a] -= i * n[e][a];
+		}
+	}
+	return n.map((e) => e.slice(t));
+}
+//#endregion
+//#region src/math/stack.ts
+function Ct(e, t, n = {}) {
+	let r = n.offset ?? "zero", i = n.diverging ?? !0, a = r === "zero" ? n.baseline ?? 0 : 0, o = wt(e, t, n.order ?? "appearance"), s = Array(t).fill(t);
+	o.forEach((e, t) => {
+		s[e] = t;
+	});
+	let c = (e) => s[e] ?? t, l = e.map((e) => {
+		let t = e.map((e, t) => t).sort((t, n) => c(e[t].series) - c(e[n].series) || t - n), n = Array(e.length), r = a, o = a;
+		for (let a of t) {
+			let t = e[a].value;
+			Number.isFinite(t) ? i && t < 0 ? (n[a] = [o, o + t], o += t) : (n[a] = [r, r + t], r += t) : n[a] = [NaN, NaN];
+		}
+		return n;
+	});
+	if (r === "normalize") for (let e of l) {
+		let [t, n] = H(e);
+		n > t && U(e, (e) => (e - t) / (n - t));
+	}
+	else if (r === "center") for (let e of l) {
+		let [t, n] = H(e);
+		if (!(n >= t)) continue;
+		let r = (t + n) / 2;
+		U(e, (e) => e - r);
+	}
+	else if (r === "wiggle") {
+		let n = Tt(e, t, s);
+		l.forEach((e, t) => {
+			U(e, (e) => e + n[t]);
+		});
+		let r = l.flatMap((e) => {
+			let [t, n] = H(e);
+			return n >= t ? [(t + n) / 2] : [];
+		}), i = r.length > 0 ? k(r) / r.length : 0;
+		for (let e of l) U(e, (e) => e - i);
+	}
+	return {
+		spans: l,
+		order: o
+	};
+}
+function wt(e, t, n) {
+	let r = Array.from({ length: t }, (e, t) => t);
+	if (Array.isArray(n)) {
+		let e = /* @__PURE__ */ new Set();
+		return [...n.filter((n) => Number.isInteger(n) && n >= 0 && n < t && !e.has(n) && e.add(n)), ...r.filter((t) => !e.has(t))];
+	}
+	if (n === "reverse") return r.reverse();
+	if (n === "appearance") return r;
+	let i = Array(t).fill(0), a = Array(t).fill(-Infinity), o = Array(t).fill(0);
+	if (e.forEach((e, n) => {
+		let r = /* @__PURE__ */ new Map();
+		for (let n of e) n.series < 0 || n.series >= t || r.set(n.series, (r.get(n.series) ?? 0) + s(n.value));
+		for (let [e, t] of r) i[e] += t, t > a[e] && (a[e] = t, o[e] = n);
+	}), n === "sum") return r.sort((e, t) => i[e] - i[t] || e - t);
+	let c = r.sort((e, t) => o[e] - o[t] || e - t), l = 0, u = 0, d = [], f = [];
+	for (let e of c) l < u ? (l += i[e], d.push(e)) : (u += i[e], f.push(e));
+	return [...f.reverse(), ...d];
+}
+function H(e) {
+	let t = Infinity, n = -Infinity;
+	for (let [r, i] of e) Number.isFinite(r) && Number.isFinite(i) && (t = Math.min(t, r, i), n = Math.max(n, r, i));
+	return [t, n];
+}
+function U(e, t) {
+	for (let n of e) n[0] = t(n[0]), n[1] = t(n[1]);
+}
+function Tt(e, t, n) {
+	let r = t, i = e.map((e) => {
+		let t = Array(r).fill(0);
+		for (let i of e) {
+			let e = n[i.series];
+			e !== void 0 && e < r && (t[e] += s(i.value));
+		}
+		return t;
+	}), a = Array(e.length).fill(0), o = 0;
+	for (let t = 1; t < e.length; t++) {
+		let e = 0, n = 0, s = 0;
+		for (let a = 0; a < r; a++) {
+			let r = i[t][a], o = r - i[t - 1][a], c = o / 2 + s;
+			s += o, e += r, n += c * r;
+		}
+		e && (o -= n / e), a[t] = o;
+	}
+	return a;
+}
+//#endregion
+//#region src/math/bullet.ts
+var Et = 5;
+function Dt(e, t = {}) {
+	let n = t.targetTicks ?? Et, r = ke(e, {
+		zero: !0,
+		nice: t.nice !== !1,
+		targetTicks: n
+	}), i = Number.isFinite(t.min) ? t.min : r[0], a = Number.isFinite(t.max) ? t.max : r[1];
+	if (!(a > i)) {
+		let e = Math.abs(r[1] - r[0]) || 1;
+		Number.isFinite(t.max) && !Number.isFinite(t.min) ? i = a - e : a = i + e;
+	}
+	let o = i === r[0] && a === r[1] && r[2] !== void 0 ? r[2] : b(a - i, n);
+	return [
+		i,
+		a,
+		o
+	];
+}
+function Ot(e, t = {}) {
+	let n = t.ranges ?? [], r = t.target, i = kt(t.domain) ? t.domain : Dt([
+		e,
+		r ?? NaN,
+		...n
+	], t), a = Math.min(i[0], i[1]), o = Math.max(i[0], i[1]), s = (e) => (e - a) / (o - a), c = (e) => _(e, a, o), l = [], u = a;
+	n.forEach((e, t) => {
+		let r = t === n.length - 1, i = Number.isNaN(e) ? u : r ? Math.max(u, o) : c(Math.max(u, e));
+		l.push({
+			index: t,
+			from: u,
+			to: i,
+			startFraction: s(u),
+			endFraction: s(i)
+		}), u = i;
+	});
+	let d = a <= 0 && o >= 0, f = d ? 0 : o < 0 ? o : a, p = Number.isFinite(e) ? {
+		from: f,
+		to: c(e),
+		startFraction: s(f),
+		endFraction: s(c(e))
+	} : null, m = r !== void 0 && Number.isFinite(r) ? {
+		value: c(r),
+		fraction: s(c(r))
+	} : null, h = i[2], g = h !== void 0 && h > 0 && Number.isFinite(h) ? h : b(o - a, Et);
+	return {
+		domain: [
+			a,
+			o,
+			g
+		],
+		ticks: x([a, o], { step: g }),
+		bands: l,
+		baseline: f,
+		zero: d,
+		measure: p,
+		target: m
+	};
+}
+function kt(e) {
+	return e !== void 0 && Number.isFinite(e[0]) && Number.isFinite(e[1]) && e[0] !== e[1];
+}
+//#endregion
+//#region src/math/keyframes.ts
+function W(e, t) {
+	let n = e.length;
+	if (n === 0 || !(t >= e[0]) || !(t <= e[n - 1])) return;
+	let r = 0, i = n - 1;
+	for (; i - r > 1;) {
+		let n = r + i >> 1;
+		e[n] <= t ? r = n : i = n;
+	}
+	return e[i] <= t ? {
+		lo: i,
+		hi: i,
+		u: 0
+	} : e[r] === t || i === r ? {
+		lo: r,
+		hi: r,
+		u: 0
+	} : {
+		lo: r,
+		hi: i,
+		u: (t - e[r]) / (e[i] - e[r])
+	};
+}
+function At(e, t, n, r = Infinity) {
+	let i = Math.min(e.length, t.length);
+	if (i === 0 || !(n >= t[0])) return [];
+	let a = Math.min(n, t[i - 1]), o = Math.max(t[0], a - Math.max(0, r)), s = (n) => {
+		let r = W(t.slice(0, i), n);
+		if (!r) return e[n < t[0] ? 0 : i - 1];
+		let a = e[r.lo], o = e[r.hi];
+		return {
+			x: a.x + (o.x - a.x) * r.u,
+			y: a.y + (o.y - a.y) * r.u
+		};
+	}, c = [s(o)];
+	for (let n = 0; n < i; n++) t[n] > o && t[n] < a && c.push(e[n]);
+	return a > o && c.push(s(a)), c;
+}
+function jt(e) {
+	return e < .5 ? 4 * e * e * e : 1 - (-2 * e + 2) ** 3 / 2;
+}
+function Mt(e, t, n, r = {}) {
+	let i = e.length, a = r.order === "ascending" ? -1 : 1, o = t.map((t, r) => e.map((e, t) => {
+		let i = n[r]?.[t];
+		return Number.isFinite(i) ? i : 0;
+	})), s = Infinity;
+	for (let e = 1; e < t.length; e++) s = Math.min(s, t[e] - t[e - 1]);
+	let c = Math.max(0, r.swap ?? (Number.isFinite(s) ? s / 4 : 0)), l = (n) => {
+		let r = W(t, n);
+		if (!r) {
+			let r = n < t[0] ? 0 : t.length - 1;
+			return o[r] ?? e.map(() => 0);
+		}
+		let i = o[r.lo], a = o[r.hi];
+		return i.map((e, t) => e + (a[t] - e) * r.u);
+	}, u = (e) => {
+		let t = e.map((e, t) => t).sort((t, n) => a * (e[n] - e[t]) || t - n), n = [];
+		return t.forEach((e, t) => {
+			n[e] = t;
+		}), n;
+	}, d = [];
+	for (let e = 0; e < t.length; e++) {
+		if (d.push(t[e]), e + 1 >= t.length) continue;
+		let n = t[e], r = t[e + 1], a = o[e], s = o[e + 1];
+		for (let e = 0; e < i; e++) for (let t = e + 1; t < i; t++) {
+			let i = a[e] - a[t], o = s[e] - s[t];
+			if (i === o || Math.sign(i) === Math.sign(o)) continue;
+			let c = i / (i - o);
+			c > 0 && c < 1 && d.push(n + (r - n) * c);
+		}
+	}
+	d.sort((e, t) => e - t);
+	let f = [], p = u(l(t[0] ?? 0));
+	if (d.length > 1) {
+		let e = (e) => (d[e] + d[e + 1]) / 2;
+		p = u(l(e(0)));
+		let t = p;
+		for (let n = 1; n + 1 < d.length; n++) {
+			if (!(d[n + 1] > d[n])) continue;
+			let r = u(l(e(n)));
+			for (let e = 0; e < i; e++) r[e] !== t[e] && f.push({
+				time: d[n],
+				key: e,
+				delta: r[e] - t[e]
+			});
+			t = r;
+		}
+	}
+	let m = r.top !== void 0 && Number.isFinite(r.top) ? Math.max(0, Math.floor(r.top)) : void 0, h = (e) => m === void 0 ? 1 : Math.max(0, Math.min(1, m - e)), g = (t) => {
+		let n = l(t), r = u(n), i = [...p];
+		for (let e of f) {
+			if (e.time > t) break;
+			let n = c > 0 ? Math.min(1, (t - e.time) / c) : 1;
+			i[e.key] += e.delta * jt(n);
+		}
+		return e.map((e, t) => ({
+			key: e,
+			value: n[t],
+			rank: r[t],
+			position: i[t],
+			presence: h(i[t])
+		}));
+	};
+	return {
+		keys: e,
+		times: t,
+		top: m,
+		at: g,
+		view(t) {
+			let n = g(t), r = /* @__PURE__ */ new Map();
+			for (let e of n) r.set(e.key, e.position);
+			let i = new Set(n.map((e, t) => ({
+				entry: e,
+				e: t
+			})).sort((e, t) => e.entry.position - t.entry.position || e.e - t.e).slice(0, m ?? n.length).map(({ entry: e }) => e.key));
+			return {
+				entries: n.filter((e) => e.presence > 0),
+				categories: e.filter((e) => i.has(e)),
+				slot: (e) => r.get(e)
+			};
+		}
+	};
+}
+//#endregion
+//#region src/math/waterfall.ts
+function Nt(e, t = []) {
+	let n = 0;
+	return e.map((e, r) => {
+		if (t[r]) return {
+			base: 0,
+			end: n,
+			delta: n,
+			kind: "total"
+		};
+		let i = Number.isFinite(e) ? e : 0, a = n;
+		return n += i, {
+			base: a,
+			end: n,
+			delta: i,
+			kind: i < 0 ? "down" : "up"
+		};
+	});
+}
+//#endregion
+//#region src/math/morph.ts
+function Pt(e) {
+	for (let t = 1; t < e.length; t++) if (!(e[t].x >= e[t - 1].x)) return !1;
+	return !0;
+}
+function G(e, t) {
+	let n = e.length;
+	if (t <= e[0].x) return e[0].y;
+	if (t >= e[n - 1].x) return e[n - 1].y;
+	let r = 0, i = n - 1;
+	for (; i - r > 1;) {
+		let n = r + i >> 1;
+		e[n].x <= t ? r = n : i = n;
+	}
+	let a = e[r], o = e[i], s = o.x - a.x;
+	return s > 0 ? a.y + (o.y - a.y) * (t - a.x) / s : o.y;
+}
+function Ft(e, t, n) {
+	let r = [0], i = 0;
+	for (let a = 1; a < e.length; a++) i += Math.hypot((e[a].x - e[a - 1].x) / t, (e[a].y - e[a - 1].y) / n), r.push(i);
+	return i > 0 ? r.map((e) => e / i) : r.map((t, n) => e.length > 1 ? n / (e.length - 1) : 0);
+}
+function It(e, t, n) {
+	let r = 1;
+	for (; r < t.length - 1 && t[r] < n;) r++;
+	let i = e[r - 1] ?? e[0], a = e[r] ?? i, o = (t[r] ?? 1) - (t[r - 1] ?? 0), s = o > 0 ? (n - (t[r - 1] ?? 0)) / o : 0;
+	return {
+		x: i.x + (a.x - i.x) * s,
+		y: i.y + (a.y - i.y) * s
+	};
+}
+function K(e, t, n) {
+	let r = n > 0 ? n < 1 ? n : 1 : 0;
+	if (r === 0 || t.length === 0) return [...e];
+	if (r === 1 || e.length === 0) return [...t];
+	if (Pt(e) && Pt(t)) {
+		let n = e[0].x + (t[0].x - e[0].x) * r, i = e[e.length - 1].x + (t[t.length - 1].x - e[e.length - 1].x) * r, a = /* @__PURE__ */ new Set([n, i]);
+		for (let t of e) t.x > n && t.x < i && a.add(t.x);
+		for (let e of t) e.x > n && e.x < i && a.add(e.x);
+		return [...a].sort((e, t) => e - t).map((n) => ({
+			x: n,
+			y: G(e, n) + (G(t, n) - G(e, n)) * r
+		}));
+	}
+	let i = [...e, ...t], a = (e) => {
+		let t = Infinity, n = -Infinity;
+		for (let r of i) t = Math.min(t, e(r)), n = Math.max(n, e(r));
+		return n - t || 1;
+	}, o = a((e) => e.x), s = a((e) => e.y), c = Ft(e, o, s), l = Ft(t, o, s), u = Math.max(e.length, t.length, 2), d = [];
+	for (let n = 0; n < u; n++) {
+		let i = n / (u - 1), a = It(e, c, i), o = It(t, l, i);
+		d.push({
+			x: a.x + (o.x - a.x) * r,
+			y: a.y + (o.y - a.y) * r
+		});
+	}
+	return d;
+}
+function Lt(e, t, n) {
+	let r = n > 0 ? n < 1 ? n : 1 : 0;
+	if (r === 0) return e.map((e) => [...e]);
+	if (r === 1) return t.map((e) => [...e]);
+	if (e.length === t.length) return e.map((e, n) => K(e, t[n], r));
+	let i = K(e.flat(), t.flat(), r);
+	return i.length > 0 ? [i] : [];
+}
+function Rt(e) {
+	for (let t = 1; t < e.length; t++) if (!(e[t].x >= e[t - 1].x)) return !1;
+	return !0;
+}
+function zt(e, t) {
+	let n = e.length;
+	if (t <= e[0].x) return [e[0].y1, e[0].y2];
+	if (t >= e[n - 1].x) return [e[n - 1].y1, e[n - 1].y2];
+	let r = 0, i = n - 1;
+	for (; i - r > 1;) {
+		let n = r + i >> 1;
+		e[n].x <= t ? r = n : i = n;
+	}
+	let a = e[r], o = e[i], s = o.x - a.x;
+	if (!(s > 0)) return [o.y1, o.y2];
+	let c = (t - a.x) / s;
+	return [a.y1 + (o.y1 - a.y1) * c, a.y2 + (o.y2 - a.y2) * c];
+}
+function Bt(e, t) {
+	let n = t * (e.length - 1), r = Math.min(Math.floor(n), e.length - 1), i = e[r], a = e[Math.min(r + 1, e.length - 1)], o = n - r;
+	return {
+		x: i.x + (a.x - i.x) * o,
+		y1: i.y1 + (a.y1 - i.y1) * o,
+		y2: i.y2 + (a.y2 - i.y2) * o
+	};
+}
+function Vt(e, t, n) {
+	let r = n > 0 ? n < 1 ? n : 1 : 0;
+	if (r === 0 || t.length === 0) return e.map((e) => ({ ...e }));
+	if (r === 1 || e.length === 0) return t.map((e) => ({ ...e }));
+	if (Rt(e) && Rt(t)) {
+		let n = e[0].x + (t[0].x - e[0].x) * r, i = e[e.length - 1].x + (t[t.length - 1].x - e[e.length - 1].x) * r, a = /* @__PURE__ */ new Set([n, i]);
+		for (let t of e) t.x > n && t.x < i && a.add(t.x);
+		for (let e of t) e.x > n && e.x < i && a.add(e.x);
+		return [...a].sort((e, t) => e - t).map((n) => {
+			let [i, a] = zt(e, n), [o, s] = zt(t, n);
+			return {
+				x: n,
+				y1: i + (o - i) * r,
+				y2: a + (s - a) * r
+			};
+		});
+	}
+	let i = Math.max(e.length, t.length, 2), a = [];
+	for (let n = 0; n < i; n++) {
+		let o = n / (i - 1), s = Bt(e, o), c = Bt(t, o);
+		a.push({
+			x: s.x + (c.x - s.x) * r,
+			y1: s.y1 + (c.y1 - s.y1) * r,
+			y2: s.y2 + (c.y2 - s.y2) * r
+		});
+	}
+	return a;
+}
+function Ht(e, t, n) {
+	let r = n > 0 ? n < 1 ? n : 1 : 0;
+	if (r === 0) return e.map((e) => e.map((e) => ({ ...e })));
+	if (r === 1) return t.map((e) => e.map((e) => ({ ...e })));
+	if (e.length === t.length) return e.map((e, n) => Vt(e, t[n], r));
+	let i = Vt(e.flat(), t.flat(), r);
+	return i.length > 0 ? [i] : [];
+}
+function Ut(e) {
+	for (let t = 1; t < e.length; t++) if (!(e[t] >= e[t - 1])) return !1;
+	return !0;
+}
+function Wt(e, t) {
+	let { edges: n, values: r } = e, i = r.length;
+	if (!(t >= n[0])) return r[0];
+	if (t >= n[i]) return r[i - 1];
+	let a = 0, o = i;
+	for (; o - a > 1;) {
+		let e = a + o >> 1;
+		n[e] <= t ? a = e : o = e;
+	}
+	return r[a];
+}
+function Gt(e, t, n) {
+	let r = n > 0 ? n < 1 ? n : 1 : 0, i = (e) => ({
+		edges: [...e.edges],
+		values: [...e.values]
+	}), a = (e) => e.values.length === 0 || e.edges.length !== e.values.length + 1;
+	if (r === 0 || a(t)) return i(e);
+	if (r === 1 || a(e)) return i(t);
+	if (!Ut(e.edges) || !Ut(t.edges)) return i(r < .5 ? e : t);
+	let o = e.edges, s = t.edges, c = o[0] + (s[0] - o[0]) * r, l = o[o.length - 1] + (s[s.length - 1] - o[o.length - 1]) * r, u = /* @__PURE__ */ new Set([c, l]);
+	for (let e of o) e > c && e < l && u.add(e);
+	for (let e of s) e > c && e < l && u.add(e);
+	let d = [...u].sort((e, t) => e - t), f = [];
+	for (let n = 0; n + 1 < d.length; n++) {
+		let i = (d[n] + d[n + 1]) / 2, a = Wt(e, i);
+		f.push(a + (Wt(t, i) - a) * r);
+	}
+	return {
+		edges: d,
+		values: f
+	};
+}
+//#endregion
+//#region src/math/violin.ts
+var Kt = 1e-6, qt = 80, Jt = .4, Yt = Math.sqrt(2 * Math.PI);
+function Xt(e) {
+	return Math.exp(-(e * e) / 2) / Yt;
+}
+function Zt(e) {
+	let t = e.length, n = e.reduce((e, t) => e + t, 0) / t, r = e.reduce((e, t) => e + (t - n) ** 2, 0) / t;
+	return Math.sqrt(r);
+}
+function Qt(e) {
+	let t = Zt(e);
+	return t === 0 ? Kt : 1.06 * t * e.length ** (-1 / 5);
+}
+function $t(e, t = {}) {
+	let n = c(e);
+	if (n.length === 0) return [];
+	let r = t.bandwidth ?? Qt(n), i = t.samples ?? 80, [a, o] = t.domain ?? (() => {
+		let e = d(n), t = u(n), i = 3 * r;
+		return [e - i, t + i];
+	})(), s = n.length, l = an(n, r), f = [], p = i > 1 ? (o - a) / (i - 1) : 0;
+	for (let e = 0; e < i; e++) {
+		let t = i > 1 ? a + e * p : a, o = 0;
+		if (l) {
+			let { centers: e, weights: n } = l;
+			for (let i = 0; i < e.length; i++) n[i] > 0 && (o += n[i] * Xt((t - e[i]) / r));
+		} else for (let e of n) o += Xt((t - e) / r);
+		f.push({
+			x: t,
+			density: o / (s * r)
+		});
+	}
+	return f;
+}
+var en = 2e3, tn = 8, nn = 1024, rn = 8192;
+function an(e, t) {
+	if (e.length <= en || !(t > 0) || !Number.isFinite(t)) return;
+	let n = d(e), r = u(e) - n, i = Math.max(nn, Math.ceil(r / t * tn) + 1);
+	if (i > Math.min(rn, e.length / 2)) return;
+	let a = new Float64Array(r > 0 ? i : 1), o = new Float64Array(a.length);
+	if (r === 0) return a[0] = n, o[0] = e.length, {
+		centers: a,
+		weights: o
+	};
+	let s = r / (i - 1);
+	for (let e = 0; e < i; e++) a[e] = n + e * s;
+	for (let t of e) {
+		let e = (t - n) / s, r = Math.min(i - 2, Math.floor(e)), a = e - r;
+		o[r] += 1 - a, o[r + 1] += a;
+	}
+	return {
+		centers: a,
+		weights: o
+	};
+}
+function on(e, t, n = {}) {
+	let r = c(e);
+	if (r.length < 2) return [];
+	let i = $t(r, n);
+	if (i.length === 0) return [];
+	let a = u(i.map((e) => e.density));
+	if (!Number.isFinite(a) || a === 0) return [];
+	let o = n.scale ?? .4, s = i.map((e) => ({
+		x: t + e.density / a * o,
+		y: e.x
+	})), l = [...i].reverse().map((e) => ({
+		x: t - e.density / a * o,
+		y: e.x
+	}));
+	return [...s, ...l];
+}
+function sn(e, t = {}) {
+	let n = c(e);
+	if (n.length < 2) return null;
+	let r = $t(n, t);
+	if (r.length === 0) return null;
+	let i = u(r.map((e) => e.density));
+	return !Number.isFinite(i) || i === 0 ? null : {
+		ys: r.map((e) => e.x),
+		widths: r.map((e) => e.density / i)
+	};
+}
+function cn(e, t, n) {
+	let { ys: r, widths: i } = e, a = r.map((e, r) => ({
+		x: t + i[r] * n,
+		y: e
+	})), o = [];
+	for (let e = r.length - 1; e >= 0; e--) o.push({
+		x: t - i[e] * n,
+		y: r[e]
+	});
+	return [...a, ...o];
+}
+function ln(e, t) {
+	if (!e) return 0;
+	let { ys: n, widths: r } = e, i = n.length;
+	if (i === 0 || t < n[0] || t > n[i - 1]) return 0;
+	let a = 1;
+	for (; a < i - 1 && n[a] < t;) a++;
+	let o = a - 1;
+	if (i === 1 || n[a] === n[o]) return r[o];
+	if (t >= n[a]) return r[a];
+	let s = (t - n[o]) / (n[a] - n[o]);
+	return r[o] + (r[a] - r[o]) * s;
+}
+function un(e, t, n) {
+	if (n <= 0 && e) return e;
+	if (n >= 1 && t) return t;
+	if (!e && !t) return null;
+	let r = [.../* @__PURE__ */ new Set([...e?.ys ?? [], ...t?.ys ?? []])].sort((e, t) => e - t), i = n <= 0 ? 0 : n >= 1 ? 1 : n;
+	return {
+		ys: r,
+		widths: r.map((n) => {
+			let r = ln(e, n);
+			return r + (ln(t, n) - r) * i;
+		})
+	};
+}
+//#endregion
+//#region src/math/ecdf.ts
+var dn = .05, fn = .5;
+function pn(e, t = {}) {
+	let n = c(e), r = n.length;
+	if (r === 0) return {
+		edges: [],
+		values: []
+	};
+	let i = [...n].sort((e, t) => e - t), a = [];
+	for (let e of i) (a.length === 0 || a[a.length - 1] !== e) && a.push(e);
+	let o = a.length, s = a[o - 1] - a[0], l = t.pad ?? (s > 0 ? s * .05 : .5), u = [
+		a[0] - l,
+		...a,
+		a[o - 1] + l
+	], d = Array(o + 1);
+	d[0] = 0;
+	let f = 0;
+	for (let e = 0; e < o; e++) {
+		let t = a[e], n = f;
+		for (; n < r && i[n] <= t;) n++;
+		d[e + 1] = n / r, f = n;
+	}
+	return {
+		edges: u,
+		values: d
+	};
+}
+//#endregion
+//#region src/math/stairs.ts
+function mn(e, t) {
+	let n = e.length, r = t ?? Array.from({ length: n + 1 }, (e, t) => t);
+	if (r.length !== n + 1) throw Error(`stairsPolyline: edges must have one more entry than values (got ${r.length} edges for ${n} values)`);
+	let i = [];
+	for (let t = 0; t < n; t++) i.push({
+		x: r[t],
+		y: e[t]
+	}), i.push({
+		x: r[t + 1],
+		y: e[t]
+	});
+	return i;
+}
+//#endregion
+//#region src/math/fillBetween.ts
+function hn(e) {
+	return e.length === 0 ? e : [...e, { ...e[0] }];
+}
+function gn(t, n, r) {
+	let i = Math.min(e(t, n), r.length), a = [], o = [], s = [], c = () => {
+		o.length > 1 && a.push(hn([...o, ...s.reverse()])), o = [], s = [];
+	};
+	for (let e = 0; e < i; e++) {
+		let i = t[e], a = n[e], l = r[e];
+		Number.isFinite(i) && Number.isFinite(a) && Number.isFinite(l) ? (o.push({
+			x: i,
+			y: a
+		}), s.push({
+			x: i,
+			y: l
+		})) : c();
+	}
+	return c(), a;
+}
+function _n(e, t) {
+	let n = (e.length - 1) / 2;
+	if (!Number.isInteger(n) || n < 1) return v(e, "linear");
+	let r = e.slice(0, n), i = e.slice(n, 2 * n).reverse();
+	return g(r, i, t);
+}
+//#endregion
+//#region src/math/line.ts
+function vn(t, n) {
+	let r = e(t, n), i = [], a = [], o = () => {
+		a.length > 1 && i.push(a), a = [];
+	};
+	for (let e = 0; e < r; e++) {
+		let r = t[e], i = n[e];
+		Number.isFinite(r) && Number.isFinite(i) ? a.push({
+			x: r,
+			y: i
+		}) : o();
+	}
+	return o(), i;
+}
+function yn(e) {
+	for (let t = 1; t < e.length; t++) if (e[t].x < e[t - 1].x) return !1;
+	return !0;
+}
+function bn(e, t, n) {
+	let r = 0, i = e.length;
+	for (; r < i;) {
+		let a = r + i >>> 1;
+		(n ? e[a].x <= t : e[a].x < t) ? r = a + 1 : i = a;
+	}
+	return r;
+}
+var xn = 4;
+function Sn(e, t, n = !1) {
+	let r = t.length - 1;
+	if (r < 1) return e;
+	let i = bn(e, t[0], !1), a = bn(e, t[r], !0);
+	if (a - i <= 4 * r) return e;
+	let o = [];
+	if (n) i > 0 && o.push(e[i - 1]);
+	else for (let t = 0; t < i; t++) o.push(e[t]);
+	let s = 0, c = i, l = i, u = i, d = (t) => {
+		let n = [
+			c,
+			l,
+			u,
+			t - 1
+		].sort((e, t) => e - t);
+		for (let t = 0; t < n.length; t++) (t === 0 || n[t] !== n[t - 1]) && o.push(e[n[t]]);
+	};
+	for (let n = i; n < a; n++) {
+		let { x: i, y: a } = e[n];
+		if (s < r - 1 && i >= t[s + 1]) {
+			for (d(n); s < r - 1 && i >= t[s + 1];) s++;
+			c = l = u = n;
+		} else a < e[l].y && (l = n), a > e[u].y && (u = n);
+	}
+	if (d(a), n) a < e.length && o.push(e[a]);
+	else for (let t = a; t < e.length; t++) o.push(e[t]);
+	return o;
+}
+function Cn(e, t) {
+	if (e === t) return !0;
+	if (e.length !== t.length) return !1;
+	for (let n = 0; n < e.length; n++) {
+		let r = e[n], i = t[n];
+		if (r !== i) {
+			if (r.length !== i.length) return !1;
+			for (let e = 0; e < r.length; e++) if (!Object.is(r[e].x, i[e].x) || !Object.is(r[e].y, i[e].y)) return !1;
+		}
+	}
+	return !0;
+}
+//#endregion
+//#region src/math/stackplot.ts
+function wn(e, t, n = {}) {
+	let { spans: r } = Ct(e.map((e, n) => t.map((e, t) => ({
+		series: t,
+		value: s(e[n])
+	}))), t.length, {
+		offset: n.offset,
+		order: n.order,
+		baseline: n.baseline,
+		diverging: !1
+	});
+	return t.map((t, n) => {
+		let i = r.map((e) => e[n][0]), a = r.map((e) => e[n][1]);
+		return {
+			bottom: i,
+			top: a,
+			rings: gn(e, a, i)
+		};
+	});
+}
+//#endregion
+//#region src/math/barbs.ts
+var Tn = 50, En = 10, Dn = 5, On = Math.PI / 4;
+function kn(e) {
+	let t = Math.round(e / Dn) * Dn, n = Math.floor(t / Tn);
+	t -= n * Tn;
+	let r = Math.floor(t / En);
+	return t -= r * En, {
+		pennants: n,
+		fullBarbs: r,
+		halfBarbs: +(t >= Dn)
+	};
+}
+function An(e, t = {}) {
+	let n = t.shaftLength ?? 1, r = t.barbSpacing ?? n / 6, i = t.barbLength ?? n / 2, { pennants: a, fullBarbs: o, halfBarbs: s } = kn(Number.isFinite(e) && e > 0 ? e : 0), c = [[{
+		x: 0,
+		y: 0
+	}, {
+		x: n,
+		y: 0
+	}]], l = Math.cos(On) * i, u = -Math.sin(On) * i, d = n;
+	for (let e = 0; e < a; e++) {
+		let e = d - r;
+		c.push([
+			{
+				x: d,
+				y: 0
+			},
+			{
+				x: e,
+				y: 0
+			},
+			{
+				x: e + l,
+				y: u
+			},
+			{
+				x: d,
+				y: 0
+			}
+		]), d = e;
+	}
+	for (let e = 0; e < o; e++) c.push([{
+		x: d,
+		y: 0
+	}, {
+		x: d + l,
+		y: u
+	}]), d -= r;
+	return s > 0 && c.push([{
+		x: d,
+		y: 0
+	}, {
+		x: d + l / 2,
+		y: u / 2
+	}]), {
+		pennants: a,
+		fullBarbs: o,
+		halfBarbs: s,
+		segments: c
+	};
+}
+//#endregion
+//#region src/math/shared/gridExtent.ts
+function jn(e) {
+	let t = Infinity, n = -Infinity;
+	for (let r of e) for (let e of r) Number.isFinite(e) && (e < t && (t = e), e > n && (n = e));
+	return t <= n ? [t, n] : null;
+}
+function q(e, t, n) {
+	if (Array.isArray(e)) return e.slice();
+	let r = jn(t);
+	return !r || r[0] === r[1] ? [] : n(r[0], r[1], e);
+}
+//#endregion
+//#region src/math/contour.ts
+function Mn(e, t, n) {
+	let r = Math.max(0, Math.floor(n)), i = [];
+	for (let n = 1; n <= r; n++) i.push(e + (t - e) * n / (r + 1));
+	return i;
+}
+function Nn(e, t) {
+	return q(e, t, Mn);
+}
+function J(e, t, n, r, i) {
+	let a = (i - n) / (r - n);
+	return e + (t - e) * a;
+}
+function Pn(e) {
+	let t = (t, n) => {
+		let { keys: r, points: i } = e[t];
+		return r[1] === n ? i[1] : i[0];
+	};
+	return m(e.map((e) => e.keys), "in-order").map(({ keys: n, segments: r, closed: i }) => {
+		let a = i ? [...n, n[0]] : n, o = 0;
+		for (let e = 1; e < r.length; e++) r[e] < r[o] && (o = e);
+		return a.map((n, i) => i === o || i === o + 1 ? e[r[o]].points[i - o] : t(r[i < o ? i : i - 1], n));
+	});
+}
+function Fn(e, t, n, r) {
+	let i = n.length, a = i > 0 ? n[0].length : 0;
+	if (i < 2 || a < 2 || e.length < a || t.length < i) return [];
+	let o = Nn(r, n), s = [];
+	for (let r of o) {
+		let o = [];
+		for (let s = 0; s < i - 1; s++) for (let i = 0; i < a - 1; i++) {
+			let c = n[s][i], l = n[s][i + 1], u = n[s + 1][i + 1], d = n[s + 1][i];
+			if (!Number.isFinite(c) || !Number.isFinite(l) || !Number.isFinite(u) || !Number.isFinite(d)) continue;
+			let f = e[i], p = e[i + 1], m = t[s], h = t[s + 1], g = c >= r, _ = l >= r, v = u >= r, y = d >= r;
+			if (g === _ && _ === v && v === y) continue;
+			let b = s * a + i, x = b + 1, S = b + a, C = S + 1, w = (e, t, n, i, a, o) => ({
+				point: e,
+				key: n === r ? -1 - i : a === r ? -1 - o : t
+			}), T = g === _ ? null : w({
+				x: J(f, p, c, l, r),
+				y: m
+			}, 2 * b, c, b, l, x), E = _ === v ? null : w({
+				x: p,
+				y: J(m, h, l, u, r)
+			}, 2 * x + 1, l, x, u, C), D = v === y ? null : w({
+				x: J(f, p, d, u, r),
+				y: h
+			}, 2 * S, d, S, u, C), O = y === g ? null : w({
+				x: f,
+				y: J(m, h, c, d, r)
+			}, 2 * b + 1, c, b, d, S), k = (e, t) => o.push({
+				keys: [e.key, t.key],
+				points: [e.point, t.point]
+			}), A = [
+				T,
+				E,
+				D,
+				O
+			].filter((e) => e !== null);
+			A.length === 2 ? k(A[0], A[1]) : A.length === 4 && ((c + l + u + d) / 4 >= r === g ? (k(T, E), k(D, O)) : (k(O, T), k(E, D)));
+		}
+		for (let e of Pn(o)) s.push({
+			level: r,
+			points: e
+		});
+	}
+	return s;
+}
+//#endregion
+//#region src/math/contourf.ts
+function In(e, t, n) {
+	let r = Math.max(0, Math.floor(n));
+	if (r < 2) return [];
+	let i = [];
+	for (let n = 0; n < r; n++) i.push(e + (t - e) * n / (r - 1));
+	return i;
+}
+function Ln(e, t) {
+	return q(e, t, In);
+}
+function Y(e, t, n) {
+	if (e.length === 0) return [];
+	let r = (e) => n ? e.z >= t : e.z <= t, i = (e, n) => {
+		let r = (t - e.z) / (n.z - e.z);
+		return {
+			x: e.x + (n.x - e.x) * r,
+			y: e.y + (n.y - e.y) * r,
+			z: t
+		};
+	}, a = [];
+	for (let t = 0; t < e.length; t++) {
+		let n = e[t], o = e[(t - 1 + e.length) % e.length], s = r(n), c = r(o);
+		s ? (c || a.push(i(o, n)), a.push(n)) : c && a.push(i(o, n));
+	}
+	return a;
+}
+function Rn(e, t, n, r) {
+	let i = n.length, a = i > 0 ? n[0].length : 0;
+	if (i < 2 || a < 2 || e.length < a || t.length < i) return [];
+	let o = Ln(r, n);
+	if (o.length < 2) return [];
+	let s = o.slice(1).map((e, t) => ({
+		loLevel: o[t],
+		hiLevel: e,
+		polygons: []
+	}));
+	for (let r = 0; r < i - 1; r++) for (let i = 0; i < a - 1; i++) {
+		let a = n[r][i], o = n[r][i + 1], c = n[r + 1][i + 1], l = n[r + 1][i];
+		if (!Number.isFinite(a) || !Number.isFinite(o) || !Number.isFinite(c) || !Number.isFinite(l)) continue;
+		let u = e[i], d = e[i + 1], f = t[r], p = t[r + 1], m = [
+			{
+				x: u,
+				y: f,
+				z: a
+			},
+			{
+				x: d,
+				y: f,
+				z: o
+			},
+			{
+				x: d,
+				y: p,
+				z: c
+			},
+			{
+				x: u,
+				y: p,
+				z: l
+			}
+		];
+		for (let e of s) {
+			let t = Y(Y(m, e.loLevel, !0), e.hiLevel, !1);
+			t.length >= 3 && e.polygons.push(t.map((e) => ({
+				x: e.x,
+				y: e.y
+			})));
+		}
+	}
+	return s;
+}
+//#endregion
+//#region src/math/tree.ts
+var zn = (e) => {
+	if (typeof e != "object" || !e) return;
+	let t = e.children;
+	return Array.isArray(t) ? t : void 0;
+};
+function Bn(e, t) {
+	let n = t.children ?? zn, r = t.value, i = t.label, a = t.distance, o = /* @__PURE__ */ new Set(), s = 0, c = (e, t, l) => {
+		if (typeof e == "object" && e) {
+			if (o.has(e)) throw Error("Hierarchy data contains a cycle: a node is its own ancestor.");
+			o.add(e);
+		}
+		let u = s++, d = n(e, u), f = Array.isArray(d) ? d : [], p = {
+			datum: e,
+			index: u,
+			label: i ? String(i(e, u) ?? "") : "",
+			value: 0,
+			branch: t,
+			distance: a ? Number(a(e, u)) : NaN,
+			children: f.map((e, n) => c(e, l === 0 ? n : t, l + 1))
+		};
+		if (p.children.length === 0) {
+			if (r) {
+				let t = Number(r(e, u));
+				p.value = Number.isFinite(t) && t > 0 ? t : 0;
+			} else p.value = 1;
+		}
+		return o.delete(e), p;
+	};
+	return c(e, -1, 0);
+}
+var Vn = (e, t) => e === void 0 ? t : e;
+function Hn(e, t = {}) {
+	let n = Vn(t.width, 1), r = Vn(t.height, 1);
+	if (!(Number.isFinite(n) && Number.isFinite(r)) || n <= 0 || r < 0) return [];
+	let i = te(Bn(e, t), (e) => e.children);
+	i.sum((e) => e.children.length === 0 ? e.value : 0), t.sort === !0 && i.sort((e, t) => (t.value ?? 0) - (e.value ?? 0));
+	let a = Math.max(0, t.separation ?? 2) || 2, o = (e, n) => (e.parent === n.parent ? 1 : a) / (t.radial ? Math.max(1, e.depth) : 1), s = t.layout === "cluster" ? ee().size([n, 1]).separation(o)(i) : ie().size([n, 1]).separation(o)(i), c = /* @__PURE__ */ new Map();
+	s.eachAfter((e) => {
+		if (!t.distance) {
+			c.set(e, e.height);
+			return;
+		}
+		let n = e.data.distance, r = e.children ? -Infinity : 0;
+		for (let t of e.children ?? []) r = Math.max(r, c.get(t) ?? 0);
+		c.set(e, Number.isFinite(n) ? Math.max(n, r) : r);
+	});
+	let l = c.get(s) ?? 0, u = (e) => t.distance && l > 0 ? (l - (c.get(e) ?? 0)) / l * r : e.y * r, d = [], f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map();
+	return s.eachBefore((e) => {
+		let t = [...e.parent ? p.get(e.parent) ?? [] : [], e.data.label];
+		p.set(e, t), f.set(e, d.length), d.push({
+			datum: e.data.datum,
+			index: e.data.index,
+			depth: e.depth,
+			height: e.height,
+			leaf: !e.children,
+			label: e.data.label,
+			path: t,
+			value: e.value ?? 0,
+			branch: e.data.branch,
+			parent: e.parent ? f.get(e.parent) ?? -1 : -1,
+			x: e.x,
+			y: u(e),
+			distance: c.get(e) ?? e.height
+		});
+	}), d;
+}
+function Un(e, t, n, r = {}) {
+	if (n === "elbow") {
+		let n = {
+			x: t.x,
+			y: e.y
+		}, r = (e, t) => e.x === t.x && e.y === t.y;
+		return r(n, e) || r(n, t) ? [{
+			x: e.x,
+			y: e.y
+		}, {
+			x: t.x,
+			y: t.y
+		}] : [
+			{
+				x: e.x,
+				y: e.y
+			},
+			n,
+			{
+				x: t.x,
+				y: t.y
+			}
+		];
+	}
+	let i = Math.max(2, Math.floor(r.samples ?? 24) || 24), a = (e.y + t.y) / 2, o = [];
+	for (let n = 0; n < i; n++) {
+		let r = n / (i - 1), s = 1 - r, c = s * s * s, l = 3 * s * s * r, u = 3 * s * r * r, d = r * r * r;
+		o.push({
+			x: (c + l) * e.x + (u + d) * t.x,
+			y: c * e.y + (l + u) * a + d * t.y
+		});
+	}
+	return o;
+}
+function Wn(e, t, n = {
+	x: 0,
+	y: 0
+}) {
+	return {
+		x: n.x + t * Math.sin(e),
+		y: n.y + t * Math.cos(e)
+	};
+}
+function Gn(e, t, n, r = {}) {
+	let i = r.center ?? {
+		x: 0,
+		y: 0
+	}, a = (e) => Wn(e.x, e.y, i);
+	if (n === "curve") return Un(e, t, n, r).map(a);
+	let o = Math.max(1, r.arcDensity ?? 24), s = Math.max(1, Math.ceil(Math.abs(t.x - e.x) * o)), c = [];
+	for (let n = 0; n <= s; n++) {
+		let r = e.x + (t.x - e.x) * n / s;
+		c.push(Wn(r, e.y, i));
+	}
+	return t.y !== e.y && c.push(a(t)), c;
+}
+//#endregion
+//#region src/math/cluster.ts
+function Kn(e, t = "euclidean") {
+	let n = e.length, r = e.reduce((e, t) => Math.max(e, t.length), 0), i = Array.from({ length: n }, () => Array(n).fill(0));
+	for (let a = 0; a < n; a++) for (let o = a + 1; o < n; o++) {
+		let n = qn(e[a], e[o], r, t);
+		i[a][o] = n, i[o][a] = n;
+	}
+	return i;
+}
+function qn(e, t, n, r) {
+	let i = [], a = [];
+	for (let r = 0; r < n; r++) {
+		let n = e[r], o = t[r];
+		Number.isFinite(n) && Number.isFinite(o) && (i.push(n), a.push(o));
+	}
+	let o = i.length;
+	if (o === 0) return NaN;
+	if (r === "correlation") {
+		let e = i.reduce((e, t) => e + t, 0) / o, t = a.reduce((e, t) => e + t, 0) / o, n = 0, r = 0, s = 0;
+		for (let c = 0; c < o; c++) n += (i[c] - e) * (a[c] - t), r += (i[c] - e) ** 2, s += (a[c] - t) ** 2;
+		let c = r > 0 && s > 0 ? n / Math.sqrt(r * s) : 0;
+		return 1 - Math.max(-1, Math.min(1, c));
+	}
+	let s = n / o, c = 0;
+	for (let e = 0; e < o; e++) {
+		let t = Math.abs(i[e] - a[e]);
+		c += r === "manhattan" ? t : t * t;
+	}
+	return r === "manhattan" ? c * s : Math.sqrt(c * s);
+}
+function Jn(e, t = "average") {
+	let n = e.length;
+	if (n === 0) return {
+		root: null,
+		order: []
+	};
+	let r = 0;
+	for (let t = 0; t < n; t++) for (let i = 0; i < n; i++) {
+		let n = e[t]?.[i];
+		n !== void 0 && Number.isFinite(n) && (r = Math.max(r, n));
+	}
+	let i = (t, n) => {
+		let i = e[t]?.[n] ?? e[n]?.[t];
+		return i !== void 0 && Number.isFinite(i) ? Math.max(0, i) : r;
+	}, a = Array.from({ length: n }, (e, t) => Array.from({ length: n }, (e, n) => t === n ? 0 : i(t, n))), o = Array.from({ length: n }, (e, t) => ({
+		index: t,
+		height: 0,
+		size: 1
+	})), s = Array.from({ length: n }, (e, t) => t);
+	for (let e = 1; e < n; e++) {
+		let e = -1, r = -1, i = Infinity;
+		for (let t = 0; t < n; t++) if (o[t]) for (let s = t + 1; s < n; s++) o[s] && a[t][s] < i && (i = a[t][s], e = t, r = s);
+		let c = o[e], l = o[r], [u, d] = s[e] <= s[r] ? [c, l] : [l, c];
+		o[e] = {
+			index: -1,
+			height: i,
+			size: c.size + l.size,
+			children: [u, d]
+		}, o[r] = null, s[e] = Math.min(s[e], s[r]);
+		for (let i = 0; i < n; i++) {
+			if (i === e || !o[i]) continue;
+			let n = a[e][i], s = a[r][i], u = t === "single" ? Math.min(n, s) : t === "complete" ? Math.max(n, s) : (c.size * n + l.size * s) / (c.size + l.size);
+			a[e][i] = u, a[i][e] = u;
+		}
+	}
+	let c = o.find((e) => e !== null) ?? null;
+	return {
+		root: c,
+		order: c ? Xn(c) : []
+	};
+}
+function Yn(e, t = {}) {
+	return Jn(Kn(e, t.metric ?? "euclidean"), t.linkage ?? "average");
+}
+function Xn(e) {
+	let t = [], n = [e];
+	for (; n.length > 0;) {
+		let e = n.pop();
+		e.children ? n.push(e.children[1], e.children[0]) : t.push(e.index);
+	}
+	return t;
+}
+//#endregion
+//#region src/math/hexbin.ts
+function Zn(t, n, r) {
+	if (!(r > 0) || !Number.isFinite(r)) return [];
+	let i = e(t, n), a = /* @__PURE__ */ new Map();
+	for (let e = 0; e < i; e++) {
+		let i = t[e], o = n[e];
+		if (!Number.isFinite(i) || !Number.isFinite(o)) continue;
+		let [s, c] = Qn((Math.sqrt(3) / 3 * i - o / 3) / r, 2 / 3 * o / r), l = `${s},${c}`, u = a.get(l);
+		u ? u.count++ : a.set(l, {
+			center: {
+				x: r * Math.sqrt(3) * (s + c / 2),
+				y: r * 1.5 * c
+			},
+			count: 1
+		});
+	}
+	return Array.from(a.values());
+}
+function Qn(e, t) {
+	let n = e, r = t, i = -n - r, a = Math.round(n), o = Math.round(i), s = Math.round(r), c = Math.abs(a - n), l = Math.abs(o - i), u = Math.abs(s - r);
+	return c > l && c > u ? a = -o - s : l > u ? o = -a - s : s = -a - o, [a, s];
+}
+//#endregion
+//#region src/math/histogram2d.ts
+function $n(t, n, r = {}) {
+	let i = e(t, n), a = [], o = [];
+	for (let e = 0; e < i; e++) {
+		let r = t[e], i = n[e];
+		Number.isFinite(r) && Number.isFinite(i) && (a.push(r), o.push(i));
+	}
+	let [s, c] = r.xRange ?? C(a), [l, u] = r.yRange ?? C(o);
+	(s === void 0 || c === void 0) && (s = 0, c = 1), (l === void 0 || u === void 0) && (l = 0, u = 1), [s, c] = z(s, c), [l, u] = z(l, u);
+	let d = R(s, c, r.xBins, r.xRange?.[2], 10), f = R(l, u, r.yBins, r.yRange?.[2], 10), p = d.n, m = f.n;
+	c = d.max, u = f.max;
+	let h = ct(s, c, p), g = ct(l, u, m), _ = Array.from({ length: m }, () => Array(p).fill(0)), v = 0;
+	for (let e = 0; e < a.length; e++) {
+		let t = a[e], n = o[e];
+		if (t < s || t > c || n < l || n > u) continue;
+		let r = B(t, s, c, p), i = B(n, l, u, m), d = ++_[i][r];
+		d > v && (v = d);
+	}
+	return {
+		xEdges: h,
+		yEdges: g,
+		counts: _,
+		maxCount: v
+	};
+}
+//#endregion
+//#region src/math/shared/gridCells.ts
+function er(e) {
+	let t = 0;
+	for (let n of e) t = Math.max(t, n.length);
+	return t;
+}
+function tr(e, t) {
+	let n = [], r = Infinity, i = -Infinity;
+	for (let a = 0; a < e.length; a++) {
+		let o = e[a];
+		for (let e = 0; e < o.length; e++) {
+			let s = o[e];
+			n.push({
+				row: a,
+				column: e,
+				...t(a, e),
+				value: s
+			}), Number.isFinite(s) && (s < r && (r = s), s > i && (i = s));
+		}
+	}
+	return r > i && (r = 0, i = 1), {
+		cells: n,
+		min: r,
+		max: i
+	};
+}
+//#endregion
+//#region src/math/pcolormesh.ts
+function nr(e) {
+	let t = e.length;
+	if (t === 0) return [];
+	if (t === 1) return [e[0] - .5, e[0] + .5];
+	let n = Array(t + 1);
+	n[0] = e[0] - (e[1] - e[0]) / 2;
+	for (let r = 1; r < t; r++) n[r] = (e[r - 1] + e[r]) / 2;
+	return n[t] = e[t - 1] + (e[t - 1] - e[t - 2]) / 2, n;
+}
+function rr(e, t, n) {
+	if (e.length === t + 1) return [...e];
+	if (e.length === t) return nr(e);
+	throw Error(`pcolormeshCells: ${n} length (${e.length}) must equal ncols/nrows (${t}) or ncols/nrows + 1 (${t + 1}).`);
+}
+function ir(e, t, n) {
+	let r = n.length, i = er(n);
+	if (r === 0 || i === 0) return {
+		cells: [],
+		min: 0,
+		max: 1,
+		nrows: r,
+		ncols: i
+	};
+	let a = rr(e, i, "X"), o = rr(t, r, "Y"), { cells: s, min: c, max: l } = tr(n, (e, t) => ({
+		x0: a[t],
+		x1: a[t + 1],
+		y0: o[e],
+		y1: o[e + 1]
+	}));
+	return {
+		cells: s,
+		min: c,
+		max: l,
+		nrows: r,
+		ncols: i
+	};
+}
+//#endregion
+//#region src/math/imshow.ts
+function ar(e, t = {}) {
+	let n = e.length, r = er(e);
+	if (n === 0 || r === 0) return {
+		cells: [],
+		min: 0,
+		max: 1,
+		nrows: n,
+		ncols: r
+	};
+	let [i, a, o, s] = t.extent ?? [
+		0,
+		r,
+		0,
+		n
+	], c = t.origin ?? "upper", l = (a - i) / r, u = (s - o) / n, { cells: d, min: f, max: p } = tr(e, (e, t) => {
+		let n = i + t * l, r = i + (t + 1) * l;
+		return c === "upper" ? {
+			x0: n,
+			x1: r,
+			y1: s - e * u,
+			y0: s - (e + 1) * u
+		} : {
+			x0: n,
+			x1: r,
+			y0: o + e * u,
+			y1: o + (e + 1) * u
+		};
+	});
+	return {
+		cells: d,
+		min: f,
+		max: p,
+		nrows: n,
+		ncols: r
+	};
+}
+//#endregion
+//#region src/math/tricontour.ts
+var X = (e, t) => Number.isFinite(e[t]);
+function Z(t, n, r = {}) {
+	let i = e(t, n), a = r.triangles, s = a ?? o(t, n), c = [];
+	for (let e of s) {
+		let [r, o, s] = e;
+		if (a) {
+			for (let e of [
+				r,
+				o,
+				s
+			]) if (!Number.isInteger(e) || e < 0 || e >= i) throw RangeError(`triangulate: triangle [${r}, ${o}, ${s}] names point ${e}, but there are ${i} points.`);
+		}
+		if (![
+			r,
+			o,
+			s
+		].every((e) => X(t, e) && X(n, e))) continue;
+		let l = (t[o] - t[r]) * (n[s] - n[r]) - (n[o] - n[r]) * (t[s] - t[r]);
+		Math.abs(l) > 0 && c.push(l > 0 ? [
+			r,
+			o,
+			s
+		] : [
+			r,
+			s,
+			o
+		]);
+	}
+	return c;
+}
+function or(e, t, n, r, i, a) {
+	let [o, s] = r < i ? [r, i] : [i, r], c = (a - n[o]) / (n[s] - n[o]);
+	return {
+		x: e[o] + (e[s] - e[o]) * c,
+		y: t[o] + (t[s] - t[o]) * c
+	};
+}
+function sr(e, t, n, r) {
+	if (e[t] === r) return -1 - t;
+	if (e[n] === r) return -1 - n;
+	let [i, a] = t < n ? [t, n] : [n, t];
+	return i * e.length + a;
+}
+function cr(e, t, n, r, i = {}) {
+	let a = Z(e, t, i), o = q(r, [n], Mn), s = [];
+	for (let r of o) {
+		if (!Number.isFinite(r)) continue;
+		let i = [];
+		for (let [o, s, c] of a) {
+			if (!X(n, o) || !X(n, s) || !X(n, c)) continue;
+			let a = [
+				n[o] >= r,
+				n[s] >= r,
+				n[c] >= r
+			];
+			if (a[0] === a[1] && a[1] === a[2]) continue;
+			let l = [
+				o,
+				s,
+				c
+			], u = [], d = [];
+			for (let i = 0; i < 3; i++) {
+				let o = (i + 1) % 3;
+				a[i] !== a[o] && (u.push(or(e, t, n, l[i], l[o], r)), d.push(sr(n, l[i], l[o], r)));
+			}
+			u.length === 2 && i.push({
+				keys: [d[0], d[1]],
+				points: [u[0], u[1]]
+			});
+		}
+		for (let e of Pn(i)) s.push({
+			level: r,
+			points: e
+		});
+	}
+	return s;
+}
+function lr(e, t, n, r, i = {}) {
+	let a = Z(e, t, i), o = q(r, [n], In);
+	if (o.length < 2) return [];
+	let s = o.slice(1).map((e, t) => ({
+		loLevel: o[t],
+		hiLevel: e,
+		polygons: []
+	}));
+	for (let [r, i, o] of a) {
+		if (!X(n, r) || !X(n, i) || !X(n, o)) continue;
+		let a = [
+			r,
+			i,
+			o
+		].map((r) => ({
+			x: e[r],
+			y: t[r],
+			z: n[r]
+		}));
+		for (let e of s) {
+			let t = Y(Y(a, e.loLevel, !0), e.hiLevel, !1);
+			t.length >= 3 && e.polygons.push(t.map((e) => ({
+				x: e.x,
+				y: e.y
+			})));
+		}
+	}
+	return s;
+}
+function ur(e, t, n, r = {}) {
+	let i = [];
+	for (let a of Z(e, t, r)) {
+		let [r, o, s] = a;
+		X(n, r) && X(n, o) && X(n, s) && i.push({
+			indices: a,
+			points: a.map((n) => ({
+				x: e[n],
+				y: t[n]
+			})),
+			value: (n[r] + n[o] + n[s]) / 3
+		});
+	}
+	return i;
+}
+//#endregion
+//#region src/math/breadcrumbs.ts
+function dr(e) {
+	return !Array.isArray(e);
+}
+function fr(e, t) {
+	return e.length === t.length && e.every((e, n) => e === t[n]);
+}
+function pr(e) {
+	let t = [], n = (e, r) => {
+		if (!(r > 0)) return;
+		if (!dr(e)) {
+			let n = t.find((t) => fr(t.path, e));
+			n ? n.weight += r : t.push({
+				path: e,
+				weight: r
+			});
+			return;
+		}
+		let a = i(e.t);
+		n(e.from, r * (1 - a)), n(e.to, r * a);
+	};
+	return n(e, 1), t;
+}
+function mr(e) {
+	return dr(e) ? mr(e.to) : e;
+}
+function hr(e, t) {
+	let n = pr(e), r = /* @__PURE__ */ new Map(), i = t.separatorWidth + 2 * t.gap, a = t.backWidth === void 0 ? 0 : Math.max(0, t.backWidth) + 2 * t.gap, o = t.ellipsis ?? "…", s = t.measure(o), c = 0, l = (e, t, n, i, a) => {
+		let o = r.get(e);
+		if (o) return n !== o.x && (o.moves = !0), o.weight += i, o.sumX += i * n, a && (o.current += i), o;
+		let s = {
+			...t(),
+			x: n,
+			weight: i,
+			current: a ? i : 0,
+			sumX: i * n,
+			moves: !1,
+			heaviest: 0
+		};
+		return r.set(e, s), s;
+	};
+	for (let { path: e, weight: r } of n) {
+		let n = [t.root, ...e], u = n.map((e) => t.measure(e)), d = e.length, f = 0;
+		if (t.maxWidth !== void 0 && d >= 2 && a + u.reduce((e, t) => e + t, 0) + d * i > t.maxWidth) {
+			let e = u[d];
+			f = d;
+			for (let n = d - 1; n >= 2; n--) {
+				let r = e + u[n] + i;
+				if (a + u[0] + 2 * i + s + r > t.maxWidth) break;
+				e = r, f = n;
+			}
+		}
+		let p = a;
+		for (let t = 0; t <= d; t++) {
+			if (f > 0 && t === 1) {
+				let n = e.slice(0, f - 1), a = l("…", () => ({
+					key: "…",
+					path: n,
+					name: o,
+					depth: 1,
+					x: p,
+					width: s,
+					separatorX: 0,
+					weight: 0,
+					current: 0,
+					ellipsis: !0,
+					hidden: n
+				}), p, r, !1);
+				r > a.heaviest && (a.heaviest = r, a.path = n, a.hidden = n), p += s + i, t = f - 1;
+				continue;
+			}
+			let a = e.slice(0, t), c = JSON.stringify(a), m = t === d;
+			l(c, () => ({
+				key: c,
+				path: a,
+				name: n[t],
+				depth: t,
+				x: p,
+				width: u[t],
+				separatorX: 0,
+				weight: 0,
+				current: 0
+			}), p, r, m), p += u[t] + (m ? 0 : i);
+		}
+		c += r * p;
+	}
+	let u = t.align === "center" ? -c / 2 : t.align === "right" ? -c : 0, d = [...r.values()].map((e) => {
+		let { sumX: t, moves: n, heaviest: r, ...a } = e, o = (n && a.weight > 0 ? t / a.weight : a.x) + u;
+		return {
+			...a,
+			x: o,
+			separatorX: o - i / 2,
+			current: a.weight > 0 ? a.current / a.weight : 0
+		};
+	});
+	if (t.backWidth === void 0) return {
+		items: d,
+		width: c
+	};
+	let f = mr(e), p = {
+		x: u,
+		width: Math.max(0, t.backWidth),
+		weight: n.reduce((e, t) => e + (t.path.length > 0 ? t.weight : 0), 0),
+		path: f.length > 0 ? f.slice(0, -1) : null
+	};
+	return {
+		items: d,
+		width: c,
+		back: p
+	};
+}
+//#endregion
+//#region src/math/hierarchy.ts
+var gr = (e) => {
+	if (typeof e != "object" || !e) return;
+	let t = e.children;
+	return Array.isArray(t) ? t : void 0;
+}, _r = (e) => typeof e == "number" ? e : 0;
+function vr(e, t) {
+	let n = t.children ?? gr, r = t.value ?? _r, i = t.label, a = /* @__PURE__ */ new Set(), o = 0, s = (e, t, c) => {
+		if (typeof e == "object" && e) {
+			if (a.has(e)) throw Error("Hierarchy data contains a cycle: a node is its own ancestor.");
+			a.add(e);
+		}
+		let l = o++, u = n(e, l), d = Array.isArray(u) ? u : [], f = {
+			datum: e,
+			index: l,
+			label: i ? String(i(e, l) ?? "") : "",
+			value: 0,
+			branch: t,
+			children: d.map((e, n) => s(e, c === 0 ? n : t, c + 1))
+		};
+		if (f.children.length === 0) {
+			let t = Number(r(e, l));
+			f.value = Number.isFinite(t) && t > 0 ? t : 0;
+		}
+		return a.delete(e), f;
+	};
+	return s(e, -1, 0);
+}
+function yr(e, t) {
+	let n = te(vr(e, t), (e) => e.children);
+	return n.sum((e) => e.children.length === 0 ? e.value : 0), t.sort !== !1 && n.sort((e, t) => (t.value ?? 0) - (e.value ?? 0)), n;
+}
+function br(e, t) {
+	let n = [];
+	if (!((e.value ?? 0) > 0)) return n;
+	let r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
+	return e.eachBefore((e) => {
+		let a = e, o = a.value ?? 0;
+		if (!(o > 0)) return;
+		let s = [...a.parent ? i.get(a.parent) ?? [] : [], a.data.label];
+		i.set(a, s), r.set(a, n.length), n.push({
+			datum: a.data.datum,
+			index: a.data.index,
+			depth: a.depth,
+			height: a.height,
+			leaf: !a.children,
+			label: a.data.label,
+			path: s,
+			value: o,
+			branch: a.data.branch,
+			parent: a.parent ? r.get(a.parent) ?? -1 : -1,
+			...t(a)
+		});
+	}), n;
+}
+var Q = (e, t) => e === void 0 ? t : e, xr = (e, t) => Number.isFinite(e) && Number.isFinite(t) && e > 0 && t > 0, Sr = {
+	squarify: de,
+	binary: oe,
+	slice: le,
+	dice: se,
+	sliceDice: ue,
+	resquarify: ce
+};
+function Cr(e, t = {}) {
+	let n = Tr(e, t);
+	return n ? br(n, (e) => ({
+		x0: e.x0,
+		y0: e.y0,
+		x1: e.x1,
+		y1: e.y1
+	})) : [];
+}
+function wr(e) {
+	return JSON.stringify(e.ancestors().reverse().map((e) => e.data.label));
+}
+function Tr(e, t, n) {
+	let r = Q(t.width, 1), i = Q(t.height, 1);
+	if (!xr(r, i)) return null;
+	let a = Math.max(0, t.padding ?? 0) || 0, o = Math.max(0, t.paddingTop ?? a) || 0, s = Sr[t.tile ?? "squarify"] ?? de, c = t.keepRows, l = n ?? (c ? Er(c, s) : s), u = yr(e, t);
+	return ae().size([r, i]).tile(l).paddingInner(a).paddingRight(a).paddingBottom(a).paddingLeft(a).paddingTop((e) => e.depth === 0 ? a : o).round(!1)(u);
+}
+function Er(e, t) {
+	return (n, r, i, a, o) => {
+		let s = e.get(wr(n)), c = n.children ?? [];
+		if (!s) {
+			t(n, r, i, a, o);
+			return;
+		}
+		let l = /* @__PURE__ */ new Map();
+		for (let e of c) l.has(e.data.label) || l.set(e.data.label, e);
+		let u = /* @__PURE__ */ new Set(), d = [];
+		for (let e of s) {
+			let t = [];
+			for (let n of e.labels) {
+				let e = l.get(n);
+				e && !u.has(e) && (u.add(e), t.push(e));
+			}
+			let n = t.reduce((e, t) => e + (t.value ?? 0), 0);
+			t.length > 0 && n > 0 && d.push({
+				dice: e.dice,
+				nodes: t,
+				value: n
+			});
+		}
+		let f = c.filter((e) => !u.has(e)), p = n.value ?? 0;
+		for (let e of d) {
+			let t = {
+				children: e.nodes,
+				value: e.value
+			};
+			if (e.dice) {
+				let n = p ? i + (o - i) * e.value / p : o;
+				se(t, r, i, a, n), i = n;
+			} else {
+				let n = p ? r + (a - r) * e.value / p : a;
+				le(t, r, i, n, o), r = n;
+			}
+			p -= e.value;
+		}
+		if (f.length > 0) {
+			let e = {
+				children: f,
+				value: f.reduce((e, t) => e + (t.value ?? 0), 0)
+			};
+			de(e, r, i, a, o);
+		}
+	};
+}
+function Dr(e, t = {}) {
+	let n = /* @__PURE__ */ new Map(), r = (e, t, r, i, a) => {
+		ce(e, t, r, i, a);
+		let o = e._squarify;
+		o && n.set(wr(e), o.map((e) => ({
+			dice: e.dice,
+			labels: e.children.map((e) => e.data.label)
+		})));
+	};
+	return Tr(e, {
+		...t,
+		keepRows: void 0
+	}, r), n;
+}
+function Or(e, t = {}) {
+	let n = Q(t.width, 1), r = Q(t.height, 1);
+	if (!xr(n, r)) return [];
+	let i = yr(e, t);
+	return br(re().size([n, r]).round(!1)(i), (e) => ({
+		x0: e.x0,
+		y0: e.y0,
+		x1: e.x1,
+		y1: e.y1
+	}));
+}
+function kr(e, t = {}) {
+	let n = Q(t.size, 1);
+	if (!xr(n, n)) return [];
+	let r = yr(e, t);
+	return (r.value ?? 0) > 0 ? (r.each((e) => {
+		if (e.children) {
+			let t = e.children.filter((e) => (e.value ?? 0) > 0);
+			t.length === 0 ? delete e.children : e.children = t;
+		}
+	}), br(ne().size([n, n]).padding(Math.max(0, t.padding ?? 0) || 0)(r), (e) => ({
+		x: e.x,
+		y: e.y,
+		r: e.r
+	}))) : [];
+}
+//#endregion
+//#region src/math/hierarchyJoin.ts
+function Ar(e) {
+	let t = [], n = /* @__PURE__ */ new Map();
+	for (let r of e) {
+		if (r.parent < 0) {
+			t.push("");
+			continue;
+		}
+		let e = `${t[r.parent]}/${JSON.stringify(r.label)}`, i = n.get(e) ?? 0;
+		n.set(e, i + 1), t.push(i === 0 ? e : `${e}#${i}`);
+	}
+	return t;
+}
+function jr(e) {
+	let t = e.map(() => []);
+	return e.forEach((e, n) => {
+		e.parent >= 0 && t[e.parent]?.push(n);
+	}), t;
+}
+function Mr(e, t, n) {
+	if (e.length === 0 && t.length === 0) return [];
+	let r = Ar(e), i = Ar(t), a = ve(r, i), o = be({
+		exits: a.exits,
+		enters: a.enters,
+		staging: n.staging
+	}), s = n.blend > 0 ? n.blend < 1 ? n.blend : 1 : 0, c = M(s, o.exit, o.eased), l = M(s, o.update, o.eased), u = M(s, o.enter, o.eased), d = new Map(i.map((e, t) => [e, t])), f = n.enterStagger ?? 0, p = /* @__PURE__ */ new Map();
+	f > 0 && i.forEach((e, t) => {
+		a.from.has(e) || p.set(t, p.size);
+	});
+	let m = (e) => {
+		let t = p.get(e);
+		return t === void 0 || p.size < 2 ? u : Se(s, o.enter, o.eased, t, p.size, f);
+	}, h = jr(e), g = jr(t), _ = [], v = (i, a, o, s) => {
+		let u = i >= 0 ? e[i] : void 0, f = a >= 0 ? t[a] : void 0, p;
+		if (u && f) {
+			p = {
+				...l < .5 ? u : f,
+				value: u.value + (f.value - u.value) * l,
+				presence: 1,
+				fromAt: i,
+				toAt: a,
+				update: l
+			};
+			let e = p;
+			for (let t of n.fields) {
+				let n = u[t];
+				e[t] = n + (f[t] - n) * l;
+			}
+		} else p = {
+			...u ?? f,
+			presence: u ? 1 - c : m(a),
+			fromAt: u ? i : -1,
+			toAt: f ? a : -1,
+			update: l
+		};
+		p.parent = o, p.depth = s;
+		let y = _.length;
+		_.push(p);
+		let b = /* @__PURE__ */ new Set();
+		for (let e of i >= 0 ? h[i] ?? [] : []) {
+			let t = d.get(r[e]), n = t !== void 0 && t >= 0 ? t : -1;
+			n >= 0 && b.add(n), v(e, n, y, s + 1);
+		}
+		for (let e of a >= 0 ? g[a] ?? [] : []) b.has(e) || v(-1, e, y, s + 1);
+	};
+	return v(e.length > 0 ? 0 : -1, t.length > 0 ? 0 : -1, -1, 0), _;
+}
+//#endregion
+//#region src/math/mosaic.ts
+function Nr(e, t) {
+	if (!t) return [...e];
+	let n = new Set(e), r = [], i = /* @__PURE__ */ new Set();
+	for (let e of t) n.has(e) && !i.has(e) && (r.push(e), i.add(e));
+	for (let t of e) i.has(t) || r.push(t);
+	return r;
+}
+function Pr(e, t, n) {
+	e.value === 0 && t > 0 && (e.dataIndex = n), e.value += t;
+}
+function Fr(e, t) {
+	return e !== void 0 && Number.isFinite(e) ? Math.max(0, e) : t;
+}
+function Ir(e, t, n) {
+	return n <= 1 ? 0 : Math.min(e, t * .5 / (n - 1));
+}
+function Lr(e, t = {}) {
+	let n = Fr(t.width, 1), r = Fr(t.height, 1), i = Math.max(0, t.padding ?? 0) || 0, o = [], s = [], c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), f = 0;
+	e.forEach((e, t) => {
+		let { x: n, y: r } = e;
+		c.has(n) || (c.add(n), o.push(n)), l.has(r) || (l.add(r), s.push(r));
+		let i = a(e.value), p = u.get(n);
+		p || (p = /* @__PURE__ */ new Map(), u.set(n, p));
+		let m = p.get(r);
+		m ? Pr(m, i, t) : p.set(r, {
+			value: i,
+			dataIndex: t
+		});
+		let h = d.get(n);
+		h ? Pr(h, i, t) : d.set(n, {
+			value: i,
+			dataIndex: t
+		}), f += i;
+	});
+	let p = Nr(s, t.rows), m = {
+		columns: [],
+		rects: [],
+		rows: p,
+		total: 0
+	};
+	if (!(f > 0) || !Number.isFinite(f)) return m;
+	let h = Nr(o, t.columns).filter((e) => (d.get(e)?.value ?? 0) > 0), g = Ir(i, n, h.length), _ = n - g * Math.max(0, h.length - 1), v = [], y = [], b = 0;
+	return h.forEach((e, t) => {
+		let a = d.get(e), o = a.value / f, s = b, c = t === h.length - 1 ? n : s + o * _;
+		b = c + g, v.push({
+			key: e,
+			index: t,
+			x0: s,
+			x1: c,
+			value: a.value,
+			share: o,
+			dataIndex: a.dataIndex
+		});
+		let l = u.get(e), m = p.flatMap((e, t) => {
+			let n = l.get(e);
+			return n && n.value > 0 ? [{
+				row: e,
+				rowIndex: t,
+				...n
+			}] : [];
+		}), x = Ir(i, r, m.length), S = r - x * Math.max(0, m.length - 1), C = r;
+		m.forEach((n, r) => {
+			let i = n.value / a.value, l = C, u = r === m.length - 1 ? 0 : l - i * S;
+			C = u - x, y.push({
+				column: e,
+				row: n.row,
+				columnIndex: t,
+				rowIndex: n.rowIndex,
+				x0: s,
+				y0: u,
+				x1: c,
+				y1: l,
+				value: n.value,
+				columnShare: o,
+				rowShare: i,
+				dataIndex: n.dataIndex
+			});
+		});
+	}), {
+		columns: v,
+		rects: y,
+		rows: p,
+		total: f
+	};
+}
+//#endregion
+//#region src/math/waffle.ts
+function Rr(e, t) {
+	let n = e.map(a), r = n.reduce((e, t) => e + t, 0), i = Number.isFinite(t) ? Math.max(0, Math.floor(t)) : 0;
+	if (!(r > 0) || !Number.isFinite(r) || i === 0) return n.map(() => 0);
+	let o = n.map((e) => e / r * i), s = o.map(Math.floor), c = i - s.reduce((e, t) => e + t, 0), l = o.map((e, t) => ({
+		index: t,
+		rest: e - Math.floor(e)
+	})).filter((e) => n[e.index] > 0).sort((e, t) => t.rest - e.rest || e.index - t.index);
+	for (let e = 0; c > 0 && l.length > 0; e = (e + 1) % l.length) s[l[e].index]++, c--;
+	return s;
+}
+function zr(e, t) {
+	return e !== void 0 && Number.isFinite(e) ? Math.max(0, Math.floor(e)) : t;
+}
+function Br(e, t = {}) {
+	let n = zr(t.rows, 10), r = zr(t.columns, 10), i = n * r, a = Rr(e, i), o = [], s = 0, c = 0;
+	for (let e = 0; e < i; e++) {
+		for (; s < a.length && c >= a[s];) s++, c = 0;
+		let t = s < a.length;
+		o.push({
+			rank: e,
+			row: Math.floor(e / r),
+			column: e % r,
+			category: t ? s : -1
+		}), t && c++;
+	}
+	return o;
+}
+//#endregion
+//#region src/math/sankey.ts
+var Vr = 6, Hr = (e) => Number.isFinite(e) && e > 0 ? e : 0;
+function Ur(e, t = {}) {
+	let n = t.width ?? 1, r = t.height ?? 1, i = t.nodeWidth ?? n * .024, a = Math.max(0, Math.floor(t.iterations ?? Vr)), o = [], s = /* @__PURE__ */ new Map(), c = (e) => {
+		s.has(e) || (s.set(e, o.length), o.push(e));
+	};
+	if (t.nodes) {
+		for (let e of t.nodes) c(e);
+		for (let t of e) for (let e of [t.source, t.target]) if (!s.has(e)) throw Error(`sankeyLayout: link ${String(t.source)} → ${String(t.target)} names node "${String(e)}", which is not in \`nodes\`.`);
+	} else for (let t of e) c(t.source), c(t.target);
+	let l = o.length, d = o.map(() => []), f = o.map(() => []), p = e.map((e, t) => {
+		let n = s.get(e.source), r = s.get(e.target);
+		return d[n].push(t), f[r].push(t), {
+			source: n,
+			target: r,
+			value: Hr(e.value),
+			index: t
+		};
+	}), m = o.map((e, t) => {
+		let n = 0, r = 0;
+		for (let e of f[t]) n += p[e].value;
+		for (let e of d[t]) r += p[e].value;
+		return Math.max(n, r);
+	}), h = Wr(p, f, d, o), g = Array(l).fill(0);
+	for (let e of h) for (let t of d[e]) {
+		let n = p[t].target;
+		g[n] = Math.max(g[n], g[e] + 1);
+	}
+	let _ = Array(l).fill(0);
+	for (let e = h.length - 1; e >= 0; e--) {
+		let t = h[e];
+		for (let e of d[t]) _[t] = Math.max(_[t], _[p[e].target] + 1);
+	}
+	let v = l === 0 ? 0 : u(g), y = t.align ?? "justify", b = o.map((e, t) => {
+		switch (y) {
+			case "left": return g[t];
+			case "right": return v - _[t];
+			case "center":
+				if (f[t].length > 0) return g[t];
+				if (d[t].length > 0) {
+					let e = Infinity;
+					for (let n of d[t]) e = Math.min(e, g[p[n].target]);
+					return e - 1;
+				}
+				return 0;
+			default: return d[t].length === 0 ? v : g[t];
+		}
+	}), x = l === 0 ? 0 : v + 1, S = o.map((e, t) => {
+		let r = x <= 1 ? (n - i) / 2 : b[t] * (n - i) / (x - 1);
+		return {
+			id: e,
+			index: t,
+			value: m[t],
+			depth: b[t],
+			x0: r,
+			x1: r + i,
+			y0: 0,
+			y1: 0
+		};
+	}), C = Array.from({ length: x }, () => []);
+	for (let e of S) C[e.depth].push(e);
+	let w = C.reduce((e, t) => Math.max(e, t.length), 0), T = Math.max(0, Math.min(t.nodePadding ?? r * .08, w > 1 ? r / (w - 1) : Infinity)), E = Infinity;
+	for (let e of C) {
+		let t = e.reduce((e, t) => e + t.value, 0);
+		t > 0 && (E = Math.min(E, (r - (e.length - 1) * T) / t));
+	}
+	(!Number.isFinite(E) || E < 0) && (E = 0);
+	for (let e of C) {
+		let t = 0;
+		for (let n of e) n.y0 = t, n.y1 = t + n.value * E, t = n.y1 + T;
+		let n = (r - t + T) / (e.length + 1);
+		e.forEach((e, t) => {
+			e.y0 += n * (t + 1), e.y1 += n * (t + 1);
+		});
+	}
+	let D = (e) => (e.y0 + e.y1) / 2, O = (e, t, n, r) => {
+		let i = 0, a = 0;
+		for (let e of t) {
+			let t = p[e];
+			t.value <= 0 || (i += D(S[t[n]]) * t.value, a += t.value);
+		}
+		if (!(a > 0)) return;
+		let o = (i / a - D(e)) * r;
+		e.y0 += o, e.y1 += o;
+	}, k = (e, t) => e.y0 - t.y0 || e.index - t.index;
+	for (let e = 0; e < a; e++) {
+		let t = .99 ** e, n = Math.max(1 - t, (e + 1) / a);
+		for (let e = x - 2; e >= 0; e--) {
+			for (let n of C[e]) O(n, d[n.index], "target", t);
+			C[e].sort(k), Gr(C[e], T, r, n);
+		}
+		for (let e = 1; e < x; e++) {
+			for (let n of C[e]) O(n, f[n.index], "source", t);
+			C[e].sort(k), Gr(C[e], T, r, n);
+		}
+	}
+	let A = p.map((e) => ({
+		...e,
+		y0: 0,
+		y1: 0,
+		width: e.value * E
+	}));
+	for (let e of S) {
+		let t = [...d[e.index]].sort((e, t) => S[p[e].target].y0 - S[p[t].target].y0 || p[e].target - p[t].target || e - t), n = e.y0;
+		for (let e of t) A[e].y0 = n + A[e].width / 2, n += A[e].width;
+		let r = [...f[e.index]].sort((e, t) => S[p[e].source].y0 - S[p[t].source].y0 || p[e].source - p[t].source || e - t);
+		n = e.y0;
+		for (let e of r) A[e].y1 = n + A[e].width / 2, n += A[e].width;
+	}
+	return {
+		nodes: S,
+		links: A,
+		columns: x,
+		ky: E
+	};
+}
+function Wr(e, t, n, r) {
+	let i = t.map((e) => e.length), a = [];
+	i.forEach((e, t) => {
+		e === 0 && a.push(t);
+	});
+	let o = [];
+	for (; a.length > 0;) {
+		let t = a.shift();
+		o.push(t);
+		for (let r of n[t]) {
+			let t = e[r].target;
+			i[t]--, i[t] === 0 && a.push(t);
+		}
+	}
+	if (o.length < r.length) {
+		let e = r.filter((e, t) => i[t] > 0).map(String);
+		throw Error(`sankeyLayout: the links form a cycle (through ${e.join(", ")}); a Sankey diagram needs an acyclic graph.`);
+	}
+	return o;
+}
+function Gr(e, t, n, r) {
+	if (e.length === 0) return;
+	let i = e.length >> 1, a = e[i];
+	qr(e, a.y0 - t, i - 1, t, r), Kr(e, a.y1 + t, i + 1, t, r), qr(e, n, e.length - 1, t, r), Kr(e, 0, 0, t, r);
+}
+function Kr(e, t, n, r, i) {
+	let a = t;
+	for (let t = n; t < e.length; t++) {
+		let n = e[t], o = (a - n.y0) * i;
+		o > 1e-6 && (n.y0 += o, n.y1 += o), a = n.y1 + r;
+	}
+}
+function qr(e, t, n, r, i) {
+	let a = t;
+	for (let t = n; t >= 0; t--) {
+		let n = e[t], o = (n.y1 - a) * i;
+		o > 1e-6 && (n.y0 -= o, n.y1 -= o), a = n.y0 - r;
+	}
+}
+function Jr(e, t, n, r, i, a = {}) {
+	let o = Math.min(1, Math.max(0, a.t ?? 1));
+	if (!(o > 0)) return [];
+	let s = Math.max(2, Math.floor(a.samples ?? 24)), c = i / 2, l = (e + n) / 2, u = [], d = [];
+	for (let i = 0; i < s; i++) {
+		let a = o * i / (s - 1), f = 1 - a, p = f * f * f * e + 3 * f * a * (f + a) * l + a * a * a * n, m = f * f * (f + 3 * a) * t + a * a * (a + 3 * f) * r;
+		u.push({
+			x: p,
+			y: m - c
+		}), d.push({
+			x: p,
+			y: m + c
+		});
+	}
+	return [...u, ...d.reverse()];
+}
+//#endregion
+//#region src/math/3d/trisurface.ts
+function Yr(e, t, n) {
+	let r = o(e, t), i = [];
+	for (let [a, o, s] of r) {
+		let r = n[a], c = n[o], l = n[s];
+		Number.isFinite(r) && Number.isFinite(c) && Number.isFinite(l) && i.push({ points: [
+			{
+				x: e[a],
+				y: t[a],
+				z: r
+			},
+			{
+				x: e[o],
+				y: t[o],
+				z: c
+			},
+			{
+				x: e[s],
+				y: t[s],
+				z: l
+			}
+		] });
+	}
+	return i;
+}
+//#endregion
+//#region src/math/boxplot.ts
+var Xr = 1.5;
+function Zr(e, t = {}) {
+	let n = c(e);
+	if (n.length === 0) return null;
+	let r = t.whiskerScale ?? 1.5, i = [...n].sort((e, t) => e - t), a = O(i, .25) ?? i[0], o = O(i, .5) ?? i[0], s = O(i, .75) ?? i[0], l = s - a, u = a - r * l, d = s + r * l, f = i.filter((e) => e >= u && e <= d), p = i.filter((e) => e < u || e > d);
+	return {
+		min: i[0],
+		q1: a,
+		median: o,
+		q3: s,
+		max: i[i.length - 1],
+		low: f.length > 0 ? f[0] : a,
+		high: f.length > 0 ? f[f.length - 1] : s,
+		outliers: p
+	};
+}
+//#endregion
+//#region src/math/shared/polar.ts
+var Qr = Math.PI / 2;
+function $(e) {
+	return {
+		startAngle: e?.startAngle ?? Qr,
+		direction: e?.clockwise ?? !0 ? -1 : 1
+	};
+}
+//#endregion
+//#region src/math/chord.ts
+var $r = .04, ei = (e) => e !== void 0 && Number.isFinite(e) && e > 0 ? e : 0;
+function ti(e, n = {}) {
+	let r = e.length, i = (t, n) => ei(e[t]?.[n]), a = n.directed === !0, o = (e) => {
+		let t = [];
+		for (let n = 0; n < r; n++) t.push({
+			from: e,
+			to: n,
+			value: i(e, n)
+		});
+		if (n.sortSubgroups && t.sort((e, t) => t.value - e.value || e.to - t.to), !a) return t;
+		let o = [];
+		for (let t = 0; t < r; t++) o.push({
+			from: t,
+			to: e,
+			value: i(t, e)
+		});
+		return n.sortSubgroups && o.sort((e, t) => t.value - e.value || e.from - t.from), [...t, ...o];
+	}, s = Array.from({ length: r }, (e, t) => o(t)), c = s.map((e) => e.reduce((e, t) => e + t.value, 0)), l = c.reduce((e, t) => e + t, 0), u = Math.max(0, ei(n.padAngle ?? $r)), { startAngle: d, direction: f } = $(n), p = c.filter((e) => e > 0).length, m = Math.max(0, t - u * p), h = l > 0 ? m / l : 0, g = [], _ = Array.from({ length: r }, () => []), v = Array.from({ length: r }, () => []), y = d;
+	for (let e = 0; e < r; e++) {
+		let t = y;
+		for (let t of s[e]) {
+			let n = y + f * t.value * h, r = t.from === e && (!a || _[e][t.to] === void 0), i = r ? t.to : t.from, o = {
+				index: e,
+				subindex: i,
+				startAngle: y,
+				endAngle: n,
+				value: t.value
+			};
+			r ? _[e][i] = o : v[e][i] = o, y = n;
+		}
+		g.push({
+			index: e,
+			startAngle: t,
+			endAngle: y,
+			value: c[e]
+		}), c[e] > 0 && (y += f * u);
+	}
+	let b = [];
+	for (let e = 0; e < r; e++) if (a) for (let t = 0; t < r; t++) {
+		let n = _[e][t];
+		n.value > 0 && b.push({
+			source: n,
+			target: v[t][e]
+		});
+	}
+	else for (let t = e; t < r; t++) {
+		let n = _[e][t], r = _[t][e];
+		(n.value > 0 || r.value > 0) && b.push(n.value < r.value ? {
+			source: r,
+			target: n
+		} : {
+			source: n,
+			target: r
+		});
+	}
+	return {
+		groups: g,
+		chords: b
+	};
+}
+function ni(e, t, n = {}) {
+	let { x: r, y: i } = n.center ?? {
+		x: 0,
+		y: 0
+	}, a = Math.max(1, n.arcDensity ?? 24), o = Math.max(2, Math.floor(n.curveSamples ?? 24)), s = (e) => p(r, i, t, e), c = [], l = (e, t) => {
+		let n = Math.max(1, Math.ceil(Math.abs(t - e) * a));
+		for (let r = 0; r <= n; r++) c.push(s(e + (t - e) * r / n));
+	}, u = (e) => {
+		let t = c[c.length - 1];
+		for (let n = 1; n < o; n++) {
+			let a = n / o, s = 1 - a;
+			c.push({
+				x: s * s * t.x + 2 * s * a * r + a * a * e.x,
+				y: s * s * t.y + 2 * s * a * i + a * a * e.y
+			});
+		}
+	}, { source: d, target: f } = e, m = Math.min(Math.max(0, Number.isFinite(n.headRadius) ? n.headRadius : 0), t);
+	l(d.startAngle, d.endAngle);
+	let h = d.startAngle === f.startAngle && d.endAngle === f.endAngle;
+	if (m > 0) {
+		let e = (e) => p(r, i, t - m, e), n = e(f.startAngle);
+		u(n), c.push(n), c.push(s((f.startAngle + f.endAngle) / 2)), c.push(e(f.endAngle));
+	} else h || (u(s(f.startAngle)), l(f.startAngle, f.endAngle));
+	return u(s(d.startAngle)), c;
+}
+//#endregion
+//#region src/math/errorbar.ts
+function ri(e, t) {
+	if (!e) return;
+	let n = e.length === 2 && Array.isArray(e[0]), r = n ? e[0][t] : e[t], i = n ? e[1][t] : e[t];
+	if (Number.isFinite(r) && Number.isFinite(i)) return {
+		lower: r,
+		upper: i
+	};
+}
+function ii(t, n, r, i) {
+	let a = e(t, n), o = [];
+	for (let e = 0; e < a; e++) {
+		let a = t[e], s = n[e];
+		if (!Number.isFinite(a) || !Number.isFinite(s)) continue;
+		let c = {
+			index: e,
+			point: {
+				x: a,
+				y: s
+			}
+		}, l = ri(r, e);
+		l && (c.yBar = [{
+			x: a,
+			y: s - l.lower
+		}, {
+			x: a,
+			y: s + l.upper
+		}]);
+		let u = ri(i, e);
+		u && (c.xBar = [{
+			x: a - u.lower,
+			y: s
+		}, {
+			x: a + u.upper,
+			y: s
+		}]), o.push(c);
+	}
+	return o;
+}
+//#endregion
+//#region src/math/eventplot.ts
+var ai = 1, oi = .8;
+function si(e, t = {}) {
+	let n = t.lineOffset ?? ai, r = (t.lineLength ?? oi) / 2;
+	return e.map((e, t) => {
+		let i = t * n, a = [];
+		for (let t of e) Number.isFinite(t) && a.push([{
+			x: t,
+			y: i - r
+		}, {
+			x: t,
+			y: i + r
+		}]);
+		return {
+			row: t,
+			ticks: a
+		};
+	});
+}
+//#endregion
+//#region src/math/facet.ts
+function ci(e, t, n) {
+	let r = [];
+	if (e.length > 0 && t.length > 0) return e.forEach((e, n) => {
+		t.forEach((t, i) => {
+			r.push({
+				index: r.length,
+				row: n,
+				column: i,
+				rowKey: e,
+				columnKey: t
+			});
+		});
+	}), {
+		slots: r,
+		rows: e.length,
+		columns: t.length
+	};
+	let i = Math.max(1, Math.floor(n ?? Infinity) || Math.max(e.length, t.length, 1));
+	if (t.length > 0) {
+		let e = Math.min(i, t.length);
+		return t.forEach((t, n) => {
+			r.push({
+				index: n,
+				row: Math.floor(n / e),
+				column: n % e,
+				columnKey: t
+			});
+		}), {
+			slots: r,
+			rows: Math.ceil(t.length / e),
+			columns: e
+		};
+	}
+	if (e.length > 0) {
+		let t = Math.min(i, e.length);
+		return e.forEach((e, n) => {
+			r.push({
+				index: 0,
+				row: n % t,
+				column: Math.floor(n / t),
+				rowKey: e
+			});
+		}), r.sort((e, t) => e.row - t.row || e.column - t.column), r.forEach((e, t) => {
+			e.index = t;
+		}), {
+			slots: r,
+			rows: t,
+			columns: Math.ceil(e.length / t)
+		};
+	}
+	return {
+		slots: [{
+			index: 0,
+			row: 0,
+			column: 0
+		}],
+		rows: 1,
+		columns: 1
+	};
+}
+function li(e, t, n) {
+	let r = n === "top" ? -1 : +(n === "bottom"), i = n === "left" ? -1 : +(n === "right");
+	return !t.some((t) => t.row === e.row + r && t.column === e.column + i);
+}
+function ui(e, t, n) {
+	let r = Array.from({ length: e }, (e, t) => {
+		let r = n?.[t];
+		return r !== void 0 && Number.isFinite(r) && r > 0 ? r : 1;
+	}), i = r.reduce((e, t) => e + t, 0);
+	return r.map((e) => Math.max(0, t) * e / i);
+}
+function di(e) {
+	let t = {
+		left: 0,
+		right: 0,
+		top: 0,
+		bottom: 0,
+		...e.outer
+	}, n = e.center ?? {
+		x: 0,
+		y: 0
+	}, r = Math.max(1, e.columns), i = Math.max(1, e.rows), a = n.x - e.width / 2 + t.left, o = n.y + e.height / 2 - t.top, s = Math.max(.1 * r, e.width - t.left - t.right - e.gapX * (r - 1)), c = Math.max(.1 * i, e.height - t.top - t.bottom - e.gapY * (i - 1)), l = ui(r, s, e.widthRatios), u = ui(i, c, e.heightRatios), d = [], f = o;
+	for (let t = 0; t < i; t++) {
+		let n = [], i = a;
+		for (let a = 0; a < r; a++) n.push({
+			center: {
+				x: i + l[a] / 2,
+				y: f - u[t] / 2
+			},
+			width: l[a],
+			height: u[t]
+		}), i += l[a] + e.gapX;
+		d.push(n), f -= u[t] + e.gapY;
+	}
+	let p = d[i - 1][r - 1];
+	return {
+		cells: d,
+		plots: {
+			minX: a,
+			maxX: p.center.x + p.width / 2,
+			minY: p.center.y - p.height / 2,
+			maxY: o
+		}
+	};
+}
+function fi(e, t, n, r = 0, i = .5) {
+	let a = Math.min(1, Math.max(0, e)), o = Math.min(.95, Math.max(0, r));
+	if (a <= i || o === 0 || n <= 1) return a;
+	let s = (a - i) / (1 - i), c = o * t / Math.max(1, n - 1);
+	return i + Math.min(1, Math.max(0, (s - c) / (1 - o))) * (1 - i);
+}
+//#endregion
+//#region src/math/gauge.ts
+var pi = 7 * Math.PI / 6, mi = -Math.PI / 6;
+function hi(e, t, n) {
+	if (!Number.isFinite(e) || !(n > t)) return 0;
+	let r = (e - t) / (n - t);
+	return r > 0 ? r < 1 ? r : 1 : 0;
+}
+function gi(e, t = pi, n = mi) {
+	return t + (n - t) * e;
+}
+function _i(e, t, n) {
+	if (!(n > t)) return [];
+	let r = [], i = t;
+	for (let a = 0; a < e.length; a++) {
+		let o = e[a].to, s = Number.isNaN(o) ? i : Math.min(n, Math.max(i, o));
+		r.push({
+			index: a,
+			from: i,
+			to: s,
+			startFraction: (i - t) / (n - t),
+			endFraction: (s - t) / (n - t)
+		}), i = s;
+	}
+	return r;
+}
+function vi(e, t) {
+	if (!Number.isFinite(e) || t.length === 0) return -1;
+	let n = t[0].from;
+	for (let r of t) if (!(r.to <= r.from) && Math.max(n, e) <= r.to) return r.index;
+	return -1;
+}
+//#endregion
+//#region src/math/parallel.ts
+function yi(e, t) {
+	return t <= 1 ? .5 : e / (t - 1);
+}
+function bi(e, t) {
+	let n = t.length;
+	return e.map((e, r) => {
+		let i = [], a = [];
+		for (let r = 0; r < n; r++) {
+			let o = e[r];
+			if (typeof o != "number" || !Number.isFinite(o)) {
+				a.length > 0 && i.push(a), a = [];
+				continue;
+			}
+			let [s, c] = t[r], l = c - s;
+			a.push({
+				x: yi(r, n),
+				y: l !== 0 && Number.isFinite(l) ? (o - s) / l : .5
+			});
+		}
+		return a.length > 0 && i.push(a), {
+			index: r,
+			segments: i
+		};
+	});
+}
+//#endregion
+//#region src/math/pie.ts
+function xi(e, n = {}) {
+	let r = e.map(a), i = r.reduce((e, t) => e + t, 0);
+	if (i <= 0) return [];
+	let { startAngle: o, direction: s } = $(n), c = [], l = o;
+	for (let e = 0; e < r.length; e++) {
+		let n = r[e], a = n / i, o = l, u = o + s * t * a;
+		c.push({
+			index: e,
+			value: n,
+			startAngle: o,
+			endAngle: u,
+			fraction: a
+		}), l = u;
+	}
+	return c;
+}
+function Si(e, t) {
+	let n = 0;
+	return e.map((e) => {
+		let r = n;
+		if (n += e.fraction, e.fraction <= 0) return +(t >= r);
+		let i = (t - r) / e.fraction;
+		return i > 0 ? i < 1 ? i : 1 : 0;
+	});
+}
+function Ci(e, t) {
+	let n = e[0]?.startAngle ?? 0;
+	return e.map((e) => ({
+		...e,
+		startAngle: n + (e.startAngle - n) * t,
+		endAngle: n + (e.endAngle - n) * t
+	}));
+}
+function wi(e, n) {
+	if (e >= 1) return;
+	let r = n.center ?? {
+		x: 0,
+		y: 0
+	};
+	if (!(e > 0)) return [r];
+	let { startAngle: i, direction: a } = $(n), o = a * t * e, s = Math.max(2, Math.ceil(128 * e)), c = [r];
+	for (let e = 0; e <= s; e++) {
+		let t = i + o * e / s;
+		c.push(p(r.x, r.y, n.radius, t));
+	}
+	return c;
+}
+function Ti(e, t, n) {
+	let r = new Set(e), i = new Set(t);
+	if (n === "from") {
+		let n = [...e];
+		return t.forEach((e, a) => {
+			if (r.has(e)) return;
+			let o = a === 0 ? 0 : n.indexOf(t[a - 1]) + 1;
+			for (; o < n.length && !i.has(n[o]);) o++;
+			n.splice(o, 0, e);
+		}), n;
+	}
+	let a = [...t];
+	return e.forEach((t, n) => {
+		i.has(t) || a.splice(n === 0 ? 0 : a.indexOf(e[n - 1]) + 1, 0, t);
+	}), a;
+}
+function Ei(e, t, n, r = {}) {
+	let i = (e) => {
+		let n = /* @__PURE__ */ new Map(), i = 0;
+		return xi(e.map(t), r).forEach((t, r) => {
+			n.set(e[r], {
+				startAngle: t.startAngle,
+				endAngle: t.endAngle,
+				fraction: t.fraction,
+				offset: i
+			}), i += t.fraction;
+		}), n;
+	};
+	if (e.from === e.to || e.from.length === e.to.length && e.from.every((t, n) => t === e.to[n]) || n <= 0) return i(e.from);
+	let a = i(e.to);
+	if (n >= 1) return a;
+	let o = i(e.from), s = /* @__PURE__ */ new Map();
+	for (let [e, t] of o) {
+		let r = a.get(e) ?? t;
+		s.set(e, {
+			startAngle: f(t.startAngle, r.startAngle, n),
+			endAngle: f(t.endAngle, r.endAngle, n),
+			fraction: f(t.fraction, r.fraction, n),
+			offset: f(t.offset, r.offset, n)
+		});
+	}
+	return s;
+}
+function Di(e, t) {
+	if (e.fraction <= 0) return +(t >= e.offset);
+	let n = (t - e.offset) / e.fraction;
+	return n > 0 ? n < 1 ? n : 1 : 0;
+}
+//#endregion
+//#region src/math/polarArea.ts
+function Oi(e, n = {}) {
+	let r = e.length;
+	if (r === 0) return [];
+	let i = e.map(a), o = i.reduce((e, t) => e + t, 0), s = n.maxValue ?? u(i, 0), { startAngle: c, direction: l } = $(n), d = l * t / r;
+	return i.map((e, t) => {
+		let n = c + t * d;
+		return {
+			index: t,
+			value: e,
+			startAngle: n,
+			endAngle: n + d,
+			radius: s > 0 ? e / s : 0,
+			fraction: o > 0 ? e / o : 0
+		};
+	});
+}
+//#endregion
+//#region src/math/radar.ts
+function ki(e, n = {}) {
+	let r = e.length;
+	if (r < 3) return [];
+	let i = e.map(a), o = n.maxValue ?? u(i, 0), { startAngle: s, direction: c } = $(n), l = c * t / r;
+	return i.map((e, t) => {
+		let n = s + t * l, r = o > 0 ? e / o : 0;
+		return {
+			index: t,
+			value: e,
+			angle: n,
+			x: r * Math.cos(n),
+			y: r * Math.sin(n)
+		};
+	});
+}
+function Ai(e, t) {
+	t && e.forEach((e, n) => {
+		if (e.length > 0 && e.length !== t.length) throw Error(`RadarChart: group ${n} has ${e.length} values but axisLabels has ${t.length}; each group needs exactly one value per axis`);
+	});
+}
+function ji(e, n) {
+	let r = (n - e) % t;
+	return r > Math.PI && (r -= t), r <= -Math.PI && (r += t), r;
+}
+function Mi(e, n, r = {}) {
+	let { startAngle: i, direction: a } = $(r), o = (e, n) => i + e * (a * t / n);
+	if (n === void 0) return e.map((t, n) => ({
+		key: t,
+		slot: n,
+		from: n,
+		to: -1,
+		anchor: !0,
+		angle: o(n, e.length),
+		weight: 1
+	}));
+	let s = ve(e, n), c = r.exit ?? 0, l = r.update ?? 0, u = r.enter ?? 0, d = (t, r) => {
+		let i = o(t, e.length), a = o(r, n.length);
+		return l <= 0 ? i : l >= 1 ? a : i + ji(i, a) * l;
+	}, f = (e, t) => {
+		let n = e.length, r = o(t, n), i = (t) => {
+			let n = e[t], r = s.from.get(n), i = s.to.get(n);
+			return r !== void 0 && i !== void 0 ? {
+				j: t,
+				a: r,
+				b: i
+			} : void 0;
+		}, a, c;
+		for (let e = 1; e < n && !a; e++) a = i((t - e + n) % n);
+		for (let e = 1; e < n && !c; e++) c = i((t + e) % n);
+		if (!a || !c) return r;
+		let l = (e) => ji(o(e.j, n), d(e.a, e.b)), u = l(a), f = l(c);
+		if (u === 0 && f === 0) return r;
+		let p = (t - a.j + n) % n / ((c.j - a.j + n) % n || n);
+		return r + u + (f - u) * p;
+	}, p = s.keys.map((t, r) => {
+		let i = s.from.get(t), a = s.to.get(t);
+		if (i !== void 0 && a !== void 0) return {
+			key: t,
+			slot: r,
+			from: i,
+			to: a,
+			anchor: !0,
+			angle: d(i, a),
+			weight: 1
+		};
+		if (i !== void 0) return {
+			key: t,
+			slot: r,
+			from: i,
+			to: -1,
+			anchor: !1,
+			angle: f(e, i),
+			weight: 1 - c
+		};
+		let o = a;
+		return {
+			key: t,
+			slot: r,
+			from: -1,
+			to: o,
+			anchor: !1,
+			angle: f(n, o),
+			weight: u
+		};
+	}), m = (e) => h((e.angle - i) * a);
+	return p.map((e) => ({
+		frame: e,
+		at: m(e)
+	})).sort((e, t) => e.at - t.at).map(({ frame: e }) => e);
+}
+function Ni(e, t, n) {
+	let r = e.map((e) => {
+		let r = t(e);
+		if (r === void 0) return;
+		let i = n > 0 ? a(r) / n : 0;
+		return {
+			x: i * Math.cos(e.angle),
+			y: i * Math.sin(e.angle)
+		};
+	}), i = e.flatMap((e, t) => e.anchor && r[t] ? [t] : []), o = e.length, s = [];
+	return e.forEach((t, n) => {
+		let a = r[n], c = a ? t.anchor ? 1 : t.weight : 0;
+		if (!(c > 0) || !a) return;
+		if (c >= 1) {
+			s.push(a);
+			return;
+		}
+		let l = {
+			x: 0,
+			y: 0
+		};
+		if (i.length >= 2) {
+			let t = -1, i = -1;
+			for (let i = 1; i < o && t < 0; i++) {
+				let a = (n - i + o) % o;
+				e[a].anchor && r[a] && (t = a);
+			}
+			for (let t = 1; t < o && i < 0; t++) {
+				let a = (n + t) % o;
+				e[a].anchor && r[a] && (i = a);
+			}
+			let a = r[t], s = r[i], c = (t, n) => {
+				let r = 0;
+				for (let i = t; i !== n; i = (i + 1) % o) r += Math.abs(ji(e[i].angle, e[(i + 1) % o].angle));
+				return r;
+			}, u = c(t, n), d = u + c(n, i), f = d > 0 ? u / d : .5;
+			l = {
+				x: a.x + (s.x - a.x) * f,
+				y: a.y + (s.y - a.y) * f
+			};
+		}
+		s.push({
+			x: l.x + (a.x - l.x) * c,
+			y: l.y + (a.y - l.y) * c
+		});
+	}), s.length < 3 ? [] : s;
+}
+var Pi = Math.sin(Math.PI / 12);
+function Fi(e, t, n) {
+	let r = Math.cos(e), i = Math.sin(e), a = (e) => Math.max(-1, Math.min(1, e / Pi));
+	return {
+		x: r * n + a(r) * t.width / 2,
+		y: i * n + a(i) * t.height / 2
+	};
+}
+//#endregion
+//#region src/math/scatter.ts
+function Ii(t, n) {
+	let r = e(t, n), i = [];
+	for (let e = 0; e < r; e++) {
+		let r = t[e], a = n[e];
+		Number.isFinite(r) && Number.isFinite(a) && i.push({
+			index: e,
+			x: r,
+			y: a
+		});
+	}
+	return i;
+}
+//#endregion
+//#region src/math/stem.ts
+var Li = 0;
+function Ri(t, n, r = {}) {
+	let i = r.baseline ?? Li, a = e(t, n), o = [];
+	for (let e = 0; e < a; e++) {
+		let r = t[e], a = n[e];
+		Number.isFinite(r) && Number.isFinite(a) && o.push({
+			index: e,
+			drop: [{
+				x: r,
+				y: i
+			}, {
+				x: r,
+				y: a
+			}],
+			marker: {
+				x: r,
+				y: a
+			}
+		});
+	}
+	return o;
+}
+//#endregion
+export { cr as $, mt as $t, ti as A, Fe as An, qt as At, Lr as B, Se as Bn, Lt as Bt, hi as C, qe as Cn, Cn as Ct, fi as D, Ie as Dn, fn as Dt, li as E, Ve as En, mn as Et, Yr as F, xe as Fn, cn as Ft, Cr as G, he as Gn, At as Gt, Ar as H, ge as Hn, Nt as Ht, Ur as I, ve as In, on as It, pr as J, Ct as Jt, Dr as K, fe as Kn, Dt as Kt, Jr as L, Ce as Ln, Vt as Lt, $ as M, Oe as Mn, un as Mt, Xr as N, ke as Nn, $t as Nt, si as O, Re as On, dn as Ot, Zr as P, be as Pn, sn as Pt, lr as Q, yt as Qt, Rr as R, we as Rn, Ht as Rt, _i as S, Ke as Sn, yn as St, ci as T, He as Tn, gn as Tt, kr as U, me as Un, W as Ut, Mr as V, _e as Vn, Gt as Vt, Or as W, pe as Wn, Mt as Wt, fr as X, ht as Xt, dr as Y, wt as Yt, Z, gt as Zt, bi as _, Xe as _n, An as _t, Ni as a, ot as an, Zn as at, gi as b, Je as bn, vn as bt, Oi as c, L as cn, Xn as ct, Si as d, et as dn, Gn as dt, V as en, ur as et, Ei as f, nt as fn, Wn as ft, yi as g, Ye as gn, jn as gt, wi as h, $e as hn, Fn as ht, Mi as i, B as in, $n as it, ni as j, je as jn, Jt as jt, ii as k, Pe as kn, pn as kt, Ci as l, rt as ln, Jn as lt, Di as m, tt as mn, Rn as mt, Ii as n, lt as nn, ir as nt, Fi as o, at as on, Yn as ot, Ti as p, Qe as pn, Un as pt, hr as q, Ot as qt, Ai as r, ut as rn, er as rt, ki as s, it as sn, Kn as st, Ri as t, dt as tn, ar as tt, xi as u, Ze as un, Hn as ut, mi as v, We as vn, wn as vt, di as w, F as wn, _n as wt, vi as x, I as xn, Sn as xt, pi as y, Ge as yn, xn as yt, Br as z, M as zn, K as zt };