@marimo-team/islands 0.24.1-dev59 → 0.24.1-dev60

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 (48) hide show
  1. package/dist/{ConnectedDataExplorerComponent-CxLgYj_n.js → ConnectedDataExplorerComponent-C-ewmsyP.js} +8 -8
  2. package/dist/{ErrorBoundary-DLlMgwFe.js → ErrorBoundary-BF3QLrI_.js} +1 -1
  3. package/dist/{merge-D55NDT_4.js → _baseMerge-Dv8bBloN.js} +1 -6
  4. package/dist/assets/__vite-browser-external-CLzCcAWX.js +1 -0
  5. package/dist/assets/{worker-351YtjpJ.js → worker-BX-jM9UB.js} +2 -2
  6. package/dist/{chat-ui-Mjq3lBLn.js → chat-ui-DYcwIX9k.js} +8 -8
  7. package/dist/{chunk-5RXB4S5H-BNr_Y0g7.js → chunk-5RXB4S5H-tLNUVDdO.js} +1 -1
  8. package/dist/{chunk-GF5L2VYU-CnHs9qnW.js → chunk-GF5L2VYU-B0wgCQgS.js} +1 -1
  9. package/dist/{chunk-J7OUQ5F2-CC_9qqUR.js → chunk-J7OUQ5F2-CM_meqZH.js} +1 -1
  10. package/dist/{chunk-JQJVKLGR-AdpKD9XE.js → chunk-JQJVKLGR-CgqCwe8E.js} +1 -1
  11. package/dist/{classDiagram-JCYQIIEL-C_cJuFSv.js → classDiagram-JCYQIIEL-DmXSLxe_.js} +2 -2
  12. package/dist/{classDiagram-v2-OCEON4UE-6i_e6jgp.js → classDiagram-v2-OCEON4UE-CooqVexA.js} +2 -2
  13. package/dist/{common-6TJkmXPQ.js → common-B4y5CeYZ.js} +67 -68
  14. package/dist/{dagre-COxSzFxd.js → dagre-CGyalH38.js} +324 -319
  15. package/dist/{dagre-VZM6K2ZE-CUvaH2_x.js → dagre-VZM6K2ZE-CJggWPTJ.js} +1 -1
  16. package/dist/{dropdown-menu-DEu759Oe.js → dropdown-menu-DrzAtluA.js} +1 -1
  17. package/dist/{erDiagram-JOGREHBK-28REhfzr.js → erDiagram-JOGREHBK-rVDG3VSQ.js} +1 -1
  18. package/dist/{flowDiagram-UKHOOZJN-JpGQDhyA.js → flowDiagram-UKHOOZJN-g1AmrZzM.js} +2 -2
  19. package/dist/{formats-l5hZdDGj.js → formats-BepI-dIg.js} +1 -1
  20. package/dist/{glide-data-editor-C2RTkAgQ.js → glide-data-editor-DjrkfE8e.js} +3 -3
  21. package/dist/{html-to-image-hKcfSWj_.js → html-to-image-DnwkphJg.js} +44 -44
  22. package/dist/main.js +83 -83
  23. package/dist/{mermaid-OsTxhZOI.js → mermaid-B3nc_uR6.js} +14 -14
  24. package/dist/{mindmap-definition-FAOFIHXS-CXIO0zKm.js → mindmap-definition-FAOFIHXS-C9gRhzZq.js} +1 -1
  25. package/dist/{process-output-BkHK-KDc.js → process-output-BkiZCdL9.js} +1 -1
  26. package/dist/{requirementDiagram-LRYGKXZP-BPDMWOL7.js → requirementDiagram-LRYGKXZP-X_x-Y713.js} +1 -1
  27. package/dist/{reveal-component-Bkv-spJe.js → reveal-component-BwwB0hbT.js} +308 -308
  28. package/dist/{spec-DqUrBQpS.js → spec-iNjNWU_x.js} +1 -1
  29. package/dist/{stateDiagram-OKZ733FA-2vqKTq34.js → stateDiagram-OKZ733FA-B7QyNBxH.js} +3 -3
  30. package/dist/{stateDiagram-v2-UEYNNEHI-BLxoenec.js → stateDiagram-v2-UEYNNEHI-BTRUs8Il.js} +2 -2
  31. package/dist/{swimlanesDiagram-ULZ7WXOC-CLup3b2B.js → swimlanesDiagram-ULZ7WXOC-NBmgBl9G.js} +2 -2
  32. package/dist/{toDate-C4ZHOUTi.js → toDate-Mzvy7JMZ.js} +11 -11
  33. package/dist/{useAsyncData-BPIoRmNG.js → useAsyncData-VgHmkX1q.js} +1 -1
  34. package/dist/{useDeepCompareMemoize-rqhnGZ6D.js → useDeepCompareMemoize-CcanIsdI.js} +1 -1
  35. package/dist/{useLifecycle-D-zb2Ha5.js → useLifecycle-ClOphI_o.js} +3 -3
  36. package/dist/{useTheme-CLjV5H1i.js → useTheme-3Ul40fOV.js} +165 -157
  37. package/dist/{vega-component-A2xO4BUa.js → vega-component-D45ozr-k.js} +5 -5
  38. package/package.json +1 -1
  39. package/src/components/ai/__tests__/ai-utils.test.ts +64 -66
  40. package/src/components/ai/ai-model-dropdown.tsx +5 -1
  41. package/src/components/ai/ai-utils.ts +37 -21
  42. package/src/components/app-config/ai-config.tsx +86 -24
  43. package/src/components/app-config/user-config-form.tsx +2 -3
  44. package/src/core/ai/config.ts +2 -3
  45. package/src/core/config/__tests__/config-schema.test.ts +31 -0
  46. package/src/core/config/config-schema.ts +1 -0
  47. package/src/core/config/config.ts +15 -2
  48. package/dist/assets/__vite-browser-external-DX3F82ls.js +0 -1
@@ -5,52 +5,52 @@ import { n as te, t as ne } from "./now-jM8-M7IR.js";
5
5
  import { i as re, n as ie } from "./isEmpty-BSZ1LaUo.js";
6
6
  import { c as ae, l as oe, o as se } from "./_initCloneObject---vediN2.js";
7
7
  import { _ as ce, a as h, d as le, g as ue, i as g, l as de, n as _, o as v, r as y, s as fe, t as b, u as x } from "./graphlib-BmY_CCV9.js";
8
- import { n as S, t as C } from "./merge-D55NDT_4.js";
9
- import { r as w, t as T } from "./pick-SnHlmIBN.js";
10
- import { n as pe, r as me, t as E } from "./map-BJpOfPlL.js";
8
+ import { n as pe, r as S, t as me } from "./_baseMerge-Dv8bBloN.js";
9
+ import { r as C, t as w } from "./pick-SnHlmIBN.js";
10
+ import { n as he, r as ge, t as T } from "./map-BJpOfPlL.js";
11
11
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toFinite.js
12
- var he = 1 / 0, ge = 17976931348623157e292;
13
- function D(e) {
14
- return e ? (e = te(e), e === he || e === -he ? (e < 0 ? -1 : 1) * ge : e === e ? e : 0) : e === 0 ? e : 0;
12
+ var _e = 1 / 0, ve = 17976931348623157e292;
13
+ function E(e) {
14
+ return e ? (e = te(e), e === _e || e === -_e ? (e < 0 ? -1 : 1) * ve : e === e ? e : 0) : e === 0 ? e : 0;
15
15
  }
16
16
  //#endregion
17
17
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toInteger.js
18
- function _e(e) {
19
- var t = D(e), n = t % 1;
18
+ function ye(e) {
19
+ var t = E(e), n = t % 1;
20
20
  return t === t ? n ? t - n : t : 0;
21
21
  }
22
22
  //#endregion
23
23
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_hasUnicode.js
24
- var ve = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
25
- function ye(e) {
26
- return ve.test(e);
24
+ var be = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
25
+ function xe(e) {
26
+ return be.test(e);
27
27
  }
28
28
  //#endregion
29
29
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/cloneDeep.js
30
- var be = 1, xe = 4;
31
- function Se(e) {
32
- return me(e, be | xe);
30
+ var Se = 1, Ce = 4;
31
+ function we(e) {
32
+ return ge(e, Se | Ce);
33
33
  }
34
34
  //#endregion
35
35
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/defaults.js
36
- var Ce = Object.prototype, we = Ce.hasOwnProperty, Te = r(function(e, t) {
36
+ var Te = Object.prototype, Ee = Te.hasOwnProperty, De = r(function(e, t) {
37
37
  e = Object(e);
38
38
  var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
39
39
  for (i && S(t[0], t[1], i) && (r = 1); ++n < r;) for (var a = t[n], o = se(a), s = -1, c = o.length; ++s < c;) {
40
40
  var u = o[s], d = e[u];
41
- (d === void 0 || l(d, Ce[u]) && !we.call(e, u)) && (e[u] = a[u]);
41
+ (d === void 0 || l(d, Te[u]) && !Ee.call(e, u)) && (e[u] = a[u]);
42
42
  }
43
43
  return e;
44
44
  });
45
45
  //#endregion
46
46
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/last.js
47
- function O(e) {
47
+ function D(e) {
48
48
  var t = e == null ? 0 : e.length;
49
49
  return t ? e[t - 1] : void 0;
50
50
  }
51
51
  //#endregion
52
52
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createFind.js
53
- function Ee(e) {
53
+ function Oe(e) {
54
54
  return function(t, n, r) {
55
55
  var i = Object(t);
56
56
  if (!a(t)) {
@@ -65,56 +65,56 @@ function Ee(e) {
65
65
  }
66
66
  //#endregion
67
67
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/findIndex.js
68
- var De = Math.max;
69
- function Oe(e, t, n) {
68
+ var ke = Math.max;
69
+ function Ae(e, t, n) {
70
70
  var r = e == null ? 0 : e.length;
71
71
  if (!r) return -1;
72
- var i = n == null ? 0 : _e(n);
73
- return i < 0 && (i = De(r + i, 0)), ce(e, x(t, 3), i);
72
+ var i = n == null ? 0 : ye(n);
73
+ return i < 0 && (i = ke(r + i, 0)), ce(e, x(t, 3), i);
74
74
  }
75
75
  //#endregion
76
76
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/find.js
77
- var k = Ee(Oe);
77
+ var O = Oe(Ae);
78
78
  //#endregion
79
79
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/forIn.js
80
- function ke(e, t) {
80
+ function je(e, t) {
81
81
  return e == null ? e : c(e, fe(t), se);
82
82
  }
83
83
  //#endregion
84
84
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/forOwn.js
85
- function Ae(e, t) {
85
+ function Me(e, t) {
86
86
  return e && de(e, fe(t));
87
87
  }
88
88
  //#endregion
89
89
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseGt.js
90
- function je(e, t) {
90
+ function Ne(e, t) {
91
91
  return e > t;
92
92
  }
93
93
  //#endregion
94
94
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseHas.js
95
- var Me = Object.prototype.hasOwnProperty;
96
- function Ne(e, t) {
97
- return e != null && Me.call(e, t);
95
+ var Pe = Object.prototype.hasOwnProperty;
96
+ function Fe(e, t) {
97
+ return e != null && Pe.call(e, t);
98
98
  }
99
99
  //#endregion
100
100
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/has.js
101
- function Pe(e, t) {
102
- return e != null && p(e, t, Ne);
101
+ function Ie(e, t) {
102
+ return e != null && p(e, t, Fe);
103
103
  }
104
104
  //#endregion
105
105
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/isString.js
106
- var Fe = "[object String]";
107
- function Ie(t) {
108
- return typeof t == "string" || !s(t) && e(t) && o(t) == Fe;
106
+ var Le = "[object String]";
107
+ function Re(t) {
108
+ return typeof t == "string" || !s(t) && e(t) && o(t) == Le;
109
109
  }
110
110
  //#endregion
111
111
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseLt.js
112
- function Le(e, t) {
112
+ function ze(e, t) {
113
113
  return e < t;
114
114
  }
115
115
  //#endregion
116
116
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/mapValues.js
117
- function A(e, t) {
117
+ function k(e, t) {
118
118
  var n = {};
119
119
  return t = x(t, 3), de(e, function(e, r, i) {
120
120
  oe(n, r, t(e, r, i));
@@ -122,7 +122,7 @@ function A(e, t) {
122
122
  }
123
123
  //#endregion
124
124
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseExtremum.js
125
- function j(e, t, n) {
125
+ function A(e, t, n) {
126
126
  for (var r = -1, i = e.length; ++r < i;) {
127
127
  var a = e[r], o = t(a);
128
128
  if (o != null && (s === void 0 ? o === o && !u(o) : n(o, s))) var s = o, c = a;
@@ -131,29 +131,34 @@ function j(e, t, n) {
131
131
  }
132
132
  //#endregion
133
133
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/max.js
134
- function M(e) {
135
- return e && e.length ? j(e, n, je) : void 0;
134
+ function j(e) {
135
+ return e && e.length ? A(e, n, Ne) : void 0;
136
136
  }
137
137
  //#endregion
138
+ //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/merge.js
139
+ var M = pe(function(e, t, n) {
140
+ me(e, t, n);
141
+ });
142
+ //#endregion
138
143
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/min.js
139
144
  function N(e) {
140
- return e && e.length ? j(e, n, Le) : void 0;
145
+ return e && e.length ? A(e, n, ze) : void 0;
141
146
  }
142
147
  //#endregion
143
148
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/minBy.js
144
149
  function P(e, t) {
145
- return e && e.length ? j(e, x(t, 2), Le) : void 0;
150
+ return e && e.length ? A(e, x(t, 2), ze) : void 0;
146
151
  }
147
152
  //#endregion
148
153
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseSortBy.js
149
- function Re(e, t) {
154
+ function Be(e, t) {
150
155
  var n = e.length;
151
156
  for (e.sort(t); n--;) e[n] = e[n].value;
152
157
  return e;
153
158
  }
154
159
  //#endregion
155
160
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_compareAscending.js
156
- function ze(e, t) {
161
+ function Ve(e, t) {
157
162
  if (e !== t) {
158
163
  var n = e !== void 0, r = e === null, i = e === e, a = u(e), o = t !== void 0, s = t === null, c = t === t, l = u(t);
159
164
  if (!s && !l && !a && e > t || a && o && c && !s && !l || r && o && c || !n && c || !i) return 1;
@@ -163,23 +168,23 @@ function ze(e, t) {
163
168
  }
164
169
  //#endregion
165
170
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_compareMultiple.js
166
- function Be(e, t, n) {
171
+ function He(e, t, n) {
167
172
  for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
168
- var c = ze(i[r], a[r]);
173
+ var c = Ve(i[r], a[r]);
169
174
  if (c) return r >= s ? c : c * (n[r] == "desc" ? -1 : 1);
170
175
  }
171
176
  return e.index - t.index;
172
177
  }
173
178
  //#endregion
174
179
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseOrderBy.js
175
- function Ve(e, t, r) {
180
+ function Ue(e, t, r) {
176
181
  t = t.length ? d(t, function(e) {
177
182
  return s(e) ? function(t) {
178
183
  return m(t, e.length === 1 ? e[0] : e);
179
184
  } : e;
180
185
  }) : [n];
181
186
  var a = -1;
182
- return t = d(t, i(x)), Re(pe(e, function(e, n, r) {
187
+ return t = d(t, i(x)), Be(he(e, function(e, n, r) {
183
188
  return {
184
189
  criteria: d(t, function(t) {
185
190
  return t(e);
@@ -188,68 +193,68 @@ function Ve(e, t, r) {
188
193
  value: e
189
194
  };
190
195
  }), function(e, t) {
191
- return Be(e, t, r);
196
+ return He(e, t, r);
192
197
  });
193
198
  }
194
199
  //#endregion
195
200
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_asciiSize.js
196
- var He = le("length"), Ue = "\\ud800-\\udfff", We = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", Ge = "\\ufe0e\\ufe0f", Ke = "[" + Ue + "]", F = "[" + We + "]", I = "\\ud83c[\\udffb-\\udfff]", qe = "(?:" + F + "|" + I + ")", Je = "[^" + Ue + "]", Ye = "(?:\\ud83c[\\udde6-\\uddff]){2}", Xe = "[\\ud800-\\udbff][\\udc00-\\udfff]", Ze = "\\u200d", Qe = qe + "?", $e = "[" + Ge + "]?", et = "(?:" + Ze + "(?:" + [
197
- Je,
198
- Ye,
199
- Xe
200
- ].join("|") + ")" + $e + Qe + ")*", tt = $e + Qe + et, nt = "(?:" + [
201
- Je + F + "?",
202
- F,
203
- Ye,
201
+ var We = le("length"), Ge = "\\ud800-\\udfff", Ke = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", qe = "\\ufe0e\\ufe0f", Je = "[" + Ge + "]", F = "[" + Ke + "]", I = "\\ud83c[\\udffb-\\udfff]", Ye = "(?:" + F + "|" + I + ")", Xe = "[^" + Ge + "]", Ze = "(?:\\ud83c[\\udde6-\\uddff]){2}", Qe = "[\\ud800-\\udbff][\\udc00-\\udfff]", $e = "\\u200d", et = Ye + "?", tt = "[" + qe + "]?", nt = "(?:" + $e + "(?:" + [
204
202
  Xe,
205
- Ke
206
- ].join("|") + ")", rt = RegExp(I + "(?=" + I + ")|" + nt + tt, "g");
207
- function it(e) {
208
- for (var t = rt.lastIndex = 0; rt.test(e);) ++t;
203
+ Ze,
204
+ Qe
205
+ ].join("|") + ")" + tt + et + ")*", rt = tt + et + nt, it = "(?:" + [
206
+ Xe + F + "?",
207
+ F,
208
+ Ze,
209
+ Qe,
210
+ Je
211
+ ].join("|") + ")", at = RegExp(I + "(?=" + I + ")|" + it + rt, "g");
212
+ function ot(e) {
213
+ for (var t = at.lastIndex = 0; at.test(e);) ++t;
209
214
  return t;
210
215
  }
211
216
  //#endregion
212
217
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_stringSize.js
213
- function at(e) {
214
- return ye(e) ? it(e) : He(e);
218
+ function st(e) {
219
+ return xe(e) ? ot(e) : We(e);
215
220
  }
216
221
  //#endregion
217
222
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseRange.js
218
- var ot = Math.ceil, st = Math.max;
219
- function ct(e, t, n, r) {
220
- for (var i = -1, a = st(ot((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
223
+ var ct = Math.ceil, lt = Math.max;
224
+ function ut(e, t, n, r) {
225
+ for (var i = -1, a = lt(ct((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
221
226
  return o;
222
227
  }
223
228
  //#endregion
224
229
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createRange.js
225
- function lt(e) {
230
+ function dt(e) {
226
231
  return function(t, n, r) {
227
- return r && typeof r != "number" && S(t, n, r) && (n = r = void 0), t = D(t), n === void 0 ? (n = t, t = 0) : n = D(n), r = r === void 0 ? t < n ? 1 : -1 : D(r), ct(t, n, r, e);
232
+ return r && typeof r != "number" && S(t, n, r) && (n = r = void 0), t = E(t), n === void 0 ? (n = t, t = 0) : n = E(n), r = r === void 0 ? t < n ? 1 : -1 : E(r), ut(t, n, r, e);
228
233
  };
229
234
  }
230
235
  //#endregion
231
236
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/range.js
232
- var L = lt(), ut = "[object Map]", dt = "[object Set]";
233
- function ft(e) {
237
+ var L = dt(), ft = "[object Map]", pt = "[object Set]";
238
+ function mt(e) {
234
239
  if (e == null) return 0;
235
- if (a(e)) return Ie(e) ? at(e) : e.length;
240
+ if (a(e)) return Re(e) ? st(e) : e.length;
236
241
  var t = ie(e);
237
- return t == ut || t == dt ? e.size : re(e).length;
242
+ return t == ft || t == pt ? e.size : re(e).length;
238
243
  }
239
244
  //#endregion
240
245
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/sortBy.js
241
246
  var R = r(function(e, t) {
242
247
  if (e == null) return [];
243
248
  var n = t.length;
244
- return n > 1 && S(e, t[0], t[1]) ? t = [] : n > 2 && S(t[0], t[1], t[2]) && (t = [t[0]]), Ve(e, ee(t, 1), []);
245
- }), pt = 0;
249
+ return n > 1 && S(e, t[0], t[1]) ? t = [] : n > 2 && S(t[0], t[1], t[2]) && (t = [t[0]]), Ue(e, ee(t, 1), []);
250
+ }), ht = 0;
246
251
  function z(e) {
247
- var t = ++pt;
252
+ var t = ++ht;
248
253
  return f(e) + t;
249
254
  }
250
255
  //#endregion
251
256
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseZipObject.js
252
- function mt(e, t, n) {
257
+ function gt(e, t, n) {
253
258
  for (var r = -1, i = e.length, a = t.length, o = {}; ++r < i;) {
254
259
  var s = r < a ? t[r] : void 0;
255
260
  n(o, e[r], s);
@@ -258,46 +263,46 @@ function mt(e, t, n) {
258
263
  }
259
264
  //#endregion
260
265
  //#region ../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/zipObject.js
261
- function ht(e, t) {
262
- return mt(e || [], t || [], ae);
266
+ function _t(e, t) {
267
+ return gt(e || [], t || [], ae);
263
268
  }
264
269
  //#endregion
265
270
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/data/list.js
266
- var gt = class {
271
+ var vt = class {
267
272
  constructor() {
268
273
  var e = {};
269
274
  e._next = e._prev = e, this._sentinel = e;
270
275
  }
271
276
  dequeue() {
272
277
  var e = this._sentinel, t = e._prev;
273
- if (t !== e) return _t(t), t;
278
+ if (t !== e) return yt(t), t;
274
279
  }
275
280
  enqueue(e) {
276
281
  var t = this._sentinel;
277
- e._prev && e._next && _t(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
282
+ e._prev && e._next && yt(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
278
283
  }
279
284
  toString() {
280
- for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, vt)), n = n._prev;
285
+ for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, bt)), n = n._prev;
281
286
  return "[" + e.join(", ") + "]";
282
287
  }
283
288
  };
284
- function _t(e) {
289
+ function yt(e) {
285
290
  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
286
291
  }
287
- function vt(e, t) {
292
+ function bt(e, t) {
288
293
  if (e !== "_next" && e !== "_prev") return t;
289
294
  }
290
295
  //#endregion
291
296
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/greedy-fas.js
292
- var yt = t(1);
293
- function bt(e, t) {
297
+ var xt = t(1);
298
+ function St(e, t) {
294
299
  if (e.nodeCount() <= 1) return [];
295
- var n = St(e, t || yt), r = xt(n.graph, n.buckets, n.zeroIdx);
296
- return w(E(r, function(t) {
300
+ var n = wt(e, t || xt), r = Ct(n.graph, n.buckets, n.zeroIdx);
301
+ return C(T(r, function(t) {
297
302
  return e.outEdges(t.v, t.w);
298
303
  }));
299
304
  }
300
- function xt(e, t, n) {
305
+ function Ct(e, t, n) {
301
306
  for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
302
307
  for (; o = a.dequeue();) B(e, t, n, o);
303
308
  for (; o = i.dequeue();) B(e, t, n, o);
@@ -323,7 +328,7 @@ function B(e, t, n, r, i) {
323
328
  o.in -= i, V(t, n, o);
324
329
  }), e.removeNode(r.v), a;
325
330
  }
326
- function St(e, t) {
331
+ function wt(e, t) {
327
332
  var n = new b(), r = 0, i = 0;
328
333
  v(e.nodes(), function(e) {
329
334
  n.setNode(e, {
@@ -336,7 +341,7 @@ function St(e, t) {
336
341
  n.setEdge(e.v, e.w, s), i = Math.max(i, n.node(e.v).out += o), r = Math.max(r, n.node(e.w).in += o);
337
342
  });
338
343
  var a = L(i + r + 3).map(function() {
339
- return new gt();
344
+ return new vt();
340
345
  }), o = r + 1;
341
346
  return v(n.nodes(), function(e) {
342
347
  V(a, o, n.node(e));
@@ -351,8 +356,8 @@ function V(e, t, n) {
351
356
  }
352
357
  //#endregion
353
358
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/acyclic.js
354
- function Ct(e) {
355
- var t = e.graph().acyclicer === "greedy" ? bt(e, n(e)) : wt(e);
359
+ function Tt(e) {
360
+ var t = e.graph().acyclicer === "greedy" ? St(e, n(e)) : Et(e);
356
361
  v(t, function(t) {
357
362
  var n = e.edge(t);
358
363
  e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, z("rev"));
@@ -363,7 +368,7 @@ function Ct(e) {
363
368
  };
364
369
  }
365
370
  }
366
- function wt(e) {
371
+ function Et(e) {
367
372
  var t = [], n = {}, r = {};
368
373
  function i(a) {
369
374
  Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, v(e.outEdges(a), function(e) {
@@ -372,7 +377,7 @@ function wt(e) {
372
377
  }
373
378
  return v(e.nodes(), i), t;
374
379
  }
375
- function Tt(e) {
380
+ function Dt(e) {
376
381
  v(e.edges(), function(t) {
377
382
  var n = e.edge(t);
378
383
  if (n.reversed) {
@@ -391,7 +396,7 @@ function H(e, t, n, r) {
391
396
  while (e.hasNode(i));
392
397
  return n.dummy = t, e.setNode(i, n), i;
393
398
  }
394
- function Et(e) {
399
+ function Ot(e) {
395
400
  var t = new b().setGraph(e.graph());
396
401
  return v(e.nodes(), function(n) {
397
402
  t.setNode(n, e.node(n));
@@ -406,7 +411,7 @@ function Et(e) {
406
411
  });
407
412
  }), t;
408
413
  }
409
- function Dt(e) {
414
+ function kt(e) {
410
415
  var t = new b({ multigraph: e.isMultigraph() }).setGraph(e.graph());
411
416
  return v(e.nodes(), function(n) {
412
417
  e.children(n).length || t.setNode(n, e.node(n));
@@ -414,7 +419,7 @@ function Dt(e) {
414
419
  t.setEdge(n, e.edge(n));
415
420
  }), t;
416
421
  }
417
- function Ot(e, t) {
422
+ function At(e, t) {
418
423
  var n = e.x, r = e.y, i = t.x - n, a = t.y - r, o = e.width / 2, s = e.height / 2;
419
424
  if (!i && !a) throw Error("Not possible to find intersection inside of the rectangle");
420
425
  var c, l;
@@ -424,7 +429,7 @@ function Ot(e, t) {
424
429
  };
425
430
  }
426
431
  function U(e) {
427
- var t = E(L(Mt(e) + 1), function() {
432
+ var t = T(L(Pt(e) + 1), function() {
428
433
  return [];
429
434
  });
430
435
  return v(e.nodes(), function(n) {
@@ -432,17 +437,17 @@ function U(e) {
432
437
  y(i) || (t[i][r.order] = n);
433
438
  }), t;
434
439
  }
435
- function kt(e) {
436
- var t = N(E(e.nodes(), function(t) {
440
+ function jt(e) {
441
+ var t = N(T(e.nodes(), function(t) {
437
442
  return e.node(t).rank;
438
443
  }));
439
444
  v(e.nodes(), function(n) {
440
445
  var r = e.node(n);
441
- Pe(r, "rank") && (r.rank -= t);
446
+ Ie(r, "rank") && (r.rank -= t);
442
447
  });
443
448
  }
444
- function At(e) {
445
- var t = N(E(e.nodes(), function(t) {
449
+ function Mt(e) {
450
+ var t = N(T(e.nodes(), function(t) {
446
451
  return e.node(t).rank;
447
452
  })), n = [];
448
453
  v(e.nodes(), function(r) {
@@ -456,20 +461,20 @@ function At(e) {
456
461
  });
457
462
  });
458
463
  }
459
- function jt(e, t, n, r) {
464
+ function Nt(e, t, n, r) {
460
465
  var i = {
461
466
  width: 0,
462
467
  height: 0
463
468
  };
464
469
  return arguments.length >= 4 && (i.rank = n, i.order = r), H(e, "border", i, t);
465
470
  }
466
- function Mt(e) {
467
- return M(E(e.nodes(), function(t) {
471
+ function Pt(e) {
472
+ return j(T(e.nodes(), function(t) {
468
473
  var n = e.node(t).rank;
469
474
  if (!y(n)) return n;
470
475
  }));
471
476
  }
472
- function Nt(e, t) {
477
+ function Ft(e, t) {
473
478
  var n = {
474
479
  lhs: [],
475
480
  rhs: []
@@ -478,7 +483,7 @@ function Nt(e, t) {
478
483
  t(e) ? n.lhs.push(e) : n.rhs.push(e);
479
484
  }), n;
480
485
  }
481
- function Pt(e, t) {
486
+ function It(e, t) {
482
487
  var n = ne();
483
488
  try {
484
489
  return t();
@@ -486,22 +491,22 @@ function Pt(e, t) {
486
491
  console.log(e + " time: " + (ne() - n) + "ms");
487
492
  }
488
493
  }
489
- function Ft(e, t) {
494
+ function Lt(e, t) {
490
495
  return t();
491
496
  }
492
497
  //#endregion
493
498
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/add-border-segments.js
494
- function It(e) {
499
+ function Rt(e) {
495
500
  function t(n) {
496
501
  var r = e.children(n), i = e.node(n);
497
502
  if (r.length && v(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
498
503
  i.borderLeft = [], i.borderRight = [];
499
- for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) Lt(e, "borderLeft", "_bl", n, i, a), Lt(e, "borderRight", "_br", n, i, a);
504
+ for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) zt(e, "borderLeft", "_bl", n, i, a), zt(e, "borderRight", "_br", n, i, a);
500
505
  }
501
506
  }
502
507
  v(e.children(), t);
503
508
  }
504
- function Lt(e, t, n, r, i, a) {
509
+ function zt(e, t, n, r, i, a) {
505
510
  var o = {
506
511
  width: 0,
507
512
  height: 0,
@@ -512,26 +517,26 @@ function Lt(e, t, n, r, i, a) {
512
517
  }
513
518
  //#endregion
514
519
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/coordinate-system.js
515
- function Rt(e) {
520
+ function Bt(e) {
516
521
  var t = e.graph().rankdir.toLowerCase();
517
- (t === "lr" || t === "rl") && Bt(e);
522
+ (t === "lr" || t === "rl") && Ht(e);
518
523
  }
519
- function zt(e) {
524
+ function Vt(e) {
520
525
  var t = e.graph().rankdir.toLowerCase();
521
- (t === "bt" || t === "rl") && Ht(e), (t === "lr" || t === "rl") && (Ut(e), Bt(e));
526
+ (t === "bt" || t === "rl") && Wt(e), (t === "lr" || t === "rl") && (Gt(e), Ht(e));
522
527
  }
523
- function Bt(e) {
528
+ function Ht(e) {
524
529
  v(e.nodes(), function(t) {
525
- Vt(e.node(t));
530
+ Ut(e.node(t));
526
531
  }), v(e.edges(), function(t) {
527
- Vt(e.edge(t));
532
+ Ut(e.edge(t));
528
533
  });
529
534
  }
530
- function Vt(e) {
535
+ function Ut(e) {
531
536
  var t = e.width;
532
537
  e.width = e.height, e.height = t;
533
538
  }
534
- function Ht(e) {
539
+ function Wt(e) {
535
540
  v(e.nodes(), function(t) {
536
541
  W(e.node(t));
537
542
  }), v(e.edges(), function(t) {
@@ -542,7 +547,7 @@ function Ht(e) {
542
547
  function W(e) {
543
548
  e.y = -e.y;
544
549
  }
545
- function Ut(e) {
550
+ function Gt(e) {
546
551
  v(e.nodes(), function(t) {
547
552
  G(e.node(t));
548
553
  }), v(e.edges(), function(t) {
@@ -556,12 +561,12 @@ function G(e) {
556
561
  }
557
562
  //#endregion
558
563
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/normalize.js
559
- function Wt(e) {
564
+ function Kt(e) {
560
565
  e.graph().dummyChains = [], v(e.edges(), function(t) {
561
- Gt(e, t);
566
+ qt(e, t);
562
567
  });
563
568
  }
564
- function Gt(e, t) {
569
+ function qt(e, t) {
565
570
  var n = t.v, r = e.node(n).rank, i = t.w, a = e.node(i).rank, o = t.name, s = e.edge(t), c = s.labelRank;
566
571
  if (a !== r + 1) {
567
572
  e.removeEdge(t);
@@ -576,7 +581,7 @@ function Gt(e, t) {
576
581
  e.setEdge(n, i, { weight: s.weight }, o);
577
582
  }
578
583
  }
579
- function Kt(e) {
584
+ function Jt(e) {
580
585
  v(e.graph().dummyChains, function(t) {
581
586
  var n = e.node(t), r = n.edgeLabel, i;
582
587
  for (e.setEdge(n.edgeObj, r); n.dummy;) i = e.successors(t)[0], e.removeNode(t), r.points.push({
@@ -593,7 +598,7 @@ function K(e) {
593
598
  var i = e.node(r);
594
599
  if (Object.prototype.hasOwnProperty.call(t, r)) return i.rank;
595
600
  t[r] = !0;
596
- var a = N(E(e.outEdges(r), function(t) {
601
+ var a = N(T(e.outEdges(r), function(t) {
597
602
  return n(t.w) - e.edge(t).minlen;
598
603
  }));
599
604
  return (a === Infinity || a == null) && (a = 0), i.rank = a;
@@ -605,13 +610,13 @@ function q(e, t) {
605
610
  }
606
611
  //#endregion
607
612
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
608
- function qt(e) {
613
+ function Yt(e) {
609
614
  var t = new b({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
610
615
  t.setNode(n, {});
611
- for (var i, a; Jt(t, e) < r;) i = Yt(t, e), a = t.hasNode(i.v) ? q(e, i) : -q(e, i), Xt(t, e, a);
616
+ for (var i, a; Xt(t, e) < r;) i = Zt(t, e), a = t.hasNode(i.v) ? q(e, i) : -q(e, i), Qt(t, e, a);
612
617
  return t;
613
618
  }
614
- function Jt(e, t) {
619
+ function Xt(e, t) {
615
620
  function n(r) {
616
621
  v(t.nodeEdges(r), function(i) {
617
622
  var a = i.v, o = r === a ? i.w : a;
@@ -620,79 +625,79 @@ function Jt(e, t) {
620
625
  }
621
626
  return v(e.nodes(), n), e.nodeCount();
622
627
  }
623
- function Yt(e, t) {
628
+ function Zt(e, t) {
624
629
  return P(t.edges(), function(n) {
625
630
  if (e.hasNode(n.v) !== e.hasNode(n.w)) return q(t, n);
626
631
  });
627
632
  }
628
- function Xt(e, t, n) {
633
+ function Qt(e, t, n) {
629
634
  v(e.nodes(), function(e) {
630
635
  t.node(e).rank += n;
631
636
  });
632
637
  }
633
638
  //#endregion
634
639
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
635
- t(1), t(1), Zt.CycleException = J;
636
- function Zt(e) {
640
+ t(1), t(1), $t.CycleException = J;
641
+ function $t(e) {
637
642
  var t = {}, n = {}, r = [];
638
643
  function i(a) {
639
644
  if (Object.prototype.hasOwnProperty.call(n, a)) throw new J();
640
645
  Object.prototype.hasOwnProperty.call(t, a) || (n[a] = !0, t[a] = !0, v(e.predecessors(a), i), delete n[a], r.push(a));
641
646
  }
642
- if (v(e.sinks(), i), ft(t) !== e.nodeCount()) throw new J();
647
+ if (v(e.sinks(), i), mt(t) !== e.nodeCount()) throw new J();
643
648
  return r;
644
649
  }
645
650
  function J() {}
646
651
  J.prototype = /* @__PURE__ */ Error();
647
652
  //#endregion
648
653
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
649
- function Qt(e, t, n) {
654
+ function en(e, t, n) {
650
655
  s(t) || (t = [t]);
651
656
  var r = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], a = {};
652
657
  return v(t, function(t) {
653
658
  if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
654
- $t(e, t, n === "post", a, r, i);
659
+ tn(e, t, n === "post", a, r, i);
655
660
  }), i;
656
661
  }
657
- function $t(e, t, n, r, i, a) {
662
+ function tn(e, t, n, r, i, a) {
658
663
  Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), v(i(t), function(t) {
659
- $t(e, t, n, r, i, a);
664
+ tn(e, t, n, r, i, a);
660
665
  }), n && a.push(t));
661
666
  }
662
667
  //#endregion
663
668
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
664
- function en(e, t) {
665
- return Qt(e, t, "post");
669
+ function nn(e, t) {
670
+ return en(e, t, "post");
666
671
  }
667
672
  //#endregion
668
673
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
669
- function tn(e, t) {
670
- return Qt(e, t, "pre");
674
+ function rn(e, t) {
675
+ return en(e, t, "pre");
671
676
  }
672
- Y.initLowLimValues = Z, Y.initCutValues = X, Y.calcCutValue = rn, Y.leaveEdge = on, Y.enterEdge = sn, Y.exchangeEdges = cn;
677
+ Y.initLowLimValues = Z, Y.initCutValues = X, Y.calcCutValue = on, Y.leaveEdge = cn, Y.enterEdge = ln, Y.exchangeEdges = un;
673
678
  function Y(e) {
674
- e = Et(e), K(e);
675
- var t = qt(e);
679
+ e = Ot(e), K(e);
680
+ var t = Yt(e);
676
681
  Z(t), X(t, e);
677
- for (var n, r; n = on(t);) r = sn(t, e, n), cn(t, e, n, r);
682
+ for (var n, r; n = cn(t);) r = ln(t, e, n), un(t, e, n, r);
678
683
  }
679
684
  function X(e, t) {
680
- var n = en(e, e.nodes());
685
+ var n = nn(e, e.nodes());
681
686
  n = n.slice(0, n.length - 1), v(n, function(n) {
682
- nn(e, t, n);
687
+ an(e, t, n);
683
688
  });
684
689
  }
685
- function nn(e, t, n) {
690
+ function an(e, t, n) {
686
691
  var r = e.node(n).parent;
687
- e.edge(n, r).cutvalue = rn(e, t, n);
692
+ e.edge(n, r).cutvalue = on(e, t, n);
688
693
  }
689
- function rn(e, t, n) {
694
+ function on(e, t, n) {
690
695
  var r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
691
696
  return a ||= (i = !1, t.edge(r, n)), o = a.weight, v(t.nodeEdges(n), function(a) {
692
697
  var s = a.v === n, c = s ? a.w : a.v;
693
698
  if (c !== r) {
694
699
  var l = s === i, u = t.edge(a).weight;
695
- if (o += l ? u : -u, un(e, n, c)) {
700
+ if (o += l ? u : -u, fn(e, n, c)) {
696
701
  var d = e.edge(n, c).cutvalue;
697
702
  o += l ? -d : d;
698
703
  }
@@ -700,35 +705,35 @@ function rn(e, t, n) {
700
705
  }), o;
701
706
  }
702
707
  function Z(e, t) {
703
- arguments.length < 2 && (t = e.nodes()[0]), an(e, {}, 1, t);
708
+ arguments.length < 2 && (t = e.nodes()[0]), sn(e, {}, 1, t);
704
709
  }
705
- function an(e, t, n, r, i) {
710
+ function sn(e, t, n, r, i) {
706
711
  var a = n, o = e.node(r);
707
712
  return t[r] = !0, v(e.neighbors(r), function(i) {
708
- Object.prototype.hasOwnProperty.call(t, i) || (n = an(e, t, n, i, r));
713
+ Object.prototype.hasOwnProperty.call(t, i) || (n = sn(e, t, n, i, r));
709
714
  }), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
710
715
  }
711
- function on(e) {
712
- return k(e.edges(), function(t) {
716
+ function cn(e) {
717
+ return O(e.edges(), function(t) {
713
718
  return e.edge(t).cutvalue < 0;
714
719
  });
715
720
  }
716
- function sn(e, t, n) {
721
+ function ln(e, t, n) {
717
722
  var r = n.v, i = n.w;
718
723
  t.hasEdge(r, i) || (r = n.w, i = n.v);
719
724
  var a = e.node(r), o = e.node(i), s = a, c = !1;
720
725
  return a.lim > o.lim && (s = o, c = !0), P(h(t.edges(), function(t) {
721
- return c === dn(e, e.node(t.v), s) && c !== dn(e, e.node(t.w), s);
726
+ return c === pn(e, e.node(t.v), s) && c !== pn(e, e.node(t.w), s);
722
727
  }), function(e) {
723
728
  return q(t, e);
724
729
  });
725
730
  }
726
- function cn(e, t, n, r) {
731
+ function un(e, t, n, r) {
727
732
  var i = n.v, a = n.w;
728
- e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), Z(e), X(e, t), ln(e, t);
733
+ e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), Z(e), X(e, t), dn(e, t);
729
734
  }
730
- function ln(e, t) {
731
- var n = tn(e, k(e.nodes(), function(e) {
735
+ function dn(e, t) {
736
+ var n = rn(e, O(e.nodes(), function(e) {
732
737
  return !t.node(e).parent;
733
738
  }));
734
739
  n = n.slice(1), v(n, function(n) {
@@ -736,48 +741,48 @@ function ln(e, t) {
736
741
  i || (i = t.edge(r, n), a = !0), t.node(n).rank = t.node(r).rank + (a ? i.minlen : -i.minlen);
737
742
  });
738
743
  }
739
- function un(e, t, n) {
744
+ function fn(e, t, n) {
740
745
  return e.hasEdge(t, n);
741
746
  }
742
- function dn(e, t, n) {
747
+ function pn(e, t, n) {
743
748
  return n.low <= t.lim && t.lim <= n.lim;
744
749
  }
745
750
  //#endregion
746
751
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/index.js
747
- function fn(e) {
752
+ function mn(e) {
748
753
  switch (e.graph().ranker) {
749
754
  case "network-simplex":
750
- hn(e);
755
+ _n(e);
751
756
  break;
752
757
  case "tight-tree":
753
- mn(e);
758
+ gn(e);
754
759
  break;
755
760
  case "longest-path":
756
- pn(e);
761
+ hn(e);
757
762
  break;
758
- default: hn(e);
763
+ default: _n(e);
759
764
  }
760
765
  }
761
- var pn = K;
762
- function mn(e) {
763
- K(e), qt(e);
766
+ var hn = K;
767
+ function gn(e) {
768
+ K(e), Yt(e);
764
769
  }
765
- function hn(e) {
770
+ function _n(e) {
766
771
  Y(e);
767
772
  }
768
773
  //#endregion
769
774
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/nesting-graph.js
770
- function gn(e) {
771
- var t = H(e, "root", {}, "_root"), n = vn(e), r = M(g(n)) - 1, i = 2 * r + 1;
775
+ function vn(e) {
776
+ var t = H(e, "root", {}, "_root"), n = bn(e), r = j(g(n)) - 1, i = 2 * r + 1;
772
777
  e.graph().nestingRoot = t, v(e.edges(), function(t) {
773
778
  e.edge(t).minlen *= i;
774
779
  });
775
- var a = yn(e) + 1;
780
+ var a = xn(e) + 1;
776
781
  v(e.children(), function(o) {
777
- _n(e, t, i, a, r, n, o);
782
+ yn(e, t, i, a, r, n, o);
778
783
  }), e.graph().nodeRankFactor = i;
779
784
  }
780
- function _n(e, t, n, r, i, a, o) {
785
+ function yn(e, t, n, r, i, a, o) {
781
786
  var s = e.children(o);
782
787
  if (!s.length) {
783
788
  o !== t && e.setEdge(t, o, {
@@ -786,9 +791,9 @@ function _n(e, t, n, r, i, a, o) {
786
791
  });
787
792
  return;
788
793
  }
789
- var c = jt(e, "_bt"), l = jt(e, "_bb"), u = e.node(o);
794
+ var c = Nt(e, "_bt"), l = Nt(e, "_bb"), u = e.node(o);
790
795
  e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, v(s, function(s) {
791
- _n(e, t, n, r, i, a, s);
796
+ yn(e, t, n, r, i, a, s);
792
797
  var u = e.node(s), d = u.borderTop ? u.borderTop : s, f = u.borderBottom ? u.borderBottom : s, p = u.borderTop ? r : 2 * r, m = d === f ? i - a[o] + 1 : 1;
793
798
  e.setEdge(c, d, {
794
799
  weight: p,
@@ -804,7 +809,7 @@ function _n(e, t, n, r, i, a, o) {
804
809
  minlen: i + a[o]
805
810
  });
806
811
  }
807
- function vn(e) {
812
+ function bn(e) {
808
813
  var t = {};
809
814
  function n(r, i) {
810
815
  var a = e.children(r);
@@ -816,12 +821,12 @@ function vn(e) {
816
821
  n(e, 1);
817
822
  }), t;
818
823
  }
819
- function yn(e) {
824
+ function xn(e) {
820
825
  return _(e.edges(), function(t, n) {
821
826
  return t + e.edge(n).weight;
822
827
  }, 0);
823
828
  }
824
- function bn(e) {
829
+ function Sn(e) {
825
830
  var t = e.graph();
826
831
  e.removeNode(t.nestingRoot), delete t.nestingRoot, v(e.edges(), function(t) {
827
832
  e.edge(t).nestingEdge && e.removeEdge(t);
@@ -829,7 +834,7 @@ function bn(e) {
829
834
  }
830
835
  //#endregion
831
836
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
832
- function xn(e, t, n) {
837
+ function Cn(e, t, n) {
833
838
  var r = {}, i;
834
839
  v(n, function(n) {
835
840
  for (var a = e.parent(n), o, s; a;) {
@@ -843,8 +848,8 @@ function xn(e, t, n) {
843
848
  }
844
849
  //#endregion
845
850
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
846
- function Sn(e, t, n) {
847
- var r = Cn(e), i = new b({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
851
+ function wn(e, t, n) {
852
+ var r = Tn(e), i = new b({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
848
853
  return e.node(t);
849
854
  });
850
855
  return v(e.nodes(), function(a) {
@@ -858,21 +863,21 @@ function Sn(e, t, n) {
858
863
  }));
859
864
  }), i;
860
865
  }
861
- function Cn(e) {
866
+ function Tn(e) {
862
867
  for (var t; e.hasNode(t = z("_root")););
863
868
  return t;
864
869
  }
865
870
  //#endregion
866
871
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/cross-count.js
867
- function wn(e, t) {
868
- for (var n = 0, r = 1; r < t.length; ++r) n += Tn(e, t[r - 1], t[r]);
872
+ function En(e, t) {
873
+ for (var n = 0, r = 1; r < t.length; ++r) n += Dn(e, t[r - 1], t[r]);
869
874
  return n;
870
875
  }
871
- function Tn(e, t, n) {
872
- for (var r = ht(n, E(n, function(e, t) {
876
+ function Dn(e, t, n) {
877
+ for (var r = _t(n, T(n, function(e, t) {
873
878
  return t;
874
- })), i = w(E(t, function(t) {
875
- return R(E(e.outEdges(t), function(t) {
879
+ })), i = C(T(t, function(t) {
880
+ return R(T(e.outEdges(t), function(t) {
876
881
  return {
877
882
  pos: r[t.w],
878
883
  weight: e.edge(t).weight
@@ -881,7 +886,7 @@ function Tn(e, t, n) {
881
886
  })), a = 1; a < n.length;) a <<= 1;
882
887
  var o = 2 * a - 1;
883
888
  --a;
884
- var s = E(Array(o), function() {
889
+ var s = T(Array(o), function() {
885
890
  return 0;
886
891
  }), c = 0;
887
892
  return v(i.forEach(function(e) {
@@ -893,16 +898,16 @@ function Tn(e, t, n) {
893
898
  }
894
899
  //#endregion
895
900
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/init-order.js
896
- function En(e) {
901
+ function On(e) {
897
902
  var t = {}, n = h(e.nodes(), function(t) {
898
903
  return !e.children(t).length;
899
- }), r = M(E(n, function(t) {
904
+ }), r = j(T(n, function(t) {
900
905
  return e.node(t).rank;
901
- })), i = E(L(r + 1), function() {
906
+ })), i = T(L(r + 1), function() {
902
907
  return [];
903
908
  });
904
909
  function a(n) {
905
- Pe(t, n) || (t[n] = !0, i[e.node(n).rank].push(n), v(e.successors(n), a));
910
+ Ie(t, n) || (t[n] = !0, i[e.node(n).rank].push(n), v(e.successors(n), a));
906
911
  }
907
912
  var o = R(n, function(t) {
908
913
  return e.node(t).rank;
@@ -911,8 +916,8 @@ function En(e) {
911
916
  }
912
917
  //#endregion
913
918
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/barycenter.js
914
- function Dn(e, t) {
915
- return E(t, function(t) {
919
+ function kn(e, t) {
920
+ return T(t, function(t) {
916
921
  var n = e.inEdges(t);
917
922
  if (n.length) {
918
923
  var r = _(n, function(t, n) {
@@ -936,7 +941,7 @@ function Dn(e, t) {
936
941
  }
937
942
  //#endregion
938
943
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
939
- function On(e, t) {
944
+ function An(e, t) {
940
945
  var n = {};
941
946
  return v(e, function(e, t) {
942
947
  var r = n[e.v] = {
@@ -950,15 +955,15 @@ function On(e, t) {
950
955
  }), v(t.edges(), function(e) {
951
956
  var t = n[e.v], r = n[e.w];
952
957
  !y(t) && !y(r) && (r.indegree++, t.out.push(n[e.w]));
953
- }), kn(h(n, function(e) {
958
+ }), jn(h(n, function(e) {
954
959
  return !e.indegree;
955
960
  }));
956
961
  }
957
- function kn(e) {
962
+ function jn(e) {
958
963
  var t = [];
959
964
  function n(e) {
960
965
  return function(t) {
961
- t.merged || (y(t.barycenter) || y(e.barycenter) || t.barycenter >= e.barycenter) && An(e, t);
966
+ t.merged || (y(t.barycenter) || y(e.barycenter) || t.barycenter >= e.barycenter) && Mn(e, t);
962
967
  };
963
968
  }
964
969
  function r(t) {
@@ -970,10 +975,10 @@ function kn(e) {
970
975
  var i = e.pop();
971
976
  t.push(i), v(i.in.reverse(), n(i)), v(i.out, r(i));
972
977
  }
973
- return E(h(t, function(e) {
978
+ return T(h(t, function(e) {
974
979
  return !e.merged;
975
980
  }), function(e) {
976
- return T(e, [
981
+ return w(e, [
977
982
  "vs",
978
983
  "i",
979
984
  "barycenter",
@@ -981,51 +986,51 @@ function kn(e) {
981
986
  ]);
982
987
  });
983
988
  }
984
- function An(e, t) {
989
+ function Mn(e, t) {
985
990
  var n = 0, r = 0;
986
991
  e.weight && (n += e.barycenter * e.weight, r += e.weight), t.weight && (n += t.barycenter * t.weight, r += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = n / r, e.weight = r, e.i = Math.min(t.i, e.i), t.merged = !0;
987
992
  }
988
993
  //#endregion
989
994
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort.js
990
- function jn(e, t) {
991
- var n = Nt(e, function(e) {
995
+ function Nn(e, t) {
996
+ var n = Ft(e, function(e) {
992
997
  return Object.prototype.hasOwnProperty.call(e, "barycenter");
993
998
  }), r = n.lhs, i = R(n.rhs, function(e) {
994
999
  return -e.i;
995
1000
  }), a = [], o = 0, s = 0, c = 0;
996
- r.sort(Nn(!!t)), c = Mn(a, i, c), v(r, function(e) {
997
- c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = Mn(a, i, c);
1001
+ r.sort(Fn(!!t)), c = Pn(a, i, c), v(r, function(e) {
1002
+ c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = Pn(a, i, c);
998
1003
  });
999
- var l = { vs: w(a) };
1004
+ var l = { vs: C(a) };
1000
1005
  return s && (l.barycenter = o / s, l.weight = s), l;
1001
1006
  }
1002
- function Mn(e, t, n) {
1003
- for (var r; t.length && (r = O(t)).i <= n;) t.pop(), e.push(r.vs), n++;
1007
+ function Pn(e, t, n) {
1008
+ for (var r; t.length && (r = D(t)).i <= n;) t.pop(), e.push(r.vs), n++;
1004
1009
  return n;
1005
1010
  }
1006
- function Nn(e) {
1011
+ function Fn(e) {
1007
1012
  return function(t, n) {
1008
1013
  return t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
1009
1014
  };
1010
1015
  }
1011
1016
  //#endregion
1012
1017
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
1013
- function Pn(e, t, n, r) {
1018
+ function In(e, t, n, r) {
1014
1019
  var i = e.children(t), a = e.node(t), o = a ? a.borderLeft : void 0, s = a ? a.borderRight : void 0, c = {};
1015
1020
  o && (i = h(i, function(e) {
1016
1021
  return e !== o && e !== s;
1017
1022
  }));
1018
- var l = Dn(e, i);
1023
+ var l = kn(e, i);
1019
1024
  v(l, function(t) {
1020
1025
  if (e.children(t.v).length) {
1021
- var i = Pn(e, t.v, n, r);
1022
- c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && In(t, i);
1026
+ var i = In(e, t.v, n, r);
1027
+ c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && Rn(t, i);
1023
1028
  }
1024
1029
  });
1025
- var u = On(l, n);
1026
- Fn(u, c);
1027
- var d = jn(u, r);
1028
- if (o && (d.vs = w([
1030
+ var u = An(l, n);
1031
+ Ln(u, c);
1032
+ var d = Nn(u, r);
1033
+ if (o && (d.vs = C([
1029
1034
  o,
1030
1035
  d.vs,
1031
1036
  s
@@ -1035,43 +1040,43 @@ function Pn(e, t, n, r) {
1035
1040
  }
1036
1041
  return d;
1037
1042
  }
1038
- function Fn(e, t) {
1043
+ function Ln(e, t) {
1039
1044
  v(e, function(e) {
1040
- e.vs = w(e.vs.map(function(e) {
1045
+ e.vs = C(e.vs.map(function(e) {
1041
1046
  return t[e] ? t[e].vs : e;
1042
1047
  }));
1043
1048
  });
1044
1049
  }
1045
- function In(e, t) {
1050
+ function Rn(e, t) {
1046
1051
  y(e.barycenter) ? (e.barycenter = t.barycenter, e.weight = t.weight) : (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight);
1047
1052
  }
1048
1053
  //#endregion
1049
1054
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/index.js
1050
- function Ln(e) {
1051
- var t = Mt(e), n = Rn(e, L(1, t + 1), "inEdges"), r = Rn(e, L(t - 1, -1, -1), "outEdges"), i = En(e);
1052
- Bn(e, i);
1055
+ function zn(e) {
1056
+ var t = Pt(e), n = Bn(e, L(1, t + 1), "inEdges"), r = Bn(e, L(t - 1, -1, -1), "outEdges"), i = On(e);
1057
+ Hn(e, i);
1053
1058
  for (var a = Infinity, o, s = 0, c = 0; c < 4; ++s, ++c) {
1054
- zn(s % 2 ? n : r, s % 4 >= 2), i = U(e);
1055
- var l = wn(e, i);
1056
- l < a && (c = 0, o = Se(i), a = l);
1059
+ Vn(s % 2 ? n : r, s % 4 >= 2), i = U(e);
1060
+ var l = En(e, i);
1061
+ l < a && (c = 0, o = we(i), a = l);
1057
1062
  }
1058
- Bn(e, o);
1063
+ Hn(e, o);
1059
1064
  }
1060
- function Rn(e, t, n) {
1061
- return E(t, function(t) {
1062
- return Sn(e, t, n);
1065
+ function Bn(e, t, n) {
1066
+ return T(t, function(t) {
1067
+ return wn(e, t, n);
1063
1068
  });
1064
1069
  }
1065
- function zn(e, t) {
1070
+ function Vn(e, t) {
1066
1071
  var n = new b();
1067
1072
  v(e, function(e) {
1068
- var r = e.graph().root, i = Pn(e, r, n, t);
1073
+ var r = e.graph().root, i = In(e, r, n, t);
1069
1074
  v(i.vs, function(t, n) {
1070
1075
  e.node(t).order = n;
1071
- }), xn(e, n, i.vs);
1076
+ }), Cn(e, n, i.vs);
1072
1077
  });
1073
1078
  }
1074
- function Bn(e, t) {
1079
+ function Hn(e, t) {
1075
1080
  v(t, function(t) {
1076
1081
  v(t, function(t, n) {
1077
1082
  e.node(t).order = n;
@@ -1080,10 +1085,10 @@ function Bn(e, t) {
1080
1085
  }
1081
1086
  //#endregion
1082
1087
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
1083
- function Vn(e) {
1084
- var t = Un(e);
1088
+ function Un(e) {
1089
+ var t = Gn(e);
1085
1090
  v(e.graph().dummyChains, function(n) {
1086
- for (var r = e.node(n), i = r.edgeObj, a = Hn(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; n !== i.w;) {
1091
+ for (var r = e.node(n), i = r.edgeObj, a = Wn(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; n !== i.w;) {
1087
1092
  if (r = e.node(n), u) {
1088
1093
  for (; (l = o[c]) !== s && e.node(l).maxRank < r.rank;) c++;
1089
1094
  l === s && (u = !1);
@@ -1096,7 +1101,7 @@ function Vn(e) {
1096
1101
  }
1097
1102
  });
1098
1103
  }
1099
- function Hn(e, t, n, r) {
1104
+ function Wn(e, t, n, r) {
1100
1105
  var i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c = n, l;
1101
1106
  do
1102
1107
  c = e.parent(c), i.push(c);
@@ -1107,7 +1112,7 @@ function Hn(e, t, n, r) {
1107
1112
  lca: l
1108
1113
  };
1109
1114
  }
1110
- function Un(e) {
1115
+ function Gn(e) {
1111
1116
  var t = {}, n = 0;
1112
1117
  function r(i) {
1113
1118
  var a = n;
@@ -1120,30 +1125,30 @@ function Un(e) {
1120
1125
  }
1121
1126
  //#endregion
1122
1127
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/bk.js
1123
- function Wn(e, t) {
1128
+ function Kn(e, t) {
1124
1129
  var n = {};
1125
1130
  function r(t, r) {
1126
- var i = 0, a = 0, o = t.length, s = O(r);
1131
+ var i = 0, a = 0, o = t.length, s = D(r);
1127
1132
  return v(r, function(t, c) {
1128
- var l = Kn(e, t), u = l ? e.node(l).order : o;
1133
+ var l = Jn(e, t), u = l ? e.node(l).order : o;
1129
1134
  (l || t === s) && (v(r.slice(a, c + 1), function(t) {
1130
1135
  v(e.predecessors(t), function(r) {
1131
1136
  var a = e.node(r), o = a.order;
1132
- (o < i || u < o) && !(a.dummy && e.node(t).dummy) && qn(n, r, t);
1137
+ (o < i || u < o) && !(a.dummy && e.node(t).dummy) && Yn(n, r, t);
1133
1138
  });
1134
1139
  }), a = c + 1, i = u);
1135
1140
  }), r;
1136
1141
  }
1137
1142
  return _(t, r), n;
1138
1143
  }
1139
- function Gn(e, t) {
1144
+ function qn(e, t) {
1140
1145
  var n = {};
1141
1146
  function r(t, r, i, a, o) {
1142
1147
  var s;
1143
1148
  v(L(r, i), function(r) {
1144
1149
  s = t[r], e.node(s).dummy && v(e.predecessors(s), function(t) {
1145
1150
  var r = e.node(t);
1146
- r.dummy && (r.order < a || r.order > o) && qn(n, t, s);
1151
+ r.dummy && (r.order < a || r.order > o) && Yn(n, t, s);
1147
1152
  });
1148
1153
  });
1149
1154
  }
@@ -1159,12 +1164,12 @@ function Gn(e, t) {
1159
1164
  }
1160
1165
  return _(t, i), n;
1161
1166
  }
1162
- function Kn(e, t) {
1163
- if (e.node(t).dummy) return k(e.predecessors(t), function(t) {
1167
+ function Jn(e, t) {
1168
+ if (e.node(t).dummy) return O(e.predecessors(t), function(t) {
1164
1169
  return e.node(t).dummy;
1165
1170
  });
1166
1171
  }
1167
- function qn(e, t, n) {
1172
+ function Yn(e, t, n) {
1168
1173
  if (t > n) {
1169
1174
  var r = t;
1170
1175
  t = n, n = r;
@@ -1183,14 +1188,14 @@ function qn(e, t, n) {
1183
1188
  writable: !0
1184
1189
  });
1185
1190
  }
1186
- function Jn(e, t, n) {
1191
+ function Xn(e, t, n) {
1187
1192
  if (t > n) {
1188
1193
  var r = t;
1189
1194
  t = n, n = r;
1190
1195
  }
1191
1196
  return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
1192
1197
  }
1193
- function Yn(e, t, n, r) {
1198
+ function Zn(e, t, n, r) {
1194
1199
  var i = {}, a = {}, o = {};
1195
1200
  return v(t, function(e) {
1196
1201
  v(e, function(e, t) {
@@ -1206,7 +1211,7 @@ function Yn(e, t, n, r) {
1206
1211
  });
1207
1212
  for (var c = (s.length - 1) / 2, l = Math.floor(c), u = Math.ceil(c); l <= u; ++l) {
1208
1213
  var d = s[l];
1209
- a[e] === e && t < o[d] && !Jn(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
1214
+ a[e] === e && t < o[d] && !Xn(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
1210
1215
  }
1211
1216
  }
1212
1217
  });
@@ -1215,8 +1220,8 @@ function Yn(e, t, n, r) {
1215
1220
  align: a
1216
1221
  };
1217
1222
  }
1218
- function Xn(e, t, n, r, i) {
1219
- var a = {}, o = Zn(e, t, n, i), s = i ? "borderLeft" : "borderRight";
1223
+ function Qn(e, t, n, r, i) {
1224
+ var a = {}, o = $n(e, t, n, i), s = i ? "borderLeft" : "borderRight";
1220
1225
  function c(e, t) {
1221
1226
  for (var n = o.nodes(), r = n.pop(), i = {}; r;) i[r] ? e(r) : (i[r] = !0, n.push(r), n = n.concat(t(r))), r = n.pop();
1222
1227
  }
@@ -1235,8 +1240,8 @@ function Xn(e, t, n, r, i) {
1235
1240
  a[e] = a[n[e]];
1236
1241
  }), a;
1237
1242
  }
1238
- function Zn(e, t, n, r) {
1239
- var i = new b(), a = e.graph(), o = nr(a.nodesep, a.edgesep, r);
1243
+ function $n(e, t, n, r) {
1244
+ var i = new b(), a = e.graph(), o = ir(a.nodesep, a.edgesep, r);
1240
1245
  return v(t, function(t) {
1241
1246
  var r;
1242
1247
  v(t, function(t) {
@@ -1249,51 +1254,51 @@ function Zn(e, t, n, r) {
1249
1254
  });
1250
1255
  }), i;
1251
1256
  }
1252
- function Qn(e, t) {
1257
+ function er(e, t) {
1253
1258
  return P(g(t), function(t) {
1254
1259
  var n = -Infinity, r = Infinity;
1255
- return ke(t, function(t, i) {
1256
- var a = rr(e, i) / 2;
1260
+ return je(t, function(t, i) {
1261
+ var a = ar(e, i) / 2;
1257
1262
  n = Math.max(t + a, n), r = Math.min(t - a, r);
1258
1263
  }), n - r;
1259
1264
  });
1260
1265
  }
1261
- function $n(e, t) {
1262
- var n = g(t), r = N(n), i = M(n);
1266
+ function tr(e, t) {
1267
+ var n = g(t), r = N(n), i = j(n);
1263
1268
  v(["u", "d"], function(n) {
1264
1269
  v(["l", "r"], function(a) {
1265
1270
  var o = n + a, s = e[o], c;
1266
1271
  if (s !== t) {
1267
1272
  var l = g(s);
1268
- c = a === "l" ? r - N(l) : i - M(l), c && (e[o] = A(s, function(e) {
1273
+ c = a === "l" ? r - N(l) : i - j(l), c && (e[o] = k(s, function(e) {
1269
1274
  return e + c;
1270
1275
  }));
1271
1276
  }
1272
1277
  });
1273
1278
  });
1274
1279
  }
1275
- function er(e, t) {
1276
- return A(e.ul, function(n, r) {
1280
+ function nr(e, t) {
1281
+ return k(e.ul, function(n, r) {
1277
1282
  if (t) return e[t.toLowerCase()][r];
1278
- var i = R(E(e, r));
1283
+ var i = R(T(e, r));
1279
1284
  return (i[1] + i[2]) / 2;
1280
1285
  });
1281
1286
  }
1282
- function tr(e) {
1283
- var t = U(e), n = C(Wn(e, t), Gn(e, t)), r = {}, i;
1287
+ function rr(e) {
1288
+ var t = U(e), n = M(Kn(e, t), qn(e, t)), r = {}, i;
1284
1289
  return v(["u", "d"], function(a) {
1285
1290
  i = a === "u" ? t : g(t).reverse(), v(["l", "r"], function(t) {
1286
- t === "r" && (i = E(i, function(e) {
1291
+ t === "r" && (i = T(i, function(e) {
1287
1292
  return g(e).reverse();
1288
1293
  }));
1289
- var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = Yn(e, i, n, o), c = Xn(e, i, s.root, s.align, t === "r");
1290
- t === "r" && (c = A(c, function(e) {
1294
+ var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = Zn(e, i, n, o), c = Qn(e, i, s.root, s.align, t === "r");
1295
+ t === "r" && (c = k(c, function(e) {
1291
1296
  return -e;
1292
1297
  })), r[a + t] = c;
1293
1298
  });
1294
- }), $n(r, Qn(e, r)), er(r, e.graph().align);
1299
+ }), tr(r, er(e, r)), nr(r, e.graph().align);
1295
1300
  }
1296
- function nr(e, t, n) {
1301
+ function ir(e, t, n) {
1297
1302
  return function(r, i, a) {
1298
1303
  var o = r.node(i), s = r.node(a), c = 0, l;
1299
1304
  if (c += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos")) switch (o.labelpos.toLowerCase()) {
@@ -1311,20 +1316,20 @@ function nr(e, t, n) {
1311
1316
  return l && (c += n ? l : -l), l = 0, c;
1312
1317
  };
1313
1318
  }
1314
- function rr(e, t) {
1319
+ function ar(e, t) {
1315
1320
  return e.node(t).width;
1316
1321
  }
1317
1322
  //#endregion
1318
1323
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/index.js
1319
- function ir(e) {
1320
- e = Dt(e), ar(e), Ae(tr(e), function(t, n) {
1324
+ function or(e) {
1325
+ e = kt(e), sr(e), Me(rr(e), function(t, n) {
1321
1326
  e.node(n).x = t;
1322
1327
  });
1323
1328
  }
1324
- function ar(e) {
1329
+ function sr(e) {
1325
1330
  var t = U(e), n = e.graph().ranksep, r = 0;
1326
1331
  v(t, function(t) {
1327
- var i = M(E(t, function(t) {
1332
+ var i = j(T(t, function(t) {
1328
1333
  return e.node(t).height;
1329
1334
  }));
1330
1335
  v(t, function(t) {
@@ -1334,17 +1339,17 @@ function ar(e) {
1334
1339
  }
1335
1340
  //#endregion
1336
1341
  //#region ../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/layout.js
1337
- function or(e, t) {
1338
- var n = t && t.debugTiming ? Pt : Ft;
1342
+ function cr(e, t) {
1343
+ var n = t && t.debugTiming ? It : Lt;
1339
1344
  n("layout", () => {
1340
- var t = n(" buildLayoutGraph", () => _r(e));
1341
- n(" runLayout", () => sr(t, n)), n(" updateInputGraph", () => cr(e, t));
1345
+ var t = n(" buildLayoutGraph", () => yr(e));
1346
+ n(" runLayout", () => lr(t, n)), n(" updateInputGraph", () => ur(e, t));
1342
1347
  });
1343
1348
  }
1344
- function sr(e, t) {
1345
- t(" makeSpaceForEdgeLabels", () => vr(e)), t(" removeSelfEdges", () => Dr(e)), t(" acyclic", () => Ct(e)), t(" nestingGraph.run", () => gn(e)), t(" rank", () => fn(Dt(e))), t(" injectEdgeLabelProxies", () => yr(e)), t(" removeEmptyRanks", () => At(e)), t(" nestingGraph.cleanup", () => bn(e)), t(" normalizeRanks", () => kt(e)), t(" assignRankMinMax", () => br(e)), t(" removeEdgeLabelProxies", () => xr(e)), t(" normalize.run", () => Wt(e)), t(" parentDummyChains", () => Vn(e)), t(" addBorderSegments", () => It(e)), t(" order", () => Ln(e)), t(" insertSelfEdges", () => Or(e)), t(" adjustCoordinateSystem", () => Rt(e)), t(" position", () => ir(e)), t(" positionSelfEdges", () => kr(e)), t(" removeBorderNodes", () => Er(e)), t(" normalize.undo", () => Kt(e)), t(" fixupEdgeLabelCoords", () => wr(e)), t(" undoCoordinateSystem", () => zt(e)), t(" translateGraph", () => Sr(e)), t(" assignNodeIntersects", () => Cr(e)), t(" reversePoints", () => Tr(e)), t(" acyclic.undo", () => Tt(e));
1349
+ function lr(e, t) {
1350
+ t(" makeSpaceForEdgeLabels", () => br(e)), t(" removeSelfEdges", () => kr(e)), t(" acyclic", () => Tt(e)), t(" nestingGraph.run", () => vn(e)), t(" rank", () => mn(kt(e))), t(" injectEdgeLabelProxies", () => xr(e)), t(" removeEmptyRanks", () => Mt(e)), t(" nestingGraph.cleanup", () => Sn(e)), t(" normalizeRanks", () => jt(e)), t(" assignRankMinMax", () => Sr(e)), t(" removeEdgeLabelProxies", () => Cr(e)), t(" normalize.run", () => Kt(e)), t(" parentDummyChains", () => Un(e)), t(" addBorderSegments", () => Rt(e)), t(" order", () => zn(e)), t(" insertSelfEdges", () => Ar(e)), t(" adjustCoordinateSystem", () => Bt(e)), t(" position", () => or(e)), t(" positionSelfEdges", () => jr(e)), t(" removeBorderNodes", () => Or(e)), t(" normalize.undo", () => Jt(e)), t(" fixupEdgeLabelCoords", () => Er(e)), t(" undoCoordinateSystem", () => Vt(e)), t(" translateGraph", () => wr(e)), t(" assignNodeIntersects", () => Tr(e)), t(" reversePoints", () => Dr(e)), t(" acyclic.undo", () => Dt(e));
1346
1351
  }
1347
- function cr(e, t) {
1352
+ function ur(e, t) {
1348
1353
  v(e.nodes(), function(n) {
1349
1354
  var r = e.node(n), i = t.node(n);
1350
1355
  r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
@@ -1353,60 +1358,60 @@ function cr(e, t) {
1353
1358
  r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
1354
1359
  }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
1355
1360
  }
1356
- var lr = [
1361
+ var dr = [
1357
1362
  "nodesep",
1358
1363
  "edgesep",
1359
1364
  "ranksep",
1360
1365
  "marginx",
1361
1366
  "marginy"
1362
- ], ur = {
1367
+ ], fr = {
1363
1368
  ranksep: 50,
1364
1369
  edgesep: 20,
1365
1370
  nodesep: 50,
1366
1371
  rankdir: "tb"
1367
- }, dr = [
1372
+ }, pr = [
1368
1373
  "acyclicer",
1369
1374
  "ranker",
1370
1375
  "rankdir",
1371
1376
  "align"
1372
- ], fr = ["width", "height"], pr = {
1377
+ ], mr = ["width", "height"], hr = {
1373
1378
  width: 0,
1374
1379
  height: 0
1375
- }, mr = [
1380
+ }, gr = [
1376
1381
  "minlen",
1377
1382
  "weight",
1378
1383
  "width",
1379
1384
  "height",
1380
1385
  "labeloffset"
1381
- ], hr = {
1386
+ ], _r = {
1382
1387
  minlen: 1,
1383
1388
  weight: 1,
1384
1389
  width: 0,
1385
1390
  height: 0,
1386
1391
  labeloffset: 10,
1387
1392
  labelpos: "r"
1388
- }, gr = ["labelpos"];
1389
- function _r(e) {
1393
+ }, vr = ["labelpos"];
1394
+ function yr(e) {
1390
1395
  var t = new b({
1391
1396
  multigraph: !0,
1392
1397
  compound: !0
1393
1398
  }), n = $(e.graph());
1394
- return t.setGraph(C({}, ur, Q(n, lr), T(n, dr))), v(e.nodes(), function(n) {
1399
+ return t.setGraph(M({}, fr, Q(n, dr), w(n, pr))), v(e.nodes(), function(n) {
1395
1400
  var r = $(e.node(n));
1396
- t.setNode(n, Te(Q(r, fr), pr)), t.setParent(n, e.parent(n));
1401
+ t.setNode(n, De(Q(r, mr), hr)), t.setParent(n, e.parent(n));
1397
1402
  }), v(e.edges(), function(n) {
1398
1403
  var r = $(e.edge(n));
1399
- t.setEdge(n, C({}, hr, Q(r, mr), T(r, gr)));
1404
+ t.setEdge(n, M({}, _r, Q(r, gr), w(r, vr)));
1400
1405
  }), t;
1401
1406
  }
1402
- function vr(e) {
1407
+ function br(e) {
1403
1408
  var t = e.graph();
1404
1409
  t.ranksep /= 2, v(e.edges(), function(n) {
1405
1410
  var r = e.edge(n);
1406
1411
  r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
1407
1412
  });
1408
1413
  }
1409
- function yr(e) {
1414
+ function xr(e) {
1410
1415
  v(e.edges(), function(t) {
1411
1416
  var n = e.edge(t);
1412
1417
  if (n.width && n.height) {
@@ -1418,20 +1423,20 @@ function yr(e) {
1418
1423
  }
1419
1424
  });
1420
1425
  }
1421
- function br(e) {
1426
+ function Sr(e) {
1422
1427
  var t = 0;
1423
1428
  v(e.nodes(), function(n) {
1424
1429
  var r = e.node(n);
1425
- r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = M(t, r.maxRank));
1430
+ r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = j(t, r.maxRank));
1426
1431
  }), e.graph().maxRank = t;
1427
1432
  }
1428
- function xr(e) {
1433
+ function Cr(e) {
1429
1434
  v(e.nodes(), function(t) {
1430
1435
  var n = e.node(t);
1431
1436
  n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
1432
1437
  });
1433
1438
  }
1434
- function Sr(e) {
1439
+ function wr(e) {
1435
1440
  var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
1436
1441
  function c(e) {
1437
1442
  var a = e.x, o = e.y, s = e.width, c = e.height;
@@ -1452,13 +1457,13 @@ function Sr(e) {
1452
1457
  }), Object.prototype.hasOwnProperty.call(i, "x") && (i.x -= t), Object.prototype.hasOwnProperty.call(i, "y") && (i.y -= r);
1453
1458
  }), a.width = n - t + o, a.height = i - r + s;
1454
1459
  }
1455
- function Cr(e) {
1460
+ function Tr(e) {
1456
1461
  v(e.edges(), function(t) {
1457
1462
  var n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
1458
- n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(Ot(r, a)), n.points.push(Ot(i, o));
1463
+ n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(At(r, a)), n.points.push(At(i, o));
1459
1464
  });
1460
1465
  }
1461
- function wr(e) {
1466
+ function Er(e) {
1462
1467
  v(e.edges(), function(t) {
1463
1468
  var n = e.edge(t);
1464
1469
  if (Object.prototype.hasOwnProperty.call(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
@@ -1469,23 +1474,23 @@ function wr(e) {
1469
1474
  }
1470
1475
  });
1471
1476
  }
1472
- function Tr(e) {
1477
+ function Dr(e) {
1473
1478
  v(e.edges(), function(t) {
1474
1479
  var n = e.edge(t);
1475
1480
  n.reversed && n.points.reverse();
1476
1481
  });
1477
1482
  }
1478
- function Er(e) {
1483
+ function Or(e) {
1479
1484
  v(e.nodes(), function(t) {
1480
1485
  if (e.children(t).length) {
1481
- var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(O(n.borderLeft)), o = e.node(O(n.borderRight));
1486
+ var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(D(n.borderLeft)), o = e.node(D(n.borderRight));
1482
1487
  n.width = Math.abs(o.x - a.x), n.height = Math.abs(i.y - r.y), n.x = a.x + n.width / 2, n.y = r.y + n.height / 2;
1483
1488
  }
1484
1489
  }), v(e.nodes(), function(t) {
1485
1490
  e.node(t).dummy === "border" && e.removeNode(t);
1486
1491
  });
1487
1492
  }
1488
- function Dr(e) {
1493
+ function kr(e) {
1489
1494
  v(e.edges(), function(t) {
1490
1495
  if (t.v === t.w) {
1491
1496
  var n = e.node(t.v);
@@ -1496,7 +1501,7 @@ function Dr(e) {
1496
1501
  }
1497
1502
  });
1498
1503
  }
1499
- function Or(e) {
1504
+ function Ar(e) {
1500
1505
  var t = U(e);
1501
1506
  v(t, function(t) {
1502
1507
  var n = 0;
@@ -1515,7 +1520,7 @@ function Or(e) {
1515
1520
  });
1516
1521
  });
1517
1522
  }
1518
- function kr(e) {
1523
+ function jr(e) {
1519
1524
  v(e.nodes(), function(t) {
1520
1525
  var n = e.node(t);
1521
1526
  if (n.dummy === "selfedge") {
@@ -1546,7 +1551,7 @@ function kr(e) {
1546
1551
  });
1547
1552
  }
1548
1553
  function Q(e, t) {
1549
- return A(T(e, t), Number);
1554
+ return k(w(e, t), Number);
1550
1555
  }
1551
1556
  function $(e) {
1552
1557
  var t = {};
@@ -1555,4 +1560,4 @@ function $(e) {
1555
1560
  }), t;
1556
1561
  }
1557
1562
  //#endregion
1558
- export { or as t };
1563
+ export { cr as t };