@marimo-team/islands 0.13.16-dev2 → 0.13.16-dev21

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 (86) hide show
  1. package/dist/{ConnectedDataExplorerComponent-BizAnuDQ.js → ConnectedDataExplorerComponent-CbgMGTNw.js} +1495 -1496
  2. package/dist/ImageComparisonComponent-BEvxQRYY.js +248 -0
  3. package/dist/{VegaLite-BvtjUHLS.js → VegaLite-CtlLD_UH.js} +12483 -12485
  4. package/dist/{_baseUniq-C1K8a5jF.js → _baseUniq-BPYian-Y.js} +13 -13
  5. package/dist/{any-language-editor-D3C2KiQW.js → any-language-editor-B9yuOY2a.js} +2 -2
  6. package/dist/{architectureDiagram-IEHRJDOE-DhrFWr1a.js → architectureDiagram-IEHRJDOE-yPyQlJjy.js} +1800 -1800
  7. package/dist/asn1-jKiBa2Ya.js +10 -10
  8. package/dist/assets/{save-worker-9HEtFDM0.js → save-worker-DwN_qfSx.js} +695 -702
  9. package/dist/assets/{worker-BGGm0KYZ.js → worker-BzMPE1Lq.js} +732 -739
  10. package/dist/assets/{worker-BNsqBj5w.js → worker-ISYYr8IB.js} +726 -732
  11. package/dist/blockDiagram-JOT3LUYC-548hLzGM.js +2249 -0
  12. package/dist/{c4Diagram-VJAJSXHY-DKSU0_Zg.js → c4Diagram-VJAJSXHY-CkEjf0GP.js} +401 -400
  13. package/dist/{channel-DMiLp-mI.js → channel-B4Bg4vOE.js} +1 -1
  14. package/dist/chunk-4BMEZGHF-De9P61oF.js +9 -0
  15. package/dist/chunk-A2AXSNBT-geH9ZZvt.js +1373 -0
  16. package/dist/chunk-AEK57VVT-B2sQ0hQa.js +1416 -0
  17. package/dist/{chunk-D6G4REZN-BZV3ukOi.js → chunk-D6G4REZN-C2nlv3Zm.js} +2 -2
  18. package/dist/{chunk-RZ5BOZE2-B4rOVQD8.js → chunk-RZ5BOZE2-CmOabQbu.js} +8 -8
  19. package/dist/chunk-XZIHB7SX-C-O1Dk7e.js +16 -0
  20. package/dist/{classDiagram-GIVACNV2-DLRT4_A4.js → classDiagram-GIVACNV2-Du2vgWFA.js} +2 -2
  21. package/dist/{classDiagram-v2-COTLJTTW-DLRT4_A4.js → classDiagram-v2-COTLJTTW-Du2vgWFA.js} +2 -2
  22. package/dist/clojure-CCKyeQKf.js +2 -2
  23. package/dist/{clone-CPwu6xRn.js → clone-DnSM2M6p.js} +1 -1
  24. package/dist/css-bIlmDBTK.js +19 -19
  25. package/dist/{cytoscape.esm-DAyNQ0qu.js → cytoscape.esm-CCQ3SVU1.js} +2301 -2301
  26. package/dist/dagre-OKDRZEBW-CnGJy_Hk.js +447 -0
  27. package/dist/{data-editor-CYvUeKhw.js → data-editor--qYs3N6K.js} +5785 -5795
  28. package/dist/{diagram-SSKATNLV-D8WhiY2q.js → diagram-SSKATNLV-Ba25ch_t.js} +13 -13
  29. package/dist/{diagram-VNBRO52H-Bil9sOsr.js → diagram-VNBRO52H-ky1Bklgc.js} +3 -3
  30. package/dist/{erDiagram-Q7BY3M3F-J-Jm-DD7.js → erDiagram-Q7BY3M3F-DKx4pdnF.js} +263 -262
  31. package/dist/flowDiagram-4HSFHLVR-D2g6V5ro.js +1623 -0
  32. package/dist/{ganttDiagram-APWFNJXF-C2G0-fOq.js → ganttDiagram-APWFNJXF-CM2375VL.js} +45 -45
  33. package/dist/gitGraphDiagram-7IBYFJ6S-CYBXIIJu.js +712 -0
  34. package/dist/{graph-BFerxzEi.js → graph-BXO6Y4fK.js} +9 -9
  35. package/dist/{index-DfpR00QG.js → index-BXQhgr_p.js} +99 -98
  36. package/dist/{index-BhtvwOag.js → index-CLVuMf-N.js} +28 -28
  37. package/dist/{index-j8M50mVa.js → index-DsjbPR0S.js} +4 -4
  38. package/dist/{index-DkuVwdVm.js → index-kCGDeFbz.js} +9 -9
  39. package/dist/{infoDiagram-PH2N3AL5-AYtb1_Lz.js → infoDiagram-PH2N3AL5-Bysuy2jX.js} +3 -3
  40. package/dist/javascript-WMWNx-Vj.js +47 -47
  41. package/dist/{journeyDiagram-U35MCT3I-Bdz9gIBI.js → journeyDiagram-U35MCT3I-TBaQruI8.js} +18 -18
  42. package/dist/kanban-definition-NDS4AKOZ-D4jw_Hry.js +719 -0
  43. package/dist/{katex-9tX9hjoM.js → katex-CUSbq6rG.js} +2180 -2180
  44. package/dist/{layout-Qs-BVu8V.js → layout-BUA-DPJm.js} +27 -27
  45. package/dist/{linear-SIbCb7yI.js → linear-BnTRnU3J.js} +2 -2
  46. package/dist/main-D-37AaR4.js +169855 -0
  47. package/dist/main.js +1 -1
  48. package/dist/mermaid-BzFQ2d9i.js +14517 -0
  49. package/dist/{mhchem-L5-rce7L.js → mhchem-Db_f2n8C.js} +30 -30
  50. package/dist/{min-BTA1UVkn.js → min-D_xIH6wU.js} +2 -2
  51. package/dist/{mindmap-definition-ALO5MXBD-CdrD5BzZ.js → mindmap-definition-ALO5MXBD-J6RsqNRW.js} +359 -359
  52. package/dist/mllike-BSnXJBGA.js +7 -7
  53. package/dist/{pieDiagram-IB7DONF6-BbbxWeqU.js → pieDiagram-IB7DONF6-CyMim2nt.js} +34 -34
  54. package/dist/pug-BqUR2bBq.js +35 -35
  55. package/dist/python-B5QdSKoL.js +18 -18
  56. package/dist/quadrantDiagram-7GDLP6J5-wbyf83kA.js +1025 -0
  57. package/dist/{radar-MK3ICKWK-Z5R0bt0z.js → radar-MK3ICKWK-BDGRcSnx.js} +2555 -2554
  58. package/dist/{react-plotly-DqDxe4Uh.js → react-plotly-DrgClWur.js} +6595 -6597
  59. package/dist/{requirementDiagram-KVF5MWMF-DMnvzAxX.js → requirementDiagram-KVF5MWMF-Cm8xuD8x.js} +251 -250
  60. package/dist/rpm-IznJm2Xc.js +9 -9
  61. package/dist/{sankeyDiagram-QLVOVGJD-DbUWg3a4.js → sankeyDiagram-QLVOVGJD-iRFZmvn2.js} +339 -338
  62. package/dist/{sequenceDiagram-X6HHIX6F-JltcBwLF.js → sequenceDiagram-X6HHIX6F-Dr8oo1TZ.js} +822 -821
  63. package/dist/{slides-component-DVr5mf9p.js → slides-component-D8N71t3Y.js} +280 -280
  64. package/dist/sql-mMre1Bo3.js +9 -9
  65. package/dist/{stateDiagram-DGXRK772-qbXtyoS6.js → stateDiagram-DGXRK772-BNQYJSkB.js} +17 -17
  66. package/dist/{stateDiagram-v2-YXO3MK2T-Ba7q5pMK.js → stateDiagram-v2-YXO3MK2T-Dl249u1C.js} +2 -2
  67. package/dist/style.css +1 -1
  68. package/dist/{time-DHD8Fix8.js → time-hpTGXdsY.js} +2 -2
  69. package/dist/{timeline-definition-BDJGKUSR-q4gOCBRq.js → timeline-definition-BDJGKUSR-kYwIJd20.js} +261 -261
  70. package/dist/timer-BYwnU4DF.js +378 -378
  71. package/dist/ttcn-cfg-Bac_acMi.js +9 -9
  72. package/dist/{vega-component-D2NZFVvw.js → vega-component-CIAcZw-F.js} +82 -82
  73. package/dist/{xychartDiagram-VJFVF3MP-BZs9xPvU.js → xychartDiagram-VJFVF3MP-Cj3j6vWQ.js} +472 -471
  74. package/package.json +7 -6
  75. package/dist/blockDiagram-JOT3LUYC-COVagShg.js +0 -2248
  76. package/dist/chunk-4BMEZGHF-CeMSohVe.js +0 -9
  77. package/dist/chunk-A2AXSNBT-mQ3fXQfx.js +0 -1372
  78. package/dist/chunk-AEK57VVT-B7kw2yt6.js +0 -1415
  79. package/dist/chunk-XZIHB7SX-C3-5SkZh.js +0 -15
  80. package/dist/dagre-OKDRZEBW-yEQf6TwX.js +0 -447
  81. package/dist/flowDiagram-4HSFHLVR-Dhymtq1g.js +0 -1622
  82. package/dist/gitGraphDiagram-7IBYFJ6S-DCZAwPro.js +0 -712
  83. package/dist/kanban-definition-NDS4AKOZ-ByLpDX9Y.js +0 -719
  84. package/dist/main-Cx3zrED9.js +0 -156521
  85. package/dist/mermaid-DAi_EtLa.js +0 -11991
  86. package/dist/quadrantDiagram-7GDLP6J5-1UQgbW9Z.js +0 -1024
@@ -1,119 +1,120 @@
1
- import { _ as p, q as xt, t as vt, s as wt, g as bt, b as St, a as Lt, c as lt, A as Et, d as H, T as At, z as Tt, k as Mt } from "./mermaid-DAi_EtLa.js";
2
- import { o as Nt } from "./ordinal-CYN5qNoq.js";
3
- import { c as It } from "./colors-BD7LS4qt.js";
4
- const Pt = It("4e79a7f28e2ce1575976b7b259a14fedc949af7aa1ff9da79c755fbab0ab");
5
- function pt(t, e) {
1
+ var _a, _b, _c;
2
+ import { _ as p, q as kt, t as _t, s as xt, g as vt, b as wt, a as bt, c as ot, A as St, d as G, T as Lt, z as Et, k as At } from "./mermaid-BzFQ2d9i.js";
3
+ import { o as Tt } from "./ordinal-CYN5qNoq.js";
4
+ import { c as Mt } from "./colors-BD7LS4qt.js";
5
+ const Nt = Mt("4e79a7f28e2ce1575976b7b259a14fedc949af7aa1ff9da79c755fbab0ab");
6
+ function gt(t, e) {
6
7
  return t < e ? -1 : t > e ? 1 : t >= e ? 0 : NaN;
7
8
  }
8
- function Ct(t) {
9
- return t.length === 1 && (t = Ot(t)), {
9
+ function It(t) {
10
+ return t.length === 1 && (t = Pt(t)), {
10
11
  left: function(e, o, r, i) {
11
12
  for (r == null && (r = 0), i == null && (i = e.length); r < i; ) {
12
- var a = r + i >>> 1;
13
- t(e[a], o) < 0 ? r = a + 1 : i = a;
13
+ var f = r + i >>> 1;
14
+ t(e[f], o) < 0 ? r = f + 1 : i = f;
14
15
  }
15
16
  return r;
16
17
  },
17
18
  right: function(e, o, r, i) {
18
19
  for (r == null && (r = 0), i == null && (i = e.length); r < i; ) {
19
- var a = r + i >>> 1;
20
- t(e[a], o) > 0 ? i = a : r = a + 1;
20
+ var f = r + i >>> 1;
21
+ t(e[f], o) > 0 ? i = f : r = f + 1;
21
22
  }
22
23
  return r;
23
24
  }
24
25
  };
25
26
  }
26
- function Ot(t) {
27
+ function Pt(t) {
27
28
  return function(e, o) {
28
- return pt(t(e), o);
29
+ return gt(t(e), o);
29
30
  };
30
31
  }
31
- Ct(pt);
32
- function ct(t, e) {
33
- var o = t.length, r = -1, i, a;
32
+ It(gt);
33
+ function at(t, e) {
34
+ var o = t.length, r = -1, i, f;
34
35
  if (e == null) {
35
36
  for (; ++r < o; )
36
37
  if ((i = t[r]) != null && i >= i)
37
- for (a = i; ++r < o; )
38
- (i = t[r]) != null && i > a && (a = i);
38
+ for (f = i; ++r < o; )
39
+ (i = t[r]) != null && i > f && (f = i);
39
40
  } else
40
41
  for (; ++r < o; )
41
42
  if ((i = e(t[r], r, t)) != null && i >= i)
42
- for (a = i; ++r < o; )
43
- (i = e(t[r], r, t)) != null && i > a && (a = i);
44
- return a;
43
+ for (f = i; ++r < o; )
44
+ (i = e(t[r], r, t)) != null && i > f && (f = i);
45
+ return f;
45
46
  }
46
- function mt(t, e) {
47
- var o = t.length, r = -1, i, a;
47
+ function dt(t, e) {
48
+ var o = t.length, r = -1, i, f;
48
49
  if (e == null) {
49
50
  for (; ++r < o; )
50
51
  if ((i = t[r]) != null && i >= i)
51
- for (a = i; ++r < o; )
52
- (i = t[r]) != null && a > i && (a = i);
52
+ for (f = i; ++r < o; )
53
+ (i = t[r]) != null && f > i && (f = i);
53
54
  } else
54
55
  for (; ++r < o; )
55
56
  if ((i = e(t[r], r, t)) != null && i >= i)
56
- for (a = i; ++r < o; )
57
- (i = e(t[r], r, t)) != null && a > i && (a = i);
58
- return a;
57
+ for (f = i; ++r < o; )
58
+ (i = e(t[r], r, t)) != null && f > i && (f = i);
59
+ return f;
59
60
  }
60
- function nt(t, e) {
61
- var o = t.length, r = -1, i, a = 0;
61
+ function J(t, e) {
62
+ var o = t.length, r = -1, i, f = 0;
62
63
  if (e == null)
63
64
  for (; ++r < o; )
64
- (i = +t[r]) && (a += i);
65
+ (i = +t[r]) && (f += i);
65
66
  else
66
67
  for (; ++r < o; )
67
- (i = +e(t[r], r, t)) && (a += i);
68
- return a;
68
+ (i = +e(t[r], r, t)) && (f += i);
69
+ return f;
69
70
  }
70
- function zt(t) {
71
+ function Ct(t) {
71
72
  return t.target.depth;
72
73
  }
73
- function Dt(t) {
74
+ function Ot(t) {
74
75
  return t.depth;
75
76
  }
76
- function $t(t, e) {
77
+ function zt(t, e) {
77
78
  return e - 1 - t.height;
78
79
  }
79
- function kt(t, e) {
80
+ function pt(t, e) {
80
81
  return t.sourceLinks.length ? t.depth : e - 1;
81
82
  }
82
- function jt(t) {
83
- return t.targetLinks.length ? t.depth : t.sourceLinks.length ? mt(t.sourceLinks, zt) - 1 : 0;
83
+ function Dt(t) {
84
+ return t.targetLinks.length ? t.depth : t.sourceLinks.length ? dt(t.sourceLinks, Ct) - 1 : 0;
84
85
  }
85
- function X(t) {
86
+ function Y(t) {
86
87
  return function() {
87
88
  return t;
88
89
  };
89
90
  }
90
- function ut(t, e) {
91
- return Q(t.source, e.source) || t.index - e.index;
91
+ function lt(t, e) {
92
+ return q(t.source, e.source) || t.index - e.index;
92
93
  }
93
- function ht(t, e) {
94
- return Q(t.target, e.target) || t.index - e.index;
94
+ function ct(t, e) {
95
+ return q(t.target, e.target) || t.index - e.index;
95
96
  }
96
- function Q(t, e) {
97
+ function q(t, e) {
97
98
  return t.y0 - e.y0;
98
99
  }
99
- function it(t) {
100
+ function tt(t) {
100
101
  return t.value;
101
102
  }
102
- function Bt(t) {
103
+ function $t(t) {
103
104
  return t.index;
104
105
  }
105
- function Rt(t) {
106
+ function jt(t) {
106
107
  return t.nodes;
107
108
  }
108
- function Ft(t) {
109
+ function Bt(t) {
109
110
  return t.links;
110
111
  }
111
- function ft(t, e) {
112
+ function ut(t, e) {
112
113
  const o = t.get(e);
113
114
  if (!o) throw new Error("missing: " + e);
114
115
  return o;
115
116
  }
116
- function yt({ nodes: t }) {
117
+ function ht({ nodes: t }) {
117
118
  for (const e of t) {
118
119
  let o = e.y0, r = o;
119
120
  for (const i of e.sourceLinks)
@@ -122,30 +123,30 @@ function yt({ nodes: t }) {
122
123
  i.y1 = r + i.width / 2, r += i.width;
123
124
  }
124
125
  }
125
- function Vt() {
126
- let t = 0, e = 0, o = 1, r = 1, i = 24, a = 8, m, _ = Bt, s = kt, c, u, x = Rt, v = Ft, g = 6;
126
+ function Rt() {
127
+ let t = 0, e = 0, o = 1, r = 1, i = 24, f = 8, m, _ = $t, s = pt, l, c, x = jt, v = Bt, g = 6;
127
128
  function w() {
128
129
  const n = { nodes: x.apply(null, arguments), links: v.apply(null, arguments) };
129
- return M(n), T(n), N(n), C(n), S(n), yt(n), n;
130
+ return M(n), T(n), N(n), C(n), S(n), ht(n), n;
130
131
  }
131
132
  w.update = function(n) {
132
- return yt(n), n;
133
+ return ht(n), n;
133
134
  }, w.nodeId = function(n) {
134
- return arguments.length ? (_ = typeof n == "function" ? n : X(n), w) : _;
135
+ return arguments.length ? (_ = typeof n == "function" ? n : Y(n), w) : _;
135
136
  }, w.nodeAlign = function(n) {
136
- return arguments.length ? (s = typeof n == "function" ? n : X(n), w) : s;
137
+ return arguments.length ? (s = typeof n == "function" ? n : Y(n), w) : s;
137
138
  }, w.nodeSort = function(n) {
138
- return arguments.length ? (c = n, w) : c;
139
+ return arguments.length ? (l = n, w) : l;
139
140
  }, w.nodeWidth = function(n) {
140
141
  return arguments.length ? (i = +n, w) : i;
141
142
  }, w.nodePadding = function(n) {
142
- return arguments.length ? (a = m = +n, w) : a;
143
+ return arguments.length ? (f = m = +n, w) : f;
143
144
  }, w.nodes = function(n) {
144
- return arguments.length ? (x = typeof n == "function" ? n : X(n), w) : x;
145
+ return arguments.length ? (x = typeof n == "function" ? n : Y(n), w) : x;
145
146
  }, w.links = function(n) {
146
- return arguments.length ? (v = typeof n == "function" ? n : X(n), w) : v;
147
+ return arguments.length ? (v = typeof n == "function" ? n : Y(n), w) : v;
147
148
  }, w.linkSort = function(n) {
148
- return arguments.length ? (u = n, w) : u;
149
+ return arguments.length ? (c = n, w) : c;
149
150
  }, w.size = function(n) {
150
151
  return arguments.length ? (t = e = 0, o = +n[0], r = +n[1], w) : [o - t, r - e];
151
152
  }, w.extent = function(n) {
@@ -154,180 +155,180 @@ function Vt() {
154
155
  return arguments.length ? (g = +n, w) : g;
155
156
  };
156
157
  function M({ nodes: n, links: y }) {
157
- for (const [h, l] of n.entries())
158
- l.index = h, l.sourceLinks = [], l.targetLinks = [];
159
- const f = new Map(n.map((h, l) => [_(h, l, n), h]));
160
- for (const [h, l] of y.entries()) {
161
- l.index = h;
162
- let { source: k, target: b } = l;
163
- typeof k != "object" && (k = l.source = ft(f, k)), typeof b != "object" && (b = l.target = ft(f, b)), k.sourceLinks.push(l), b.targetLinks.push(l);
158
+ for (const [u, a] of n.entries())
159
+ a.index = u, a.sourceLinks = [], a.targetLinks = [];
160
+ const h = new Map(n.map((u, a) => [_(u, a, n), u]));
161
+ for (const [u, a] of y.entries()) {
162
+ a.index = u;
163
+ let { source: k, target: b } = a;
164
+ typeof k != "object" && (k = a.source = ut(h, k)), typeof b != "object" && (b = a.target = ut(h, b)), k.sourceLinks.push(a), b.targetLinks.push(a);
164
165
  }
165
- if (u != null)
166
- for (const { sourceLinks: h, targetLinks: l } of n)
167
- h.sort(u), l.sort(u);
166
+ if (c != null)
167
+ for (const { sourceLinks: u, targetLinks: a } of n)
168
+ u.sort(c), a.sort(c);
168
169
  }
169
170
  function T({ nodes: n }) {
170
171
  for (const y of n)
171
- y.value = y.fixedValue === void 0 ? Math.max(nt(y.sourceLinks, it), nt(y.targetLinks, it)) : y.fixedValue;
172
+ y.value = y.fixedValue === void 0 ? Math.max(J(y.sourceLinks, tt), J(y.targetLinks, tt)) : y.fixedValue;
172
173
  }
173
174
  function N({ nodes: n }) {
174
175
  const y = n.length;
175
- let f = new Set(n), h = /* @__PURE__ */ new Set(), l = 0;
176
- for (; f.size; ) {
177
- for (const k of f) {
178
- k.depth = l;
176
+ let h = new Set(n), u = /* @__PURE__ */ new Set(), a = 0;
177
+ for (; h.size; ) {
178
+ for (const k of h) {
179
+ k.depth = a;
179
180
  for (const { target: b } of k.sourceLinks)
180
- h.add(b);
181
+ u.add(b);
181
182
  }
182
- if (++l > y) throw new Error("circular link");
183
- f = h, h = /* @__PURE__ */ new Set();
183
+ if (++a > y) throw new Error("circular link");
184
+ h = u, u = /* @__PURE__ */ new Set();
184
185
  }
185
186
  }
186
187
  function C({ nodes: n }) {
187
188
  const y = n.length;
188
- let f = new Set(n), h = /* @__PURE__ */ new Set(), l = 0;
189
- for (; f.size; ) {
190
- for (const k of f) {
191
- k.height = l;
189
+ let h = new Set(n), u = /* @__PURE__ */ new Set(), a = 0;
190
+ for (; h.size; ) {
191
+ for (const k of h) {
192
+ k.height = a;
192
193
  for (const { source: b } of k.targetLinks)
193
- h.add(b);
194
+ u.add(b);
194
195
  }
195
- if (++l > y) throw new Error("circular link");
196
- f = h, h = /* @__PURE__ */ new Set();
196
+ if (++a > y) throw new Error("circular link");
197
+ h = u, u = /* @__PURE__ */ new Set();
197
198
  }
198
199
  }
199
200
  function D({ nodes: n }) {
200
- const y = ct(n, (l) => l.depth) + 1, f = (o - t - i) / (y - 1), h = new Array(y);
201
- for (const l of n) {
202
- const k = Math.max(0, Math.min(y - 1, Math.floor(s.call(null, l, y))));
203
- l.layer = k, l.x0 = t + k * f, l.x1 = l.x0 + i, h[k] ? h[k].push(l) : h[k] = [l];
201
+ const y = at(n, (a) => a.depth) + 1, h = (o - t - i) / (y - 1), u = new Array(y);
202
+ for (const a of n) {
203
+ const k = Math.max(0, Math.min(y - 1, Math.floor(s.call(null, a, y))));
204
+ a.layer = k, a.x0 = t + k * h, a.x1 = a.x0 + i, u[k] ? u[k].push(a) : u[k] = [a];
204
205
  }
205
- if (c) for (const l of h)
206
- l.sort(c);
207
- return h;
206
+ if (l) for (const a of u)
207
+ a.sort(l);
208
+ return u;
208
209
  }
209
- function R(n) {
210
- const y = mt(n, (f) => (r - e - (f.length - 1) * m) / nt(f, it));
211
- for (const f of n) {
212
- let h = e;
213
- for (const l of f) {
214
- l.y0 = h, l.y1 = h + l.value * y, h = l.y1 + m;
215
- for (const k of l.sourceLinks)
210
+ function B(n) {
211
+ const y = dt(n, (h) => (r - e - (h.length - 1) * m) / J(h, tt));
212
+ for (const h of n) {
213
+ let u = e;
214
+ for (const a of h) {
215
+ a.y0 = u, a.y1 = u + a.value * y, u = a.y1 + m;
216
+ for (const k of a.sourceLinks)
216
217
  k.width = k.value * y;
217
218
  }
218
- h = (r - h + m) / (f.length + 1);
219
- for (let l = 0; l < f.length; ++l) {
220
- const k = f[l];
221
- k.y0 += h * (l + 1), k.y1 += h * (l + 1);
219
+ u = (r - u + m) / (h.length + 1);
220
+ for (let a = 0; a < h.length; ++a) {
221
+ const k = h[a];
222
+ k.y0 += u * (a + 1), k.y1 += u * (a + 1);
222
223
  }
223
- A(f);
224
+ A(h);
224
225
  }
225
226
  }
226
227
  function S(n) {
227
228
  const y = D(n);
228
- m = Math.min(a, (r - e) / (ct(y, (f) => f.length) - 1)), R(y);
229
- for (let f = 0; f < g; ++f) {
230
- const h = Math.pow(0.99, f), l = Math.max(1 - h, (f + 1) / g);
231
- B(y, h, l), P(y, h, l);
229
+ m = Math.min(f, (r - e) / (at(y, (h) => h.length) - 1)), B(y);
230
+ for (let h = 0; h < g; ++h) {
231
+ const u = Math.pow(0.99, h), a = Math.max(1 - u, (h + 1) / g);
232
+ j(y, u, a), P(y, u, a);
232
233
  }
233
234
  }
234
- function P(n, y, f) {
235
- for (let h = 1, l = n.length; h < l; ++h) {
236
- const k = n[h];
235
+ function P(n, y, h) {
236
+ for (let u = 1, a = n.length; u < a; ++u) {
237
+ const k = n[u];
237
238
  for (const b of k) {
238
- let L = 0, F = 0;
239
- for (const { source: Y, value: et } of b.targetLinks) {
240
- let q = et * (b.layer - Y.layer);
241
- L += $(Y, b) * q, F += q;
239
+ let L = 0, R = 0;
240
+ for (const { source: U, value: Z } of b.targetLinks) {
241
+ let W = Z * (b.layer - U.layer);
242
+ L += $(U, b) * W, R += W;
242
243
  }
243
- if (!(F > 0)) continue;
244
- let G = (L / F - b.y0) * y;
245
- b.y0 += G, b.y1 += G, E(b);
244
+ if (!(R > 0)) continue;
245
+ let V = (L / R - b.y0) * y;
246
+ b.y0 += V, b.y1 += V, E(b);
246
247
  }
247
- c === void 0 && k.sort(Q), O(k, f);
248
+ l === void 0 && k.sort(q), O(k, h);
248
249
  }
249
250
  }
250
- function B(n, y, f) {
251
- for (let h = n.length, l = h - 2; l >= 0; --l) {
252
- const k = n[l];
251
+ function j(n, y, h) {
252
+ for (let u = n.length, a = u - 2; a >= 0; --a) {
253
+ const k = n[a];
253
254
  for (const b of k) {
254
- let L = 0, F = 0;
255
- for (const { target: Y, value: et } of b.sourceLinks) {
256
- let q = et * (Y.layer - b.layer);
257
- L += I(b, Y) * q, F += q;
255
+ let L = 0, R = 0;
256
+ for (const { target: U, value: Z } of b.sourceLinks) {
257
+ let W = Z * (U.layer - b.layer);
258
+ L += I(b, U) * W, R += W;
258
259
  }
259
- if (!(F > 0)) continue;
260
- let G = (L / F - b.y0) * y;
261
- b.y0 += G, b.y1 += G, E(b);
260
+ if (!(R > 0)) continue;
261
+ let V = (L / R - b.y0) * y;
262
+ b.y0 += V, b.y1 += V, E(b);
262
263
  }
263
- c === void 0 && k.sort(Q), O(k, f);
264
+ l === void 0 && k.sort(q), O(k, h);
264
265
  }
265
266
  }
266
267
  function O(n, y) {
267
- const f = n.length >> 1, h = n[f];
268
- d(n, h.y0 - m, f - 1, y), z(n, h.y1 + m, f + 1, y), d(n, r, n.length - 1, y), z(n, e, 0, y);
268
+ const h = n.length >> 1, u = n[h];
269
+ d(n, u.y0 - m, h - 1, y), z(n, u.y1 + m, h + 1, y), d(n, r, n.length - 1, y), z(n, e, 0, y);
269
270
  }
270
- function z(n, y, f, h) {
271
- for (; f < n.length; ++f) {
272
- const l = n[f], k = (y - l.y0) * h;
273
- k > 1e-6 && (l.y0 += k, l.y1 += k), y = l.y1 + m;
271
+ function z(n, y, h, u) {
272
+ for (; h < n.length; ++h) {
273
+ const a = n[h], k = (y - a.y0) * u;
274
+ k > 1e-6 && (a.y0 += k, a.y1 += k), y = a.y1 + m;
274
275
  }
275
276
  }
276
- function d(n, y, f, h) {
277
- for (; f >= 0; --f) {
278
- const l = n[f], k = (l.y1 - y) * h;
279
- k > 1e-6 && (l.y0 -= k, l.y1 -= k), y = l.y0 - m;
277
+ function d(n, y, h, u) {
278
+ for (; h >= 0; --h) {
279
+ const a = n[h], k = (a.y1 - y) * u;
280
+ k > 1e-6 && (a.y0 -= k, a.y1 -= k), y = a.y0 - m;
280
281
  }
281
282
  }
282
283
  function E({ sourceLinks: n, targetLinks: y }) {
283
- if (u === void 0) {
284
- for (const { source: { sourceLinks: f } } of y)
285
- f.sort(ht);
286
- for (const { target: { targetLinks: f } } of n)
287
- f.sort(ut);
284
+ if (c === void 0) {
285
+ for (const { source: { sourceLinks: h } } of y)
286
+ h.sort(ct);
287
+ for (const { target: { targetLinks: h } } of n)
288
+ h.sort(lt);
288
289
  }
289
290
  }
290
291
  function A(n) {
291
- if (u === void 0)
292
- for (const { sourceLinks: y, targetLinks: f } of n)
293
- y.sort(ht), f.sort(ut);
292
+ if (c === void 0)
293
+ for (const { sourceLinks: y, targetLinks: h } of n)
294
+ y.sort(ct), h.sort(lt);
294
295
  }
295
296
  function $(n, y) {
296
- let f = n.y0 - (n.sourceLinks.length - 1) * m / 2;
297
- for (const { target: h, width: l } of n.sourceLinks) {
298
- if (h === y) break;
299
- f += l + m;
297
+ let h = n.y0 - (n.sourceLinks.length - 1) * m / 2;
298
+ for (const { target: u, width: a } of n.sourceLinks) {
299
+ if (u === y) break;
300
+ h += a + m;
300
301
  }
301
- for (const { source: h, width: l } of y.targetLinks) {
302
- if (h === n) break;
303
- f -= l;
302
+ for (const { source: u, width: a } of y.targetLinks) {
303
+ if (u === n) break;
304
+ h -= a;
304
305
  }
305
- return f;
306
+ return h;
306
307
  }
307
308
  function I(n, y) {
308
- let f = y.y0 - (y.targetLinks.length - 1) * m / 2;
309
- for (const { source: h, width: l } of y.targetLinks) {
310
- if (h === n) break;
311
- f += l + m;
309
+ let h = y.y0 - (y.targetLinks.length - 1) * m / 2;
310
+ for (const { source: u, width: a } of y.targetLinks) {
311
+ if (u === n) break;
312
+ h += a + m;
312
313
  }
313
- for (const { target: h, width: l } of n.sourceLinks) {
314
- if (h === y) break;
315
- f -= l;
314
+ for (const { target: u, width: a } of n.sourceLinks) {
315
+ if (u === y) break;
316
+ h -= a;
316
317
  }
317
- return f;
318
+ return h;
318
319
  }
319
320
  return w;
320
321
  }
321
- var rt = Math.PI, st = 2 * rt, V = 1e-6, Wt = st - V;
322
- function ot() {
322
+ var et = Math.PI, nt = 2 * et, F = 1e-6, Ft = nt - F;
323
+ function it() {
323
324
  this._x0 = this._y0 = // start of current subpath
324
325
  this._x1 = this._y1 = null, this._ = "";
325
326
  }
326
- function _t() {
327
- return new ot();
327
+ function mt() {
328
+ return new it();
328
329
  }
329
- ot.prototype = _t.prototype = {
330
- constructor: ot,
330
+ it.prototype = mt.prototype = {
331
+ constructor: it,
331
332
  moveTo: function(t, e) {
332
333
  this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +e);
333
334
  },
@@ -340,27 +341,27 @@ ot.prototype = _t.prototype = {
340
341
  quadraticCurveTo: function(t, e, o, r) {
341
342
  this._ += "Q" + +t + "," + +e + "," + (this._x1 = +o) + "," + (this._y1 = +r);
342
343
  },
343
- bezierCurveTo: function(t, e, o, r, i, a) {
344
- this._ += "C" + +t + "," + +e + "," + +o + "," + +r + "," + (this._x1 = +i) + "," + (this._y1 = +a);
344
+ bezierCurveTo: function(t, e, o, r, i, f) {
345
+ this._ += "C" + +t + "," + +e + "," + +o + "," + +r + "," + (this._x1 = +i) + "," + (this._y1 = +f);
345
346
  },
346
347
  arcTo: function(t, e, o, r, i) {
347
348
  t = +t, e = +e, o = +o, r = +r, i = +i;
348
- var a = this._x1, m = this._y1, _ = o - t, s = r - e, c = a - t, u = m - e, x = c * c + u * u;
349
+ var f = this._x1, m = this._y1, _ = o - t, s = r - e, l = f - t, c = m - e, x = l * l + c * c;
349
350
  if (i < 0) throw new Error("negative radius: " + i);
350
351
  if (this._x1 === null)
351
352
  this._ += "M" + (this._x1 = t) + "," + (this._y1 = e);
352
- else if (x > V) if (!(Math.abs(u * _ - s * c) > V) || !i)
353
+ else if (x > F) if (!(Math.abs(c * _ - s * l) > F) || !i)
353
354
  this._ += "L" + (this._x1 = t) + "," + (this._y1 = e);
354
355
  else {
355
- var v = o - a, g = r - m, w = _ * _ + s * s, M = v * v + g * g, T = Math.sqrt(w), N = Math.sqrt(x), C = i * Math.tan((rt - Math.acos((w + x - M) / (2 * T * N))) / 2), D = C / N, R = C / T;
356
- Math.abs(D - 1) > V && (this._ += "L" + (t + D * c) + "," + (e + D * u)), this._ += "A" + i + "," + i + ",0,0," + +(u * v > c * g) + "," + (this._x1 = t + R * _) + "," + (this._y1 = e + R * s);
356
+ var v = o - f, g = r - m, w = _ * _ + s * s, M = v * v + g * g, T = Math.sqrt(w), N = Math.sqrt(x), C = i * Math.tan((et - Math.acos((w + x - M) / (2 * T * N))) / 2), D = C / N, B = C / T;
357
+ Math.abs(D - 1) > F && (this._ += "L" + (t + D * l) + "," + (e + D * c)), this._ += "A" + i + "," + i + ",0,0," + +(c * v > l * g) + "," + (this._x1 = t + B * _) + "," + (this._y1 = e + B * s);
357
358
  }
358
359
  },
359
- arc: function(t, e, o, r, i, a) {
360
- t = +t, e = +e, o = +o, a = !!a;
361
- var m = o * Math.cos(r), _ = o * Math.sin(r), s = t + m, c = e + _, u = 1 ^ a, x = a ? r - i : i - r;
360
+ arc: function(t, e, o, r, i, f) {
361
+ t = +t, e = +e, o = +o, f = !!f;
362
+ var m = o * Math.cos(r), _ = o * Math.sin(r), s = t + m, l = e + _, c = 1 ^ f, x = f ? r - i : i - r;
362
363
  if (o < 0) throw new Error("negative radius: " + o);
363
- this._x1 === null ? this._ += "M" + s + "," + c : (Math.abs(this._x1 - s) > V || Math.abs(this._y1 - c) > V) && (this._ += "L" + s + "," + c), o && (x < 0 && (x = x % st + st), x > Wt ? this._ += "A" + o + "," + o + ",0,1," + u + "," + (t - m) + "," + (e - _) + "A" + o + "," + o + ",0,1," + u + "," + (this._x1 = s) + "," + (this._y1 = c) : x > V && (this._ += "A" + o + "," + o + ",0," + +(x >= rt) + "," + u + "," + (this._x1 = t + o * Math.cos(i)) + "," + (this._y1 = e + o * Math.sin(i))));
364
+ this._x1 === null ? this._ += "M" + s + "," + l : (Math.abs(this._x1 - s) > F || Math.abs(this._y1 - l) > F) && (this._ += "L" + s + "," + l), o && (x < 0 && (x = x % nt + nt), x > Ft ? this._ += "A" + o + "," + o + ",0,1," + c + "," + (t - m) + "," + (e - _) + "A" + o + "," + o + ",0,1," + c + "," + (this._x1 = s) + "," + (this._y1 = l) : x > F && (this._ += "A" + o + "," + o + ",0," + +(x >= et) + "," + c + "," + (this._x1 = t + o * Math.cos(i)) + "," + (this._y1 = e + o * Math.sin(i))));
364
365
  },
365
366
  rect: function(t, e, o, r) {
366
367
  this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +e) + "h" + +o + "v" + +r + "h" + -o + "Z";
@@ -369,61 +370,61 @@ ot.prototype = _t.prototype = {
369
370
  return this._;
370
371
  }
371
372
  };
372
- function gt(t) {
373
+ function ft(t) {
373
374
  return function() {
374
375
  return t;
375
376
  };
376
377
  }
377
- function Ut(t) {
378
+ function Vt(t) {
378
379
  return t[0];
379
380
  }
380
- function Gt(t) {
381
+ function Ut(t) {
381
382
  return t[1];
382
383
  }
383
- var Yt = Array.prototype.slice;
384
- function qt(t) {
384
+ var Wt = Array.prototype.slice;
385
+ function Gt(t) {
385
386
  return t.source;
386
387
  }
387
- function Ht(t) {
388
+ function Yt(t) {
388
389
  return t.target;
389
390
  }
390
- function Xt(t) {
391
- var e = qt, o = Ht, r = Ut, i = Gt, a = null;
391
+ function qt(t) {
392
+ var e = Gt, o = Yt, r = Vt, i = Ut, f = null;
392
393
  function m() {
393
- var _, s = Yt.call(arguments), c = e.apply(this, s), u = o.apply(this, s);
394
- if (a || (a = _ = _t()), t(a, +r.apply(this, (s[0] = c, s)), +i.apply(this, s), +r.apply(this, (s[0] = u, s)), +i.apply(this, s)), _) return a = null, _ + "" || null;
394
+ var _, s = Wt.call(arguments), l = e.apply(this, s), c = o.apply(this, s);
395
+ if (f || (f = _ = mt()), t(f, +r.apply(this, (s[0] = l, s)), +i.apply(this, s), +r.apply(this, (s[0] = c, s)), +i.apply(this, s)), _) return f = null, _ + "" || null;
395
396
  }
396
397
  return m.source = function(_) {
397
398
  return arguments.length ? (e = _, m) : e;
398
399
  }, m.target = function(_) {
399
400
  return arguments.length ? (o = _, m) : o;
400
401
  }, m.x = function(_) {
401
- return arguments.length ? (r = typeof _ == "function" ? _ : gt(+_), m) : r;
402
+ return arguments.length ? (r = typeof _ == "function" ? _ : ft(+_), m) : r;
402
403
  }, m.y = function(_) {
403
- return arguments.length ? (i = typeof _ == "function" ? _ : gt(+_), m) : i;
404
+ return arguments.length ? (i = typeof _ == "function" ? _ : ft(+_), m) : i;
404
405
  }, m.context = function(_) {
405
- return arguments.length ? (a = _ ?? null, m) : a;
406
+ return arguments.length ? (f = _ ?? null, m) : f;
406
407
  }, m;
407
408
  }
408
- function Qt(t, e, o, r, i) {
409
+ function Ht(t, e, o, r, i) {
409
410
  t.moveTo(e, o), t.bezierCurveTo(e = (e + r) / 2, o, e, i, r, i);
410
411
  }
411
- function Kt() {
412
- return Xt(Qt);
412
+ function Xt() {
413
+ return qt(Ht);
413
414
  }
414
- function Zt(t) {
415
+ function Qt(t) {
415
416
  return [t.source.x1, t.y0];
416
417
  }
417
- function Jt(t) {
418
+ function Kt(t) {
418
419
  return [t.target.x0, t.y1];
419
420
  }
420
- function te() {
421
- return Kt().source(Zt).target(Jt);
421
+ function Zt() {
422
+ return Xt().source(Qt).target(Kt);
422
423
  }
423
- var at = function() {
424
- var t = /* @__PURE__ */ p(function(_, s, c, u) {
425
- for (c = c || {}, u = _.length; u--; c[_[u]] = s) ;
426
- return c;
424
+ var rt = function() {
425
+ var t = /* @__PURE__ */ p(function(_, s, l, c) {
426
+ for (l = l || {}, c = _.length; c--; l[_[c]] = s) ;
427
+ return l;
427
428
  }, "o"), e = [1, 9], o = [1, 10], r = [1, 5, 10, 12], i = {
428
429
  trace: /* @__PURE__ */ p(function() {
429
430
  }, "trace"),
@@ -431,7 +432,7 @@ var at = function() {
431
432
  symbols_: { error: 2, start: 3, SANKEY: 4, NEWLINE: 5, csv: 6, opt_eof: 7, record: 8, csv_tail: 9, EOF: 10, "field[source]": 11, COMMA: 12, "field[target]": 13, "field[value]": 14, field: 15, escaped: 16, non_escaped: 17, DQUOTE: 18, ESCAPED_TEXT: 19, NON_ESCAPED_TEXT: 20, $accept: 0, $end: 1 },
432
433
  terminals_: { 2: "error", 4: "SANKEY", 5: "NEWLINE", 10: "EOF", 11: "field[source]", 12: "COMMA", 13: "field[target]", 14: "field[value]", 18: "DQUOTE", 19: "ESCAPED_TEXT", 20: "NON_ESCAPED_TEXT" },
433
434
  productions_: [0, [3, 4], [6, 2], [9, 2], [9, 0], [7, 1], [7, 0], [8, 5], [15, 1], [15, 1], [16, 3], [17, 1]],
434
- performAction: /* @__PURE__ */ p(function(s, c, u, x, v, g, w) {
435
+ performAction: /* @__PURE__ */ p(function(s, l, c, x, v, g, w) {
435
436
  var M = g.length - 1;
436
437
  switch (v) {
437
438
  case 7:
@@ -450,38 +451,38 @@ var at = function() {
450
451
  }, "anonymous"),
451
452
  table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, { 5: [1, 3] }, { 6: 4, 8: 5, 15: 6, 16: 7, 17: 8, 18: e, 20: o }, { 1: [2, 6], 7: 11, 10: [1, 12] }, t(o, [2, 4], { 9: 13, 5: [1, 14] }), { 12: [1, 15] }, t(r, [2, 8]), t(r, [2, 9]), { 19: [1, 16] }, t(r, [2, 11]), { 1: [2, 1] }, { 1: [2, 5] }, t(o, [2, 2]), { 6: 17, 8: 5, 15: 6, 16: 7, 17: 8, 18: e, 20: o }, { 15: 18, 16: 7, 17: 8, 18: e, 20: o }, { 18: [1, 19] }, t(o, [2, 3]), { 12: [1, 20] }, t(r, [2, 10]), { 15: 21, 16: 7, 17: 8, 18: e, 20: o }, t([1, 5, 10], [2, 7])],
452
453
  defaultActions: { 11: [2, 1], 12: [2, 5] },
453
- parseError: /* @__PURE__ */ p(function(s, c) {
454
- if (c.recoverable)
454
+ parseError: /* @__PURE__ */ p(function(s, l) {
455
+ if (l.recoverable)
455
456
  this.trace(s);
456
457
  else {
457
- var u = new Error(s);
458
- throw u.hash = c, u;
458
+ var c = new Error(s);
459
+ throw c.hash = l, c;
459
460
  }
460
461
  }, "parseError"),
461
462
  parse: /* @__PURE__ */ p(function(s) {
462
- var c = this, u = [0], x = [], v = [null], g = [], w = this.table, M = "", T = 0, N = 0, C = 2, D = 1, R = g.slice.call(arguments, 1), S = Object.create(this.lexer), P = { yy: {} };
463
- for (var B in this.yy)
464
- Object.prototype.hasOwnProperty.call(this.yy, B) && (P.yy[B] = this.yy[B]);
463
+ var l = this, c = [0], x = [], v = [null], g = [], w = this.table, M = "", T = 0, N = 0, C = 2, D = 1, B = g.slice.call(arguments, 1), S = Object.create(this.lexer), P = { yy: {} };
464
+ for (var j in this.yy)
465
+ Object.prototype.hasOwnProperty.call(this.yy, j) && (P.yy[j] = this.yy[j]);
465
466
  S.setInput(s, P.yy), P.yy.lexer = S, P.yy.parser = this, typeof S.yylloc > "u" && (S.yylloc = {});
466
467
  var O = S.yylloc;
467
468
  g.push(O);
468
469
  var z = S.options && S.options.ranges;
469
470
  typeof P.yy.parseError == "function" ? this.parseError = P.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
470
471
  function d(L) {
471
- u.length = u.length - 2 * L, v.length = v.length - L, g.length = g.length - L;
472
+ c.length = c.length - 2 * L, v.length = v.length - L, g.length = g.length - L;
472
473
  }
473
474
  p(d, "popStack");
474
475
  function E() {
475
476
  var L;
476
- return L = x.pop() || S.lex() || D, typeof L != "number" && (L instanceof Array && (x = L, L = x.pop()), L = c.symbols_[L] || L), L;
477
+ return L = x.pop() || S.lex() || D, typeof L != "number" && (L instanceof Array && (x = L, L = x.pop()), L = l.symbols_[L] || L), L;
477
478
  }
478
479
  p(E, "lex");
479
- for (var A, $, I, n, y = {}, f, h, l, k; ; ) {
480
- if ($ = u[u.length - 1], this.defaultActions[$] ? I = this.defaultActions[$] : ((A === null || typeof A > "u") && (A = E()), I = w[$] && w[$][A]), typeof I > "u" || !I.length || !I[0]) {
480
+ for (var A, $, I, n, y = {}, h, u, a, k; ; ) {
481
+ if ($ = c[c.length - 1], this.defaultActions[$] ? I = this.defaultActions[$] : ((A === null || typeof A > "u") && (A = E()), I = w[$] && w[$][A]), typeof I > "u" || !I.length || !I[0]) {
481
482
  var b = "";
482
483
  k = [];
483
- for (f in w[$])
484
- this.terminals_[f] && f > C && k.push("'" + this.terminals_[f] + "'");
484
+ for (h in w[$])
485
+ this.terminals_[h] && h > C && k.push("'" + this.terminals_[h] + "'");
485
486
  S.showPosition ? b = "Parse error on line " + (T + 1) + `:
486
487
  ` + S.showPosition() + `
487
488
  Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "Parse error on line " + (T + 1) + ": Unexpected " + (A == D ? "end of input" : "'" + (this.terminals_[A] || A) + "'"), this.parseError(b, {
@@ -496,16 +497,16 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
496
497
  throw new Error("Parse Error: multiple actions possible at state: " + $ + ", token: " + A);
497
498
  switch (I[0]) {
498
499
  case 1:
499
- u.push(A), v.push(S.yytext), g.push(S.yylloc), u.push(I[1]), A = null, N = S.yyleng, M = S.yytext, T = S.yylineno, O = S.yylloc;
500
+ c.push(A), v.push(S.yytext), g.push(S.yylloc), c.push(I[1]), A = null, N = S.yyleng, M = S.yytext, T = S.yylineno, O = S.yylloc;
500
501
  break;
501
502
  case 2:
502
- if (h = this.productions_[I[1]][1], y.$ = v[v.length - h], y._$ = {
503
- first_line: g[g.length - (h || 1)].first_line,
503
+ if (u = this.productions_[I[1]][1], y.$ = v[v.length - u], y._$ = {
504
+ first_line: g[g.length - (u || 1)].first_line,
504
505
  last_line: g[g.length - 1].last_line,
505
- first_column: g[g.length - (h || 1)].first_column,
506
+ first_column: g[g.length - (u || 1)].first_column,
506
507
  last_column: g[g.length - 1].last_column
507
508
  }, z && (y._$.range = [
508
- g[g.length - (h || 1)].range[0],
509
+ g[g.length - (u || 1)].range[0],
509
510
  g[g.length - 1].range[1]
510
511
  ]), n = this.performAction.apply(y, [
511
512
  M,
@@ -515,28 +516,28 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
515
516
  I[1],
516
517
  v,
517
518
  g
518
- ].concat(R)), typeof n < "u")
519
+ ].concat(B)), typeof n < "u")
519
520
  return n;
520
- h && (u = u.slice(0, -1 * h * 2), v = v.slice(0, -1 * h), g = g.slice(0, -1 * h)), u.push(this.productions_[I[1]][0]), v.push(y.$), g.push(y._$), l = w[u[u.length - 2]][u[u.length - 1]], u.push(l);
521
+ u && (c = c.slice(0, -1 * u * 2), v = v.slice(0, -1 * u), g = g.slice(0, -1 * u)), c.push(this.productions_[I[1]][0]), v.push(y.$), g.push(y._$), a = w[c[c.length - 2]][c[c.length - 1]], c.push(a);
521
522
  break;
522
523
  case 3:
523
- return !0;
524
+ return true;
524
525
  }
525
526
  }
526
- return !0;
527
+ return true;
527
528
  }, "parse")
528
- }, a = /* @__PURE__ */ function() {
529
+ }, f = /* @__PURE__ */ function() {
529
530
  var _ = {
530
531
  EOF: 1,
531
- parseError: /* @__PURE__ */ p(function(c, u) {
532
+ parseError: /* @__PURE__ */ p(function(l, c) {
532
533
  if (this.yy.parser)
533
- this.yy.parser.parseError(c, u);
534
+ this.yy.parser.parseError(l, c);
534
535
  else
535
- throw new Error(c);
536
+ throw new Error(l);
536
537
  }, "parseError"),
537
538
  // resets the lexer, sets new input
538
- setInput: /* @__PURE__ */ p(function(s, c) {
539
- return this.yy = c || this.yy || {}, this._input = s, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
539
+ setInput: /* @__PURE__ */ p(function(s, l) {
540
+ return this.yy = l || this.yy || {}, this._input = s, this._more = this._backtrack = this.done = false, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
540
541
  first_line: 1,
541
542
  first_column: 0,
542
543
  last_line: 1,
@@ -547,31 +548,31 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
547
548
  input: /* @__PURE__ */ p(function() {
548
549
  var s = this._input[0];
549
550
  this.yytext += s, this.yyleng++, this.offset++, this.match += s, this.matched += s;
550
- var c = s.match(/(?:\r\n?|\n).*/g);
551
- return c ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), s;
551
+ var l = s.match(/(?:\r\n?|\n).*/g);
552
+ return l ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), s;
552
553
  }, "input"),
553
554
  // unshifts one char (or a string) into the input
554
555
  unput: /* @__PURE__ */ p(function(s) {
555
- var c = s.length, u = s.split(/(?:\r\n?|\n)/g);
556
- this._input = s + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - c), this.offset -= c;
556
+ var l = s.length, c = s.split(/(?:\r\n?|\n)/g);
557
+ this._input = s + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - l), this.offset -= l;
557
558
  var x = this.match.split(/(?:\r\n?|\n)/g);
558
- this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), u.length - 1 && (this.yylineno -= u.length - 1);
559
+ this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), c.length - 1 && (this.yylineno -= c.length - 1);
559
560
  var v = this.yylloc.range;
560
561
  return this.yylloc = {
561
562
  first_line: this.yylloc.first_line,
562
563
  last_line: this.yylineno + 1,
563
564
  first_column: this.yylloc.first_column,
564
- last_column: u ? (u.length === x.length ? this.yylloc.first_column : 0) + x[x.length - u.length].length - u[0].length : this.yylloc.first_column - c
565
- }, this.options.ranges && (this.yylloc.range = [v[0], v[0] + this.yyleng - c]), this.yyleng = this.yytext.length, this;
565
+ last_column: c ? (c.length === x.length ? this.yylloc.first_column : 0) + x[x.length - c.length].length - c[0].length : this.yylloc.first_column - l
566
+ }, this.options.ranges && (this.yylloc.range = [v[0], v[0] + this.yyleng - l]), this.yyleng = this.yytext.length, this;
566
567
  }, "unput"),
567
568
  // When called from action, caches matched text and appends it on next action
568
569
  more: /* @__PURE__ */ p(function() {
569
- return this._more = !0, this;
570
+ return this._more = true, this;
570
571
  }, "more"),
571
572
  // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
572
573
  reject: /* @__PURE__ */ p(function() {
573
574
  if (this.options.backtrack_lexer)
574
- this._backtrack = !0;
575
+ this._backtrack = true;
575
576
  else
576
577
  return this.parseError("Lexical error on line " + (this.yylineno + 1) + `. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).
577
578
  ` + this.showPosition(), {
@@ -597,13 +598,13 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
597
598
  }, "upcomingInput"),
598
599
  // displays the character position where the lexing error occurred, i.e. for error messages
599
600
  showPosition: /* @__PURE__ */ p(function() {
600
- var s = this.pastInput(), c = new Array(s.length + 1).join("-");
601
+ var s = this.pastInput(), l = new Array(s.length + 1).join("-");
601
602
  return s + this.upcomingInput() + `
602
- ` + c + "^";
603
+ ` + l + "^";
603
604
  }, "showPosition"),
604
605
  // test the lexed token: return FALSE when not a match, otherwise return token
605
- test_match: /* @__PURE__ */ p(function(s, c) {
606
- var u, x, v;
606
+ test_match: /* @__PURE__ */ p(function(s, l) {
607
+ var c, x, v;
607
608
  if (this.options.backtrack_lexer && (v = {
608
609
  yylineno: this.yylineno,
609
610
  yylloc: {
@@ -628,36 +629,36 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
628
629
  last_line: this.yylineno + 1,
629
630
  first_column: this.yylloc.last_column,
630
631
  last_column: x ? x[x.length - 1].length - x[x.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + s[0].length
631
- }, this.yytext += s[0], this.match += s[0], this.matches = s, 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(s[0].length), this.matched += s[0], u = this.performAction.call(this, this.yy, this, c, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), u)
632
- return u;
632
+ }, this.yytext += s[0], this.match += s[0], this.matches = s, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = false, this._backtrack = false, this._input = this._input.slice(s[0].length), this.matched += s[0], c = this.performAction.call(this, this.yy, this, l, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = false), c)
633
+ return c;
633
634
  if (this._backtrack) {
634
635
  for (var g in v)
635
636
  this[g] = v[g];
636
- return !1;
637
+ return false;
637
638
  }
638
- return !1;
639
+ return false;
639
640
  }, "test_match"),
640
641
  // return next match in input
641
642
  next: /* @__PURE__ */ p(function() {
642
643
  if (this.done)
643
644
  return this.EOF;
644
- this._input || (this.done = !0);
645
- var s, c, u, x;
645
+ this._input || (this.done = true);
646
+ var s, l, c, x;
646
647
  this._more || (this.yytext = "", this.match = "");
647
648
  for (var v = this._currentRules(), g = 0; g < v.length; g++)
648
- if (u = this._input.match(this.rules[v[g]]), u && (!c || u[0].length > c[0].length)) {
649
- if (c = u, x = g, this.options.backtrack_lexer) {
650
- if (s = this.test_match(u, v[g]), s !== !1)
649
+ if (c = this._input.match(this.rules[v[g]]), c && (!l || c[0].length > l[0].length)) {
650
+ if (l = c, x = g, this.options.backtrack_lexer) {
651
+ if (s = this.test_match(c, v[g]), s !== false)
651
652
  return s;
652
653
  if (this._backtrack) {
653
- c = !1;
654
+ l = false;
654
655
  continue;
655
656
  } else
656
- return !1;
657
+ return false;
657
658
  } else if (!this.options.flex)
658
659
  break;
659
660
  }
660
- return c ? (s = this.test_match(c, v[x]), s !== !1 ? s : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
661
+ return l ? (s = this.test_match(l, v[x]), s !== false ? s : false) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
661
662
  ` + this.showPosition(), {
662
663
  text: "",
663
664
  token: null,
@@ -666,36 +667,36 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
666
667
  }, "next"),
667
668
  // return next match that has a token
668
669
  lex: /* @__PURE__ */ p(function() {
669
- var c = this.next();
670
- return c || this.lex();
670
+ var l = this.next();
671
+ return l || this.lex();
671
672
  }, "lex"),
672
673
  // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
673
- begin: /* @__PURE__ */ p(function(c) {
674
- this.conditionStack.push(c);
674
+ begin: /* @__PURE__ */ p(function(l) {
675
+ this.conditionStack.push(l);
675
676
  }, "begin"),
676
677
  // pop the previously active lexer condition state off the condition stack
677
678
  popState: /* @__PURE__ */ p(function() {
678
- var c = this.conditionStack.length - 1;
679
- return c > 0 ? this.conditionStack.pop() : this.conditionStack[0];
679
+ var l = this.conditionStack.length - 1;
680
+ return l > 0 ? this.conditionStack.pop() : this.conditionStack[0];
680
681
  }, "popState"),
681
682
  // produce the lexer rule set which is active for the currently active lexer condition state
682
683
  _currentRules: /* @__PURE__ */ p(function() {
683
684
  return this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1] ? this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules : this.conditions.INITIAL.rules;
684
685
  }, "_currentRules"),
685
686
  // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
686
- topState: /* @__PURE__ */ p(function(c) {
687
- return c = this.conditionStack.length - 1 - Math.abs(c || 0), c >= 0 ? this.conditionStack[c] : "INITIAL";
687
+ topState: /* @__PURE__ */ p(function(l) {
688
+ return l = this.conditionStack.length - 1 - Math.abs(l || 0), l >= 0 ? this.conditionStack[l] : "INITIAL";
688
689
  }, "topState"),
689
690
  // alias for begin(condition)
690
- pushState: /* @__PURE__ */ p(function(c) {
691
- this.begin(c);
691
+ pushState: /* @__PURE__ */ p(function(l) {
692
+ this.begin(l);
692
693
  }, "pushState"),
693
694
  // return the number of states currently on the stack
694
695
  stateStackSize: /* @__PURE__ */ p(function() {
695
696
  return this.conditionStack.length;
696
697
  }, "stateStackSize"),
697
- options: { "case-insensitive": !0 },
698
- performAction: /* @__PURE__ */ p(function(c, u, x, v) {
698
+ options: { "case-insensitive": true },
699
+ performAction: /* @__PURE__ */ p(function(l, c, x, v) {
699
700
  switch (x) {
700
701
  case 0:
701
702
  return this.pushState("csv"), 4;
@@ -716,58 +717,58 @@ Expecting ` + k.join(", ") + ", got '" + (this.terminals_[A] || A) + "'" : b = "
716
717
  }
717
718
  }, "anonymous"),
718
719
  rules: [/^(?:sankey-beta\b)/i, /^(?:$)/i, /^(?:((\u000D\u000A)|(\u000A)))/i, /^(?:(\u002C))/i, /^(?:(\u0022))/i, /^(?:([\u0020-\u0021\u0023-\u002B\u002D-\u007E])*)/i, /^(?:(\u0022)(?!(\u0022)))/i, /^(?:(([\u0020-\u0021\u0023-\u002B\u002D-\u007E])|(\u002C)|(\u000D)|(\u000A)|(\u0022)(\u0022))*)/i],
719
- conditions: { csv: { rules: [1, 2, 3, 4, 5, 6, 7], inclusive: !1 }, escaped_text: { rules: [6, 7], inclusive: !1 }, INITIAL: { rules: [0, 1, 2, 3, 4, 5, 6, 7], inclusive: !0 } }
720
+ conditions: { csv: { rules: [1, 2, 3, 4, 5, 6, 7], inclusive: false }, escaped_text: { rules: [6, 7], inclusive: false }, INITIAL: { rules: [0, 1, 2, 3, 4, 5, 6, 7], inclusive: true } }
720
721
  };
721
722
  return _;
722
723
  }();
723
- i.lexer = a;
724
+ i.lexer = f;
724
725
  function m() {
725
726
  this.yy = {};
726
727
  }
727
728
  return p(m, "Parser"), m.prototype = i, i.Parser = m, new m();
728
729
  }();
729
- at.parser = at;
730
- var K = at, J = [], tt = [], Z = /* @__PURE__ */ new Map(), ee = /* @__PURE__ */ p(() => {
731
- J = [], tt = [], Z = /* @__PURE__ */ new Map(), Tt();
732
- }, "clear"), W, ne = (W = class {
733
- constructor(e, o, r = 0) {
734
- this.source = e, this.target = o, this.value = r;
730
+ rt.parser = rt;
731
+ var H = rt, Q = [], K = [], X = /* @__PURE__ */ new Map(), Jt = /* @__PURE__ */ p(() => {
732
+ Q = [], K = [], X = /* @__PURE__ */ new Map(), Et();
733
+ }, "clear"), te = (_a = class {
734
+ constructor(t, e, o = 0) {
735
+ this.source = t, this.target = e, this.value = o;
735
736
  }
736
- }, p(W, "SankeyLink"), W), ie = /* @__PURE__ */ p((t, e, o) => {
737
- J.push(new ne(t, e, o));
738
- }, "addLink"), U, re = (U = class {
739
- constructor(e) {
740
- this.ID = e;
737
+ }, p(_a, "SankeyLink"), _a), ee = /* @__PURE__ */ p((t, e, o) => {
738
+ Q.push(new te(t, e, o));
739
+ }, "addLink"), ne = (_b = class {
740
+ constructor(t) {
741
+ this.ID = t;
741
742
  }
742
- }, p(U, "SankeyNode"), U), se = /* @__PURE__ */ p((t) => {
743
- t = Mt.sanitizeText(t, lt());
744
- let e = Z.get(t);
745
- return e === void 0 && (e = new re(t), Z.set(t, e), tt.push(e)), e;
746
- }, "findOrCreateNode"), oe = /* @__PURE__ */ p(() => tt, "getNodes"), ae = /* @__PURE__ */ p(() => J, "getLinks"), le = /* @__PURE__ */ p(() => ({
747
- nodes: tt.map((t) => ({ id: t.ID })),
748
- links: J.map((t) => ({
743
+ }, p(_b, "SankeyNode"), _b), ie = /* @__PURE__ */ p((t) => {
744
+ t = At.sanitizeText(t, ot());
745
+ let e = X.get(t);
746
+ return e === void 0 && (e = new ne(t), X.set(t, e), K.push(e)), e;
747
+ }, "findOrCreateNode"), re = /* @__PURE__ */ p(() => K, "getNodes"), se = /* @__PURE__ */ p(() => Q, "getLinks"), oe = /* @__PURE__ */ p(() => ({
748
+ nodes: K.map((t) => ({ id: t.ID })),
749
+ links: Q.map((t) => ({
749
750
  source: t.source.ID,
750
751
  target: t.target.ID,
751
752
  value: t.value
752
753
  }))
753
- }), "getGraph"), ce = {
754
- nodesMap: Z,
755
- getConfig: /* @__PURE__ */ p(() => lt().sankey, "getConfig"),
756
- getNodes: oe,
757
- getLinks: ae,
758
- getGraph: le,
759
- addLink: ie,
760
- findOrCreateNode: se,
761
- getAccTitle: Lt,
762
- setAccTitle: St,
763
- getAccDescription: bt,
764
- setAccDescription: wt,
765
- getDiagramTitle: vt,
766
- setDiagramTitle: xt,
767
- clear: ee
768
- }, j, dt = (j = class {
754
+ }), "getGraph"), ae = {
755
+ nodesMap: X,
756
+ getConfig: /* @__PURE__ */ p(() => ot().sankey, "getConfig"),
757
+ getNodes: re,
758
+ getLinks: se,
759
+ getGraph: oe,
760
+ addLink: ee,
761
+ findOrCreateNode: ie,
762
+ getAccTitle: bt,
763
+ setAccTitle: wt,
764
+ getAccDescription: vt,
765
+ setAccDescription: xt,
766
+ getDiagramTitle: _t,
767
+ setDiagramTitle: kt,
768
+ clear: Jt
769
+ }, yt = (_c = class {
769
770
  static next(e) {
770
- return new j(e + ++j.count);
771
+ return new _c(e + ++_c.count);
771
772
  }
772
773
  constructor(e) {
773
774
  this.id = e, this.href = `#${e}`;
@@ -775,30 +776,30 @@ var K = at, J = [], tt = [], Z = /* @__PURE__ */ new Map(), ee = /* @__PURE__ */
775
776
  toString() {
776
777
  return "url(" + this.href + ")";
777
778
  }
778
- }, p(j, "Uid"), j.count = 0, j), ue = {
779
- left: Dt,
780
- right: $t,
781
- center: jt,
782
- justify: kt
783
- }, he = /* @__PURE__ */ p(function(t, e, o, r) {
784
- const { securityLevel: i, sankey: a } = lt(), m = Et.sankey;
779
+ }, p(_c, "Uid"), _c.count = 0, _c), le = {
780
+ left: Ot,
781
+ right: zt,
782
+ center: Dt,
783
+ justify: pt
784
+ }, ce = /* @__PURE__ */ p(function(t, e, o, r) {
785
+ const { securityLevel: i, sankey: f } = ot(), m = St.sankey;
785
786
  let _;
786
- i === "sandbox" && (_ = H("#i" + e));
787
- const s = i === "sandbox" ? H(_.nodes()[0].contentDocument.body) : H("body"), c = i === "sandbox" ? s.select(`[id="${e}"]`) : H(`[id="${e}"]`), u = (a == null ? void 0 : a.width) ?? m.width, x = (a == null ? void 0 : a.height) ?? m.width, v = (a == null ? void 0 : a.useMaxWidth) ?? m.useMaxWidth, g = (a == null ? void 0 : a.nodeAlignment) ?? m.nodeAlignment, w = (a == null ? void 0 : a.prefix) ?? m.prefix, M = (a == null ? void 0 : a.suffix) ?? m.suffix, T = (a == null ? void 0 : a.showValues) ?? m.showValues, N = r.db.getGraph(), C = ue[g];
788
- Vt().nodeId((d) => d.id).nodeWidth(10).nodePadding(10 + (T ? 15 : 0)).nodeAlign(C).extent([
787
+ i === "sandbox" && (_ = G("#i" + e));
788
+ const s = i === "sandbox" ? G(_.nodes()[0].contentDocument.body) : G("body"), l = i === "sandbox" ? s.select(`[id="${e}"]`) : G(`[id="${e}"]`), c = (f == null ? void 0 : f.width) ?? m.width, x = (f == null ? void 0 : f.height) ?? m.width, v = (f == null ? void 0 : f.useMaxWidth) ?? m.useMaxWidth, g = (f == null ? void 0 : f.nodeAlignment) ?? m.nodeAlignment, w = (f == null ? void 0 : f.prefix) ?? m.prefix, M = (f == null ? void 0 : f.suffix) ?? m.suffix, T = (f == null ? void 0 : f.showValues) ?? m.showValues, N = r.db.getGraph(), C = le[g];
789
+ Rt().nodeId((d) => d.id).nodeWidth(10).nodePadding(10 + (T ? 15 : 0)).nodeAlign(C).extent([
789
790
  [0, 0],
790
- [u, x]
791
+ [c, x]
791
792
  ])(N);
792
- const S = Nt(Pt);
793
- c.append("g").attr("class", "nodes").selectAll(".node").data(N.nodes).join("g").attr("class", "node").attr("id", (d) => (d.uid = dt.next("node-")).id).attr("transform", function(d) {
793
+ const S = Tt(Nt);
794
+ l.append("g").attr("class", "nodes").selectAll(".node").data(N.nodes).join("g").attr("class", "node").attr("id", (d) => (d.uid = yt.next("node-")).id).attr("transform", function(d) {
794
795
  return "translate(" + d.x0 + "," + d.y0 + ")";
795
796
  }).attr("x", (d) => d.x0).attr("y", (d) => d.y0).append("rect").attr("height", (d) => d.y1 - d.y0).attr("width", (d) => d.x1 - d.x0).attr("fill", (d) => S(d.id));
796
797
  const P = /* @__PURE__ */ p(({ id: d, value: E }) => T ? `${d}
797
798
  ${w}${Math.round(E * 100) / 100}${M}` : d, "getText");
798
- c.append("g").attr("class", "node-labels").attr("font-size", 14).selectAll("text").data(N.nodes).join("text").attr("x", (d) => d.x0 < u / 2 ? d.x1 + 6 : d.x0 - 6).attr("y", (d) => (d.y1 + d.y0) / 2).attr("dy", `${T ? "0" : "0.35"}em`).attr("text-anchor", (d) => d.x0 < u / 2 ? "start" : "end").text(P);
799
- const B = c.append("g").attr("class", "links").attr("fill", "none").attr("stroke-opacity", 0.5).selectAll(".link").data(N.links).join("g").attr("class", "link").style("mix-blend-mode", "multiply"), O = (a == null ? void 0 : a.linkColor) ?? "gradient";
799
+ l.append("g").attr("class", "node-labels").attr("font-size", 14).selectAll("text").data(N.nodes).join("text").attr("x", (d) => d.x0 < c / 2 ? d.x1 + 6 : d.x0 - 6).attr("y", (d) => (d.y1 + d.y0) / 2).attr("dy", `${T ? "0" : "0.35"}em`).attr("text-anchor", (d) => d.x0 < c / 2 ? "start" : "end").text(P);
800
+ const j = l.append("g").attr("class", "links").attr("fill", "none").attr("stroke-opacity", 0.5).selectAll(".link").data(N.links).join("g").attr("class", "link").style("mix-blend-mode", "multiply"), O = (f == null ? void 0 : f.linkColor) ?? "gradient";
800
801
  if (O === "gradient") {
801
- const d = B.append("linearGradient").attr("id", (E) => (E.uid = dt.next("linearGradient-")).id).attr("gradientUnits", "userSpaceOnUse").attr("x1", (E) => E.source.x1).attr("x2", (E) => E.target.x0);
802
+ const d = j.append("linearGradient").attr("id", (E) => (E.uid = yt.next("linearGradient-")).id).attr("gradientUnits", "userSpaceOnUse").attr("x1", (E) => E.source.x1).attr("x2", (E) => E.target.x0);
802
803
  d.append("stop").attr("offset", "0%").attr("stop-color", (E) => S(E.source.id)), d.append("stop").attr("offset", "100%").attr("stop-color", (E) => S(E.target.id));
803
804
  }
804
805
  let z;
@@ -815,20 +816,20 @@ ${w}${Math.round(E * 100) / 100}${M}` : d, "getText");
815
816
  default:
816
817
  z = O;
817
818
  }
818
- B.append("path").attr("d", te()).attr("stroke", z).attr("stroke-width", (d) => Math.max(1, d.width)), At(void 0, c, 0, v);
819
- }, "draw"), fe = {
820
- draw: he
821
- }, ye = /* @__PURE__ */ p((t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
822
- `).trim(), "prepareTextForParsing"), ge = /* @__PURE__ */ p((t) => `.label {
819
+ j.append("path").attr("d", Zt()).attr("stroke", z).attr("stroke-width", (d) => Math.max(1, d.width)), Lt(void 0, l, 0, v);
820
+ }, "draw"), ue = {
821
+ draw: ce
822
+ }, he = /* @__PURE__ */ p((t) => t.replaceAll(/^[^\S\n\r]+|[^\S\n\r]+$/g, "").replaceAll(/([\n\r])+/g, `
823
+ `).trim(), "prepareTextForParsing"), fe = /* @__PURE__ */ p((t) => `.label {
823
824
  font-family: ${t.fontFamily};
824
- }`, "getStyles"), de = ge, pe = K.parse.bind(K);
825
- K.parse = (t) => pe(ye(t));
826
- var xe = {
827
- styles: de,
828
- parser: K,
829
- db: ce,
830
- renderer: fe
825
+ }`, "getStyles"), ye = fe, ge = H.parse.bind(H);
826
+ H.parse = (t) => ge(he(t));
827
+ var ke = {
828
+ styles: ye,
829
+ parser: H,
830
+ db: ae,
831
+ renderer: ue
831
832
  };
832
833
  export {
833
- xe as diagram
834
+ ke as diagram
834
835
  };