@fibery/custom-app-text-editor 1.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (105) hide show
  1. package/LICENSE +214 -0
  2. package/README.md +33 -0
  3. package/lib/abnfDiagram-VRR7QNED-BgjOQqEh.js +89 -0
  4. package/lib/arc-Dp0rqagO.js +82 -0
  5. package/lib/architecture-TIHT7OUA-DDwCCw0y.js +3 -0
  6. package/lib/architectureDiagram-ZJ3FMSHR-BucIluTN.js +4129 -0
  7. package/lib/array-CApNbSU9.js +6 -0
  8. package/lib/blockDiagram-677ZJIJ3-CWYuHThP.js +3157 -0
  9. package/lib/c4Diagram-LMCZKHZV-Cr3_W-xe.js +2982 -0
  10. package/lib/channel-Bb7a6w5c.js +5 -0
  11. package/lib/chunk-2Q5K7J3B-CINvUK-A.js +15 -0
  12. package/lib/chunk-32BRIVSS-b-BvyGz0.js +61 -0
  13. package/lib/chunk-52WLFC77-Cf8zEoqs.js +593 -0
  14. package/lib/chunk-5VM5RSS4-Dnx15xMv.js +5 -0
  15. package/lib/chunk-7BUUIJ7U-B018BbRy.js +82 -0
  16. package/lib/chunk-C7G6YPKG-CmOuVFlJ.js +67 -0
  17. package/lib/chunk-EX3LRPZG-LynZw14I.js +2042 -0
  18. package/lib/chunk-HOUHSVGY-Br7ZSMKe.js +275 -0
  19. package/lib/chunk-ICXQ74PX-VqT5WUTt.js +1330 -0
  20. package/lib/chunk-JWPE2WC7-Ch0jmUXM.js +8 -0
  21. package/lib/chunk-KEIR6QF5-RwFi50en.js +21456 -0
  22. package/lib/chunk-MOJQB5TN-rQ4AfTd9.js +490 -0
  23. package/lib/chunk-OGEWGWER-BvF6eV9Q.js +32 -0
  24. package/lib/chunk-PUDLZKDR-BW7SZvCB.js +4135 -0
  25. package/lib/chunk-Q4XR5HBZ-CRgGP3ez.js +1635 -0
  26. package/lib/chunk-RYQCIY6F-CHlASUpG.js +241 -0
  27. package/lib/chunk-V7JOEXUC-OY39ml6X.js +3357 -0
  28. package/lib/chunk-VR4S4FIN-Bk7IFdYB.js +26 -0
  29. package/lib/chunk-WYO6CB5R-MV-yOaop.js +3769 -0
  30. package/lib/chunk-XXDRQBXY-Djd1ChwJ.js +9 -0
  31. package/lib/chunk-Y2CYZVJY-QdJ4V9rh.js +12 -0
  32. package/lib/chunk-ZGVPDNZ5-l81xl1BI.js +3738 -0
  33. package/lib/classDiagram-OUVF2IWQ--wRzSvLt.js +30 -0
  34. package/lib/classDiagram-v2-EOCWNBFH-ChMCdPO-.js +30 -0
  35. package/lib/cose-bilkent-JH36ORCC-CyVZn5M3.js +2254 -0
  36. package/lib/custom-app-text-editor.css +2 -0
  37. package/lib/custom-app-text-editor.js +81102 -0
  38. package/lib/cynefin-VYW2F7L2-CMgnLl46.js +3 -0
  39. package/lib/cynefinDiagram-TSTJHNR4-988Y73wV.js +355 -0
  40. package/lib/cytoscape.esm-DMXbtFI-.js +18145 -0
  41. package/lib/dagre-Dmarb1s8.js +1699 -0
  42. package/lib/dagre-VKFMJZFB-Bf-pz2Lx.js +328 -0
  43. package/lib/defaultLocale-A87O3snN.js +198 -0
  44. package/lib/diagram-FQU43EPY-BT8WeVzc.js +432 -0
  45. package/lib/diagram-G47NLZAW-vZ2XG37l.js +527 -0
  46. package/lib/diagram-NH7WQ7WH-CH0IfHB0.js +134 -0
  47. package/lib/diagram-OA4YK3LP-BgwQcJfp.js +300 -0
  48. package/lib/diagram-WEI45ONY-Cd3sVPil.js +214 -0
  49. package/lib/dist-PGS6ynRO.js +59 -0
  50. package/lib/ebnfDiagram-CCIWWBDH-CwBFb2Fm.js +100 -0
  51. package/lib/erDiagram-Q63AITRT-BshRACvj.js +1727 -0
  52. package/lib/eventmodeling-45OFAUF4-BDhzj03B.js +3 -0
  53. package/lib/flowDiagram-23GEKE2U-C3zDgFvZ.js +16 -0
  54. package/lib/ganttDiagram-NO4QXBWP-BD5PiE8x.js +3073 -0
  55. package/lib/gitGraph-TEB2WS4Q-DJA_hE4G.js +3 -0
  56. package/lib/gitGraphDiagram-IHSO6WYX-BAhccBh3.js +733 -0
  57. package/lib/graphlib-DglfpsVp.js +1267 -0
  58. package/lib/index.browser-Dv9K8IAp.js +26 -0
  59. package/lib/info-DKCQHKI2-BD_vOCz6.js +3 -0
  60. package/lib/infoDiagram-FWYZ7A6U-CGZnf03G.js +20 -0
  61. package/lib/init-sjaVZO3f.js +13 -0
  62. package/lib/ishikawaDiagram-FXEZZL3T-PFfVM0NO.js +719 -0
  63. package/lib/journeyDiagram-5HDEW3XC-CRGz7dcx.js +884 -0
  64. package/lib/kanban-definition-HUTT4EX6-BBH4Yn5e.js +974 -0
  65. package/lib/line-CJQicKfr.js +34 -0
  66. package/lib/linear-B9Cv96-J.js +288 -0
  67. package/lib/map-C7KALUOH.js +241 -0
  68. package/lib/mermaid-parser.core-BupC9XGF.js +638 -0
  69. package/lib/mermaid-renderer-Cp0xusfR.js +2425 -0
  70. package/lib/mindmap-definition-LN4V7U3C-CWL1sg0K.js +978 -0
  71. package/lib/ordinal-CNQzPcrr.js +65 -0
  72. package/lib/packet-7NZHBO7P-CgBlALV1.js +3 -0
  73. package/lib/path-DVvH25eQ.js +84 -0
  74. package/lib/pegDiagram-2B236MQR-BKv8dTtv.js +94 -0
  75. package/lib/pie-RZYD4A2V-CryPC-P_.js +3 -0
  76. package/lib/pieDiagram-ENE6RG2P-CXeFg_cL.js +203 -0
  77. package/lib/quadrantDiagram-ABIIQ3AL-v_u3aC8Y.js +2001 -0
  78. package/lib/radar-I7S5WNFK-DgzJDRy3.js +3 -0
  79. package/lib/railroad-3IZDKUUU-DFp3mbpB.js +3 -0
  80. package/lib/railroad-abnf-AHOZXSZD-BRjidKH0.js +3 -0
  81. package/lib/railroad-ebnf-EBAXGLYW-PgrDWact.js +3 -0
  82. package/lib/railroad-peg-LSFZ7HO6-CMKir81Y.js +3 -0
  83. package/lib/railroadDiagram-RFXS5EU6-mEC9tVS-.js +76 -0
  84. package/lib/requirementDiagram-TGXJPOKE-BAEzI7V4.js +2223 -0
  85. package/lib/rolldown-runtime-DArdT4gl.js +23 -0
  86. package/lib/rough.esm-B2w_aYoc.js +1361 -0
  87. package/lib/sankeyDiagram-HTMAVEWB-Dbu-sl2E.js +972 -0
  88. package/lib/sequenceDiagram-DBY2YBRQ-DCuWmWHX.js +4156 -0
  89. package/lib/sizeCapture-X5ZJPWSS-BEIM84He.js +46 -0
  90. package/lib/src-DQbL46sB.js +2139 -0
  91. package/lib/src-DuuHKEe6.js +704 -0
  92. package/lib/stateDiagram-2N3HPSRC-fs9QmDMR.js +220 -0
  93. package/lib/stateDiagram-v2-6OUMAXLB-wWxYbttN.js +30 -0
  94. package/lib/swimlanes-5IMT3BWC-QaXUd9db.js +5069 -0
  95. package/lib/swimlanesDiagram-G3AALYLV-BtGToCzH.js +30 -0
  96. package/lib/timeline-definition-FHXFAJF6-CAsyJrsw.js +1069 -0
  97. package/lib/treeView-QDETBFTQ-DVp4aTZQ.js +3 -0
  98. package/lib/treemap-6X3UGDF4-BbBnHMHJ.js +3 -0
  99. package/lib/types.d.ts +44 -0
  100. package/lib/v4-CZv9Hsqq.js +33 -0
  101. package/lib/vennDiagram-L72KCM5P-C87u0gjr.js +1880 -0
  102. package/lib/wardley-OPB4EBWU-B-RXhnoN.js +3 -0
  103. package/lib/wardleyDiagram-EHGQE667-BxviBDl_.js +645 -0
  104. package/lib/xychartDiagram-FW5EYKEG-BQQhanuH.js +2098 -0
  105. package/package.json +29 -0
@@ -0,0 +1,1699 @@
1
+ import { $ as e, A as t, B as n, C as r, D as i, E as a, F as o, H as s, I as c, J as l, K as u, L as d, N as f, O as p, Q as m, S as h, T as g, U as _, V as v, W as ee, X as y, Y as te, Z as b, _ as ne, a as x, c as re, d as ie, et as S, f as C, h as ae, i as w, it as oe, k as se, m as ce, n as T, nt as le, o as E, p as ue, r as D, s as de, t as O, tt as fe, u as pe, z as me } from "./graphlib-DglfpsVp.js";
2
+ import { a as he, c as k, d as ge, f as _e, i as ve, l as ye, n as be, o as xe, r as Se, s as Ce, t as A, u as we } from "./map-C7KALUOH.js";
3
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_trimmedEndIndex.js
4
+ var Te = /\s/;
5
+ function Ee(e) {
6
+ for (var t = e.length; t-- && Te.test(e.charAt(t)););
7
+ return t;
8
+ }
9
+ //#endregion
10
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseTrim.js
11
+ var De = /^\s+/;
12
+ function Oe(e) {
13
+ return e && e.slice(0, Ee(e) + 1).replace(De, "");
14
+ }
15
+ //#endregion
16
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toNumber.js
17
+ var ke = NaN, Ae = /^[-+]0x[0-9a-f]+$/i, je = /^0b[01]+$/i, Me = /^0o[0-7]+$/i, Ne = parseInt;
18
+ function Pe(e) {
19
+ if (typeof e == "number") return e;
20
+ if (S(e)) return ke;
21
+ if (b(e)) {
22
+ var t = typeof e.valueOf == "function" ? e.valueOf() : e;
23
+ e = b(t) ? t + "" : t;
24
+ }
25
+ if (typeof e != "string") return e === 0 ? e : +e;
26
+ e = Oe(e);
27
+ var n = je.test(e);
28
+ return n || Me.test(e) ? Ne(e.slice(2), n ? 2 : 8) : Ae.test(e) ? ke : +e;
29
+ }
30
+ //#endregion
31
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toFinite.js
32
+ var Fe = 1 / 0, Ie = 17976931348623157e292;
33
+ function j(e) {
34
+ return e ? (e = Pe(e), e === Fe || e === -Fe ? (e < 0 ? -1 : 1) * Ie : e === e ? e : 0) : e === 0 ? e : 0;
35
+ }
36
+ //#endregion
37
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toInteger.js
38
+ function Le(e) {
39
+ var t = j(e), n = t % 1;
40
+ return t === t ? n ? t - n : t : 0;
41
+ }
42
+ //#endregion
43
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isIterateeCall.js
44
+ function M(e, t, n) {
45
+ if (!b(n)) return !1;
46
+ var r = typeof t;
47
+ return (r == "number" ? me(n) && _(t, n.length) : r == "string" && t in n) ? s(n[t], e) : !1;
48
+ }
49
+ //#endregion
50
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createAssigner.js
51
+ function Re(e) {
52
+ return n(function(t, n) {
53
+ var r = -1, i = n.length, a = i > 1 ? n[i - 1] : void 0, o = i > 2 ? n[2] : void 0;
54
+ for (a = e.length > 3 && typeof a == "function" ? (i--, a) : void 0, o && M(n[0], n[1], o) && (a = i < 3 ? void 0 : a, i = 1), t = Object(t); ++r < i;) {
55
+ var s = n[r];
56
+ s && e(t, s, r, a);
57
+ }
58
+ return t;
59
+ });
60
+ }
61
+ //#endregion
62
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/flatten.js
63
+ function N(e) {
64
+ return e != null && e.length ? r(e, 1) : [];
65
+ }
66
+ //#endregion
67
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_flatRest.js
68
+ function ze(e) {
69
+ return u(v(e, void 0, N), e + "");
70
+ }
71
+ //#endregion
72
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isPlainObject.js
73
+ var Be = "[object Object]", Ve = Function.prototype, He = Object.prototype, Ue = Ve.toString, We = He.hasOwnProperty, Ge = Ue.call(Object);
74
+ function Ke(e) {
75
+ if (!fe(e) || le(e) != Be) return !1;
76
+ var t = Ce(e);
77
+ if (t === null) return !0;
78
+ var n = We.call(t, "constructor") && t.constructor;
79
+ return typeof n == "function" && n instanceof n && Ue.call(n) == Ge;
80
+ }
81
+ //#endregion
82
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hasUnicode.js
83
+ var qe = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
84
+ function Je(e) {
85
+ return qe.test(e);
86
+ }
87
+ //#endregion
88
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/cloneDeep.js
89
+ var Ye = 1, Xe = 4;
90
+ function Ze(e) {
91
+ return Se(e, Ye | Xe);
92
+ }
93
+ //#endregion
94
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/now.js
95
+ var Qe = function() {
96
+ return oe.Date.now();
97
+ }, $e = Object.prototype, et = $e.hasOwnProperty, tt = n(function(e, t) {
98
+ e = Object(e);
99
+ var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
100
+ for (i && M(t[0], t[1], i) && (r = 1); ++n < r;) for (var a = t[n], o = k(a), c = -1, l = o.length; ++c < l;) {
101
+ var u = o[c], d = e[u];
102
+ (d === void 0 || s(d, $e[u]) && !et.call(e, u)) && (e[u] = a[u]);
103
+ }
104
+ return e;
105
+ });
106
+ //#endregion
107
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_assignMergeValue.js
108
+ function nt(e, t, n) {
109
+ (n !== void 0 && !s(e[t], n) || n === void 0 && !(t in e)) && ge(e, t, n);
110
+ }
111
+ //#endregion
112
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_safeGet.js
113
+ function rt(e, t) {
114
+ if ((t !== "constructor" || typeof e[t] != "function") && t != "__proto__") return e[t];
115
+ }
116
+ //#endregion
117
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toPlainObject.js
118
+ function it(e) {
119
+ return ye(e, k(e));
120
+ }
121
+ //#endregion
122
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseMergeDeep.js
123
+ function at(e, t, n, r, i, a, o) {
124
+ var s = rt(e, n), l = rt(t, n), u = o.get(l);
125
+ if (u) {
126
+ nt(e, n, u);
127
+ return;
128
+ }
129
+ var p = a ? a(s, l, n + "", e, t, o) : void 0, h = p === void 0;
130
+ if (h) {
131
+ var g = m(l), _ = !g && c(l), v = !g && !_ && f(l);
132
+ p = l, g || _ || v ? m(s) ? p = s : re(s) ? p = _e(s) : _ ? (h = !1, p = xe(l, !0)) : v ? (h = !1, p = he(l, !0)) : p = [] : Ke(l) || d(l) ? (p = s, d(s) ? p = it(s) : (!b(s) || te(s)) && (p = ve(l))) : h = !1;
133
+ }
134
+ h && (o.set(l, p), i(p, l, r, a, o), o.delete(l)), nt(e, n, p);
135
+ }
136
+ //#endregion
137
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseMerge.js
138
+ function ot(e, t, n, r, i) {
139
+ e !== t && ie(t, function(a, o) {
140
+ if (i ||= new h(), b(a)) at(e, t, o, n, ot, r, i);
141
+ else {
142
+ var s = r ? r(rt(e, o), a, o + "", e, t, i) : void 0;
143
+ s === void 0 && (s = a), nt(e, o, s);
144
+ }
145
+ }, k);
146
+ }
147
+ //#endregion
148
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/last.js
149
+ function P(e) {
150
+ var t = e == null ? 0 : e.length;
151
+ return t ? e[t - 1] : void 0;
152
+ }
153
+ //#endregion
154
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createFind.js
155
+ function st(e) {
156
+ return function(t, n, r) {
157
+ var i = Object(t);
158
+ if (!me(t)) {
159
+ var a = C(n, 3);
160
+ t = se(t), n = function(e) {
161
+ return a(i[e], e, i);
162
+ };
163
+ }
164
+ var o = e(t, n, r);
165
+ return o > -1 ? i[a ? t[o] : o] : void 0;
166
+ };
167
+ }
168
+ //#endregion
169
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/findIndex.js
170
+ var ct = Math.max;
171
+ function lt(e, t, n) {
172
+ var r = e == null ? 0 : e.length;
173
+ if (!r) return -1;
174
+ var i = n == null ? 0 : Le(n);
175
+ return i < 0 && (i = ct(r + i, 0)), ee(e, C(t, 3), i);
176
+ }
177
+ //#endregion
178
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/find.js
179
+ var F = st(lt);
180
+ //#endregion
181
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/forIn.js
182
+ function ut(e, t) {
183
+ return e == null ? e : ie(e, de(t), k);
184
+ }
185
+ //#endregion
186
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/forOwn.js
187
+ function dt(e, t) {
188
+ return e && pe(e, de(t));
189
+ }
190
+ //#endregion
191
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseGt.js
192
+ function ft(e, t) {
193
+ return e > t;
194
+ }
195
+ //#endregion
196
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseHas.js
197
+ var pt = Object.prototype.hasOwnProperty;
198
+ function mt(e, t) {
199
+ return e != null && pt.call(e, t);
200
+ }
201
+ //#endregion
202
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/has.js
203
+ function ht(e, t) {
204
+ return e != null && ae(e, t, mt);
205
+ }
206
+ //#endregion
207
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isString.js
208
+ var gt = "[object String]";
209
+ function _t(e) {
210
+ return typeof e == "string" || !m(e) && fe(e) && le(e) == gt;
211
+ }
212
+ //#endregion
213
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseLt.js
214
+ function vt(e, t) {
215
+ return e < t;
216
+ }
217
+ //#endregion
218
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/mapValues.js
219
+ function I(e, t) {
220
+ var n = {};
221
+ return t = C(t, 3), pe(e, function(e, r, i) {
222
+ ge(n, r, t(e, r, i));
223
+ }), n;
224
+ }
225
+ //#endregion
226
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseExtremum.js
227
+ function L(e, t, n) {
228
+ for (var r = -1, i = e.length; ++r < i;) {
229
+ var a = e[r], o = t(a);
230
+ if (o != null && (s === void 0 ? o === o && !S(o) : n(o, s))) var s = o, c = a;
231
+ }
232
+ return c;
233
+ }
234
+ //#endregion
235
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/max.js
236
+ function R(e) {
237
+ return e && e.length ? L(e, y, ft) : void 0;
238
+ }
239
+ //#endregion
240
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/merge.js
241
+ var z = Re(function(e, t, n) {
242
+ ot(e, t, n);
243
+ });
244
+ //#endregion
245
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/min.js
246
+ function B(e) {
247
+ return e && e.length ? L(e, y, vt) : void 0;
248
+ }
249
+ //#endregion
250
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/minBy.js
251
+ function V(e, t) {
252
+ return e && e.length ? L(e, C(t, 2), vt) : void 0;
253
+ }
254
+ //#endregion
255
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSet.js
256
+ function yt(e, t, n, r) {
257
+ if (!b(e)) return e;
258
+ t = i(t, e);
259
+ for (var o = -1, s = t.length, c = s - 1, l = e; l != null && ++o < s;) {
260
+ var u = a(t[o]), d = n;
261
+ if (u === "__proto__" || u === "constructor" || u === "prototype") return e;
262
+ if (o != c) {
263
+ var f = l[u];
264
+ d = r ? r(f, u, l) : void 0, d === void 0 && (d = b(f) ? f : _(t[o + 1]) ? [] : {});
265
+ }
266
+ we(l, u, d), l = l[u];
267
+ }
268
+ return e;
269
+ }
270
+ //#endregion
271
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_basePickBy.js
272
+ function bt(e, t, n) {
273
+ for (var r = -1, a = t.length, o = {}; ++r < a;) {
274
+ var s = t[r], c = g(e, s);
275
+ n(c, s) && yt(o, i(s, e), c);
276
+ }
277
+ return o;
278
+ }
279
+ //#endregion
280
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSortBy.js
281
+ function xt(e, t) {
282
+ var n = e.length;
283
+ for (e.sort(t); n--;) e[n] = e[n].value;
284
+ return e;
285
+ }
286
+ //#endregion
287
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_compareAscending.js
288
+ function St(e, t) {
289
+ if (e !== t) {
290
+ var n = e !== void 0, r = e === null, i = e === e, a = S(e), o = t !== void 0, s = t === null, c = t === t, l = S(t);
291
+ if (!s && !l && !a && e > t || a && o && c && !s && !l || r && o && c || !n && c || !i) return 1;
292
+ if (!r && !a && !l && e < t || l && n && i && !r && !a || s && n && i || !o && i || !c) return -1;
293
+ }
294
+ return 0;
295
+ }
296
+ //#endregion
297
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_compareMultiple.js
298
+ function Ct(e, t, n) {
299
+ for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
300
+ var c = St(i[r], a[r]);
301
+ if (c) return r >= s ? c : c * (n[r] == "desc" ? -1 : 1);
302
+ }
303
+ return e.index - t.index;
304
+ }
305
+ //#endregion
306
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseOrderBy.js
307
+ function wt(t, n, r) {
308
+ n = n.length ? e(n, function(e) {
309
+ return m(e) ? function(t) {
310
+ return g(t, e.length === 1 ? e[0] : e);
311
+ } : e;
312
+ }) : [y];
313
+ var i = -1;
314
+ return n = e(n, o(C)), xt(be(t, function(t, r, a) {
315
+ return {
316
+ criteria: e(n, function(e) {
317
+ return e(t);
318
+ }),
319
+ index: ++i,
320
+ value: t
321
+ };
322
+ }), function(e, t) {
323
+ return Ct(e, t, r);
324
+ });
325
+ }
326
+ //#endregion
327
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_asciiSize.js
328
+ var Tt = ue("length"), Et = "\\ud800-\\udfff", Dt = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", Ot = "\\ufe0e\\ufe0f", kt = "[" + Et + "]", H = "[" + Dt + "]", U = "\\ud83c[\\udffb-\\udfff]", At = "(?:" + H + "|" + U + ")", jt = "[^" + Et + "]", Mt = "(?:\\ud83c[\\udde6-\\uddff]){2}", Nt = "[\\ud800-\\udbff][\\udc00-\\udfff]", Pt = "\\u200d", Ft = At + "?", It = "[" + Ot + "]?", Lt = "(?:" + Pt + "(?:" + [
329
+ jt,
330
+ Mt,
331
+ Nt
332
+ ].join("|") + ")" + It + Ft + ")*", Rt = It + Ft + Lt, zt = "(?:" + [
333
+ jt + H + "?",
334
+ H,
335
+ Mt,
336
+ Nt,
337
+ kt
338
+ ].join("|") + ")", Bt = RegExp(U + "(?=" + U + ")|" + zt + Rt, "g");
339
+ function Vt(e) {
340
+ for (var t = Bt.lastIndex = 0; Bt.test(e);) ++t;
341
+ return t;
342
+ }
343
+ //#endregion
344
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stringSize.js
345
+ function Ht(e) {
346
+ return Je(e) ? Vt(e) : Tt(e);
347
+ }
348
+ //#endregion
349
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_basePick.js
350
+ function Ut(e, t) {
351
+ return bt(e, t, function(t, n) {
352
+ return ce(e, n);
353
+ });
354
+ }
355
+ //#endregion
356
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/pick.js
357
+ var W = ze(function(e, t) {
358
+ return e == null ? {} : Ut(e, t);
359
+ }), Wt = Math.ceil, Gt = Math.max;
360
+ function Kt(e, t, n, r) {
361
+ for (var i = -1, a = Gt(Wt((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
362
+ return o;
363
+ }
364
+ //#endregion
365
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createRange.js
366
+ function qt(e) {
367
+ return function(t, n, r) {
368
+ return r && typeof r != "number" && M(t, n, r) && (n = r = void 0), t = j(t), n === void 0 ? (n = t, t = 0) : n = j(n), r = r === void 0 ? t < n ? 1 : -1 : j(r), Kt(t, n, r, e);
369
+ };
370
+ }
371
+ //#endregion
372
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/range.js
373
+ var G = qt(), Jt = "[object Map]", Yt = "[object Set]";
374
+ function Xt(e) {
375
+ if (e == null) return 0;
376
+ if (me(e)) return _t(e) ? Ht(e) : e.length;
377
+ var n = ne(e);
378
+ return n == Jt || n == Yt ? e.size : t(e).length;
379
+ }
380
+ //#endregion
381
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/sortBy.js
382
+ var K = n(function(e, t) {
383
+ if (e == null) return [];
384
+ var n = t.length;
385
+ return n > 1 && M(e, t[0], t[1]) ? t = [] : n > 2 && M(t[0], t[1], t[2]) && (t = [t[0]]), wt(e, r(t, 1), []);
386
+ }), Zt = 0;
387
+ function q(e) {
388
+ var t = ++Zt;
389
+ return p(e) + t;
390
+ }
391
+ //#endregion
392
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseZipObject.js
393
+ function Qt(e, t, n) {
394
+ for (var r = -1, i = e.length, a = t.length, o = {}; ++r < i;) {
395
+ var s = r < a ? t[r] : void 0;
396
+ n(o, e[r], s);
397
+ }
398
+ return o;
399
+ }
400
+ //#endregion
401
+ //#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/zipObject.js
402
+ function $t(e, t) {
403
+ return Qt(e || [], t || [], we);
404
+ }
405
+ //#endregion
406
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/data/list.js
407
+ var en = class {
408
+ constructor() {
409
+ var e = {};
410
+ e._next = e._prev = e, this._sentinel = e;
411
+ }
412
+ dequeue() {
413
+ var e = this._sentinel, t = e._prev;
414
+ if (t !== e) return tn(t), t;
415
+ }
416
+ enqueue(e) {
417
+ var t = this._sentinel;
418
+ e._prev && e._next && tn(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
419
+ }
420
+ toString() {
421
+ for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, nn)), n = n._prev;
422
+ return "[" + e.join(", ") + "]";
423
+ }
424
+ };
425
+ function tn(e) {
426
+ e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
427
+ }
428
+ function nn(e, t) {
429
+ if (e !== "_next" && e !== "_prev") return t;
430
+ }
431
+ //#endregion
432
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/greedy-fas.js
433
+ var rn = l(1);
434
+ function an(e, t) {
435
+ if (e.nodeCount() <= 1) return [];
436
+ var n = sn(e, t || rn), r = on(n.graph, n.buckets, n.zeroIdx);
437
+ return N(A(r, function(t) {
438
+ return e.outEdges(t.v, t.w);
439
+ }));
440
+ }
441
+ function on(e, t, n) {
442
+ for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
443
+ for (; o = a.dequeue();) J(e, t, n, o);
444
+ for (; o = i.dequeue();) J(e, t, n, o);
445
+ if (e.nodeCount()) {
446
+ for (var s = t.length - 2; s > 0; --s) if (o = t[s].dequeue(), o) {
447
+ r = r.concat(J(e, t, n, o, !0));
448
+ break;
449
+ }
450
+ }
451
+ }
452
+ return r;
453
+ }
454
+ function J(e, t, n, r, i) {
455
+ var a = i ? [] : void 0;
456
+ return E(e.inEdges(r.v), function(r) {
457
+ var o = e.edge(r), s = e.node(r.v);
458
+ i && a.push({
459
+ v: r.v,
460
+ w: r.w
461
+ }), s.out -= o, cn(t, n, s);
462
+ }), E(e.outEdges(r.v), function(r) {
463
+ var i = e.edge(r), a = r.w, o = e.node(a);
464
+ o.in -= i, cn(t, n, o);
465
+ }), e.removeNode(r.v), a;
466
+ }
467
+ function sn(e, t) {
468
+ var n = new O(), r = 0, i = 0;
469
+ E(e.nodes(), function(e) {
470
+ n.setNode(e, {
471
+ v: e,
472
+ in: 0,
473
+ out: 0
474
+ });
475
+ }), E(e.edges(), function(e) {
476
+ var a = n.edge(e.v, e.w) || 0, o = t(e), s = a + o;
477
+ 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);
478
+ });
479
+ var a = G(i + r + 3).map(function() {
480
+ return new en();
481
+ }), o = r + 1;
482
+ return E(n.nodes(), function(e) {
483
+ cn(a, o, n.node(e));
484
+ }), {
485
+ graph: n,
486
+ buckets: a,
487
+ zeroIdx: o
488
+ };
489
+ }
490
+ function cn(e, t, n) {
491
+ n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
492
+ }
493
+ //#endregion
494
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/acyclic.js
495
+ function ln(e) {
496
+ var t = e.graph().acyclicer === "greedy" ? an(e, n(e)) : un(e);
497
+ E(t, function(t) {
498
+ var n = e.edge(t);
499
+ e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, q("rev"));
500
+ });
501
+ function n(e) {
502
+ return function(t) {
503
+ return e.edge(t).weight;
504
+ };
505
+ }
506
+ }
507
+ function un(e) {
508
+ var t = [], n = {}, r = {};
509
+ function i(a) {
510
+ Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, E(e.outEdges(a), function(e) {
511
+ Object.prototype.hasOwnProperty.call(n, e.w) ? t.push(e) : i(e.w);
512
+ }), delete n[a]);
513
+ }
514
+ return E(e.nodes(), i), t;
515
+ }
516
+ function dn(e) {
517
+ E(e.edges(), function(t) {
518
+ var n = e.edge(t);
519
+ if (n.reversed) {
520
+ e.removeEdge(t);
521
+ var r = n.forwardName;
522
+ delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
523
+ }
524
+ });
525
+ }
526
+ //#endregion
527
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/util.js
528
+ function Y(e, t, n, r) {
529
+ var i;
530
+ do
531
+ i = q(r);
532
+ while (e.hasNode(i));
533
+ return n.dummy = t, e.setNode(i, n), i;
534
+ }
535
+ function fn(e) {
536
+ var t = new O().setGraph(e.graph());
537
+ return E(e.nodes(), function(n) {
538
+ t.setNode(n, e.node(n));
539
+ }), E(e.edges(), function(n) {
540
+ var r = t.edge(n.v, n.w) || {
541
+ weight: 0,
542
+ minlen: 1
543
+ }, i = e.edge(n);
544
+ t.setEdge(n.v, n.w, {
545
+ weight: r.weight + i.weight,
546
+ minlen: Math.max(r.minlen, i.minlen)
547
+ });
548
+ }), t;
549
+ }
550
+ function pn(e) {
551
+ var t = new O({ multigraph: e.isMultigraph() }).setGraph(e.graph());
552
+ return E(e.nodes(), function(n) {
553
+ e.children(n).length || t.setNode(n, e.node(n));
554
+ }), E(e.edges(), function(n) {
555
+ t.setEdge(n, e.edge(n));
556
+ }), t;
557
+ }
558
+ function mn(e, t) {
559
+ var n = e.x, r = e.y, i = t.x - n, a = t.y - r, o = e.width / 2, s = e.height / 2;
560
+ if (!i && !a) throw Error("Not possible to find intersection inside of the rectangle");
561
+ var c, l;
562
+ return Math.abs(a) * o > Math.abs(i) * s ? (a < 0 && (s = -s), c = s * i / a, l = s) : (i < 0 && (o = -o), c = o, l = o * a / i), {
563
+ x: n + c,
564
+ y: r + l
565
+ };
566
+ }
567
+ function X(e) {
568
+ var t = A(G(vn(e) + 1), function() {
569
+ return [];
570
+ });
571
+ return E(e.nodes(), function(n) {
572
+ var r = e.node(n), i = r.rank;
573
+ D(i) || (t[i][r.order] = n);
574
+ }), t;
575
+ }
576
+ function hn(e) {
577
+ var t = B(A(e.nodes(), function(t) {
578
+ return e.node(t).rank;
579
+ }));
580
+ E(e.nodes(), function(n) {
581
+ var r = e.node(n);
582
+ ht(r, "rank") && (r.rank -= t);
583
+ });
584
+ }
585
+ function gn(e) {
586
+ var t = B(A(e.nodes(), function(t) {
587
+ return e.node(t).rank;
588
+ })), n = [];
589
+ E(e.nodes(), function(r) {
590
+ var i = e.node(r).rank - t;
591
+ n[i] || (n[i] = []), n[i].push(r);
592
+ });
593
+ var r = 0, i = e.graph().nodeRankFactor;
594
+ E(n, function(t, n) {
595
+ D(t) && n % i !== 0 ? --r : r && E(t, function(t) {
596
+ e.node(t).rank += r;
597
+ });
598
+ });
599
+ }
600
+ function _n(e, t, n, r) {
601
+ var i = {
602
+ width: 0,
603
+ height: 0
604
+ };
605
+ return arguments.length >= 4 && (i.rank = n, i.order = r), Y(e, "border", i, t);
606
+ }
607
+ function vn(e) {
608
+ return R(A(e.nodes(), function(t) {
609
+ var n = e.node(t).rank;
610
+ if (!D(n)) return n;
611
+ }));
612
+ }
613
+ function yn(e, t) {
614
+ var n = {
615
+ lhs: [],
616
+ rhs: []
617
+ };
618
+ return E(e, function(e) {
619
+ t(e) ? n.lhs.push(e) : n.rhs.push(e);
620
+ }), n;
621
+ }
622
+ function bn(e, t) {
623
+ var n = Qe();
624
+ try {
625
+ return t();
626
+ } finally {
627
+ console.log(e + " time: " + (Qe() - n) + "ms");
628
+ }
629
+ }
630
+ function xn(e, t) {
631
+ return t();
632
+ }
633
+ //#endregion
634
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/add-border-segments.js
635
+ function Sn(e) {
636
+ function t(n) {
637
+ var r = e.children(n), i = e.node(n);
638
+ if (r.length && E(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
639
+ i.borderLeft = [], i.borderRight = [];
640
+ for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) Cn(e, "borderLeft", "_bl", n, i, a), Cn(e, "borderRight", "_br", n, i, a);
641
+ }
642
+ }
643
+ E(e.children(), t);
644
+ }
645
+ function Cn(e, t, n, r, i, a) {
646
+ var o = {
647
+ width: 0,
648
+ height: 0,
649
+ rank: a,
650
+ borderType: t
651
+ }, s = i[t][a - 1], c = Y(e, "border", o, n);
652
+ i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
653
+ }
654
+ //#endregion
655
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/coordinate-system.js
656
+ function wn(e) {
657
+ var t = e.graph().rankdir.toLowerCase();
658
+ (t === "lr" || t === "rl") && En(e);
659
+ }
660
+ function Tn(e) {
661
+ var t = e.graph().rankdir.toLowerCase();
662
+ (t === "bt" || t === "rl") && On(e), (t === "lr" || t === "rl") && (An(e), En(e));
663
+ }
664
+ function En(e) {
665
+ E(e.nodes(), function(t) {
666
+ Dn(e.node(t));
667
+ }), E(e.edges(), function(t) {
668
+ Dn(e.edge(t));
669
+ });
670
+ }
671
+ function Dn(e) {
672
+ var t = e.width;
673
+ e.width = e.height, e.height = t;
674
+ }
675
+ function On(e) {
676
+ E(e.nodes(), function(t) {
677
+ kn(e.node(t));
678
+ }), E(e.edges(), function(t) {
679
+ var n = e.edge(t);
680
+ E(n.points, kn), Object.prototype.hasOwnProperty.call(n, "y") && kn(n);
681
+ });
682
+ }
683
+ function kn(e) {
684
+ e.y = -e.y;
685
+ }
686
+ function An(e) {
687
+ E(e.nodes(), function(t) {
688
+ jn(e.node(t));
689
+ }), E(e.edges(), function(t) {
690
+ var n = e.edge(t);
691
+ E(n.points, jn), Object.prototype.hasOwnProperty.call(n, "x") && jn(n);
692
+ });
693
+ }
694
+ function jn(e) {
695
+ var t = e.x;
696
+ e.x = e.y, e.y = t;
697
+ }
698
+ //#endregion
699
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/normalize.js
700
+ function Mn(e) {
701
+ e.graph().dummyChains = [], E(e.edges(), function(t) {
702
+ Nn(e, t);
703
+ });
704
+ }
705
+ function Nn(e, t) {
706
+ 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;
707
+ if (a !== r + 1) {
708
+ e.removeEdge(t);
709
+ var l = void 0, u, d;
710
+ for (d = 0, ++r; r < a; ++d, ++r) s.points = [], l = {
711
+ width: 0,
712
+ height: 0,
713
+ edgeLabel: s,
714
+ edgeObj: t,
715
+ rank: r
716
+ }, u = Y(e, "edge", l, "_d"), r === c && (l.width = s.width, l.height = s.height, l.dummy = "edge-label", l.labelpos = s.labelpos), e.setEdge(n, u, { weight: s.weight }, o), d === 0 && e.graph().dummyChains.push(u), n = u;
717
+ e.setEdge(n, i, { weight: s.weight }, o);
718
+ }
719
+ }
720
+ function Pn(e) {
721
+ E(e.graph().dummyChains, function(t) {
722
+ var n = e.node(t), r = n.edgeLabel, i;
723
+ for (e.setEdge(n.edgeObj, r); n.dummy;) i = e.successors(t)[0], e.removeNode(t), r.points.push({
724
+ x: n.x,
725
+ y: n.y
726
+ }), n.dummy === "edge-label" && (r.x = n.x, r.y = n.y, r.width = n.width, r.height = n.height), t = i, n = e.node(t);
727
+ });
728
+ }
729
+ //#endregion
730
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/util.js
731
+ function Fn(e) {
732
+ var t = {};
733
+ function n(r) {
734
+ var i = e.node(r);
735
+ if (Object.prototype.hasOwnProperty.call(t, r)) return i.rank;
736
+ t[r] = !0;
737
+ var a = B(A(e.outEdges(r), function(t) {
738
+ return n(t.w) - e.edge(t).minlen;
739
+ }));
740
+ return (a === Infinity || a == null) && (a = 0), i.rank = a;
741
+ }
742
+ E(e.sources(), n);
743
+ }
744
+ function Z(e, t) {
745
+ return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
746
+ }
747
+ //#endregion
748
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
749
+ function In(e) {
750
+ var t = new O({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
751
+ t.setNode(n, {});
752
+ for (var i, a; Ln(t, e) < r;) i = Rn(t, e), a = t.hasNode(i.v) ? Z(e, i) : -Z(e, i), zn(t, e, a);
753
+ return t;
754
+ }
755
+ function Ln(e, t) {
756
+ function n(r) {
757
+ E(t.nodeEdges(r), function(i) {
758
+ var a = i.v, o = r === a ? i.w : a;
759
+ !e.hasNode(o) && !Z(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
760
+ });
761
+ }
762
+ return E(e.nodes(), n), e.nodeCount();
763
+ }
764
+ function Rn(e, t) {
765
+ return V(t.edges(), function(n) {
766
+ if (e.hasNode(n.v) !== e.hasNode(n.w)) return Z(t, n);
767
+ });
768
+ }
769
+ function zn(e, t, n) {
770
+ E(e.nodes(), function(e) {
771
+ t.node(e).rank += n;
772
+ });
773
+ }
774
+ //#endregion
775
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
776
+ l(1), l(1), Bn.CycleException = Q;
777
+ function Bn(e) {
778
+ var t = {}, n = {}, r = [];
779
+ function i(a) {
780
+ if (Object.prototype.hasOwnProperty.call(n, a)) throw new Q();
781
+ Object.prototype.hasOwnProperty.call(t, a) || (n[a] = !0, t[a] = !0, E(e.predecessors(a), i), delete n[a], r.push(a));
782
+ }
783
+ if (E(e.sinks(), i), Xt(t) !== e.nodeCount()) throw new Q();
784
+ return r;
785
+ }
786
+ function Q() {}
787
+ Q.prototype = /* @__PURE__ */ Error();
788
+ //#endregion
789
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
790
+ function Vn(e, t, n) {
791
+ m(t) || (t = [t]);
792
+ var r = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], a = {};
793
+ return E(t, function(t) {
794
+ if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
795
+ Hn(e, t, n === "post", a, r, i);
796
+ }), i;
797
+ }
798
+ function Hn(e, t, n, r, i, a) {
799
+ Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), E(i(t), function(t) {
800
+ Hn(e, t, n, r, i, a);
801
+ }), n && a.push(t));
802
+ }
803
+ //#endregion
804
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
805
+ function Un(e, t) {
806
+ return Vn(e, t, "post");
807
+ }
808
+ //#endregion
809
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
810
+ function Wn(e, t) {
811
+ return Vn(e, t, "pre");
812
+ }
813
+ $.initLowLimValues = Jn, $.initCutValues = Gn, $.calcCutValue = qn, $.leaveEdge = Xn, $.enterEdge = Zn, $.exchangeEdges = Qn;
814
+ function $(e) {
815
+ e = fn(e), Fn(e);
816
+ var t = In(e);
817
+ Jn(t), Gn(t, e);
818
+ for (var n, r; n = Xn(t);) r = Zn(t, e, n), Qn(t, e, n, r);
819
+ }
820
+ function Gn(e, t) {
821
+ var n = Un(e, e.nodes());
822
+ n = n.slice(0, n.length - 1), E(n, function(n) {
823
+ Kn(e, t, n);
824
+ });
825
+ }
826
+ function Kn(e, t, n) {
827
+ var r = e.node(n).parent;
828
+ e.edge(n, r).cutvalue = qn(e, t, n);
829
+ }
830
+ function qn(e, t, n) {
831
+ var r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
832
+ return a ||= (i = !1, t.edge(r, n)), o = a.weight, E(t.nodeEdges(n), function(a) {
833
+ var s = a.v === n, c = s ? a.w : a.v;
834
+ if (c !== r) {
835
+ var l = s === i, u = t.edge(a).weight;
836
+ if (o += l ? u : -u, er(e, n, c)) {
837
+ var d = e.edge(n, c).cutvalue;
838
+ o += l ? -d : d;
839
+ }
840
+ }
841
+ }), o;
842
+ }
843
+ function Jn(e, t) {
844
+ arguments.length < 2 && (t = e.nodes()[0]), Yn(e, {}, 1, t);
845
+ }
846
+ function Yn(e, t, n, r, i) {
847
+ var a = n, o = e.node(r);
848
+ return t[r] = !0, E(e.neighbors(r), function(i) {
849
+ Object.prototype.hasOwnProperty.call(t, i) || (n = Yn(e, t, n, i, r));
850
+ }), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
851
+ }
852
+ function Xn(e) {
853
+ return F(e.edges(), function(t) {
854
+ return e.edge(t).cutvalue < 0;
855
+ });
856
+ }
857
+ function Zn(e, t, n) {
858
+ var r = n.v, i = n.w;
859
+ t.hasEdge(r, i) || (r = n.w, i = n.v);
860
+ var a = e.node(r), o = e.node(i), s = a, c = !1;
861
+ return a.lim > o.lim && (s = o, c = !0), V(x(t.edges(), function(t) {
862
+ return c === tr(e, e.node(t.v), s) && c !== tr(e, e.node(t.w), s);
863
+ }), function(e) {
864
+ return Z(t, e);
865
+ });
866
+ }
867
+ function Qn(e, t, n, r) {
868
+ var i = n.v, a = n.w;
869
+ e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), Jn(e), Gn(e, t), $n(e, t);
870
+ }
871
+ function $n(e, t) {
872
+ var n = Wn(e, F(e.nodes(), function(e) {
873
+ return !t.node(e).parent;
874
+ }));
875
+ n = n.slice(1), E(n, function(n) {
876
+ var r = e.node(n).parent, i = t.edge(n, r), a = !1;
877
+ i || (i = t.edge(r, n), a = !0), t.node(n).rank = t.node(r).rank + (a ? i.minlen : -i.minlen);
878
+ });
879
+ }
880
+ function er(e, t, n) {
881
+ return e.hasEdge(t, n);
882
+ }
883
+ function tr(e, t, n) {
884
+ return n.low <= t.lim && t.lim <= n.lim;
885
+ }
886
+ //#endregion
887
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/index.js
888
+ function nr(e) {
889
+ switch (e.graph().ranker) {
890
+ case "network-simplex":
891
+ ar(e);
892
+ break;
893
+ case "tight-tree":
894
+ ir(e);
895
+ break;
896
+ case "longest-path":
897
+ rr(e);
898
+ break;
899
+ default: ar(e);
900
+ }
901
+ }
902
+ var rr = Fn;
903
+ function ir(e) {
904
+ Fn(e), In(e);
905
+ }
906
+ function ar(e) {
907
+ $(e);
908
+ }
909
+ //#endregion
910
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/nesting-graph.js
911
+ function or(e) {
912
+ var t = Y(e, "root", {}, "_root"), n = cr(e), r = R(w(n)) - 1, i = 2 * r + 1;
913
+ e.graph().nestingRoot = t, E(e.edges(), function(t) {
914
+ e.edge(t).minlen *= i;
915
+ });
916
+ var a = lr(e) + 1;
917
+ E(e.children(), function(o) {
918
+ sr(e, t, i, a, r, n, o);
919
+ }), e.graph().nodeRankFactor = i;
920
+ }
921
+ function sr(e, t, n, r, i, a, o) {
922
+ var s = e.children(o);
923
+ if (!s.length) {
924
+ o !== t && e.setEdge(t, o, {
925
+ weight: 0,
926
+ minlen: n
927
+ });
928
+ return;
929
+ }
930
+ var c = _n(e, "_bt"), l = _n(e, "_bb"), u = e.node(o);
931
+ e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, E(s, function(s) {
932
+ sr(e, t, n, r, i, a, s);
933
+ 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;
934
+ e.setEdge(c, d, {
935
+ weight: p,
936
+ minlen: m,
937
+ nestingEdge: !0
938
+ }), e.setEdge(f, l, {
939
+ weight: p,
940
+ minlen: m,
941
+ nestingEdge: !0
942
+ });
943
+ }), e.parent(o) || e.setEdge(t, c, {
944
+ weight: 0,
945
+ minlen: i + a[o]
946
+ });
947
+ }
948
+ function cr(e) {
949
+ var t = {};
950
+ function n(r, i) {
951
+ var a = e.children(r);
952
+ a && a.length && E(a, function(e) {
953
+ n(e, i + 1);
954
+ }), t[r] = i;
955
+ }
956
+ return E(e.children(), function(e) {
957
+ n(e, 1);
958
+ }), t;
959
+ }
960
+ function lr(e) {
961
+ return T(e.edges(), function(t, n) {
962
+ return t + e.edge(n).weight;
963
+ }, 0);
964
+ }
965
+ function ur(e) {
966
+ var t = e.graph();
967
+ e.removeNode(t.nestingRoot), delete t.nestingRoot, E(e.edges(), function(t) {
968
+ e.edge(t).nestingEdge && e.removeEdge(t);
969
+ });
970
+ }
971
+ //#endregion
972
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
973
+ function dr(e, t, n) {
974
+ var r = {}, i;
975
+ E(n, function(n) {
976
+ for (var a = e.parent(n), o, s; a;) {
977
+ if (o = e.parent(a), o ? (s = r[o], r[o] = a) : (s = i, i = a), s && s !== a) {
978
+ t.setEdge(s, a);
979
+ return;
980
+ }
981
+ a = o;
982
+ }
983
+ });
984
+ }
985
+ //#endregion
986
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
987
+ function fr(e, t, n) {
988
+ var r = pr(e), i = new O({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
989
+ return e.node(t);
990
+ });
991
+ return E(e.nodes(), function(a) {
992
+ var o = e.node(a), s = e.parent(a);
993
+ (o.rank === t || o.minRank <= t && t <= o.maxRank) && (i.setNode(a), i.setParent(a, s || r), E(e[n](a), function(t) {
994
+ var n = t.v === a ? t.w : t.v, r = i.edge(n, a), o = D(r) ? 0 : r.weight;
995
+ i.setEdge(n, a, { weight: e.edge(t).weight + o });
996
+ }), Object.prototype.hasOwnProperty.call(o, "minRank") && i.setNode(a, {
997
+ borderLeft: o.borderLeft[t],
998
+ borderRight: o.borderRight[t]
999
+ }));
1000
+ }), i;
1001
+ }
1002
+ function pr(e) {
1003
+ for (var t; e.hasNode(t = q("_root")););
1004
+ return t;
1005
+ }
1006
+ //#endregion
1007
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/cross-count.js
1008
+ function mr(e, t) {
1009
+ for (var n = 0, r = 1; r < t.length; ++r) n += hr(e, t[r - 1], t[r]);
1010
+ return n;
1011
+ }
1012
+ function hr(e, t, n) {
1013
+ for (var r = $t(n, A(n, function(e, t) {
1014
+ return t;
1015
+ })), i = N(A(t, function(t) {
1016
+ return K(A(e.outEdges(t), function(t) {
1017
+ return {
1018
+ pos: r[t.w],
1019
+ weight: e.edge(t).weight
1020
+ };
1021
+ }), "pos");
1022
+ })), a = 1; a < n.length;) a <<= 1;
1023
+ var o = 2 * a - 1;
1024
+ --a;
1025
+ var s = A(Array(o), function() {
1026
+ return 0;
1027
+ }), c = 0;
1028
+ return E(i.forEach(function(e) {
1029
+ var t = e.pos + a;
1030
+ s[t] += e.weight;
1031
+ for (var n = 0; t > 0;) t % 2 && (n += s[t + 1]), t = t - 1 >> 1, s[t] += e.weight;
1032
+ c += e.weight * n;
1033
+ })), c;
1034
+ }
1035
+ //#endregion
1036
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/init-order.js
1037
+ function gr(e) {
1038
+ var t = {}, n = x(e.nodes(), function(t) {
1039
+ return !e.children(t).length;
1040
+ }), r = R(A(n, function(t) {
1041
+ return e.node(t).rank;
1042
+ })), i = A(G(r + 1), function() {
1043
+ return [];
1044
+ });
1045
+ function a(n) {
1046
+ ht(t, n) || (t[n] = !0, i[e.node(n).rank].push(n), E(e.successors(n), a));
1047
+ }
1048
+ var o = K(n, function(t) {
1049
+ return e.node(t).rank;
1050
+ });
1051
+ return E(o, a), i;
1052
+ }
1053
+ //#endregion
1054
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/barycenter.js
1055
+ function _r(e, t) {
1056
+ return A(t, function(t) {
1057
+ var n = e.inEdges(t);
1058
+ if (n.length) {
1059
+ var r = T(n, function(t, n) {
1060
+ var r = e.edge(n), i = e.node(n.v);
1061
+ return {
1062
+ sum: t.sum + r.weight * i.order,
1063
+ weight: t.weight + r.weight
1064
+ };
1065
+ }, {
1066
+ sum: 0,
1067
+ weight: 0
1068
+ });
1069
+ return {
1070
+ v: t,
1071
+ barycenter: r.sum / r.weight,
1072
+ weight: r.weight
1073
+ };
1074
+ }
1075
+ return { v: t };
1076
+ });
1077
+ }
1078
+ //#endregion
1079
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
1080
+ function vr(e, t) {
1081
+ var n = {};
1082
+ return E(e, function(e, t) {
1083
+ var r = n[e.v] = {
1084
+ indegree: 0,
1085
+ in: [],
1086
+ out: [],
1087
+ vs: [e.v],
1088
+ i: t
1089
+ };
1090
+ D(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
1091
+ }), E(t.edges(), function(e) {
1092
+ var t = n[e.v], r = n[e.w];
1093
+ !D(t) && !D(r) && (r.indegree++, t.out.push(n[e.w]));
1094
+ }), yr(x(n, function(e) {
1095
+ return !e.indegree;
1096
+ }));
1097
+ }
1098
+ function yr(e) {
1099
+ var t = [];
1100
+ function n(e) {
1101
+ return function(t) {
1102
+ t.merged || (D(t.barycenter) || D(e.barycenter) || t.barycenter >= e.barycenter) && br(e, t);
1103
+ };
1104
+ }
1105
+ function r(t) {
1106
+ return function(n) {
1107
+ n.in.push(t), --n.indegree === 0 && e.push(n);
1108
+ };
1109
+ }
1110
+ for (; e.length;) {
1111
+ var i = e.pop();
1112
+ t.push(i), E(i.in.reverse(), n(i)), E(i.out, r(i));
1113
+ }
1114
+ return A(x(t, function(e) {
1115
+ return !e.merged;
1116
+ }), function(e) {
1117
+ return W(e, [
1118
+ "vs",
1119
+ "i",
1120
+ "barycenter",
1121
+ "weight"
1122
+ ]);
1123
+ });
1124
+ }
1125
+ function br(e, t) {
1126
+ var n = 0, r = 0;
1127
+ 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;
1128
+ }
1129
+ //#endregion
1130
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort.js
1131
+ function xr(e, t) {
1132
+ var n = yn(e, function(e) {
1133
+ return Object.prototype.hasOwnProperty.call(e, "barycenter");
1134
+ }), r = n.lhs, i = K(n.rhs, function(e) {
1135
+ return -e.i;
1136
+ }), a = [], o = 0, s = 0, c = 0;
1137
+ r.sort(Cr(!!t)), c = Sr(a, i, c), E(r, function(e) {
1138
+ c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = Sr(a, i, c);
1139
+ });
1140
+ var l = { vs: N(a) };
1141
+ return s && (l.barycenter = o / s, l.weight = s), l;
1142
+ }
1143
+ function Sr(e, t, n) {
1144
+ for (var r; t.length && (r = P(t)).i <= n;) t.pop(), e.push(r.vs), n++;
1145
+ return n;
1146
+ }
1147
+ function Cr(e) {
1148
+ return function(t, n) {
1149
+ return t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
1150
+ };
1151
+ }
1152
+ //#endregion
1153
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
1154
+ function wr(e, t, n, r) {
1155
+ var i = e.children(t), a = e.node(t), o = a ? a.borderLeft : void 0, s = a ? a.borderRight : void 0, c = {};
1156
+ o && (i = x(i, function(e) {
1157
+ return e !== o && e !== s;
1158
+ }));
1159
+ var l = _r(e, i);
1160
+ E(l, function(t) {
1161
+ if (e.children(t.v).length) {
1162
+ var i = wr(e, t.v, n, r);
1163
+ c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && Er(t, i);
1164
+ }
1165
+ });
1166
+ var u = vr(l, n);
1167
+ Tr(u, c);
1168
+ var d = xr(u, r);
1169
+ if (o && (d.vs = N([
1170
+ o,
1171
+ d.vs,
1172
+ s
1173
+ ]), e.predecessors(o).length)) {
1174
+ var f = e.node(e.predecessors(o)[0]), p = e.node(e.predecessors(s)[0]);
1175
+ Object.prototype.hasOwnProperty.call(d, "barycenter") || (d.barycenter = 0, d.weight = 0), d.barycenter = (d.barycenter * d.weight + f.order + p.order) / (d.weight + 2), d.weight += 2;
1176
+ }
1177
+ return d;
1178
+ }
1179
+ function Tr(e, t) {
1180
+ E(e, function(e) {
1181
+ e.vs = N(e.vs.map(function(e) {
1182
+ return t[e] ? t[e].vs : e;
1183
+ }));
1184
+ });
1185
+ }
1186
+ function Er(e, t) {
1187
+ D(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);
1188
+ }
1189
+ //#endregion
1190
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/index.js
1191
+ function Dr(e) {
1192
+ var t = vn(e), n = Or(e, G(1, t + 1), "inEdges"), r = Or(e, G(t - 1, -1, -1), "outEdges"), i = gr(e);
1193
+ Ar(e, i);
1194
+ for (var a = Infinity, o, s = 0, c = 0; c < 4; ++s, ++c) {
1195
+ kr(s % 2 ? n : r, s % 4 >= 2), i = X(e);
1196
+ var l = mr(e, i);
1197
+ l < a && (c = 0, o = Ze(i), a = l);
1198
+ }
1199
+ Ar(e, o);
1200
+ }
1201
+ function Or(e, t, n) {
1202
+ return A(t, function(t) {
1203
+ return fr(e, t, n);
1204
+ });
1205
+ }
1206
+ function kr(e, t) {
1207
+ var n = new O();
1208
+ E(e, function(e) {
1209
+ var r = e.graph().root, i = wr(e, r, n, t);
1210
+ E(i.vs, function(t, n) {
1211
+ e.node(t).order = n;
1212
+ }), dr(e, n, i.vs);
1213
+ });
1214
+ }
1215
+ function Ar(e, t) {
1216
+ E(t, function(t) {
1217
+ E(t, function(t, n) {
1218
+ e.node(t).order = n;
1219
+ });
1220
+ });
1221
+ }
1222
+ //#endregion
1223
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
1224
+ function jr(e) {
1225
+ var t = Nr(e);
1226
+ E(e.graph().dummyChains, function(n) {
1227
+ for (var r = e.node(n), i = r.edgeObj, a = Mr(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; n !== i.w;) {
1228
+ if (r = e.node(n), u) {
1229
+ for (; (l = o[c]) !== s && e.node(l).maxRank < r.rank;) c++;
1230
+ l === s && (u = !1);
1231
+ }
1232
+ if (!u) {
1233
+ for (; c < o.length - 1 && e.node(l = o[c + 1]).minRank <= r.rank;) c++;
1234
+ l = o[c];
1235
+ }
1236
+ e.setParent(n, l), n = e.successors(n)[0];
1237
+ }
1238
+ });
1239
+ }
1240
+ function Mr(e, t, n, r) {
1241
+ var i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c = n, l;
1242
+ do
1243
+ c = e.parent(c), i.push(c);
1244
+ while (c && (t[c].low > o || s > t[c].lim));
1245
+ for (l = c, c = r; (c = e.parent(c)) !== l;) a.push(c);
1246
+ return {
1247
+ path: i.concat(a.reverse()),
1248
+ lca: l
1249
+ };
1250
+ }
1251
+ function Nr(e) {
1252
+ var t = {}, n = 0;
1253
+ function r(i) {
1254
+ var a = n;
1255
+ E(e.children(i), r), t[i] = {
1256
+ low: a,
1257
+ lim: n++
1258
+ };
1259
+ }
1260
+ return E(e.children(), r), t;
1261
+ }
1262
+ //#endregion
1263
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/bk.js
1264
+ function Pr(e, t) {
1265
+ var n = {};
1266
+ function r(t, r) {
1267
+ var i = 0, a = 0, o = t.length, s = P(r);
1268
+ return E(r, function(t, c) {
1269
+ var l = Ir(e, t), u = l ? e.node(l).order : o;
1270
+ (l || t === s) && (E(r.slice(a, c + 1), function(t) {
1271
+ E(e.predecessors(t), function(r) {
1272
+ var a = e.node(r), o = a.order;
1273
+ (o < i || u < o) && !(a.dummy && e.node(t).dummy) && Lr(n, r, t);
1274
+ });
1275
+ }), a = c + 1, i = u);
1276
+ }), r;
1277
+ }
1278
+ return T(t, r), n;
1279
+ }
1280
+ function Fr(e, t) {
1281
+ var n = {};
1282
+ function r(t, r, i, a, o) {
1283
+ var s;
1284
+ E(G(r, i), function(r) {
1285
+ s = t[r], e.node(s).dummy && E(e.predecessors(s), function(t) {
1286
+ var r = e.node(t);
1287
+ r.dummy && (r.order < a || r.order > o) && Lr(n, t, s);
1288
+ });
1289
+ });
1290
+ }
1291
+ function i(t, n) {
1292
+ var i = -1, a, o = 0;
1293
+ return E(n, function(s, c) {
1294
+ if (e.node(s).dummy === "border") {
1295
+ var l = e.predecessors(s);
1296
+ l.length && (a = e.node(l[0]).order, r(n, o, c, i, a), o = c, i = a);
1297
+ }
1298
+ r(n, o, n.length, a, t.length);
1299
+ }), n;
1300
+ }
1301
+ return T(t, i), n;
1302
+ }
1303
+ function Ir(e, t) {
1304
+ if (e.node(t).dummy) return F(e.predecessors(t), function(t) {
1305
+ return e.node(t).dummy;
1306
+ });
1307
+ }
1308
+ function Lr(e, t, n) {
1309
+ if (t > n) {
1310
+ var r = t;
1311
+ t = n, n = r;
1312
+ }
1313
+ Object.prototype.hasOwnProperty.call(e, t) || Object.defineProperty(e, t, {
1314
+ enumerable: !0,
1315
+ configurable: !0,
1316
+ value: {},
1317
+ writable: !0
1318
+ });
1319
+ var i = e[t];
1320
+ Object.defineProperty(i, n, {
1321
+ enumerable: !0,
1322
+ configurable: !0,
1323
+ value: !0,
1324
+ writable: !0
1325
+ });
1326
+ }
1327
+ function Rr(e, t, n) {
1328
+ if (t > n) {
1329
+ var r = t;
1330
+ t = n, n = r;
1331
+ }
1332
+ return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
1333
+ }
1334
+ function zr(e, t, n, r) {
1335
+ var i = {}, a = {}, o = {};
1336
+ return E(t, function(e) {
1337
+ E(e, function(e, t) {
1338
+ i[e] = e, a[e] = e, o[e] = t;
1339
+ });
1340
+ }), E(t, function(e) {
1341
+ var t = -1;
1342
+ E(e, function(e) {
1343
+ var s = r(e);
1344
+ if (s.length) {
1345
+ s = K(s, function(e) {
1346
+ return o[e];
1347
+ });
1348
+ for (var c = (s.length - 1) / 2, l = Math.floor(c), u = Math.ceil(c); l <= u; ++l) {
1349
+ var d = s[l];
1350
+ a[e] === e && t < o[d] && !Rr(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
1351
+ }
1352
+ }
1353
+ });
1354
+ }), {
1355
+ root: i,
1356
+ align: a
1357
+ };
1358
+ }
1359
+ function Br(e, t, n, r, i) {
1360
+ var a = {}, o = Vr(e, t, n, i), s = i ? "borderLeft" : "borderRight";
1361
+ function c(e, t) {
1362
+ 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();
1363
+ }
1364
+ function l(e) {
1365
+ a[e] = o.inEdges(e).reduce(function(e, t) {
1366
+ return Math.max(e, a[t.v] + o.edge(t));
1367
+ }, 0);
1368
+ }
1369
+ function u(t) {
1370
+ var n = o.outEdges(t).reduce(function(e, t) {
1371
+ return Math.min(e, a[t.w] - o.edge(t));
1372
+ }, Infinity), r = e.node(t);
1373
+ n !== Infinity && r.borderType !== s && (a[t] = Math.max(a[t], n));
1374
+ }
1375
+ return c(l, o.predecessors.bind(o)), c(u, o.successors.bind(o)), E(r, function(e) {
1376
+ a[e] = a[n[e]];
1377
+ }), a;
1378
+ }
1379
+ function Vr(e, t, n, r) {
1380
+ var i = new O(), a = e.graph(), o = Kr(a.nodesep, a.edgesep, r);
1381
+ return E(t, function(t) {
1382
+ var r;
1383
+ E(t, function(t) {
1384
+ var a = n[t];
1385
+ if (i.setNode(a), r) {
1386
+ var s = n[r], c = i.edge(s, a);
1387
+ i.setEdge(s, a, Math.max(o(e, t, r), c || 0));
1388
+ }
1389
+ r = t;
1390
+ });
1391
+ }), i;
1392
+ }
1393
+ function Hr(e, t) {
1394
+ return V(w(t), function(t) {
1395
+ var n = -Infinity, r = Infinity;
1396
+ return ut(t, function(t, i) {
1397
+ var a = qr(e, i) / 2;
1398
+ n = Math.max(t + a, n), r = Math.min(t - a, r);
1399
+ }), n - r;
1400
+ });
1401
+ }
1402
+ function Ur(e, t) {
1403
+ var n = w(t), r = B(n), i = R(n);
1404
+ E(["u", "d"], function(n) {
1405
+ E(["l", "r"], function(a) {
1406
+ var o = n + a, s = e[o], c;
1407
+ if (s !== t) {
1408
+ var l = w(s);
1409
+ c = a === "l" ? r - B(l) : i - R(l), c && (e[o] = I(s, function(e) {
1410
+ return e + c;
1411
+ }));
1412
+ }
1413
+ });
1414
+ });
1415
+ }
1416
+ function Wr(e, t) {
1417
+ return I(e.ul, function(n, r) {
1418
+ if (t) return e[t.toLowerCase()][r];
1419
+ var i = K(A(e, r));
1420
+ return (i[1] + i[2]) / 2;
1421
+ });
1422
+ }
1423
+ function Gr(e) {
1424
+ var t = X(e), n = z(Pr(e, t), Fr(e, t)), r = {}, i;
1425
+ return E(["u", "d"], function(a) {
1426
+ i = a === "u" ? t : w(t).reverse(), E(["l", "r"], function(t) {
1427
+ t === "r" && (i = A(i, function(e) {
1428
+ return w(e).reverse();
1429
+ }));
1430
+ var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = zr(e, i, n, o), c = Br(e, i, s.root, s.align, t === "r");
1431
+ t === "r" && (c = I(c, function(e) {
1432
+ return -e;
1433
+ })), r[a + t] = c;
1434
+ });
1435
+ }), Ur(r, Hr(e, r)), Wr(r, e.graph().align);
1436
+ }
1437
+ function Kr(e, t, n) {
1438
+ return function(r, i, a) {
1439
+ var o = r.node(i), s = r.node(a), c = 0, l;
1440
+ if (c += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos")) switch (o.labelpos.toLowerCase()) {
1441
+ case "l":
1442
+ l = -o.width / 2;
1443
+ break;
1444
+ case "r": l = o.width / 2;
1445
+ }
1446
+ if (l && (c += n ? l : -l), l = 0, c += (o.dummy ? t : e) / 2, c += (s.dummy ? t : e) / 2, c += s.width / 2, Object.prototype.hasOwnProperty.call(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
1447
+ case "l":
1448
+ l = s.width / 2;
1449
+ break;
1450
+ case "r": l = -s.width / 2;
1451
+ }
1452
+ return l && (c += n ? l : -l), l = 0, c;
1453
+ };
1454
+ }
1455
+ function qr(e, t) {
1456
+ return e.node(t).width;
1457
+ }
1458
+ //#endregion
1459
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/index.js
1460
+ function Jr(e) {
1461
+ e = pn(e), Yr(e), dt(Gr(e), function(t, n) {
1462
+ e.node(n).x = t;
1463
+ });
1464
+ }
1465
+ function Yr(e) {
1466
+ var t = X(e), n = e.graph().ranksep, r = 0;
1467
+ E(t, function(t) {
1468
+ var i = R(A(t, function(t) {
1469
+ return e.node(t).height;
1470
+ }));
1471
+ E(t, function(t) {
1472
+ e.node(t).y = r + i / 2;
1473
+ }), r += i + n;
1474
+ });
1475
+ }
1476
+ //#endregion
1477
+ //#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/layout.js
1478
+ function Xr(e, t) {
1479
+ var n = t && t.debugTiming ? bn : xn;
1480
+ n("layout", () => {
1481
+ var t = n(" buildLayoutGraph", () => si(e));
1482
+ n(" runLayout", () => Zr(t, n)), n(" updateInputGraph", () => Qr(e, t));
1483
+ });
1484
+ }
1485
+ function Zr(e, t) {
1486
+ t(" makeSpaceForEdgeLabels", () => ci(e)), t(" removeSelfEdges", () => _i(e)), t(" acyclic", () => ln(e)), t(" nestingGraph.run", () => or(e)), t(" rank", () => nr(pn(e))), t(" injectEdgeLabelProxies", () => li(e)), t(" removeEmptyRanks", () => gn(e)), t(" nestingGraph.cleanup", () => ur(e)), t(" normalizeRanks", () => hn(e)), t(" assignRankMinMax", () => ui(e)), t(" removeEdgeLabelProxies", () => di(e)), t(" normalize.run", () => Mn(e)), t(" parentDummyChains", () => jr(e)), t(" addBorderSegments", () => Sn(e)), t(" order", () => Dr(e)), t(" insertSelfEdges", () => vi(e)), t(" adjustCoordinateSystem", () => wn(e)), t(" position", () => Jr(e)), t(" positionSelfEdges", () => yi(e)), t(" removeBorderNodes", () => gi(e)), t(" normalize.undo", () => Pn(e)), t(" fixupEdgeLabelCoords", () => mi(e)), t(" undoCoordinateSystem", () => Tn(e)), t(" translateGraph", () => fi(e)), t(" assignNodeIntersects", () => pi(e)), t(" reversePoints", () => hi(e)), t(" acyclic.undo", () => dn(e));
1487
+ }
1488
+ function Qr(e, t) {
1489
+ E(e.nodes(), function(n) {
1490
+ var r = e.node(n), i = t.node(n);
1491
+ r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
1492
+ }), E(e.edges(), function(n) {
1493
+ var r = e.edge(n), i = t.edge(n);
1494
+ r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
1495
+ }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
1496
+ }
1497
+ var $r = [
1498
+ "nodesep",
1499
+ "edgesep",
1500
+ "ranksep",
1501
+ "marginx",
1502
+ "marginy"
1503
+ ], ei = {
1504
+ ranksep: 50,
1505
+ edgesep: 20,
1506
+ nodesep: 50,
1507
+ rankdir: "tb"
1508
+ }, ti = [
1509
+ "acyclicer",
1510
+ "ranker",
1511
+ "rankdir",
1512
+ "align"
1513
+ ], ni = ["width", "height"], ri = {
1514
+ width: 0,
1515
+ height: 0
1516
+ }, ii = [
1517
+ "minlen",
1518
+ "weight",
1519
+ "width",
1520
+ "height",
1521
+ "labeloffset"
1522
+ ], ai = {
1523
+ minlen: 1,
1524
+ weight: 1,
1525
+ width: 0,
1526
+ height: 0,
1527
+ labeloffset: 10,
1528
+ labelpos: "r"
1529
+ }, oi = ["labelpos"];
1530
+ function si(e) {
1531
+ var t = new O({
1532
+ multigraph: !0,
1533
+ compound: !0
1534
+ }), n = xi(e.graph());
1535
+ return t.setGraph(z({}, ei, bi(n, $r), W(n, ti))), E(e.nodes(), function(n) {
1536
+ var r = xi(e.node(n));
1537
+ t.setNode(n, tt(bi(r, ni), ri)), t.setParent(n, e.parent(n));
1538
+ }), E(e.edges(), function(n) {
1539
+ var r = xi(e.edge(n));
1540
+ t.setEdge(n, z({}, ai, bi(r, ii), W(r, oi)));
1541
+ }), t;
1542
+ }
1543
+ function ci(e) {
1544
+ var t = e.graph();
1545
+ t.ranksep /= 2, E(e.edges(), function(n) {
1546
+ var r = e.edge(n);
1547
+ r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
1548
+ });
1549
+ }
1550
+ function li(e) {
1551
+ E(e.edges(), function(t) {
1552
+ var n = e.edge(t);
1553
+ if (n.width && n.height) {
1554
+ var r = e.node(t.v);
1555
+ Y(e, "edge-proxy", {
1556
+ rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
1557
+ e: t
1558
+ }, "_ep");
1559
+ }
1560
+ });
1561
+ }
1562
+ function ui(e) {
1563
+ var t = 0;
1564
+ E(e.nodes(), function(n) {
1565
+ var r = e.node(n);
1566
+ r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = R(t, r.maxRank));
1567
+ }), e.graph().maxRank = t;
1568
+ }
1569
+ function di(e) {
1570
+ E(e.nodes(), function(t) {
1571
+ var n = e.node(t);
1572
+ n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
1573
+ });
1574
+ }
1575
+ function fi(e) {
1576
+ var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
1577
+ function c(e) {
1578
+ var a = e.x, o = e.y, s = e.width, c = e.height;
1579
+ t = Math.min(t, a - s / 2), n = Math.max(n, a + s / 2), r = Math.min(r, o - c / 2), i = Math.max(i, o + c / 2);
1580
+ }
1581
+ E(e.nodes(), function(t) {
1582
+ c(e.node(t));
1583
+ }), E(e.edges(), function(t) {
1584
+ var n = e.edge(t);
1585
+ Object.prototype.hasOwnProperty.call(n, "x") && c(n);
1586
+ }), t -= o, r -= s, E(e.nodes(), function(n) {
1587
+ var i = e.node(n);
1588
+ i.x -= t, i.y -= r;
1589
+ }), E(e.edges(), function(n) {
1590
+ var i = e.edge(n);
1591
+ E(i.points, function(e) {
1592
+ e.x -= t, e.y -= r;
1593
+ }), Object.prototype.hasOwnProperty.call(i, "x") && (i.x -= t), Object.prototype.hasOwnProperty.call(i, "y") && (i.y -= r);
1594
+ }), a.width = n - t + o, a.height = i - r + s;
1595
+ }
1596
+ function pi(e) {
1597
+ E(e.edges(), function(t) {
1598
+ var n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
1599
+ n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(mn(r, a)), n.points.push(mn(i, o));
1600
+ });
1601
+ }
1602
+ function mi(e) {
1603
+ E(e.edges(), function(t) {
1604
+ var n = e.edge(t);
1605
+ if (Object.prototype.hasOwnProperty.call(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
1606
+ case "l":
1607
+ n.x -= n.width / 2 + n.labeloffset;
1608
+ break;
1609
+ case "r": n.x += n.width / 2 + n.labeloffset;
1610
+ }
1611
+ });
1612
+ }
1613
+ function hi(e) {
1614
+ E(e.edges(), function(t) {
1615
+ var n = e.edge(t);
1616
+ n.reversed && n.points.reverse();
1617
+ });
1618
+ }
1619
+ function gi(e) {
1620
+ E(e.nodes(), function(t) {
1621
+ if (e.children(t).length) {
1622
+ var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(P(n.borderLeft)), o = e.node(P(n.borderRight));
1623
+ 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;
1624
+ }
1625
+ }), E(e.nodes(), function(t) {
1626
+ e.node(t).dummy === "border" && e.removeNode(t);
1627
+ });
1628
+ }
1629
+ function _i(e) {
1630
+ E(e.edges(), function(t) {
1631
+ if (t.v === t.w) {
1632
+ var n = e.node(t.v);
1633
+ n.selfEdges ||= [], n.selfEdges.push({
1634
+ e: t,
1635
+ label: e.edge(t)
1636
+ }), e.removeEdge(t);
1637
+ }
1638
+ });
1639
+ }
1640
+ function vi(e) {
1641
+ var t = X(e);
1642
+ E(t, function(t) {
1643
+ var n = 0;
1644
+ E(t, function(t, r) {
1645
+ var i = e.node(t);
1646
+ i.order = r + n, E(i.selfEdges, function(t) {
1647
+ Y(e, "selfedge", {
1648
+ width: t.label.width,
1649
+ height: t.label.height,
1650
+ rank: i.rank,
1651
+ order: r + ++n,
1652
+ e: t.e,
1653
+ label: t.label
1654
+ }, "_se");
1655
+ }), delete i.selfEdges;
1656
+ });
1657
+ });
1658
+ }
1659
+ function yi(e) {
1660
+ E(e.nodes(), function(t) {
1661
+ var n = e.node(t);
1662
+ if (n.dummy === "selfedge") {
1663
+ var r = e.node(n.e.v), i = r.x + r.width / 2, a = r.y, o = n.x - i, s = r.height / 2;
1664
+ e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [
1665
+ {
1666
+ x: i + 2 * o / 3,
1667
+ y: a - s
1668
+ },
1669
+ {
1670
+ x: i + 5 * o / 6,
1671
+ y: a - s
1672
+ },
1673
+ {
1674
+ x: i + o,
1675
+ y: a
1676
+ },
1677
+ {
1678
+ x: i + 5 * o / 6,
1679
+ y: a + s
1680
+ },
1681
+ {
1682
+ x: i + 2 * o / 3,
1683
+ y: a + s
1684
+ }
1685
+ ], n.label.x = n.x, n.label.y = n.y;
1686
+ }
1687
+ });
1688
+ }
1689
+ function bi(e, t) {
1690
+ return I(W(e, t), Number);
1691
+ }
1692
+ function xi(e) {
1693
+ var t = {};
1694
+ return E(e, function(e, n) {
1695
+ t[n.toLowerCase()] = e;
1696
+ }), t;
1697
+ }
1698
+ //#endregion
1699
+ export { Xr as t };