@kong-ui-public/documentation 1.5.77 → 1.6.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (63) hide show
  1. package/dist/{arc-DZdQjcG8-C_2Dx6GQ.js → arc-DZdQjcG8-CduayE88.js} +2 -2
  2. package/dist/{architectureDiagram-3BPJPVTR-By_DXDyu-DTj86bUZ.js → architectureDiagram-3BPJPVTR-By_DXDyu-U3MSLbOU.js} +1506 -1513
  3. package/dist/blockDiagram-GPEHLZMM-9Cp9Hbl7-CKP-SiVG.js +3268 -0
  4. package/dist/{c4Diagram-AAUBKEIU-ftdwlfdB-CYiERTWJ.js → c4Diagram-AAUBKEIU-ftdwlfdB-D3A61SdV.js} +11 -12
  5. package/dist/{channel-DM9j7IFL-CjNPz4Hd.js → channel-DM9j7IFL-DxqBUxfY.js} +1 -1
  6. package/dist/{chunk-2J33WTMH-CBbjVzWb-BAAd-TK5.js → chunk-2J33WTMH-CBbjVzWb-0og4LHQ-.js} +7 -8
  7. package/dist/chunk-4BX2VUAB-C_NnimAy--QQ0Db2V.js +8 -0
  8. package/dist/{chunk-55IACEB6-DZn1aNO0-_bs5ibIB.js → chunk-55IACEB6-DZn1aNO0-A3zOZ7dT.js} +1 -1
  9. package/dist/{chunk-727SXJPM-B2_6_WLv-CzbzsbtK.js → chunk-727SXJPM-B2_6_WLv-Bs3CxHaX.js} +548 -549
  10. package/dist/{chunk-AQP2D5EJ-DEAEiJjW-BPr5JvkB.js → chunk-AQP2D5EJ-DEAEiJjW-DTbwZT8N.js} +446 -458
  11. package/dist/{chunk-FMBD7UC4-D_tZ4Dxg-BUygZnCT.js → chunk-FMBD7UC4-D_tZ4Dxg-DwjoPGUH.js} +1 -1
  12. package/dist/{chunk-ND2GUHAM-Duw3k8MU-Dr8SD23L.js → chunk-ND2GUHAM-Duw3k8MU-HmrdHLJ9.js} +1 -1
  13. package/dist/{chunk-QZHKN3VN-DN6nBdn0-DxWE5zsM.js → chunk-QZHKN3VN-DN6nBdn0-BvQOETVz.js} +1 -1
  14. package/dist/classDiagram-4FO5ZUOK-Du5qFrfN-BqXc0etQ.js +17 -0
  15. package/dist/classDiagram-v2-Q7XG4LA2-DM6zutfc-BqXc0etQ.js +17 -0
  16. package/dist/{cose-bilkent-S5V4N54A-0ZumbVgj-BKcFQWbE.js → cose-bilkent-S5V4N54A-0ZumbVgj-0z7CQbIH.js} +465 -465
  17. package/dist/{cytoscape.esm-BDIiOYYO-BbddfVIJ.js → cytoscape.esm-BDIiOYYO-C1jMBhD8.js} +356 -371
  18. package/dist/dagre-BM42HDAG-qMWMsyLb-DGMrq3i3.js +288 -0
  19. package/dist/{dagre-DJxg_nfI-BzVw7cNP.js → dagre-DJxg_nfI-hVOVexz-.js} +9 -9
  20. package/dist/{diagram-2AECGRRQ-B2gF_dHe-DCRSlKG-.js → diagram-2AECGRRQ-B2gF_dHe-Bv_EpxRz.js} +10 -14
  21. package/dist/{diagram-5GNKFQAL-DJ9WwRrD-DtSWJY6-.js → diagram-5GNKFQAL-DJ9WwRrD-WVvm0Icu.js} +4 -4
  22. package/dist/{diagram-KO2AKTUF-RfkqD-VW-ZR9mxccc.js → diagram-KO2AKTUF-RfkqD-VW-yyAds1Qq.js} +153 -156
  23. package/dist/{diagram-LMA3HP47-Ct7s9hIt-DXtPBRn4.js → diagram-LMA3HP47-Ct7s9hIt-Dy6f9BAO.js} +21 -22
  24. package/dist/{diagram-OG6HWLK6-BSYJ2CoI-DX1BfXw6.js → diagram-OG6HWLK6-BSYJ2CoI-ckmfat-L.js} +79 -81
  25. package/dist/documentation.es.js +1 -1
  26. package/dist/documentation.umd.js +374 -374
  27. package/dist/{erDiagram-TEJ5UH35-BudwiSYX-BPA5-1u6.js → erDiagram-TEJ5UH35-BudwiSYX-bVzp1Kjr.js} +134 -135
  28. package/dist/{flowDiagram-I6XJVG4X-B23Smlxp-Cb24VZnb.js → flowDiagram-I6XJVG4X-B23Smlxp-ClHvdCdJ.js} +842 -849
  29. package/dist/{ganttDiagram-6RSMTGT7-C-i89z_P-DEdTFlTH.js → ganttDiagram-6RSMTGT7-C-i89z_P-t5UAyRM5.js} +46 -46
  30. package/dist/gitGraphDiagram-PVQCEYII-DpVfXnUD-Cg3smOdz.js +734 -0
  31. package/dist/{graphlib-D2YdGpuK-CM8PX5pf.js → graphlib-D2YdGpuK-CnQPmzkS.js} +17 -17
  32. package/dist/{index-Dpyqhws4.js → index-DfVKdDwj.js} +16258 -16515
  33. package/dist/{infoDiagram-5YYISTIA-CDUwzFql-BsbTK2Me.js → infoDiagram-5YYISTIA-CDUwzFql-Bmthmcp4.js} +2 -2
  34. package/dist/{ishikawaDiagram-YF4QCWOH-MfYdx0rK-DsWP0O6d.js → ishikawaDiagram-YF4QCWOH-MfYdx0rK-cbltssua.js} +137 -138
  35. package/dist/{journeyDiagram-JHISSGLW-C_udOPtJ-BkIf9B4Q.js → journeyDiagram-JHISSGLW-C_udOPtJ-BjAvgSAR.js} +13 -13
  36. package/dist/{kanban-definition-UN3LZRKU-C1Su-UOY-6sw-wDwK.js → kanban-definition-UN3LZRKU-C1Su-UOY-DZ93dsWZ.js} +334 -336
  37. package/dist/{katex-D7tFlpqA-B7yKriH4.js → katex-D7tFlpqA-BOSQxXe1.js} +254 -256
  38. package/dist/{linear-1MXhYum8-CfR5ywK4.js → linear-1MXhYum8-9C1jno9G.js} +5 -5
  39. package/dist/{mindmap-definition-RKZ34NQL-MuSV765K-Cv2rDIFS.js → mindmap-definition-RKZ34NQL-MuSV765K-Kub1iXFv.js} +94 -97
  40. package/dist/{ordinal-D9ksOc8y-CrGveXkB.js → ordinal-D9ksOc8y-2hZwLyEk.js} +1 -1
  41. package/dist/{pieDiagram-4H26LBE5-TgFp7J6_-C8m2xJbj.js → pieDiagram-4H26LBE5-TgFp7J6_-i6NxP3Xz.js} +43 -44
  42. package/dist/{quadrantDiagram-W4KKPZXB-DKPne3o_-D0Tfl8NQ.js → quadrantDiagram-W4KKPZXB-DKPne3o_-DXLHqRuR.js} +351 -353
  43. package/dist/{requirementDiagram-4Y6WPE33-vh8uUAp_-C5zLx-_o.js → requirementDiagram-4Y6WPE33-vh8uUAp_-CHtsISxP.js} +384 -386
  44. package/dist/{sankeyDiagram-5OEKKPKP-Cgs6W_El-DBrv4QL_.js → sankeyDiagram-5OEKKPKP-Cgs6W_El-D7GZyd8n.js} +178 -178
  45. package/dist/{sequenceDiagram-3UESZ5HK-C5F57Dkt-D6DqZiJP.js → sequenceDiagram-3UESZ5HK-C5F57Dkt-BW1Hb7UW.js} +643 -653
  46. package/dist/{stateDiagram-AJRCARHV-09dUKG6Y-9QhAIhCk.js → stateDiagram-AJRCARHV-09dUKG6Y-Dm2a1vNu.js} +5 -5
  47. package/dist/stateDiagram-v2-BHNVJYJU-CWqmRt12-DbWzZ-j-.js +16 -0
  48. package/dist/style.css +1 -1
  49. package/dist/timeline-definition-PNZ67QCA-CCndyx0V-B5CT96H-.js +1095 -0
  50. package/dist/{vennDiagram-CIIHVFJN-DQfKxM3L-086u82L3.js → vennDiagram-CIIHVFJN-DQfKxM3L-qUaKEl7l.js} +596 -603
  51. package/dist/{wardley-L42UT6IY-BjAkE_cs-li1xYed9.js → wardley-L42UT6IY-BjAkE_cs-C-giFqos.js} +5760 -5809
  52. package/dist/wardleyDiagram-YWT4CUSO-Bf9L2NsL-DXPF2Ee9.js +639 -0
  53. package/dist/{xychartDiagram-2RQKCTM6-ChNH3q1U--vbcTXH5.js → xychartDiagram-2RQKCTM6-ChNH3q1U-a59DsJDA.js} +10 -10
  54. package/package.json +4 -4
  55. package/dist/blockDiagram-GPEHLZMM-9Cp9Hbl7-CSQRWfog.js +0 -3278
  56. package/dist/chunk-4BX2VUAB-C_NnimAy-B-8x_g6K.js +0 -9
  57. package/dist/classDiagram-4FO5ZUOK-Du5qFrfN-DLmqgbj1.js +0 -17
  58. package/dist/classDiagram-v2-Q7XG4LA2-DM6zutfc-DLmqgbj1.js +0 -17
  59. package/dist/dagre-BM42HDAG-qMWMsyLb-BzK2-5zM.js +0 -291
  60. package/dist/gitGraphDiagram-PVQCEYII-DpVfXnUD-BtfdBLxW.js +0 -747
  61. package/dist/stateDiagram-v2-BHNVJYJU-CWqmRt12-Br5eF-5b.js +0 -16
  62. package/dist/timeline-definition-PNZ67QCA-CCndyx0V-CkhwKYjQ.js +0 -1106
  63. package/dist/wardleyDiagram-YWT4CUSO-Bf9L2NsL-CCMCDU5F.js +0 -647
@@ -1,67 +1,67 @@
1
- import { G as Gt, K as Wt, i as Vt, f as Kt, W as Xt, U as Ht, p as w, o as wt, a0 as Yt, q as it, ba as Zt, ar as Jt, as as Qt, at as te, A as ee, H as ne, s as se, bb as ie, F as re } from "./index-Dpyqhws4.js";
1
+ import { G as Gt, K as Wt, i as Vt, f as Kt, W as Xt, U as Ht, p as w, o as wt, a0 as Yt, q as it, ba as Zt, ar as Jt, as as Qt, at as te, A as ee, H as ne, s as se, bb as ie, F as re } from "./index-DfVKdDwj.js";
2
2
  var It = (t, n) => ie(t, "a", -n), Et = 1e-10;
3
3
  function nt(t, n) {
4
- let s = ae(t), e = s.filter((o) => le(o, t)), i = 0, r = 0, a = [];
4
+ let s = ae(t), e = s.filter((h) => le(h, t)), i = 0, r = 0, o = [];
5
5
  if (e.length > 1) {
6
- let o = zt(e);
7
- for (let h = 0; h < e.length; ++h) {
8
- let u = e[h];
9
- u.angle = Math.atan2(u.x - o.x, u.y - o.y);
6
+ let h = zt(e);
7
+ for (let a = 0; a < e.length; ++a) {
8
+ let u = e[a];
9
+ u.angle = Math.atan2(u.x - h.x, u.y - h.y);
10
10
  }
11
- e.sort((h, u) => u.angle - h.angle);
11
+ e.sort((a, u) => u.angle - a.angle);
12
12
  let c = e[e.length - 1];
13
- for (let h = 0; h < e.length; ++h) {
14
- let u = e[h];
13
+ for (let a = 0; a < e.length; ++a) {
14
+ let u = e[a];
15
15
  r += (c.x + u.x) * (u.y - c.y);
16
- let x = {
16
+ let g = {
17
17
  x: (u.x + c.x) / 2,
18
18
  y: (u.y + c.y) / 2
19
19
  }, f = null;
20
20
  for (let m = 0; m < u.parentIndex.length; ++m) if (c.parentIndex.includes(u.parentIndex[m])) {
21
21
  let y = t[u.parentIndex[m]], _ = Math.atan2(u.x - y.x, u.y - y.y), E = Math.atan2(c.x - y.x, c.y - y.y), d = E - _;
22
22
  d < 0 && (d += 2 * Math.PI);
23
- let b = E - d / 2, v = W(x, {
24
- x: y.x + y.radius * Math.sin(b),
25
- y: y.y + y.radius * Math.cos(b)
23
+ let v = E - d / 2, b = q(g, {
24
+ x: y.x + y.radius * Math.sin(v),
25
+ y: y.y + y.radius * Math.cos(v)
26
26
  });
27
- v > y.radius * 2 && (v = y.radius * 2), (f == null || f.width > v) && (f = {
27
+ b > y.radius * 2 && (b = y.radius * 2), (f == null || f.width > b) && (f = {
28
28
  circle: y,
29
- width: v,
29
+ width: b,
30
30
  p1: u,
31
31
  p2: c,
32
- large: v > y.radius,
32
+ large: b > y.radius,
33
33
  sweep: !0
34
34
  });
35
35
  }
36
- f != null && (a.push(f), i += at(f.circle.radius, f.width), c = u);
36
+ f != null && (o.push(f), i += at(f.circle.radius, f.width), c = u);
37
37
  }
38
38
  } else {
39
- let o = t[0];
40
- for (let h = 1; h < t.length; ++h) t[h].radius < o.radius && (o = t[h]);
39
+ let h = t[0];
40
+ for (let a = 1; a < t.length; ++a) t[a].radius < h.radius && (h = t[a]);
41
41
  let c = !1;
42
- for (let h = 0; h < t.length; ++h) if (W(t[h], o) > Math.abs(o.radius - t[h].radius)) {
42
+ for (let a = 0; a < t.length; ++a) if (q(t[a], h) > Math.abs(h.radius - t[a].radius)) {
43
43
  c = !0;
44
44
  break;
45
45
  }
46
- c ? i = r = 0 : (i = o.radius * o.radius * Math.PI, a.push({
47
- circle: o,
46
+ c ? i = r = 0 : (i = h.radius * h.radius * Math.PI, o.push({
47
+ circle: h,
48
48
  p1: {
49
- x: o.x,
50
- y: o.y + o.radius
49
+ x: h.x,
50
+ y: h.y + h.radius
51
51
  },
52
52
  p2: {
53
- x: o.x - Et,
54
- y: o.y + o.radius
53
+ x: h.x - Et,
54
+ y: h.y + h.radius
55
55
  },
56
- width: o.radius * 2,
56
+ width: h.radius * 2,
57
57
  large: !0,
58
58
  sweep: !0
59
59
  }));
60
60
  }
61
- return r /= 2, n && (n.area = i + r, n.arcArea = i, n.polygonArea = r, n.arcs = a, n.innerPoints = e, n.intersectionPoints = s), i + r;
61
+ return r /= 2, n && (n.area = i + r, n.arcArea = i, n.polygonArea = r, n.arcs = o, n.innerPoints = e, n.intersectionPoints = s), i + r;
62
62
  }
63
63
  function le(t, n) {
64
- return n.every((s) => W(t, s) < s.radius + Et);
64
+ return n.every((s) => q(t, s) < s.radius + Et);
65
65
  }
66
66
  function ae(t) {
67
67
  let n = [];
@@ -74,7 +74,7 @@ function ae(t) {
74
74
  function at(t, n) {
75
75
  return t * t * Math.acos(1 - n / t) - (t - n) * Math.sqrt(n * (2 * t - n));
76
76
  }
77
- function W(t, n) {
77
+ function q(t, n) {
78
78
  return Math.sqrt((t.x - n.x) * (t.x - n.x) + (t.y - n.y) * (t.y - n.y));
79
79
  }
80
80
  function yt(t, n, s) {
@@ -84,14 +84,14 @@ function yt(t, n, s) {
84
84
  return at(t, e) + at(n, i);
85
85
  }
86
86
  function St(t, n) {
87
- let s = W(t, n), e = t.radius, i = n.radius;
87
+ let s = q(t, n), e = t.radius, i = n.radius;
88
88
  if (s >= e + i || s <= Math.abs(e - i)) return [];
89
- let r = (e * e - i * i + s * s) / (2 * s), a = Math.sqrt(e * e - r * r), o = t.x + r * (n.x - t.x) / s, c = t.y + r * (n.y - t.y) / s, h = -(n.y - t.y) * (a / s), u = -(n.x - t.x) * (a / s);
89
+ let r = (e * e - i * i + s * s) / (2 * s), o = Math.sqrt(e * e - r * r), h = t.x + r * (n.x - t.x) / s, c = t.y + r * (n.y - t.y) / s, a = -(n.y - t.y) * (o / s), u = -(n.x - t.x) * (o / s);
90
90
  return [{
91
- x: o + h,
91
+ x: h + a,
92
92
  y: c - u
93
93
  }, {
94
- x: o - h,
94
+ x: h - a,
95
95
  y: c + u
96
96
  }];
97
97
  }
@@ -104,15 +104,15 @@ function zt(t) {
104
104
  return n.x /= t.length, n.y /= t.length, n;
105
105
  }
106
106
  function oe(t, n, s, e) {
107
- e || (e = {});
108
- let i = e.maxIterations || 100, r = e.tolerance || 1e-10, a = t(n), o = t(s), c = s - n;
109
- if (a * o > 0) throw "Initial bisect points must have opposite signs";
110
- if (a === 0) return n;
111
- if (o === 0) return s;
112
- for (let h = 0; h < i; ++h) {
107
+ e ||= {};
108
+ let i = e.maxIterations || 100, r = e.tolerance || 1e-10, o = t(n), h = t(s), c = s - n;
109
+ if (o * h > 0) throw "Initial bisect points must have opposite signs";
110
+ if (o === 0) return n;
111
+ if (h === 0) return s;
112
+ for (let a = 0; a < i; ++a) {
113
113
  c /= 2;
114
- let u = n + c, x = t(u);
115
- if (x * a >= 0 && (n = u), Math.abs(c) < r || x === 0) return u;
114
+ let u = n + c, g = t(u);
115
+ if (g * o >= 0 && (n = u), Math.abs(c) < r || g === 0) return u;
116
116
  }
117
117
  return n + c;
118
118
  }
@@ -124,13 +124,13 @@ function ot(t) {
124
124
  function kt(t, n) {
125
125
  return ot(t).map(() => ot(n));
126
126
  }
127
- function Q(t, n) {
127
+ function J(t, n) {
128
128
  let s = 0;
129
129
  for (let e = 0; e < t.length; ++e) s += t[e] * n[e];
130
130
  return s;
131
131
  }
132
132
  function ht(t) {
133
- return Math.sqrt(Q(t, t));
133
+ return Math.sqrt(J(t, t));
134
134
  }
135
135
  function ut(t, n, s) {
136
136
  for (let e = 0; e < n.length; ++e) t[e] = n[e] * s;
@@ -139,69 +139,69 @@ function H(t, n, s, e, i) {
139
139
  for (let r = 0; r < t.length; ++r) t[r] = n * s[r] + e * i[r];
140
140
  }
141
141
  function Tt(t, n, s) {
142
- s || (s = {});
143
- let e = s.maxIterations || n.length * 200, i = s.nonZeroDelta || 1.05, r = s.zeroDelta || 1e-3, a = s.minErrorDelta || 1e-6, o = s.minErrorDelta || 1e-5, c = s.rho === void 0 ? 1 : s.rho, h = s.chi === void 0 ? 2 : s.chi, u = s.psi === void 0 ? -0.5 : s.psi, x = s.sigma === void 0 ? 0.5 : s.sigma, f, m = n.length, y = Array(m + 1);
142
+ s ||= {};
143
+ let e = s.maxIterations || n.length * 200, i = s.nonZeroDelta || 1.05, r = s.zeroDelta || 1e-3, o = s.minErrorDelta || 1e-6, h = s.minErrorDelta || 1e-5, c = s.rho === void 0 ? 1 : s.rho, a = s.chi === void 0 ? 2 : s.chi, u = s.psi === void 0 ? -0.5 : s.psi, g = s.sigma === void 0 ? 0.5 : s.sigma, f, m = n.length, y = Array(m + 1);
144
144
  y[0] = n, y[0].fx = t(n), y[0].id = 0;
145
- for (let k = 0; k < m; ++k) {
145
+ for (let I = 0; I < m; ++I) {
146
146
  let l = n.slice();
147
- l[k] = l[k] ? l[k] * i : r, y[k + 1] = l, y[k + 1].fx = t(l), y[k + 1].id = k + 1;
147
+ l[I] = l[I] ? l[I] * i : r, y[I + 1] = l, y[I + 1].fx = t(l), y[I + 1].id = I + 1;
148
148
  }
149
- function _(k) {
150
- for (let l = 0; l < k.length; l++) y[m][l] = k[l];
151
- y[m].fx = k.fx;
149
+ function _(I) {
150
+ for (let l = 0; l < I.length; l++) y[m][l] = I[l];
151
+ y[m].fx = I.fx;
152
152
  }
153
- let E = (k, l) => k.fx - l.fx, d = n.slice(), b = n.slice(), v = n.slice(), g = n.slice();
154
- for (let k = 0; k < e; ++k) {
153
+ let E = (I, l) => I.fx - l.fx, d = n.slice(), v = n.slice(), b = n.slice(), x = n.slice();
154
+ for (let I = 0; I < e; ++I) {
155
155
  if (y.sort(E), s.history) {
156
- let M = y.map((p) => {
157
- let A = p.slice();
158
- return A.fx = p.fx, A.id = p.id, A;
156
+ let p = y.map((M) => {
157
+ let z = M.slice();
158
+ return z.fx = M.fx, z.id = M.id, z;
159
159
  });
160
- M.sort((p, A) => p.id - A.id), s.history.push({
160
+ p.sort((M, z) => M.id - z.id), s.history.push({
161
161
  x: y[0].slice(),
162
162
  fx: y[0].fx,
163
- simplex: M
163
+ simplex: p
164
164
  });
165
165
  }
166
166
  f = 0;
167
- for (let M = 0; M < m; ++M) f = Math.max(f, Math.abs(y[0][M] - y[1][M]));
168
- if (Math.abs(y[0].fx - y[m].fx) < a && f < o) break;
169
- for (let M = 0; M < m; ++M) {
170
- d[M] = 0;
171
- for (let p = 0; p < m; ++p) d[M] += y[p][M];
172
- d[M] /= m;
167
+ for (let p = 0; p < m; ++p) f = Math.max(f, Math.abs(y[0][p] - y[1][p]));
168
+ if (Math.abs(y[0].fx - y[m].fx) < o && f < h) break;
169
+ for (let p = 0; p < m; ++p) {
170
+ d[p] = 0;
171
+ for (let M = 0; M < m; ++M) d[p] += y[M][p];
172
+ d[p] /= m;
173
173
  }
174
174
  let l = y[m];
175
- if (H(b, 1 + c, d, -c, l), b.fx = t(b), b.fx < y[0].fx) H(g, 1 + h, d, -h, l), g.fx = t(g), g.fx < b.fx ? _(g) : _(b);
176
- else if (b.fx >= y[m - 1].fx) {
177
- let M = !1;
178
- if (b.fx > l.fx ? (H(v, 1 + u, d, -u, l), v.fx = t(v), v.fx < l.fx ? _(v) : M = !0) : (H(v, 1 - u * c, d, u * c, l), v.fx = t(v), v.fx < b.fx ? _(v) : M = !0), M) {
179
- if (x >= 1) break;
180
- for (let p = 1; p < y.length; ++p) H(y[p], 1 - x, y[0], x, y[p]), y[p].fx = t(y[p]);
175
+ if (H(v, 1 + c, d, -c, l), v.fx = t(v), v.fx < y[0].fx) H(x, 1 + a, d, -a, l), x.fx = t(x), x.fx < v.fx ? _(x) : _(v);
176
+ else if (v.fx >= y[m - 1].fx) {
177
+ let p = !1;
178
+ if (v.fx > l.fx ? (H(b, 1 + u, d, -u, l), b.fx = t(b), b.fx < l.fx ? _(b) : p = !0) : (H(b, 1 - u * c, d, u * c, l), b.fx = t(b), b.fx < v.fx ? _(b) : p = !0), p) {
179
+ if (g >= 1) break;
180
+ for (let M = 1; M < y.length; ++M) H(y[M], 1 - g, y[0], g, y[M]), y[M].fx = t(y[M]);
181
181
  }
182
- } else _(b);
182
+ } else _(v);
183
183
  }
184
184
  return y.sort(E), {
185
185
  fx: y[0].fx,
186
186
  x: y[0]
187
187
  };
188
188
  }
189
- function he(t, n, s, e, i, r, a) {
190
- let o = s.fx, c = Q(s.fxprime, n), h = o, u = o, x = c, f = 0;
191
- i || (i = 1), r || (r = 1e-6), a || (a = 0.1);
189
+ function he(t, n, s, e, i, r, o) {
190
+ let h = s.fx, c = J(s.fxprime, n), a = h, u = h, g = c, f = 0;
191
+ i ||= 1, r ||= 1e-6, o ||= 0.1;
192
192
  function m(y, _, E) {
193
- for (let d = 0; d < 16; ++d) if (i = (y + _) / 2, H(e.x, 1, s.x, i, n), h = e.fx = t(e.x, e.fxprime), x = Q(e.fxprime, n), h > o + r * i * c || h >= E) _ = i;
193
+ for (let d = 0; d < 16; ++d) if (i = (y + _) / 2, H(e.x, 1, s.x, i, n), a = e.fx = t(e.x, e.fxprime), g = J(e.fxprime, n), a > h + r * i * c || a >= E) _ = i;
194
194
  else {
195
- if (Math.abs(x) <= -a * c) return i;
196
- x * (_ - y) >= 0 && (_ = y), y = i, E = h;
195
+ if (Math.abs(g) <= -o * c) return i;
196
+ g * (_ - y) >= 0 && (_ = y), y = i, E = a;
197
197
  }
198
198
  return 0;
199
199
  }
200
200
  for (let y = 0; y < 10; ++y) {
201
- if (H(e.x, 1, s.x, i, n), h = e.fx = t(e.x, e.fxprime), x = Q(e.fxprime, n), h > o + r * i * c || y && h >= u) return m(f, i, u);
202
- if (Math.abs(x) <= -a * c) return i;
203
- if (x >= 0) return m(i, f, h);
204
- u = h, f = i, i *= 2;
201
+ if (H(e.x, 1, s.x, i, n), a = e.fx = t(e.x, e.fxprime), g = J(e.fxprime, n), a > h + r * i * c || y && a >= u) return m(f, i, u);
202
+ if (Math.abs(g) <= -o * c) return i;
203
+ if (g >= 0) return m(i, f, a);
204
+ u = a, f = i, i *= 2;
205
205
  }
206
206
  return i;
207
207
  }
@@ -214,19 +214,19 @@ function ue(t, n, s) {
214
214
  x: n.slice(),
215
215
  fx: 0,
216
216
  fxprime: n.slice()
217
- }, r = n.slice(), a, o, c = 1, h;
218
- s || (s = {}), h = s.maxIterations || n.length * 20, e.fx = t(e.x, e.fxprime), a = e.fxprime.slice(), ut(a, e.fxprime, -1);
219
- for (let u = 0; u < h; ++u) {
220
- if (c = he(t, a, e, i, c), s.history && s.history.push({
217
+ }, r = n.slice(), o, h, c = 1, a;
218
+ s ||= {}, a = s.maxIterations || n.length * 20, e.fx = t(e.x, e.fxprime), o = e.fxprime.slice(), ut(o, e.fxprime, -1);
219
+ for (let u = 0; u < a; ++u) {
220
+ if (c = he(t, o, e, i, c), s.history && s.history.push({
221
221
  x: e.x.slice(),
222
222
  fx: e.fx,
223
223
  fxprime: e.fxprime.slice(),
224
224
  alpha: c
225
- }), !c) ut(a, e.fxprime, -1);
225
+ }), !c) ut(o, e.fxprime, -1);
226
226
  else {
227
227
  H(r, 1, i.fxprime, -1, e.fxprime);
228
- let x = Q(e.fxprime, e.fxprime), f = Math.max(0, Q(r, i.fxprime) / x);
229
- H(a, f, a, -1, i.fxprime), o = e, e = i, i = o;
228
+ let g = J(e.fxprime, e.fxprime), f = Math.max(0, J(r, i.fxprime) / g);
229
+ H(o, f, o, -1, i.fxprime), h = e, e = i, i = h;
230
230
  }
231
231
  if (ht(e.fxprime) <= 1e-5) break;
232
232
  }
@@ -239,23 +239,23 @@ function ue(t, n, s) {
239
239
  }
240
240
  function At(t, n = {}) {
241
241
  n.maxIterations = n.maxIterations || 500;
242
- let s = n.initialLayout || ye, e = n.lossFunction || tt, i = ce(t, n), r = s(i, n), a = Object.keys(r), o = [];
243
- for (let h of a) o.push(r[h].x), o.push(r[h].y);
244
- let c = Tt((h) => {
242
+ let s = n.initialLayout || ye, e = n.lossFunction || Q, i = ce(t, n), r = s(i, n), o = Object.keys(r), h = [];
243
+ for (let a of o) h.push(r[a].x), h.push(r[a].y);
244
+ let c = Tt((a) => {
245
245
  let u = {};
246
- for (let x = 0; x < a.length; ++x) {
247
- let f = a[x];
246
+ for (let g = 0; g < o.length; ++g) {
247
+ let f = o[g];
248
248
  u[f] = {
249
- x: h[2 * x],
250
- y: h[2 * x + 1],
249
+ x: a[2 * g],
250
+ y: a[2 * g + 1],
251
251
  radius: r[f].radius
252
252
  };
253
253
  }
254
254
  return e(u, i);
255
- }, o, n).x;
256
- for (let h = 0; h < a.length; ++h) {
257
- let u = a[h];
258
- r[u].x = c[2 * h], r[u].y = c[2 * h + 1];
255
+ }, h, n).x;
256
+ for (let a = 0; a < o.length; ++a) {
257
+ let u = o[a];
258
+ r[u].x = c[2 * a], r[u].y = c[2 * a + 1];
259
259
  }
260
260
  return r;
261
261
  }
@@ -264,34 +264,34 @@ function ct(t, n, s) {
264
264
  return Math.min(t, n) * Math.min(t, n) * Math.PI <= s + $t ? Math.abs(t - n) : oe((e) => yt(t, n, e) - s, 0, t + n);
265
265
  }
266
266
  function ce(t, n = {}) {
267
- let s = n.distinct, e = t.map((o) => Object.assign({}, o));
268
- function i(o) {
269
- return o.join(";");
267
+ let s = n.distinct, e = t.map((h) => Object.assign({}, h));
268
+ function i(h) {
269
+ return h.join(";");
270
270
  }
271
271
  if (s) {
272
- let o = /* @__PURE__ */ new Map();
273
- for (let c of e) for (let h = 0; h < c.sets.length; h++) {
274
- let u = String(c.sets[h]);
275
- o.set(u, c.size + (o.get(u) || 0));
276
- for (let x = h + 1; x < c.sets.length; x++) {
277
- let f = String(c.sets[x]), m = `${u};${f}`, y = `${f};${u}`;
278
- o.set(m, c.size + (o.get(m) || 0)), o.set(y, c.size + (o.get(y) || 0));
272
+ let h = /* @__PURE__ */ new Map();
273
+ for (let c of e) for (let a = 0; a < c.sets.length; a++) {
274
+ let u = String(c.sets[a]);
275
+ h.set(u, c.size + (h.get(u) || 0));
276
+ for (let g = a + 1; g < c.sets.length; g++) {
277
+ let f = String(c.sets[g]), m = `${u};${f}`, y = `${f};${u}`;
278
+ h.set(m, c.size + (h.get(m) || 0)), h.set(y, c.size + (h.get(y) || 0));
279
279
  }
280
280
  }
281
- for (let c of e) c.sets.length < 3 && (c.size = o.get(i(c.sets)));
281
+ for (let c of e) c.sets.length < 3 && (c.size = h.get(i(c.sets)));
282
282
  }
283
- let r = [], a = /* @__PURE__ */ new Set();
284
- for (let o of e) if (o.sets.length === 1) r.push(o.sets[0]);
285
- else if (o.sets.length === 2) {
286
- let c = o.sets[0], h = o.sets[1];
287
- a.add(i(o.sets)), a.add(i([h, c]));
283
+ let r = [], o = /* @__PURE__ */ new Set();
284
+ for (let h of e) if (h.sets.length === 1) r.push(h.sets[0]);
285
+ else if (h.sets.length === 2) {
286
+ let c = h.sets[0], a = h.sets[1];
287
+ o.add(i(h.sets)), o.add(i([a, c]));
288
288
  }
289
- r.sort((o, c) => o === c ? 0 : o < c ? -1 : 1);
290
- for (let o = 0; o < r.length; ++o) {
291
- let c = r[o];
292
- for (let h = o + 1; h < r.length; ++h) {
293
- let u = r[h];
294
- a.has(i([c, u])) || e.push({
289
+ r.sort((h, c) => h === c ? 0 : h < c ? -1 : 1);
290
+ for (let h = 0; h < r.length; ++h) {
291
+ let c = r[h];
292
+ for (let a = h + 1; a < r.length; ++a) {
293
+ let u = r[a];
294
+ o.has(i([c, u])) || e.push({
295
295
  sets: [c, u],
296
296
  size: 0
297
297
  });
@@ -302,10 +302,10 @@ function ce(t, n = {}) {
302
302
  function fe(t, n, s) {
303
303
  let e = kt(n.length, n.length), i = kt(n.length, n.length);
304
304
  return t.filter((r) => r.sets.length === 2).forEach((r) => {
305
- let a = s[r.sets[0]], o = s[r.sets[1]], c = ct(Math.sqrt(n[a].size / Math.PI), Math.sqrt(n[o].size / Math.PI), r.size);
306
- e[a][o] = e[o][a] = c;
307
- let h = 0;
308
- r.size + 1e-10 >= Math.min(n[a].size, n[o].size) ? h = 1 : r.size <= 1e-10 && (h = -1), i[a][o] = i[o][a] = h;
305
+ let o = s[r.sets[0]], h = s[r.sets[1]], c = ct(Math.sqrt(n[o].size / Math.PI), Math.sqrt(n[h].size / Math.PI), r.size);
306
+ e[o][h] = e[h][o] = c;
307
+ let a = 0;
308
+ r.size + 1e-10 >= Math.min(n[o].size, n[h].size) ? a = 1 : r.size <= 1e-10 && (a = -1), i[o][h] = i[h][o] = a;
309
309
  }), {
310
310
  distances: e,
311
311
  constraints: i
@@ -315,144 +315,144 @@ function de(t, n, s, e) {
315
315
  for (let r = 0; r < n.length; ++r) n[r] = 0;
316
316
  let i = 0;
317
317
  for (let r = 0; r < s.length; ++r) {
318
- let a = t[2 * r], o = t[2 * r + 1];
318
+ let o = t[2 * r], h = t[2 * r + 1];
319
319
  for (let c = r + 1; c < s.length; ++c) {
320
- let h = t[2 * c], u = t[2 * c + 1], x = s[r][c], f = e[r][c], m = (h - a) * (h - a) + (u - o) * (u - o), y = Math.sqrt(m), _ = m - x * x;
321
- f > 0 && y <= x || f < 0 && y >= x || (i += 2 * _ * _, n[2 * r] += 4 * _ * (a - h), n[2 * r + 1] += 4 * _ * (o - u), n[2 * c] += 4 * _ * (h - a), n[2 * c + 1] += 4 * _ * (u - o));
320
+ let a = t[2 * c], u = t[2 * c + 1], g = s[r][c], f = e[r][c], m = (a - o) * (a - o) + (u - h) * (u - h), y = Math.sqrt(m), _ = m - g * g;
321
+ f > 0 && y <= g || f < 0 && y >= g || (i += 2 * _ * _, n[2 * r] += 4 * _ * (o - a), n[2 * r + 1] += 4 * _ * (h - u), n[2 * c] += 4 * _ * (a - o), n[2 * c + 1] += 4 * _ * (u - h));
322
322
  }
323
323
  }
324
324
  return i;
325
325
  }
326
326
  function ye(t, n = {}) {
327
- let s = xe(t, n), e = n.lossFunction || tt;
327
+ let s = xe(t, n), e = n.lossFunction || Q;
328
328
  if (t.length >= 8) {
329
- let i = ge(t, n), r = e(i, t), a = e(s, t);
330
- r + 1e-8 < a && (s = i);
329
+ let i = ge(t, n), r = e(i, t), o = e(s, t);
330
+ r + 1e-8 < o && (s = i);
331
331
  }
332
332
  return s;
333
333
  }
334
334
  function ge(t, n = {}) {
335
335
  let s = n.restarts || 10, e = [], i = {};
336
336
  for (let f of t) f.sets.length === 1 && (i[f.sets[0]] = e.length, e.push(f));
337
- let { distances: r, constraints: a } = fe(t, e, i), o = ht(r.map(ht)) / r.length;
338
- r = r.map((f) => f.map((m) => m / o));
339
- let c = (f, m) => de(f, m, r, a), h = null;
337
+ let { distances: r, constraints: o } = fe(t, e, i), h = ht(r.map(ht)) / r.length;
338
+ r = r.map((f) => f.map((m) => m / h));
339
+ let c = (f, m) => de(f, m, r, o), a = null;
340
340
  for (let f = 0; f < s; ++f) {
341
341
  let m = ue(c, ot(r.length * 2).map(Math.random), n);
342
- (!h || m.fx < h.fx) && (h = m);
342
+ (!a || m.fx < a.fx) && (a = m);
343
343
  }
344
- let u = h.x, x = {};
344
+ let u = a.x, g = {};
345
345
  for (let f = 0; f < e.length; ++f) {
346
346
  let m = e[f];
347
- x[m.sets[0]] = {
348
- x: u[2 * f] * o,
349
- y: u[2 * f + 1] * o,
347
+ g[m.sets[0]] = {
348
+ x: u[2 * f] * h,
349
+ y: u[2 * f + 1] * h,
350
350
  radius: Math.sqrt(m.size / Math.PI)
351
351
  };
352
352
  }
353
- if (n.history) for (let f of n.history) ut(f.x, o);
354
- return x;
353
+ if (n.history) for (let f of n.history) ut(f.x, h);
354
+ return g;
355
355
  }
356
356
  function xe(t, n) {
357
- let s = n && n.lossFunction ? n.lossFunction : tt, e = {}, i = {};
358
- for (let x of t) if (x.sets.length === 1) {
359
- let f = x.sets[0];
357
+ let s = n && n.lossFunction ? n.lossFunction : Q, e = {}, i = {};
358
+ for (let g of t) if (g.sets.length === 1) {
359
+ let f = g.sets[0];
360
360
  e[f] = {
361
361
  x: 1e10,
362
362
  y: 1e10,
363
363
  rowid: e.length,
364
- size: x.size,
365
- radius: Math.sqrt(x.size / Math.PI)
364
+ size: g.size,
365
+ radius: Math.sqrt(g.size / Math.PI)
366
366
  }, i[f] = [];
367
367
  }
368
- t = t.filter((x) => x.sets.length === 2);
369
- for (let x of t) {
370
- let f = x.weight == null ? 1 : x.weight, m = x.sets[0], y = x.sets[1];
371
- x.size + $t >= Math.min(e[m].size, e[y].size) && (f = 0), i[m].push({
368
+ t = t.filter((g) => g.sets.length === 2);
369
+ for (let g of t) {
370
+ let f = g.weight == null ? 1 : g.weight, m = g.sets[0], y = g.sets[1];
371
+ g.size + $t >= Math.min(e[m].size, e[y].size) && (f = 0), i[m].push({
372
372
  set: y,
373
- size: x.size,
373
+ size: g.size,
374
374
  weight: f
375
375
  }), i[y].push({
376
376
  set: m,
377
- size: x.size,
377
+ size: g.size,
378
378
  weight: f
379
379
  });
380
380
  }
381
381
  let r = [];
382
- Object.keys(i).forEach((x) => {
382
+ Object.keys(i).forEach((g) => {
383
383
  let f = 0;
384
- for (let m = 0; m < i[x].length; ++m) f += i[x][m].size * i[x][m].weight;
384
+ for (let m = 0; m < i[g].length; ++m) f += i[g][m].size * i[g][m].weight;
385
385
  r.push({
386
- set: x,
386
+ set: g,
387
387
  size: f
388
388
  });
389
389
  });
390
- function a(x, f) {
391
- return f.size - x.size;
390
+ function o(g, f) {
391
+ return f.size - g.size;
392
392
  }
393
- r.sort(a);
394
- let o = {};
395
- function c(x) {
396
- return x.set in o;
393
+ r.sort(o);
394
+ let h = {};
395
+ function c(g) {
396
+ return g.set in h;
397
397
  }
398
- function h(x, f) {
399
- e[f].x = x.x, e[f].y = x.y, o[f] = !0;
398
+ function a(g, f) {
399
+ e[f].x = g.x, e[f].y = g.y, h[f] = !0;
400
400
  }
401
- h({
401
+ a({
402
402
  x: 0,
403
403
  y: 0
404
404
  }, r[0].set);
405
- for (let x = 1; x < r.length; ++x) {
406
- let f = r[x].set, m = i[f].filter(c), y = e[f];
407
- if (m.sort(a), m.length === 0) throw "ERROR: missing pairwise overlap information";
405
+ for (let g = 1; g < r.length; ++g) {
406
+ let f = r[g].set, m = i[f].filter(c), y = e[f];
407
+ if (m.sort(o), m.length === 0) throw "ERROR: missing pairwise overlap information";
408
408
  let _ = [];
409
409
  for (var u = 0; u < m.length; ++u) {
410
- let b = e[m[u].set], v = ct(y.radius, b.radius, m[u].size);
410
+ let v = e[m[u].set], b = ct(y.radius, v.radius, m[u].size);
411
411
  _.push({
412
- x: b.x + v,
413
- y: b.y
412
+ x: v.x + b,
413
+ y: v.y
414
414
  }), _.push({
415
- x: b.x - v,
416
- y: b.y
415
+ x: v.x - b,
416
+ y: v.y
417
417
  }), _.push({
418
- y: b.y + v,
419
- x: b.x
418
+ y: v.y + b,
419
+ x: v.x
420
420
  }), _.push({
421
- y: b.y - v,
422
- x: b.x
421
+ y: v.y - b,
422
+ x: v.x
423
423
  });
424
- for (let g = u + 1; g < m.length; ++g) {
425
- let k = e[m[g].set], l = ct(y.radius, k.radius, m[g].size), M = St({
426
- x: b.x,
427
- y: b.y,
428
- radius: v
424
+ for (let x = u + 1; x < m.length; ++x) {
425
+ let I = e[m[x].set], l = ct(y.radius, I.radius, m[x].size), p = St({
426
+ x: v.x,
427
+ y: v.y,
428
+ radius: b
429
429
  }, {
430
- x: k.x,
431
- y: k.y,
430
+ x: I.x,
431
+ y: I.y,
432
432
  radius: l
433
433
  });
434
- _.push(...M);
434
+ _.push(...p);
435
435
  }
436
436
  }
437
437
  let E = 1e50, d = _[0];
438
- for (let b of _) {
439
- e[f].x = b.x, e[f].y = b.y;
440
- let v = s(e, t);
441
- v < E && (E = v, d = b);
438
+ for (let v of _) {
439
+ e[f].x = v.x, e[f].y = v.y;
440
+ let b = s(e, t);
441
+ b < E && (E = b, d = v);
442
442
  }
443
- h(d, f);
443
+ a(d, f);
444
444
  }
445
445
  return e;
446
446
  }
447
- function tt(t, n) {
447
+ function Q(t, n) {
448
448
  let s = 0;
449
449
  for (let e of n) {
450
450
  if (e.sets.length === 1) continue;
451
451
  let i;
452
452
  if (e.sets.length === 2) {
453
- let a = t[e.sets[0]], o = t[e.sets[1]];
454
- i = yt(a.radius, o.radius, W(a, o));
455
- } else i = nt(e.sets.map((a) => t[a]));
453
+ let o = t[e.sets[0]], h = t[e.sets[1]];
454
+ i = yt(o.radius, h.radius, q(o, h));
455
+ } else i = nt(e.sets.map((o) => t[o]));
456
456
  let r = e.weight == null ? 1 : e.weight;
457
457
  s += r * (i - e.size) * (i - e.size);
458
458
  }
@@ -464,24 +464,24 @@ function Rt(t, n) {
464
464
  if (e.sets.length === 1) continue;
465
465
  let i;
466
466
  if (e.sets.length === 2) {
467
- let o = t[e.sets[0]], c = t[e.sets[1]];
468
- i = yt(o.radius, c.radius, W(o, c));
469
- } else i = nt(e.sets.map((o) => t[o]));
470
- let r = e.weight == null ? 1 : e.weight, a = Math.log((i + 1) / (e.size + 1));
471
- s += r * a * a;
467
+ let h = t[e.sets[0]], c = t[e.sets[1]];
468
+ i = yt(h.radius, c.radius, q(h, c));
469
+ } else i = nt(e.sets.map((h) => t[h]));
470
+ let r = e.weight == null ? 1 : e.weight, o = Math.log((i + 1) / (e.size + 1));
471
+ s += r * o * o;
472
472
  }
473
473
  return s;
474
474
  }
475
475
  function pe(t, n, s) {
476
476
  if (s == null ? t.sort((i, r) => r.radius - i.radius) : t.sort(s), t.length > 0) {
477
477
  let i = t[0].x, r = t[0].y;
478
- for (let a of t) a.x -= i, a.y -= r;
478
+ for (let o of t) o.x -= i, o.y -= r;
479
479
  }
480
- if (t.length === 2 && W(t[0], t[1]) < Math.abs(t[1].radius - t[0].radius) && (t[1].x = t[0].x + t[0].radius - t[1].radius - 1e-10, t[1].y = t[0].y), t.length > 1) {
481
- let i = Math.atan2(t[1].x, t[1].y) - n, r = Math.cos(i), a = Math.sin(i);
482
- for (let o of t) {
483
- let c = o.x, h = o.y;
484
- o.x = r * c - a * h, o.y = a * c + r * h;
480
+ if (t.length === 2 && q(t[0], t[1]) < Math.abs(t[1].radius - t[0].radius) && (t[1].x = t[0].x + t[0].radius - t[1].radius - 1e-10, t[1].y = t[0].y), t.length > 1) {
481
+ let i = Math.atan2(t[1].x, t[1].y) - n, r = Math.cos(i), o = Math.sin(i);
482
+ for (let h of t) {
483
+ let c = h.x, a = h.y;
484
+ h.x = r * c - o * a, h.y = o * c + r * a;
485
485
  }
486
486
  }
487
487
  if (t.length > 2) {
@@ -490,9 +490,9 @@ function pe(t, n, s) {
490
490
  for (; i > 2 * Math.PI; ) i -= 2 * Math.PI;
491
491
  if (i > Math.PI) {
492
492
  let r = t[1].y / (1e-10 + t[1].x);
493
- for (let a of t) {
494
- var e = (a.x + r * a.y) / (1 + r * r);
495
- a.x = 2 * e - a.x, a.y = 2 * e * r - a.y;
493
+ for (let o of t) {
494
+ var e = (o.x + r * o.y) / (1 + r * r);
495
+ o.x = 2 * e - o.x, o.y = 2 * e * r - o.y;
496
496
  }
497
497
  }
498
498
  }
@@ -505,12 +505,12 @@ function me(t) {
505
505
  return i.parent !== i && (i.parent = n(i.parent)), i.parent;
506
506
  }
507
507
  function s(i, r) {
508
- let a = n(i);
509
- a.parent = n(r);
508
+ let o = n(i);
509
+ o.parent = n(r);
510
510
  }
511
511
  for (let i = 0; i < t.length; ++i) for (let r = i + 1; r < t.length; ++r) {
512
- let a = t[i].radius + t[r].radius;
513
- W(t[i], t[r]) + 1e-10 < a && s(t[r], t[i]);
512
+ let o = t[i].radius + t[r].radius;
513
+ q(t[i], t[r]) + 1e-10 < o && s(t[r], t[i]);
514
514
  }
515
515
  let e = /* @__PURE__ */ new Map();
516
516
  for (let i = 0; i < t.length; ++i) {
@@ -532,51 +532,51 @@ function ft(t) {
532
532
  };
533
533
  }
534
534
  function Nt(t, n, s) {
535
- n ?? (n = Math.PI / 2);
536
- let e = Ot(t).map((h) => Object.assign({}, h)), i = me(e);
537
- for (let h of i) {
538
- pe(h, n, s);
539
- let u = ft(h);
540
- h.size = (u.xRange.max - u.xRange.min) * (u.yRange.max - u.yRange.min), h.bounds = u;
535
+ n ??= Math.PI / 2;
536
+ let e = Ot(t).map((a) => Object.assign({}, a)), i = me(e);
537
+ for (let a of i) {
538
+ pe(a, n, s);
539
+ let u = ft(a);
540
+ a.size = (u.xRange.max - u.xRange.min) * (u.yRange.max - u.yRange.min), a.bounds = u;
541
541
  }
542
- i.sort((h, u) => u.size - h.size), e = i[0];
543
- let r = e.bounds, a = (r.xRange.max - r.xRange.min) / 50;
544
- function o(h, u, x) {
545
- if (!h) return;
546
- let f = h.bounds, m, y;
547
- if (u) m = r.xRange.max - f.xRange.min + a;
542
+ i.sort((a, u) => u.size - a.size), e = i[0];
543
+ let r = e.bounds, o = (r.xRange.max - r.xRange.min) / 50;
544
+ function h(a, u, g) {
545
+ if (!a) return;
546
+ let f = a.bounds, m, y;
547
+ if (u) m = r.xRange.max - f.xRange.min + o;
548
548
  else {
549
549
  m = r.xRange.max - f.xRange.max;
550
550
  let _ = (f.xRange.max - f.xRange.min) / 2 - (r.xRange.max - r.xRange.min) / 2;
551
551
  _ < 0 && (m += _);
552
552
  }
553
- if (x) y = r.yRange.max - f.yRange.min + a;
553
+ if (g) y = r.yRange.max - f.yRange.min + o;
554
554
  else {
555
555
  y = r.yRange.max - f.yRange.max;
556
556
  let _ = (f.yRange.max - f.yRange.min) / 2 - (r.yRange.max - r.yRange.min) / 2;
557
557
  _ < 0 && (y += _);
558
558
  }
559
- for (let _ of h) _.x += m, _.y += y, e.push(_);
559
+ for (let _ of a) _.x += m, _.y += y, e.push(_);
560
560
  }
561
561
  let c = 1;
562
- for (; c < i.length; ) o(i[c], !0, !1), o(i[c + 1], !1, !0), o(i[c + 2], !0, !0), c += 3, r = ft(e);
562
+ for (; c < i.length; ) h(i[c], !0, !1), h(i[c + 1], !1, !0), h(i[c + 2], !0, !0), c += 3, r = ft(e);
563
563
  return Ft(e);
564
564
  }
565
565
  function Dt(t, n, s, e, i) {
566
566
  let r = Ot(t);
567
567
  n -= 2 * e, s -= 2 * e;
568
- let { xRange: a, yRange: o } = ft(r);
569
- if (a.max === a.min || o.max === o.min) return console.log("not scaling solution: zero size detected"), t;
570
- let c, h;
568
+ let { xRange: o, yRange: h } = ft(r);
569
+ if (o.max === o.min || h.max === h.min) return console.log("not scaling solution: zero size detected"), t;
570
+ let c, a;
571
571
  if (i) {
572
572
  let m = Math.sqrt(i / Math.PI) * 2;
573
- c = n / m, h = s / m;
574
- } else c = n / (a.max - a.min), h = s / (o.max - o.min);
575
- let u = Math.min(h, c), x = (n - (a.max - a.min) * u) / 2, f = (s - (o.max - o.min) * u) / 2;
573
+ c = n / m, a = s / m;
574
+ } else c = n / (o.max - o.min), a = s / (h.max - h.min);
575
+ let u = Math.min(a, c), g = (n - (o.max - o.min) * u) / 2, f = (s - (h.max - h.min) * u) / 2;
576
576
  return Ft(r.map((m) => ({
577
577
  radius: u * m.radius,
578
- x: e + x + (m.x - a.min) * u,
579
- y: e + f + (m.y - o.min) * u,
578
+ x: e + g + (m.x - o.min) * u,
579
+ y: e + f + (m.y - h.min) * u,
580
580
  setid: m.setid
581
581
  })));
582
582
  }
@@ -589,7 +589,7 @@ function Ot(t) {
589
589
  return Object.keys(t).map((n) => Object.assign(t[n], { setid: n }));
590
590
  }
591
591
  function be(t = {}) {
592
- let n = !1, s = 600, e = 350, i = 15, r = 1e3, a = Math.PI / 2, o = !0, c = null, h = !0, u = !0, x = null, f = null, m = !1, y = null, _ = t && t.symmetricalTextCentre ? t.symmetricalTextCentre : !1, E = {}, d = t && t.colourScheme ? t.colourScheme : t && t.colorScheme ? t.colorScheme : [
592
+ let n = !1, s = 600, e = 350, i = 15, r = 1e3, o = Math.PI / 2, h = !0, c = null, a = !0, u = !0, g = null, f = null, m = !1, y = null, _ = t && t.symmetricalTextCentre ? t.symmetricalTextCentre : !1, E = {}, d = t && t.colourScheme ? t.colourScheme : t && t.colorScheme ? t.colorScheme : [
593
593
  "#1f77b4",
594
594
  "#ff7f0e",
595
595
  "#2ca02c",
@@ -600,146 +600,146 @@ function be(t = {}) {
600
600
  "#7f7f7f",
601
601
  "#bcbd22",
602
602
  "#17becf"
603
- ], b = 0, v = function(M) {
604
- if (M in E) return E[M];
605
- var p = E[M] = d[b];
606
- return b += 1, b >= d.length && (b = 0), p;
607
- }, g = At, k = tt;
608
- function l(M) {
609
- let p = M.datum(), A = /* @__PURE__ */ new Set();
610
- p.forEach((I) => {
611
- I.size == 0 && I.sets.length == 1 && A.add(I.sets[0]);
612
- }), p = p.filter((I) => !I.sets.some((F) => A.has(F)));
613
- let O = {}, B = {};
614
- if (p.length > 0) {
615
- let I = g(p, {
616
- lossFunction: k,
603
+ ], v = 0, b = function(p) {
604
+ if (p in E) return E[p];
605
+ var M = E[p] = d[v];
606
+ return v += 1, v >= d.length && (v = 0), M;
607
+ }, x = At, I = Q;
608
+ function l(p) {
609
+ let M = p.datum(), z = /* @__PURE__ */ new Set();
610
+ M.forEach((k) => {
611
+ k.size == 0 && k.sets.length == 1 && z.add(k.sets[0]);
612
+ }), M = M.filter((k) => !k.sets.some((P) => z.has(P)));
613
+ let R = {}, D = {};
614
+ if (M.length > 0) {
615
+ let k = x(M, {
616
+ lossFunction: I,
617
617
  distinct: m
618
618
  });
619
- o && (I = Nt(I, a, f)), O = Dt(I, s, e, i, c), B = Pt(O, p, _);
619
+ h && (k = Nt(k, o, f)), R = Dt(k, s, e, i, c), D = Pt(R, M, _);
620
620
  }
621
- let C = {};
622
- p.forEach((I) => {
623
- I.label && (C[I.sets] = I.label);
621
+ let U = {};
622
+ M.forEach((k) => {
623
+ k.label && (U[k.sets] = k.label);
624
624
  });
625
- function U(I) {
626
- if (I.sets in C) return C[I.sets];
627
- if (I.sets.length == 1) return "" + I.sets[0];
625
+ function T(k) {
626
+ if (k.sets in U) return U[k.sets];
627
+ if (k.sets.length == 1) return "" + k.sets[0];
628
628
  }
629
- M.selectAll("svg").data([O]).enter().append("svg");
630
- let V = M.select("svg");
631
- n ? V.attr("viewBox", `0 0 ${s} ${e}`) : V.attr("width", s).attr("height", e);
632
- let T = {}, z = !1;
633
- V.selectAll(".venn-area path").each(function(I) {
634
- let F = this.getAttribute("d");
635
- I.sets.length == 1 && F && !m && (z = !0, T[I.sets[0]] = Ie(F));
629
+ p.selectAll("svg").data([R]).enter().append("svg");
630
+ let A = p.select("svg");
631
+ n ? A.attr("viewBox", `0 0 ${s} ${e}`) : A.attr("width", s).attr("height", e);
632
+ let S = {}, N = !1;
633
+ A.selectAll(".venn-area path").each(function(k) {
634
+ let P = this.getAttribute("d");
635
+ k.sets.length == 1 && P && !m && (N = !0, S[k.sets[0]] = Ie(P));
636
636
  });
637
- function $(I) {
638
- return (F) => _t(I.sets.map((G) => {
639
- let J = T[G], X = O[G];
640
- return J || (J = {
637
+ function F(k) {
638
+ return (P) => _t(k.sets.map((W) => {
639
+ let Z = S[W], X = R[W];
640
+ return Z ||= {
641
641
  x: s / 2,
642
642
  y: e / 2,
643
643
  radius: 1
644
- }), X || (X = {
644
+ }, X ||= {
645
645
  x: s / 2,
646
646
  y: e / 2,
647
647
  radius: 1
648
- }), {
649
- x: J.x * (1 - F) + X.x * F,
650
- y: J.y * (1 - F) + X.y * F,
651
- radius: J.radius * (1 - F) + X.radius * F
648
+ }, {
649
+ x: Z.x * (1 - P) + X.x * P,
650
+ y: Z.y * (1 - P) + X.y * P,
651
+ radius: Z.radius * (1 - P) + X.radius * P
652
652
  };
653
653
  }), y);
654
654
  }
655
- let S = V.selectAll(".venn-area").data(p, (I) => I.sets), P = S.enter().append("g").attr("class", (I) => `venn-area venn-${I.sets.length == 1 ? "circle" : "intersection"}${I.colour || I.color ? " venn-coloured" : ""}`).attr("data-venn-sets", (I) => I.sets.join("_")), R = P.append("path"), j = P.append("text").attr("class", "label").text((I) => U(I)).attr("text-anchor", "middle").attr("dy", ".35em").attr("x", s / 2).attr("y", e / 2);
656
- u && (R.style("fill-opacity", "0").filter((I) => I.sets.length == 1).style("fill", (I) => I.colour ? I.colour : I.color ? I.color : v(I.sets)).style("fill-opacity", ".25"), j.style("fill", (I) => I.colour || I.color ? "#FFF" : t.textFill ? t.textFill : I.sets.length == 1 ? v(I.sets) : "#444"));
657
- function N(I) {
658
- return typeof I.transition == "function" ? I.transition("venn").duration(r) : I;
655
+ let $ = A.selectAll(".venn-area").data(M, (k) => k.sets), G = $.enter().append("g").attr("class", (k) => `venn-area venn-${k.sets.length == 1 ? "circle" : "intersection"}${k.colour || k.color ? " venn-coloured" : ""}`).attr("data-venn-sets", (k) => k.sets.join("_")), K = G.append("path"), B = G.append("text").attr("class", "label").text((k) => T(k)).attr("text-anchor", "middle").attr("dy", ".35em").attr("x", s / 2).attr("y", e / 2);
656
+ u && (K.style("fill-opacity", "0").filter((k) => k.sets.length == 1).style("fill", (k) => k.colour ? k.colour : k.color ? k.color : b(k.sets)).style("fill-opacity", ".25"), B.style("fill", (k) => k.colour || k.color ? "#FFF" : t.textFill ? t.textFill : k.sets.length == 1 ? b(k.sets) : "#444"));
657
+ function O(k) {
658
+ return typeof k.transition == "function" ? k.transition("venn").duration(r) : k;
659
659
  }
660
- let q = M;
661
- z && typeof q.transition == "function" ? (q = N(M), q.selectAll("path").attrTween("d", $)) : q.selectAll("path").attr("d", (I) => _t(I.sets.map((F) => O[F])), y);
662
- let L = q.selectAll("text").filter((I) => I.sets in B).text((I) => U(I)).attr("x", (I) => Math.floor(B[I.sets].x)).attr("y", (I) => Math.floor(B[I.sets].y));
663
- h && (z ? "on" in L ? L.on("end", rt(O, U)) : L.each("end", rt(O, U)) : L.each(rt(O, U)));
664
- let D = N(S.exit()).remove();
665
- typeof S.transition == "function" && D.selectAll("path").attrTween("d", $);
666
- let Y = D.selectAll("text").attr("x", s / 2).attr("y", e / 2);
667
- return x !== null && (j.style("font-size", "0px"), L.style("font-size", x), Y.style("font-size", "0px")), {
668
- circles: O,
669
- textCentres: B,
670
- nodes: S,
671
- enter: P,
672
- update: q,
673
- exit: D
660
+ let j = p;
661
+ N && typeof j.transition == "function" ? (j = O(p), j.selectAll("path").attrTween("d", F)) : j.selectAll("path").attr("d", (k) => _t(k.sets.map((P) => R[P])), y);
662
+ let L = j.selectAll("text").filter((k) => k.sets in D).text((k) => T(k)).attr("x", (k) => Math.floor(D[k.sets].x)).attr("y", (k) => Math.floor(D[k.sets].y));
663
+ a && (N ? "on" in L ? L.on("end", rt(R, T)) : L.each("end", rt(R, T)) : L.each(rt(R, T)));
664
+ let C = O($.exit()).remove();
665
+ typeof $.transition == "function" && C.selectAll("path").attrTween("d", F);
666
+ let tt = C.selectAll("text").attr("x", s / 2).attr("y", e / 2);
667
+ return g !== null && (B.style("font-size", "0px"), L.style("font-size", g), tt.style("font-size", "0px")), {
668
+ circles: R,
669
+ textCentres: D,
670
+ nodes: $,
671
+ enter: G,
672
+ update: j,
673
+ exit: C
674
674
  };
675
675
  }
676
- return l.wrap = function(M) {
677
- return arguments.length ? (h = M, l) : h;
676
+ return l.wrap = function(p) {
677
+ return arguments.length ? (a = p, l) : a;
678
678
  }, l.useViewBox = function() {
679
679
  return n = !0, l;
680
- }, l.width = function(M) {
681
- return arguments.length ? (s = M, l) : s;
682
- }, l.height = function(M) {
683
- return arguments.length ? (e = M, l) : e;
684
- }, l.padding = function(M) {
685
- return arguments.length ? (i = M, l) : i;
686
- }, l.distinct = function(M) {
687
- return arguments.length ? (m = M, l) : m;
688
- }, l.colours = function(M) {
689
- return arguments.length ? (v = M, l) : v;
690
- }, l.colors = function(M) {
691
- return arguments.length ? (v = M, l) : v;
692
- }, l.fontSize = function(M) {
693
- return arguments.length ? (x = M, l) : x;
694
- }, l.round = function(M) {
695
- return arguments.length ? (y = M, l) : y;
696
- }, l.duration = function(M) {
697
- return arguments.length ? (r = M, l) : r;
698
- }, l.layoutFunction = function(M) {
699
- return arguments.length ? (g = M, l) : g;
700
- }, l.normalize = function(M) {
701
- return arguments.length ? (o = M, l) : o;
702
- }, l.scaleToFit = function(M) {
703
- return arguments.length ? (c = M, l) : c;
704
- }, l.styled = function(M) {
705
- return arguments.length ? (u = M, l) : u;
706
- }, l.orientation = function(M) {
707
- return arguments.length ? (a = M, l) : a;
708
- }, l.orientationOrder = function(M) {
709
- return arguments.length ? (f = M, l) : f;
710
- }, l.lossFunction = function(M) {
711
- return arguments.length ? (k = M === "default" ? tt : M === "logRatio" ? Rt : M, l) : k;
680
+ }, l.width = function(p) {
681
+ return arguments.length ? (s = p, l) : s;
682
+ }, l.height = function(p) {
683
+ return arguments.length ? (e = p, l) : e;
684
+ }, l.padding = function(p) {
685
+ return arguments.length ? (i = p, l) : i;
686
+ }, l.distinct = function(p) {
687
+ return arguments.length ? (m = p, l) : m;
688
+ }, l.colours = function(p) {
689
+ return arguments.length ? (b = p, l) : b;
690
+ }, l.colors = function(p) {
691
+ return arguments.length ? (b = p, l) : b;
692
+ }, l.fontSize = function(p) {
693
+ return arguments.length ? (g = p, l) : g;
694
+ }, l.round = function(p) {
695
+ return arguments.length ? (y = p, l) : y;
696
+ }, l.duration = function(p) {
697
+ return arguments.length ? (r = p, l) : r;
698
+ }, l.layoutFunction = function(p) {
699
+ return arguments.length ? (x = p, l) : x;
700
+ }, l.normalize = function(p) {
701
+ return arguments.length ? (h = p, l) : h;
702
+ }, l.scaleToFit = function(p) {
703
+ return arguments.length ? (c = p, l) : c;
704
+ }, l.styled = function(p) {
705
+ return arguments.length ? (u = p, l) : u;
706
+ }, l.orientation = function(p) {
707
+ return arguments.length ? (o = p, l) : o;
708
+ }, l.orientationOrder = function(p) {
709
+ return arguments.length ? (f = p, l) : f;
710
+ }, l.lossFunction = function(p) {
711
+ return arguments.length ? (I = p === "default" ? Q : p === "logRatio" ? Rt : p, l) : I;
712
712
  }, l;
713
713
  }
714
714
  function rt(t, n) {
715
715
  return function(s) {
716
- let e = this, i = t[s.sets[0]].radius || 50, r = n(s) || "", a = r.split(/\s+/).reverse(), o = (r.length + a.length) / 3, c = a.pop(), h = [c], u = 0, x = 1.1;
716
+ let e = this, i = t[s.sets[0]].radius || 50, r = n(s) || "", o = r.split(/\s+/).reverse(), h = (r.length + o.length) / 3, c = o.pop(), a = [c], u = 0, g = 1.1;
717
717
  e.textContent = null;
718
718
  let f = [];
719
- function m(b) {
720
- let v = e.ownerDocument.createElementNS(e.namespaceURI, "tspan");
721
- return v.textContent = b, f.push(v), e.append(v), v;
719
+ function m(v) {
720
+ let b = e.ownerDocument.createElementNS(e.namespaceURI, "tspan");
721
+ return b.textContent = v, f.push(b), e.append(b), b;
722
722
  }
723
723
  let y = m(c);
724
- for (; c = a.pop(), c; ) {
725
- h.push(c);
726
- let b = h.join(" ");
727
- y.textContent = b, b.length > o && y.getComputedTextLength() > i && (h.pop(), y.textContent = h.join(" "), h = [c], y = m(c), u++);
724
+ for (; c = o.pop(), c; ) {
725
+ a.push(c);
726
+ let v = a.join(" ");
727
+ y.textContent = v, v.length > h && y.getComputedTextLength() > i && (a.pop(), y.textContent = a.join(" "), a = [c], y = m(c), u++);
728
728
  }
729
- let _ = 0.35 - u * x / 2, E = e.getAttribute("x"), d = e.getAttribute("y");
730
- f.forEach((b, v) => {
731
- b.setAttribute("x", E), b.setAttribute("y", d), b.setAttribute("dy", `${_ + v * x}em`);
729
+ let _ = 0.35 - u * g / 2, E = e.getAttribute("x"), d = e.getAttribute("y");
730
+ f.forEach((v, b) => {
731
+ v.setAttribute("x", E), v.setAttribute("y", d), v.setAttribute("dy", `${_ + b * g}em`);
732
732
  });
733
733
  };
734
734
  }
735
735
  function lt(t, n, s) {
736
- let e = n[0].radius - W(n[0], t);
736
+ let e = n[0].radius - q(n[0], t);
737
737
  for (let i = 1; i < n.length; ++i) {
738
- let r = n[i].radius - W(n[i], t);
738
+ let r = n[i].radius - q(n[i], t);
739
739
  r <= e && (e = r);
740
740
  }
741
741
  for (let i = 0; i < s.length; ++i) {
742
- let r = W(s[i], t) - s[i].radius;
742
+ let r = q(s[i], t) - s[i].radius;
743
743
  r <= e && (e = r);
744
744
  }
745
745
  return e;
@@ -764,50 +764,50 @@ function Ct(t, n, s) {
764
764
  });
765
765
  let i = e[0], r = lt(e[0], t, n);
766
766
  for (let u = 1; u < e.length; ++u) {
767
- let x = lt(e[u], t, n);
768
- x >= r && (i = e[u], r = x);
767
+ let g = lt(e[u], t, n);
768
+ g >= r && (i = e[u], r = g);
769
769
  }
770
- let a = Tt((u) => -1 * lt({
770
+ let o = Tt((u) => -1 * lt({
771
771
  x: u[0],
772
772
  y: u[1]
773
773
  }, t, n), [i.x, i.y], {
774
774
  maxIterations: 500,
775
775
  minErrorDelta: 1e-10
776
- }).x, o = {
777
- x: s ? 0 : a[0],
778
- y: a[1]
776
+ }).x, h = {
777
+ x: s ? 0 : o[0],
778
+ y: o[1]
779
779
  }, c = !0;
780
- for (let u of t) if (W(o, u) > u.radius) {
780
+ for (let u of t) if (q(h, u) > u.radius) {
781
781
  c = !1;
782
782
  break;
783
783
  }
784
- for (let u of n) if (W(o, u) < u.radius) {
784
+ for (let u of n) if (q(h, u) < u.radius) {
785
785
  c = !1;
786
786
  break;
787
787
  }
788
- if (c) return o;
788
+ if (c) return h;
789
789
  if (t.length == 1) return {
790
790
  x: t[0].x,
791
791
  y: t[0].y
792
792
  };
793
- let h = {};
794
- return nt(t, h), h.arcs.length === 0 ? {
793
+ let a = {};
794
+ return nt(t, a), a.arcs.length === 0 ? {
795
795
  x: 0,
796
796
  y: -1e3,
797
797
  disjoint: !0
798
- } : h.arcs.length == 1 ? {
799
- x: h.arcs[0].circle.x,
800
- y: h.arcs[0].circle.y
801
- } : n.length ? Ct(t, []) : zt(h.arcs.map((u) => u.p1));
798
+ } : a.arcs.length == 1 ? {
799
+ x: a.arcs[0].circle.x,
800
+ y: a.arcs[0].circle.y
801
+ } : n.length ? Ct(t, []) : zt(a.arcs.map((u) => u.p1));
802
802
  }
803
803
  function ve(t) {
804
804
  let n = {}, s = Object.keys(t);
805
805
  for (let e of s) n[e] = [];
806
806
  for (let e = 0; e < s.length; e++) {
807
807
  let i = s[e], r = t[i];
808
- for (let a = e + 1; a < s.length; ++a) {
809
- let o = s[a], c = t[o], h = W(r, c);
810
- h + c.radius <= r.radius + 1e-10 ? n[o].push(i) : h + r.radius <= c.radius + 1e-10 && n[i].push(o);
808
+ for (let o = e + 1; o < s.length; ++o) {
809
+ let h = s[o], c = t[h], a = q(r, c);
810
+ a + c.radius <= r.radius + 1e-10 ? n[h].push(i) : a + r.radius <= c.radius + 1e-10 && n[i].push(h);
811
811
  }
812
812
  }
813
813
  return n;
@@ -815,16 +815,16 @@ function ve(t) {
815
815
  function Pt(t, n, s) {
816
816
  let e = {}, i = ve(t);
817
817
  for (let r = 0; r < n.length; ++r) {
818
- let a = n[r].sets, o = {}, c = {};
819
- for (let f = 0; f < a.length; ++f) {
820
- o[a[f]] = !0;
821
- let m = i[a[f]];
818
+ let o = n[r].sets, h = {}, c = {};
819
+ for (let f = 0; f < o.length; ++f) {
820
+ h[o[f]] = !0;
821
+ let m = i[o[f]];
822
822
  for (let y = 0; y < m.length; ++y) c[m[y]] = !0;
823
823
  }
824
- let h = [], u = [];
825
- for (let f in t) f in o ? h.push(t[f]) : f in c || u.push(t[f]);
826
- let x = Ct(h, u, s);
827
- e[a] = x, x.disjoint && n[r].size > 0 && console.log("WARNING: area " + a + " not represented on screen");
824
+ let a = [], u = [];
825
+ for (let f in t) f in h ? a.push(t[f]) : f in c || u.push(t[f]);
826
+ let g = Ct(a, u, s);
827
+ e[o] = g, g.disjoint && n[r].size > 0 && console.log("WARNING: area " + o + " not represented on screen");
828
828
  }
829
829
  return e;
830
830
  }
@@ -863,9 +863,9 @@ M`,
863
863
  e(t[0].p2.y)
864
864
  ];
865
865
  for (let r of t) {
866
- let a = e(r.circle.radius);
866
+ let o = e(r.circle.radius);
867
867
  i.push(`
868
- A`, a, a, 0, +!!r.large, +!!r.sweep, e(r.p1.x), e(r.p1.y));
868
+ A`, o, o, 0, +!!r.large, +!!r.sweep, e(r.p1.x), e(r.p1.y));
869
869
  }
870
870
  return i.join(" ");
871
871
  }
@@ -873,44 +873,44 @@ function _t(t, n) {
873
873
  return jt(Lt(t), n);
874
874
  }
875
875
  function ke(t, n = {}) {
876
- let { lossFunction: s, layoutFunction: e = At, normalize: i = !0, orientation: r = Math.PI / 2, orientationOrder: a, width: o = 600, height: c = 350, padding: h = 15, scaleToFit: u = !1, symmetricalTextCentre: x = !1, distinct: f, round: m = 2 } = n, y = e(t, {
877
- lossFunction: s === "default" || !s ? tt : s === "logRatio" ? Rt : s,
876
+ let { lossFunction: s, layoutFunction: e = At, normalize: i = !0, orientation: r = Math.PI / 2, orientationOrder: o, width: h = 600, height: c = 350, padding: a = 15, scaleToFit: u = !1, symmetricalTextCentre: g = !1, distinct: f, round: m = 2 } = n, y = e(t, {
877
+ lossFunction: s === "default" || !s ? Q : s === "logRatio" ? Rt : s,
878
878
  distinct: f
879
879
  });
880
- i && (y = Nt(y, r, a));
881
- let _ = Dt(y, o, c, h, u), E = Pt(_, t, x), d = new Map(Object.keys(_).map((g) => [g, {
882
- set: g,
883
- x: _[g].x,
884
- y: _[g].y,
885
- radius: _[g].radius
886
- }])), b = t.map((g) => {
887
- let k = g.sets.map((M) => d.get(M)), l = Lt(k);
880
+ i && (y = Nt(y, r, o));
881
+ let _ = Dt(y, h, c, a, u), E = Pt(_, t, g), d = new Map(Object.keys(_).map((x) => [x, {
882
+ set: x,
883
+ x: _[x].x,
884
+ y: _[x].y,
885
+ radius: _[x].radius
886
+ }])), v = t.map((x) => {
887
+ let I = x.sets.map((p) => d.get(p)), l = Lt(I);
888
888
  return {
889
- circles: k,
889
+ circles: I,
890
890
  arcs: l,
891
891
  path: jt(l, m),
892
- area: g,
893
- has: new Set(g.sets)
892
+ area: x,
893
+ has: new Set(x.sets)
894
894
  };
895
895
  });
896
- function v(g) {
897
- let k = "";
898
- for (let l of b) l.has.size > g.length && g.every((M) => l.has.has(M)) && (k += " " + l.path);
899
- return k;
896
+ function b(x) {
897
+ let I = "";
898
+ for (let l of v) l.has.size > x.length && x.every((p) => l.has.has(p)) && (I += " " + l.path);
899
+ return I;
900
900
  }
901
- return b.map(({ circles: g, arcs: k, path: l, area: M }) => ({
902
- data: M,
903
- text: E[M.sets],
904
- circles: g,
905
- arcs: k,
901
+ return v.map(({ circles: x, arcs: I, path: l, area: p }) => ({
902
+ data: p,
903
+ text: E[p.sets],
904
+ circles: x,
905
+ arcs: I,
906
906
  path: l,
907
- distinctPath: l + v(M.sets)
907
+ distinctPath: l + b(p.sets)
908
908
  }));
909
909
  }
910
- var dt = function() {
911
- var t = /* @__PURE__ */ w(function(d, b, v, g) {
912
- for (v || (v = {}), g = d.length; g--; v[d[g]] = b) ;
913
- return v;
910
+ var dt = (function() {
911
+ var t = /* @__PURE__ */ w(function(d, v, b, x) {
912
+ for (b ||= {}, x = d.length; x--; b[d[x]] = v) ;
913
+ return b;
914
914
  }, "o"), n = [5, 8], s = [
915
915
  7,
916
916
  8,
@@ -935,7 +935,7 @@ var dt = function() {
935
935
  22,
936
936
  24,
937
937
  27
938
- ], a = [1, 31], o = [1, 39], c = [
938
+ ], o = [1, 31], h = [1, 39], c = [
939
939
  7,
940
940
  8,
941
941
  11,
@@ -945,7 +945,7 @@ var dt = function() {
945
945
  22,
946
946
  24,
947
947
  27
948
- ], h = [1, 57], u = [1, 56], x = [1, 58], f = [1, 59], m = [1, 60], y = [
948
+ ], a = [1, 57], u = [1, 56], g = [1, 58], f = [1, 59], m = [1, 60], y = [
949
949
  7,
950
950
  8,
951
951
  11,
@@ -1068,18 +1068,18 @@ var dt = function() {
1068
1068
  [13, 1],
1069
1069
  [13, 1]
1070
1070
  ],
1071
- performAction: /* @__PURE__ */ w(function(d, b, v, g, k, l, M) {
1072
- var p = l.length - 1;
1073
- switch (k) {
1071
+ performAction: /* @__PURE__ */ w(function(d, v, b, x, I, l, p) {
1072
+ var M = l.length - 1;
1073
+ switch (I) {
1074
1074
  case 1:
1075
- return l[p - 1];
1075
+ return l[M - 1];
1076
1076
  case 2:
1077
1077
  case 3:
1078
1078
  case 4:
1079
1079
  this.$ = [];
1080
1080
  break;
1081
1081
  case 5:
1082
- l[p - 1].push(l[p]), this.$ = l[p - 1];
1082
+ l[M - 1].push(l[M]), this.$ = l[M - 1];
1083
1083
  break;
1084
1084
  case 6:
1085
1085
  this.$ = [];
@@ -1092,87 +1092,87 @@ var dt = function() {
1092
1092
  case 38:
1093
1093
  case 39:
1094
1094
  case 40:
1095
- this.$ = l[p];
1095
+ this.$ = l[M];
1096
1096
  break;
1097
1097
  case 8:
1098
- g.setDiagramTitle(l[p].substr(6)), this.$ = l[p].substr(6);
1098
+ x.setDiagramTitle(l[M].substr(6)), this.$ = l[M].substr(6);
1099
1099
  break;
1100
1100
  case 9:
1101
- g.addSubsetData([l[p]], void 0, void 0), g.setIndentMode && g.setIndentMode(!0);
1101
+ x.addSubsetData([l[M]], void 0, void 0), x.setIndentMode && x.setIndentMode(!0);
1102
1102
  break;
1103
1103
  case 10:
1104
- g.addSubsetData([l[p - 1]], l[p], void 0), g.setIndentMode && g.setIndentMode(!0);
1104
+ x.addSubsetData([l[M - 1]], l[M], void 0), x.setIndentMode && x.setIndentMode(!0);
1105
1105
  break;
1106
1106
  case 11:
1107
- g.addSubsetData([l[p - 2]], void 0, parseFloat(l[p])), g.setIndentMode && g.setIndentMode(!0);
1107
+ x.addSubsetData([l[M - 2]], void 0, parseFloat(l[M])), x.setIndentMode && x.setIndentMode(!0);
1108
1108
  break;
1109
1109
  case 12:
1110
- g.addSubsetData([l[p - 3]], l[p - 2], parseFloat(l[p])), g.setIndentMode && g.setIndentMode(!0);
1110
+ x.addSubsetData([l[M - 3]], l[M - 2], parseFloat(l[M])), x.setIndentMode && x.setIndentMode(!0);
1111
1111
  break;
1112
1112
  case 13:
1113
- if (l[p].length < 2) throw Error("union requires multiple identifiers");
1114
- g.validateUnionIdentifiers && g.validateUnionIdentifiers(l[p]), g.addSubsetData(l[p], void 0, void 0), g.setIndentMode && g.setIndentMode(!0);
1113
+ if (l[M].length < 2) throw Error("union requires multiple identifiers");
1114
+ x.validateUnionIdentifiers && x.validateUnionIdentifiers(l[M]), x.addSubsetData(l[M], void 0, void 0), x.setIndentMode && x.setIndentMode(!0);
1115
1115
  break;
1116
1116
  case 14:
1117
- if (l[p - 1].length < 2) throw Error("union requires multiple identifiers");
1118
- g.validateUnionIdentifiers && g.validateUnionIdentifiers(l[p - 1]), g.addSubsetData(l[p - 1], l[p], void 0), g.setIndentMode && g.setIndentMode(!0);
1117
+ if (l[M - 1].length < 2) throw Error("union requires multiple identifiers");
1118
+ x.validateUnionIdentifiers && x.validateUnionIdentifiers(l[M - 1]), x.addSubsetData(l[M - 1], l[M], void 0), x.setIndentMode && x.setIndentMode(!0);
1119
1119
  break;
1120
1120
  case 15:
1121
- if (l[p - 2].length < 2) throw Error("union requires multiple identifiers");
1122
- g.validateUnionIdentifiers && g.validateUnionIdentifiers(l[p - 2]), g.addSubsetData(l[p - 2], void 0, parseFloat(l[p])), g.setIndentMode && g.setIndentMode(!0);
1121
+ if (l[M - 2].length < 2) throw Error("union requires multiple identifiers");
1122
+ x.validateUnionIdentifiers && x.validateUnionIdentifiers(l[M - 2]), x.addSubsetData(l[M - 2], void 0, parseFloat(l[M])), x.setIndentMode && x.setIndentMode(!0);
1123
1123
  break;
1124
1124
  case 16:
1125
- if (l[p - 3].length < 2) throw Error("union requires multiple identifiers");
1126
- g.validateUnionIdentifiers && g.validateUnionIdentifiers(l[p - 3]), g.addSubsetData(l[p - 3], l[p - 2], parseFloat(l[p])), g.setIndentMode && g.setIndentMode(!0);
1125
+ if (l[M - 3].length < 2) throw Error("union requires multiple identifiers");
1126
+ x.validateUnionIdentifiers && x.validateUnionIdentifiers(l[M - 3]), x.addSubsetData(l[M - 3], l[M - 2], parseFloat(l[M])), x.setIndentMode && x.setIndentMode(!0);
1127
1127
  break;
1128
1128
  case 17:
1129
1129
  case 18:
1130
1130
  case 19:
1131
- g.addTextData(l[p - 1], l[p], void 0);
1131
+ x.addTextData(l[M - 1], l[M], void 0);
1132
1132
  break;
1133
1133
  case 20:
1134
1134
  case 21:
1135
- g.addTextData(l[p - 2], l[p - 1], l[p]);
1135
+ x.addTextData(l[M - 2], l[M - 1], l[M]);
1136
1136
  break;
1137
1137
  case 23:
1138
- g.addStyleData(l[p - 1], l[p]);
1138
+ x.addStyleData(l[M - 1], l[M]);
1139
1139
  break;
1140
1140
  case 24:
1141
1141
  case 25:
1142
1142
  case 26:
1143
- var A = g.getCurrentSets();
1144
- if (!A) throw Error("text requires set");
1145
- g.addTextData(A, l[p], void 0);
1143
+ var z = x.getCurrentSets();
1144
+ if (!z) throw Error("text requires set");
1145
+ x.addTextData(z, l[M], void 0);
1146
1146
  break;
1147
1147
  case 27:
1148
1148
  case 28:
1149
- var A = g.getCurrentSets();
1150
- if (!A) throw Error("text requires set");
1151
- g.addTextData(A, l[p - 1], l[p]);
1149
+ var z = x.getCurrentSets();
1150
+ if (!z) throw Error("text requires set");
1151
+ x.addTextData(z, l[M - 1], l[M]);
1152
1152
  break;
1153
1153
  case 29:
1154
1154
  case 41:
1155
- this.$ = [l[p]];
1155
+ this.$ = [l[M]];
1156
1156
  break;
1157
1157
  case 30:
1158
1158
  case 42:
1159
- this.$ = [...l[p - 2], l[p]];
1159
+ this.$ = [...l[M - 2], l[M]];
1160
1160
  break;
1161
1161
  case 31:
1162
- this.$ = [l[p - 2], l[p]];
1162
+ this.$ = [l[M - 2], l[M]];
1163
1163
  break;
1164
1164
  case 33:
1165
- this.$ = l[p].join(" ");
1165
+ this.$ = l[M].join(" ");
1166
1166
  break;
1167
1167
  case 34:
1168
- this.$ = [l[p]];
1168
+ this.$ = [l[M]];
1169
1169
  break;
1170
1170
  case 35:
1171
- l[p - 1].push(l[p]), this.$ = l[p - 1];
1171
+ l[M - 1].push(l[M]), this.$ = l[M - 1];
1172
1172
  break;
1173
1173
  case 43:
1174
1174
  case 44:
1175
- this.$ = l[p];
1175
+ this.$ = l[M];
1176
1176
  break;
1177
1177
  }
1178
1178
  }, "anonymous"),
@@ -1243,24 +1243,24 @@ var dt = function() {
1243
1243
  t(s, [2, 13], {
1244
1244
  14: [1, 29],
1245
1245
  15: [1, 30],
1246
- 27: a
1246
+ 27: o
1247
1247
  }),
1248
1248
  t(r, [2, 41]),
1249
1249
  {
1250
1250
  16: [1, 34],
1251
1251
  20: [1, 32],
1252
1252
  21: [1, 33],
1253
- 27: a
1253
+ 27: o
1254
1254
  },
1255
1255
  t(s, [2, 22]),
1256
1256
  t(s, [2, 24], { 14: [1, 35] }),
1257
1257
  t(s, [2, 25], { 14: [1, 36] }),
1258
1258
  t(s, [2, 26]),
1259
1259
  {
1260
- 20: o,
1260
+ 20: h,
1261
1261
  25: 37,
1262
1262
  26: 38,
1263
- 27: a
1263
+ 27: o
1264
1264
  },
1265
1265
  t(s, [2, 10], { 15: [1, 40] }),
1266
1266
  { 16: [1, 41] },
@@ -1287,17 +1287,17 @@ var dt = function() {
1287
1287
  t(s, [2, 20]),
1288
1288
  t(s, [2, 21]),
1289
1289
  {
1290
- 20: o,
1290
+ 20: h,
1291
1291
  26: 51
1292
1292
  },
1293
1293
  {
1294
- 16: h,
1294
+ 16: a,
1295
1295
  20: u,
1296
1296
  21: [1, 53],
1297
1297
  28: 52,
1298
1298
  29: 54,
1299
1299
  30: 55,
1300
- 31: x,
1300
+ 31: g,
1301
1301
  32: f,
1302
1302
  33: m
1303
1303
  },
@@ -1308,9 +1308,9 @@ var dt = function() {
1308
1308
  t(c, [2, 32]),
1309
1309
  t(c, [2, 33], {
1310
1310
  30: 61,
1311
- 16: h,
1311
+ 16: a,
1312
1312
  20: u,
1313
- 31: x,
1313
+ 31: g,
1314
1314
  32: f,
1315
1315
  33: m
1316
1316
  }),
@@ -1323,65 +1323,65 @@ var dt = function() {
1323
1323
  t(y, [2, 35])
1324
1324
  ],
1325
1325
  defaultActions: { 6: [2, 1] },
1326
- parseError: /* @__PURE__ */ w(function(d, b) {
1327
- if (b.recoverable) this.trace(d);
1326
+ parseError: /* @__PURE__ */ w(function(d, v) {
1327
+ if (v.recoverable) this.trace(d);
1328
1328
  else {
1329
- var v = Error(d);
1330
- throw v.hash = b, v;
1329
+ var b = Error(d);
1330
+ throw b.hash = v, b;
1331
1331
  }
1332
1332
  }, "parseError"),
1333
1333
  parse: /* @__PURE__ */ w(function(d) {
1334
- var b = this, v = [0], g = [], k = [null], l = [], M = this.table, p = "", A = 0, O = 0, B = 0, C = 2, U = 1, V = l.slice.call(arguments, 1), T = Object.create(this.lexer), z = { yy: {} };
1335
- for (var $ in this.yy) Object.prototype.hasOwnProperty.call(this.yy, $) && (z.yy[$] = this.yy[$]);
1336
- T.setInput(d, z.yy), z.yy.lexer = T, z.yy.parser = this, T.yylloc === void 0 && (T.yylloc = {});
1337
- var S = T.yylloc;
1338
- l.push(S);
1339
- var P = T.options && T.options.ranges;
1340
- typeof z.yy.parseError == "function" ? this.parseError = z.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
1341
- function R(K) {
1342
- v.length -= 2 * K, k.length -= K, l.length -= K;
1334
+ var v = this, b = [0], x = [], I = [null], l = [], p = this.table, M = "", z = 0, R = 0, D = 0, U = 2, T = 1, A = l.slice.call(arguments, 1), S = Object.create(this.lexer), N = { yy: {} };
1335
+ for (var F in this.yy) Object.prototype.hasOwnProperty.call(this.yy, F) && (N.yy[F] = this.yy[F]);
1336
+ S.setInput(d, N.yy), N.yy.lexer = S, N.yy.parser = this, S.yylloc === void 0 && (S.yylloc = {});
1337
+ var $ = S.yylloc;
1338
+ l.push($);
1339
+ var G = S.options && S.options.ranges;
1340
+ typeof N.yy.parseError == "function" ? this.parseError = N.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
1341
+ function K(V) {
1342
+ b.length -= 2 * V, I.length -= V, l.length -= V;
1343
1343
  }
1344
- w(R, "popStack");
1345
- function j() {
1346
- var K = g.pop() || T.lex() || U;
1347
- return typeof K != "number" && (K instanceof Array && (g = K, K = g.pop()), K = b.symbols_[K] || K), K;
1344
+ w(K, "popStack");
1345
+ function B() {
1346
+ var V = x.pop() || S.lex() || T;
1347
+ return typeof V != "number" && (V instanceof Array && (x = V, V = x.pop()), V = v.symbols_[V] || V), V;
1348
1348
  }
1349
- w(j, "lex");
1350
- for (var N, q, L, D, Y, I = {}, F, G, J, X; ; ) {
1351
- if (L = v[v.length - 1], this.defaultActions[L] ? D = this.defaultActions[L] : (N ?? (N = j()), D = M[L] && M[L][N]), D === void 0 || !D.length || !D[0]) {
1349
+ w(B, "lex");
1350
+ for (var O, j, L, C, tt, k = {}, P, W, Z, X; ; ) {
1351
+ if (L = b[b.length - 1], this.defaultActions[L] ? C = this.defaultActions[L] : (O ??= B(), C = p[L] && p[L][O]), C === void 0 || !C.length || !C[0]) {
1352
1352
  var Mt = "";
1353
- for (F in X = [], M[L]) this.terminals_[F] && F > C && X.push("'" + this.terminals_[F] + "'");
1354
- Mt = T.showPosition ? "Parse error on line " + (A + 1) + `:
1355
- ` + T.showPosition() + `
1356
- Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Parse error on line " + (A + 1) + ": Unexpected " + (N == U ? "end of input" : "'" + (this.terminals_[N] || N) + "'"), this.parseError(Mt, {
1357
- text: T.match,
1358
- token: this.terminals_[N] || N,
1359
- line: T.yylineno,
1360
- loc: S,
1353
+ for (P in X = [], p[L]) this.terminals_[P] && P > U && X.push("'" + this.terminals_[P] + "'");
1354
+ Mt = S.showPosition ? "Parse error on line " + (z + 1) + `:
1355
+ ` + S.showPosition() + `
1356
+ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[O] || O) + "'" : "Parse error on line " + (z + 1) + ": Unexpected " + (O == T ? "end of input" : "'" + (this.terminals_[O] || O) + "'"), this.parseError(Mt, {
1357
+ text: S.match,
1358
+ token: this.terminals_[O] || O,
1359
+ line: S.yylineno,
1360
+ loc: $,
1361
1361
  expected: X
1362
1362
  });
1363
1363
  }
1364
- if (D[0] instanceof Array && D.length > 1) throw Error("Parse Error: multiple actions possible at state: " + L + ", token: " + N);
1365
- switch (D[0]) {
1364
+ if (C[0] instanceof Array && C.length > 1) throw Error("Parse Error: multiple actions possible at state: " + L + ", token: " + O);
1365
+ switch (C[0]) {
1366
1366
  case 1:
1367
- v.push(N), k.push(T.yytext), l.push(T.yylloc), v.push(D[1]), N = null, q ? (N = q, q = null) : (O = T.yyleng, p = T.yytext, A = T.yylineno, S = T.yylloc, B > 0);
1367
+ b.push(O), I.push(S.yytext), l.push(S.yylloc), b.push(C[1]), O = null, j ? (O = j, j = null) : (R = S.yyleng, M = S.yytext, z = S.yylineno, $ = S.yylloc, D > 0);
1368
1368
  break;
1369
1369
  case 2:
1370
- if (G = this.productions_[D[1]][1], I.$ = k[k.length - G], I._$ = {
1371
- first_line: l[l.length - (G || 1)].first_line,
1370
+ if (W = this.productions_[C[1]][1], k.$ = I[I.length - W], k._$ = {
1371
+ first_line: l[l.length - (W || 1)].first_line,
1372
1372
  last_line: l[l.length - 1].last_line,
1373
- first_column: l[l.length - (G || 1)].first_column,
1373
+ first_column: l[l.length - (W || 1)].first_column,
1374
1374
  last_column: l[l.length - 1].last_column
1375
- }, P && (I._$.range = [l[l.length - (G || 1)].range[0], l[l.length - 1].range[1]]), Y = this.performAction.apply(I, [
1376
- p,
1377
- O,
1378
- A,
1379
- z.yy,
1380
- D[1],
1381
- k,
1375
+ }, G && (k._$.range = [l[l.length - (W || 1)].range[0], l[l.length - 1].range[1]]), tt = this.performAction.apply(k, [
1376
+ M,
1377
+ R,
1378
+ z,
1379
+ N.yy,
1380
+ C[1],
1381
+ I,
1382
1382
  l
1383
- ].concat(V)), Y !== void 0) return Y;
1384
- G && (v = v.slice(0, -1 * G * 2), k = k.slice(0, -1 * G), l = l.slice(0, -1 * G)), v.push(this.productions_[D[1]][0]), k.push(I.$), l.push(I._$), J = M[v[v.length - 2]][v[v.length - 1]], v.push(J);
1383
+ ].concat(A)), tt !== void 0) return tt;
1384
+ W && (b = b.slice(0, -1 * W * 2), I = I.slice(0, -1 * W), l = l.slice(0, -1 * W)), b.push(this.productions_[C[1]][0]), I.push(k.$), l.push(k._$), Z = p[b[b.length - 2]][b[b.length - 1]], b.push(Z);
1385
1385
  break;
1386
1386
  case 3:
1387
1387
  return !0;
@@ -1390,15 +1390,15 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1390
1390
  return !0;
1391
1391
  }, "parse")
1392
1392
  };
1393
- _.lexer = /* @__PURE__ */ function() {
1393
+ _.lexer = /* @__PURE__ */ (function() {
1394
1394
  return {
1395
1395
  EOF: 1,
1396
- parseError: /* @__PURE__ */ w(function(d, b) {
1397
- if (this.yy.parser) this.yy.parser.parseError(d, b);
1396
+ parseError: /* @__PURE__ */ w(function(d, v) {
1397
+ if (this.yy.parser) this.yy.parser.parseError(d, v);
1398
1398
  else throw Error(d);
1399
1399
  }, "parseError"),
1400
- setInput: /* @__PURE__ */ w(function(d, b) {
1401
- return this.yy = b || this.yy || {}, this._input = d, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
1400
+ setInput: /* @__PURE__ */ w(function(d, v) {
1401
+ return this.yy = v || this.yy || {}, this._input = d, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
1402
1402
  first_line: 1,
1403
1403
  first_column: 0,
1404
1404
  last_line: 1,
@@ -1410,17 +1410,17 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1410
1410
  return this.yytext += d, this.yyleng++, this.offset++, this.match += d, this.matched += d, d.match(/(?:\r\n?|\n).*/g) ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), d;
1411
1411
  }, "input"),
1412
1412
  unput: /* @__PURE__ */ w(function(d) {
1413
- var b = d.length, v = d.split(/(?:\r\n?|\n)/g);
1414
- this._input = d + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - b), this.offset -= b;
1415
- var g = this.match.split(/(?:\r\n?|\n)/g);
1416
- this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), v.length - 1 && (this.yylineno -= v.length - 1);
1417
- var k = this.yylloc.range;
1413
+ var v = d.length, b = d.split(/(?:\r\n?|\n)/g);
1414
+ this._input = d + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - v), this.offset -= v;
1415
+ var x = this.match.split(/(?:\r\n?|\n)/g);
1416
+ this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), b.length - 1 && (this.yylineno -= b.length - 1);
1417
+ var I = this.yylloc.range;
1418
1418
  return this.yylloc = {
1419
1419
  first_line: this.yylloc.first_line,
1420
1420
  last_line: this.yylineno + 1,
1421
1421
  first_column: this.yylloc.first_column,
1422
- last_column: v ? (v.length === g.length ? this.yylloc.first_column : 0) + g[g.length - v.length].length - v[0].length : this.yylloc.first_column - b
1423
- }, this.options.ranges && (this.yylloc.range = [k[0], k[0] + this.yyleng - b]), this.yyleng = this.yytext.length, this;
1422
+ last_column: b ? (b.length === x.length ? this.yylloc.first_column : 0) + x[x.length - b.length].length - b[0].length : this.yylloc.first_column - v
1423
+ }, this.options.ranges && (this.yylloc.range = [I[0], I[0] + this.yyleng - v]), this.yyleng = this.yytext.length, this;
1424
1424
  }, "unput"),
1425
1425
  more: /* @__PURE__ */ w(function() {
1426
1426
  return this._more = !0, this;
@@ -1447,13 +1447,13 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1447
1447
  return d.length < 20 && (d += this._input.substr(0, 20 - d.length)), (d.substr(0, 20) + (d.length > 20 ? "..." : "")).replace(/\n/g, "");
1448
1448
  }, "upcomingInput"),
1449
1449
  showPosition: /* @__PURE__ */ w(function() {
1450
- var d = this.pastInput(), b = Array(d.length + 1).join("-");
1450
+ var d = this.pastInput(), v = Array(d.length + 1).join("-");
1451
1451
  return d + this.upcomingInput() + `
1452
- ` + b + "^";
1452
+ ` + v + "^";
1453
1453
  }, "showPosition"),
1454
- test_match: /* @__PURE__ */ w(function(d, b) {
1455
- var v, g, k;
1456
- if (this.options.backtrack_lexer && (k = {
1454
+ test_match: /* @__PURE__ */ w(function(d, v) {
1455
+ var b, x, I;
1456
+ if (this.options.backtrack_lexer && (I = {
1457
1457
  yylineno: this.yylineno,
1458
1458
  yylloc: {
1459
1459
  first_line: this.yylloc.first_line,
@@ -1472,14 +1472,14 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1472
1472
  yy: this.yy,
1473
1473
  conditionStack: this.conditionStack.slice(0),
1474
1474
  done: this.done
1475
- }, this.options.ranges && (k.yylloc.range = this.yylloc.range.slice(0))), g = d[0].match(/(?:\r\n?|\n).*/g), g && (this.yylineno += g.length), this.yylloc = {
1475
+ }, this.options.ranges && (I.yylloc.range = this.yylloc.range.slice(0))), x = d[0].match(/(?:\r\n?|\n).*/g), x && (this.yylineno += x.length), this.yylloc = {
1476
1476
  first_line: this.yylloc.last_line,
1477
1477
  last_line: this.yylineno + 1,
1478
1478
  first_column: this.yylloc.last_column,
1479
- last_column: g ? g[g.length - 1].length - g[g.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + d[0].length
1480
- }, this.yytext += d[0], this.match += d[0], this.matches = d, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(d[0].length), this.matched += d[0], v = this.performAction.call(this, this.yy, this, b, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), v) return v;
1479
+ last_column: x ? x[x.length - 1].length - x[x.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + d[0].length
1480
+ }, this.yytext += d[0], this.match += d[0], this.matches = d, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(d[0].length), this.matched += d[0], b = this.performAction.call(this, this.yy, this, v, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), b) return b;
1481
1481
  if (this._backtrack) {
1482
- for (var l in k) this[l] = k[l];
1482
+ for (var l in I) this[l] = I[l];
1483
1483
  return !1;
1484
1484
  }
1485
1485
  return !1;
@@ -1487,18 +1487,18 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1487
1487
  next: /* @__PURE__ */ w(function() {
1488
1488
  if (this.done) return this.EOF;
1489
1489
  this._input || (this.done = !0);
1490
- var d, b, v, g;
1490
+ var d, v, b, x;
1491
1491
  this._more || (this.yytext = "", this.match = "");
1492
- for (var k = this._currentRules(), l = 0; l < k.length; l++) if (v = this._input.match(this.rules[k[l]]), v && (!b || v[0].length > b[0].length)) {
1493
- if (b = v, g = l, this.options.backtrack_lexer) {
1494
- if (d = this.test_match(v, k[l]), d !== !1) return d;
1492
+ for (var I = this._currentRules(), l = 0; l < I.length; l++) if (b = this._input.match(this.rules[I[l]]), b && (!v || b[0].length > v[0].length)) {
1493
+ if (v = b, x = l, this.options.backtrack_lexer) {
1494
+ if (d = this.test_match(b, I[l]), d !== !1) return d;
1495
1495
  if (this._backtrack) {
1496
- b = !1;
1496
+ v = !1;
1497
1497
  continue;
1498
1498
  } else return !1;
1499
1499
  } else if (!this.options.flex) break;
1500
1500
  }
1501
- return b ? (d = this.test_match(b, k[g]), d === !1 ? !1 : d) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
1501
+ return v ? (d = this.test_match(v, I[x]), d === !1 ? !1 : d) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
1502
1502
  ` + this.showPosition(), {
1503
1503
  text: "",
1504
1504
  token: null,
@@ -1527,8 +1527,8 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1527
1527
  return this.conditionStack.length;
1528
1528
  }, "stateStackSize"),
1529
1529
  options: { "case-insensitive": !0 },
1530
- performAction: /* @__PURE__ */ w(function(d, b, v, g) {
1531
- switch (v) {
1530
+ performAction: /* @__PURE__ */ w(function(d, v, b, x) {
1531
+ switch (b) {
1532
1532
  case 0:
1533
1533
  break;
1534
1534
  case 1:
@@ -1541,7 +1541,7 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1541
1541
  case 4:
1542
1542
  break;
1543
1543
  case 5:
1544
- d.setIndentMode && d.setIndentMode(!1), this.begin("INITIAL"), this.unput(b.yytext);
1544
+ d.setIndentMode && d.setIndentMode(!1), this.begin("INITIAL"), this.unput(v.yytext);
1545
1545
  break;
1546
1546
  case 6:
1547
1547
  return this.begin("bol"), 8;
@@ -1566,9 +1566,9 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1566
1566
  case 15:
1567
1567
  return 24;
1568
1568
  case 16:
1569
- return b.yytext = b.yytext.slice(2, -2), 14;
1569
+ return v.yytext = v.yytext.slice(2, -2), 14;
1570
1570
  case 17:
1571
- return b.yytext = b.yytext.slice(1, -1).trim(), 14;
1571
+ return v.yytext = v.yytext.slice(1, -1).trim(), 14;
1572
1572
  case 18:
1573
1573
  return 16;
1574
1574
  case 19:
@@ -1676,12 +1676,12 @@ Expecting ` + X.join(", ") + ", got '" + (this.terminals_[N] || N) + "'" : "Pars
1676
1676
  }
1677
1677
  }
1678
1678
  };
1679
- }();
1679
+ })();
1680
1680
  function E() {
1681
1681
  this.yy = {};
1682
1682
  }
1683
1683
  return w(E, "Parser"), E.prototype = _, _.Parser = E, new E();
1684
- }();
1684
+ })();
1685
1685
  dt.parser = dt;
1686
1686
  var _e = dt, gt = [], xt = [], pt = [], mt = /* @__PURE__ */ new Set(), bt, vt = !1, we = /* @__PURE__ */ w((t, n, s) => {
1687
1687
  let e = st(t).sort(), i = s ?? 10 / t.length ** 2;
@@ -1771,116 +1771,109 @@ function Ut(t) {
1771
1771
  }
1772
1772
  w(Ut, "buildStyleByKey");
1773
1773
  var Le = /* @__PURE__ */ w((t, n, s, e) => {
1774
- var U, V, T;
1775
- let i = e.db, r = (U = i.getConfig) == null ? void 0 : U.call(i), { themeVariables: a, look: o, handDrawnSeed: c } = wt(), h = o === "handDrawn", u = [
1776
- a.venn1,
1777
- a.venn2,
1778
- a.venn3,
1779
- a.venn4,
1780
- a.venn5,
1781
- a.venn6,
1782
- a.venn7,
1783
- a.venn8
1784
- ].filter(Boolean), x = (V = i.getDiagramTitle) == null ? void 0 : V.call(i), f = i.getSubsetData(), m = i.getTextData(), y = Ut(i.getStyleData()), _ = (r == null ? void 0 : r.width) ?? 800, E = (r == null ? void 0 : r.height) ?? 450, d = _ / 1600, b = x ? 48 * d : 0, v = a.primaryTextColor ?? a.textColor, g = Yt(n);
1785
- g.attr("viewBox", `0 0 ${_} ${E}`), x && g.append("text").text(x).attr("class", "venn-title").attr("font-size", `${32 * d}px`).attr("text-anchor", "middle").attr("dominant-baseline", "middle").attr("x", "50%").attr("y", 32 * d).style("fill", a.vennTitleTextColor || a.titleColor);
1786
- let k = it(document.createElement("div")), l = be().width(_).height(E - b);
1787
- k.datum(f).call(l);
1788
- let M = h ? Zt.svg(k.select("svg").node()) : void 0, p = ke(f, {
1774
+ let i = e.db, r = i.getConfig?.(), { themeVariables: o, look: h, handDrawnSeed: c } = wt(), a = h === "handDrawn", u = [
1775
+ o.venn1,
1776
+ o.venn2,
1777
+ o.venn3,
1778
+ o.venn4,
1779
+ o.venn5,
1780
+ o.venn6,
1781
+ o.venn7,
1782
+ o.venn8
1783
+ ].filter(Boolean), g = i.getDiagramTitle?.(), f = i.getSubsetData(), m = i.getTextData(), y = Ut(i.getStyleData()), _ = r?.width ?? 800, E = r?.height ?? 450, d = _ / 1600, v = g ? 48 * d : 0, b = o.primaryTextColor ?? o.textColor, x = Yt(n);
1784
+ x.attr("viewBox", `0 0 ${_} ${E}`), g && x.append("text").text(g).attr("class", "venn-title").attr("font-size", `${32 * d}px`).attr("text-anchor", "middle").attr("dominant-baseline", "middle").attr("x", "50%").attr("y", 32 * d).style("fill", o.vennTitleTextColor || o.titleColor);
1785
+ let I = it(document.createElement("div")), l = be().width(_).height(E - v);
1786
+ I.datum(f).call(l);
1787
+ let p = a ? Zt.svg(I.select("svg").node()) : void 0, M = ke(f, {
1789
1788
  width: _,
1790
- height: E - b,
1791
- padding: (r == null ? void 0 : r.padding) ?? 15
1792
- }), A = /* @__PURE__ */ new Map();
1793
- for (let z of p) {
1794
- let $ = Z([...z.data.sets].sort());
1795
- A.set($, z);
1789
+ height: E - v,
1790
+ padding: r?.padding ?? 15
1791
+ }), z = /* @__PURE__ */ new Map();
1792
+ for (let T of M) {
1793
+ let A = Y([...T.data.sets].sort());
1794
+ z.set(A, T);
1796
1795
  }
1797
- m.length > 0 && Bt(r, A, k, m, d, y);
1798
- let O = Jt(a.background || "#f4f4f4");
1799
- k.selectAll(".venn-circle").each(function(z, $) {
1800
- var Y;
1801
- let S = it(this), P = Z([...z.sets].sort()), R = y.get(P), j = (R == null ? void 0 : R.fill) || u[$ % u.length] || a.primaryColor;
1802
- S.classed(`venn-set-${$ % 8}`, !0);
1803
- let N = (R == null ? void 0 : R["fill-opacity"]) ?? 0.1, q = (R == null ? void 0 : R.stroke) || j, L = (R == null ? void 0 : R["stroke-width"]) || `${5 * d}`;
1804
- if (h && M) {
1805
- let I = A.get(P);
1806
- if (I && I.circles.length > 0) {
1807
- let F = I.circles[0], G = M.circle(F.x, F.y, F.radius * 2, {
1796
+ m.length > 0 && Bt(r, z, I, m, d, y);
1797
+ let R = Jt(o.background || "#f4f4f4");
1798
+ I.selectAll(".venn-circle").each(function(T, A) {
1799
+ let S = it(this), N = Y([...T.sets].sort()), F = y.get(N), $ = F?.fill || u[A % u.length] || o.primaryColor;
1800
+ S.classed(`venn-set-${A % 8}`, !0);
1801
+ let G = F?.["fill-opacity"] ?? 0.1, K = F?.stroke || $, B = F?.["stroke-width"] || `${5 * d}`;
1802
+ if (a && p) {
1803
+ let j = z.get(N);
1804
+ if (j && j.circles.length > 0) {
1805
+ let L = j.circles[0], C = p.circle(L.x, L.y, L.radius * 2, {
1808
1806
  roughness: 0.7,
1809
1807
  seed: c,
1810
- fill: It(j, 0.7),
1808
+ fill: It($, 0.7),
1811
1809
  fillStyle: "hachure",
1812
1810
  fillWeight: 2,
1813
1811
  hachureGap: 8,
1814
- hachureAngle: -41 + $ * 60,
1815
- stroke: q,
1816
- strokeWidth: parseFloat(String(L))
1812
+ hachureAngle: -41 + A * 60,
1813
+ stroke: K,
1814
+ strokeWidth: parseFloat(String(B))
1817
1815
  });
1818
- S.select("path").remove(), (Y = S.node()) == null || Y.insertBefore(G, S.select("text").node());
1816
+ S.select("path").remove(), S.node()?.insertBefore(C, S.select("text").node());
1819
1817
  }
1820
- } else S.select("path").style("fill", j).style("fill-opacity", N).style("stroke", q).style("stroke-width", L).style("stroke-opacity", 0.95);
1821
- let D = (R == null ? void 0 : R.color) || (O ? Qt(j, 30) : te(j, 30));
1822
- S.select("text").style("font-size", `${48 * d}px`).style("fill", D);
1823
- }), h && M ? k.selectAll(".venn-intersection").each(function(z) {
1824
- var j;
1825
- let $ = it(this), S = Z([...z.sets].sort()), P = y.get(S), R = P == null ? void 0 : P.fill;
1826
- if (R) {
1827
- let N = $.select("path"), q = N.attr("d");
1828
- if (q) {
1829
- let L = M.path(q, {
1818
+ } else S.select("path").style("fill", $).style("fill-opacity", G).style("stroke", K).style("stroke-width", B).style("stroke-opacity", 0.95);
1819
+ let O = F?.color || (R ? Qt($, 30) : te($, 30));
1820
+ S.select("text").style("font-size", `${48 * d}px`).style("fill", O);
1821
+ }), a && p ? I.selectAll(".venn-intersection").each(function(T) {
1822
+ let A = it(this), S = Y([...T.sets].sort()), N = y.get(S), F = N?.fill;
1823
+ if (F) {
1824
+ let $ = A.select("path"), G = $.attr("d");
1825
+ if (G) {
1826
+ let K = p.path(G, {
1830
1827
  roughness: 0.7,
1831
1828
  seed: c,
1832
- fill: It(R, 0.3),
1829
+ fill: It(F, 0.3),
1833
1830
  fillStyle: "cross-hatch",
1834
1831
  fillWeight: 2,
1835
1832
  hachureGap: 6,
1836
1833
  hachureAngle: 60,
1837
1834
  stroke: "none"
1838
- }), D = N.node();
1839
- (j = D == null ? void 0 : D.parentNode) == null || j.insertBefore(L, D), N.remove();
1835
+ }), B = $.node();
1836
+ B?.parentNode?.insertBefore(K, B), $.remove();
1840
1837
  }
1841
- } else $.select("path").style("fill-opacity", 0);
1842
- $.select("text").style("font-size", `${48 * d}px`).style("fill", (P == null ? void 0 : P.color) ?? a.vennSetTextColor ?? v);
1843
- }) : (k.selectAll(".venn-intersection text").style("font-size", `${48 * d}px`).style("fill", (z) => {
1844
- var S;
1845
- let $ = Z([...z.sets].sort());
1846
- return ((S = y.get($)) == null ? void 0 : S.color) ?? a.vennSetTextColor ?? v;
1847
- }), k.selectAll(".venn-intersection path").style("fill-opacity", (z) => {
1848
- var S;
1849
- let $ = Z([...z.sets].sort());
1850
- return +!!((S = y.get($)) != null && S.fill);
1851
- }).style("fill", (z) => {
1852
- var S;
1853
- let $ = Z([...z.sets].sort());
1854
- return ((S = y.get($)) == null ? void 0 : S.fill) ?? "transparent";
1838
+ } else A.select("path").style("fill-opacity", 0);
1839
+ A.select("text").style("font-size", `${48 * d}px`).style("fill", N?.color ?? o.vennSetTextColor ?? b);
1840
+ }) : (I.selectAll(".venn-intersection text").style("font-size", `${48 * d}px`).style("fill", (T) => {
1841
+ let A = Y([...T.sets].sort());
1842
+ return y.get(A)?.color ?? o.vennSetTextColor ?? b;
1843
+ }), I.selectAll(".venn-intersection path").style("fill-opacity", (T) => {
1844
+ let A = Y([...T.sets].sort());
1845
+ return +!!y.get(A)?.fill;
1846
+ }).style("fill", (T) => {
1847
+ let A = Y([...T.sets].sort());
1848
+ return y.get(A)?.fill ?? "transparent";
1855
1849
  }));
1856
- let B = g.append("g").attr("transform", `translate(0, ${b})`), C = k.select("svg").node();
1857
- if (C && "childNodes" in C) for (let z of [...C.childNodes]) (T = B.node()) == null || T.appendChild(z);
1858
- ee(g, E, _, (r == null ? void 0 : r.useMaxWidth) ?? !0);
1850
+ let D = x.append("g").attr("transform", `translate(0, ${v})`), U = I.select("svg").node();
1851
+ if (U && "childNodes" in U) for (let T of [...U.childNodes]) D.node()?.appendChild(T);
1852
+ ee(x, E, _, r?.useMaxWidth ?? !0);
1859
1853
  }, "draw");
1860
- function Z(t) {
1854
+ function Y(t) {
1861
1855
  return t.join("|");
1862
1856
  }
1863
- w(Z, "stableSetsKey");
1857
+ w(Y, "stableSetsKey");
1864
1858
  function Bt(t, n, s, e, i, r) {
1865
- var h;
1866
- let a = (t == null ? void 0 : t.useDebugLayout) ?? !1, o = s.select("svg").append("g").attr("class", "venn-text-nodes"), c = /* @__PURE__ */ new Map();
1867
- for (let u of e) {
1868
- let x = Z(u.sets), f = c.get(x);
1869
- f ? f.push(u) : c.set(x, [u]);
1859
+ let o = t?.useDebugLayout ?? !1, h = s.select("svg").append("g").attr("class", "venn-text-nodes"), c = /* @__PURE__ */ new Map();
1860
+ for (let a of e) {
1861
+ let u = Y(a.sets), g = c.get(u);
1862
+ g ? g.push(a) : c.set(u, [a]);
1870
1863
  }
1871
- for (let [u, x] of c.entries()) {
1872
- let f = n.get(u);
1873
- if (!(f != null && f.text)) continue;
1874
- let m = f.text.x, y = f.text.y, _ = Math.min(...f.circles.map((C) => C.radius)), E = Math.min(...f.circles.map((C) => C.radius - Math.hypot(m - C.x, y - C.y))), d = Number.isFinite(E) ? Math.max(0, E) : 0;
1875
- d === 0 && Number.isFinite(_) && (d = _ * 0.6);
1876
- let b = o.append("g").attr("class", "venn-text-area").attr("font-size", `${40 * i}px`);
1877
- a && b.append("circle").attr("class", "venn-text-debug-circle").attr("cx", m).attr("cy", y).attr("r", d).attr("fill", "none").attr("stroke", "purple").attr("stroke-width", 1.5 * i).attr("stroke-dasharray", `${6 * i} ${4 * i}`);
1878
- let v = Math.max(80 * i, d * 2 * 0.95), g = Math.max(60 * i, d * 2 * 0.95), k = (f.data.label && f.data.label.length > 0 ? Math.min(32 * i, d * 0.25) : 0) + (x.length <= 2 ? 30 * i : 0), l = m - v / 2, M = y - g / 2 + k, p = Math.max(1, Math.ceil(Math.sqrt(x.length))), A = Math.max(1, Math.ceil(x.length / p)), O = v / p, B = g / A;
1879
- for (let [C, U] of x.entries()) {
1880
- let V = C % p, T = Math.floor(C / p), z = l + O * (V + 0.5), $ = M + B * (T + 0.5);
1881
- a && b.append("rect").attr("class", "venn-text-debug-cell").attr("x", l + O * V).attr("y", M + B * T).attr("width", O).attr("height", B).attr("fill", "none").attr("stroke", "teal").attr("stroke-width", 1 * i).attr("stroke-dasharray", `${4 * i} ${3 * i}`);
1882
- let S = O * 0.9, P = B * 0.9, R = b.append("foreignObject").attr("class", "venn-text-node-fo").attr("width", S).attr("height", P).attr("x", z - S / 2).attr("y", $ - P / 2).attr("overflow", "visible"), j = (h = r.get(U.id)) == null ? void 0 : h.color, N = R.append("xhtml:span").attr("class", "venn-text-node").style("display", "flex").style("width", "100%").style("height", "100%").style("white-space", "normal").style("align-items", "center").style("justify-content", "center").style("text-align", "center").style("overflow-wrap", "normal").style("word-break", "normal").text(U.label ?? U.id);
1883
- j && N.style("color", j);
1864
+ for (let [a, u] of c.entries()) {
1865
+ let g = n.get(a);
1866
+ if (!g?.text) continue;
1867
+ let f = g.text.x, m = g.text.y, y = Math.min(...g.circles.map((D) => D.radius)), _ = Math.min(...g.circles.map((D) => D.radius - Math.hypot(f - D.x, m - D.y))), E = Number.isFinite(_) ? Math.max(0, _) : 0;
1868
+ E === 0 && Number.isFinite(y) && (E = y * 0.6);
1869
+ let d = h.append("g").attr("class", "venn-text-area").attr("font-size", `${40 * i}px`);
1870
+ o && d.append("circle").attr("class", "venn-text-debug-circle").attr("cx", f).attr("cy", m).attr("r", E).attr("fill", "none").attr("stroke", "purple").attr("stroke-width", 1.5 * i).attr("stroke-dasharray", `${6 * i} ${4 * i}`);
1871
+ let v = Math.max(80 * i, E * 2 * 0.95), b = Math.max(60 * i, E * 2 * 0.95), x = (g.data.label && g.data.label.length > 0 ? Math.min(32 * i, E * 0.25) : 0) + (u.length <= 2 ? 30 * i : 0), I = f - v / 2, l = m - b / 2 + x, p = Math.max(1, Math.ceil(Math.sqrt(u.length))), M = Math.max(1, Math.ceil(u.length / p)), z = v / p, R = b / M;
1872
+ for (let [D, U] of u.entries()) {
1873
+ let T = D % p, A = Math.floor(D / p), S = I + z * (T + 0.5), N = l + R * (A + 0.5);
1874
+ o && d.append("rect").attr("class", "venn-text-debug-cell").attr("x", I + z * T).attr("y", l + R * A).attr("width", z).attr("height", R).attr("fill", "none").attr("stroke", "teal").attr("stroke-width", 1 * i).attr("stroke-dasharray", `${4 * i} ${3 * i}`);
1875
+ let F = z * 0.9, $ = R * 0.9, G = d.append("foreignObject").attr("class", "venn-text-node-fo").attr("width", F).attr("height", $).attr("x", S - F / 2).attr("y", N - $ / 2).attr("overflow", "visible"), K = r.get(U.id)?.color, B = G.append("xhtml:span").attr("class", "venn-text-node").style("display", "flex").style("width", "100%").style("height", "100%").style("white-space", "normal").style("align-items", "center").style("justify-content", "center").style("text-align", "center").style("overflow-wrap", "normal").style("word-break", "normal").text(U.label ?? U.id);
1876
+ K && B.style("color", K);
1884
1877
  }
1885
1878
  }
1886
1879
  }