@peasant-labs/fairtrade 0.0.47 → 0.0.49

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 (129) hide show
  1. package/dist/lib/abnfDiagram-WEYOIA3C-D4LMNFIJ.js +89 -0
  2. package/dist/lib/{adapter-Dulh38C2.js → adapter-CVKibszh.js} +209 -186
  3. package/dist/lib/arc-1xTxsoRi.js +80 -0
  4. package/dist/lib/architecture-WOLXFQ4H-c6RsZuzu.js +3 -0
  5. package/dist/lib/architectureDiagram-ZHVYKT53-DTINqD5R.js +4145 -0
  6. package/dist/lib/array-CApNbSU9.js +6 -0
  7. package/dist/lib/blockDiagram-RJAE7QA3-CUYHoR3g.js +1946 -0
  8. package/dist/lib/c4Diagram-XDPPPE54-Cdx6_DsI.js +2990 -0
  9. package/dist/lib/channel-DagAO2vE.js +5 -0
  10. package/dist/lib/chunk-2E7WHVMD-BzhgXW3b.js +490 -0
  11. package/dist/lib/chunk-2Q5K7J3B-DWNwIK5Y.js +15 -0
  12. package/dist/lib/chunk-4EMNKR2T-DhFrQz9k.js +236 -0
  13. package/dist/lib/chunk-55XCU76K-CI0GXDkJ.js +61 -0
  14. package/dist/lib/chunk-5VM5RSS4-BAQ-46g4.js +5 -0
  15. package/dist/lib/chunk-7S6XSTFO-CMt_p-O6.js +1373 -0
  16. package/dist/lib/chunk-AQDTSKZB-DrZccIQa.js +1847 -0
  17. package/dist/lib/chunk-DSNLSHJZ-CpA9d2CJ.js +4044 -0
  18. package/dist/lib/chunk-DUW6YSOI-C-tN4Kiv.js +10 -0
  19. package/dist/lib/chunk-EJLWFMJV-B30MNYvY.js +75 -0
  20. package/dist/lib/chunk-HAGFOTED-DMU2JNZM.js +4487 -0
  21. package/dist/lib/chunk-HNE4Q36P-BIA0n2gA.js +363 -0
  22. package/dist/lib/chunk-J5ZVWO5B-CA_-jk8G.js +12 -0
  23. package/dist/lib/chunk-JWPE2WC7-KRpHbrIX.js +8 -0
  24. package/dist/lib/chunk-LNGE3PJU-CMGaAEAh.js +1513 -0
  25. package/dist/lib/chunk-NGNAAXSQ-D7Dvct7J.js +19774 -0
  26. package/dist/lib/chunk-NQOKRVIF-MK9F46y3.js +4258 -0
  27. package/dist/lib/chunk-OYAV6JZA-B1yICcbU.js +10 -0
  28. package/dist/lib/chunk-UHW7PFBP-CLrOaA0y.js +67 -0
  29. package/dist/lib/chunk-VQ5W62QI-_ZR3gKe4.js +26 -0
  30. package/dist/lib/chunk-WQQL4CDK-DFtyhYZq.js +693 -0
  31. package/dist/lib/chunk-XXDRQBXY-uzyNBbgx.js +9 -0
  32. package/dist/lib/chunk-Y2CYZVJY-BYzrzvCI.js +12 -0
  33. package/dist/lib/chunk-YZO67HFG-D1jKt78p.js +275 -0
  34. package/dist/lib/chunk-ZAUX2LTX-7XO0Yj1z.js +37 -0
  35. package/dist/lib/chunk-ZCHMQSOR-CxoKltfF.js +349 -0
  36. package/dist/lib/classDiagram-v2-4MYWR3UA-BPvwhZqw.js +3397 -0
  37. package/dist/lib/commons.js +729 -729
  38. package/dist/lib/components.css +1 -1
  39. package/dist/lib/cose-bilkent-JH36ORCC-Oj79uOIQ.js +2250 -0
  40. package/dist/lib/cynefin-EF2NZ3EQ-COX3NRum.js +3 -0
  41. package/dist/lib/cynefinDiagram-WF24UDRP-UzTptNAX.js +349 -0
  42. package/dist/lib/cytoscape.esm-0ojxgO9x.js +18161 -0
  43. package/dist/lib/dagre-NK4GIZVX-DWZr-NGm.js +2356 -0
  44. package/dist/lib/defaultLocale-BbgDuMnp.js +201 -0
  45. package/dist/lib/diagram-CBK3MWTC-CsyKuv-w.js +525 -0
  46. package/dist/lib/diagram-I5XIIV2D-DWY2JSPC.js +134 -0
  47. package/dist/lib/diagram-ODIL2UCW-DUptj0JZ.js +301 -0
  48. package/dist/lib/diagram-PFBEJUXE-N5XnIBqM.js +447 -0
  49. package/dist/lib/diagram-RJA3I4VV-B9XgohYo.js +214 -0
  50. package/dist/lib/diagram-TYUNFSNR-XnsJIeAd.js +5084 -0
  51. package/dist/lib/dist-AMlsjiDX.js +59 -0
  52. package/dist/lib/ebnfDiagram-V4P3TTPT-BssHqFox.js +100 -0
  53. package/dist/lib/elk-QONTBCTQ-DwmwqYgP.js +47944 -0
  54. package/dist/lib/erDiagram-KYQIGQAA-BQiXw1Tw.js +1970 -0
  55. package/dist/lib/eventmodeling-K75KTNOO-DDb--yMc.js +3 -0
  56. package/dist/lib/flowDiagram-IUGLLWBU-BEqqF1y2.js +17 -0
  57. package/dist/lib/ganttDiagram-R7GPNTJY-BWtGXxEF.js +3094 -0
  58. package/dist/lib/gitGraph-VSP46ZUC-BSwOaak_.js +3 -0
  59. package/dist/lib/gitGraphDiagram-PDYL7XHY-CHGNuGbk.js +729 -0
  60. package/dist/lib/graphlib-Dndp26xU.js +1267 -0
  61. package/dist/lib/info-OHQRW6UA-Dk06sZRe.js +3 -0
  62. package/dist/lib/infoDiagram-MVDRKAX5-Cdhxnjmi.js +20 -0
  63. package/dist/lib/init-Bwwdo3M6.js +15 -0
  64. package/dist/lib/ishikawaDiagram-HPEHV2GE-Dzhti-GJ.js +719 -0
  65. package/dist/lib/journeyDiagram-BOSHW7O7-C3_vsSjw.js +884 -0
  66. package/dist/lib/kanban-definition-FNSA4HC5-XsfCEsjn.js +976 -0
  67. package/dist/lib/katex-Dw0PnoPU.js +21850 -0
  68. package/dist/lib/line-C9krU3Sv.js +34 -0
  69. package/dist/lib/linear-Cvilv3OA.js +289 -0
  70. package/dist/lib/mermaid-parser.core-I7qQ_fxz.js +638 -0
  71. package/dist/lib/mermaid.core-UNHMAbBP.js +1126 -0
  72. package/dist/lib/mindmap-definition-6OY57UG3-CAua-JvB.js +1011 -0
  73. package/dist/lib/ordinal-C55HfHHp.js +65 -0
  74. package/dist/lib/packet-JDAUHWVQ-DZ-MKx4I.js +3 -0
  75. package/dist/lib/path-DNvJyUE8.js +85 -0
  76. package/dist/lib/pegDiagram-ECIUJNBX-BCxa_IO0.js +94 -0
  77. package/dist/lib/pie-XZMESJXO-DpCa-Nnq.js +3 -0
  78. package/dist/lib/pieDiagram-GNMPY74T-CE_C3dCB.js +205 -0
  79. package/dist/lib/quadrantDiagram-D57K4MC3-CDgzdMoL.js +2001 -0
  80. package/dist/lib/radar-ABXABTNO-BOVK7L9p.js +3 -0
  81. package/dist/lib/railroad-I3PHUGI6-B6spKM0Z.js +3 -0
  82. package/dist/lib/railroad-abnf-LNEFI6M7-DEWqfByZ.js +3 -0
  83. package/dist/lib/railroad-ebnf-DWYD2UWJ-CWRLtxHB.js +3 -0
  84. package/dist/lib/railroad-peg-JR7BVNR7-C-3NHSsk.js +3 -0
  85. package/dist/lib/railroadDiagram-Y72NRBL7-a8YVk8LT.js +76 -0
  86. package/dist/lib/requirementDiagram-EQYSW5RA-B9HolqxU.js +2228 -0
  87. package/dist/lib/rough.esm-a8mysczE.js +1352 -0
  88. package/dist/lib/sankeyDiagram-SY24JHO5-CLFMtMJG.js +970 -0
  89. package/dist/lib/sequenceDiagram-BLEHNHQU-B5wfSV85.js +4253 -0
  90. package/dist/lib/share.js +1 -1
  91. package/dist/lib/sizeCapture-INFHLROL-BWGCc9aa.js +46 -0
  92. package/dist/lib/src-Dcy0zUZH.js +2153 -0
  93. package/dist/lib/stateDiagram-v2-A6IESKWZ-C92vye4N.js +2143 -0
  94. package/dist/lib/swimlanes-B3ENRKFQ-B6-i-tPc.js +4764 -0
  95. package/dist/lib/swimlanesDiagram-AYQRV4AK-CbkBeql-.js +28 -0
  96. package/dist/lib/timeline-definition-JXYKGLGB-D2Ip4r72.js +1073 -0
  97. package/dist/lib/treeView-D4JQ5SDB-CFaKQ_2T.js +3 -0
  98. package/dist/lib/treemap-SAJKECNS-BQ6z7Z3g.js +3 -0
  99. package/dist/lib/types/AppSidebar.d.ts +14 -1
  100. package/dist/lib/types/transcript/Collapsible.d.ts +10 -0
  101. package/dist/lib/types/transcript/FiltersRail.d.ts +1 -0
  102. package/dist/lib/types/transcript/MermaidBlock.d.ts +3 -0
  103. package/dist/lib/types/transcript/Thinking.d.ts +1 -1
  104. package/dist/lib/types/transcript/ToolCall.d.ts +1 -1
  105. package/dist/lib/types/transcript/TranscriptViewer.d.ts +2 -2
  106. package/dist/lib/types/transcript/TurnCard.d.ts +3 -1
  107. package/dist/lib/types/transcript/UnverifiedPullRequests.d.ts +12 -0
  108. package/dist/lib/types/transcript/WorkGroup.d.ts +9 -0
  109. package/dist/lib/types/transcript/action-groups.d.ts +9 -0
  110. package/dist/lib/types/transcript/adapter.d.ts +12 -0
  111. package/dist/lib/types/transcript/filters.d.ts +5 -5
  112. package/dist/lib/types/transcript/index.d.ts +2 -1
  113. package/dist/lib/types/transcript/mermaidSource.d.ts +2 -0
  114. package/dist/lib/types/transcript/mermaidSvg.d.ts +1 -0
  115. package/dist/lib/types/transcript/state-capabilities.d.ts +38 -11
  116. package/dist/lib/types/transcript/tool-state-key.d.ts +2 -0
  117. package/dist/lib/types/transcript/useReaderWidthAnchor.d.ts +20 -0
  118. package/dist/lib/types/transcript/view-model.d.ts +19 -0
  119. package/dist/lib/types/transcript/work-summary.d.ts +8 -0
  120. package/dist/lib/types/ui/transcript/adapter.d.ts +12 -0
  121. package/dist/lib/types/ui/transcript/view-model.d.ts +19 -0
  122. package/dist/lib/{ui-CrH0SVd_.js → ui-Beoq-HpN.js} +5345 -4232
  123. package/dist/lib/ui.js +6 -6
  124. package/dist/lib/usecaseDiagram-WPOLBNNX-BK1Anch1.js +7190 -0
  125. package/dist/lib/vennDiagram-Q3Y3IDCW-B6YTBqTS.js +1880 -0
  126. package/dist/lib/wardley-7MLQ67FV-DChYwu4i.js +3 -0
  127. package/dist/lib/wardleyDiagram-IVAIDKWA-D5I1qLUK.js +645 -0
  128. package/dist/lib/xychartDiagram-4URNHDU4-B6RXyhTO.js +2218 -0
  129. package/package.json +3 -2
@@ -0,0 +1,2356 @@
1
+ import { m as e } from "./src-Dcy0zUZH.js";
2
+ import { n as t } from "./chunk-Y2CYZVJY-BYzrzvCI.js";
3
+ import { b as n } from "./chunk-DSNLSHJZ-CpA9d2CJ.js";
4
+ import "./chunk-7S6XSTFO-CMt_p-O6.js";
5
+ import "./chunk-YZO67HFG-D1jKt78p.js";
6
+ import "./chunk-AQDTSKZB-DrZccIQa.js";
7
+ import "./chunk-UHW7PFBP-CLrOaA0y.js";
8
+ import { c as r } from "./chunk-HAGFOTED-DMU2JNZM.js";
9
+ import { a as i, i as a, n as o } from "./chunk-ZAUX2LTX-7XO0Yj1z.js";
10
+ import { a as s, i as c, l } from "./chunk-WQQL4CDK-DFtyhYZq.js";
11
+ import { $ as u, A as d, B as f, C as p, D as m, E as h, F as g, G as ee, H as _, I as te, J as ne, K as re, L as ie, M as ae, N as oe, O as se, P as v, Q as y, R as ce, S as le, T as ue, U as de, V as fe, W as pe, X as me, Y as he, Z as b, _ as x, a as S, b as ge, c as _e, d as ve, et as ye, f as C, g as be, h as xe, i as w, it as Se, j as Ce, k as we, l as Te, m as Ee, n as T, nt as De, o as E, p as Oe, q as ke, r as D, rt as Ae, s as je, t as O, tt as k, u as Me, v as Ne, w as Pe, x as Fe, y as Ie, z as A } from "./graphlib-Dndp26xU.js";
12
+ import { r as Le } from "./chunk-HNE4Q36P-BIA0n2gA.js";
13
+ import { c as Re, i as ze, n as j, o as Be, r as Ve, s as He, t as Ue } from "./chunk-ZCHMQSOR-CxoKltfF.js";
14
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_trimmedEndIndex.js
15
+ var We = /\s/;
16
+ function Ge(e) {
17
+ for (var t = e.length; t-- && We.test(e.charAt(t)););
18
+ return t;
19
+ }
20
+ //#endregion
21
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseTrim.js
22
+ var Ke = /^\s+/;
23
+ function qe(e) {
24
+ return e && e.slice(0, Ge(e) + 1).replace(Ke, "");
25
+ }
26
+ //#endregion
27
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toNumber.js
28
+ var Je = NaN, Ye = /^[-+]0x[0-9a-f]+$/i, Xe = /^0b[01]+$/i, Ze = /^0o[0-7]+$/i, Qe = parseInt;
29
+ function $e(e) {
30
+ if (typeof e == "number") return e;
31
+ if (ye(e)) return Je;
32
+ if (b(e)) {
33
+ var t = typeof e.valueOf == "function" ? e.valueOf() : e;
34
+ e = b(t) ? t + "" : t;
35
+ }
36
+ if (typeof e != "string") return e === 0 ? e : +e;
37
+ e = qe(e);
38
+ var n = Xe.test(e);
39
+ return n || Ze.test(e) ? Qe(e.slice(2), n ? 2 : 8) : Ye.test(e) ? Je : +e;
40
+ }
41
+ //#endregion
42
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toFinite.js
43
+ var et = Infinity, tt = 17976931348623157e292;
44
+ function M(e) {
45
+ return e ? (e = $e(e), e === et || e === -et ? (e < 0 ? -1 : 1) * tt : e === e ? e : 0) : e === 0 ? e : 0;
46
+ }
47
+ //#endregion
48
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toInteger.js
49
+ function nt(e) {
50
+ var t = M(e), n = t % 1;
51
+ return t === t ? n ? t - n : t : 0;
52
+ }
53
+ //#endregion
54
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseCreate.js
55
+ var rt = Object.create, it = function() {
56
+ function e() {}
57
+ return function(t) {
58
+ if (!b(t)) return {};
59
+ if (rt) return rt(t);
60
+ e.prototype = t;
61
+ var n = new e();
62
+ return e.prototype = void 0, n;
63
+ };
64
+ }();
65
+ //#endregion
66
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_copyArray.js
67
+ function at(e, t) {
68
+ var n = -1, r = e.length;
69
+ for (t ||= Array(r); ++n < r;) t[n] = e[n];
70
+ return t;
71
+ }
72
+ //#endregion
73
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseAssignValue.js
74
+ function N(e, t, n) {
75
+ t == "__proto__" && ke ? ke(e, t, {
76
+ configurable: !0,
77
+ enumerable: !0,
78
+ value: n,
79
+ writable: !0
80
+ }) : e[t] = n;
81
+ }
82
+ //#endregion
83
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_assignValue.js
84
+ var ot = Object.prototype.hasOwnProperty;
85
+ function P(e, t, n) {
86
+ var r = e[t];
87
+ (!(ot.call(e, t) && _(r, n)) || n === void 0 && !(t in e)) && N(e, t, n);
88
+ }
89
+ //#endregion
90
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_copyObject.js
91
+ function F(e, t, n, r) {
92
+ var i = !n;
93
+ n ||= {};
94
+ for (var a = -1, o = t.length; ++a < o;) {
95
+ var s = t[a], c = r ? r(n[s], e[s], s, n, e) : void 0;
96
+ c === void 0 && (c = e[s]), i ? N(n, s, c) : P(n, s, c);
97
+ }
98
+ return n;
99
+ }
100
+ //#endregion
101
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_isIterateeCall.js
102
+ function I(e, t, n) {
103
+ if (!b(n)) return !1;
104
+ var r = typeof t;
105
+ return (r == "number" ? A(n) && de(t, n.length) : r == "string" && t in n) ? _(n[t], e) : !1;
106
+ }
107
+ //#endregion
108
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createAssigner.js
109
+ function st(e) {
110
+ return f(function(t, n) {
111
+ var r = -1, i = n.length, a = i > 1 ? n[i - 1] : void 0, o = i > 2 ? n[2] : void 0;
112
+ for (a = e.length > 3 && typeof a == "function" ? (i--, a) : void 0, o && I(n[0], n[1], o) && (a = i < 3 ? void 0 : a, i = 1), t = Object(t); ++r < i;) {
113
+ var s = n[r];
114
+ s && e(t, s, r, a);
115
+ }
116
+ return t;
117
+ });
118
+ }
119
+ //#endregion
120
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_nativeKeysIn.js
121
+ function ct(e) {
122
+ var t = [];
123
+ if (e != null) for (var n in Object(e)) t.push(n);
124
+ return t;
125
+ }
126
+ //#endregion
127
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseKeysIn.js
128
+ var lt = Object.prototype.hasOwnProperty;
129
+ function ut(e) {
130
+ if (!b(e)) return ct(e);
131
+ var t = ce(e), n = [];
132
+ for (var r in e) r == "constructor" && (t || !lt.call(e, r)) || n.push(r);
133
+ return n;
134
+ }
135
+ //#endregion
136
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/keysIn.js
137
+ function L(e) {
138
+ return A(e) ? ae(e, !0) : ut(e);
139
+ }
140
+ //#endregion
141
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/flatten.js
142
+ function R(e) {
143
+ return e != null && e.length ? p(e, 1) : [];
144
+ }
145
+ //#endregion
146
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_flatRest.js
147
+ function dt(e) {
148
+ return re(fe(e, void 0, R), e + "");
149
+ }
150
+ //#endregion
151
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_getPrototype.js
152
+ var ft = Ce(Object.getPrototypeOf, Object), pt = "[object Object]", mt = Function.prototype, ht = Object.prototype, gt = mt.toString, _t = ht.hasOwnProperty, vt = gt.call(Object);
153
+ function yt(e) {
154
+ if (!k(e) || De(e) != pt) return !1;
155
+ var t = ft(e);
156
+ if (t === null) return !0;
157
+ var n = _t.call(t, "constructor") && t.constructor;
158
+ return typeof n == "function" && n instanceof n && gt.call(n) == vt;
159
+ }
160
+ //#endregion
161
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_hasUnicode.js
162
+ var bt = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
163
+ function xt(e) {
164
+ return bt.test(e);
165
+ }
166
+ //#endregion
167
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseAssign.js
168
+ function St(e, t) {
169
+ return e && F(t, we(t), e);
170
+ }
171
+ //#endregion
172
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseAssignIn.js
173
+ function Ct(e, t) {
174
+ return e && F(t, L(t), e);
175
+ }
176
+ //#endregion
177
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_cloneBuffer.js
178
+ var wt = typeof exports == "object" && exports && !exports.nodeType && exports, Tt = wt && typeof module == "object" && module && !module.nodeType && module, Et = Tt && Tt.exports === wt ? Se.Buffer : void 0, Dt = Et ? Et.allocUnsafe : void 0;
179
+ function Ot(e, t) {
180
+ if (t) return e.slice();
181
+ var n = e.length, r = Dt ? Dt(n) : new e.constructor(n);
182
+ return e.copy(r), r;
183
+ }
184
+ //#endregion
185
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_copySymbols.js
186
+ function kt(e, t) {
187
+ return F(e, ge(e), t);
188
+ }
189
+ //#endregion
190
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_getSymbolsIn.js
191
+ var At = Object.getOwnPropertySymbols ? function(e) {
192
+ for (var t = []; e;) Pe(t, ge(e)), e = ft(e);
193
+ return t;
194
+ } : Fe;
195
+ //#endregion
196
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_copySymbolsIn.js
197
+ function jt(e, t) {
198
+ return F(e, At(e), t);
199
+ }
200
+ //#endregion
201
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_getAllKeysIn.js
202
+ function Mt(e) {
203
+ return Ie(e, L, At);
204
+ }
205
+ //#endregion
206
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_initCloneArray.js
207
+ var Nt = Object.prototype.hasOwnProperty;
208
+ function Pt(e) {
209
+ var t = e.length, n = new e.constructor(t);
210
+ return t && typeof e[0] == "string" && Nt.call(e, "index") && (n.index = e.index, n.input = e.input), n;
211
+ }
212
+ //#endregion
213
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_cloneArrayBuffer.js
214
+ function Ft(e) {
215
+ var t = new e.constructor(e.byteLength);
216
+ return new be(t).set(new be(e)), t;
217
+ }
218
+ //#endregion
219
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_cloneDataView.js
220
+ function It(e, t) {
221
+ var n = t ? Ft(e.buffer) : e.buffer;
222
+ return new e.constructor(n, e.byteOffset, e.byteLength);
223
+ }
224
+ //#endregion
225
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_cloneRegExp.js
226
+ var Lt = /\w*$/;
227
+ function Rt(e) {
228
+ var t = new e.constructor(e.source, Lt.exec(e));
229
+ return t.lastIndex = e.lastIndex, t;
230
+ }
231
+ //#endregion
232
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_cloneSymbol.js
233
+ var zt = Ae ? Ae.prototype : void 0, Bt = zt ? zt.valueOf : void 0;
234
+ function Vt(e) {
235
+ return Bt ? Object(Bt.call(e)) : {};
236
+ }
237
+ //#endregion
238
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_cloneTypedArray.js
239
+ function Ht(e, t) {
240
+ var n = t ? Ft(e.buffer) : e.buffer;
241
+ return new e.constructor(n, e.byteOffset, e.length);
242
+ }
243
+ //#endregion
244
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_initCloneByTag.js
245
+ var Ut = "[object Boolean]", Wt = "[object Date]", Gt = "[object Map]", Kt = "[object Number]", qt = "[object RegExp]", Jt = "[object Set]", Yt = "[object String]", Xt = "[object Symbol]", Zt = "[object ArrayBuffer]", Qt = "[object DataView]", $t = "[object Float32Array]", en = "[object Float64Array]", tn = "[object Int8Array]", nn = "[object Int16Array]", rn = "[object Int32Array]", an = "[object Uint8Array]", on = "[object Uint8ClampedArray]", sn = "[object Uint16Array]", cn = "[object Uint32Array]";
246
+ function ln(e, t, n) {
247
+ var r = e.constructor;
248
+ switch (t) {
249
+ case Zt: return Ft(e);
250
+ case Ut:
251
+ case Wt: return new r(+e);
252
+ case Qt: return It(e, n);
253
+ case $t:
254
+ case en:
255
+ case tn:
256
+ case nn:
257
+ case rn:
258
+ case an:
259
+ case on:
260
+ case sn:
261
+ case cn: return Ht(e, n);
262
+ case Gt: return new r();
263
+ case Kt:
264
+ case Yt: return new r(e);
265
+ case qt: return Rt(e);
266
+ case Jt: return new r();
267
+ case Xt: return Vt(e);
268
+ }
269
+ }
270
+ //#endregion
271
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_initCloneObject.js
272
+ function un(e) {
273
+ return typeof e.constructor == "function" && !ce(e) ? it(ft(e)) : {};
274
+ }
275
+ //#endregion
276
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseIsMap.js
277
+ var dn = "[object Map]";
278
+ function fn(e) {
279
+ return k(e) && x(e) == dn;
280
+ }
281
+ //#endregion
282
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/isMap.js
283
+ var pn = v && v.isMap, mn = pn ? g(pn) : fn, hn = "[object Set]";
284
+ function gn(e) {
285
+ return k(e) && x(e) == hn;
286
+ }
287
+ //#endregion
288
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/isSet.js
289
+ var _n = v && v.isSet, vn = _n ? g(_n) : gn, yn = 1, bn = 2, xn = 4, Sn = "[object Arguments]", Cn = "[object Array]", wn = "[object Boolean]", Tn = "[object Date]", En = "[object Error]", Dn = "[object Function]", On = "[object GeneratorFunction]", kn = "[object Map]", An = "[object Number]", jn = "[object Object]", Mn = "[object RegExp]", Nn = "[object Set]", Pn = "[object String]", Fn = "[object Symbol]", In = "[object WeakMap]", Ln = "[object ArrayBuffer]", Rn = "[object DataView]", zn = "[object Float32Array]", Bn = "[object Float64Array]", Vn = "[object Int8Array]", Hn = "[object Int16Array]", Un = "[object Int32Array]", Wn = "[object Uint8Array]", Gn = "[object Uint8ClampedArray]", Kn = "[object Uint16Array]", qn = "[object Uint32Array]", z = {};
290
+ z[Sn] = z[Cn] = z[Ln] = z[Rn] = z[wn] = z[Tn] = z[zn] = z[Bn] = z[Vn] = z[Hn] = z[Un] = z[kn] = z[An] = z[jn] = z[Mn] = z[Nn] = z[Pn] = z[Fn] = z[Wn] = z[Gn] = z[Kn] = z[qn] = !0, z[En] = z[Dn] = z[In] = !1;
291
+ function B(e, t, n, r, i, a) {
292
+ var o, s = t & yn, c = t & bn, l = t & xn;
293
+ if (n && (o = i ? n(e, r, i, a) : n(e)), o !== void 0) return o;
294
+ if (!b(e)) return e;
295
+ var u = y(e);
296
+ if (u) {
297
+ if (o = Pt(e), !s) return at(e, o);
298
+ } else {
299
+ var d = x(e), f = d == Dn || d == On;
300
+ if (te(e)) return Ot(e, s);
301
+ if (d == jn || d == Sn || f && !i) {
302
+ if (o = c || f ? {} : un(e), !s) return c ? jt(e, Ct(o, e)) : kt(e, St(o, e));
303
+ } else {
304
+ if (!z[d]) return i ? e : {};
305
+ o = ln(e, d, s);
306
+ }
307
+ }
308
+ a ||= new le();
309
+ var p = a.get(e);
310
+ if (p) return p;
311
+ a.set(e, o), vn(e) ? e.forEach(function(r) {
312
+ o.add(B(r, t, n, r, e, a));
313
+ }) : mn(e) && e.forEach(function(r, i) {
314
+ o.set(i, B(r, t, n, i, e, a));
315
+ });
316
+ var m = u ? void 0 : (l ? c ? Mt : Ne : c ? L : we)(e);
317
+ return ee(m || e, function(r, i) {
318
+ m && (i = r, r = e[i]), P(o, i, B(r, t, n, i, e, a));
319
+ }), o;
320
+ }
321
+ //#endregion
322
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/cloneDeep.js
323
+ var Jn = 1, Yn = 4;
324
+ function Xn(e) {
325
+ return B(e, Jn | Yn);
326
+ }
327
+ //#endregion
328
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/now.js
329
+ var Zn = function() {
330
+ return Se.Date.now();
331
+ }, Qn = Object.prototype, $n = Qn.hasOwnProperty, er = f(function(e, t) {
332
+ e = Object(e);
333
+ var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
334
+ for (i && I(t[0], t[1], i) && (r = 1); ++n < r;) for (var a = t[n], o = L(a), s = -1, c = o.length; ++s < c;) {
335
+ var l = o[s], u = e[l];
336
+ (u === void 0 || _(u, Qn[l]) && !$n.call(e, l)) && (e[l] = a[l]);
337
+ }
338
+ return e;
339
+ });
340
+ //#endregion
341
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_assignMergeValue.js
342
+ function tr(e, t, n) {
343
+ (n !== void 0 && !_(e[t], n) || n === void 0 && !(t in e)) && N(e, t, n);
344
+ }
345
+ //#endregion
346
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_safeGet.js
347
+ function nr(e, t) {
348
+ if (!(t === "constructor" && typeof e[t] == "function") && t != "__proto__") return e[t];
349
+ }
350
+ //#endregion
351
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toPlainObject.js
352
+ function rr(e) {
353
+ return F(e, L(e));
354
+ }
355
+ //#endregion
356
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseMergeDeep.js
357
+ function ir(e, t, n, r, i, a, o) {
358
+ var s = nr(e, n), c = nr(t, n), l = o.get(c);
359
+ if (l) {
360
+ tr(e, n, l);
361
+ return;
362
+ }
363
+ var u = a ? a(s, c, n + "", e, t, o) : void 0, d = u === void 0;
364
+ if (d) {
365
+ var f = y(c), p = !f && te(c), m = !f && !p && oe(c);
366
+ u = c, f || p || m ? y(s) ? u = s : _e(s) ? u = at(s) : p ? (d = !1, u = Ot(c, !0)) : m ? (d = !1, u = Ht(c, !0)) : u = [] : yt(c) || ie(c) ? (u = s, ie(s) ? u = rr(s) : (!b(s) || he(s)) && (u = un(c))) : d = !1;
367
+ }
368
+ d && (o.set(c, u), i(u, c, r, a, o), o.delete(c)), tr(e, n, u);
369
+ }
370
+ //#endregion
371
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseMerge.js
372
+ function ar(e, t, n, r, i) {
373
+ e !== t && ve(t, function(a, o) {
374
+ if (i ||= new le(), b(a)) ir(e, t, o, n, ar, r, i);
375
+ else {
376
+ var s = r ? r(nr(e, o), a, o + "", e, t, i) : void 0;
377
+ s === void 0 && (s = a), tr(e, o, s);
378
+ }
379
+ }, L);
380
+ }
381
+ //#endregion
382
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/last.js
383
+ function V(e) {
384
+ var t = e == null ? 0 : e.length;
385
+ return t ? e[t - 1] : void 0;
386
+ }
387
+ //#endregion
388
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createFind.js
389
+ function or(e) {
390
+ return function(t, n, r) {
391
+ var i = Object(t);
392
+ if (!A(t)) {
393
+ var a = C(n, 3);
394
+ t = we(t), n = function(e) {
395
+ return a(i[e], e, i);
396
+ };
397
+ }
398
+ var o = e(t, n, r);
399
+ return o > -1 ? i[a ? t[o] : o] : void 0;
400
+ };
401
+ }
402
+ //#endregion
403
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/findIndex.js
404
+ var sr = Math.max;
405
+ function cr(e, t, n) {
406
+ var r = e == null ? 0 : e.length;
407
+ if (!r) return -1;
408
+ var i = n == null ? 0 : nt(n);
409
+ return i < 0 && (i = sr(r + i, 0)), pe(e, C(t, 3), i);
410
+ }
411
+ //#endregion
412
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/find.js
413
+ var lr = or(cr);
414
+ //#endregion
415
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseMap.js
416
+ function ur(e, t) {
417
+ var n = -1, r = A(e) ? Array(e.length) : [];
418
+ return Te(e, function(e, i, a) {
419
+ r[++n] = t(e, i, a);
420
+ }), r;
421
+ }
422
+ //#endregion
423
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/map.js
424
+ function H(e, t) {
425
+ return (y(e) ? u : ur)(e, C(t, 3));
426
+ }
427
+ //#endregion
428
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/forIn.js
429
+ function dr(e, t) {
430
+ return e == null ? e : ve(e, je(t), L);
431
+ }
432
+ //#endregion
433
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/forOwn.js
434
+ function fr(e, t) {
435
+ return e && Me(e, je(t));
436
+ }
437
+ //#endregion
438
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseGt.js
439
+ function pr(e, t) {
440
+ return e > t;
441
+ }
442
+ //#endregion
443
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseHas.js
444
+ var mr = Object.prototype.hasOwnProperty;
445
+ function hr(e, t) {
446
+ return e != null && mr.call(e, t);
447
+ }
448
+ //#endregion
449
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/has.js
450
+ function gr(e, t) {
451
+ return e != null && xe(e, t, hr);
452
+ }
453
+ //#endregion
454
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/isString.js
455
+ var _r = "[object String]";
456
+ function vr(e) {
457
+ return typeof e == "string" || !y(e) && k(e) && De(e) == _r;
458
+ }
459
+ //#endregion
460
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseLt.js
461
+ function yr(e, t) {
462
+ return e < t;
463
+ }
464
+ //#endregion
465
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/mapValues.js
466
+ function U(e, t) {
467
+ var n = {};
468
+ return t = C(t, 3), Me(e, function(e, r, i) {
469
+ N(n, r, t(e, r, i));
470
+ }), n;
471
+ }
472
+ //#endregion
473
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseExtremum.js
474
+ function br(e, t, n) {
475
+ for (var r = -1, i = e.length; ++r < i;) {
476
+ var a = e[r], o = t(a);
477
+ if (o != null && (s === void 0 ? o === o && !ye(o) : n(o, s))) var s = o, c = a;
478
+ }
479
+ return c;
480
+ }
481
+ //#endregion
482
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/max.js
483
+ function W(e) {
484
+ return e && e.length ? br(e, me, pr) : void 0;
485
+ }
486
+ //#endregion
487
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/merge.js
488
+ var xr = st(function(e, t, n) {
489
+ ar(e, t, n);
490
+ });
491
+ //#endregion
492
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/min.js
493
+ function G(e) {
494
+ return e && e.length ? br(e, me, yr) : void 0;
495
+ }
496
+ //#endregion
497
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/minBy.js
498
+ function Sr(e, t) {
499
+ return e && e.length ? br(e, C(t, 2), yr) : void 0;
500
+ }
501
+ //#endregion
502
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseSet.js
503
+ function Cr(e, t, n, r) {
504
+ if (!b(e)) return e;
505
+ t = m(t, e);
506
+ for (var i = -1, a = t.length, o = a - 1, s = e; s != null && ++i < a;) {
507
+ var c = h(t[i]), l = n;
508
+ if (c === "__proto__" || c === "constructor" || c === "prototype") return e;
509
+ if (i != o) {
510
+ var u = s[c];
511
+ l = r ? r(u, c, s) : void 0, l === void 0 && (l = b(u) ? u : de(t[i + 1]) ? [] : {});
512
+ }
513
+ P(s, c, l), s = s[c];
514
+ }
515
+ return e;
516
+ }
517
+ //#endregion
518
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_basePickBy.js
519
+ function wr(e, t, n) {
520
+ for (var r = -1, i = t.length, a = {}; ++r < i;) {
521
+ var o = t[r], s = ue(e, o);
522
+ n(s, o) && Cr(a, m(o, e), s);
523
+ }
524
+ return a;
525
+ }
526
+ //#endregion
527
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseSortBy.js
528
+ function Tr(e, t) {
529
+ var n = e.length;
530
+ for (e.sort(t); n--;) e[n] = e[n].value;
531
+ return e;
532
+ }
533
+ //#endregion
534
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_compareAscending.js
535
+ function Er(e, t) {
536
+ if (e !== t) {
537
+ var n = e !== void 0, r = e === null, i = e === e, a = ye(e), o = t !== void 0, s = t === null, c = t === t, l = ye(t);
538
+ if (!s && !l && !a && e > t || a && o && c && !s && !l || r && o && c || !n && c || !i) return 1;
539
+ if (!r && !a && !l && e < t || l && n && i && !r && !a || s && n && i || !o && i || !c) return -1;
540
+ }
541
+ return 0;
542
+ }
543
+ //#endregion
544
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_compareMultiple.js
545
+ function Dr(e, t, n) {
546
+ for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
547
+ var c = Er(i[r], a[r]);
548
+ if (c) return r >= s ? c : c * (n[r] == "desc" ? -1 : 1);
549
+ }
550
+ return e.index - t.index;
551
+ }
552
+ //#endregion
553
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseOrderBy.js
554
+ function Or(e, t, n) {
555
+ t = t.length ? u(t, function(e) {
556
+ return y(e) ? function(t) {
557
+ return ue(t, e.length === 1 ? e[0] : e);
558
+ } : e;
559
+ }) : [me];
560
+ var r = -1;
561
+ return t = u(t, g(C)), Tr(ur(e, function(e, n, i) {
562
+ return {
563
+ criteria: u(t, function(t) {
564
+ return t(e);
565
+ }),
566
+ index: ++r,
567
+ value: e
568
+ };
569
+ }), function(e, t) {
570
+ return Dr(e, t, n);
571
+ });
572
+ }
573
+ //#endregion
574
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_asciiSize.js
575
+ var kr = Oe("length"), Ar = "\\ud800-\\udfff", jr = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", Mr = "\\ufe0e\\ufe0f", Nr = "[" + Ar + "]", Pr = "[" + jr + "]", Fr = "\\ud83c[\\udffb-\\udfff]", Ir = "(?:" + Pr + "|" + Fr + ")", Lr = "[^" + Ar + "]", Rr = "(?:\\ud83c[\\udde6-\\uddff]){2}", zr = "[\\ud800-\\udbff][\\udc00-\\udfff]", Br = "\\u200d", Vr = Ir + "?", Hr = "[" + Mr + "]?", Ur = "(?:" + Br + "(?:" + [
576
+ Lr,
577
+ Rr,
578
+ zr
579
+ ].join("|") + ")" + Hr + Vr + ")*", Wr = Hr + Vr + Ur, Gr = "(?:" + [
580
+ Lr + Pr + "?",
581
+ Pr,
582
+ Rr,
583
+ zr,
584
+ Nr
585
+ ].join("|") + ")", Kr = RegExp(Fr + "(?=" + Fr + ")|" + Gr + Wr, "g");
586
+ function qr(e) {
587
+ for (var t = Kr.lastIndex = 0; Kr.test(e);) ++t;
588
+ return t;
589
+ }
590
+ //#endregion
591
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_stringSize.js
592
+ function Jr(e) {
593
+ return xt(e) ? qr(e) : kr(e);
594
+ }
595
+ //#endregion
596
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_basePick.js
597
+ function Yr(e, t) {
598
+ return wr(e, t, function(t, n) {
599
+ return Ee(e, n);
600
+ });
601
+ }
602
+ //#endregion
603
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/pick.js
604
+ var K = dt(function(e, t) {
605
+ return e == null ? {} : Yr(e, t);
606
+ }), Xr = Math.ceil, Zr = Math.max;
607
+ function Qr(e, t, n, r) {
608
+ for (var i = -1, a = Zr(Xr((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
609
+ return o;
610
+ }
611
+ //#endregion
612
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createRange.js
613
+ function $r(e) {
614
+ return function(t, n, r) {
615
+ return r && typeof r != "number" && I(t, n, r) && (n = r = void 0), t = M(t), n === void 0 ? (n = t, t = 0) : n = M(n), r = r === void 0 ? t < n ? 1 : -1 : M(r), Qr(t, n, r, e);
616
+ };
617
+ }
618
+ //#endregion
619
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/range.js
620
+ var q = $r(), ei = "[object Map]", ti = "[object Set]";
621
+ function ni(e) {
622
+ if (e == null) return 0;
623
+ if (A(e)) return vr(e) ? Jr(e) : e.length;
624
+ var t = x(e);
625
+ return t == ei || t == ti ? e.size : d(e).length;
626
+ }
627
+ //#endregion
628
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/sortBy.js
629
+ var J = f(function(e, t) {
630
+ if (e == null) return [];
631
+ var n = t.length;
632
+ return n > 1 && I(e, t[0], t[1]) ? t = [] : n > 2 && I(t[0], t[1], t[2]) && (t = [t[0]]), Or(e, p(t, 1), []);
633
+ }), ri = 0;
634
+ function ii(e) {
635
+ var t = ++ri;
636
+ return se(e) + t;
637
+ }
638
+ //#endregion
639
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseZipObject.js
640
+ function ai(e, t, n) {
641
+ for (var r = -1, i = e.length, a = t.length, o = {}; ++r < i;) {
642
+ var s = r < a ? t[r] : void 0;
643
+ n(o, e[r], s);
644
+ }
645
+ return o;
646
+ }
647
+ //#endregion
648
+ //#region node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/zipObject.js
649
+ function oi(e, t) {
650
+ return ai(e || [], t || [], P);
651
+ }
652
+ //#endregion
653
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/data/list.js
654
+ var si = class {
655
+ constructor() {
656
+ var e = {};
657
+ e._next = e._prev = e, this._sentinel = e;
658
+ }
659
+ dequeue() {
660
+ var e = this._sentinel, t = e._prev;
661
+ if (t !== e) return ci(t), t;
662
+ }
663
+ enqueue(e) {
664
+ var t = this._sentinel;
665
+ e._prev && e._next && ci(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
666
+ }
667
+ toString() {
668
+ for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, li)), n = n._prev;
669
+ return "[" + e.join(", ") + "]";
670
+ }
671
+ };
672
+ function ci(e) {
673
+ e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
674
+ }
675
+ function li(e, t) {
676
+ if (e !== "_next" && e !== "_prev") return t;
677
+ }
678
+ //#endregion
679
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/greedy-fas.js
680
+ var ui = ne(1);
681
+ function di(e, t) {
682
+ if (e.nodeCount() <= 1) return [];
683
+ var n = mi(e, t || ui);
684
+ return R(H(fi(n.graph, n.buckets, n.zeroIdx), function(t) {
685
+ return e.outEdges(t.v, t.w);
686
+ }));
687
+ }
688
+ function fi(e, t, n) {
689
+ for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
690
+ for (; o = a.dequeue();) pi(e, t, n, o);
691
+ for (; o = i.dequeue();) pi(e, t, n, o);
692
+ if (e.nodeCount()) {
693
+ for (var s = t.length - 2; s > 0; --s) if (o = t[s].dequeue(), o) {
694
+ r = r.concat(pi(e, t, n, o, !0));
695
+ break;
696
+ }
697
+ }
698
+ }
699
+ return r;
700
+ }
701
+ function pi(e, t, n, r, i) {
702
+ var a = i ? [] : void 0;
703
+ return E(e.inEdges(r.v), function(r) {
704
+ var o = e.edge(r), s = e.node(r.v);
705
+ i && a.push({
706
+ v: r.v,
707
+ w: r.w
708
+ }), s.out -= o, hi(t, n, s);
709
+ }), E(e.outEdges(r.v), function(r) {
710
+ var i = e.edge(r), a = r.w, o = e.node(a);
711
+ o.in -= i, hi(t, n, o);
712
+ }), e.removeNode(r.v), a;
713
+ }
714
+ function mi(e, t) {
715
+ var n = new O(), r = 0, i = 0;
716
+ E(e.nodes(), function(e) {
717
+ n.setNode(e, {
718
+ v: e,
719
+ in: 0,
720
+ out: 0
721
+ });
722
+ }), E(e.edges(), function(e) {
723
+ var a = n.edge(e.v, e.w) || 0, o = t(e), s = a + o;
724
+ 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);
725
+ });
726
+ var a = q(i + r + 3).map(function() {
727
+ return new si();
728
+ }), o = r + 1;
729
+ return E(n.nodes(), function(e) {
730
+ hi(a, o, n.node(e));
731
+ }), {
732
+ graph: n,
733
+ buckets: a,
734
+ zeroIdx: o
735
+ };
736
+ }
737
+ function hi(e, t, n) {
738
+ n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
739
+ }
740
+ //#endregion
741
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/acyclic.js
742
+ function gi(e) {
743
+ E(e.graph().acyclicer === "greedy" ? di(e, t(e)) : _i(e), function(t) {
744
+ var n = e.edge(t);
745
+ e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, ii("rev"));
746
+ });
747
+ function t(e) {
748
+ return function(t) {
749
+ return e.edge(t).weight;
750
+ };
751
+ }
752
+ }
753
+ function _i(e) {
754
+ var t = [], n = {}, r = {};
755
+ function i(a) {
756
+ Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, E(e.outEdges(a), function(e) {
757
+ Object.prototype.hasOwnProperty.call(n, e.w) ? t.push(e) : i(e.w);
758
+ }), delete n[a]);
759
+ }
760
+ return E(e.nodes(), i), t;
761
+ }
762
+ function vi(e) {
763
+ E(e.edges(), function(t) {
764
+ var n = e.edge(t);
765
+ if (n.reversed) {
766
+ e.removeEdge(t);
767
+ var r = n.forwardName;
768
+ delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
769
+ }
770
+ });
771
+ }
772
+ //#endregion
773
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/util.js
774
+ function Y(e, t, n, r) {
775
+ var i;
776
+ do
777
+ i = ii(r);
778
+ while (e.hasNode(i));
779
+ return n.dummy = t, e.setNode(i, n), i;
780
+ }
781
+ function yi(e) {
782
+ var t = new O().setGraph(e.graph());
783
+ return E(e.nodes(), function(n) {
784
+ t.setNode(n, e.node(n));
785
+ }), E(e.edges(), function(n) {
786
+ var r = t.edge(n.v, n.w) || {
787
+ weight: 0,
788
+ minlen: 1
789
+ }, i = e.edge(n);
790
+ t.setEdge(n.v, n.w, {
791
+ weight: r.weight + i.weight,
792
+ minlen: Math.max(r.minlen, i.minlen)
793
+ });
794
+ }), t;
795
+ }
796
+ function bi(e) {
797
+ var t = new O({ multigraph: e.isMultigraph() }).setGraph(e.graph());
798
+ return E(e.nodes(), function(n) {
799
+ e.children(n).length || t.setNode(n, e.node(n));
800
+ }), E(e.edges(), function(n) {
801
+ t.setEdge(n, e.edge(n));
802
+ }), t;
803
+ }
804
+ function xi(e, t) {
805
+ var n = e.x, r = e.y, i = t.x - n, a = t.y - r, o = e.width / 2, s = e.height / 2;
806
+ if (!i && !a) throw Error("Not possible to find intersection inside of the rectangle");
807
+ var c, l;
808
+ 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), {
809
+ x: n + c,
810
+ y: r + l
811
+ };
812
+ }
813
+ function X(e) {
814
+ var t = H(q(Ti(e) + 1), function() {
815
+ return [];
816
+ });
817
+ return E(e.nodes(), function(n) {
818
+ var r = e.node(n), i = r.rank;
819
+ D(i) || (t[i][r.order] = n);
820
+ }), t;
821
+ }
822
+ function Si(e) {
823
+ var t = G(H(e.nodes(), function(t) {
824
+ return e.node(t).rank;
825
+ }));
826
+ E(e.nodes(), function(n) {
827
+ var r = e.node(n);
828
+ gr(r, "rank") && (r.rank -= t);
829
+ });
830
+ }
831
+ function Ci(e) {
832
+ var t = G(H(e.nodes(), function(t) {
833
+ return e.node(t).rank;
834
+ })), n = [];
835
+ E(e.nodes(), function(r) {
836
+ var i = e.node(r).rank - t;
837
+ n[i] || (n[i] = []), n[i].push(r);
838
+ });
839
+ var r = 0, i = e.graph().nodeRankFactor;
840
+ E(n, function(t, n) {
841
+ D(t) && n % i !== 0 ? --r : r && E(t, function(t) {
842
+ e.node(t).rank += r;
843
+ });
844
+ });
845
+ }
846
+ function wi(e, t, n, r) {
847
+ var i = {
848
+ width: 0,
849
+ height: 0
850
+ };
851
+ return arguments.length >= 4 && (i.rank = n, i.order = r), Y(e, "border", i, t);
852
+ }
853
+ function Ti(e) {
854
+ return W(H(e.nodes(), function(t) {
855
+ var n = e.node(t).rank;
856
+ if (!D(n)) return n;
857
+ }));
858
+ }
859
+ function Ei(e, t) {
860
+ var n = {
861
+ lhs: [],
862
+ rhs: []
863
+ };
864
+ return E(e, function(e) {
865
+ t(e) ? n.lhs.push(e) : n.rhs.push(e);
866
+ }), n;
867
+ }
868
+ function Di(e, t) {
869
+ var n = Zn();
870
+ try {
871
+ return t();
872
+ } finally {
873
+ console.log(e + " time: " + (Zn() - n) + "ms");
874
+ }
875
+ }
876
+ function Oi(e, t) {
877
+ return t();
878
+ }
879
+ //#endregion
880
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/add-border-segments.js
881
+ function ki(e) {
882
+ function t(n) {
883
+ var r = e.children(n), i = e.node(n);
884
+ if (r.length && E(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
885
+ i.borderLeft = [], i.borderRight = [];
886
+ for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) Ai(e, "borderLeft", "_bl", n, i, a), Ai(e, "borderRight", "_br", n, i, a);
887
+ }
888
+ }
889
+ E(e.children(), t);
890
+ }
891
+ function Ai(e, t, n, r, i, a) {
892
+ var o = {
893
+ width: 0,
894
+ height: 0,
895
+ rank: a,
896
+ borderType: t
897
+ }, s = i[t][a - 1], c = Y(e, "border", o, n);
898
+ i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
899
+ }
900
+ //#endregion
901
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/coordinate-system.js
902
+ function ji(e) {
903
+ var t = e.graph().rankdir.toLowerCase();
904
+ (t === "lr" || t === "rl") && Ni(e);
905
+ }
906
+ function Mi(e) {
907
+ var t = e.graph().rankdir.toLowerCase();
908
+ (t === "bt" || t === "rl") && Fi(e), (t === "lr" || t === "rl") && (Li(e), Ni(e));
909
+ }
910
+ function Ni(e) {
911
+ E(e.nodes(), function(t) {
912
+ Pi(e.node(t));
913
+ }), E(e.edges(), function(t) {
914
+ Pi(e.edge(t));
915
+ });
916
+ }
917
+ function Pi(e) {
918
+ var t = e.width;
919
+ e.width = e.height, e.height = t;
920
+ }
921
+ function Fi(e) {
922
+ E(e.nodes(), function(t) {
923
+ Ii(e.node(t));
924
+ }), E(e.edges(), function(t) {
925
+ var n = e.edge(t);
926
+ E(n.points, Ii), Object.prototype.hasOwnProperty.call(n, "y") && Ii(n);
927
+ });
928
+ }
929
+ function Ii(e) {
930
+ e.y = -e.y;
931
+ }
932
+ function Li(e) {
933
+ E(e.nodes(), function(t) {
934
+ Ri(e.node(t));
935
+ }), E(e.edges(), function(t) {
936
+ var n = e.edge(t);
937
+ E(n.points, Ri), Object.prototype.hasOwnProperty.call(n, "x") && Ri(n);
938
+ });
939
+ }
940
+ function Ri(e) {
941
+ var t = e.x;
942
+ e.x = e.y, e.y = t;
943
+ }
944
+ //#endregion
945
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/normalize.js
946
+ function zi(e) {
947
+ e.graph().dummyChains = [], E(e.edges(), function(t) {
948
+ Bi(e, t);
949
+ });
950
+ }
951
+ function Bi(e, t) {
952
+ 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;
953
+ if (a !== r + 1) {
954
+ e.removeEdge(t);
955
+ var l = void 0, u, d;
956
+ for (d = 0, ++r; r < a; ++d, ++r) s.points = [], l = {
957
+ width: 0,
958
+ height: 0,
959
+ edgeLabel: s,
960
+ edgeObj: t,
961
+ rank: r
962
+ }, 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;
963
+ e.setEdge(n, i, { weight: s.weight }, o);
964
+ }
965
+ }
966
+ function Vi(e) {
967
+ E(e.graph().dummyChains, function(t) {
968
+ var n = e.node(t), r = n.edgeLabel, i;
969
+ for (e.setEdge(n.edgeObj, r); n.dummy;) i = e.successors(t)[0], e.removeNode(t), r.points.push({
970
+ x: n.x,
971
+ y: n.y
972
+ }), 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);
973
+ });
974
+ }
975
+ //#endregion
976
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/util.js
977
+ function Hi(e) {
978
+ var t = {};
979
+ function n(r) {
980
+ var i = e.node(r);
981
+ if (Object.prototype.hasOwnProperty.call(t, r)) return i.rank;
982
+ t[r] = !0;
983
+ var a = G(H(e.outEdges(r), function(t) {
984
+ return n(t.w) - e.edge(t).minlen;
985
+ }));
986
+ return (a === Infinity || a == null) && (a = 0), i.rank = a;
987
+ }
988
+ E(e.sources(), n);
989
+ }
990
+ function Z(e, t) {
991
+ return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
992
+ }
993
+ //#endregion
994
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
995
+ function Ui(e) {
996
+ var t = new O({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
997
+ t.setNode(n, {});
998
+ for (var i, a; Wi(t, e) < r;) i = Gi(t, e), a = t.hasNode(i.v) ? Z(e, i) : -Z(e, i), Ki(t, e, a);
999
+ return t;
1000
+ }
1001
+ function Wi(e, t) {
1002
+ function n(r) {
1003
+ E(t.nodeEdges(r), function(i) {
1004
+ var a = i.v, o = r === a ? i.w : a;
1005
+ !e.hasNode(o) && !Z(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
1006
+ });
1007
+ }
1008
+ return E(e.nodes(), n), e.nodeCount();
1009
+ }
1010
+ function Gi(e, t) {
1011
+ return Sr(t.edges(), function(n) {
1012
+ if (e.hasNode(n.v) !== e.hasNode(n.w)) return Z(t, n);
1013
+ });
1014
+ }
1015
+ function Ki(e, t, n) {
1016
+ E(e.nodes(), function(e) {
1017
+ t.node(e).rank += n;
1018
+ });
1019
+ }
1020
+ //#endregion
1021
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
1022
+ ne(1), ne(1), qi.CycleException = Q;
1023
+ function qi(e) {
1024
+ var t = {}, n = {}, r = [];
1025
+ function i(a) {
1026
+ if (Object.prototype.hasOwnProperty.call(n, a)) throw new Q();
1027
+ Object.prototype.hasOwnProperty.call(t, a) || (n[a] = !0, t[a] = !0, E(e.predecessors(a), i), delete n[a], r.push(a));
1028
+ }
1029
+ if (E(e.sinks(), i), ni(t) !== e.nodeCount()) throw new Q();
1030
+ return r;
1031
+ }
1032
+ function Q() {}
1033
+ Q.prototype = /* @__PURE__ */ Error();
1034
+ //#endregion
1035
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
1036
+ function Ji(e, t, n) {
1037
+ y(t) || (t = [t]);
1038
+ var r = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], a = {};
1039
+ return E(t, function(t) {
1040
+ if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
1041
+ Yi(e, t, n === "post", a, r, i);
1042
+ }), i;
1043
+ }
1044
+ function Yi(e, t, n, r, i, a) {
1045
+ Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), E(i(t), function(t) {
1046
+ Yi(e, t, n, r, i, a);
1047
+ }), n && a.push(t));
1048
+ }
1049
+ //#endregion
1050
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
1051
+ function Xi(e, t) {
1052
+ return Ji(e, t, "post");
1053
+ }
1054
+ //#endregion
1055
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
1056
+ function Zi(e, t) {
1057
+ return Ji(e, t, "pre");
1058
+ }
1059
+ $.initLowLimValues = ta, $.initCutValues = Qi, $.calcCutValue = ea, $.leaveEdge = ra, $.enterEdge = ia, $.exchangeEdges = aa;
1060
+ function $(e) {
1061
+ e = yi(e), Hi(e);
1062
+ var t = Ui(e);
1063
+ ta(t), Qi(t, e);
1064
+ for (var n, r; n = ra(t);) r = ia(t, e, n), aa(t, e, n, r);
1065
+ }
1066
+ function Qi(e, t) {
1067
+ var n = Xi(e, e.nodes());
1068
+ n = n.slice(0, n.length - 1), E(n, function(n) {
1069
+ $i(e, t, n);
1070
+ });
1071
+ }
1072
+ function $i(e, t, n) {
1073
+ var r = e.node(n).parent;
1074
+ e.edge(n, r).cutvalue = ea(e, t, n);
1075
+ }
1076
+ function ea(e, t, n) {
1077
+ var r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
1078
+ return a ||= (i = !1, t.edge(r, n)), o = a.weight, E(t.nodeEdges(n), function(a) {
1079
+ var s = a.v === n, c = s ? a.w : a.v;
1080
+ if (c !== r) {
1081
+ var l = s === i, u = t.edge(a).weight;
1082
+ if (o += l ? u : -u, sa(e, n, c)) {
1083
+ var d = e.edge(n, c).cutvalue;
1084
+ o += l ? -d : d;
1085
+ }
1086
+ }
1087
+ }), o;
1088
+ }
1089
+ function ta(e, t) {
1090
+ arguments.length < 2 && (t = e.nodes()[0]), na(e, {}, 1, t);
1091
+ }
1092
+ function na(e, t, n, r, i) {
1093
+ var a = n, o = e.node(r);
1094
+ return t[r] = !0, E(e.neighbors(r), function(i) {
1095
+ Object.prototype.hasOwnProperty.call(t, i) || (n = na(e, t, n, i, r));
1096
+ }), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
1097
+ }
1098
+ function ra(e) {
1099
+ return lr(e.edges(), function(t) {
1100
+ return e.edge(t).cutvalue < 0;
1101
+ });
1102
+ }
1103
+ function ia(e, t, n) {
1104
+ var r = n.v, i = n.w;
1105
+ t.hasEdge(r, i) || (r = n.w, i = n.v);
1106
+ var a = e.node(r), o = e.node(i), s = a, c = !1;
1107
+ return a.lim > o.lim && (s = o, c = !0), Sr(S(t.edges(), function(t) {
1108
+ return c === ca(e, e.node(t.v), s) && c !== ca(e, e.node(t.w), s);
1109
+ }), function(e) {
1110
+ return Z(t, e);
1111
+ });
1112
+ }
1113
+ function aa(e, t, n, r) {
1114
+ var i = n.v, a = n.w;
1115
+ e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), ta(e), Qi(e, t), oa(e, t);
1116
+ }
1117
+ function oa(e, t) {
1118
+ var n = Zi(e, lr(e.nodes(), function(e) {
1119
+ return !t.node(e).parent;
1120
+ }));
1121
+ n = n.slice(1), E(n, function(n) {
1122
+ var r = e.node(n).parent, i = t.edge(n, r), a = !1;
1123
+ i || (i = t.edge(r, n), a = !0), t.node(n).rank = t.node(r).rank + (a ? i.minlen : -i.minlen);
1124
+ });
1125
+ }
1126
+ function sa(e, t, n) {
1127
+ return e.hasEdge(t, n);
1128
+ }
1129
+ function ca(e, t, n) {
1130
+ return n.low <= t.lim && t.lim <= n.lim;
1131
+ }
1132
+ //#endregion
1133
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/index.js
1134
+ function la(e) {
1135
+ switch (e.graph().ranker) {
1136
+ case "network-simplex":
1137
+ fa(e);
1138
+ break;
1139
+ case "tight-tree":
1140
+ da(e);
1141
+ break;
1142
+ case "longest-path":
1143
+ ua(e);
1144
+ break;
1145
+ default: fa(e);
1146
+ }
1147
+ }
1148
+ var ua = Hi;
1149
+ function da(e) {
1150
+ Hi(e), Ui(e);
1151
+ }
1152
+ function fa(e) {
1153
+ $(e);
1154
+ }
1155
+ //#endregion
1156
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/nesting-graph.js
1157
+ function pa(e) {
1158
+ var t = Y(e, "root", {}, "_root"), n = ha(e), r = W(w(n)) - 1, i = 2 * r + 1;
1159
+ e.graph().nestingRoot = t, E(e.edges(), function(t) {
1160
+ e.edge(t).minlen *= i;
1161
+ });
1162
+ var a = ga(e) + 1;
1163
+ E(e.children(), function(o) {
1164
+ ma(e, t, i, a, r, n, o);
1165
+ }), e.graph().nodeRankFactor = i;
1166
+ }
1167
+ function ma(e, t, n, r, i, a, o) {
1168
+ var s = e.children(o);
1169
+ if (!s.length) {
1170
+ o !== t && e.setEdge(t, o, {
1171
+ weight: 0,
1172
+ minlen: n
1173
+ });
1174
+ return;
1175
+ }
1176
+ var c = wi(e, "_bt"), l = wi(e, "_bb"), u = e.node(o);
1177
+ e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, E(s, function(s) {
1178
+ ma(e, t, n, r, i, a, s);
1179
+ 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;
1180
+ e.setEdge(c, d, {
1181
+ weight: p,
1182
+ minlen: m,
1183
+ nestingEdge: !0
1184
+ }), e.setEdge(f, l, {
1185
+ weight: p,
1186
+ minlen: m,
1187
+ nestingEdge: !0
1188
+ });
1189
+ }), e.parent(o) || e.setEdge(t, c, {
1190
+ weight: 0,
1191
+ minlen: i + a[o]
1192
+ });
1193
+ }
1194
+ function ha(e) {
1195
+ var t = {};
1196
+ function n(r, i) {
1197
+ var a = e.children(r);
1198
+ a && a.length && E(a, function(e) {
1199
+ n(e, i + 1);
1200
+ }), t[r] = i;
1201
+ }
1202
+ return E(e.children(), function(e) {
1203
+ n(e, 1);
1204
+ }), t;
1205
+ }
1206
+ function ga(e) {
1207
+ return T(e.edges(), function(t, n) {
1208
+ return t + e.edge(n).weight;
1209
+ }, 0);
1210
+ }
1211
+ function _a(e) {
1212
+ var t = e.graph();
1213
+ e.removeNode(t.nestingRoot), delete t.nestingRoot, E(e.edges(), function(t) {
1214
+ e.edge(t).nestingEdge && e.removeEdge(t);
1215
+ });
1216
+ }
1217
+ //#endregion
1218
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
1219
+ function va(e, t, n) {
1220
+ var r = {}, i;
1221
+ E(n, function(n) {
1222
+ for (var a = e.parent(n), o, s; a;) {
1223
+ if (o = e.parent(a), o ? (s = r[o], r[o] = a) : (s = i, i = a), s && s !== a) {
1224
+ t.setEdge(s, a);
1225
+ return;
1226
+ }
1227
+ a = o;
1228
+ }
1229
+ });
1230
+ }
1231
+ //#endregion
1232
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
1233
+ function ya(e, t, n) {
1234
+ var r = ba(e), i = new O({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
1235
+ return e.node(t);
1236
+ });
1237
+ return E(e.nodes(), function(a) {
1238
+ var o = e.node(a), s = e.parent(a);
1239
+ (o.rank === t || o.minRank <= t && t <= o.maxRank) && (i.setNode(a), i.setParent(a, s || r), E(e[n](a), function(t) {
1240
+ var n = t.v === a ? t.w : t.v, r = i.edge(n, a), o = D(r) ? 0 : r.weight;
1241
+ i.setEdge(n, a, { weight: e.edge(t).weight + o });
1242
+ }), Object.prototype.hasOwnProperty.call(o, "minRank") && i.setNode(a, {
1243
+ borderLeft: o.borderLeft[t],
1244
+ borderRight: o.borderRight[t]
1245
+ }));
1246
+ }), i;
1247
+ }
1248
+ function ba(e) {
1249
+ for (var t; e.hasNode(t = ii("_root")););
1250
+ return t;
1251
+ }
1252
+ //#endregion
1253
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/cross-count.js
1254
+ function xa(e, t) {
1255
+ for (var n = 0, r = 1; r < t.length; ++r) n += Sa(e, t[r - 1], t[r]);
1256
+ return n;
1257
+ }
1258
+ function Sa(e, t, n) {
1259
+ for (var r = oi(n, H(n, function(e, t) {
1260
+ return t;
1261
+ })), i = R(H(t, function(t) {
1262
+ return J(H(e.outEdges(t), function(t) {
1263
+ return {
1264
+ pos: r[t.w],
1265
+ weight: e.edge(t).weight
1266
+ };
1267
+ }), "pos");
1268
+ })), a = 1; a < n.length;) a <<= 1;
1269
+ var o = 2 * a - 1;
1270
+ --a;
1271
+ var s = H(Array(o), function() {
1272
+ return 0;
1273
+ }), c = 0;
1274
+ return E(i.forEach(function(e) {
1275
+ var t = e.pos + a;
1276
+ s[t] += e.weight;
1277
+ for (var n = 0; t > 0;) t % 2 && (n += s[t + 1]), t = t - 1 >> 1, s[t] += e.weight;
1278
+ c += e.weight * n;
1279
+ })), c;
1280
+ }
1281
+ //#endregion
1282
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/init-order.js
1283
+ function Ca(e) {
1284
+ var t = {}, n = S(e.nodes(), function(t) {
1285
+ return !e.children(t).length;
1286
+ }), r = H(q(W(H(n, function(t) {
1287
+ return e.node(t).rank;
1288
+ })) + 1), function() {
1289
+ return [];
1290
+ });
1291
+ function i(n) {
1292
+ gr(t, n) || (t[n] = !0, r[e.node(n).rank].push(n), E(e.successors(n), i));
1293
+ }
1294
+ return E(J(n, function(t) {
1295
+ return e.node(t).rank;
1296
+ }), i), r;
1297
+ }
1298
+ //#endregion
1299
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/barycenter.js
1300
+ function wa(e, t) {
1301
+ return H(t, function(t) {
1302
+ var n = e.inEdges(t);
1303
+ if (n.length) {
1304
+ var r = T(n, function(t, n) {
1305
+ var r = e.edge(n), i = e.node(n.v);
1306
+ return {
1307
+ sum: t.sum + r.weight * i.order,
1308
+ weight: t.weight + r.weight
1309
+ };
1310
+ }, {
1311
+ sum: 0,
1312
+ weight: 0
1313
+ });
1314
+ return {
1315
+ v: t,
1316
+ barycenter: r.sum / r.weight,
1317
+ weight: r.weight
1318
+ };
1319
+ } else return { v: t };
1320
+ });
1321
+ }
1322
+ //#endregion
1323
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
1324
+ function Ta(e, t) {
1325
+ var n = {};
1326
+ return E(e, function(e, t) {
1327
+ var r = n[e.v] = {
1328
+ indegree: 0,
1329
+ in: [],
1330
+ out: [],
1331
+ vs: [e.v],
1332
+ i: t
1333
+ };
1334
+ D(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
1335
+ }), E(t.edges(), function(e) {
1336
+ var t = n[e.v], r = n[e.w];
1337
+ !D(t) && !D(r) && (r.indegree++, t.out.push(n[e.w]));
1338
+ }), Ea(S(n, function(e) {
1339
+ return !e.indegree;
1340
+ }));
1341
+ }
1342
+ function Ea(e) {
1343
+ var t = [];
1344
+ function n(e) {
1345
+ return function(t) {
1346
+ t.merged || (D(t.barycenter) || D(e.barycenter) || t.barycenter >= e.barycenter) && Da(e, t);
1347
+ };
1348
+ }
1349
+ function r(t) {
1350
+ return function(n) {
1351
+ n.in.push(t), --n.indegree === 0 && e.push(n);
1352
+ };
1353
+ }
1354
+ for (; e.length;) {
1355
+ var i = e.pop();
1356
+ t.push(i), E(i.in.reverse(), n(i)), E(i.out, r(i));
1357
+ }
1358
+ return H(S(t, function(e) {
1359
+ return !e.merged;
1360
+ }), function(e) {
1361
+ return K(e, [
1362
+ "vs",
1363
+ "i",
1364
+ "barycenter",
1365
+ "weight"
1366
+ ]);
1367
+ });
1368
+ }
1369
+ function Da(e, t) {
1370
+ var n = 0, r = 0;
1371
+ 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;
1372
+ }
1373
+ //#endregion
1374
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort.js
1375
+ function Oa(e, t) {
1376
+ var n = Ei(e, function(e) {
1377
+ return Object.prototype.hasOwnProperty.call(e, "barycenter");
1378
+ }), r = n.lhs, i = J(n.rhs, function(e) {
1379
+ return -e.i;
1380
+ }), a = [], o = 0, s = 0, c = 0;
1381
+ r.sort(Aa(!!t)), c = ka(a, i, c), E(r, function(e) {
1382
+ c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = ka(a, i, c);
1383
+ });
1384
+ var l = { vs: R(a) };
1385
+ return s && (l.barycenter = o / s, l.weight = s), l;
1386
+ }
1387
+ function ka(e, t, n) {
1388
+ for (var r; t.length && (r = V(t)).i <= n;) t.pop(), e.push(r.vs), n++;
1389
+ return n;
1390
+ }
1391
+ function Aa(e) {
1392
+ return function(t, n) {
1393
+ return t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
1394
+ };
1395
+ }
1396
+ //#endregion
1397
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
1398
+ function ja(e, t, n, r) {
1399
+ var i = e.children(t), a = e.node(t), o = a ? a.borderLeft : void 0, s = a ? a.borderRight : void 0, c = {};
1400
+ o && (i = S(i, function(e) {
1401
+ return e !== o && e !== s;
1402
+ }));
1403
+ var l = wa(e, i);
1404
+ E(l, function(t) {
1405
+ if (e.children(t.v).length) {
1406
+ var i = ja(e, t.v, n, r);
1407
+ c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && Na(t, i);
1408
+ }
1409
+ });
1410
+ var u = Ta(l, n);
1411
+ Ma(u, c);
1412
+ var d = Oa(u, r);
1413
+ if (o && (d.vs = R([
1414
+ o,
1415
+ d.vs,
1416
+ s
1417
+ ]), e.predecessors(o).length)) {
1418
+ var f = e.node(e.predecessors(o)[0]), p = e.node(e.predecessors(s)[0]);
1419
+ 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;
1420
+ }
1421
+ return d;
1422
+ }
1423
+ function Ma(e, t) {
1424
+ E(e, function(e) {
1425
+ e.vs = R(e.vs.map(function(e) {
1426
+ return t[e] ? t[e].vs : e;
1427
+ }));
1428
+ });
1429
+ }
1430
+ function Na(e, t) {
1431
+ 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);
1432
+ }
1433
+ //#endregion
1434
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/index.js
1435
+ function Pa(e) {
1436
+ var t = Ti(e), n = Fa(e, q(1, t + 1), "inEdges"), r = Fa(e, q(t - 1, -1, -1), "outEdges"), i = Ca(e);
1437
+ La(e, i);
1438
+ for (var a = Infinity, o, s = 0, c = 0; c < 4; ++s, ++c) {
1439
+ Ia(s % 2 ? n : r, s % 4 >= 2), i = X(e);
1440
+ var l = xa(e, i);
1441
+ l < a && (c = 0, o = Xn(i), a = l);
1442
+ }
1443
+ La(e, o);
1444
+ }
1445
+ function Fa(e, t, n) {
1446
+ return H(t, function(t) {
1447
+ return ya(e, t, n);
1448
+ });
1449
+ }
1450
+ function Ia(e, t) {
1451
+ var n = new O();
1452
+ E(e, function(e) {
1453
+ var r = e.graph().root, i = ja(e, r, n, t);
1454
+ E(i.vs, function(t, n) {
1455
+ e.node(t).order = n;
1456
+ }), va(e, n, i.vs);
1457
+ });
1458
+ }
1459
+ function La(e, t) {
1460
+ E(t, function(t) {
1461
+ E(t, function(t, n) {
1462
+ e.node(t).order = n;
1463
+ });
1464
+ });
1465
+ }
1466
+ //#endregion
1467
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
1468
+ function Ra(e) {
1469
+ var t = Ba(e);
1470
+ E(e.graph().dummyChains, function(n) {
1471
+ for (var r = e.node(n), i = r.edgeObj, a = za(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; n !== i.w;) {
1472
+ if (r = e.node(n), u) {
1473
+ for (; (l = o[c]) !== s && e.node(l).maxRank < r.rank;) c++;
1474
+ l === s && (u = !1);
1475
+ }
1476
+ if (!u) {
1477
+ for (; c < o.length - 1 && e.node(l = o[c + 1]).minRank <= r.rank;) c++;
1478
+ l = o[c];
1479
+ }
1480
+ e.setParent(n, l), n = e.successors(n)[0];
1481
+ }
1482
+ });
1483
+ }
1484
+ function za(e, t, n, r) {
1485
+ var i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c = n, l;
1486
+ do
1487
+ c = e.parent(c), i.push(c);
1488
+ while (c && (t[c].low > o || s > t[c].lim));
1489
+ for (l = c, c = r; (c = e.parent(c)) !== l;) a.push(c);
1490
+ return {
1491
+ path: i.concat(a.reverse()),
1492
+ lca: l
1493
+ };
1494
+ }
1495
+ function Ba(e) {
1496
+ var t = {}, n = 0;
1497
+ function r(i) {
1498
+ var a = n;
1499
+ E(e.children(i), r), t[i] = {
1500
+ low: a,
1501
+ lim: n++
1502
+ };
1503
+ }
1504
+ return E(e.children(), r), t;
1505
+ }
1506
+ //#endregion
1507
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/bk.js
1508
+ function Va(e, t) {
1509
+ var n = {};
1510
+ function r(t, r) {
1511
+ var i = 0, a = 0, o = t.length, s = V(r);
1512
+ return E(r, function(t, c) {
1513
+ var l = Ua(e, t), u = l ? e.node(l).order : o;
1514
+ (l || t === s) && (E(r.slice(a, c + 1), function(t) {
1515
+ E(e.predecessors(t), function(r) {
1516
+ var a = e.node(r), o = a.order;
1517
+ (o < i || u < o) && !(a.dummy && e.node(t).dummy) && Wa(n, r, t);
1518
+ });
1519
+ }), a = c + 1, i = u);
1520
+ }), r;
1521
+ }
1522
+ return T(t, r), n;
1523
+ }
1524
+ function Ha(e, t) {
1525
+ var n = {};
1526
+ function r(t, r, i, a, o) {
1527
+ var s;
1528
+ E(q(r, i), function(r) {
1529
+ s = t[r], e.node(s).dummy && E(e.predecessors(s), function(t) {
1530
+ var r = e.node(t);
1531
+ r.dummy && (r.order < a || r.order > o) && Wa(n, t, s);
1532
+ });
1533
+ });
1534
+ }
1535
+ function i(t, n) {
1536
+ var i = -1, a, o = 0;
1537
+ return E(n, function(s, c) {
1538
+ if (e.node(s).dummy === "border") {
1539
+ var l = e.predecessors(s);
1540
+ l.length && (a = e.node(l[0]).order, r(n, o, c, i, a), o = c, i = a);
1541
+ }
1542
+ r(n, o, n.length, a, t.length);
1543
+ }), n;
1544
+ }
1545
+ return T(t, i), n;
1546
+ }
1547
+ function Ua(e, t) {
1548
+ if (e.node(t).dummy) return lr(e.predecessors(t), function(t) {
1549
+ return e.node(t).dummy;
1550
+ });
1551
+ }
1552
+ function Wa(e, t, n) {
1553
+ if (t > n) {
1554
+ var r = t;
1555
+ t = n, n = r;
1556
+ }
1557
+ Object.prototype.hasOwnProperty.call(e, t) || Object.defineProperty(e, t, {
1558
+ enumerable: !0,
1559
+ configurable: !0,
1560
+ value: {},
1561
+ writable: !0
1562
+ });
1563
+ var i = e[t];
1564
+ Object.defineProperty(i, n, {
1565
+ enumerable: !0,
1566
+ configurable: !0,
1567
+ value: !0,
1568
+ writable: !0
1569
+ });
1570
+ }
1571
+ function Ga(e, t, n) {
1572
+ if (t > n) {
1573
+ var r = t;
1574
+ t = n, n = r;
1575
+ }
1576
+ return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
1577
+ }
1578
+ function Ka(e, t, n, r) {
1579
+ var i = {}, a = {}, o = {};
1580
+ return E(t, function(e) {
1581
+ E(e, function(e, t) {
1582
+ i[e] = e, a[e] = e, o[e] = t;
1583
+ });
1584
+ }), E(t, function(e) {
1585
+ var t = -1;
1586
+ E(e, function(e) {
1587
+ var s = r(e);
1588
+ if (s.length) {
1589
+ s = J(s, function(e) {
1590
+ return o[e];
1591
+ });
1592
+ for (var c = (s.length - 1) / 2, l = Math.floor(c), u = Math.ceil(c); l <= u; ++l) {
1593
+ var d = s[l];
1594
+ a[e] === e && t < o[d] && !Ga(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
1595
+ }
1596
+ }
1597
+ });
1598
+ }), {
1599
+ root: i,
1600
+ align: a
1601
+ };
1602
+ }
1603
+ function qa(e, t, n, r, i) {
1604
+ var a = {}, o = Ja(e, t, n, i), s = i ? "borderLeft" : "borderRight";
1605
+ function c(e, t) {
1606
+ 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();
1607
+ }
1608
+ function l(e) {
1609
+ a[e] = o.inEdges(e).reduce(function(e, t) {
1610
+ return Math.max(e, a[t.v] + o.edge(t));
1611
+ }, 0);
1612
+ }
1613
+ function u(t) {
1614
+ var n = o.outEdges(t).reduce(function(e, t) {
1615
+ return Math.min(e, a[t.w] - o.edge(t));
1616
+ }, Infinity), r = e.node(t);
1617
+ n !== Infinity && r.borderType !== s && (a[t] = Math.max(a[t], n));
1618
+ }
1619
+ return c(l, o.predecessors.bind(o)), c(u, o.successors.bind(o)), E(r, function(e) {
1620
+ a[e] = a[n[e]];
1621
+ }), a;
1622
+ }
1623
+ function Ja(e, t, n, r) {
1624
+ var i = new O(), a = e.graph(), o = $a(a.nodesep, a.edgesep, r);
1625
+ return E(t, function(t) {
1626
+ var r;
1627
+ E(t, function(t) {
1628
+ var a = n[t];
1629
+ if (i.setNode(a), r) {
1630
+ var s = n[r], c = i.edge(s, a);
1631
+ i.setEdge(s, a, Math.max(o(e, t, r), c || 0));
1632
+ }
1633
+ r = t;
1634
+ });
1635
+ }), i;
1636
+ }
1637
+ function Ya(e, t) {
1638
+ return Sr(w(t), function(t) {
1639
+ var n = -Infinity, r = Infinity;
1640
+ return dr(t, function(t, i) {
1641
+ var a = eo(e, i) / 2;
1642
+ n = Math.max(t + a, n), r = Math.min(t - a, r);
1643
+ }), n - r;
1644
+ });
1645
+ }
1646
+ function Xa(e, t) {
1647
+ var n = w(t), r = G(n), i = W(n);
1648
+ E(["u", "d"], function(n) {
1649
+ E(["l", "r"], function(a) {
1650
+ var o = n + a, s = e[o], c;
1651
+ if (s !== t) {
1652
+ var l = w(s);
1653
+ c = a === "l" ? r - G(l) : i - W(l), c && (e[o] = U(s, function(e) {
1654
+ return e + c;
1655
+ }));
1656
+ }
1657
+ });
1658
+ });
1659
+ }
1660
+ function Za(e, t) {
1661
+ return U(e.ul, function(n, r) {
1662
+ if (t) return e[t.toLowerCase()][r];
1663
+ var i = J(H(e, r));
1664
+ return (i[1] + i[2]) / 2;
1665
+ });
1666
+ }
1667
+ function Qa(e) {
1668
+ var t = X(e), n = xr(Va(e, t), Ha(e, t)), r = {}, i;
1669
+ return E(["u", "d"], function(a) {
1670
+ i = a === "u" ? t : w(t).reverse(), E(["l", "r"], function(t) {
1671
+ t === "r" && (i = H(i, function(e) {
1672
+ return w(e).reverse();
1673
+ }));
1674
+ var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = Ka(e, i, n, o), c = qa(e, i, s.root, s.align, t === "r");
1675
+ t === "r" && (c = U(c, function(e) {
1676
+ return -e;
1677
+ })), r[a + t] = c;
1678
+ });
1679
+ }), Xa(r, Ya(e, r)), Za(r, e.graph().align);
1680
+ }
1681
+ function $a(e, t, n) {
1682
+ return function(r, i, a) {
1683
+ var o = r.node(i), s = r.node(a), c = 0, l;
1684
+ if (c += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos")) switch (o.labelpos.toLowerCase()) {
1685
+ case "l":
1686
+ l = -o.width / 2;
1687
+ break;
1688
+ case "r":
1689
+ l = o.width / 2;
1690
+ break;
1691
+ }
1692
+ 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()) {
1693
+ case "l":
1694
+ l = s.width / 2;
1695
+ break;
1696
+ case "r":
1697
+ l = -s.width / 2;
1698
+ break;
1699
+ }
1700
+ return l && (c += n ? l : -l), l = 0, c;
1701
+ };
1702
+ }
1703
+ function eo(e, t) {
1704
+ return e.node(t).width;
1705
+ }
1706
+ //#endregion
1707
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/index.js
1708
+ function to(e) {
1709
+ e = bi(e), no(e), fr(Qa(e), function(t, n) {
1710
+ e.node(n).x = t;
1711
+ });
1712
+ }
1713
+ function no(e) {
1714
+ var t = X(e), n = e.graph().ranksep, r = 0;
1715
+ E(t, function(t) {
1716
+ var i = W(H(t, function(t) {
1717
+ return e.node(t).height;
1718
+ }));
1719
+ E(t, function(t) {
1720
+ e.node(t).y = r + i / 2;
1721
+ }), r += i + n;
1722
+ });
1723
+ }
1724
+ //#endregion
1725
+ //#region node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/layout.js
1726
+ function ro(e, t) {
1727
+ var n = t && t.debugTiming ? Di : Oi;
1728
+ n("layout", () => {
1729
+ var t = n(" buildLayoutGraph", () => ho(e));
1730
+ n(" runLayout", () => io(t, n)), n(" updateInputGraph", () => ao(e, t));
1731
+ });
1732
+ }
1733
+ function io(e, t) {
1734
+ t(" makeSpaceForEdgeLabels", () => go(e)), t(" removeSelfEdges", () => To(e)), t(" acyclic", () => gi(e)), t(" nestingGraph.run", () => pa(e)), t(" rank", () => la(bi(e))), t(" injectEdgeLabelProxies", () => _o(e)), t(" removeEmptyRanks", () => Ci(e)), t(" nestingGraph.cleanup", () => _a(e)), t(" normalizeRanks", () => Si(e)), t(" assignRankMinMax", () => vo(e)), t(" removeEdgeLabelProxies", () => yo(e)), t(" normalize.run", () => zi(e)), t(" parentDummyChains", () => Ra(e)), t(" addBorderSegments", () => ki(e)), t(" order", () => Pa(e)), t(" insertSelfEdges", () => Eo(e)), t(" adjustCoordinateSystem", () => ji(e)), t(" position", () => to(e)), t(" positionSelfEdges", () => Do(e)), t(" removeBorderNodes", () => wo(e)), t(" normalize.undo", () => Vi(e)), t(" fixupEdgeLabelCoords", () => So(e)), t(" undoCoordinateSystem", () => Mi(e)), t(" translateGraph", () => bo(e)), t(" assignNodeIntersects", () => xo(e)), t(" reversePoints", () => Co(e)), t(" acyclic.undo", () => vi(e));
1735
+ }
1736
+ function ao(e, t) {
1737
+ E(e.nodes(), function(n) {
1738
+ var r = e.node(n), i = t.node(n);
1739
+ r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
1740
+ }), E(e.edges(), function(n) {
1741
+ var r = e.edge(n), i = t.edge(n);
1742
+ r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
1743
+ }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
1744
+ }
1745
+ var oo = [
1746
+ "nodesep",
1747
+ "edgesep",
1748
+ "ranksep",
1749
+ "marginx",
1750
+ "marginy"
1751
+ ], so = {
1752
+ ranksep: 50,
1753
+ edgesep: 20,
1754
+ nodesep: 50,
1755
+ rankdir: "tb"
1756
+ }, co = [
1757
+ "acyclicer",
1758
+ "ranker",
1759
+ "rankdir",
1760
+ "align"
1761
+ ], lo = ["width", "height"], uo = {
1762
+ width: 0,
1763
+ height: 0
1764
+ }, fo = [
1765
+ "minlen",
1766
+ "weight",
1767
+ "width",
1768
+ "height",
1769
+ "labeloffset"
1770
+ ], po = {
1771
+ minlen: 1,
1772
+ weight: 1,
1773
+ width: 0,
1774
+ height: 0,
1775
+ labeloffset: 10,
1776
+ labelpos: "r"
1777
+ }, mo = ["labelpos"];
1778
+ function ho(e) {
1779
+ var t = new O({
1780
+ multigraph: !0,
1781
+ compound: !0
1782
+ }), n = ko(e.graph());
1783
+ return t.setGraph(xr({}, so, Oo(n, oo), K(n, co))), E(e.nodes(), function(n) {
1784
+ var r = ko(e.node(n));
1785
+ t.setNode(n, er(Oo(r, lo), uo)), t.setParent(n, e.parent(n));
1786
+ }), E(e.edges(), function(n) {
1787
+ var r = ko(e.edge(n));
1788
+ t.setEdge(n, xr({}, po, Oo(r, fo), K(r, mo)));
1789
+ }), t;
1790
+ }
1791
+ function go(e) {
1792
+ var t = e.graph();
1793
+ t.ranksep /= 2, E(e.edges(), function(n) {
1794
+ var r = e.edge(n);
1795
+ r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
1796
+ });
1797
+ }
1798
+ function _o(e) {
1799
+ E(e.edges(), function(t) {
1800
+ var n = e.edge(t);
1801
+ if (n.width && n.height) {
1802
+ var r = e.node(t.v);
1803
+ Y(e, "edge-proxy", {
1804
+ rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
1805
+ e: t
1806
+ }, "_ep");
1807
+ }
1808
+ });
1809
+ }
1810
+ function vo(e) {
1811
+ var t = 0;
1812
+ E(e.nodes(), function(n) {
1813
+ var r = e.node(n);
1814
+ r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = W(t, r.maxRank));
1815
+ }), e.graph().maxRank = t;
1816
+ }
1817
+ function yo(e) {
1818
+ E(e.nodes(), function(t) {
1819
+ var n = e.node(t);
1820
+ n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
1821
+ });
1822
+ }
1823
+ function bo(e) {
1824
+ var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
1825
+ function c(e) {
1826
+ var a = e.x, o = e.y, s = e.width, c = e.height;
1827
+ 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);
1828
+ }
1829
+ E(e.nodes(), function(t) {
1830
+ c(e.node(t));
1831
+ }), E(e.edges(), function(t) {
1832
+ var n = e.edge(t);
1833
+ Object.prototype.hasOwnProperty.call(n, "x") && c(n);
1834
+ }), t -= o, r -= s, E(e.nodes(), function(n) {
1835
+ var i = e.node(n);
1836
+ i.x -= t, i.y -= r;
1837
+ }), E(e.edges(), function(n) {
1838
+ var i = e.edge(n);
1839
+ E(i.points, function(e) {
1840
+ e.x -= t, e.y -= r;
1841
+ }), Object.prototype.hasOwnProperty.call(i, "x") && (i.x -= t), Object.prototype.hasOwnProperty.call(i, "y") && (i.y -= r);
1842
+ }), a.width = n - t + o, a.height = i - r + s;
1843
+ }
1844
+ function xo(e) {
1845
+ E(e.edges(), function(t) {
1846
+ var n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
1847
+ n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(xi(r, a)), n.points.push(xi(i, o));
1848
+ });
1849
+ }
1850
+ function So(e) {
1851
+ E(e.edges(), function(t) {
1852
+ var n = e.edge(t);
1853
+ if (Object.prototype.hasOwnProperty.call(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
1854
+ case "l":
1855
+ n.x -= n.width / 2 + n.labeloffset;
1856
+ break;
1857
+ case "r":
1858
+ n.x += n.width / 2 + n.labeloffset;
1859
+ break;
1860
+ }
1861
+ });
1862
+ }
1863
+ function Co(e) {
1864
+ E(e.edges(), function(t) {
1865
+ var n = e.edge(t);
1866
+ n.reversed && n.points.reverse();
1867
+ });
1868
+ }
1869
+ function wo(e) {
1870
+ E(e.nodes(), function(t) {
1871
+ if (e.children(t).length) {
1872
+ var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(V(n.borderLeft)), o = e.node(V(n.borderRight));
1873
+ 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;
1874
+ }
1875
+ }), E(e.nodes(), function(t) {
1876
+ e.node(t).dummy === "border" && e.removeNode(t);
1877
+ });
1878
+ }
1879
+ function To(e) {
1880
+ E(e.edges(), function(t) {
1881
+ if (t.v === t.w) {
1882
+ var n = e.node(t.v);
1883
+ n.selfEdges ||= [], n.selfEdges.push({
1884
+ e: t,
1885
+ label: e.edge(t)
1886
+ }), e.removeEdge(t);
1887
+ }
1888
+ });
1889
+ }
1890
+ function Eo(e) {
1891
+ E(X(e), function(t) {
1892
+ var n = 0;
1893
+ E(t, function(t, r) {
1894
+ var i = e.node(t);
1895
+ i.order = r + n, E(i.selfEdges, function(t) {
1896
+ Y(e, "selfedge", {
1897
+ width: t.label.width,
1898
+ height: t.label.height,
1899
+ rank: i.rank,
1900
+ order: r + ++n,
1901
+ e: t.e,
1902
+ label: t.label
1903
+ }, "_se");
1904
+ }), delete i.selfEdges;
1905
+ });
1906
+ });
1907
+ }
1908
+ function Do(e) {
1909
+ E(e.nodes(), function(t) {
1910
+ var n = e.node(t);
1911
+ if (n.dummy === "selfedge") {
1912
+ var r = e.node(n.e.v), i = r.x + r.width / 2, a = r.y, o = n.x - i, s = r.height / 2;
1913
+ e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [
1914
+ {
1915
+ x: i + 2 * o / 3,
1916
+ y: a - s
1917
+ },
1918
+ {
1919
+ x: i + 5 * o / 6,
1920
+ y: a - s
1921
+ },
1922
+ {
1923
+ x: i + o,
1924
+ y: a
1925
+ },
1926
+ {
1927
+ x: i + 5 * o / 6,
1928
+ y: a + s
1929
+ },
1930
+ {
1931
+ x: i + 2 * o / 3,
1932
+ y: a + s
1933
+ }
1934
+ ], n.label.x = n.x, n.label.y = n.y;
1935
+ }
1936
+ });
1937
+ }
1938
+ function Oo(e, t) {
1939
+ return U(K(e, t), Number);
1940
+ }
1941
+ function ko(e) {
1942
+ var t = {};
1943
+ return E(e, function(e, n) {
1944
+ t[n.toLowerCase()] = e;
1945
+ }), t;
1946
+ }
1947
+ //#endregion
1948
+ //#region node_modules/.pnpm/mermaid@12.2.0/node_modules/mermaid/dist/chunks/mermaid.core/dagre-NK4GIZVX.mjs
1949
+ var Ao = /* @__PURE__ */ t((e, t, n) => Math.max(t, Math.min(n, e)), "clamp"), jo = /* @__PURE__ */ t((e = "TB") => {
1950
+ switch (e) {
1951
+ case "BT": return "bottom";
1952
+ case "LR": return "right";
1953
+ case "RL": return "left";
1954
+ default: return "top";
1955
+ }
1956
+ }, "getDefaultSelfLoopSide"), Mo = /* @__PURE__ */ t((e) => e === "flowchart" || e === "flowchart-v2" || e === "stateDiagram" || e === "er" || e === "classDiagram", "shouldMergeSelfLoopSegments"), No = [
1957
+ "x",
1958
+ "y",
1959
+ "width",
1960
+ "height",
1961
+ "labelBBox",
1962
+ "intersect",
1963
+ "calcIntersect",
1964
+ "diff",
1965
+ "clusterNode"
1966
+ ], Po = /* @__PURE__ */ t((e, t, n, r, i) => {
1967
+ let a = [], o = /* @__PURE__ */ new Set();
1968
+ if (n.forEach(({ start: e, end: t }) => {
1969
+ e !== r && o.add(e), t !== r && o.add(t);
1970
+ }), o.forEach((t) => {
1971
+ let n = e.node(t);
1972
+ typeof n?.x == "number" && typeof n?.y == "number" && a.push(n);
1973
+ }), a.length === 0 && n.forEach(({ edge: e }) => {
1974
+ (e.points ?? []).forEach((e) => {
1975
+ typeof e?.x == "number" && typeof e?.y == "number" && a.push(e);
1976
+ });
1977
+ }), a.length === 0) return jo(i);
1978
+ let s = a.reduce((e, t) => ({
1979
+ x: e.x + t.x / a.length,
1980
+ y: e.y + t.y / a.length
1981
+ }), {
1982
+ x: 0,
1983
+ y: 0
1984
+ }), c = s.x - t.x, l = s.y - t.y;
1985
+ return Math.abs(c) > Math.abs(l) ? c > 0 ? "right" : "left" : Math.abs(l) > 0 ? l > 0 ? "bottom" : "top" : jo(i);
1986
+ }, "getSelfLoopSide"), Fo = /* @__PURE__ */ t((e, t = "top", n = 0, r = 0) => {
1987
+ let i = e.x, a = e.y - n, o = e.width / 2, s = e.height / 2, c = Math.max(36, Math.min(100, e.width * .8)), l = Ao(Math.max(r, e.width * .35), 36, c), u = Ao(Math.min(e.width, e.height) * .45, 24, 48);
1988
+ switch (t) {
1989
+ case "bottom": {
1990
+ let e = a + s;
1991
+ return [
1992
+ {
1993
+ x: i - l / 2,
1994
+ y: e
1995
+ },
1996
+ {
1997
+ x: i - l / 2,
1998
+ y: e + u
1999
+ },
2000
+ {
2001
+ x: i + l / 2,
2002
+ y: e + u
2003
+ },
2004
+ {
2005
+ x: i + l / 2,
2006
+ y: e
2007
+ }
2008
+ ];
2009
+ }
2010
+ case "right": {
2011
+ let e = i + o;
2012
+ return [
2013
+ {
2014
+ x: e,
2015
+ y: a - l / 2
2016
+ },
2017
+ {
2018
+ x: e + u,
2019
+ y: a - l / 2
2020
+ },
2021
+ {
2022
+ x: e + u,
2023
+ y: a + l / 2
2024
+ },
2025
+ {
2026
+ x: e,
2027
+ y: a + l / 2
2028
+ }
2029
+ ];
2030
+ }
2031
+ case "left": {
2032
+ let e = i - o;
2033
+ return [
2034
+ {
2035
+ x: e,
2036
+ y: a - l / 2
2037
+ },
2038
+ {
2039
+ x: e - u,
2040
+ y: a - l / 2
2041
+ },
2042
+ {
2043
+ x: e - u,
2044
+ y: a + l / 2
2045
+ },
2046
+ {
2047
+ x: e,
2048
+ y: a + l / 2
2049
+ }
2050
+ ];
2051
+ }
2052
+ default: {
2053
+ let e = a - s;
2054
+ return [
2055
+ {
2056
+ x: i - l / 2,
2057
+ y: e
2058
+ },
2059
+ {
2060
+ x: i - l / 2,
2061
+ y: e - u
2062
+ },
2063
+ {
2064
+ x: i + l / 2,
2065
+ y: e - u
2066
+ },
2067
+ {
2068
+ x: i + l / 2,
2069
+ y: e
2070
+ }
2071
+ ];
2072
+ }
2073
+ }
2074
+ }, "getSelfLoopPoints"), Io = /* @__PURE__ */ t((e, t, n = "top", r = 0, i = {}) => {
2075
+ let a = e.x, o = e.y - r, s = i.width ?? 0, c = i.height ?? 0;
2076
+ switch (n) {
2077
+ case "bottom": return {
2078
+ x: a,
2079
+ y: Math.max(...t.map((e) => e.y)) + c / 2 + 4
2080
+ };
2081
+ case "right": return {
2082
+ x: Math.max(...t.map((e) => e.x)) + s / 2 + 4,
2083
+ y: o
2084
+ };
2085
+ case "left": return {
2086
+ x: Math.min(...t.map((e) => e.x)) - s / 2 - 4,
2087
+ y: o
2088
+ };
2089
+ default: return {
2090
+ x: a,
2091
+ y: Math.min(...t.map((e) => e.y)) - c / 2 - 4
2092
+ };
2093
+ }
2094
+ }, "getSelfLoopLabelPosition"), Lo = /* @__PURE__ */ t((e, t = 0, { mergeSelfLoops: n = !0 } = {}) => {
2095
+ let r = /* @__PURE__ */ new Map(), i = [], a = e.graph()?.rankdir;
2096
+ return e.edges().forEach((t) => {
2097
+ let a = e.edge(t);
2098
+ if (n && a.selfLoop) {
2099
+ let e = a.selfLoop.id;
2100
+ r.has(e) || r.set(e, []), r.get(e).push({
2101
+ edge: a,
2102
+ start: t.v,
2103
+ end: t.w
2104
+ });
2105
+ } else i.push({
2106
+ edge: a,
2107
+ start: t.v,
2108
+ end: t.w
2109
+ });
2110
+ }), r.forEach((n) => {
2111
+ if (n.length !== 3) {
2112
+ n.forEach((e) => i.push(e));
2113
+ return;
2114
+ }
2115
+ n.sort((e, t) => e.edge.selfLoop.order - t.edge.selfLoop.order);
2116
+ let [r, o, s] = n, c = r.edge.originalEdge ?? o.edge.originalEdge ?? s.edge.originalEdge ?? o.edge, l = e.node(c.start);
2117
+ if (!l) {
2118
+ n.forEach((e) => i.push(e));
2119
+ return;
2120
+ }
2121
+ let u = {
2122
+ width: o.edge.width,
2123
+ height: o.edge.height
2124
+ }, d = Po(e, l, n, c.start, a), f = Fo(l, d, t, u.width ?? 0), p = Io(l, f, d, t, u), m = {
2125
+ ...o.edge,
2126
+ ...c,
2127
+ id: c.id,
2128
+ points: f,
2129
+ start: c.start,
2130
+ end: c.end,
2131
+ x: p.x,
2132
+ y: p.y,
2133
+ width: u.width,
2134
+ height: u.height,
2135
+ labelStyle: o.edge.labelStyle,
2136
+ fromCluster: r.edge.fromCluster ?? o.edge.fromCluster ?? s.edge.fromCluster,
2137
+ toCluster: r.edge.toCluster ?? o.edge.toCluster ?? s.edge.toCluster
2138
+ };
2139
+ delete m.selfLoop, delete m.originalEdge, i.push({
2140
+ edge: m,
2141
+ start: m.start,
2142
+ end: m.end
2143
+ });
2144
+ }), i;
2145
+ }, "getEdgesToRender"), Ro = /* @__PURE__ */ t(async ({ element: n, graph: a, diagramType: c, id: l, parentCluster: u, siteConfig: d }) => {
2146
+ let f = a.graph().rankdir;
2147
+ e.trace("Dir in recursive render - dir:", f);
2148
+ let { clusters: p, edgePaths: m, edgeLabels: h, nodes: g, rootGroups: ee } = ze(n, { edgePathsClass: "edgePaths" });
2149
+ a.nodes() ? e.info("Recursive render XXX", a.nodes()) : e.info("No nodes found for", a), a.edges().length > 0 && e.info("Recursive edges", a.edge(a.edges()[0]));
2150
+ let _ = Mo(c);
2151
+ await Promise.all(a.nodes().map(async function(t) {
2152
+ let n = a.node(t);
2153
+ if (u !== void 0) {
2154
+ let n = JSON.parse(JSON.stringify(u.clusterData));
2155
+ e.trace("Setting data for parent cluster XXX\n Node.id = ", t, "\n data=", n.height, "\nParent cluster", u.height), a.setNode(u.id, n), a.parent(t) || (e.trace("Setting parent", t, u.id), a.setParent(t, u.id, n));
2156
+ }
2157
+ if (e.info("(Insert) Node XXX" + t + ": " + JSON.stringify(a.node(t))), n?.clusterNode) {
2158
+ e.info("Cluster identified XBX", t, n.width, a.node(t));
2159
+ let { ranksep: o, nodesep: s } = a.graph();
2160
+ n.graph.setGraph({
2161
+ ...n.graph.graph(),
2162
+ ranksep: o + 25,
2163
+ nodesep: s
2164
+ });
2165
+ let u = await Go({
2166
+ element: g,
2167
+ graph: n.graph,
2168
+ diagramType: c,
2169
+ id: l,
2170
+ parentCluster: a.node(t),
2171
+ siteConfig: d
2172
+ }), f = u.elem;
2173
+ r(n, f), n.diff = u.diff || 0, e.info("New compound node after recursive render XAX", t, "width", n.width, "height", n.height), i(f, n);
2174
+ } else a.children(t).length > 0 ? (e.trace("Cluster - the non recursive path XBX", t, n.id, n, n.width, "Graph:", a), e.trace(Be(n.id, a)), j.set(n.id, {
2175
+ id: Be(n.id, a),
2176
+ node: n
2177
+ })) : (e.trace("Node - the non recursive path XAX", t, g, a.node(t), f), await He(g, a.node(t), {
2178
+ config: d,
2179
+ dir: f
2180
+ }));
2181
+ })), await (/* @__PURE__ */ t(async () => {
2182
+ let t = a.edges().map(async function(t) {
2183
+ let n = a.edge(t.v, t.w, t.name);
2184
+ if (e.info("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(t)), e.info("Edge " + t.v + " -> " + t.w + ": ", t, " ", JSON.stringify(a.edge(t))), e.info("Fix", j, "ids:", t.v, t.w, "Translating: ", j.get(t.v), j.get(t.w)), _ && n.selfLoop) {
2185
+ if (n.selfLoop.order !== 1) return;
2186
+ let e = {
2187
+ ...n.originalEdge,
2188
+ ...n,
2189
+ id: n.selfLoop.id,
2190
+ startLabelLeft: n.originalEdge?.startLabelLeft ?? n.startLabelLeft,
2191
+ startLabelRight: n.originalEdge?.startLabelRight ?? n.startLabelRight,
2192
+ endLabelLeft: n.originalEdge?.endLabelLeft ?? n.endLabelLeft,
2193
+ endLabelRight: n.originalEdge?.endLabelRight ?? n.endLabelRight
2194
+ };
2195
+ await s(h, e), n.width = e.width, n.height = e.height, n.labelStyle = e.labelStyle;
2196
+ return;
2197
+ }
2198
+ await s(h, n);
2199
+ });
2200
+ await Promise.all(t);
2201
+ }, "processEdges"))();
2202
+ let { subGraphTitleTotalMargin: te } = o(d);
2203
+ return {
2204
+ elem: ee,
2205
+ graph: a,
2206
+ groups: {
2207
+ clusters: p,
2208
+ edgePaths: m,
2209
+ edgeLabels: h,
2210
+ nodes: g,
2211
+ rootGroups: ee
2212
+ },
2213
+ diagramType: c,
2214
+ id: l,
2215
+ mergeSelfLoops: _,
2216
+ subGraphTitleTotalMargin: te
2217
+ };
2218
+ }, "measureDagreGraph"), zo = /* @__PURE__ */ t((t) => {
2219
+ e.info("############################################# XXX"), e.info("### Layout ### XXX"), e.info("############################################# XXX"), ro(t);
2220
+ }, "runDagreGraphLayout"), Bo = /* @__PURE__ */ t((e, t, n) => {
2221
+ let r = e.node(t);
2222
+ if (!r) return;
2223
+ let i = { ...r };
2224
+ return r?.clusterNode ? i.y = (r.y ?? 0) + n : e.children(t).length > 0 ? i.height = (r.height ?? 0) + n : i.y = (r.y ?? 0) + n / 2, i;
2225
+ }, "normalizeDagreNode"), Vo = /* @__PURE__ */ t((e, t) => {
2226
+ No.forEach((n) => {
2227
+ t[n] !== void 0 && (e[n] = t[n]);
2228
+ });
2229
+ }, "applyDagreNodeLayout"), Ho = /* @__PURE__ */ t((e, t, n, r) => ({
2230
+ ...e,
2231
+ start: e.start ?? t,
2232
+ end: e.end ?? n,
2233
+ points: (e.points ?? []).map((e) => ({
2234
+ ...e,
2235
+ y: typeof e.y == "number" ? e.y + r : e.y
2236
+ }))
2237
+ }), "normalizeDagreEdge"), Uo = /* @__PURE__ */ t((e, t) => {
2238
+ let { graph: n, mergeSelfLoops: r, subGraphTitleTotalMargin: i = 0 } = t, a = new Map(e.nodes.map((e) => [e.id, e]));
2239
+ Re(n).forEach((e) => {
2240
+ let t = Bo(n, e, i);
2241
+ if (!t) return;
2242
+ Vo(n.node(e), t);
2243
+ let r = a.get(e);
2244
+ r && Vo(r, t);
2245
+ });
2246
+ let o = i / 2;
2247
+ return e.edges = Lo(n, o, { mergeSelfLoops: r }).map(({ edge: e, start: t, end: n }) => Ho(e, t, n, o)), e;
2248
+ }, "applyDagreLayoutResult"), Wo = /* @__PURE__ */ t(async ({ elem: t, graph: n, groups: { clusters: r, edgePaths: i }, diagramType: o, id: s, mergeSelfLoops: u, subGraphTitleTotalMargin: d }) => {
2249
+ let f = 0;
2250
+ await Promise.all(Re(n).map(async function(t) {
2251
+ let i = n.node(t);
2252
+ if (e.info("Position XBX => " + t + ": (" + i.x, "," + i.y, ") width: ", i.width, " height: ", i.height), i?.clusterNode) i.y += d, e.info("A tainted cluster node XBX1", t, i.id, i.width, i.height, i.x, i.y, n.parent(t)), j.get(i.id).node = i, a(i);
2253
+ else if (n.children(t).length > 0) {
2254
+ e.info("A pure cluster node XBX1", t, i.id, i.x, i.y, i.width, i.height, n.parent(t)), i.height += d, n.node(i.parentId);
2255
+ let a = i?.padding / 2 || 0, o = i?.labelBBox?.height || 0, s = o - a || 0;
2256
+ e.debug("OffsetY", s, "labelHeight", o, "halfPadding", a), await Le(r, i), j.get(i.id).node = i;
2257
+ } else {
2258
+ let t = n.node(i.parentId);
2259
+ i.y += d / 2, e.info("A regular node XBX1 - using the padding", i.id, "parent", i.parentId, i.width, i.height, i.x, i.y, "offsetY", i.offsetY, "parent", t, t?.offsetY, i), a(i);
2260
+ }
2261
+ }));
2262
+ let p = d / 2;
2263
+ return Lo(n, p, { mergeSelfLoops: u }).forEach(function({ edge: t, start: r, end: a }) {
2264
+ e.info("Edge " + r + " -> " + a + ": " + JSON.stringify(t), t), t.points.forEach((e) => e.y += p), l(t, c(i, t, j, o, n.node(r), n.node(a), s));
2265
+ }), n.nodes().forEach(function(t) {
2266
+ let r = n.node(t);
2267
+ e.info(t, r.type, r.diff), r.isGroup && (f = r.diff);
2268
+ }), e.warn("Returning from recursive render XAX", t, f), {
2269
+ elem: t,
2270
+ diff: f
2271
+ };
2272
+ }, "paintDagreLayoutCore"), Go = /* @__PURE__ */ t(async (e) => {
2273
+ let t = await Ro(e);
2274
+ return zo(t.graph), await Wo(t);
2275
+ }, "renderDagreSubgraph"), Ko = /* @__PURE__ */ t((t) => {
2276
+ let n = new O({
2277
+ multigraph: !0,
2278
+ compound: !0
2279
+ }).setGraph({
2280
+ rankdir: t.direction,
2281
+ nodesep: t.config?.nodeSpacing || t.nodeSpacing || t.config?.flowchart?.nodeSpacing,
2282
+ ranksep: t.config?.rankSpacing || t.rankSpacing || t.config?.flowchart?.rankSpacing,
2283
+ marginx: 8,
2284
+ marginy: 8
2285
+ }).setDefaultEdgeLabel(function() {
2286
+ return {};
2287
+ });
2288
+ return t.nodes.forEach((e) => {
2289
+ n.setNode(e.id, { ...e }), e.parentId && n.setParent(e.id, e.parentId);
2290
+ }), e.debug("Edges:", t.edges), t.edges.forEach((e) => {
2291
+ if (e.start === e.end) {
2292
+ let t = e.start, r = t + "---" + t + "---1", i = t + "---" + t + "---2", a = n.node(t);
2293
+ n.setNode(r, {
2294
+ domId: r,
2295
+ id: r,
2296
+ parentId: a.parentId,
2297
+ labelStyle: "",
2298
+ label: "",
2299
+ padding: 0,
2300
+ shape: "labelRect",
2301
+ style: "",
2302
+ width: 10,
2303
+ height: 10
2304
+ }), n.setParent(r, a.parentId), n.setNode(i, {
2305
+ domId: i,
2306
+ id: i,
2307
+ parentId: a.parentId,
2308
+ labelStyle: "",
2309
+ padding: 0,
2310
+ shape: "labelRect",
2311
+ label: "",
2312
+ style: "",
2313
+ width: 10,
2314
+ height: 10
2315
+ }), n.setParent(i, a.parentId);
2316
+ let o = structuredClone(e), s = structuredClone(e), c = structuredClone(e), l = structuredClone(e);
2317
+ s.originalEdge = o, s.selfLoop = {
2318
+ id: o.id,
2319
+ order: 0
2320
+ }, c.originalEdge = o, c.selfLoop = {
2321
+ id: o.id,
2322
+ order: 1
2323
+ }, l.originalEdge = o, l.selfLoop = {
2324
+ id: o.id,
2325
+ order: 2
2326
+ }, s.label = "", s.arrowTypeEnd = "none", s.endLabelLeft = "", s.endLabelRight = "", s.startLabelLeft = "", s.id = t + "-cyclic-special-1", c.startLabelRight = "", c.startLabelLeft = "", c.endLabelLeft = "", c.endLabelRight = "", c.arrowTypeStart = "none", c.arrowTypeEnd = "none", c.id = t + "-cyclic-special-mid", l.label = "", l.startLabelRight = "", l.startLabelLeft = "", l.arrowTypeStart = "none", a.isGroup && (s.fromCluster = t, l.toCluster = t), l.id = t + "-cyclic-special-2", l.arrowTypeStart = "none", n.setEdge(t, r, s, t + "-cyclic-special-0"), n.setEdge(r, i, c, t + "-cyclic-special-1"), n.setEdge(i, t, l, t + "-cyclic-special-2");
2327
+ } else n.setEdge(e.start, e.end, { ...e }, e.id);
2328
+ }), Ue(n), { graph: n };
2329
+ }, "prepareLayoutForDagre"), qo = /* @__PURE__ */ t(async (e, { element: t, preparedLayout: r }) => {
2330
+ let i = r ?? Ko(e), a = n(), o = await Ro({
2331
+ element: t,
2332
+ graph: i.graph,
2333
+ diagramType: e.type,
2334
+ id: e.diagramId,
2335
+ parentCluster: void 0,
2336
+ siteConfig: a
2337
+ });
2338
+ return i.measuredLayout = o, o;
2339
+ }, "measureDagreLayout"), Jo = /* @__PURE__ */ t((e, t) => {
2340
+ let n = t.preparedLayout?.measuredLayout;
2341
+ if (!n) throw Error("runDagreLayoutCore requires measureDagreLayout to run first");
2342
+ return zo(n.graph), Uo(e, n), n;
2343
+ }, "runDagreLayoutCore"), Yo = Ve({
2344
+ prepareLayout: Ko,
2345
+ measureLayout: qo,
2346
+ runLayoutCore: Jo,
2347
+ paintOptions: {
2348
+ clusterDb: j,
2349
+ getNodes: /* @__PURE__ */ t((e, { measure: t }) => Re(t.graph).map((e) => t.graph.node(e)).filter(Boolean), "getDagrePaintNodes"),
2350
+ getEdgeNode: /* @__PURE__ */ t((e, t, { measure: n }) => e ? n.graph.node(e) : void 0, "getDagreEdgeNode"),
2351
+ skipNode: /* @__PURE__ */ t((e, { measure: t }) => !t.graph.hasNode(e.id), "skipNode"),
2352
+ isCluster: /* @__PURE__ */ t((e, { measure: t }) => t.graph.hasNode(e.id) && (t.graph.children(e.id) ?? []).length > 0, "isCluster")
2353
+ }
2354
+ });
2355
+ //#endregion
2356
+ export { Uo as applyDagreLayoutResult, Lo as getEdgesToRender, qo as measureDagreLayout, Ko as prepareLayoutForDagre, Yo as render, Jo as runDagreLayoutCore };