minerva-design 1.5.0 → 1.6.0

package/dist/native/charts/src/engine/shapes/chord.js

@@ -57,15 +57,18 @@ var f = (e) => {
 			m(r, a, o, s) && n.set(i.cell(o, s), t.has(o) || t.has(s) ? 0 : r.matrix[o][s]);
 		});
 	});
-}, g = (e, t) => {
-	let n = e.length, r = Array(n).fill(0), i = Array(n).fill(0);
-	for (let a = 0; a < n; a++) for (let o = 0; o < n; o++) t && a === o || (r[a] += e[a][o], i[o] += e[a][o]);
+}, g = (e) => e.every((t, n) => t.every((t, r) => {
+	let i = e[r]?.[n] ?? 0;
+	return Math.abs(t - i) <= 1e-9 * Math.max(1, Math.abs(t), Math.abs(i));
+})), ee = (e, t, n, r) => n === r || t ? e[n][r] : e[n][r] + e[r][n], _ = (e, t, n) => {
+	let r = e.length, i = Array(r).fill(0), a = Array(r).fill(0);
+	for (let n = 0; n < r; n++) for (let o = 0; o < r; o++) t && n === o || (i[n] += e[n][o], a[o] += e[n][o]);
 	return {
-		out: r,
-		inc: i,
-		value: r.map((e, n) => t ? e + i[n] : e)
+		out: i,
+		inc: a,
+		value: i.map((r, i) => t ? r + a[i] : n ? r : Math.max(0, r + a[i] - e[i][i]))
 	};
-}, _ = (e) => {
+}, v = (e) => {
 	if (!(e > 0) || !Number.isFinite(e)) return 0;
 	let t = 10 ** Math.floor(Math.log10(e));
 	for (let n of [
@@ -75,109 +78,109 @@ var f = (e) => {
 		10
 	]) if (n * t >= e * (1 - 1e-9)) return n * t;
 	return 10 * t;
-}, v = 12, y = 22, b = (c, l) => {
-	let { theme: h, area: b, measure: x, hidden: S } = l, C = f(c), { names: w, matrix: T } = C, E = w.length;
-	if (!E) return o(l);
-	let D = !!c.directed, ee = p(C), O = (e, t) => m(C, D, e, t), te = T.map((e, t) => e.map((e, n) => O(t, n) ? Math.max(0, l.value(ee.cell(t, n), S.has(t) || S.has(n) ? 0 : e)) : 0)), k = T.map((e, t) => e.map((e, n) => O(t, n) && !S.has(t) && !S.has(n) ? e : 0)), A = g(te, D), j = g(k, D), ne = j.value.reduce((e, t) => e + t, 0), M = w.map((e, t) => j.value[t] > 0 || A.value[t] > 1e-9 ? i(l.value(ee.group(t), +!S.has(t)), 0, 1) : 0), N = A.value.reduce((e, t) => e + t, 0);
-	if (N <= 1e-12) return o(l);
-	let re = g(T.map((e, t) => e.map((e, n) => O(t, n) ? e : 0)), D).value, P = w.map((e, t) => t);
+}, te = 12, ne = 22, y = (c, l) => {
+	let { theme: h, area: y, measure: b, hidden: x } = l, S = f(c), { names: C, matrix: w } = S, T = C.length;
+	if (!T) return o(l);
+	let E = !!c.directed, re = p(S), D = (e, t) => m(S, E, e, t), O = w.map((e, t) => e.map((e, n) => D(t, n) ? Math.max(0, l.value(re.cell(t, n), x.has(t) || x.has(n) ? 0 : e)) : 0)), k = w.map((e, t) => e.map((e, n) => D(t, n) && !x.has(t) && !x.has(n) ? e : 0)), A = !E && g(w.map((e, t) => e.map((e, n) => D(t, n) ? e : 0))), ie = (e, t, n) => ee(e, A, t, n), j = _(O, E, A), M = _(k, E, A), ae = M.value.reduce((e, t) => e + t, 0), N = C.map((e, t) => M.value[t] > 0 || j.value[t] > 1e-9 ? i(l.value(re.group(t), +!x.has(t)), 0, 1) : 0), oe = j.value.reduce((e, t) => e + t, 0);
+	if (oe <= 1e-12) return o(l);
+	let se = _(w.map((e, t) => e.map((e, n) => D(t, n) ? e : 0)), E, A).value, P = C.map((e, t) => t);
 	if (c.sortGroups === "ascending" || c.sortGroups === "descending") {
 		let e = c.sortGroups === "ascending" ? 1 : -1;
-		P.sort((t, n) => e * (re[t] - re[n]) || t - n);
+		P.sort((t, n) => e * (se[t] - se[n]) || t - n);
 	}
-	let F = Array(E);
+	let F = Array(T);
 	P.forEach((e, t) => F[e] = t);
-	let I = b.x + b.width / 2, L = b.y + b.height / 2, R = Math.min(b.width, b.height) / 2, ie = c.labels ?? "auto", z = n(h, v, 500), ae = n(h, 10), B = c.ticks, oe = B === !1 ? !1 : typeof B == "number" ? B > 0 : R >= 150, V = oe ? y : 0, H = i(s(c.padAngle, 2), 0, 45) * (Math.PI / 180), se = H * M.reduce((e, t) => e + t, 0), U = se > r * .5 ? r * .5 / se : 1, ce = (r - se * U) / N, le = -Math.PI / 2 + s(c.startAngle) * Math.PI / 180, W = Array(E);
+	let I = y.x + y.width / 2, L = y.y + y.height / 2, R = Math.min(y.width, y.height) / 2, ce = c.labels ?? "auto", z = n(h, te, 500), le = n(h, 10), B = c.ticks, ue = B === !1 ? !1 : typeof B == "number" ? B > 0 : R >= 150, V = ue ? ne : 0, H = i(s(c.padAngle, 2), 0, 45) * (Math.PI / 180), de = H * N.reduce((e, t) => e + t, 0), U = de > r * .5 ? r * .5 / de : 1, fe = (r - de * U) / oe, pe = -Math.PI / 2 + s(c.startAngle) * Math.PI / 180, W = Array(T);
 	{
-		let e = le + H * U * (M[P[0]] ?? 0) / 2;
+		let e = pe + H * U * (N[P[0]] ?? 0) / 2;
 		for (let t of P) {
-			let n = e, r = n + A.value[t] * ce;
+			let n = e, r = n + j.value[t] * fe;
 			W[t] = {
 				a0: n,
 				a1: r
-			}, e = r + H * U * M[t];
+			}, e = r + H * U * N[t];
 		}
 	}
-	let G = (e) => W[e].a1 - W[e].a0 > 1e-6, ue = w.map((e) => x(e, z)), de = (e) => P.every((t) => !G(t) || ue[t] + 6 <= (W[t].a1 - W[t].a0 + H * U * .8) * e), K = ie === "none" ? "none" : ie === "radial" ? "radial" : "tangential";
-	ie === "auto" && !de(Math.max(1, R - 12)) && (K = "radial");
-	let fe = (e) => {
+	let G = (e) => W[e].a1 - W[e].a0 > 1e-6, me = C.map((e) => b(e, z)), he = (e) => P.every((t) => !G(t) || me[t] + 6 <= (W[t].a1 - W[t].a0 + H * U * .8) * e), K = ce === "none" ? "none" : ce === "radial" ? "radial" : "tangential";
+	ce === "auto" && !he(Math.max(1, R - 12)) && (K = "radial");
+	let ge = (e) => {
 		let t = Math.abs(Math.cos(e)), n = Math.abs(Math.sin(e));
-		return Math.min(t > 1e-6 ? (b.width / 2 - 2) / t : Infinity, n > 1e-6 ? (b.height / 2 - v / 2 - 1) / n : Infinity);
-	}, pe = (e) => (W[e].a0 + W[e].a1) / 2, me = (e) => Math.abs(Math.sin(e)) > .92, q;
+		return Math.min(t > 1e-6 ? (y.width / 2 - 2) / t : Infinity, n > 1e-6 ? (y.height / 2 - te / 2 - 1) / n : Infinity);
+	}, _e = (e) => (W[e].a0 + W[e].a1) / 2, ve = (e) => Math.abs(Math.sin(e)) > .92, q;
 	if (K === "radial") {
 		q = R - V - 8;
-		for (let e of P) if (G(e) && M[e] > .5) {
-			let t = pe(e), n = me(t) ? 14 : ue[e];
-			q = Math.min(q, fe(t) - n - V - 10);
+		for (let e of P) if (G(e) && N[e] > .5) {
+			let t = _e(e), n = ve(t) ? 14 : me[e];
+			q = Math.min(q, ge(t) - n - V - 10);
 		}
 		q = Math.max(R * .5, q);
 	} else q = R - V - (K === "none" ? 0 : 22) - 2;
 	q = Math.max(16, q);
-	let he = i(s(c.arcWidth, i(q * .06, 8, 18)), 2, q * .5), ge = q - he, J = Math.max(4, ge - 2), Y = w.map(() => []);
-	for (let e = 0; e < E; e++) for (let t = 0; t < E; t++) D ? O(e, t) && (Y[e].push({
+	let ye = i(s(c.arcWidth, i(q * .06, 8, 18)), 2, q * .5), be = q - ye, J = Math.max(4, be - 2), Y = C.map(() => []);
+	for (let e = 0; e < T; e++) for (let t = 0; t < T; t++) E ? D(e, t) && (Y[e].push({
 		j: t,
 		dir: "out",
-		raw: T[e][t],
+		raw: w[e][t],
 		a0: 0,
 		a1: 0
 	}), Y[t].push({
 		j: e,
 		dir: "in",
-		raw: T[e][t],
+		raw: w[e][t],
 		a0: 0,
 		a1: 0
-	})) : (O(e, t) || O(t, e)) && Y[e].push({
+	})) : (D(e, t) || D(t, e)) && Y[e].push({
 		j: t,
 		dir: "out",
-		raw: T[e][t],
+		raw: w[e][t],
 		a0: 0,
 		a1: 0
 	});
-	let _e = c.sortSubgroups ?? "auto";
+	let xe = c.sortSubgroups ?? "auto";
 	Y.forEach((e, t) => {
 		let n = (e) => {
-			let n = (F[e] - F[t] + E) % E;
-			return n === 0 ? E / 2 : n;
+			let n = (F[e] - F[t] + T) % T;
+			return n === 0 ? T / 2 : n;
 		};
 		e.sort((e, t) => {
 			let r = Number(e.dir === "in") - Number(t.dir === "in");
-			return _e === "ascending" || _e === "descending" ? (_e === "ascending" ? 1 : -1) * (e.raw - t.raw) || F[e.j] - F[t.j] || r : _e === "none" ? F[e.j] - F[t.j] || r : n(t.j) - n(e.j) || r;
+			return xe === "ascending" || xe === "descending" ? (xe === "ascending" ? 1 : -1) * (e.raw - t.raw) || F[e.j] - F[t.j] || r : xe === "none" ? F[e.j] - F[t.j] || r : n(t.j) - n(e.j) || r;
 		});
 		let r = W[t].a0;
 		for (let n of e) {
-			let e = n.dir === "out" ? te[t][n.j] : te[n.j][t];
-			n.a0 = r, n.a1 = r + e * ce, r = n.a1;
+			let e = E ? n.dir === "out" ? O[t][n.j] : O[n.j][t] : ie(O, t, n.j);
+			n.a0 = r, n.a1 = r + e * fe, r = n.a1;
 		}
 	});
-	let ve = (e, t, n) => Y[e].find((e) => e.j === t && e.dir === n), X = w.map((e, t) => l.color(C.colors[t], t)).map((e) => t(e)), ye = t(e(h.grid, h.textMuted, .45)), be = c.ribbonColor ?? "gradient", xe = i(s(c.ribbonOpacity, .65), .02, 1), Se = Math.min(1, xe + .25), Ce = c.arrows ?? D ? i(J * .07, 5, 12) : 0, Z = [], we = (e, t) => E + e * E + t;
-	for (let e = 0; e < E; e++) for (let t = D ? 0 : e; t < E; t++) if (D) {
-		if (!O(e, t)) continue;
-		let n = ve(e, t, "out"), r = ve(t, e, "in");
+	let Se = (e, t, n) => Y[e].find((e) => e.j === t && e.dir === n), X = C.map((e, t) => l.color(S.colors[t], t)).map((e) => t(e)), Ce = t(e(h.grid, h.textMuted, .45)), we = c.ribbonColor ?? "gradient", Te = i(s(c.ribbonOpacity, .65), .02, 1), Ee = Math.min(1, Te + .25), De = c.arrows ?? E ? i(J * .07, 5, 12) : 0, Z = [], Oe = (e, t) => T + e * T + t;
+	for (let e = 0; e < T; e++) for (let t = E ? 0 : e; t < T; t++) if (E) {
+		if (!D(e, t)) continue;
+		let n = Se(e, t, "out"), r = Se(t, e, "in");
 		n && r && Z.push({
-			index: we(e, t),
+			index: Oe(e, t),
 			s: e,
 			t,
 			src: n,
 			tgt: r
 		});
 	} else {
-		if (!O(e, t) && !O(t, e)) continue;
-		let [n, r] = T[t][e] > T[e][t] ? [t, e] : [e, t], i = ve(n, r, "out"), a = ve(r, n, "out");
+		if (!D(e, t) && !D(t, e)) continue;
+		let [n, r] = w[t][e] > w[e][t] ? [t, e] : [e, t], i = Se(n, r, "out"), a = Se(r, n, "out");
 		i && a && Z.push({
-			index: we(n, r),
+			index: Oe(n, r),
 			s: n,
 			t: r,
 			src: i,
 			tgt: a
 		});
 	}
-	let Q = w.map(() => []);
+	let Q = C.map(() => []);
 	for (let e of Z) Q[e.s].push(e.index), e.t !== e.s && Q[e.t].push(e.index);
-	let $ = [], Te = (e) => e.src.a1 - e.src.a0 + (e.tgt.a1 - e.tgt.a0);
-	for (let e of Z.slice().sort((e, t) => Te(t) - Te(e))) {
-		if (Te(e) <= 1e-6) continue;
-		let n = C.cellColors.get(e.s * E + e.t) ?? (D ? void 0 : C.cellColors.get(e.t * E + e.s)), r, i;
-		n ? r = i = t(l.color(n, e.s)) : be === "source" ? r = i = X[e.s] : be === "target" ? r = i = X[e.t] : be === "neutral" ? r = i = ye : (r = X[e.s], i = X[e.t]), $.push({
+	let $ = [], ke = (e) => e.src.a1 - e.src.a0 + (e.tgt.a1 - e.tgt.a0);
+	for (let e of Z.slice().sort((e, t) => ke(t) - ke(e))) {
+		if (ke(e) <= 1e-6) continue;
+		let n = S.cellColors.get(e.s * T + e.t) ?? (E ? void 0 : S.cellColors.get(e.t * T + e.s)), r, i;
+		n ? r = i = t(l.color(n, e.s)) : we === "source" ? r = i = X[e.s] : we === "target" ? r = i = X[e.t] : we === "neutral" ? r = i = Ce : (r = X[e.s], i = X[e.t]), $.push({
 			kind: "ribbon",
 			cx: I,
 			cy: L,
@@ -186,11 +189,11 @@ var f = (e) => {
 			s1: e.src.a1,
 			t0: e.tgt.a0,
 			t1: e.tgt.a1,
-			head: e.s === e.t ? 0 : Ce,
+			head: e.s === e.t ? 0 : De,
 			color0: r,
 			color1: i,
-			alpha: xe,
-			activeAlpha: Se,
+			alpha: Te,
+			activeAlpha: Ee,
 			hit: e.index,
 			also: e.s === e.t ? [e.s] : [e.s, e.t]
 		});
@@ -199,50 +202,50 @@ var f = (e) => {
 		kind: "sector",
 		cx: I,
 		cy: L,
-		r0: ge,
+		r0: be,
 		r1: q,
 		a0: W[e].a0,
 		a1: W[e].a1,
 		pad: 0,
-		corner: Math.min(2, he / 4),
+		corner: Math.min(2, ye / 4),
 		fill: X[e],
 		hit: e,
 		also: Q[e],
-		alpha: M[e]
+		alpha: N[e]
 	});
-	let Ee = t(h.textMuted), De = t(h.textMuted, .7);
-	if (oe) {
-		let e = ce * q, t = c.tickFormat ?? d(l.locale), n = x(t(Math.max(...re)), ae) + 14, i = typeof B == "number" ? B : _(n / Math.max(e, 1e-12)), a = N / Math.max(i, 1e-12);
-		(!(i > 0) || a > 240) && (i = _(N / 240));
+	let Ae = t(h.textMuted), je = t(h.textMuted, .7);
+	if (ue) {
+		let e = fe * q, t = c.tickFormat ?? d(l.locale), n = b(t(Math.max(...se)), le) + 14, i = typeof B == "number" ? B : v(n / Math.max(e, 1e-12)), a = oe / Math.max(i, 1e-12);
+		(!(i > 0) || a > 240) && (i = v(oe / 240));
 		let o = i / 5 * e >= 5 ? i / 5 : i / 2 * e >= 5 ? i / 2 : i, s = Math.round(i / o), f = q + 2, p = q + 15, m = -Infinity, h = null;
 		for (let n of P) {
 			if (!G(n)) continue;
 			let { a0: i, a1: a } = W[n], c = Q[n];
 			for (let l = 0;; l++) {
-				let d = i + l * o * ce;
+				let d = i + l * o * fe;
 				if (d > a + 1e-9) break;
-				let g = l % s === 0, _ = g ? 5 : 3;
+				let g = l % s === 0, ee = g ? 5 : 3;
 				if ((e * o >= 3 || g) && $.push({
 					kind: "line",
 					points: [
 						I + f * Math.cos(d),
 						L + f * Math.sin(d),
-						I + (f + _) * Math.cos(d),
-						L + (f + _) * Math.sin(d)
+						I + (f + ee) * Math.cos(d),
+						L + (f + ee) * Math.sin(d)
 					],
-					color: De,
+					color: je,
 					width: 1,
 					hit: n,
 					also: c
 				}), !g) continue;
-				let v = t(l * o), y = (x(v, ae) / 2 + 3) / p;
-				d - y < m || h !== null && d + y > h + r || (h === null && (h = d - y), m = d + y, $.push({
+				let _ = t(l * o), v = (b(_, le) / 2 + 3) / p;
+				d - v < m || h !== null && d + v > h + r || (h === null && (h = d - v), m = d + v, $.push({
 					kind: "text",
 					x: I + p * Math.cos(d),
 					y: L + p * Math.sin(d),
-					text: v,
-					font: ae,
-					color: Ee,
+					text: _,
+					font: le,
+					color: Ae,
 					align: "center",
 					baseline: "middle",
 					rotate: u(d + Math.PI / 2),
@@ -257,11 +260,11 @@ var f = (e) => {
 			let a = [], o = Math.max(1, Math.ceil(i / 6));
 			for (let s = 0; s <= o; s++) a.push([e + n * i * s / o, t + r * i * s / o]);
 			return a;
-		}, o = (e) => r.some((t) => t.some(([t, n]) => e.some(([e, r]) => Math.hypot(t - e, n - r) < 15))), s = P.filter((e) => G(e) && M[e] > .5).sort((e, t) => A.value[t] - A.value[e]);
+		}, o = (e) => r.some((t) => t.some(([t, n]) => e.some(([e, r]) => Math.hypot(t - e, n - r) < 15))), s = P.filter((e) => G(e) && N[e] > .5).sort((e, t) => j.value[t] - j.value[e]);
 		for (let t of s) {
 			let { a0: s, a1: c } = W[t], l = (s + c) / 2;
 			if (K === "tangential") {
-				let r = (c - s + H * U * .8) * (e + 6) - 6, i = a(w[t], r, z, x);
+				let r = (c - s + H * U * .8) * (e + 6) - 6, i = a(C[t], r, z, b);
 				if (!i) continue;
 				$.push({
 					kind: "text",
@@ -279,16 +282,16 @@ var f = (e) => {
 				continue;
 			}
 			let d = I + e * Math.cos(l), f = L + e * Math.sin(l);
-			if (me(l)) {
+			if (ve(l)) {
 				let s = f + Math.sign(Math.sin(l)) * 7, c = Math.cos(l) >= 0 ? "left" : "right", u = [
 					"center",
 					c,
 					c === "left" ? "right" : "left"
 				], p = (t) => t.every(([t, n]) => Math.hypot(t - I, n - L) >= e + 2);
 				for (let e of u) {
-					let c = e === "center" ? 2 * Math.min(d - b.x, b.x + b.width - d) - 4 : e === "left" ? b.x + b.width - d - 2 : d - b.x - 2, l = a(w[t], c, z, x);
+					let c = e === "center" ? 2 * Math.min(d - y.x, y.x + y.width - d) - 4 : e === "left" ? y.x + y.width - d - 2 : d - y.x - 2, l = a(C[t], c, z, b);
 					if (!l) continue;
-					let u = x(l, z), f = i(e === "left" ? d : e === "right" ? d - u : d - u / 2, s, 1, 0, u);
+					let u = b(l, z), f = i(e === "left" ? d : e === "right" ? d - u : d - u / 2, s, 1, 0, u);
 					if (p(f) && !o(f)) {
 						r.push(f), $.push({
 							kind: "text",
@@ -307,9 +310,9 @@ var f = (e) => {
 				}
 				continue;
 			}
-			let p = a(w[t], fe(l) - e - 2, z, x);
+			let p = a(C[t], ge(l) - e - 2, z, b);
 			if (!p) continue;
-			let m = i(d, f, Math.cos(l), Math.sin(l), x(p, z));
+			let m = i(d, f, Math.cos(l), Math.sin(l), b(p, z));
 			if (o(m)) continue;
 			r.push(m);
 			let h = Math.cos(l) >= 0;
@@ -328,14 +331,14 @@ var f = (e) => {
 			});
 		}
 	}
-	let Oe = [], ke = D || T.some((e, t) => e.some((e, n) => Math.abs(e - T[n][t]) > 1e-12));
+	let Me = [];
 	for (let e of P) {
-		let t = j.value[e];
-		if (!(t > 0) || S.has(e)) continue;
-		let n = ne > 0 ? t / ne : 0, r = (W[e].a0 + W[e].a1) / 2;
-		Oe.push({
+		let t = M.value[e];
+		if (!(t > 0) || x.has(e)) continue;
+		let n = ae > 0 ? t / ae : 0, r = (W[e].a0 + W[e].a1) / 2;
+		Me.push({
 			index: e,
-			name: w[e],
+			name: C[e],
 			value: t,
 			percent: n,
 			share: l.percent(n),
@@ -343,17 +346,17 @@ var f = (e) => {
 			x: I + q * Math.cos(r),
 			y: L + q * Math.sin(r),
 			rows: [
-				...D || !ke ? [{
+				{
 					name: l.labels.value,
 					value: l.format(t)
-				}] : [],
-				...ke ? [{
+				},
+				...A ? [] : [{
 					name: l.labels.outgoing,
-					value: l.format(j.out[e])
+					value: l.format(M.out[e])
 				}, {
 					name: l.labels.incoming,
-					value: l.format(j.inc[e])
-				}] : [],
+					value: l.format(M.inc[e])
+				}],
 				{
 					name: l.labels.share,
 					value: l.percent(n)
@@ -361,10 +364,12 @@ var f = (e) => {
 			]
 		});
 	}
-	let Ae = k.reduce((e, t) => e + t.reduce((e, t) => e + t, 0), 0), je = Z.filter((e) => k[e.s][e.t] > 0 || k[e.t][e.s] > 0).sort((e, t) => F[e.s] - F[t.s] || e.src.a0 - t.src.a0 || F[e.t] - F[t.t]);
-	for (let e of je) {
-		let t = k[e.s][e.t], n = e.s !== e.t && k[e.s][e.t] + k[e.t][e.s] > 0 ? T[e.t][e.s] : 0, r = Ae > 0 ? t / Ae : 0, i = w[e.s], a = w[e.t], o = (e.src.a0 + e.src.a1) / 2, s = (e.tgt.a0 + e.tgt.a1) / 2, c = e.s === e.t ? I + J * .7 * Math.cos(o) : .25 * (I + J * Math.cos(o)) + .5 * I + .25 * (I + J * Math.cos(s)), u = e.s === e.t ? L + J * .7 * Math.sin(o) : .25 * (L + J * Math.sin(o)) + .5 * L + .25 * (L + J * Math.sin(s));
-		Oe.push({
+	let Ne = (e, t) => E ? k[e][t] : ie(k, e, t), Pe = 0;
+	for (let e = 0; e < T; e++) for (let t = E ? 0 : e; t < T; t++) Pe += Ne(e, t);
+	let Fe = Z.filter((e) => k[e.s][e.t] > 0 || k[e.t][e.s] > 0).sort((e, t) => F[e.s] - F[t.s] || e.src.a0 - t.src.a0 || F[e.t] - F[t.t]);
+	for (let e of Fe) {
+		let t = k[e.s][e.t], n = e.s !== e.t && k[e.s][e.t] + k[e.t][e.s] > 0 ? w[e.t][e.s] : 0, r = Pe > 0 ? Ne(e.s, e.t) / Pe : 0, i = C[e.s], a = C[e.t], o = (e.src.a0 + e.src.a1) / 2, s = (e.tgt.a0 + e.tgt.a1) / 2, c = e.s === e.t ? I + J * .7 * Math.cos(o) : .25 * (I + J * Math.cos(o)) + .5 * I + .25 * (I + J * Math.cos(s)), u = e.s === e.t ? L + J * .7 * Math.sin(o) : .25 * (L + J * Math.sin(o)) + .5 * L + .25 * (L + J * Math.sin(s));
+		Me.push({
 			index: e.index,
 			name: e.s === e.t ? i : `${i} \u2192 ${a}`,
 			value: t,
@@ -378,7 +383,7 @@ var f = (e) => {
 					name: l.labels.value,
 					value: l.format(t)
 				},
-				...e.s !== e.t && (!D || n > 0) ? [{
+				...e.s !== e.t && (E ? n > 0 : !A) ? [{
 					name: l.labels.reverse,
 					value: l.format(n)
 				}] : [],
@@ -394,21 +399,21 @@ var f = (e) => {
 			}
 		});
 	}
-	let Me = i(l.enter, 0, 1);
+	let Ie = i(l.enter, 0, 1);
 	return {
 		nodes: $,
-		items: Oe,
+		items: Me,
 		dim: .25,
 		empty: !1,
-		...Me < 1 ? { enter: {
-			alpha: Me,
-			scale: .94 + .06 * Me,
+		...Ie < 1 ? { enter: {
+			alpha: Ie,
+			scale: .94 + .06 * Ie,
 			cx: I,
 			cy: L
 		} } : {}
 	};
 };
 //#endregion
-export { h as chordValues, b as layoutChord, f as resolveChord };
+export { h as chordValues, y as layoutChord, f as resolveChord };
 
 //# sourceMappingURL=chord.js.map