minerva-design 1.4.0 → 1.6.0

package/dist/charts/engine/graph/force.d.ts

@@ -0,0 +1,76 @@
+import { GraphForceLayoutOptions, GraphForceSimulation, GraphEdge, GraphLayoutResult, GraphNode } from './types.js';
+/** Data of a simulation (index-based, transferable to a worker) */
+export interface ForceKernelInit {
+    n: number;
+    /** Initial positions (NaN = automatic) */
+    x: Float64Array;
+    y: Float64Array;
+    radius: Float64Array;
+    /** 1 = pinned at its initial position */
+    fixed: Uint8Array;
+    source: Int32Array;
+    target: Int32Array;
+    /** Strength multiplier per link */
+    weight: Float64Array;
+    linkDistance: number;
+    /** NaN = 1 / min(degree) */
+    linkStrength: number;
+    charge: number;
+    theta: number;
+    gravity: number;
+    /** Extra spacing of the collisions; negative disables them */
+    collide: number;
+    velocityDecay: number;
+    iterations: number;
+    seed: number;
+    /** Starting temperature (1 for a new layout, lower to refine one) */
+    alpha: number;
+    /** Width / height of the view: gravity stretches the layout to it */
+    aspect: number;
+    /** Charge multiplier per node (merged nodes of a coarse level) */
+    mass?: Float64Array;
+    /**
+     * Multilevel start: a fresh layout of at least this many nodes is first
+     * computed on a coarsened graph (0 = never)
+     */
+    coarsen?: number;
+}
+export type ForceKernel = (init: ForceKernelInit) => GraphForceSimulation;
+/** Returns the simulation factory (self-contained: serialized into workers) */
+export declare function forceKernel(): ForceKernel;
+export declare const FORCE_DEFAULTS: {
+    linkDistance: number;
+    charge: number;
+    theta: number;
+    gravity: number;
+    collide: number;
+    velocityDecay: number;
+    iterations: number;
+    seed: number;
+    /** Smallest fresh layout computed with a multilevel start */
+    multilevel: number;
+};
+/** Kernel input from index-based data */
+export declare const forceInit: (n: number, source: Int32Array, target: Int32Array, options: GraphForceLayoutOptions | undefined, extra?: {
+    x?: Float64Array;
+    y?: Float64Array;
+    radius?: Float64Array;
+    fixed?: Uint8Array;
+    weight?: Float64Array;
+    alpha?: number;
+    aspect?: number;
+}) => ForceKernelInit;
+/** Index of the ids and the valid edges (unknown ids are skipped) */
+export declare const indexGraph: (nodes: readonly GraphNode[], edges: readonly GraphEdge[]) => {
+    index: Map<string, number>;
+    source: Int32Array;
+    target: Int32Array;
+    edge: Int32Array;
+};
+/**
+ * A force simulation of the nodes and edges, stepped by the caller (no DOM,
+ * no timers: usable in workers and mini-programs)
+ */
+export declare const createForceSimulation: (nodes: readonly GraphNode[], edges: readonly GraphEdge[], options?: GraphForceLayoutOptions) => GraphForceSimulation;
+/** Runs a force simulation to the end and returns the positions (synchronous) */
+export declare const forceLayout: (nodes: readonly GraphNode[], edges: readonly GraphEdge[], options?: GraphForceLayoutOptions) => GraphLayoutResult;

package/dist/charts/engine/graph/force.js

@@ -0,0 +1,423 @@
+//#region src/engine/graph/force.ts
+function e() {
+	return function e(t) {
+		let n = t.n, r = .3, i = t.x, a = t.y, o = t.radius, s = new Float64Array(n), c = new Float64Array(n), l = new Float64Array(n).fill(NaN), u = new Float64Array(n).fill(NaN), d = new Uint8Array(n), f = t.seed | 0 || 1, p = () => {
+			f = f + 1831565813 | 0;
+			let e = Math.imul(f ^ f >>> 15, 1 | f);
+			return e = e + Math.imul(e ^ e >>> 7, 61 | e) ^ e, ((e ^ e >>> 14) >>> 0) / 4294967296;
+		}, m = () => (p() - .5) * 1e-6, h = t.mass, g = t.alpha >= 1 && n >= (t.coarsen || Infinity);
+		for (let e = 0; e < n && g; e++) (t.fixed[e] || Number.isFinite(i[e]) || Number.isFinite(a[e])) && (g = !1);
+		let _ = Math.PI * (3 - Math.sqrt(5)), v = Math.max(10, t.linkDistance * .35);
+		for (let e = 0; e < n; e++) {
+			if (!(Number.isFinite(i[e]) && Number.isFinite(a[e]))) {
+				let t = v * Math.sqrt(.5 + e), n = e * _;
+				i[e] = t * Math.cos(n) + m(), a[e] = t * Math.sin(n) + m();
+			}
+			t.fixed[e] && (d[e] = 1, l[e] = i[e], u[e] = a[e]);
+		}
+		let y = t.source.length, b = t.source, x = t.target, S = new Int32Array(n);
+		for (let e = 0; e < y; e++) S[b[e]]++, S[x[e]]++;
+		let C = new Float64Array(y), ee = new Float64Array(y);
+		for (let e = 0; e < y; e++) {
+			let n = S[b[e]], r = S[x[e]];
+			C[e] = n / (n + r);
+			let i = Number.isFinite(t.linkStrength) ? t.linkStrength : 1 / Math.min(n, r);
+			ee[e] = i * (t.weight[e] || 1);
+		}
+		let w = t.alpha > 0 ? t.alpha : 1, T = .001, E = 1 - T ** (1 / Math.max(1, t.iterations)), D = 0, te = t.theta, ne = t.charge, O = new Float64Array(n);
+		for (let e = 0; e < n; e++) O[e] = ne * (h ? h[e] : 1);
+		let k = t.collide, A = 0;
+		for (let e = 0; e < n; e++) A = Math.max(A, o[e]);
+		let j = null, M = g ? new Int32Array(n).fill(-1) : null, N = g ? new Float64Array(n) : null, P = g ? new Float64Array(n) : null;
+		if (M && N && P) {
+			let i = new Int32Array(n);
+			for (let e = 0; e < y; e++) b[e] !== x[e] && (i[b[e]]++, i[x[e]]++);
+			let a = new Int32Array(n + 1);
+			for (let e = 0; e < n; e++) a[e + 1] = a[e] + i[e];
+			let s = new Int32Array(a[n]), c = a.slice(0, n);
+			for (let e = 0; e < y; e++) b[e] !== x[e] && (s[c[b[e]]++] = x[e], s[c[x[e]]++] = b[e]);
+			let l = 0;
+			for (let e = 0; e < n; e++) l = Math.max(l, i[e]);
+			let u = new Int32Array(l + 2);
+			for (let e = 0; e < n; e++) u[i[e] + 1]++;
+			for (let e = 0; e <= l; e++) u[e + 1] += u[e];
+			let d = new Int32Array(n);
+			for (let e = 0; e < n; e++) d[u[i[e]]++] = e;
+			let f = (e) => h ? h[e] : 1, m = new Int32Array(n), g = 0;
+			for (let e = 0; e < n; e++) {
+				let t = d[e];
+				if (M[t] >= 0) continue;
+				let n = -1;
+				for (let e = a[t]; e < a[t + 1]; e++) {
+					let r = s[e];
+					r === t || M[r] >= 0 || (n < 0 || f(r) < f(n)) && (n = r);
+				}
+				n < 0 || (M[t] = M[n] = g, m[g++] = 2);
+			}
+			for (let e = 0; e < n; e++) {
+				let t = d[e];
+				if (M[t] >= 0) continue;
+				let n = -1;
+				for (let e = a[t]; e < a[t + 1]; e++) {
+					let r = M[s[e]];
+					r < 0 || i[t] > 1 && m[r] >= 3 || (n < 0 || m[r] < m[n]) && (n = r);
+				}
+				n >= 0 ? (M[t] = n, m[n]++) : (M[t] = g, m[g++] = 1);
+			}
+			if (g <= n * .8) {
+				let i = new Float64Array(g), a = new Float64Array(g);
+				for (let e = 0; e < n; e++) i[M[e]] += f(e), a[M[e]] += o[e] * o[e];
+				for (let e = 0; e < g; e++) a[e] = Math.sqrt(a[e]);
+				let s = [];
+				for (let e = 0; e < y; e++) {
+					let t = M[b[e]], n = M[x[e]];
+					t !== n && s.push(t < n ? t * g + n : n * g + t);
+				}
+				let c = Float64Array.from(s).sort(), l = [], u = [];
+				for (let e = 0; e < c.length; e++) e && c[e] === c[e - 1] || (l.push(Math.floor(c[e] / g)), u.push(c[e] % g));
+				j = e({
+					...t,
+					n: g,
+					x: new Float64Array(g).fill(NaN),
+					y: new Float64Array(g).fill(NaN),
+					radius: a,
+					fixed: new Uint8Array(g),
+					source: Int32Array.from(l),
+					target: Int32Array.from(u),
+					weight: new Float64Array(l.length).fill(1),
+					mass: i,
+					alpha: 1
+				});
+				for (let e = 0; e < n; e++) {
+					let n = p() * Math.PI * 2, r = (t.linkDistance * .5 + o[e]) * (.4 + .6 * p());
+					N[e] = Math.cos(n) * r, P[e] = Math.sin(n) * r;
+				}
+				w = Math.min(w, r), E = 1 - (T / w) ** (1 / Math.max(1, Math.round(t.iterations * .15)));
+			}
+		}
+		let F = () => {
+			if (!j || !M || !N || !P) return;
+			let e = j.x, t = j.y;
+			for (let r = 0; r < n; r++) i[r] = e[M[r]] + N[r], a[r] = t[M[r]] + P[r];
+		}, I = () => {
+			F(), j = null;
+		};
+		F();
+		let L = 0, R = /* @__PURE__ */ new Float64Array(), z = /* @__PURE__ */ new Float64Array(), B = /* @__PURE__ */ new Float64Array(), V = /* @__PURE__ */ new Int32Array(), H = /* @__PURE__ */ new Int32Array(), U = /* @__PURE__ */ new Uint8Array(), W = /* @__PURE__ */ new Float64Array(), G = /* @__PURE__ */ new Float64Array(), K = /* @__PURE__ */ new Float64Array(), q = new Int32Array(n), J = 0, re = (e) => {
+			if (e <= L) return;
+			let t = Math.max(e, L * 2, 64), n = (e) => {
+				let n = new Float64Array(t);
+				return n.set(e), n;
+			};
+			R = n(R), z = n(z), B = n(B), W = n(W), G = n(G), K = n(K);
+			let r = new Int32Array(t * 4);
+			r.set(V), V = r;
+			let i = new Int32Array(t);
+			i.set(H), H = i;
+			let a = new Uint8Array(t);
+			a.set(U), U = a, L = t;
+		}, ie = (e, t, n) => {
+			re(J + 1);
+			let r = J++;
+			return R[r] = e, z[r] = t, B[r] = n, V[r * 4] = -1, V[r * 4 + 1] = -1, V[r * 4 + 2] = -1, V[r * 4 + 3] = -1, H[r] = -1, U[r] = 0, r;
+		}, ae = (e, t, n) => {
+			let r = B[e] / 2;
+			return +(t >= R[e] + r) | (n >= z[e] + r ? 2 : 0);
+		}, oe = (e, t) => {
+			let n = B[e] / 2;
+			return ie(R[e] + (t & 1 ? n : 0), z[e] + (t & 2 ? n : 0), n);
+		}, se = (e) => {
+			let t = 0, n = i[e], r = a[e];
+			for (let o = 0;; o++) {
+				if (U[t]) {
+					let i = ae(t, n, r), a = V[t * 4 + i];
+					if (a < 0) {
+						a = oe(t, i), V[t * 4 + i] = a, H[a] = e, q[e] = -1;
+						return;
+					}
+					t = a;
+					continue;
+				}
+				let s = H[t];
+				if (s < 0) {
+					H[t] = e, q[e] = -1;
+					return;
+				}
+				if (i[s] === n && a[s] === r || o > 48) {
+					q[e] = s, H[t] = e;
+					return;
+				}
+				H[t] = -1, U[t] = 1;
+				let c = ae(t, i[s], a[s]), l = oe(t, c);
+				V[t * 4 + c] = l, H[l] = s;
+			}
+		}, ce = () => {
+			let e = Infinity, t = Infinity, r = -Infinity, o = -Infinity;
+			for (let s = 0; s < n; s++) i[s] < e && (e = i[s]), i[s] > r && (r = i[s]), a[s] < t && (t = a[s]), a[s] > o && (o = a[s]);
+			let s = Math.max(r - e, o - t, 1) * 1.0001 + 1e-6;
+			J = 0, re(n * 2 + 8), ie(e, t, s);
+			for (let e = 0; e < n; e++) se(e);
+			for (let e = J - 1; e >= 0; e--) if (U[e]) {
+				let t = 0, n = 0, r = 0, i = 0;
+				for (let a = 0; a < 4; a++) {
+					let o = V[e * 4 + a];
+					if (o < 0) continue;
+					let s = Math.abs(W[o]);
+					t += W[o], n += s, r += s * G[o], i += s * K[o];
+				}
+				W[e] = t, G[e] = n ? r / n : R[e], K[e] = n ? i / n : z[e];
+			} else {
+				let t = 0;
+				for (let n = H[e]; n >= 0; n = q[n]) t += O[n];
+				W[e] = t, G[e] = i[H[e]], K[e] = a[H[e]];
+			}
+		}, Y = /* @__PURE__ */ new Int32Array(256), le = new Int32Array(n), ue = () => {
+			if (!ne || n < 2) return;
+			ce();
+			let e = te * (1 + .5 * Math.min(1, w / r)), t = 1 / (e * e), o = 0, l = 0;
+			for (Y[l++] = 0; l;) {
+				let e = Y[--l];
+				if (U[e]) {
+					if (l + 4 > Y.length) {
+						let e = new Int32Array(Y.length * 2);
+						e.set(Y), Y = e;
+					}
+					for (let t = 0; t < 4; t++) {
+						let n = V[e * 4 + t];
+						n >= 0 && (Y[l++] = n);
+					}
+				} else for (let t = H[e]; t >= 0; t = q[t]) le[o++] = t;
+			}
+			for (let e = 0; e < o; e++) {
+				let n = le[e], r = i[n], o = a[n];
+				for (l = 0, Y[l++] = 0; l;) {
+					let e = Y[--l];
+					if (W[e]) {
+						if (U[e]) {
+							let i = G[e] - r, a = K[e] - o, u = B[e], d = i * i + a * a;
+							if (u * u * t < d) {
+								d < 1 && (d = Math.sqrt(d));
+								let t = W[e] * w / d;
+								s[n] += i * t, c[n] += a * t;
+								continue;
+							}
+							if (l + 4 > Y.length) {
+								let e = new Int32Array(Y.length * 2);
+								e.set(Y), Y = e;
+							}
+							for (let t = 0; t < 4; t++) {
+								let n = V[e * 4 + t];
+								n >= 0 && (Y[l++] = n);
+							}
+						} else for (let t = H[e]; t >= 0; t = q[t]) {
+							if (t === n) continue;
+							let e = i[t] - r, l = a[t] - o, u = e * e + l * l;
+							e === 0 && (e = m(), u += e * e), l === 0 && (l = m(), u += l * l), u < 1 && (u = Math.sqrt(u));
+							let d = O[t] * w / u;
+							s[n] += e * d, c[n] += l * d;
+						}
+					}
+				}
+			}
+		}, de = () => {
+			let e = t.linkDistance;
+			for (let t = 0; t < y; t++) {
+				let n = b[t], r = x[t];
+				if (n === r) continue;
+				let l = i[r] + s[r] - i[n] - s[n] || m(), u = a[r] + c[r] - a[n] - c[n] || m(), d = Math.sqrt(l * l + u * u);
+				d = (d - e - o[n] - o[r]) / d * w * ee[t], l *= d, u *= d;
+				let f = C[t];
+				s[r] -= l * f, c[r] -= u * f, s[n] += l * (1 - f), c[n] += u * (1 - f);
+			}
+		}, fe = () => {
+			let e = t.gravity * w;
+			if (!e) return;
+			let r = Math.sqrt(Math.max(.25, Math.min(4, t.aspect > 0 ? t.aspect : 1))), o = e / r, l = e * r;
+			for (let e = 0; e < n; e++) s[e] -= i[e] * o, c[e] -= a[e] * l;
+		}, X = 1;
+		for (; X < n * 2;) X <<= 1;
+		let Z = new Int32Array(X + 1), pe = new Int32Array(n), me = new Int32Array(n), he = (e, t) => (Math.imul(e, 73856093) ^ Math.imul(t, 19349663)) & X - 1, ge = (e, t, r) => {
+			let i = Math.max(1e-6, (A + r) * 2);
+			Z.fill(0);
+			for (let r = 0; r < n; r++) {
+				let n = he(Math.floor(e[r] / i), Math.floor(t[r] / i));
+				me[r] = n, Z[n + 1]++;
+			}
+			for (let e = 0; e < X; e++) Z[e + 1] += Z[e];
+			let a = Z.slice(0, X);
+			for (let e = 0; e < n; e++) pe[a[me[e]]++] = e;
+			return i;
+		}, Q = new Int32Array(X).fill(-1), _e = (e, t, r, i) => {
+			let a = ge(e, t, r);
+			Q.fill(-1);
+			for (let r = 0; r < n; r++) {
+				let n = Math.floor(e[r] / a), o = Math.floor(t[r] / a);
+				for (let e = -1; e <= 1; e++) for (let t = -1; t <= 1; t++) {
+					let a = he(n + t, o + e);
+					if (Q[a] !== r) {
+						Q[a] = r;
+						for (let e = Z[a]; e < Z[a + 1]; e++) {
+							let t = pe[e];
+							t > r && i(r, t);
+						}
+					}
+				}
+			}
+		}, ve = new Float64Array(n), ye = new Float64Array(n), be = () => {
+			if (!(k < 0 || n < 2)) {
+				for (let e = 0; e < n; e++) ve[e] = i[e] + s[e], ye[e] = a[e] + c[e];
+				_e(ve, ye, k, (e, t) => {
+					let n = o[e] + k, r = o[t] + k, l = n + r, u = i[e] + s[e] - i[t] - s[t], d = a[e] + c[e] - a[t] - c[t], f = u * u + d * d;
+					if (f >= l * l) return;
+					u === 0 && (u = m(), f += u * u), d === 0 && (d = m(), f += d * d);
+					let p = Math.sqrt(f), h = (l - p) / p * .7;
+					u *= h, d *= h;
+					let g = r * r, _ = g / (n * n + g);
+					s[e] += u * _, c[e] += d * _, s[t] -= u * (1 - _), c[t] -= d * (1 - _);
+				});
+			}
+		}, xe = () => {
+			let e = 0, t = 0;
+			for (let r = 0; r < n; r++) {
+				if (!Number.isNaN(l[r])) return;
+				e += i[r], t += a[r];
+			}
+			e /= n || 1, t /= n || 1;
+			for (let r = 0; r < n; r++) i[r] -= e, a[r] -= t;
+		}, Se = t.aspect > 0 ? t.aspect : 1, Ce = t.alpha >= 1 && n > 2 && Math.abs(Math.log(Se)) > .15, we = () => {
+			let e = 0, t = 0, r = 0;
+			for (let o = 0; o < n; o++) {
+				if (!Number.isNaN(l[o])) return;
+				e += i[o] * i[o], t += a[o] * a[o], r += i[o] * a[o];
+			}
+			if (Math.hypot(e - t, 2 * r) < (e + t) * .04) return;
+			let o = .5 * Math.atan2(2 * r, e - t), u = (Se > 1 ? 0 : Math.PI / 2) - o;
+			if (u > Math.PI / 2 && (u -= Math.PI), u < -Math.PI / 2 && (u += Math.PI), u *= .12, Math.abs(u) < 1e-5) return;
+			let d = Math.cos(u), f = Math.sin(u);
+			for (let e = 0; e < n; e++) {
+				let t = i[e], n = s[e];
+				i[e] = t * d - a[e] * f, a[e] = t * f + a[e] * d, s[e] = n * d - c[e] * f, c[e] = n * f + c[e] * d;
+			}
+		}, Te = () => {
+			w += (D - w) * E, de(), ue(), fe(), be();
+			let e = 1 - t.velocityDecay;
+			for (let t = 0; t < n; t++) Number.isNaN(l[t]) ? (s[t] *= e, c[t] *= e, i[t] += s[t], a[t] += c[t]) : (i[t] = l[t], a[t] = u[t], s[t] = c[t] = 0);
+			xe(), Ce && we();
+		}, $ = () => !j && w < T && D === 0;
+		return {
+			x: i,
+			y: a,
+			tick(e = 1) {
+				for (let t = 0; t < e; t++) {
+					if (j) {
+						j.tick(1) ? F() : I();
+						continue;
+					}
+					if ($()) return !1;
+					Te();
+				}
+				return !$();
+			},
+			alpha: () => j ? Math.max(w, j.alpha()) : w,
+			reheat(e = .3) {
+				j && I(), w = Math.max(w, e);
+			},
+			drag(e, t, r) {
+				e < 0 || e >= n || (j && I(), l[e] = i[e] = t, u[e] = a[e] = r, D = .3, w < .3 && (w = .3));
+			},
+			release(e, t) {
+				D = 0, !(e < 0 || e >= n || t || d[e]) && (l[e] = NaN, u[e] = NaN);
+			},
+			done: $,
+			settle() {
+				let e = Math.max(0, k);
+				for (let t = 0; t < 80; t++) {
+					let t = !1;
+					if (_e(i, a, e, (n, r) => {
+						let s = o[n] + o[r] + e * 2, c = i[n] - i[r], u = a[n] - a[r], d = c * c + u * u;
+						if (d >= s * s * .9999) return;
+						d === 0 && (c = p() - .5, u = p() - .5, d = c * c + u * u);
+						let f = Math.sqrt(d), m = (s - f) / f, h = +!!Number.isNaN(l[n]), g = +!!Number.isNaN(l[r]);
+						if (!h && !g) return;
+						let _ = h / (h + g), v = g / (h + g);
+						i[n] += c * m * _ * 1.001, a[n] += u * m * _ * 1.001, i[r] -= c * m * v * 1.001, a[r] -= u * m * v * 1.001, t = !0;
+					}), !t) break;
+				}
+			}
+		};
+	};
+}
+var t = {
+	linkDistance: 60,
+	charge: -160,
+	theta: .9,
+	gravity: .04,
+	collide: 2,
+	velocityDecay: .4,
+	iterations: 300,
+	seed: 1,
+	multilevel: 400
+}, n = (e, n, r, i, a = {}) => {
+	let o = i ?? {}, s = o.collide === !1 ? -1 : typeof o.collide == "number" ? Math.max(0, o.collide) : t.collide;
+	return {
+		n: e,
+		x: a.x ?? new Float64Array(e).fill(NaN),
+		y: a.y ?? new Float64Array(e).fill(NaN),
+		radius: a.radius ?? new Float64Array(e).fill(6),
+		fixed: a.fixed ?? new Uint8Array(e),
+		source: n,
+		target: r,
+		weight: a.weight ?? new Float64Array(n.length).fill(1),
+		linkDistance: o.linkDistance ?? t.linkDistance,
+		linkStrength: o.linkStrength ?? NaN,
+		charge: o.charge ?? t.charge,
+		theta: o.theta ?? t.theta,
+		gravity: o.gravity ?? t.gravity,
+		collide: s,
+		velocityDecay: o.velocityDecay ?? t.velocityDecay,
+		iterations: o.iterations ?? t.iterations,
+		seed: o.seed ?? t.seed,
+		alpha: a.alpha ?? 1,
+		aspect: a.aspect ?? 1,
+		coarsen: o.multilevel === !1 ? 0 : t.multilevel
+	};
+}, r = (e, t) => {
+	let n = /* @__PURE__ */ new Map();
+	e.forEach((e, t) => {
+		n.has(e.id) || n.set(e.id, t);
+	});
+	let r = [], i = [], a = [];
+	return t.forEach((e, t) => {
+		let o = n.get(e.source), s = n.get(e.target);
+		o !== void 0 && s !== void 0 && (r.push(o), i.push(s), a.push(t));
+	}), {
+		index: n,
+		source: Int32Array.from(r),
+		target: Int32Array.from(i),
+		edge: Int32Array.from(a)
+	};
+}, i = (t, i, a) => {
+	let { source: o, target: s, edge: c } = r(t, i), l = t.length, u = new Float64Array(l).fill(NaN), d = new Float64Array(l).fill(NaN), f = new Uint8Array(l), p = new Float64Array(l);
+	t.forEach((e, t) => {
+		Number.isFinite(e.x) && Number.isFinite(e.y) && (u[t] = e.x, d[t] = e.y, e.fixed && (f[t] = 1)), p[t] = a?.radius?.(e, t) ?? 6;
+	});
+	let m = Array.from(c, (e) => i[e].value), h = m.filter((e) => Number.isFinite(e) && e > 0), g = h.length ? h.reduce((e, t) => e + t, 0) / h.length : 1, _ = Float64Array.from(m, (e) => Number.isFinite(e) && e > 0 ? Math.max(.5, Math.min(2, Math.sqrt(e / g))) : 1);
+	return e()(n(l, o, s, a, {
+		x: u,
+		y: d,
+		fixed: f,
+		radius: p,
+		weight: _
+	}));
+}, a = (e, t, n) => i(e, t, n), o = (e, t, n) => {
+	let r = i(e, t, n);
+	for (; r.tick(16););
+	return r.settle(), {
+		x: r.x,
+		y: r.y
+	};
+};
+//#endregion
+export { t as FORCE_DEFAULTS, a as createForceSimulation, n as forceInit, e as forceKernel, o as forceLayout, r as indexGraph };
+
+//# sourceMappingURL=force.js.map

package/dist/charts/engine/graph/force.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"force.js","names":["forceKernel","createSim","init","REFINE_ALPHA","x","y","radius","vx","vy","fx","fy","pinned","seed","random","t","jiggle","mass","fresh","i","angle","spread","r","a","m","src","tgt","count","l","bias","strength","b","base","alpha","alphaMin","alphaDecay","alphaTarget","theta","charge","nodeCharge","collidePad","maxRadius","coarse","group","offsetX","offsetY","degree","adjStart","adj","fill","maxDegree","byDegree","d","order","weightOf","size","cn","o","u","best","v","g","cmass","cradius","keys","sorted","cs","ct","k","project","cx","cy","finishCoarse","cap","qx0","qy0","qsize","qchild","qpoint","qinner","qmass","qcx","qcy","nextPoint","qcount","grow","need","next","copyF","c","p","q","newQuad","x0","y0","quadrant","half","py","childQuad","insert","px","depth","j","buildTree","x1","y1","weight","sx","sy","w","stack","spatial","manyBody","open","top","s","xi","yi","dx","dy","f","links","distance","gravity","stretch","gx","gy","tableSize","cellStart","cellItems","cellOf","hash","bucket","cell","pad","h","fillAt","visited","eachPair","oy","ox","pair","collide","ri","rj","rj2","share","center","aspect","orient","align","sxx","syy","sxy","axis","turn","pvx","step","decay","done","value","px2","py2","keep","pass","moved","push","fi","fj","si","sj","FORCE_DEFAULTS","forceInit","options","extra","n","source","indexGraph","index","node","e","edges","edge","simulationOf","nodes","fixed","values","known","mean","target","createForceSimulation","forceLayout","sim"],"sources":["../../../../../charts/src/engine/graph/force.ts"],"sourcesContent":["// Force-directed layout: Barnes–Hut many-body (flat quadtree), links (d3\n// semantics), gravity, centering and collisions (hash grid), with alpha\n// cooling and a deterministic seed. `forceKernel` is self-contained (no\n// reference to anything outside its body): it is serialized into the Web\n// Worker of large graphs (see worker.ts).\n\nimport type {\n  GraphForceLayoutOptions,\n  GraphForceSimulation,\n  GraphEdge,\n  GraphLayoutResult,\n  GraphNode,\n} from \"./types\";\n\n/** Data of a simulation (index-based, transferable to a worker) */\nexport interface ForceKernelInit {\n  n: number;\n  /** Initial positions (NaN = automatic) */\n  x: Float64Array;\n  y: Float64Array;\n  radius: Float64Array;\n  /** 1 = pinned at its initial position */\n  fixed: Uint8Array;\n  source: Int32Array;\n  target: Int32Array;\n  /** Strength multiplier per link */\n  weight: Float64Array;\n  linkDistance: number;\n  /** NaN = 1 / min(degree) */\n  linkStrength: number;\n  charge: number;\n  theta: number;\n  gravity: number;\n  /** Extra spacing of the collisions; negative disables them */\n  collide: number;\n  velocityDecay: number;\n  iterations: number;\n  seed: number;\n  /** Starting temperature (1 for a new layout, lower to refine one) */\n  alpha: number;\n  /** Width / height of the view: gravity stretches the layout to it */\n  aspect: number;\n  /** Charge multiplier per node (merged nodes of a coarse level) */\n  mass?: Float64Array;\n  /**\n   * Multilevel start: a fresh layout of at least this many nodes is first\n   * computed on a coarsened graph (0 = never)\n   */\n  coarsen?: number;\n}\n\nexport type ForceKernel = (init: ForceKernelInit) => GraphForceSimulation;\n\n/** Returns the simulation factory (self-contained: serialized into workers) */\nexport function forceKernel(): ForceKernel {\n  return function createSim(init: ForceKernelInit): GraphForceSimulation {\n    const n = init.n;\n    // multilevel refinement: starting temperature and share of `iterations`\n    const REFINE_ALPHA = 0.3;\n    const REFINE_SHARE = 0.15;\n    const THETA_BOOST = 0.5;\n    const x = init.x;\n    const y = init.y;\n    const radius = init.radius;\n    const vx = new Float64Array(n);\n    const vy = new Float64Array(n);\n    const fx = new Float64Array(n).fill(NaN);\n    const fy = new Float64Array(n).fill(NaN);\n    const pinned = new Uint8Array(n);\n    let seed = init.seed | 0 || 1;\n    const random = () => {\n      // mulberry32\n      seed = (seed + 0x6d2b79f5) | 0;\n      let t = Math.imul(seed ^ (seed >>> 15), 1 | seed);\n      t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;\n      return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n    };\n    const jiggle = () => (random() - 0.5) * 1e-6;\n    const mass = init.mass;\n\n    // a fresh layout (no known position) of a large graph starts from the\n    // layout of a coarsened graph\n    let fresh = init.alpha >= 1 && n >= (init.coarsen || Infinity);\n    for (let i = 0; i < n && fresh; i++)\n      if (init.fixed[i] || Number.isFinite(x[i]) || Number.isFinite(y[i]))\n        fresh = false;\n\n    // phyllotaxis start (like d3), seeded jitter keeps it deterministic\n    const angle = Math.PI * (3 - Math.sqrt(5));\n    const spread = Math.max(10, init.linkDistance * 0.35);\n    for (let i = 0; i < n; i++) {\n      if (!(Number.isFinite(x[i]) && Number.isFinite(y[i]))) {\n        const r = spread * Math.sqrt(0.5 + i);\n        const a = i * angle;\n        x[i] = r * Math.cos(a) + jiggle();\n        y[i] = r * Math.sin(a) + jiggle();\n      }\n      if (init.fixed[i]) {\n        pinned[i] = 1;\n        fx[i] = x[i];\n        fy[i] = y[i];\n      }\n    }\n\n    // links\n    const m = init.source.length;\n    const src = init.source;\n    const tgt = init.target;\n    const count = new Int32Array(n);\n    for (let l = 0; l < m; l++) {\n      count[src[l]]++;\n      count[tgt[l]]++;\n    }\n    const bias = new Float64Array(m);\n    const strength = new Float64Array(m);\n    for (let l = 0; l < m; l++) {\n      const a = count[src[l]];\n      const b = count[tgt[l]];\n      bias[l] = a / (a + b);\n      const base = Number.isFinite(init.linkStrength)\n        ? init.linkStrength\n        : 1 / Math.min(a, b);\n      strength[l] = base * (init.weight[l] || 1);\n    }\n\n    let alpha = init.alpha > 0 ? init.alpha : 1;\n    const alphaMin = 0.001;\n    let alphaDecay = 1 - Math.pow(alphaMin, 1 / Math.max(1, init.iterations));\n    let alphaTarget = 0;\n    const theta = init.theta;\n    const charge = init.charge;\n    const nodeCharge = new Float64Array(n);\n    for (let i = 0; i < n; i++) nodeCharge[i] = charge * (mass ? mass[i] : 1);\n    const collidePad = init.collide;\n    let maxRadius = 0;\n    for (let i = 0; i < n; i++) maxRadius = Math.max(maxRadius, radius[i]);\n\n    // ---- multilevel start: neighbors are merged (a matching, then the\n    // leftover nodes join a neighbor's group), the coarse graph is laid out\n    // by a nested simulation (recursively coarsened), then its positions are\n    // spread to the members and refined with a short cooling\n    let coarse: GraphForceSimulation | null = null;\n    const group = fresh ? new Int32Array(n).fill(-1) : null;\n    const offsetX = fresh ? new Float64Array(n) : null;\n    const offsetY = fresh ? new Float64Array(n) : null;\n    if (group && offsetX && offsetY) {\n      const degree = new Int32Array(n);\n      for (let l = 0; l < m; l++) {\n        if (src[l] === tgt[l]) continue;\n        degree[src[l]]++;\n        degree[tgt[l]]++;\n      }\n      const adjStart = new Int32Array(n + 1);\n      for (let i = 0; i < n; i++) adjStart[i + 1] = adjStart[i] + degree[i];\n      const adj = new Int32Array(adjStart[n]);\n      const fill = adjStart.slice(0, n);\n      for (let l = 0; l < m; l++) {\n        if (src[l] === tgt[l]) continue;\n        adj[fill[src[l]]++] = tgt[l];\n        adj[fill[tgt[l]]++] = src[l];\n      }\n      // nodes by increasing degree (counting sort): leaves pair with hubs\n      let maxDegree = 0;\n      for (let i = 0; i < n; i++) maxDegree = Math.max(maxDegree, degree[i]);\n      const byDegree = new Int32Array(maxDegree + 2);\n      for (let i = 0; i < n; i++) byDegree[degree[i] + 1]++;\n      for (let d = 0; d <= maxDegree; d++) byDegree[d + 1] += byDegree[d];\n      const order = new Int32Array(n);\n      for (let i = 0; i < n; i++) order[byDegree[degree[i]]++] = i;\n      const weightOf = (i: number) => (mass ? mass[i] : 1);\n      const size = new Int32Array(n);\n      let cn = 0;\n      for (let o = 0; o < n; o++) {\n        const u = order[o];\n        if (group[u] >= 0) continue;\n        let best = -1;\n        for (let a = adjStart[u]; a < adjStart[u + 1]; a++) {\n          const v = adj[a];\n          if (v === u || group[v] >= 0) continue;\n          if (best < 0 || weightOf(v) < weightOf(best)) best = v;\n        }\n        if (best < 0) continue;\n        group[u] = group[best] = cn;\n        size[cn++] = 2;\n      }\n      for (let o = 0; o < n; o++) {\n        const u = order[o];\n        if (group[u] >= 0) continue;\n        let best = -1;\n        for (let a = adjStart[u]; a < adjStart[u + 1]; a++) {\n          const g = group[adj[a]];\n          // leaves always join their neighbor (\"solar systems\")\n          if (g < 0 || (degree[u] > 1 && size[g] >= 3)) continue;\n          if (best < 0 || size[g] < size[best]) best = g;\n        }\n        if (best >= 0) {\n          group[u] = best;\n          size[best]++;\n        } else {\n          group[u] = cn;\n          size[cn++] = 1;\n        }\n      }\n      if (cn <= n * 0.8) {\n        const cmass = new Float64Array(cn);\n        const cradius = new Float64Array(cn);\n        for (let i = 0; i < n; i++) {\n          cmass[group[i]] += weightOf(i);\n          cradius[group[i]] += radius[i] * radius[i];\n        }\n        for (let g = 0; g < cn; g++) cradius[g] = Math.sqrt(cradius[g]);\n        // coarse links: deduplicated pairs of groups\n        const keys: number[] = [];\n        for (let l = 0; l < m; l++) {\n          const a = group[src[l]];\n          const b = group[tgt[l]];\n          if (a !== b) keys.push(a < b ? a * cn + b : b * cn + a);\n        }\n        const sorted = Float64Array.from(keys).sort();\n        const cs: number[] = [];\n        const ct: number[] = [];\n        for (let k = 0; k < sorted.length; k++) {\n          if (k && sorted[k] === sorted[k - 1]) continue;\n          cs.push(Math.floor(sorted[k] / cn));\n          ct.push(sorted[k] % cn);\n        }\n        coarse = createSim({\n          ...init,\n          n: cn,\n          x: new Float64Array(cn).fill(NaN),\n          y: new Float64Array(cn).fill(NaN),\n          radius: cradius,\n          fixed: new Uint8Array(cn),\n          source: Int32Array.from(cs),\n          target: Int32Array.from(ct),\n          weight: new Float64Array(cs.length).fill(1),\n          mass: cmass,\n          alpha: 1,\n        });\n        // members spread around their group, a refinement finishes the layout\n        for (let i = 0; i < n; i++) {\n          const a = random() * Math.PI * 2;\n          const d =\n            (init.linkDistance * 0.5 + radius[i]) * (0.4 + 0.6 * random());\n          offsetX[i] = Math.cos(a) * d;\n          offsetY[i] = Math.sin(a) * d;\n        }\n        alpha = Math.min(alpha, REFINE_ALPHA);\n        alphaDecay =\n          1 -\n          Math.pow(\n            alphaMin / alpha,\n            1 / Math.max(1, Math.round(init.iterations * REFINE_SHARE)),\n          );\n      }\n    }\n    const project = () => {\n      if (!coarse || !group || !offsetX || !offsetY) return;\n      const cx = coarse.x;\n      const cy = coarse.y;\n      for (let i = 0; i < n; i++) {\n        x[i] = cx[group[i]] + offsetX[i];\n        y[i] = cy[group[i]] + offsetY[i];\n      }\n    };\n    const finishCoarse = () => {\n      project();\n      coarse = null;\n    };\n    project();\n\n    // ---- flat quadtree (rebuilt every tick)\n    let cap = 0;\n    let qx0 = new Float64Array(0);\n    let qy0 = new Float64Array(0);\n    let qsize = new Float64Array(0);\n    let qchild = new Int32Array(0);\n    let qpoint = new Int32Array(0);\n    let qinner = new Uint8Array(0);\n    let qmass = new Float64Array(0);\n    let qcx = new Float64Array(0);\n    let qcy = new Float64Array(0);\n    const nextPoint = new Int32Array(n);\n    let qcount = 0;\n\n    const grow = (need: number) => {\n      if (need <= cap) return;\n      const next = Math.max(need, cap * 2, 64);\n      const copyF = (a: Float64Array) => {\n        const b = new Float64Array(next);\n        b.set(a);\n        return b;\n      };\n      qx0 = copyF(qx0);\n      qy0 = copyF(qy0);\n      qsize = copyF(qsize);\n      qmass = copyF(qmass);\n      qcx = copyF(qcx);\n      qcy = copyF(qcy);\n      const c = new Int32Array(next * 4);\n      c.set(qchild);\n      qchild = c;\n      const p = new Int32Array(next);\n      p.set(qpoint);\n      qpoint = p;\n      const q = new Uint8Array(next);\n      q.set(qinner);\n      qinner = q;\n      cap = next;\n    };\n\n    const newQuad = (x0: number, y0: number, size: number) => {\n      grow(qcount + 1);\n      const q = qcount++;\n      qx0[q] = x0;\n      qy0[q] = y0;\n      qsize[q] = size;\n      qchild[q * 4] = -1;\n      qchild[q * 4 + 1] = -1;\n      qchild[q * 4 + 2] = -1;\n      qchild[q * 4 + 3] = -1;\n      qpoint[q] = -1;\n      qinner[q] = 0;\n      return q;\n    };\n\n    const quadrant = (q: number, px: number, py: number) => {\n      const half = qsize[q] / 2;\n      return (px >= qx0[q] + half ? 1 : 0) | (py >= qy0[q] + half ? 2 : 0);\n    };\n\n    const childQuad = (q: number, k: number) => {\n      const half = qsize[q] / 2;\n      return newQuad(\n        qx0[q] + (k & 1 ? half : 0),\n        qy0[q] + (k & 2 ? half : 0),\n        half,\n      );\n    };\n\n    const insert = (i: number) => {\n      let q = 0;\n      const px = x[i];\n      const py = y[i];\n      for (let depth = 0; ; depth++) {\n        if (qinner[q]) {\n          const k = quadrant(q, px, py);\n          let c = qchild[q * 4 + k];\n          if (c < 0) {\n            c = childQuad(q, k);\n            qchild[q * 4 + k] = c;\n            qpoint[c] = i;\n            nextPoint[i] = -1;\n            return;\n          }\n          q = c;\n          continue;\n        }\n        const j = qpoint[q];\n        if (j < 0) {\n          qpoint[q] = i;\n          nextPoint[i] = -1;\n          return;\n        }\n        if ((x[j] === px && y[j] === py) || depth > 48) {\n          nextPoint[i] = j;\n          qpoint[q] = i;\n          return;\n        }\n        // split: the points of the leaf move to a child\n        qpoint[q] = -1;\n        qinner[q] = 1;\n        const k = quadrant(q, x[j], y[j]);\n        const c = childQuad(q, k);\n        qchild[q * 4 + k] = c;\n        qpoint[c] = j;\n      }\n    };\n\n    const buildTree = () => {\n      let x0 = Infinity;\n      let y0 = Infinity;\n      let x1 = -Infinity;\n      let y1 = -Infinity;\n      for (let i = 0; i < n; i++) {\n        if (x[i] < x0) x0 = x[i];\n        if (x[i] > x1) x1 = x[i];\n        if (y[i] < y0) y0 = y[i];\n        if (y[i] > y1) y1 = y[i];\n      }\n      const size = Math.max(x1 - x0, y1 - y0, 1) * 1.0001 + 1e-6;\n      qcount = 0;\n      grow(n * 2 + 8);\n      newQuad(x0, y0, size);\n      for (let i = 0; i < n; i++) insert(i);\n      // aggregates, children before parents\n      for (let q = qcount - 1; q >= 0; q--) {\n        if (qinner[q]) {\n          let mass = 0;\n          let weight = 0;\n          let sx = 0;\n          let sy = 0;\n          for (let k = 0; k < 4; k++) {\n            const c = qchild[q * 4 + k];\n            if (c < 0) continue;\n            const w = Math.abs(qmass[c]);\n            mass += qmass[c];\n            weight += w;\n            sx += w * qcx[c];\n            sy += w * qcy[c];\n          }\n          qmass[q] = mass;\n          qcx[q] = weight ? sx / weight : qx0[q];\n          qcy[q] = weight ? sy / weight : qy0[q];\n        } else {\n          let mass = 0;\n          for (let j = qpoint[q]; j >= 0; j = nextPoint[j])\n            mass += nodeCharge[j];\n          qmass[q] = mass;\n          qcx[q] = x[qpoint[q]];\n          qcy[q] = y[qpoint[q]];\n        }\n      }\n    };\n\n    let stack = new Int32Array(256);\n    const spatial = new Int32Array(n);\n    const manyBody = () => {\n      if (!charge || n < 2) return;\n      buildTree();\n      // adaptive accuracy: a hot layout moves a lot anyway, coarser\n      // approximations are enough; full accuracy when it cools down\n      const t = theta * (1 + THETA_BOOST * Math.min(1, alpha / REFINE_ALPHA));\n      const open = 1 / (t * t);\n      // nodes in tree order: neighbors walk the same cells (cache friendly)\n      let count = 0;\n      let top = 0;\n      stack[top++] = 0;\n      while (top) {\n        const q = stack[--top];\n        if (qinner[q]) {\n          if (top + 4 > stack.length) {\n            const s = new Int32Array(stack.length * 2);\n            s.set(stack);\n            stack = s;\n          }\n          for (let k = 0; k < 4; k++) {\n            const c = qchild[q * 4 + k];\n            if (c >= 0) stack[top++] = c;\n          }\n        } else {\n          for (let j = qpoint[q]; j >= 0; j = nextPoint[j])\n            spatial[count++] = j;\n        }\n      }\n      for (let o = 0; o < count; o++) {\n        const i = spatial[o];\n        const xi = x[i];\n        const yi = y[i];\n        top = 0;\n        stack[top++] = 0;\n        while (top) {\n          const q = stack[--top];\n          if (!qmass[q]) continue;\n          if (qinner[q]) {\n            const dx = qcx[q] - xi;\n            const dy = qcy[q] - yi;\n            const w = qsize[q];\n            let l = dx * dx + dy * dy;\n            if (w * w * open < l) {\n              if (l < 1) l = Math.sqrt(l);\n              const f = (qmass[q] * alpha) / l;\n              vx[i] += dx * f;\n              vy[i] += dy * f;\n              continue;\n            }\n            if (top + 4 > stack.length) {\n              const s = new Int32Array(stack.length * 2);\n              s.set(stack);\n              stack = s;\n            }\n            for (let k = 0; k < 4; k++) {\n              const c = qchild[q * 4 + k];\n              if (c >= 0) stack[top++] = c;\n            }\n          } else {\n            for (let j = qpoint[q]; j >= 0; j = nextPoint[j]) {\n              if (j === i) continue;\n              let dx = x[j] - xi;\n              let dy = y[j] - yi;\n              let l = dx * dx + dy * dy;\n              if (dx === 0) {\n                dx = jiggle();\n                l += dx * dx;\n              }\n              if (dy === 0) {\n                dy = jiggle();\n                l += dy * dy;\n              }\n              if (l < 1) l = Math.sqrt(l);\n              const f = (nodeCharge[j] * alpha) / l;\n              vx[i] += dx * f;\n              vy[i] += dy * f;\n            }\n          }\n        }\n      }\n    };\n\n    const links = () => {\n      const distance = init.linkDistance;\n      for (let l = 0; l < m; l++) {\n        const s = src[l];\n        const t = tgt[l];\n        if (s === t) continue;\n        let dx = x[t] + vx[t] - x[s] - vx[s] || jiggle();\n        let dy = y[t] + vy[t] - y[s] - vy[s] || jiggle();\n        let d = Math.sqrt(dx * dx + dy * dy);\n        d = ((d - distance - radius[s] - radius[t]) / d) * alpha * strength[l];\n        dx *= d;\n        dy *= d;\n        const b = bias[l];\n        vx[t] -= dx * b;\n        vy[t] -= dy * b;\n        vx[s] += dx * (1 - b);\n        vy[s] += dy * (1 - b);\n      }\n    };\n\n    const gravity = () => {\n      const g = init.gravity * alpha;\n      if (!g) return;\n      // a stronger pull along the short side of the view\n      const stretch = Math.sqrt(\n        Math.max(0.25, Math.min(4, init.aspect > 0 ? init.aspect : 1)),\n      );\n      const gx = g / stretch;\n      const gy = g * stretch;\n      for (let i = 0; i < n; i++) {\n        vx[i] -= x[i] * gx;\n        vy[i] -= y[i] * gy;\n      }\n    };\n\n    // ---- hash grid of the collisions\n    let tableSize = 1;\n    while (tableSize < n * 2) tableSize <<= 1;\n    const cellStart = new Int32Array(tableSize + 1);\n    const cellItems = new Int32Array(n);\n    const cellOf = new Int32Array(n);\n    const hash = (cx: number, cy: number) =>\n      (Math.imul(cx, 73856093) ^ Math.imul(cy, 19349663)) & (tableSize - 1);\n\n    /** Buckets the nodes by cell of (`px`, `py`); returns the cell size */\n    const bucket = (px: Float64Array, py: Float64Array, pad: number) => {\n      const cell = Math.max(1e-6, (maxRadius + pad) * 2);\n      cellStart.fill(0);\n      for (let i = 0; i < n; i++) {\n        const h = hash(Math.floor(px[i] / cell), Math.floor(py[i] / cell));\n        cellOf[i] = h;\n        cellStart[h + 1]++;\n      }\n      for (let h = 0; h < tableSize; h++) cellStart[h + 1] += cellStart[h];\n      const fillAt = cellStart.slice(0, tableSize);\n      for (let i = 0; i < n; i++) cellItems[fillAt[cellOf[i]]++] = i;\n      return cell;\n    };\n\n    const visited = new Int32Array(tableSize).fill(-1);\n\n    /** Calls `pair(i, j)` (i < j) for nodes in neighboring cells */\n    const eachPair = (\n      px: Float64Array,\n      py: Float64Array,\n      pad: number,\n      pair: (i: number, j: number) => void,\n    ) => {\n      const cell = bucket(px, py, pad);\n      visited.fill(-1);\n      for (let i = 0; i < n; i++) {\n        const cx = Math.floor(px[i] / cell);\n        const cy = Math.floor(py[i] / cell);\n        for (let oy = -1; oy <= 1; oy++) {\n          for (let ox = -1; ox <= 1; ox++) {\n            const h = hash(cx + ox, cy + oy);\n            // two neighbor cells may share a bucket: visit it once\n            if (visited[h] === i) continue;\n            visited[h] = i;\n            for (let k = cellStart[h]; k < cellStart[h + 1]; k++) {\n              const j = cellItems[k];\n              if (j > i) pair(i, j);\n            }\n          }\n        }\n      }\n    };\n\n    const px = new Float64Array(n);\n    const py = new Float64Array(n);\n    const collide = () => {\n      if (collidePad < 0 || n < 2) return;\n      for (let i = 0; i < n; i++) {\n        px[i] = x[i] + vx[i];\n        py[i] = y[i] + vy[i];\n      }\n      eachPair(px, py, collidePad, (i, j) => {\n        const ri = radius[i] + collidePad;\n        const rj = radius[j] + collidePad;\n        const r = ri + rj;\n        let dx = x[i] + vx[i] - x[j] - vx[j];\n        let dy = y[i] + vy[i] - y[j] - vy[j];\n        let l = dx * dx + dy * dy;\n        if (l >= r * r) return;\n        if (dx === 0) {\n          dx = jiggle();\n          l += dx * dx;\n        }\n        if (dy === 0) {\n          dy = jiggle();\n          l += dy * dy;\n        }\n        const d = Math.sqrt(l);\n        const f = ((r - d) / d) * 0.7;\n        dx *= f;\n        dy *= f;\n        const rj2 = rj * rj;\n        const share = rj2 / (ri * ri + rj2);\n        vx[i] += dx * share;\n        vy[i] += dy * share;\n        vx[j] -= dx * (1 - share);\n        vy[j] -= dy * (1 - share);\n      });\n    };\n\n    const center = () => {\n      let sx = 0;\n      let sy = 0;\n      for (let i = 0; i < n; i++) {\n        if (!Number.isNaN(fx[i])) return;\n        sx += x[i];\n        sy += y[i];\n      }\n      sx /= n || 1;\n      sy /= n || 1;\n      for (let i = 0; i < n; i++) {\n        x[i] -= sx;\n        y[i] -= sy;\n      }\n    };\n\n    // a fresh layout turns its long axis toward the long side of the view\n    // (rigid, so the forces are unchanged): wide boxes are filled, not just\n    // their middle\n    const aspect = init.aspect > 0 ? init.aspect : 1;\n    const orient =\n      init.alpha >= 1 && n > 2 && Math.abs(Math.log(aspect)) > 0.15;\n    const align = () => {\n      let sxx = 0;\n      let syy = 0;\n      let sxy = 0;\n      for (let i = 0; i < n; i++) {\n        if (!Number.isNaN(fx[i])) return;\n        sxx += x[i] * x[i];\n        syy += y[i] * y[i];\n        sxy += x[i] * y[i];\n      }\n      const spread2 = Math.hypot(sxx - syy, 2 * sxy);\n      // a round layout has no long axis\n      if (spread2 < (sxx + syy) * 0.04) return;\n      const axis = 0.5 * Math.atan2(2 * sxy, sxx - syy);\n      let turn = (aspect > 1 ? 0 : Math.PI / 2) - axis;\n      if (turn > Math.PI / 2) turn -= Math.PI;\n      if (turn < -Math.PI / 2) turn += Math.PI;\n      turn *= 0.12;\n      if (Math.abs(turn) < 1e-5) return;\n      const c = Math.cos(turn);\n      const s = Math.sin(turn);\n      for (let i = 0; i < n; i++) {\n        const px = x[i];\n        const pvx = vx[i];\n        x[i] = px * c - y[i] * s;\n        y[i] = px * s + y[i] * c;\n        vx[i] = pvx * c - vy[i] * s;\n        vy[i] = pvx * s + vy[i] * c;\n      }\n    };\n\n    const step = () => {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n      links();\n      manyBody();\n      gravity();\n      collide();\n      const decay = 1 - init.velocityDecay;\n      for (let i = 0; i < n; i++) {\n        if (Number.isNaN(fx[i])) {\n          vx[i] *= decay;\n          vy[i] *= decay;\n          x[i] += vx[i];\n          y[i] += vy[i];\n        } else {\n          x[i] = fx[i];\n          y[i] = fy[i];\n          vx[i] = vy[i] = 0;\n        }\n      }\n      center();\n      if (orient) align();\n    };\n\n    const done = () => !coarse && alpha < alphaMin && alphaTarget === 0;\n\n    return {\n      x,\n      y,\n      tick(k = 1) {\n        for (let i = 0; i < k; i++) {\n          if (coarse) {\n            if (coarse.tick(1)) project();\n            else finishCoarse();\n            continue;\n          }\n          if (done()) return false;\n          step();\n        }\n        return !done();\n      },\n      alpha: () => (coarse ? Math.max(alpha, coarse.alpha()) : alpha),\n      reheat(value = 0.3) {\n        if (coarse) finishCoarse();\n        alpha = Math.max(alpha, value);\n      },\n      drag(i, px2, py2) {\n        if (i < 0 || i >= n) return;\n        if (coarse) finishCoarse();\n        fx[i] = x[i] = px2;\n        fy[i] = y[i] = py2;\n        alphaTarget = 0.3;\n        if (alpha < 0.3) alpha = 0.3;\n      },\n      release(i, keep) {\n        alphaTarget = 0;\n        if (i < 0 || i >= n || keep || pinned[i]) return;\n        fx[i] = NaN;\n        fy[i] = NaN;\n      },\n      done,\n      settle() {\n        // position-based passes until no two nodes overlap\n        const pad = Math.max(0, collidePad);\n        for (let pass = 0; pass < 80; pass++) {\n          let moved = false;\n          eachPair(x, y, pad, (i, j) => {\n            const r = radius[i] + radius[j] + pad * 2;\n            let dx = x[i] - x[j];\n            let dy = y[i] - y[j];\n            let l = dx * dx + dy * dy;\n            if (l >= r * r * 0.9999) return;\n            if (l === 0) {\n              dx = random() - 0.5;\n              dy = random() - 0.5;\n              l = dx * dx + dy * dy;\n            }\n            const d = Math.sqrt(l);\n            const push = (r - d) / d;\n            const fi = Number.isNaN(fx[i]) ? 1 : 0;\n            const fj = Number.isNaN(fx[j]) ? 1 : 0;\n            if (!fi && !fj) return;\n            const si = fi / (fi + fj);\n            const sj = fj / (fi + fj);\n            x[i] += dx * push * si * 1.001;\n            y[i] += dy * push * si * 1.001;\n            x[j] -= dx * push * sj * 1.001;\n            y[j] -= dy * push * sj * 1.001;\n            moved = true;\n          });\n          if (!moved) break;\n        }\n      },\n    };\n  };\n}\n\n// ------------------------------------------------------------- inputs\n\nexport const FORCE_DEFAULTS = {\n  linkDistance: 60,\n  charge: -160,\n  theta: 0.9,\n  gravity: 0.04,\n  collide: 2,\n  velocityDecay: 0.4,\n  iterations: 300,\n  seed: 1,\n  /** Smallest fresh layout computed with a multilevel start */\n  multilevel: 400,\n};\n\n/** Kernel input from index-based data */\nexport const forceInit = (\n  n: number,\n  source: Int32Array,\n  target: Int32Array,\n  options: GraphForceLayoutOptions | undefined,\n  extra: {\n    x?: Float64Array;\n    y?: Float64Array;\n    radius?: Float64Array;\n    fixed?: Uint8Array;\n    weight?: Float64Array;\n    alpha?: number;\n    aspect?: number;\n  } = {},\n): ForceKernelInit => {\n  const o = options ?? {};\n  const collide =\n    o.collide === false\n      ? -1\n      : typeof o.collide === \"number\"\n        ? Math.max(0, o.collide)\n        : FORCE_DEFAULTS.collide;\n  return {\n    n,\n    x: extra.x ?? new Float64Array(n).fill(NaN),\n    y: extra.y ?? new Float64Array(n).fill(NaN),\n    radius: extra.radius ?? new Float64Array(n).fill(6),\n    fixed: extra.fixed ?? new Uint8Array(n),\n    source,\n    target,\n    weight: extra.weight ?? new Float64Array(source.length).fill(1),\n    linkDistance: o.linkDistance ?? FORCE_DEFAULTS.linkDistance,\n    linkStrength: o.linkStrength ?? NaN,\n    charge: o.charge ?? FORCE_DEFAULTS.charge,\n    theta: o.theta ?? FORCE_DEFAULTS.theta,\n    gravity: o.gravity ?? FORCE_DEFAULTS.gravity,\n    collide,\n    velocityDecay: o.velocityDecay ?? FORCE_DEFAULTS.velocityDecay,\n    iterations: o.iterations ?? FORCE_DEFAULTS.iterations,\n    seed: o.seed ?? FORCE_DEFAULTS.seed,\n    alpha: extra.alpha ?? 1,\n    aspect: extra.aspect ?? 1,\n    coarsen: o.multilevel === false ? 0 : FORCE_DEFAULTS.multilevel,\n  };\n};\n\n/** Index of the ids and the valid edges (unknown ids are skipped) */\nexport const indexGraph = (\n  nodes: readonly GraphNode[],\n  edges: readonly GraphEdge[],\n): {\n  index: Map<string, number>;\n  source: Int32Array;\n  target: Int32Array;\n  edge: Int32Array;\n} => {\n  const index = new Map<string, number>();\n  nodes.forEach((node, i) => {\n    if (!index.has(node.id)) index.set(node.id, i);\n  });\n  const s: number[] = [];\n  const t: number[] = [];\n  const e: number[] = [];\n  edges.forEach((edge, k) => {\n    const a = index.get(edge.source);\n    const b = index.get(edge.target);\n    if (a === undefined || b === undefined) return;\n    s.push(a);\n    t.push(b);\n    e.push(k);\n  });\n  return {\n    index,\n    source: Int32Array.from(s),\n    target: Int32Array.from(t),\n    edge: Int32Array.from(e),\n  };\n};\n\nconst simulationOf = (\n  nodes: readonly GraphNode[],\n  edges: readonly GraphEdge[],\n  options: GraphForceLayoutOptions | undefined,\n): GraphForceSimulation => {\n  const { source, target, edge } = indexGraph(nodes, edges);\n  const n = nodes.length;\n  const x = new Float64Array(n).fill(NaN);\n  const y = new Float64Array(n).fill(NaN);\n  const fixed = new Uint8Array(n);\n  const radius = new Float64Array(n);\n  nodes.forEach((node, i) => {\n    if (Number.isFinite(node.x) && Number.isFinite(node.y)) {\n      x[i] = node.x!;\n      y[i] = node.y!;\n      if (node.fixed) fixed[i] = 1;\n    }\n    radius[i] = options?.radius?.(node, i) ?? 6;\n  });\n  const values = Array.from(edge, (k) => edges[k].value);\n  const known = values.filter((v): v is number => Number.isFinite(v) && v! > 0);\n  const mean = known.length\n    ? known.reduce((a, b) => a + b, 0) / known.length\n    : 1;\n  const weight = Float64Array.from(values, (v) =>\n    Number.isFinite(v) && v! > 0\n      ? Math.max(0.5, Math.min(2, Math.sqrt(v! / mean)))\n      : 1,\n  );\n  return forceKernel()(\n    forceInit(n, source, target, options, { x, y, fixed, radius, weight }),\n  );\n};\n\n/**\n * A force simulation of the nodes and edges, stepped by the caller (no DOM,\n * no timers: usable in workers and mini-programs)\n */\nexport const createForceSimulation = (\n  nodes: readonly GraphNode[],\n  edges: readonly GraphEdge[],\n  options?: GraphForceLayoutOptions,\n): GraphForceSimulation => simulationOf(nodes, edges, options);\n\n/** Runs a force simulation to the end and returns the positions (synchronous) */\nexport const forceLayout = (\n  nodes: readonly GraphNode[],\n  edges: readonly GraphEdge[],\n  options?: GraphForceLayoutOptions,\n): GraphLayoutResult => {\n  const sim = simulationOf(nodes, edges, options);\n  while (sim.tick(16));\n  sim.settle();\n  return { x: sim.x, y: sim.y };\n};\n"],"mappings":";AAsDA,SAAgBA,IAA2B;CACzC,OAAO,SAASC,EAAU,GAA6C;EACrE,IAAM,IAAIC,EAAK,GAETC,IAAe,IAGfC,IAAIF,EAAK,GACTG,IAAIH,EAAK,GACTI,IAASJ,EAAK,QACdK,IAAK,IAAI,aAAa,CAAC,GACvBC,IAAK,IAAI,aAAa,CAAC,GACvBC,IAAK,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,GAAG,GACjCC,IAAK,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,GAAG,GACjCC,IAAS,IAAI,WAAW,CAAC,GAC3BC,IAAOV,EAAK,OAAO,KAAK,GACtBW,UAAe;GAEnB,IAAQD,IAAO,aAAc;GAC7B,IAAIE,IAAI,KAAK,KAAKF,IAAQA,MAAS,IAAK,IAAIA,CAAI;GAEhD,OADA,IAAKE,IAAI,KAAK,KAAKA,IAAKA,MAAM,GAAI,KAAKA,CAAC,IAAKA,KACpCA,IAAKA,MAAM,QAAS,KAAK;EACpC,GACMC,WAAgBF,EAAO,IAAI,MAAO,MAClCG,IAAOd,EAAK,MAIde,IAAQf,EAAK,SAAS,KAAK,MAAMA,EAAK,WAAW;EACrD,KAAK,IAAIgB,IAAI,GAAGA,IAAI,KAAKD,GAAO,KAC9B,CAAIf,EAAK,MAAMgB,MAAM,OAAO,SAASd,EAAEc,EAAE,KAAK,OAAO,SAASb,EAAEa,EAAE,OAChE,IAAQ;EAGZ,IAAMC,IAAQ,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC,IAClCC,IAAS,KAAK,IAAI,IAAIlB,EAAK,eAAe,GAAI;EACpD,KAAK,IAAIgB,IAAI,GAAGA,IAAI,GAAG,KAAK;GAC1B,IAAI,EAAE,OAAO,SAASd,EAAEc,EAAE,KAAK,OAAO,SAASb,EAAEa,EAAE,IAAI;IACrD,IAAMG,IAAID,IAAS,KAAK,KAAK,KAAMF,CAAC,GAC9BI,IAAIJ,IAAIC;IAEd,AADA,EAAED,KAAKG,IAAI,KAAK,IAAIC,CAAC,IAAIP,EAAO,GAChC,EAAEG,KAAKG,IAAI,KAAK,IAAIC,CAAC,IAAIP,EAAO;GAClC;GACA,AAAIb,EAAK,MAAMgB,OACb,EAAOA,KAAK,GACZ,EAAGA,KAAKd,EAAEc,IACV,EAAGA,KAAKb,EAAEa;EAEd;EAGA,IAAMK,IAAIrB,EAAK,OAAO,QAChBsB,IAAMtB,EAAK,QACXuB,IAAMvB,EAAK,QACXwB,IAAQ,IAAI,WAAW,CAAC;EAC9B,KAAK,IAAIC,IAAI,GAAGA,IAAIJ,GAAG,KAErB,AADA,EAAMC,EAAIG,GAAG,IACb,EAAMF,EAAIE,GAAG;EAEf,IAAMC,IAAO,IAAI,aAAaL,CAAC,GACzBM,KAAW,IAAI,aAAaN,CAAC;EACnC,KAAK,IAAII,IAAI,GAAGA,IAAIJ,GAAG,KAAK;GAC1B,IAAMD,IAAII,EAAMF,EAAIG,KACdG,IAAIJ,EAAMD,EAAIE;GACpB,EAAKA,KAAKL,KAAKA,IAAIQ;GACnB,IAAMC,IAAO,OAAO,SAAS7B,EAAK,YAAY,IAC1CA,EAAK,eACL,IAAI,KAAK,IAAIoB,GAAGQ,CAAC;GACrB,GAASH,KAAKI,KAAQ7B,EAAK,OAAOyB,MAAM;EAC1C;EAEA,IAAIK,IAAQ9B,EAAK,QAAQ,IAAIA,EAAK,QAAQ,GACpC+B,IAAW,MACbC,IAAa,IAAaD,MAAU,IAAI,KAAK,IAAI,GAAG/B,EAAK,UAAU,IACnEiC,IAAc,GACZC,KAAQlC,EAAK,OACbmC,KAASnC,EAAK,QACdoC,IAAa,IAAI,aAAa,CAAC;EACrC,KAAK,IAAIpB,IAAI,GAAGA,IAAI,GAAG,KAAK,EAAWA,KAAKmB,MAAUrB,IAAOA,EAAKE,KAAK;EACvE,IAAMqB,IAAarC,EAAK,SACpBsC,IAAY;EAChB,KAAK,IAAItB,IAAI,GAAGA,IAAI,GAAG,KAAK,IAAY,KAAK,IAAIsB,GAAWlC,EAAOY,EAAE;EAMrE,IAAIuB,IAAsC,MACpCC,IAAQzB,IAAQ,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,MAC7C0B,IAAU1B,IAAQ,IAAI,aAAa,CAAC,IAAI,MACxC2B,IAAU3B,IAAQ,IAAI,aAAa,CAAC,IAAI;EAC9C,IAAIyB,KAASC,KAAWC,GAAS;GAC/B,IAAMC,IAAS,IAAI,WAAW,CAAC;GAC/B,KAAK,IAAIlB,IAAI,GAAGA,IAAIJ,GAAG,KACrB,AAAIC,EAAIG,OAAOF,EAAIE,OACnB,EAAOH,EAAIG,GAAG,IACd,EAAOF,EAAIE,GAAG;GAEhB,IAAMmB,IAAW,IAAI,WAAW,IAAI,CAAC;GACrC,KAAK,IAAI5B,IAAI,GAAGA,IAAI,GAAG,KAAK,EAASA,IAAI,KAAK4B,EAAS5B,KAAK2B,EAAO3B;GACnE,IAAM6B,IAAM,IAAI,WAAWD,EAAS,EAAE,GAChCE,IAAOF,EAAS,MAAM,GAAG,CAAC;GAChC,KAAK,IAAInB,IAAI,GAAGA,IAAIJ,GAAG,KACrB,AAAIC,EAAIG,OAAOF,EAAIE,OACnB,EAAI,EAAKH,EAAIG,GAAG,MAAMF,EAAIE,IAC1B,EAAI,EAAKF,EAAIE,GAAG,MAAMH,EAAIG;GAG5B,IAAIsB,IAAY;GAChB,KAAK,IAAI/B,IAAI,GAAGA,IAAI,GAAG,KAAK,IAAY,KAAK,IAAI+B,GAAWJ,EAAO3B,EAAE;GACrE,IAAMgC,IAAW,IAAI,WAAWD,IAAY,CAAC;GAC7C,KAAK,IAAI/B,IAAI,GAAGA,IAAI,GAAG,KAAK,EAAS2B,EAAO3B,KAAK,EAAE;GACnD,KAAK,IAAIiC,IAAI,GAAGA,KAAKF,GAAW,KAAK,EAASE,IAAI,MAAMD,EAASC;GACjE,IAAMC,IAAQ,IAAI,WAAW,CAAC;GAC9B,KAAK,IAAIlC,IAAI,GAAGA,IAAI,GAAG,KAAK,EAAM,EAAS2B,EAAO3B,GAAG,MAAMA;GAC3D,IAAMmC,KAAY,MAAerC,IAAOA,EAAKE,KAAK,GAC5CoC,IAAO,IAAI,WAAW,CAAC,GACzBC,IAAK;GACT,KAAK,IAAIC,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAMC,IAAIL,EAAMI;IAChB,IAAId,EAAMe,MAAM,GAAG;IACnB,IAAIC,IAAO;IACX,KAAK,IAAIpC,IAAIwB,EAASW,IAAInC,IAAIwB,EAASW,IAAI,IAAI,KAAK;KAClD,IAAME,IAAIZ,EAAIzB;KACd,AAAIqC,MAAMF,KAAKf,EAAMiB,MAAM,MACvBD,IAAO,KAAKL,EAASM,CAAC,IAAIN,EAASK,CAAI,OAAG,IAAOC;IACvD;IACA,AAAID,IAAO,MACX,EAAMD,KAAK,EAAMC,KAAQH,GACzB,EAAK,OAAQ;GACf;GACA,KAAK,IAAIC,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAMC,IAAIL,EAAMI;IAChB,IAAId,EAAMe,MAAM,GAAG;IACnB,IAAIC,IAAO;IACX,KAAK,IAAIpC,IAAIwB,EAASW,IAAInC,IAAIwB,EAASW,IAAI,IAAI,KAAK;KAClD,IAAMG,IAAIlB,EAAMK,EAAIzB;KAEpB,AAAIsC,IAAI,KAAMf,EAAOY,KAAK,KAAKH,EAAKM,MAAM,MACtCF,IAAO,KAAKJ,EAAKM,KAAKN,EAAKI,QAAO,IAAOE;IAC/C;IACA,AAAIF,KAAQ,KACV,EAAMD,KAAKC,GACX,EAAKA,EAAK,OAEV,EAAMD,KAAKF,GACX,EAAK,OAAQ;GAEjB;GACA,IAAIA,KAAM,IAAI,IAAK;IACjB,IAAMM,IAAQ,IAAI,aAAaN,CAAE,GAC3BO,IAAU,IAAI,aAAaP,CAAE;IACnC,KAAK,IAAIrC,IAAI,GAAGA,IAAI,GAAG,KAErB,AADA,EAAMwB,EAAMxB,OAAOmC,EAASnC,CAAC,GAC7B,EAAQwB,EAAMxB,OAAOZ,EAAOY,KAAKZ,EAAOY;IAE1C,KAAK,IAAI0C,IAAI,GAAGA,IAAIL,GAAI,KAAK,EAAQK,KAAK,KAAK,KAAKE,EAAQF,EAAE;IAE9D,IAAMG,IAAiB,CAAC;IACxB,KAAK,IAAIpC,IAAI,GAAGA,IAAIJ,GAAG,KAAK;KAC1B,IAAMD,IAAIoB,EAAMlB,EAAIG,KACdG,IAAIY,EAAMjB,EAAIE;KACpB,AAAIL,MAAMQ,KAAGiC,EAAK,KAAKzC,IAAIQ,IAAIR,IAAIiC,IAAKzB,IAAIA,IAAIyB,IAAKjC,CAAC;IACxD;IACA,IAAM0C,IAAS,aAAa,KAAKD,CAAI,CAAC,CAAC,KAAK,GACtCE,IAAe,CAAC,GAChBC,IAAe,CAAC;IACtB,KAAK,IAAIC,IAAI,GAAGA,IAAIH,EAAO,QAAQ,KACjC,AAAIG,KAAKH,EAAOG,OAAOH,EAAOG,IAAI,OAClCF,EAAG,KAAK,KAAK,MAAMD,EAAOG,KAAKZ,CAAE,CAAC,GAClCW,EAAG,KAAKF,EAAOG,KAAKZ,CAAE;IAExB,IAAStD,EAAU;KACjB,GAAGC;KACH,GAAGqD;KACH,GAAG,IAAI,aAAaA,CAAE,CAAC,CAAC,KAAK,GAAG;KAChC,GAAG,IAAI,aAAaA,CAAE,CAAC,CAAC,KAAK,GAAG;KAChC,QAAQO;KACR,OAAO,IAAI,WAAWP,CAAE;KACxB,QAAQ,WAAW,KAAKU,CAAE;KAC1B,QAAQ,WAAW,KAAKC,CAAE;KAC1B,QAAQ,IAAI,aAAaD,EAAG,MAAM,CAAC,CAAC,KAAK,CAAC;KAC1C,MAAMJ;KACN,OAAO;IACT,CAAC;IAED,KAAK,IAAI3C,IAAI,GAAGA,IAAI,GAAG,KAAK;KAC1B,IAAMI,IAAIT,EAAO,IAAI,KAAK,KAAK,GACzBsC,KACHjD,EAAK,eAAe,KAAMI,EAAOY,OAAO,KAAM,KAAML,EAAO;KAE9D,AADA,EAAQK,KAAK,KAAK,IAAII,CAAC,IAAI6B,GAC3B,EAAQjC,KAAK,KAAK,IAAII,CAAC,IAAI6B;IAC7B;IAEA,AADA,IAAQ,KAAK,IAAInB,GAAO7B,CAAY,GACpC,IACE,KAEE8B,IAAWD,OACX,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM9B,EAAK,aAAa,GAAY,CAAC;GAEhE;EACF;EACA,IAAMkE,UAAgB;GACpB,IAAI,CAAC3B,KAAU,CAACC,KAAS,CAACC,KAAW,CAACC,GAAS;GAC/C,IAAMyB,IAAK5B,EAAO,GACZ6B,IAAK7B,EAAO;GAClB,KAAK,IAAIvB,IAAI,GAAGA,IAAI,GAAG,KAErB,AADA,EAAEA,KAAKmD,EAAG3B,EAAMxB,MAAMyB,EAAQzB,IAC9B,EAAEA,KAAKoD,EAAG5B,EAAMxB,MAAM0B,EAAQ1B;EAElC,GACMqD,UAAqB;GAEzB,AADAH,EAAQ,GACR,IAAS;EACX;EACA,EAAQ;EAGR,IAAII,IAAM,GACNC,oBAAM,IAAI,aAAc,GACxBC,oBAAM,IAAI,aAAc,GACxBC,oBAAQ,IAAI,aAAc,GAC1BC,oBAAS,IAAI,WAAY,GACzBC,oBAAS,IAAI,WAAY,GACzBC,oBAAS,IAAI,WAAY,GACzBC,oBAAQ,IAAI,aAAc,GAC1BC,oBAAM,IAAI,aAAc,GACxBC,oBAAM,IAAI,aAAc,GACtBC,IAAY,IAAI,WAAW,CAAC,GAC9BC,IAAS,GAEPC,MAAQ,MAAiB;GAC7B,IAAIC,KAAQb,GAAK;GACjB,IAAMc,IAAO,KAAK,IAAID,GAAMb,IAAM,GAAG,EAAE,GACjCe,KAAS,MAAoB;IACjC,IAAMzD,IAAI,IAAI,aAAawD,CAAI;IAE/B,OADAxD,EAAE,IAAIR,CAAC,GACAQ;GACT;GAMA,AALA,IAAMyD,EAAMd,CAAG,GACf,IAAMc,EAAMb,CAAG,GACf,IAAQa,EAAMZ,CAAK,GACnB,IAAQY,EAAMR,CAAK,GACnB,IAAMQ,EAAMP,CAAG,GACf,IAAMO,EAAMN,CAAG;GACf,IAAMO,IAAI,IAAI,WAAWF,IAAO,CAAC;GAEjC,AADAE,EAAE,IAAIZ,CAAM,GACZ,IAASY;GACT,IAAMC,IAAI,IAAI,WAAWH,CAAI;GAE7B,AADAG,EAAE,IAAIZ,CAAM,GACZ,IAASY;GACT,IAAMC,IAAI,IAAI,WAAWJ,CAAI;GAG7B,AAFAI,EAAE,IAAIZ,CAAM,GACZ,IAASY,GACT,IAAMJ;EACR,GAEMK,MAAW,GAAY,GAAY,MAAiB;GACxD,GAAKR,IAAS,CAAC;GACf,IAAMO,IAAI;GAUV,OATA,EAAIA,KAAKE,GACT,EAAIF,KAAKG,GACT,EAAMH,KAAKpC,GACX,EAAOoC,IAAI,KAAK,IAChB,EAAOA,IAAI,IAAI,KAAK,IACpB,EAAOA,IAAI,IAAI,KAAK,IACpB,EAAOA,IAAI,IAAI,KAAK,IACpB,EAAOA,KAAK,IACZ,EAAOA,KAAK,GACLA;EACT,GAEMI,MAAY,GAAW,GAAY,MAAe;GACtD,IAAMC,IAAOpB,EAAMe,KAAK;GACxB,OAAQ,OAAMjB,EAAIiB,KAAKK,MAAiBC,KAAMtB,EAAIgB,KAAKK,IAAO,IAAI;EACpE,GAEME,MAAa,GAAW,MAAc;GAC1C,IAAMF,IAAOpB,EAAMe,KAAK;GACxB,OAAOC,GACLlB,EAAIiB,MAAMvB,IAAI,IAAI4B,IAAO,IACzBrB,EAAIgB,MAAMvB,IAAI,IAAI4B,IAAO,IACzBA,CACF;EACF,GAEMG,MAAU,MAAc;GAC5B,IAAIR,IAAI,GACFS,IAAK/F,EAAEc,IACP8E,IAAK3F,EAAEa;GACb,KAAK,IAAIkF,IAAQ,IAAK,KAAS;IAC7B,IAAItB,EAAOY,IAAI;KACb,IAAMvB,IAAI2B,GAASJ,GAAGS,GAAIH,CAAE,GACxBR,IAAIZ,EAAOc,IAAI,IAAIvB;KACvB,IAAIqB,IAAI,GAAG;MAIT,AAHA,IAAIS,GAAUP,GAAGvB,CAAC,GAClB,EAAOuB,IAAI,IAAIvB,KAAKqB,GACpB,EAAOA,KAAKtE,GACZ,EAAUA,KAAK;MACf;KACF;KACA,IAAIsE;KACJ;IACF;IACA,IAAMa,IAAIxB,EAAOa;IACjB,IAAIW,IAAI,GAAG;KAET,AADA,EAAOX,KAAKxE,GACZ,EAAUA,KAAK;KACf;IACF;IACA,IAAKd,EAAEiG,OAAOF,KAAM9F,EAAEgG,OAAOL,KAAOI,IAAQ,IAAI;KAE9C,AADA,EAAUlF,KAAKmF,GACf,EAAOX,KAAKxE;KACZ;IACF;IAGA,AADA,EAAOwE,KAAK,IACZ,EAAOA,KAAK;IACZ,IAAMvB,IAAI2B,GAASJ,GAAGtF,EAAEiG,IAAIhG,EAAEgG,EAAE,GAC1Bb,IAAIS,GAAUP,GAAGvB,CAAC;IAExB,AADA,EAAOuB,IAAI,IAAIvB,KAAKqB,GACpB,EAAOA,KAAKa;GACd;EACF,GAEMC,WAAkB;GACtB,IAAIV,IAAK,UACLC,IAAK,UACLU,IAAK,WACLC,IAAK;GACT,KAAK,IAAItF,IAAI,GAAGA,IAAI,GAAG,KAIrB,AAHId,EAAEc,KAAK0E,MAAI,IAAKxF,EAAEc,KAClBd,EAAEc,KAAKqF,MAAI,IAAKnG,EAAEc,KAClBb,EAAEa,KAAK2E,MAAI,IAAKxF,EAAEa,KAClBb,EAAEa,KAAKsF,MAAI,IAAKnG,EAAEa;GAExB,IAAMoC,IAAO,KAAK,IAAIiD,IAAKX,GAAIY,IAAKX,GAAI,CAAC,IAAI,SAAS;GAGtD,AAFA,IAAS,GACTT,GAAK,IAAI,IAAI,CAAC,GACdO,GAAQC,GAAIC,GAAIvC,CAAI;GACpB,KAAK,IAAIpC,IAAI,GAAGA,IAAI,GAAG,KAAK,GAAOA,CAAC;GAEpC,KAAK,IAAIwE,IAAIP,IAAS,GAAGO,KAAK,GAAG,KAC/B,IAAIZ,EAAOY,IAAI;IACb,IAAI1E,IAAO,GACPyF,IAAS,GACTC,IAAK,GACLC,IAAK;IACT,KAAK,IAAIxC,IAAI,GAAGA,IAAI,GAAG,KAAK;KAC1B,IAAMqB,IAAIZ,EAAOc,IAAI,IAAIvB;KACzB,IAAIqB,IAAI,GAAG;KACX,IAAMoB,IAAI,KAAK,IAAI7B,EAAMS,EAAE;KAI3B,AAHA,KAAQT,EAAMS,IACd,KAAUoB,GACV,KAAMA,IAAI5B,EAAIQ,IACd,KAAMoB,IAAI3B,EAAIO;IAChB;IAGA,AAFA,EAAME,KAAK1E,GACX,EAAI0E,KAAKe,IAASC,IAAKD,IAAShC,EAAIiB,IACpC,EAAIA,KAAKe,IAASE,IAAKF,IAAS/B,EAAIgB;GACtC,OAAO;IACL,IAAI1E,IAAO;IACX,KAAK,IAAIqF,IAAIxB,EAAOa,IAAIW,KAAK,GAAG,IAAInB,EAAUmB,IAC5C,KAAQ/D,EAAW+D;IAGrB,AAFA,EAAMX,KAAK1E,GACX,EAAI0E,KAAKtF,EAAEyE,EAAOa,KAClB,EAAIA,KAAKrF,EAAEwE,EAAOa;GACpB;EAEJ,GAEImB,oBAAQ,IAAI,WAAW,GAAG,GACxBC,KAAU,IAAI,WAAW,CAAC,GAC1BC,WAAiB;GACrB,IAAI,CAAC1E,MAAU,IAAI,GAAG;GACtB,GAAU;GAGV,IAAMvB,IAAIsB,MAAS,IAAI,KAAc,KAAK,IAAI,GAAGJ,IAAQ7B,CAAY,IAC/D6G,IAAO,KAAKlG,IAAIA,IAElBY,IAAQ,GACRuF,IAAM;GAEV,KADA,EAAM,OAAS,GACRA,IAAK;IACV,IAAMvB,IAAImB,EAAM,EAAEI;IAClB,IAAInC,EAAOY,IAAI;KACb,IAAIuB,IAAM,IAAIJ,EAAM,QAAQ;MAC1B,IAAMK,IAAI,IAAI,WAAWL,EAAM,SAAS,CAAC;MAEzC,AADAK,EAAE,IAAIL,CAAK,GACX,IAAQK;KACV;KACA,KAAK,IAAI/C,IAAI,GAAGA,IAAI,GAAG,KAAK;MAC1B,IAAMqB,IAAIZ,EAAOc,IAAI,IAAIvB;MACzB,AAAIqB,KAAK,MAAG,EAAM,OAASA;KAC7B;IACF,OACE,KAAK,IAAIa,IAAIxB,EAAOa,IAAIW,KAAK,GAAG,IAAInB,EAAUmB,IAC5C,GAAQ,OAAWA;GAEzB;GACA,KAAK,IAAI7C,IAAI,GAAGA,IAAI9B,GAAO,KAAK;IAC9B,IAAMR,IAAI4F,GAAQtD,IACZ2D,IAAK/G,EAAEc,IACPkG,IAAK/G,EAAEa;IAGb,KAFA,IAAM,GACN,EAAM,OAAS,GACR+F,IAAK;KACV,IAAMvB,IAAImB,EAAM,EAAEI;KAClB,IAAKlC,EAAMW,IACX;UAAIZ,EAAOY,IAAI;OACb,IAAM2B,IAAKrC,EAAIU,KAAKyB,GACdG,IAAKrC,EAAIS,KAAK0B,GACdR,IAAIjC,EAAMe,IACZ/D,IAAI0F,IAAKA,IAAKC,IAAKA;OACvB,IAAIV,IAAIA,IAAII,IAAOrF,GAAG;QACpB,AAAIA,IAAI,MAAG,IAAI,KAAK,KAAKA,CAAC;QAC1B,IAAM4F,IAAKxC,EAAMW,KAAK1D,IAASL;QAE/B,AADA,EAAGT,MAAMmG,IAAKE,GACd,EAAGrG,MAAMoG,IAAKC;QACd;OACF;OACA,IAAIN,IAAM,IAAIJ,EAAM,QAAQ;QAC1B,IAAMK,IAAI,IAAI,WAAWL,EAAM,SAAS,CAAC;QAEzC,AADAK,EAAE,IAAIL,CAAK,GACX,IAAQK;OACV;OACA,KAAK,IAAI/C,IAAI,GAAGA,IAAI,GAAG,KAAK;QAC1B,IAAMqB,IAAIZ,EAAOc,IAAI,IAAIvB;QACzB,AAAIqB,KAAK,MAAG,EAAM,OAASA;OAC7B;MACF,OACE,KAAK,IAAIa,IAAIxB,EAAOa,IAAIW,KAAK,GAAG,IAAInB,EAAUmB,IAAI;OAChD,IAAIA,MAAMnF,GAAG;OACb,IAAImG,IAAKjH,EAAEiG,KAAKc,GACZG,IAAKjH,EAAEgG,KAAKe,GACZzF,IAAI0F,IAAKA,IAAKC,IAAKA;OASvB,AARID,MAAO,MACT,IAAKtG,EAAO,GACZ,KAAKsG,IAAKA,IAERC,MAAO,MACT,IAAKvG,EAAO,GACZ,KAAKuG,IAAKA,IAER3F,IAAI,MAAG,IAAI,KAAK,KAAKA,CAAC;OAC1B,IAAM4F,IAAKjF,EAAW+D,KAAKrE,IAASL;OAEpC,AADA,EAAGT,MAAMmG,IAAKE,GACd,EAAGrG,MAAMoG,IAAKC;MAChB;;IAEJ;GACF;EACF,GAEMC,WAAc;GAClB,IAAMC,IAAWvH,EAAK;GACtB,KAAK,IAAIyB,IAAI,GAAGA,IAAIJ,GAAG,KAAK;IAC1B,IAAM2F,IAAI1F,EAAIG,IACRb,IAAIW,EAAIE;IACd,IAAIuF,MAAMpG,GAAG;IACb,IAAIuG,IAAKjH,EAAEU,KAAKP,EAAGO,KAAKV,EAAE8G,KAAK3G,EAAG2G,MAAMnG,EAAO,GAC3CuG,IAAKjH,EAAES,KAAKN,EAAGM,KAAKT,EAAE6G,KAAK1G,EAAG0G,MAAMnG,EAAO,GAC3C,IAAI,KAAK,KAAKsG,IAAKA,IAAKC,IAAKA,CAAE;IAGnC,AAFA,KAAM,IAAIG,IAAWnH,EAAO4G,KAAK5G,EAAOQ,MAAM,IAAKkB,IAAQH,GAASF,IACpE,KAAM,GACN,KAAM;IACN,IAAMG,IAAIF,EAAKD;IAIf,AAHA,EAAGb,MAAMuG,IAAKvF,GACd,EAAGhB,MAAMwG,IAAKxF,GACd,EAAGoF,MAAMG,KAAM,IAAIvF,IACnB,EAAGoF,MAAMI,KAAM,IAAIxF;GACrB;EACF,GAEM4F,WAAgB;GACpB,IAAM9D,IAAI1D,EAAK,UAAU8B;GACzB,IAAI,CAAC4B,GAAG;GAER,IAAM+D,IAAU,KAAK,KACnB,KAAK,IAAI,KAAM,KAAK,IAAI,GAAGzH,EAAK,SAAS,IAAIA,EAAK,SAAS,CAAC,CAAC,CAC/D,GACM0H,IAAKhE,IAAI+D,GACTE,IAAKjE,IAAI+D;GACf,KAAK,IAAIzG,IAAI,GAAGA,IAAI,GAAG,KAErB,AADA,EAAGA,MAAMd,EAAEc,KAAK0G,GAChB,EAAG1G,MAAMb,EAAEa,KAAK2G;EAEpB,GAGIC,IAAY;EAChB,OAAOA,IAAY,IAAI,IAAG,MAAc;EACxC,IAAMC,IAAY,IAAI,WAAWD,IAAY,CAAC,GACxCE,KAAY,IAAI,WAAW,CAAC,GAC5BC,KAAS,IAAI,WAAW,CAAC,GACzBC,MAAQ,GAAY,OACvB,KAAK,KAAK7D,GAAI,QAAQ,IAAI,KAAK,KAAKC,GAAI,QAAQ,KAAMwD,IAAY,GAG/DK,MAAU,GAAkB,GAAkB,MAAgB;GAClE,IAAMC,IAAO,KAAK,IAAI,OAAO5F,IAAY6F,KAAO,CAAC;GACjD,EAAU,KAAK,CAAC;GAChB,KAAK,IAAInH,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAMoH,IAAIJ,GAAK,KAAK,MAAM/B,EAAGjF,KAAKkH,CAAI,GAAG,KAAK,MAAMpC,EAAG9E,KAAKkH,CAAI,CAAC;IAEjE,AADA,GAAOlH,KAAKoH,GACZ,EAAUA,IAAI,EAAE;GAClB;GACA,KAAK,IAAIA,IAAI,GAAGA,IAAIR,GAAW,KAAK,EAAUQ,IAAI,MAAMP,EAAUO;GAClE,IAAMC,IAASR,EAAU,MAAM,GAAGD,CAAS;GAC3C,KAAK,IAAI5G,IAAI,GAAGA,IAAI,GAAG,KAAK,GAAU,EAAO+G,GAAO/G,GAAG,MAAMA;GAC7D,OAAOkH;EACT,GAEMI,IAAU,IAAI,WAAWV,CAAS,CAAC,CAAC,KAAK,EAAE,GAG3CW,MACJ,GACA,GACA,GACA,MACG;GACH,IAAML,IAAOD,GAAOhC,GAAIH,GAAIqC,CAAG;GAC/B,EAAQ,KAAK,EAAE;GACf,KAAK,IAAInH,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAMmD,IAAK,KAAK,MAAM8B,EAAGjF,KAAKkH,CAAI,GAC5B9D,IAAK,KAAK,MAAM0B,EAAG9E,KAAKkH,CAAI;IAClC,KAAK,IAAIM,IAAK,IAAIA,KAAM,GAAG,KACzB,KAAK,IAAIC,IAAK,IAAIA,KAAM,GAAG,KAAM;KAC/B,IAAML,IAAIJ,GAAK7D,IAAKsE,GAAIrE,IAAKoE,CAAE;KAE/B,IAAIF,EAAQF,OAAOpH,GACnB;QAAQoH,KAAKpH;MACb,KAAK,IAAIiD,IAAI4D,EAAUO,IAAInE,IAAI4D,EAAUO,IAAI,IAAI,KAAK;OACpD,IAAMjC,IAAI2B,GAAU7D;OACpB,AAAIkC,IAAInF,KAAG0H,EAAK1H,GAAGmF,CAAC;MACtB;KAJa;IAKf;GAEJ;EACF,GAEMF,KAAK,IAAI,aAAa,CAAC,GACvBH,KAAK,IAAI,aAAa,CAAC,GACvB6C,WAAgB;GACpB,IAAI,MAAa,KAAK,IAAI,IAC1B;SAAK,IAAI3H,IAAI,GAAGA,IAAI,GAAG,KAErB,AADA,GAAGA,KAAKd,EAAEc,KAAKX,EAAGW,IAClB,GAAGA,KAAKb,EAAEa,KAAKV,EAAGU;IAEpB,GAASiF,IAAIH,IAAIzD,IAAa,GAAG,MAAM;KACrC,IAAMuG,IAAKxI,EAAOY,KAAKqB,GACjBwG,IAAKzI,EAAO+F,KAAK9D,GACjBlB,IAAIyH,IAAKC,GACX1B,IAAKjH,EAAEc,KAAKX,EAAGW,KAAKd,EAAEiG,KAAK9F,EAAG8F,IAC9BiB,IAAKjH,EAAEa,KAAKV,EAAGU,KAAKb,EAAEgG,KAAK7F,EAAG6F,IAC9B1E,IAAI0F,IAAKA,IAAKC,IAAKA;KACvB,IAAI3F,KAAKN,IAAIA,GAAG;KAKhB,AAJIgG,MAAO,MACT,IAAKtG,EAAO,GACZ,KAAKsG,IAAKA,IAERC,MAAO,MACT,IAAKvG,EAAO,GACZ,KAAKuG,IAAKA;KAEZ,IAAMnE,IAAI,KAAK,KAAKxB,CAAC,GACf4F,KAAMlG,IAAI8B,KAAKA,IAAK;KAE1B,AADA,KAAMoE,GACN,KAAMA;KACN,IAAMyB,IAAMD,IAAKA,GACXE,IAAQD,KAAOF,IAAKA,IAAKE;KAI/B,AAHA,EAAG9H,MAAMmG,IAAK4B,GACd,EAAG/H,MAAMoG,IAAK2B,GACd,EAAG5C,MAAMgB,KAAM,IAAI4B,IACnB,EAAG5C,MAAMiB,KAAM,IAAI2B;IACrB,CAAC;GA3BD;EA4BF,GAEMC,WAAe;GACnB,IAAIxC,IAAK,GACLC,IAAK;GACT,KAAK,IAAIzF,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAI,CAAC,OAAO,MAAMT,EAAGS,EAAE,GAAG;IAE1B,AADA,KAAMd,EAAEc,IACR,KAAMb,EAAEa;GACV;GAEA,AADA,KAAM,KAAK,GACX,KAAM,KAAK;GACX,KAAK,IAAIA,IAAI,GAAGA,IAAI,GAAG,KAErB,AADA,EAAEA,MAAMwF,GACR,EAAExF,MAAMyF;EAEZ,GAKMwC,KAASjJ,EAAK,SAAS,IAAIA,EAAK,SAAS,GACzCkJ,KACJlJ,EAAK,SAAS,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,IAAIiJ,EAAM,CAAC,IAAI,KACrDE,WAAc;GAClB,IAAIC,IAAM,GACNC,IAAM,GACNC,IAAM;GACV,KAAK,IAAItI,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAI,CAAC,OAAO,MAAMT,EAAGS,EAAE,GAAG;IAG1B,AAFA,KAAOd,EAAEc,KAAKd,EAAEc,IAChB,KAAOb,EAAEa,KAAKb,EAAEa,IAChB,KAAOd,EAAEc,KAAKb,EAAEa;GAClB;GAGA,IAFgB,KAAK,MAAMoI,IAAMC,GAAK,IAAIC,CAEtC,KAAWF,IAAMC,KAAO,KAAM;GAClC,IAAME,IAAO,KAAM,KAAK,MAAM,IAAID,GAAKF,IAAMC,CAAG,GAC5CG,KAAQP,KAAS,IAAI,IAAI,KAAK,KAAK,KAAKM;GAI5C,IAHIC,IAAO,KAAK,KAAK,MAAG,KAAQ,KAAK,KACjCA,IAAO,CAAC,KAAK,KAAK,MAAG,KAAQ,KAAK,KACtC,KAAQ,KACJ,KAAK,IAAIA,CAAI,IAAI,MAAM;GAC3B,IAAMlE,IAAI,KAAK,IAAIkE,CAAI,GACjBxC,IAAI,KAAK,IAAIwC,CAAI;GACvB,KAAK,IAAIxI,IAAI,GAAGA,IAAI,GAAG,KAAK;IAC1B,IAAMiF,IAAK/F,EAAEc,IACPyI,IAAMpJ,EAAGW;IAIf,AAHA,EAAEA,KAAKiF,IAAKX,IAAInF,EAAEa,KAAKgG,GACvB,EAAEhG,KAAKiF,IAAKe,IAAI7G,EAAEa,KAAKsE,GACvB,EAAGtE,KAAKyI,IAAMnE,IAAIhF,EAAGU,KAAKgG,GAC1B,EAAGhG,KAAKyI,IAAMzC,IAAI1G,EAAGU,KAAKsE;GAC5B;EACF,GAEMoE,WAAa;GAKjB,AAJA,MAAUzH,IAAcH,KAASE,GACjCsF,GAAM,GACNT,GAAS,GACTW,GAAQ,GACRmB,GAAQ;GACR,IAAMgB,IAAQ,IAAI3J,EAAK;GACvB,KAAK,IAAIgB,IAAI,GAAGA,IAAI,GAAG,KACrB,AAAI,OAAO,MAAMT,EAAGS,EAAE,KACpB,EAAGA,MAAM2I,GACT,EAAG3I,MAAM2I,GACT,EAAE3I,MAAMX,EAAGW,IACX,EAAEA,MAAMV,EAAGU,OAEX,EAAEA,KAAKT,EAAGS,IACV,EAAEA,KAAKR,EAAGQ,IACV,EAAGA,KAAK,EAAGA,KAAK;GAIpB,AADAgI,GAAO,GACHE,MAAQC,GAAM;EACpB,GAEMS,UAAa,CAACrH,KAAUT,IAAQC,KAAYE,MAAgB;EAElE,OAAO;GACL;GACA;GACA,KAAK,IAAI,GAAG;IACV,KAAK,IAAIjB,IAAI,GAAGA,IAAIiD,GAAG,KAAK;KAC1B,IAAI1B,GAAQ;MACV,AAAIA,EAAO,KAAK,CAAC,IAAG2B,EAAQ,IACvBG,EAAa;MAClB;KACF;KACA,IAAIuF,EAAK,GAAG,OAAO;KACnB,GAAK;IACP;IACA,OAAO,CAACA,EAAK;GACf;GACA,aAAcrH,IAAS,KAAK,IAAIT,GAAOS,EAAO,MAAM,CAAC,IAAIT;GACzD,OAAO,IAAQ,IAAK;IAElB,AADIS,KAAQ8B,EAAa,GACzB,IAAQ,KAAK,IAAIvC,GAAO+H,CAAK;GAC/B;GACA,KAAK,GAAG,GAAK,GAAK;IAChB,AAAI7I,IAAI,KAAKA,KAAK,MACduB,KAAQ8B,EAAa,GACzB,EAAGrD,KAAK,EAAEA,KAAK8I,GACf,EAAG9I,KAAK,EAAEA,KAAK+I,GACf,IAAc,IACVjI,IAAQ,OAAK,IAAQ;GAC3B;GACA,QAAQ,GAAG,GAAM;IAEf,AADA,IAAc,GACV,MAAI,KAAKd,KAAK,KAAKgJ,KAAQvJ,EAAOO,QACtC,EAAGA,KAAK,KACR,EAAGA,KAAK;GACV;GACA;GACA,SAAS;IAEP,IAAMmH,IAAM,KAAK,IAAI,GAAG9F,CAAU;IAClC,KAAK,IAAI4H,IAAO,GAAGA,IAAO,IAAI,KAAQ;KACpC,IAAIC,IAAQ;KAyBZ,IAxBA3B,GAASrI,GAAGC,GAAGgI,IAAM,GAAG,MAAM;MAC5B,IAAMhH,IAAIf,EAAOY,KAAKZ,EAAO+F,KAAKgC,IAAM,GACpChB,IAAKjH,EAAEc,KAAKd,EAAEiG,IACdiB,IAAKjH,EAAEa,KAAKb,EAAEgG,IACd1E,IAAI0F,IAAKA,IAAKC,IAAKA;MACvB,IAAI3F,KAAKN,IAAIA,IAAI,OAAQ;MACzB,AAAIM,MAAM,MACR,IAAKd,EAAO,IAAI,IAChB,IAAKA,EAAO,IAAI,IAChB,IAAIwG,IAAKA,IAAKC,IAAKA;MAErB,IAAMnE,IAAI,KAAK,KAAKxB,CAAC,GACf0I,KAAQhJ,IAAI8B,KAAKA,GACjBmH,IAAK,UAAO,MAAM7J,EAAGS,EAAE,GACvBqJ,IAAK,UAAO,MAAM9J,EAAG4F,EAAE;MAC7B,IAAI,CAACiE,KAAM,CAACC,GAAI;MAChB,IAAMC,IAAKF,KAAMA,IAAKC,IAChBE,IAAKF,KAAMD,IAAKC;MAKtB,AAJA,EAAErJ,MAAMmG,IAAKgD,IAAOG,IAAK,OACzB,EAAEtJ,MAAMoG,IAAK+C,IAAOG,IAAK,OACzB,EAAEnE,MAAMgB,IAAKgD,IAAOI,IAAK,OACzB,EAAEpE,MAAMiB,IAAK+C,IAAOI,IAAK,OACzB,IAAQ;KACV,CAAC,GACG,CAACL,GAAO;IACd;GACF;EACF;CACF;AACF;AAIA,IAAaM,IAAiB;CAC5B,cAAc;CACd,QAAQ;CACR,OAAO;CACP,SAAS;CACT,SAAS;CACT,eAAe;CACf,YAAY;CACZ,MAAM;CAEN,YAAY;AACd,GAGaC,KACX,GACA,GACA,GACA,GACA,IAQI,CAAC,MACe;CACpB,IAAM,IAAIC,KAAW,CAAC,GAChB/B,IACJ,EAAE,YAAY,KACV,KACA,OAAO,EAAE,WAAY,WACnB,KAAK,IAAI,GAAG,EAAE,OAAO,IACrB6B,EAAe;CACvB,OAAO;EACL;EACA,GAAGG,EAAM,KAAK,IAAI,aAAaC,CAAC,CAAC,CAAC,KAAK,GAAG;EAC1C,GAAGD,EAAM,KAAK,IAAI,aAAaC,CAAC,CAAC,CAAC,KAAK,GAAG;EAC1C,QAAQD,EAAM,UAAU,IAAI,aAAaC,CAAC,CAAC,CAAC,KAAK,CAAC;EAClD,OAAOD,EAAM,SAAS,IAAI,WAAWC,CAAC;EACtC;EACA;EACA,QAAQD,EAAM,UAAU,IAAI,aAAaE,EAAO,MAAM,CAAC,CAAC,KAAK,CAAC;EAC9D,cAAc,EAAE,gBAAgBL,EAAe;EAC/C,cAAc,EAAE,gBAAgB;EAChC,QAAQ,EAAE,UAAUA,EAAe;EACnC,OAAO,EAAE,SAASA,EAAe;EACjC,SAAS,EAAE,WAAWA,EAAe;EACrC;EACA,eAAe,EAAE,iBAAiBA,EAAe;EACjD,YAAY,EAAE,cAAcA,EAAe;EAC3C,MAAM,EAAE,QAAQA,EAAe;EAC/B,OAAOG,EAAM,SAAS;EACtB,QAAQA,EAAM,UAAU;EACxB,SAAS,EAAE,eAAe,KAAQ,IAAIH,EAAe;CACvD;AACF,GAGaM,KACX,GACA,MAMG;CACH,IAAMC,oBAAQ,IAAI,IAAoB;CACtC,EAAM,SAAS,GAAM,MAAM;EACzB,AAAKA,EAAM,IAAIC,EAAK,EAAE,KAAGD,EAAM,IAAIC,EAAK,IAAIhK,CAAC;CAC/C,CAAC;CACD,IAAMgG,IAAc,CAAC,GACfpG,IAAc,CAAC,GACfqK,IAAc,CAAC;CASrB,OARAC,EAAM,SAAS,GAAM,MAAM;EACzB,IAAM9J,IAAI2J,EAAM,IAAII,EAAK,MAAM,GACzBvJ,IAAImJ,EAAM,IAAII,EAAK,MAAM;EAC/B,AAAI/J,MAAM,KAAA,KAAaQ,MAAM,KAAA,MAC7BoF,EAAE,KAAK5F,CAAC,GACRR,EAAE,KAAKgB,CAAC,GACRqJ,EAAE,KAAKhH,CAAC;CACV,CAAC,GACM;EACL;EACA,QAAQ,WAAW,KAAK+C,CAAC;EACzB,QAAQ,WAAW,KAAKpG,CAAC;EACzB,MAAM,WAAW,KAAKqK,CAAC;CACzB;AACF,GAEMG,KACJ,GACA,GACA,MACyB;CACzB,IAAM,EAAE,WAAQ,WAAQ,YAASN,EAAWO,GAAOH,CAAK,GAClDN,IAAIS,EAAM,QACVnL,IAAI,IAAI,aAAa0K,CAAC,CAAC,CAAC,KAAK,GAAG,GAChCzK,IAAI,IAAI,aAAayK,CAAC,CAAC,CAAC,KAAK,GAAG,GAChCU,IAAQ,IAAI,WAAWV,CAAC,GACxBxK,IAAS,IAAI,aAAawK,CAAC;CACjC,EAAM,SAAS,GAAM,MAAM;EAMzB,AALI,OAAO,SAASI,EAAK,CAAC,KAAK,OAAO,SAASA,EAAK,CAAC,MACnD,EAAEhK,KAAKgK,EAAK,GACZ,EAAEhK,KAAKgK,EAAK,GACRA,EAAK,UAAO,EAAMhK,KAAK,KAE7B,EAAOA,KAAK0J,GAAS,SAASM,GAAMhK,CAAC,KAAK;CAC5C,CAAC;CACD,IAAMuK,IAAS,MAAM,KAAKJ,IAAO,MAAMD,EAAMjH,EAAE,CAAC,KAAK,GAC/CuH,IAAQD,EAAO,QAAQ,MAAmB,OAAO,SAAS9H,CAAC,KAAKA,IAAK,CAAC,GACtEgI,IAAOD,EAAM,SACfA,EAAM,QAAQ,GAAG,MAAMpK,IAAIQ,GAAG,CAAC,IAAI4J,EAAM,SACzC,GACEjF,IAAS,aAAa,KAAKgF,IAAS,MACxC,OAAO,SAAS9H,CAAC,KAAKA,IAAK,IACvB,KAAK,IAAI,IAAK,KAAK,IAAI,GAAG,KAAK,KAAKA,IAAKgI,CAAI,CAAC,CAAC,IAC/C,CACN;CACA,OAAO3L,EAAY,CAAC,CAClB2K,EAAUG,GAAGC,GAAQa,GAAQhB,GAAS;EAAE;EAAG;EAAG;EAAO;EAAQ;CAAO,CAAC,CACvE;AACF,GAMaiB,KACX,GACA,GACA,MACyBP,EAAaC,GAAOH,GAAOR,CAAO,GAGhDkB,KACX,GACA,GACA,MACsB;CACtB,IAAMC,IAAMT,EAAaC,GAAOH,GAAOR,CAAO;CAC9C,OAAOmB,EAAI,KAAK,EAAE;CAElB,OADAA,EAAI,OAAO,GACJ;EAAE,GAAGA,EAAI;EAAG,GAAGA,EAAI;CAAE;AAC9B"}

package/dist/charts/engine/graph/geometry.cjs

@@ -0,0 +1,2 @@
+var e=(e,t,n,r,i,a,o,s,c)=>{let l=Math.hypot(r-t,i-n)+Math.hypot(a-r,o-i)+Math.hypot(s-a,c-o),u=Math.max(4,Math.min(28,Math.ceil(l/10)));for(let l=1;l<=u;l++){let d=l/u,f=1-d,p=f*f*f,m=3*f*f*d,h=3*f*d*d,g=d*d*d;e.push(p*t+m*r+h*a+g*s,p*n+m*i+h*o+g*c)}},t=(t,n,r,i,a,o)=>{let s=[t,n];return e(s,t,n,t+(r-t)*2/3,n+(i-n)*2/3,a+(r-a)*2/3,o+(i-o)*2/3,a,o),s},n=(t,n)=>{let r=[t[0],t[1]];for(let i=2;i<t.length;i+=2){let a=t[i-2],o=t[i-1],s=t[i],c=t[i+1];if(n){let t=(o+c)/2;e(r,a,o,a,t,s,t,s,c)}else{let t=(a+s)/2;e(r,a,o,t,o,t,c,s,c)}}return r},r=(e,t,n,r,i,a)=>{let o=e[e.length-2],s=e[e.length-1],c=Math.hypot(t-o,n-s),l=Math.hypot(r-t,i-n),u=Math.min(a,c/2,l/2);if(u<.5){e.push(t,n);return}let d=t-(t-o)/c*u,f=n-(n-s)/c*u,p=t+(r-t)/l*u,m=n+(i-n)/l*u;e.push(d,f);for(let r=1;r<=4;r++){let i=r/4,a=1-i;e.push(a*a*d+2*a*i*t+i*i*p,a*a*f+2*a*i*n+i*i*m)}},i=(e,t,n)=>{let r=[e[0],e[1]];for(let n=2;n<e.length;n+=2){let i=e[n-2],a=e[n-1],o=e[n],s=e[n+1];if(Math.abs(t?o-i:s-a)>.5){if(t){let e=(a+s)/2;r.push(i,e,o,e)}else{let e=(i+o)/2;r.push(e,a,e,s)}}r.push(o,s)}return a(r,n)},a=(e,t)=>{let n=[e[0],e[1]],i=e.length-2;for(let a=2;a<i;a+=2)r(n,e[a],e[a+1],e[a+2],e[a+3],t);return i>=2&&n.push(e[i],e[i+1]),n},o=(e,t,n,r=1)=>{let i=(e+t)/2,a=Math.abs(t-e)/2,o=2*Math.max(4,Math.min(32,Math.ceil(a/12))),s=[],c=e<t?Math.PI:0,l=e<t?0:Math.PI;for(let e=0;e<=o;e++){let t=c+(l-c)*e/o;s.push(i+a*Math.cos(t),n-a*r*Math.sin(t))}return s},s=(t,n,r,i,a,o)=>{let s=.42,c=.8,l=Math.max(i,a)+o*2.2,u=r-s,d=r+s,f=[t+Math.cos(u)*i,n+Math.sin(u)*i];return e(f,f[0],f[1],t+Math.cos(r-c)*l,n+Math.sin(r-c)*l,t+Math.cos(r+c)*l,n+Math.sin(r+c)*l,t+Math.cos(d)*a,n+Math.sin(d)*a),f},c=e=>{let t=0;for(let n=2;n<e.length;n+=2)t+=Math.hypot(e[n]-e[n-2],e[n+1]-e[n-1]);return t},l=(e,t,n)=>{let r=c(e);if(r<=t+n+1e-6){if(e.length<4)return e;let i=u(e,(t+n>0?t/(t+n):.5)*r);return[i[0],i[1],i[0],i[1]]}let i=[],a=u(e,t),o=u(e,r-n);i.push(a[0],a[1]);let s=0;for(let a=2;a<e.length;a+=2)s+=Math.hypot(e[a]-e[a-2],e[a+1]-e[a-1]),s>t&&s<r-n&&i.push(e[a],e[a+1]);return i.push(o[0],o[1]),i},u=(e,t)=>{let n=0;for(let r=2;r<e.length;r+=2){let i=e[r]-e[r-2],a=e[r+1]-e[r-1],o=Math.hypot(i,a);if(n+o>=t&&o>0){let s=(t-n)/o;return[e[r-2]+i*s,e[r-1]+a*s,i/o,a/o]}n+=o}let r=e.length-2,i=r>=2?e[r]-e[r-2]:1,a=r>=2?e[r+1]-e[r-1]:0,o=Math.hypot(i,a)||1;return[e[r],e[r+1],i/o,a/o]},d=e=>{for(let t=e.length-4;t>=0;t-=2){let n=e[e.length-2]-e[t],r=e[e.length-1]-e[t+1],i=Math.hypot(n,r);if(i>1e-9)return[n/i,r/i]}return[1,0]},f=(e,t,n,r,i)=>{if(!e)return t/2;let a=Math.abs(r),o=Math.abs(i),s=a>1e-9?t/2/a:1/0,c=o>1e-9?n/2/o:1/0;return Math.min(s,c)},p=(e,t,n,r,i,a,o)=>{let s=a*.42,c=t-r*a,l=n-i*a,u=c-i*s,d=l+r*s,f=c+i*s,p=l-r*s;e.push(u,d,t,n,f,p,u,d,o,o),e.push(t,n,c,l,o,o);let m=(u+c)/2,h=(d+l)/2,g=(f+c)/2,_=(p+l)/2;e.push(t,n,m,h,o,o,t,n,g,_,o,o)},m=(e,t,n,r,i,a,o,s)=>{let c=[t,n,r,i,a,o];c[0]>c[2]&&(c=[c[2],c[3],c[0],c[1],c[4],c[5]]),c[2]>c[4]&&(c=[c[0],c[1],c[4],c[5],c[2],c[3]]),c[0]>c[2]&&(c=[c[2],c[3],c[0],c[1],c[4],c[5]]);let[l,u,d,f,p,m]=c;if(!(p-l>1e-12))return;let h=u+(m-u)*(d-l)/(p-l);e.push(l,u,u,d,Math.max(f,h),Math.min(f,h),p,m,m,s,s,s)},h=(e,t,n,r,i)=>{let a=i*.5,o=e-n*i,s=t-r*i;return[e,t,o-r*a,s+n*a,e-n*i*.72,t-r*i*.72,o+r*a,s-n*a]},g=(e,t,n,r,i,a,o,s)=>{let[c,l,u,d,f,p,g,_]=h(n,r,i,a,o);m(e,c,l,u,d,f,p,s),m(e,c,l,f,p,g,_,s),t.push(u,d,c,l,g,_,f,p,u,d,s,s)},_=(e,t,n,r)=>{let i=[],a=c(e),o=t+n;if(o<=0||a<=0)return e.slice();for(let n=0;n<a;n+=o){let o=Math.min(a,n+t),s=u(e,n);i.push(s[0],s[1]);let c=0;for(let t=2;t<e.length;t+=2)c+=Math.hypot(e[t]-e[t-2],e[t+1]-e[t-1]),c>n&&c<o&&i.push(e[t],e[t+1]);let l=u(e,o);i.push(l[0],l[1],r,r)}return i},v=(e,t,n)=>{let r=1/0;for(let i=2;i<e.length;i+=2){let a=e[i-2],o=e[i-1],s=e[i]-a,c=e[i+1]-o,l=s*s+c*c,u=l>0?Math.max(0,Math.min(1,((t-a)*s+(n-o)*c)/l)):0,d=a+s*u-t,f=o+c*u-n;r=Math.min(r,d*d+f*f)}return r};exports.arcPath=o,exports.arrowHead=p,exports.boundaryDistance=f,exports.cubicPoints=e,exports.dashPath=_,exports.distanceToPath=v,exports.endDirection=d,exports.filledArrow=g,exports.loopPath=s,exports.orthogonalPath=i,exports.pathLength=c,exports.pointAt=u,exports.quadraticPath=t,exports.roundCorners=a,exports.splinePath=n,exports.triangleArea=m,exports.trimPath=l;
+//# sourceMappingURL=geometry.cjs.map