@blueking/ai-blueking 2.1.4-beta.7 → 2.1.4-beta.8
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.
- package/dist/standalone/_baseFor-DZ1vnh4H.js +393 -0
- package/dist/standalone/arc-WNacHY26.js +80 -0
- package/dist/standalone/architecture-YZFGNWBL-pIa_tKdA.js +3 -0
- package/dist/standalone/architectureDiagram-Q4EWVU46-Bfam8Fg3.js +4057 -0
- package/dist/standalone/array-CWNufkl9.js +6 -0
- package/dist/standalone/blockDiagram-DXYQGD6D-vAb9uyF5.js +3033 -0
- package/dist/standalone/c4Diagram-AHTNJAMY-BWACU0ER.js +2961 -0
- package/dist/standalone/channel-Br5ChI8U.js +5 -0
- package/dist/standalone/chunk-2KRD3SAO-Deh6AASy.js +23 -0
- package/dist/standalone/chunk-336JU56O-CFKWNcxR.js +49 -0
- package/dist/standalone/chunk-426QAEUC-D_wKNd3w.js +9 -0
- package/dist/standalone/chunk-4BX2VUAB-DKC_OBWg.js +8 -0
- package/dist/standalone/chunk-4TB4RGXK-HiVG7T1A.js +3254 -0
- package/dist/standalone/chunk-55IACEB6-DBivnNb2.js +8 -0
- package/dist/standalone/chunk-5FUZZQ4R-tiEjqlP4.js +3638 -0
- package/dist/standalone/chunk-5PVQY5BW-BCjrVrWB.js +1299 -0
- package/dist/standalone/chunk-67CJDMHE-BX09W6oy.js +23 -0
- package/dist/standalone/chunk-7N4EOEYR-G144j5Vc.js +35 -0
- package/dist/standalone/chunk-AA7GKIK3-Dx9YCoJ-.js +30 -0
- package/dist/standalone/chunk-BSJP7CBP-DE8WR0MI.js +82 -0
- package/dist/standalone/chunk-CIAEETIT-Bv86XVLB.js +23 -0
- package/dist/standalone/chunk-EDXVE4YY-DE9KzYM-.js +25 -0
- package/dist/standalone/chunk-ENJZ2VHE-DlxIC-A3.js +560 -0
- package/dist/standalone/chunk-FMBD7UC4-DCkBrKFO.js +5 -0
- package/dist/standalone/chunk-FOC6F5B3-C7hwrEZJ.js +23 -0
- package/dist/standalone/chunk-ICPOFSXX-B9JXAgJU.js +2772 -0
- package/dist/standalone/chunk-K5T4RW27-T6hJxJM0.js +16070 -0
- package/dist/standalone/chunk-KGLVRYIC-C0JPhrjn.js +23 -0
- package/dist/standalone/chunk-LIHQZDEY-CiavnvWh.js +64 -0
- package/dist/standalone/chunk-ORNJ4GCN-BtJ79bik.js +31 -0
- package/dist/standalone/chunk-OYMX7WX6-D2UHnmfD.js +2014 -0
- package/dist/standalone/chunk-QZHKN3VN-DhzThSvb.js +15 -0
- package/dist/standalone/chunk-U2HBQHQK-75Isf1R4.js +1896 -0
- package/dist/standalone/chunk-WQLz0Won.js +20 -0
- package/dist/standalone/chunk-X2U36JSP-DSzducJI.js +67 -0
- package/dist/standalone/chunk-XPW4576I-BFhmu0d4.js +1146 -0
- package/dist/standalone/chunk-YZCP3GAM-90EaSO-2.js +60 -0
- package/dist/standalone/chunk-ZZ45TVLE-DUagTZ9d.js +32 -0
- package/dist/standalone/classDiagram-6PBFFD2Q-Bwt78q4N.js +29 -0
- package/dist/standalone/classDiagram-v2-HSJHXN6E-B2qI9-xf.js +29 -0
- package/dist/standalone/clone-CBw-BHXl.js +8 -0
- package/dist/standalone/cose-bilkent-S5V4N54A-DFJ1nlog.js +2250 -0
- package/dist/standalone/cytoscape.esm-DdhenceR.js +18103 -0
- package/dist/standalone/dagre-KV5264BT-CXTBtAae.js +293 -0
- package/dist/standalone/dagre-kfvGmNUa.js +1606 -0
- package/dist/standalone/defaultLocale-bckJcYh1.js +201 -0
- package/dist/standalone/diagram-5BDNPKRD--gLHDKg-.js +101 -0
- package/dist/standalone/diagram-G4DWMVQ6-BwLE9Hsf.js +524 -0
- package/dist/standalone/diagram-MMDJMWI5-CoilYxa0.js +213 -0
- package/dist/standalone/diagram-TYMM5635-BupwRdr6.js +133 -0
- package/dist/standalone/dist-Dlj1jr8W.js +59 -0
- package/dist/standalone/erDiagram-SMLLAGMA-tIdn6ZCM.js +1700 -0
- package/dist/standalone/flatten-CXxC4cn2.js +40 -0
- package/dist/standalone/flowDiagram-DWJPFMVM-C86bLTAY.js +4146 -0
- package/dist/standalone/ganttDiagram-T4ZO3ILL-BT23lv_X.js +3077 -0
- package/dist/standalone/gitGraph-7Q5UKJZL-C-7nG8PF.js +3 -0
- package/dist/standalone/gitGraphDiagram-UUTBAWPF-DT1BGQsP.js +728 -0
- package/dist/standalone/graphlib-DrXiQBFg.js +373 -0
- package/dist/standalone/index.es.min.js +59705 -0
- package/dist/standalone/index.iife.min.js +3502 -0
- package/dist/standalone/index.umd.min.js +3502 -0
- package/dist/standalone/info-OMHHGYJF-BOS7mrON.js +3 -0
- package/dist/standalone/infoDiagram-42DDH7IO-Dx7LFK0B.js +19 -0
- package/dist/standalone/init-B75p2clj.js +15 -0
- package/dist/standalone/isEmpty-CVG4Bj-P.js +35 -0
- package/dist/standalone/ishikawaDiagram-UXIWVN3A-CX4cX3qb.js +718 -0
- package/dist/standalone/journeyDiagram-VCZTEJTY-BCvxmmFn.js +883 -0
- package/dist/standalone/kanban-definition-6JOO6SKY-SVINWaiM.js +973 -0
- package/dist/standalone/katex-CKrw0rbA.js +22016 -0
- package/dist/standalone/line-BF1XS-Ng.js +34 -0
- package/dist/standalone/linear-DGQDIL28.js +289 -0
- package/dist/standalone/mermaid-parser.core-Blz-Qy2h.js +69 -0
- package/dist/standalone/mermaid.core-CHTh1JGx.js +944 -0
- package/dist/standalone/mindmap-definition-QFDTVHPH-1Trzro3y.js +1009 -0
- package/dist/standalone/ordinal-F3U6aXtP.js +65 -0
- package/dist/standalone/packet-4T2RLAQJ-ai5Omp1h.js +3 -0
- package/dist/standalone/path-Dm3C8WEs.js +85 -0
- package/dist/standalone/pie-ZZUOXDRM-Df1rG6QC.js +3 -0
- package/dist/standalone/pieDiagram-DEJITSTG-D5Omb898.js +165 -0
- package/dist/standalone/purify.es-CZ_RvYUu.js +549 -0
- package/dist/standalone/quadrantDiagram-34T5L4WZ-Ct4g9T4o.js +1974 -0
- package/dist/standalone/radar-PYXPWWZC-B2t6k6Fg.js +3 -0
- package/dist/standalone/reduce-DbMsJ4nx.js +532 -0
- package/dist/standalone/requirementDiagram-MS252O5E-CP0BUgnz.js +2221 -0
- package/dist/standalone/rough.esm-UCEI3PYn.js +1352 -0
- package/dist/standalone/sankeyDiagram-XADWPNL6-D6C7yZ3k.js +920 -0
- package/dist/standalone/sequenceDiagram-FGHM5R23-KeodespT.js +4157 -0
- package/dist/standalone/src-CFVe5TPD.js +2146 -0
- package/dist/standalone/stateDiagram-FHFEXIEX-DAupoS9U.js +217 -0
- package/dist/standalone/stateDiagram-v2-QKLJ7IA2-C1Lw_i_z.js +27 -0
- package/dist/standalone/style.css +1 -0
- package/dist/standalone/timeline-definition-GMOUNBTQ-Cwhj84lX.js +1068 -0
- package/dist/standalone/treeView-SZITEDCU-BnoMeJSb.js +3 -0
- package/dist/standalone/treemap-W4RFUUIX-B38XFBZF.js +3 -0
- package/dist/standalone/vennDiagram-DHZGUBPP-_1PHloeO.js +1858 -0
- package/dist/standalone/wardley-RL74JXVD-bB8BBy_Y.js +3 -0
- package/dist/standalone/wardleyDiagram-NUSXRM2D-DRLCx-qh.js +578 -0
- package/dist/standalone/xychartDiagram-5P7HB3ND-Bz2-4Ufi.js +2044 -0
- package/dist/standalone-mount-core.d.ts +34 -0
- package/dist/standalone-mount-core.d.ts.map +1 -0
- package/dist/standalone-mount.d.ts +14 -0
- package/dist/standalone-mount.d.ts.map +1 -0
- package/dist/standalone.d.ts +8 -0
- package/dist/standalone.d.ts.map +1 -0
- package/package.json +12 -3
|
@@ -0,0 +1,1606 @@
|
|
|
1
|
+
import { E as e, _ as t, c as n, d as r, f as i, g as a, h as o, m as s, n as c, o as l, p as u, r as d, s as f, t as p, u as m, v as ee, x as te, y as h } from "./reduce-DbMsJ4nx.js";
|
|
2
|
+
import { D as ne, O as re, T as ie, f as ae, g, h as oe, i as se, n as ce, t as le, u as ue, w as _ } from "./_baseFor-DZ1vnh4H.js";
|
|
3
|
+
import { i as de, n as fe } from "./isEmpty-CVG4Bj-P.js";
|
|
4
|
+
import { a as v, i as pe, n as y, o as me, r as he, t as b } from "./flatten-CXxC4cn2.js";
|
|
5
|
+
import { C as ge, N as _e, S as ve, T as ye, _ as x, b as be, v as S, x as C, y as xe } from "./chunk-5PVQY5BW-BCjrVrWB.js";
|
|
6
|
+
import { i as Se, n as w, r as T, t as E } from "./graphlib-DrXiQBFg.js";
|
|
7
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_trimmedEndIndex.js
|
|
8
|
+
var Ce = /\s/;
|
|
9
|
+
function we(e) {
|
|
10
|
+
for (var t = e.length; t-- && Ce.test(e.charAt(t)););
|
|
11
|
+
return t;
|
|
12
|
+
}
|
|
13
|
+
//#endregion
|
|
14
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseTrim.js
|
|
15
|
+
var Te = /^\s+/;
|
|
16
|
+
function Ee(e) {
|
|
17
|
+
return e && e.slice(0, we(e) + 1).replace(Te, "");
|
|
18
|
+
}
|
|
19
|
+
//#endregion
|
|
20
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toNumber.js
|
|
21
|
+
var De = NaN, Oe = /^[-+]0x[0-9a-f]+$/i, ke = /^0b[01]+$/i, Ae = /^0o[0-7]+$/i, je = parseInt;
|
|
22
|
+
function Me(e) {
|
|
23
|
+
if (typeof e == "number") return e;
|
|
24
|
+
if (h(e)) return De;
|
|
25
|
+
if (_(e)) {
|
|
26
|
+
var t = typeof e.valueOf == "function" ? e.valueOf() : e;
|
|
27
|
+
e = _(t) ? t + "" : t;
|
|
28
|
+
}
|
|
29
|
+
if (typeof e != "string") return e === 0 ? e : +e;
|
|
30
|
+
e = Ee(e);
|
|
31
|
+
var n = ke.test(e);
|
|
32
|
+
return n || Ae.test(e) ? je(e.slice(2), n ? 2 : 8) : Oe.test(e) ? De : +e;
|
|
33
|
+
}
|
|
34
|
+
//#endregion
|
|
35
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toFinite.js
|
|
36
|
+
var Ne = Infinity, Pe = 17976931348623157e292;
|
|
37
|
+
function D(e) {
|
|
38
|
+
return e ? (e = Me(e), e === Ne || e === -Ne ? (e < 0 ? -1 : 1) * Pe : e === e ? e : 0) : e === 0 ? e : 0;
|
|
39
|
+
}
|
|
40
|
+
//#endregion
|
|
41
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/toInteger.js
|
|
42
|
+
function Fe(e) {
|
|
43
|
+
var t = D(e), n = t % 1;
|
|
44
|
+
return t === t ? n ? t - n : t : 0;
|
|
45
|
+
}
|
|
46
|
+
//#endregion
|
|
47
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_flatRest.js
|
|
48
|
+
function Ie(e) {
|
|
49
|
+
return be(ve(e, void 0, b), e + "");
|
|
50
|
+
}
|
|
51
|
+
//#endregion
|
|
52
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_hasUnicode.js
|
|
53
|
+
var Le = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
|
|
54
|
+
function Re(e) {
|
|
55
|
+
return Le.test(e);
|
|
56
|
+
}
|
|
57
|
+
//#endregion
|
|
58
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/cloneDeep.js
|
|
59
|
+
var ze = 1, Be = 4;
|
|
60
|
+
function Ve(e) {
|
|
61
|
+
return Se(e, ze | Be);
|
|
62
|
+
}
|
|
63
|
+
//#endregion
|
|
64
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/now.js
|
|
65
|
+
var He = function() {
|
|
66
|
+
return ne.Date.now();
|
|
67
|
+
}, Ue = Object.prototype, We = Ue.hasOwnProperty, Ge = xe(function(e, t) {
|
|
68
|
+
e = Object(e);
|
|
69
|
+
var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
|
|
70
|
+
for (i && S(t[0], t[1], i) && (r = 1); ++n < r;) for (var a = t[n], o = ge(a), s = -1, c = o.length; ++s < c;) {
|
|
71
|
+
var l = o[s], u = e[l];
|
|
72
|
+
(u === void 0 || re(u, Ue[l]) && !We.call(e, l)) && (e[l] = a[l]);
|
|
73
|
+
}
|
|
74
|
+
return e;
|
|
75
|
+
});
|
|
76
|
+
//#endregion
|
|
77
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/last.js
|
|
78
|
+
function O(e) {
|
|
79
|
+
var t = e == null ? 0 : e.length;
|
|
80
|
+
return t ? e[t - 1] : void 0;
|
|
81
|
+
}
|
|
82
|
+
//#endregion
|
|
83
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createFind.js
|
|
84
|
+
function Ke(e) {
|
|
85
|
+
return function(t, n, i) {
|
|
86
|
+
var a = Object(t);
|
|
87
|
+
if (!se(t)) {
|
|
88
|
+
var o = r(n, 3);
|
|
89
|
+
t = te(t), n = function(e) {
|
|
90
|
+
return o(a[e], e, a);
|
|
91
|
+
};
|
|
92
|
+
}
|
|
93
|
+
var s = e(t, n, i);
|
|
94
|
+
return s > -1 ? a[o ? t[s] : s] : void 0;
|
|
95
|
+
};
|
|
96
|
+
}
|
|
97
|
+
//#endregion
|
|
98
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/findIndex.js
|
|
99
|
+
var qe = Math.max;
|
|
100
|
+
function Je(e, t, n) {
|
|
101
|
+
var i = e == null ? 0 : e.length;
|
|
102
|
+
if (!i) return -1;
|
|
103
|
+
var a = n == null ? 0 : Fe(n);
|
|
104
|
+
return a < 0 && (a = qe(i + a, 0)), l(e, r(t, 3), a);
|
|
105
|
+
}
|
|
106
|
+
//#endregion
|
|
107
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/find.js
|
|
108
|
+
var k = Ke(Je);
|
|
109
|
+
//#endregion
|
|
110
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/forIn.js
|
|
111
|
+
function Ye(e, t) {
|
|
112
|
+
return e == null ? e : le(e, d(t), ge);
|
|
113
|
+
}
|
|
114
|
+
//#endregion
|
|
115
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/forOwn.js
|
|
116
|
+
function Xe(e, t) {
|
|
117
|
+
return e && m(e, d(t));
|
|
118
|
+
}
|
|
119
|
+
//#endregion
|
|
120
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseGt.js
|
|
121
|
+
function Ze(e, t) {
|
|
122
|
+
return e > t;
|
|
123
|
+
}
|
|
124
|
+
//#endregion
|
|
125
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseHas.js
|
|
126
|
+
var Qe = Object.prototype.hasOwnProperty;
|
|
127
|
+
function $e(e, t) {
|
|
128
|
+
return e != null && Qe.call(e, t);
|
|
129
|
+
}
|
|
130
|
+
//#endregion
|
|
131
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/has.js
|
|
132
|
+
function et(e, t) {
|
|
133
|
+
return e != null && s(e, t, $e);
|
|
134
|
+
}
|
|
135
|
+
//#endregion
|
|
136
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/isString.js
|
|
137
|
+
var tt = "[object String]";
|
|
138
|
+
function nt(e) {
|
|
139
|
+
return typeof e == "string" || !g(e) && oe(e) && ie(e) == tt;
|
|
140
|
+
}
|
|
141
|
+
//#endregion
|
|
142
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/mapValues.js
|
|
143
|
+
function A(e, t) {
|
|
144
|
+
var n = {};
|
|
145
|
+
return t = r(t, 3), m(e, function(e, r, i) {
|
|
146
|
+
_e(n, r, t(e, r, i));
|
|
147
|
+
}), n;
|
|
148
|
+
}
|
|
149
|
+
//#endregion
|
|
150
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/max.js
|
|
151
|
+
function j(e) {
|
|
152
|
+
return e && e.length ? pe(e, ce, Ze) : void 0;
|
|
153
|
+
}
|
|
154
|
+
//#endregion
|
|
155
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/minBy.js
|
|
156
|
+
function M(e, t) {
|
|
157
|
+
return e && e.length ? pe(e, r(t, 2), he) : void 0;
|
|
158
|
+
}
|
|
159
|
+
//#endregion
|
|
160
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseSet.js
|
|
161
|
+
function rt(e, n, r, i) {
|
|
162
|
+
if (!_(e)) return e;
|
|
163
|
+
n = t(n, e);
|
|
164
|
+
for (var o = -1, s = n.length, c = s - 1, l = e; l != null && ++o < s;) {
|
|
165
|
+
var u = a(n[o]), d = r;
|
|
166
|
+
if (u === "__proto__" || u === "constructor" || u === "prototype") return e;
|
|
167
|
+
if (o != c) {
|
|
168
|
+
var f = l[u];
|
|
169
|
+
d = i ? i(f, u, l) : void 0, d === void 0 && (d = _(f) ? f : ae(n[o + 1]) ? [] : {});
|
|
170
|
+
}
|
|
171
|
+
ye(l, u, d), l = l[u];
|
|
172
|
+
}
|
|
173
|
+
return e;
|
|
174
|
+
}
|
|
175
|
+
//#endregion
|
|
176
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_basePickBy.js
|
|
177
|
+
function it(e, n, r) {
|
|
178
|
+
for (var i = -1, a = n.length, s = {}; ++i < a;) {
|
|
179
|
+
var c = n[i], l = o(e, c);
|
|
180
|
+
r(l, c) && rt(s, t(c, e), l);
|
|
181
|
+
}
|
|
182
|
+
return s;
|
|
183
|
+
}
|
|
184
|
+
//#endregion
|
|
185
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseSortBy.js
|
|
186
|
+
function at(e, t) {
|
|
187
|
+
var n = e.length;
|
|
188
|
+
for (e.sort(t); n--;) e[n] = e[n].value;
|
|
189
|
+
return e;
|
|
190
|
+
}
|
|
191
|
+
//#endregion
|
|
192
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_compareAscending.js
|
|
193
|
+
function ot(e, t) {
|
|
194
|
+
if (e !== t) {
|
|
195
|
+
var n = e !== void 0, r = e === null, i = e === e, a = h(e), o = t !== void 0, s = t === null, c = t === t, l = h(t);
|
|
196
|
+
if (!s && !l && !a && e > t || a && o && c && !s && !l || r && o && c || !n && c || !i) return 1;
|
|
197
|
+
if (!r && !a && !l && e < t || l && n && i && !r && !a || s && n && i || !o && i || !c) return -1;
|
|
198
|
+
}
|
|
199
|
+
return 0;
|
|
200
|
+
}
|
|
201
|
+
//#endregion
|
|
202
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_compareMultiple.js
|
|
203
|
+
function st(e, t, n) {
|
|
204
|
+
for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
|
|
205
|
+
var c = ot(i[r], a[r]);
|
|
206
|
+
if (c) return r >= s ? c : c * (n[r] == "desc" ? -1 : 1);
|
|
207
|
+
}
|
|
208
|
+
return e.index - t.index;
|
|
209
|
+
}
|
|
210
|
+
//#endregion
|
|
211
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseOrderBy.js
|
|
212
|
+
function ct(t, n, i) {
|
|
213
|
+
n = n.length ? e(n, function(e) {
|
|
214
|
+
return g(e) ? function(t) {
|
|
215
|
+
return o(t, e.length === 1 ? e[0] : e);
|
|
216
|
+
} : e;
|
|
217
|
+
}) : [ce];
|
|
218
|
+
var a = -1;
|
|
219
|
+
return n = e(n, ue(r)), at(me(t, function(t, r, i) {
|
|
220
|
+
return {
|
|
221
|
+
criteria: e(n, function(e) {
|
|
222
|
+
return e(t);
|
|
223
|
+
}),
|
|
224
|
+
index: ++a,
|
|
225
|
+
value: t
|
|
226
|
+
};
|
|
227
|
+
}), function(e, t) {
|
|
228
|
+
return st(e, t, i);
|
|
229
|
+
});
|
|
230
|
+
}
|
|
231
|
+
//#endregion
|
|
232
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_asciiSize.js
|
|
233
|
+
var lt = i("length"), ut = "\\ud800-\\udfff", dt = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", ft = "\\ufe0e\\ufe0f", pt = "[" + ut + "]", N = "[" + dt + "]", P = "\\ud83c[\\udffb-\\udfff]", mt = "(?:" + N + "|" + P + ")", ht = "[^" + ut + "]", gt = "(?:\\ud83c[\\udde6-\\uddff]){2}", _t = "[\\ud800-\\udbff][\\udc00-\\udfff]", vt = "\\u200d", yt = mt + "?", bt = "[" + ft + "]?", xt = "(?:" + vt + "(?:" + [
|
|
234
|
+
ht,
|
|
235
|
+
gt,
|
|
236
|
+
_t
|
|
237
|
+
].join("|") + ")" + bt + yt + ")*", St = bt + yt + xt, Ct = "(?:" + [
|
|
238
|
+
ht + N + "?",
|
|
239
|
+
N,
|
|
240
|
+
gt,
|
|
241
|
+
_t,
|
|
242
|
+
pt
|
|
243
|
+
].join("|") + ")", wt = RegExp(P + "(?=" + P + ")|" + Ct + St, "g");
|
|
244
|
+
function Tt(e) {
|
|
245
|
+
for (var t = wt.lastIndex = 0; wt.test(e);) ++t;
|
|
246
|
+
return t;
|
|
247
|
+
}
|
|
248
|
+
//#endregion
|
|
249
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_stringSize.js
|
|
250
|
+
function Et(e) {
|
|
251
|
+
return Re(e) ? Tt(e) : lt(e);
|
|
252
|
+
}
|
|
253
|
+
//#endregion
|
|
254
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_basePick.js
|
|
255
|
+
function Dt(e, t) {
|
|
256
|
+
return it(e, t, function(t, n) {
|
|
257
|
+
return u(e, n);
|
|
258
|
+
});
|
|
259
|
+
}
|
|
260
|
+
//#endregion
|
|
261
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/pick.js
|
|
262
|
+
var F = Ie(function(e, t) {
|
|
263
|
+
return e == null ? {} : Dt(e, t);
|
|
264
|
+
}), Ot = Math.ceil, kt = Math.max;
|
|
265
|
+
function At(e, t, n, r) {
|
|
266
|
+
for (var i = -1, a = kt(Ot((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
|
|
267
|
+
return o;
|
|
268
|
+
}
|
|
269
|
+
//#endregion
|
|
270
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_createRange.js
|
|
271
|
+
function jt(e) {
|
|
272
|
+
return function(t, n, r) {
|
|
273
|
+
return r && typeof r != "number" && S(t, n, r) && (n = r = void 0), t = D(t), n === void 0 ? (n = t, t = 0) : n = D(n), r = r === void 0 ? t < n ? 1 : -1 : D(r), At(t, n, r, e);
|
|
274
|
+
};
|
|
275
|
+
}
|
|
276
|
+
//#endregion
|
|
277
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/range.js
|
|
278
|
+
var I = jt(), Mt = "[object Map]", Nt = "[object Set]";
|
|
279
|
+
function Pt(e) {
|
|
280
|
+
if (e == null) return 0;
|
|
281
|
+
if (se(e)) return nt(e) ? Et(e) : e.length;
|
|
282
|
+
var t = fe(e);
|
|
283
|
+
return t == Mt || t == Nt ? e.size : de(e).length;
|
|
284
|
+
}
|
|
285
|
+
//#endregion
|
|
286
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/sortBy.js
|
|
287
|
+
var L = xe(function(e, t) {
|
|
288
|
+
if (e == null) return [];
|
|
289
|
+
var n = t.length;
|
|
290
|
+
return n > 1 && S(e, t[0], t[1]) ? t = [] : n > 2 && S(t[0], t[1], t[2]) && (t = [t[0]]), ct(e, f(t, 1), []);
|
|
291
|
+
}), Ft = 0;
|
|
292
|
+
function R(e) {
|
|
293
|
+
var t = ++Ft;
|
|
294
|
+
return ee(e) + t;
|
|
295
|
+
}
|
|
296
|
+
//#endregion
|
|
297
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_baseZipObject.js
|
|
298
|
+
function It(e, t, n) {
|
|
299
|
+
for (var r = -1, i = e.length, a = t.length, o = {}; ++r < i;) {
|
|
300
|
+
var s = r < a ? t[r] : void 0;
|
|
301
|
+
n(o, e[r], s);
|
|
302
|
+
}
|
|
303
|
+
return o;
|
|
304
|
+
}
|
|
305
|
+
//#endregion
|
|
306
|
+
//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/zipObject.js
|
|
307
|
+
function Lt(e, t) {
|
|
308
|
+
return It(e || [], t || [], ye);
|
|
309
|
+
}
|
|
310
|
+
//#endregion
|
|
311
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/data/list.js
|
|
312
|
+
var Rt = class {
|
|
313
|
+
constructor() {
|
|
314
|
+
var e = {};
|
|
315
|
+
e._next = e._prev = e, this._sentinel = e;
|
|
316
|
+
}
|
|
317
|
+
dequeue() {
|
|
318
|
+
var e = this._sentinel, t = e._prev;
|
|
319
|
+
if (t !== e) return z(t), t;
|
|
320
|
+
}
|
|
321
|
+
enqueue(e) {
|
|
322
|
+
var t = this._sentinel;
|
|
323
|
+
e._prev && e._next && z(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
|
|
324
|
+
}
|
|
325
|
+
toString() {
|
|
326
|
+
for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, zt)), n = n._prev;
|
|
327
|
+
return "[" + e.join(", ") + "]";
|
|
328
|
+
}
|
|
329
|
+
};
|
|
330
|
+
function z(e) {
|
|
331
|
+
e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
|
|
332
|
+
}
|
|
333
|
+
function zt(e, t) {
|
|
334
|
+
if (e !== "_next" && e !== "_prev") return t;
|
|
335
|
+
}
|
|
336
|
+
//#endregion
|
|
337
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/greedy-fas.js
|
|
338
|
+
var Bt = C(1);
|
|
339
|
+
function Vt(e, t) {
|
|
340
|
+
if (e.nodeCount() <= 1) return [];
|
|
341
|
+
var n = Ut(e, t || Bt);
|
|
342
|
+
return b(v(Ht(n.graph, n.buckets, n.zeroIdx), function(t) {
|
|
343
|
+
return e.outEdges(t.v, t.w);
|
|
344
|
+
}));
|
|
345
|
+
}
|
|
346
|
+
function Ht(e, t, n) {
|
|
347
|
+
for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
|
|
348
|
+
for (; o = a.dequeue();) B(e, t, n, o);
|
|
349
|
+
for (; o = i.dequeue();) B(e, t, n, o);
|
|
350
|
+
if (e.nodeCount()) {
|
|
351
|
+
for (var s = t.length - 2; s > 0; --s) if (o = t[s].dequeue(), o) {
|
|
352
|
+
r = r.concat(B(e, t, n, o, !0));
|
|
353
|
+
break;
|
|
354
|
+
}
|
|
355
|
+
}
|
|
356
|
+
}
|
|
357
|
+
return r;
|
|
358
|
+
}
|
|
359
|
+
function B(e, t, n, r, i) {
|
|
360
|
+
var a = i ? [] : void 0;
|
|
361
|
+
return c(e.inEdges(r.v), function(r) {
|
|
362
|
+
var o = e.edge(r), s = e.node(r.v);
|
|
363
|
+
i && a.push({
|
|
364
|
+
v: r.v,
|
|
365
|
+
w: r.w
|
|
366
|
+
}), s.out -= o, V(t, n, s);
|
|
367
|
+
}), c(e.outEdges(r.v), function(r) {
|
|
368
|
+
var i = e.edge(r), a = r.w, o = e.node(a);
|
|
369
|
+
o.in -= i, V(t, n, o);
|
|
370
|
+
}), e.removeNode(r.v), a;
|
|
371
|
+
}
|
|
372
|
+
function Ut(e, t) {
|
|
373
|
+
var n = new E(), r = 0, i = 0;
|
|
374
|
+
c(e.nodes(), function(e) {
|
|
375
|
+
n.setNode(e, {
|
|
376
|
+
v: e,
|
|
377
|
+
in: 0,
|
|
378
|
+
out: 0
|
|
379
|
+
});
|
|
380
|
+
}), c(e.edges(), function(e) {
|
|
381
|
+
var a = n.edge(e.v, e.w) || 0, o = t(e), s = a + o;
|
|
382
|
+
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);
|
|
383
|
+
});
|
|
384
|
+
var a = I(i + r + 3).map(function() {
|
|
385
|
+
return new Rt();
|
|
386
|
+
}), o = r + 1;
|
|
387
|
+
return c(n.nodes(), function(e) {
|
|
388
|
+
V(a, o, n.node(e));
|
|
389
|
+
}), {
|
|
390
|
+
graph: n,
|
|
391
|
+
buckets: a,
|
|
392
|
+
zeroIdx: o
|
|
393
|
+
};
|
|
394
|
+
}
|
|
395
|
+
function V(e, t, n) {
|
|
396
|
+
n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
|
|
397
|
+
}
|
|
398
|
+
//#endregion
|
|
399
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/acyclic.js
|
|
400
|
+
function Wt(e) {
|
|
401
|
+
c(e.graph().acyclicer === "greedy" ? Vt(e, t(e)) : Gt(e), function(t) {
|
|
402
|
+
var n = e.edge(t);
|
|
403
|
+
e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, R("rev"));
|
|
404
|
+
});
|
|
405
|
+
function t(e) {
|
|
406
|
+
return function(t) {
|
|
407
|
+
return e.edge(t).weight;
|
|
408
|
+
};
|
|
409
|
+
}
|
|
410
|
+
}
|
|
411
|
+
function Gt(e) {
|
|
412
|
+
var t = [], n = {}, r = {};
|
|
413
|
+
function i(a) {
|
|
414
|
+
Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, c(e.outEdges(a), function(e) {
|
|
415
|
+
Object.prototype.hasOwnProperty.call(n, e.w) ? t.push(e) : i(e.w);
|
|
416
|
+
}), delete n[a]);
|
|
417
|
+
}
|
|
418
|
+
return c(e.nodes(), i), t;
|
|
419
|
+
}
|
|
420
|
+
function Kt(e) {
|
|
421
|
+
c(e.edges(), function(t) {
|
|
422
|
+
var n = e.edge(t);
|
|
423
|
+
if (n.reversed) {
|
|
424
|
+
e.removeEdge(t);
|
|
425
|
+
var r = n.forwardName;
|
|
426
|
+
delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
|
|
427
|
+
}
|
|
428
|
+
});
|
|
429
|
+
}
|
|
430
|
+
//#endregion
|
|
431
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/util.js
|
|
432
|
+
function H(e, t, n, r) {
|
|
433
|
+
var i;
|
|
434
|
+
do
|
|
435
|
+
i = R(r);
|
|
436
|
+
while (e.hasNode(i));
|
|
437
|
+
return n.dummy = t, e.setNode(i, n), i;
|
|
438
|
+
}
|
|
439
|
+
function qt(e) {
|
|
440
|
+
var t = new E().setGraph(e.graph());
|
|
441
|
+
return c(e.nodes(), function(n) {
|
|
442
|
+
t.setNode(n, e.node(n));
|
|
443
|
+
}), c(e.edges(), function(n) {
|
|
444
|
+
var r = t.edge(n.v, n.w) || {
|
|
445
|
+
weight: 0,
|
|
446
|
+
minlen: 1
|
|
447
|
+
}, i = e.edge(n);
|
|
448
|
+
t.setEdge(n.v, n.w, {
|
|
449
|
+
weight: r.weight + i.weight,
|
|
450
|
+
minlen: Math.max(r.minlen, i.minlen)
|
|
451
|
+
});
|
|
452
|
+
}), t;
|
|
453
|
+
}
|
|
454
|
+
function Jt(e) {
|
|
455
|
+
var t = new E({ multigraph: e.isMultigraph() }).setGraph(e.graph());
|
|
456
|
+
return c(e.nodes(), function(n) {
|
|
457
|
+
e.children(n).length || t.setNode(n, e.node(n));
|
|
458
|
+
}), c(e.edges(), function(n) {
|
|
459
|
+
t.setEdge(n, e.edge(n));
|
|
460
|
+
}), t;
|
|
461
|
+
}
|
|
462
|
+
function Yt(e, t) {
|
|
463
|
+
var n = e.x, r = e.y, i = t.x - n, a = t.y - r, o = e.width / 2, s = e.height / 2;
|
|
464
|
+
if (!i && !a) throw Error("Not possible to find intersection inside of the rectangle");
|
|
465
|
+
var c, l;
|
|
466
|
+
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), {
|
|
467
|
+
x: n + c,
|
|
468
|
+
y: r + l
|
|
469
|
+
};
|
|
470
|
+
}
|
|
471
|
+
function U(e) {
|
|
472
|
+
var t = v(I($t(e) + 1), function() {
|
|
473
|
+
return [];
|
|
474
|
+
});
|
|
475
|
+
return c(e.nodes(), function(n) {
|
|
476
|
+
var r = e.node(n), i = r.rank;
|
|
477
|
+
w(i) || (t[i][r.order] = n);
|
|
478
|
+
}), t;
|
|
479
|
+
}
|
|
480
|
+
function Xt(e) {
|
|
481
|
+
var t = y(v(e.nodes(), function(t) {
|
|
482
|
+
return e.node(t).rank;
|
|
483
|
+
}));
|
|
484
|
+
c(e.nodes(), function(n) {
|
|
485
|
+
var r = e.node(n);
|
|
486
|
+
et(r, "rank") && (r.rank -= t);
|
|
487
|
+
});
|
|
488
|
+
}
|
|
489
|
+
function Zt(e) {
|
|
490
|
+
var t = y(v(e.nodes(), function(t) {
|
|
491
|
+
return e.node(t).rank;
|
|
492
|
+
})), n = [];
|
|
493
|
+
c(e.nodes(), function(r) {
|
|
494
|
+
var i = e.node(r).rank - t;
|
|
495
|
+
n[i] || (n[i] = []), n[i].push(r);
|
|
496
|
+
});
|
|
497
|
+
var r = 0, i = e.graph().nodeRankFactor;
|
|
498
|
+
c(n, function(t, n) {
|
|
499
|
+
w(t) && n % i !== 0 ? --r : r && c(t, function(t) {
|
|
500
|
+
e.node(t).rank += r;
|
|
501
|
+
});
|
|
502
|
+
});
|
|
503
|
+
}
|
|
504
|
+
function Qt(e, t, n, r) {
|
|
505
|
+
var i = {
|
|
506
|
+
width: 0,
|
|
507
|
+
height: 0
|
|
508
|
+
};
|
|
509
|
+
return arguments.length >= 4 && (i.rank = n, i.order = r), H(e, "border", i, t);
|
|
510
|
+
}
|
|
511
|
+
function $t(e) {
|
|
512
|
+
return j(v(e.nodes(), function(t) {
|
|
513
|
+
var n = e.node(t).rank;
|
|
514
|
+
if (!w(n)) return n;
|
|
515
|
+
}));
|
|
516
|
+
}
|
|
517
|
+
function en(e, t) {
|
|
518
|
+
var n = {
|
|
519
|
+
lhs: [],
|
|
520
|
+
rhs: []
|
|
521
|
+
};
|
|
522
|
+
return c(e, function(e) {
|
|
523
|
+
t(e) ? n.lhs.push(e) : n.rhs.push(e);
|
|
524
|
+
}), n;
|
|
525
|
+
}
|
|
526
|
+
function tn(e, t) {
|
|
527
|
+
var n = He();
|
|
528
|
+
try {
|
|
529
|
+
return t();
|
|
530
|
+
} finally {
|
|
531
|
+
console.log(e + " time: " + (He() - n) + "ms");
|
|
532
|
+
}
|
|
533
|
+
}
|
|
534
|
+
function nn(e, t) {
|
|
535
|
+
return t();
|
|
536
|
+
}
|
|
537
|
+
//#endregion
|
|
538
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/add-border-segments.js
|
|
539
|
+
function rn(e) {
|
|
540
|
+
function t(n) {
|
|
541
|
+
var r = e.children(n), i = e.node(n);
|
|
542
|
+
if (r.length && c(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
|
|
543
|
+
i.borderLeft = [], i.borderRight = [];
|
|
544
|
+
for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) an(e, "borderLeft", "_bl", n, i, a), an(e, "borderRight", "_br", n, i, a);
|
|
545
|
+
}
|
|
546
|
+
}
|
|
547
|
+
c(e.children(), t);
|
|
548
|
+
}
|
|
549
|
+
function an(e, t, n, r, i, a) {
|
|
550
|
+
var o = {
|
|
551
|
+
width: 0,
|
|
552
|
+
height: 0,
|
|
553
|
+
rank: a,
|
|
554
|
+
borderType: t
|
|
555
|
+
}, s = i[t][a - 1], c = H(e, "border", o, n);
|
|
556
|
+
i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
|
|
557
|
+
}
|
|
558
|
+
//#endregion
|
|
559
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/coordinate-system.js
|
|
560
|
+
function on(e) {
|
|
561
|
+
var t = e.graph().rankdir.toLowerCase();
|
|
562
|
+
(t === "lr" || t === "rl") && cn(e);
|
|
563
|
+
}
|
|
564
|
+
function sn(e) {
|
|
565
|
+
var t = e.graph().rankdir.toLowerCase();
|
|
566
|
+
(t === "bt" || t === "rl") && un(e), (t === "lr" || t === "rl") && (dn(e), cn(e));
|
|
567
|
+
}
|
|
568
|
+
function cn(e) {
|
|
569
|
+
c(e.nodes(), function(t) {
|
|
570
|
+
ln(e.node(t));
|
|
571
|
+
}), c(e.edges(), function(t) {
|
|
572
|
+
ln(e.edge(t));
|
|
573
|
+
});
|
|
574
|
+
}
|
|
575
|
+
function ln(e) {
|
|
576
|
+
var t = e.width;
|
|
577
|
+
e.width = e.height, e.height = t;
|
|
578
|
+
}
|
|
579
|
+
function un(e) {
|
|
580
|
+
c(e.nodes(), function(t) {
|
|
581
|
+
W(e.node(t));
|
|
582
|
+
}), c(e.edges(), function(t) {
|
|
583
|
+
var n = e.edge(t);
|
|
584
|
+
c(n.points, W), Object.prototype.hasOwnProperty.call(n, "y") && W(n);
|
|
585
|
+
});
|
|
586
|
+
}
|
|
587
|
+
function W(e) {
|
|
588
|
+
e.y = -e.y;
|
|
589
|
+
}
|
|
590
|
+
function dn(e) {
|
|
591
|
+
c(e.nodes(), function(t) {
|
|
592
|
+
G(e.node(t));
|
|
593
|
+
}), c(e.edges(), function(t) {
|
|
594
|
+
var n = e.edge(t);
|
|
595
|
+
c(n.points, G), Object.prototype.hasOwnProperty.call(n, "x") && G(n);
|
|
596
|
+
});
|
|
597
|
+
}
|
|
598
|
+
function G(e) {
|
|
599
|
+
var t = e.x;
|
|
600
|
+
e.x = e.y, e.y = t;
|
|
601
|
+
}
|
|
602
|
+
//#endregion
|
|
603
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/normalize.js
|
|
604
|
+
function fn(e) {
|
|
605
|
+
e.graph().dummyChains = [], c(e.edges(), function(t) {
|
|
606
|
+
pn(e, t);
|
|
607
|
+
});
|
|
608
|
+
}
|
|
609
|
+
function pn(e, t) {
|
|
610
|
+
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;
|
|
611
|
+
if (a !== r + 1) {
|
|
612
|
+
e.removeEdge(t);
|
|
613
|
+
var l = void 0, u, d;
|
|
614
|
+
for (d = 0, ++r; r < a; ++d, ++r) s.points = [], l = {
|
|
615
|
+
width: 0,
|
|
616
|
+
height: 0,
|
|
617
|
+
edgeLabel: s,
|
|
618
|
+
edgeObj: t,
|
|
619
|
+
rank: r
|
|
620
|
+
}, u = H(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;
|
|
621
|
+
e.setEdge(n, i, { weight: s.weight }, o);
|
|
622
|
+
}
|
|
623
|
+
}
|
|
624
|
+
function mn(e) {
|
|
625
|
+
c(e.graph().dummyChains, function(t) {
|
|
626
|
+
var n = e.node(t), r = n.edgeLabel, i;
|
|
627
|
+
for (e.setEdge(n.edgeObj, r); n.dummy;) i = e.successors(t)[0], e.removeNode(t), r.points.push({
|
|
628
|
+
x: n.x,
|
|
629
|
+
y: n.y
|
|
630
|
+
}), 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);
|
|
631
|
+
});
|
|
632
|
+
}
|
|
633
|
+
//#endregion
|
|
634
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/util.js
|
|
635
|
+
function K(e) {
|
|
636
|
+
var t = {};
|
|
637
|
+
function n(r) {
|
|
638
|
+
var i = e.node(r);
|
|
639
|
+
if (Object.prototype.hasOwnProperty.call(t, r)) return i.rank;
|
|
640
|
+
t[r] = !0;
|
|
641
|
+
var a = y(v(e.outEdges(r), function(t) {
|
|
642
|
+
return n(t.w) - e.edge(t).minlen;
|
|
643
|
+
}));
|
|
644
|
+
return (a === Infinity || a == null) && (a = 0), i.rank = a;
|
|
645
|
+
}
|
|
646
|
+
c(e.sources(), n);
|
|
647
|
+
}
|
|
648
|
+
function q(e, t) {
|
|
649
|
+
return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
|
|
650
|
+
}
|
|
651
|
+
//#endregion
|
|
652
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
|
|
653
|
+
function hn(e) {
|
|
654
|
+
var t = new E({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
|
|
655
|
+
t.setNode(n, {});
|
|
656
|
+
for (var i, a; gn(t, e) < r;) i = _n(t, e), a = t.hasNode(i.v) ? q(e, i) : -q(e, i), vn(t, e, a);
|
|
657
|
+
return t;
|
|
658
|
+
}
|
|
659
|
+
function gn(e, t) {
|
|
660
|
+
function n(r) {
|
|
661
|
+
c(t.nodeEdges(r), function(i) {
|
|
662
|
+
var a = i.v, o = r === a ? i.w : a;
|
|
663
|
+
!e.hasNode(o) && !q(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
|
|
664
|
+
});
|
|
665
|
+
}
|
|
666
|
+
return c(e.nodes(), n), e.nodeCount();
|
|
667
|
+
}
|
|
668
|
+
function _n(e, t) {
|
|
669
|
+
return M(t.edges(), function(n) {
|
|
670
|
+
if (e.hasNode(n.v) !== e.hasNode(n.w)) return q(t, n);
|
|
671
|
+
});
|
|
672
|
+
}
|
|
673
|
+
function vn(e, t, n) {
|
|
674
|
+
c(e.nodes(), function(e) {
|
|
675
|
+
t.node(e).rank += n;
|
|
676
|
+
});
|
|
677
|
+
}
|
|
678
|
+
//#endregion
|
|
679
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
|
|
680
|
+
C(1), C(1), yn.CycleException = J;
|
|
681
|
+
function yn(e) {
|
|
682
|
+
var t = {}, n = {}, r = [];
|
|
683
|
+
function i(a) {
|
|
684
|
+
if (Object.prototype.hasOwnProperty.call(n, a)) throw new J();
|
|
685
|
+
Object.prototype.hasOwnProperty.call(t, a) || (n[a] = !0, t[a] = !0, c(e.predecessors(a), i), delete n[a], r.push(a));
|
|
686
|
+
}
|
|
687
|
+
if (c(e.sinks(), i), Pt(t) !== e.nodeCount()) throw new J();
|
|
688
|
+
return r;
|
|
689
|
+
}
|
|
690
|
+
function J() {}
|
|
691
|
+
J.prototype = /* @__PURE__ */ Error();
|
|
692
|
+
//#endregion
|
|
693
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
|
|
694
|
+
function bn(e, t, n) {
|
|
695
|
+
g(t) || (t = [t]);
|
|
696
|
+
var r = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], a = {};
|
|
697
|
+
return c(t, function(t) {
|
|
698
|
+
if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
|
|
699
|
+
xn(e, t, n === "post", a, r, i);
|
|
700
|
+
}), i;
|
|
701
|
+
}
|
|
702
|
+
function xn(e, t, n, r, i, a) {
|
|
703
|
+
Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), c(i(t), function(t) {
|
|
704
|
+
xn(e, t, n, r, i, a);
|
|
705
|
+
}), n && a.push(t));
|
|
706
|
+
}
|
|
707
|
+
//#endregion
|
|
708
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
|
|
709
|
+
function Sn(e, t) {
|
|
710
|
+
return bn(e, t, "post");
|
|
711
|
+
}
|
|
712
|
+
//#endregion
|
|
713
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
|
|
714
|
+
function Cn(e, t) {
|
|
715
|
+
return bn(e, t, "pre");
|
|
716
|
+
}
|
|
717
|
+
Y.initLowLimValues = Z, Y.initCutValues = X, Y.calcCutValue = Tn, Y.leaveEdge = Dn, Y.enterEdge = On, Y.exchangeEdges = kn;
|
|
718
|
+
function Y(e) {
|
|
719
|
+
e = qt(e), K(e);
|
|
720
|
+
var t = hn(e);
|
|
721
|
+
Z(t), X(t, e);
|
|
722
|
+
for (var n, r; n = Dn(t);) r = On(t, e, n), kn(t, e, n, r);
|
|
723
|
+
}
|
|
724
|
+
function X(e, t) {
|
|
725
|
+
var n = Sn(e, e.nodes());
|
|
726
|
+
n = n.slice(0, n.length - 1), c(n, function(n) {
|
|
727
|
+
wn(e, t, n);
|
|
728
|
+
});
|
|
729
|
+
}
|
|
730
|
+
function wn(e, t, n) {
|
|
731
|
+
var r = e.node(n).parent;
|
|
732
|
+
e.edge(n, r).cutvalue = Tn(e, t, n);
|
|
733
|
+
}
|
|
734
|
+
function Tn(e, t, n) {
|
|
735
|
+
var r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
|
|
736
|
+
return a ||= (i = !1, t.edge(r, n)), o = a.weight, c(t.nodeEdges(n), function(a) {
|
|
737
|
+
var s = a.v === n, c = s ? a.w : a.v;
|
|
738
|
+
if (c !== r) {
|
|
739
|
+
var l = s === i, u = t.edge(a).weight;
|
|
740
|
+
if (o += l ? u : -u, jn(e, n, c)) {
|
|
741
|
+
var d = e.edge(n, c).cutvalue;
|
|
742
|
+
o += l ? -d : d;
|
|
743
|
+
}
|
|
744
|
+
}
|
|
745
|
+
}), o;
|
|
746
|
+
}
|
|
747
|
+
function Z(e, t) {
|
|
748
|
+
arguments.length < 2 && (t = e.nodes()[0]), En(e, {}, 1, t);
|
|
749
|
+
}
|
|
750
|
+
function En(e, t, n, r, i) {
|
|
751
|
+
var a = n, o = e.node(r);
|
|
752
|
+
return t[r] = !0, c(e.neighbors(r), function(i) {
|
|
753
|
+
Object.prototype.hasOwnProperty.call(t, i) || (n = En(e, t, n, i, r));
|
|
754
|
+
}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
|
|
755
|
+
}
|
|
756
|
+
function Dn(e) {
|
|
757
|
+
return k(e.edges(), function(t) {
|
|
758
|
+
return e.edge(t).cutvalue < 0;
|
|
759
|
+
});
|
|
760
|
+
}
|
|
761
|
+
function On(e, t, r) {
|
|
762
|
+
var i = r.v, a = r.w;
|
|
763
|
+
t.hasEdge(i, a) || (i = r.w, a = r.v);
|
|
764
|
+
var o = e.node(i), s = e.node(a), c = o, l = !1;
|
|
765
|
+
return o.lim > s.lim && (c = s, l = !0), M(n(t.edges(), function(t) {
|
|
766
|
+
return l === Mn(e, e.node(t.v), c) && l !== Mn(e, e.node(t.w), c);
|
|
767
|
+
}), function(e) {
|
|
768
|
+
return q(t, e);
|
|
769
|
+
});
|
|
770
|
+
}
|
|
771
|
+
function kn(e, t, n, r) {
|
|
772
|
+
var i = n.v, a = n.w;
|
|
773
|
+
e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), Z(e), X(e, t), An(e, t);
|
|
774
|
+
}
|
|
775
|
+
function An(e, t) {
|
|
776
|
+
var n = Cn(e, k(e.nodes(), function(e) {
|
|
777
|
+
return !t.node(e).parent;
|
|
778
|
+
}));
|
|
779
|
+
n = n.slice(1), c(n, function(n) {
|
|
780
|
+
var r = e.node(n).parent, i = t.edge(n, r), a = !1;
|
|
781
|
+
i || (i = t.edge(r, n), a = !0), t.node(n).rank = t.node(r).rank + (a ? i.minlen : -i.minlen);
|
|
782
|
+
});
|
|
783
|
+
}
|
|
784
|
+
function jn(e, t, n) {
|
|
785
|
+
return e.hasEdge(t, n);
|
|
786
|
+
}
|
|
787
|
+
function Mn(e, t, n) {
|
|
788
|
+
return n.low <= t.lim && t.lim <= n.lim;
|
|
789
|
+
}
|
|
790
|
+
//#endregion
|
|
791
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/rank/index.js
|
|
792
|
+
function Nn(e) {
|
|
793
|
+
switch (e.graph().ranker) {
|
|
794
|
+
case "network-simplex":
|
|
795
|
+
In(e);
|
|
796
|
+
break;
|
|
797
|
+
case "tight-tree":
|
|
798
|
+
Fn(e);
|
|
799
|
+
break;
|
|
800
|
+
case "longest-path":
|
|
801
|
+
Pn(e);
|
|
802
|
+
break;
|
|
803
|
+
default: In(e);
|
|
804
|
+
}
|
|
805
|
+
}
|
|
806
|
+
var Pn = K;
|
|
807
|
+
function Fn(e) {
|
|
808
|
+
K(e), hn(e);
|
|
809
|
+
}
|
|
810
|
+
function In(e) {
|
|
811
|
+
Y(e);
|
|
812
|
+
}
|
|
813
|
+
//#endregion
|
|
814
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/nesting-graph.js
|
|
815
|
+
function Ln(e) {
|
|
816
|
+
var t = H(e, "root", {}, "_root"), n = zn(e), r = j(T(n)) - 1, i = 2 * r + 1;
|
|
817
|
+
e.graph().nestingRoot = t, c(e.edges(), function(t) {
|
|
818
|
+
e.edge(t).minlen *= i;
|
|
819
|
+
});
|
|
820
|
+
var a = Bn(e) + 1;
|
|
821
|
+
c(e.children(), function(o) {
|
|
822
|
+
Rn(e, t, i, a, r, n, o);
|
|
823
|
+
}), e.graph().nodeRankFactor = i;
|
|
824
|
+
}
|
|
825
|
+
function Rn(e, t, n, r, i, a, o) {
|
|
826
|
+
var s = e.children(o);
|
|
827
|
+
if (!s.length) {
|
|
828
|
+
o !== t && e.setEdge(t, o, {
|
|
829
|
+
weight: 0,
|
|
830
|
+
minlen: n
|
|
831
|
+
});
|
|
832
|
+
return;
|
|
833
|
+
}
|
|
834
|
+
var l = Qt(e, "_bt"), u = Qt(e, "_bb"), d = e.node(o);
|
|
835
|
+
e.setParent(l, o), d.borderTop = l, e.setParent(u, o), d.borderBottom = u, c(s, function(s) {
|
|
836
|
+
Rn(e, t, n, r, i, a, s);
|
|
837
|
+
var c = e.node(s), d = c.borderTop ? c.borderTop : s, f = c.borderBottom ? c.borderBottom : s, p = c.borderTop ? r : 2 * r, m = d === f ? i - a[o] + 1 : 1;
|
|
838
|
+
e.setEdge(l, d, {
|
|
839
|
+
weight: p,
|
|
840
|
+
minlen: m,
|
|
841
|
+
nestingEdge: !0
|
|
842
|
+
}), e.setEdge(f, u, {
|
|
843
|
+
weight: p,
|
|
844
|
+
minlen: m,
|
|
845
|
+
nestingEdge: !0
|
|
846
|
+
});
|
|
847
|
+
}), e.parent(o) || e.setEdge(t, l, {
|
|
848
|
+
weight: 0,
|
|
849
|
+
minlen: i + a[o]
|
|
850
|
+
});
|
|
851
|
+
}
|
|
852
|
+
function zn(e) {
|
|
853
|
+
var t = {};
|
|
854
|
+
function n(r, i) {
|
|
855
|
+
var a = e.children(r);
|
|
856
|
+
a && a.length && c(a, function(e) {
|
|
857
|
+
n(e, i + 1);
|
|
858
|
+
}), t[r] = i;
|
|
859
|
+
}
|
|
860
|
+
return c(e.children(), function(e) {
|
|
861
|
+
n(e, 1);
|
|
862
|
+
}), t;
|
|
863
|
+
}
|
|
864
|
+
function Bn(e) {
|
|
865
|
+
return p(e.edges(), function(t, n) {
|
|
866
|
+
return t + e.edge(n).weight;
|
|
867
|
+
}, 0);
|
|
868
|
+
}
|
|
869
|
+
function Vn(e) {
|
|
870
|
+
var t = e.graph();
|
|
871
|
+
e.removeNode(t.nestingRoot), delete t.nestingRoot, c(e.edges(), function(t) {
|
|
872
|
+
e.edge(t).nestingEdge && e.removeEdge(t);
|
|
873
|
+
});
|
|
874
|
+
}
|
|
875
|
+
//#endregion
|
|
876
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
|
|
877
|
+
function Hn(e, t, n) {
|
|
878
|
+
var r = {}, i;
|
|
879
|
+
c(n, function(n) {
|
|
880
|
+
for (var a = e.parent(n), o, s; a;) {
|
|
881
|
+
if (o = e.parent(a), o ? (s = r[o], r[o] = a) : (s = i, i = a), s && s !== a) {
|
|
882
|
+
t.setEdge(s, a);
|
|
883
|
+
return;
|
|
884
|
+
}
|
|
885
|
+
a = o;
|
|
886
|
+
}
|
|
887
|
+
});
|
|
888
|
+
}
|
|
889
|
+
//#endregion
|
|
890
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
|
|
891
|
+
function Un(e, t, n) {
|
|
892
|
+
var r = Wn(e), i = new E({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
|
|
893
|
+
return e.node(t);
|
|
894
|
+
});
|
|
895
|
+
return c(e.nodes(), function(a) {
|
|
896
|
+
var o = e.node(a), s = e.parent(a);
|
|
897
|
+
(o.rank === t || o.minRank <= t && t <= o.maxRank) && (i.setNode(a), i.setParent(a, s || r), c(e[n](a), function(t) {
|
|
898
|
+
var n = t.v === a ? t.w : t.v, r = i.edge(n, a), o = w(r) ? 0 : r.weight;
|
|
899
|
+
i.setEdge(n, a, { weight: e.edge(t).weight + o });
|
|
900
|
+
}), Object.prototype.hasOwnProperty.call(o, "minRank") && i.setNode(a, {
|
|
901
|
+
borderLeft: o.borderLeft[t],
|
|
902
|
+
borderRight: o.borderRight[t]
|
|
903
|
+
}));
|
|
904
|
+
}), i;
|
|
905
|
+
}
|
|
906
|
+
function Wn(e) {
|
|
907
|
+
for (var t; e.hasNode(t = R("_root")););
|
|
908
|
+
return t;
|
|
909
|
+
}
|
|
910
|
+
//#endregion
|
|
911
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/cross-count.js
|
|
912
|
+
function Gn(e, t) {
|
|
913
|
+
for (var n = 0, r = 1; r < t.length; ++r) n += Kn(e, t[r - 1], t[r]);
|
|
914
|
+
return n;
|
|
915
|
+
}
|
|
916
|
+
function Kn(e, t, n) {
|
|
917
|
+
for (var r = Lt(n, v(n, function(e, t) {
|
|
918
|
+
return t;
|
|
919
|
+
})), i = b(v(t, function(t) {
|
|
920
|
+
return L(v(e.outEdges(t), function(t) {
|
|
921
|
+
return {
|
|
922
|
+
pos: r[t.w],
|
|
923
|
+
weight: e.edge(t).weight
|
|
924
|
+
};
|
|
925
|
+
}), "pos");
|
|
926
|
+
})), a = 1; a < n.length;) a <<= 1;
|
|
927
|
+
var o = 2 * a - 1;
|
|
928
|
+
--a;
|
|
929
|
+
var s = v(Array(o), function() {
|
|
930
|
+
return 0;
|
|
931
|
+
}), l = 0;
|
|
932
|
+
return c(i.forEach(function(e) {
|
|
933
|
+
var t = e.pos + a;
|
|
934
|
+
s[t] += e.weight;
|
|
935
|
+
for (var n = 0; t > 0;) t % 2 && (n += s[t + 1]), t = t - 1 >> 1, s[t] += e.weight;
|
|
936
|
+
l += e.weight * n;
|
|
937
|
+
})), l;
|
|
938
|
+
}
|
|
939
|
+
//#endregion
|
|
940
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/init-order.js
|
|
941
|
+
function qn(e) {
|
|
942
|
+
var t = {}, r = n(e.nodes(), function(t) {
|
|
943
|
+
return !e.children(t).length;
|
|
944
|
+
}), i = v(I(j(v(r, function(t) {
|
|
945
|
+
return e.node(t).rank;
|
|
946
|
+
})) + 1), function() {
|
|
947
|
+
return [];
|
|
948
|
+
});
|
|
949
|
+
function a(n) {
|
|
950
|
+
et(t, n) || (t[n] = !0, i[e.node(n).rank].push(n), c(e.successors(n), a));
|
|
951
|
+
}
|
|
952
|
+
return c(L(r, function(t) {
|
|
953
|
+
return e.node(t).rank;
|
|
954
|
+
}), a), i;
|
|
955
|
+
}
|
|
956
|
+
//#endregion
|
|
957
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/barycenter.js
|
|
958
|
+
function Jn(e, t) {
|
|
959
|
+
return v(t, function(t) {
|
|
960
|
+
var n = e.inEdges(t);
|
|
961
|
+
if (n.length) {
|
|
962
|
+
var r = p(n, function(t, n) {
|
|
963
|
+
var r = e.edge(n), i = e.node(n.v);
|
|
964
|
+
return {
|
|
965
|
+
sum: t.sum + r.weight * i.order,
|
|
966
|
+
weight: t.weight + r.weight
|
|
967
|
+
};
|
|
968
|
+
}, {
|
|
969
|
+
sum: 0,
|
|
970
|
+
weight: 0
|
|
971
|
+
});
|
|
972
|
+
return {
|
|
973
|
+
v: t,
|
|
974
|
+
barycenter: r.sum / r.weight,
|
|
975
|
+
weight: r.weight
|
|
976
|
+
};
|
|
977
|
+
} else return { v: t };
|
|
978
|
+
});
|
|
979
|
+
}
|
|
980
|
+
//#endregion
|
|
981
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
|
|
982
|
+
function Yn(e, t) {
|
|
983
|
+
var r = {};
|
|
984
|
+
return c(e, function(e, t) {
|
|
985
|
+
var n = r[e.v] = {
|
|
986
|
+
indegree: 0,
|
|
987
|
+
in: [],
|
|
988
|
+
out: [],
|
|
989
|
+
vs: [e.v],
|
|
990
|
+
i: t
|
|
991
|
+
};
|
|
992
|
+
w(e.barycenter) || (n.barycenter = e.barycenter, n.weight = e.weight);
|
|
993
|
+
}), c(t.edges(), function(e) {
|
|
994
|
+
var t = r[e.v], n = r[e.w];
|
|
995
|
+
!w(t) && !w(n) && (n.indegree++, t.out.push(r[e.w]));
|
|
996
|
+
}), Xn(n(r, function(e) {
|
|
997
|
+
return !e.indegree;
|
|
998
|
+
}));
|
|
999
|
+
}
|
|
1000
|
+
function Xn(e) {
|
|
1001
|
+
var t = [];
|
|
1002
|
+
function r(e) {
|
|
1003
|
+
return function(t) {
|
|
1004
|
+
t.merged || (w(t.barycenter) || w(e.barycenter) || t.barycenter >= e.barycenter) && Zn(e, t);
|
|
1005
|
+
};
|
|
1006
|
+
}
|
|
1007
|
+
function i(t) {
|
|
1008
|
+
return function(n) {
|
|
1009
|
+
n.in.push(t), --n.indegree === 0 && e.push(n);
|
|
1010
|
+
};
|
|
1011
|
+
}
|
|
1012
|
+
for (; e.length;) {
|
|
1013
|
+
var a = e.pop();
|
|
1014
|
+
t.push(a), c(a.in.reverse(), r(a)), c(a.out, i(a));
|
|
1015
|
+
}
|
|
1016
|
+
return v(n(t, function(e) {
|
|
1017
|
+
return !e.merged;
|
|
1018
|
+
}), function(e) {
|
|
1019
|
+
return F(e, [
|
|
1020
|
+
"vs",
|
|
1021
|
+
"i",
|
|
1022
|
+
"barycenter",
|
|
1023
|
+
"weight"
|
|
1024
|
+
]);
|
|
1025
|
+
});
|
|
1026
|
+
}
|
|
1027
|
+
function Zn(e, t) {
|
|
1028
|
+
var n = 0, r = 0;
|
|
1029
|
+
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;
|
|
1030
|
+
}
|
|
1031
|
+
//#endregion
|
|
1032
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort.js
|
|
1033
|
+
function Qn(e, t) {
|
|
1034
|
+
var n = en(e, function(e) {
|
|
1035
|
+
return Object.prototype.hasOwnProperty.call(e, "barycenter");
|
|
1036
|
+
}), r = n.lhs, i = L(n.rhs, function(e) {
|
|
1037
|
+
return -e.i;
|
|
1038
|
+
}), a = [], o = 0, s = 0, l = 0;
|
|
1039
|
+
r.sort(er(!!t)), l = $n(a, i, l), c(r, function(e) {
|
|
1040
|
+
l += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, l = $n(a, i, l);
|
|
1041
|
+
});
|
|
1042
|
+
var u = { vs: b(a) };
|
|
1043
|
+
return s && (u.barycenter = o / s, u.weight = s), u;
|
|
1044
|
+
}
|
|
1045
|
+
function $n(e, t, n) {
|
|
1046
|
+
for (var r; t.length && (r = O(t)).i <= n;) t.pop(), e.push(r.vs), n++;
|
|
1047
|
+
return n;
|
|
1048
|
+
}
|
|
1049
|
+
function er(e) {
|
|
1050
|
+
return function(t, n) {
|
|
1051
|
+
return t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
|
|
1052
|
+
};
|
|
1053
|
+
}
|
|
1054
|
+
//#endregion
|
|
1055
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
|
|
1056
|
+
function tr(e, t, r, i) {
|
|
1057
|
+
var a = e.children(t), o = e.node(t), s = o ? o.borderLeft : void 0, l = o ? o.borderRight : void 0, u = {};
|
|
1058
|
+
s && (a = n(a, function(e) {
|
|
1059
|
+
return e !== s && e !== l;
|
|
1060
|
+
}));
|
|
1061
|
+
var d = Jn(e, a);
|
|
1062
|
+
c(d, function(t) {
|
|
1063
|
+
if (e.children(t.v).length) {
|
|
1064
|
+
var n = tr(e, t.v, r, i);
|
|
1065
|
+
u[t.v] = n, Object.prototype.hasOwnProperty.call(n, "barycenter") && rr(t, n);
|
|
1066
|
+
}
|
|
1067
|
+
});
|
|
1068
|
+
var f = Yn(d, r);
|
|
1069
|
+
nr(f, u);
|
|
1070
|
+
var p = Qn(f, i);
|
|
1071
|
+
if (s && (p.vs = b([
|
|
1072
|
+
s,
|
|
1073
|
+
p.vs,
|
|
1074
|
+
l
|
|
1075
|
+
]), e.predecessors(s).length)) {
|
|
1076
|
+
var m = e.node(e.predecessors(s)[0]), ee = e.node(e.predecessors(l)[0]);
|
|
1077
|
+
Object.prototype.hasOwnProperty.call(p, "barycenter") || (p.barycenter = 0, p.weight = 0), p.barycenter = (p.barycenter * p.weight + m.order + ee.order) / (p.weight + 2), p.weight += 2;
|
|
1078
|
+
}
|
|
1079
|
+
return p;
|
|
1080
|
+
}
|
|
1081
|
+
function nr(e, t) {
|
|
1082
|
+
c(e, function(e) {
|
|
1083
|
+
e.vs = b(e.vs.map(function(e) {
|
|
1084
|
+
return t[e] ? t[e].vs : e;
|
|
1085
|
+
}));
|
|
1086
|
+
});
|
|
1087
|
+
}
|
|
1088
|
+
function rr(e, t) {
|
|
1089
|
+
w(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);
|
|
1090
|
+
}
|
|
1091
|
+
//#endregion
|
|
1092
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/order/index.js
|
|
1093
|
+
function ir(e) {
|
|
1094
|
+
var t = $t(e), n = ar(e, I(1, t + 1), "inEdges"), r = ar(e, I(t - 1, -1, -1), "outEdges"), i = qn(e);
|
|
1095
|
+
sr(e, i);
|
|
1096
|
+
for (var a = Infinity, o, s = 0, c = 0; c < 4; ++s, ++c) {
|
|
1097
|
+
or(s % 2 ? n : r, s % 4 >= 2), i = U(e);
|
|
1098
|
+
var l = Gn(e, i);
|
|
1099
|
+
l < a && (c = 0, o = Ve(i), a = l);
|
|
1100
|
+
}
|
|
1101
|
+
sr(e, o);
|
|
1102
|
+
}
|
|
1103
|
+
function ar(e, t, n) {
|
|
1104
|
+
return v(t, function(t) {
|
|
1105
|
+
return Un(e, t, n);
|
|
1106
|
+
});
|
|
1107
|
+
}
|
|
1108
|
+
function or(e, t) {
|
|
1109
|
+
var n = new E();
|
|
1110
|
+
c(e, function(e) {
|
|
1111
|
+
var r = e.graph().root, i = tr(e, r, n, t);
|
|
1112
|
+
c(i.vs, function(t, n) {
|
|
1113
|
+
e.node(t).order = n;
|
|
1114
|
+
}), Hn(e, n, i.vs);
|
|
1115
|
+
});
|
|
1116
|
+
}
|
|
1117
|
+
function sr(e, t) {
|
|
1118
|
+
c(t, function(t) {
|
|
1119
|
+
c(t, function(t, n) {
|
|
1120
|
+
e.node(t).order = n;
|
|
1121
|
+
});
|
|
1122
|
+
});
|
|
1123
|
+
}
|
|
1124
|
+
//#endregion
|
|
1125
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
|
|
1126
|
+
function cr(e) {
|
|
1127
|
+
var t = ur(e);
|
|
1128
|
+
c(e.graph().dummyChains, function(n) {
|
|
1129
|
+
for (var r = e.node(n), i = r.edgeObj, a = lr(e, t, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; n !== i.w;) {
|
|
1130
|
+
if (r = e.node(n), u) {
|
|
1131
|
+
for (; (l = o[c]) !== s && e.node(l).maxRank < r.rank;) c++;
|
|
1132
|
+
l === s && (u = !1);
|
|
1133
|
+
}
|
|
1134
|
+
if (!u) {
|
|
1135
|
+
for (; c < o.length - 1 && e.node(l = o[c + 1]).minRank <= r.rank;) c++;
|
|
1136
|
+
l = o[c];
|
|
1137
|
+
}
|
|
1138
|
+
e.setParent(n, l), n = e.successors(n)[0];
|
|
1139
|
+
}
|
|
1140
|
+
});
|
|
1141
|
+
}
|
|
1142
|
+
function lr(e, t, n, r) {
|
|
1143
|
+
var i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c = n, l;
|
|
1144
|
+
do
|
|
1145
|
+
c = e.parent(c), i.push(c);
|
|
1146
|
+
while (c && (t[c].low > o || s > t[c].lim));
|
|
1147
|
+
for (l = c, c = r; (c = e.parent(c)) !== l;) a.push(c);
|
|
1148
|
+
return {
|
|
1149
|
+
path: i.concat(a.reverse()),
|
|
1150
|
+
lca: l
|
|
1151
|
+
};
|
|
1152
|
+
}
|
|
1153
|
+
function ur(e) {
|
|
1154
|
+
var t = {}, n = 0;
|
|
1155
|
+
function r(i) {
|
|
1156
|
+
var a = n;
|
|
1157
|
+
c(e.children(i), r), t[i] = {
|
|
1158
|
+
low: a,
|
|
1159
|
+
lim: n++
|
|
1160
|
+
};
|
|
1161
|
+
}
|
|
1162
|
+
return c(e.children(), r), t;
|
|
1163
|
+
}
|
|
1164
|
+
//#endregion
|
|
1165
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/bk.js
|
|
1166
|
+
function dr(e, t) {
|
|
1167
|
+
var n = {};
|
|
1168
|
+
function r(t, r) {
|
|
1169
|
+
var i = 0, a = 0, o = t.length, s = O(r);
|
|
1170
|
+
return c(r, function(t, l) {
|
|
1171
|
+
var u = pr(e, t), d = u ? e.node(u).order : o;
|
|
1172
|
+
(u || t === s) && (c(r.slice(a, l + 1), function(t) {
|
|
1173
|
+
c(e.predecessors(t), function(r) {
|
|
1174
|
+
var a = e.node(r), o = a.order;
|
|
1175
|
+
(o < i || d < o) && !(a.dummy && e.node(t).dummy) && mr(n, r, t);
|
|
1176
|
+
});
|
|
1177
|
+
}), a = l + 1, i = d);
|
|
1178
|
+
}), r;
|
|
1179
|
+
}
|
|
1180
|
+
return p(t, r), n;
|
|
1181
|
+
}
|
|
1182
|
+
function fr(e, t) {
|
|
1183
|
+
var n = {};
|
|
1184
|
+
function r(t, r, i, a, o) {
|
|
1185
|
+
var s;
|
|
1186
|
+
c(I(r, i), function(r) {
|
|
1187
|
+
s = t[r], e.node(s).dummy && c(e.predecessors(s), function(t) {
|
|
1188
|
+
var r = e.node(t);
|
|
1189
|
+
r.dummy && (r.order < a || r.order > o) && mr(n, t, s);
|
|
1190
|
+
});
|
|
1191
|
+
});
|
|
1192
|
+
}
|
|
1193
|
+
function i(t, n) {
|
|
1194
|
+
var i = -1, a, o = 0;
|
|
1195
|
+
return c(n, function(s, c) {
|
|
1196
|
+
if (e.node(s).dummy === "border") {
|
|
1197
|
+
var l = e.predecessors(s);
|
|
1198
|
+
l.length && (a = e.node(l[0]).order, r(n, o, c, i, a), o = c, i = a);
|
|
1199
|
+
}
|
|
1200
|
+
r(n, o, n.length, a, t.length);
|
|
1201
|
+
}), n;
|
|
1202
|
+
}
|
|
1203
|
+
return p(t, i), n;
|
|
1204
|
+
}
|
|
1205
|
+
function pr(e, t) {
|
|
1206
|
+
if (e.node(t).dummy) return k(e.predecessors(t), function(t) {
|
|
1207
|
+
return e.node(t).dummy;
|
|
1208
|
+
});
|
|
1209
|
+
}
|
|
1210
|
+
function mr(e, t, n) {
|
|
1211
|
+
if (t > n) {
|
|
1212
|
+
var r = t;
|
|
1213
|
+
t = n, n = r;
|
|
1214
|
+
}
|
|
1215
|
+
Object.prototype.hasOwnProperty.call(e, t) || Object.defineProperty(e, t, {
|
|
1216
|
+
enumerable: !0,
|
|
1217
|
+
configurable: !0,
|
|
1218
|
+
value: {},
|
|
1219
|
+
writable: !0
|
|
1220
|
+
});
|
|
1221
|
+
var i = e[t];
|
|
1222
|
+
Object.defineProperty(i, n, {
|
|
1223
|
+
enumerable: !0,
|
|
1224
|
+
configurable: !0,
|
|
1225
|
+
value: !0,
|
|
1226
|
+
writable: !0
|
|
1227
|
+
});
|
|
1228
|
+
}
|
|
1229
|
+
function hr(e, t, n) {
|
|
1230
|
+
if (t > n) {
|
|
1231
|
+
var r = t;
|
|
1232
|
+
t = n, n = r;
|
|
1233
|
+
}
|
|
1234
|
+
return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
|
|
1235
|
+
}
|
|
1236
|
+
function gr(e, t, n, r) {
|
|
1237
|
+
var i = {}, a = {}, o = {};
|
|
1238
|
+
return c(t, function(e) {
|
|
1239
|
+
c(e, function(e, t) {
|
|
1240
|
+
i[e] = e, a[e] = e, o[e] = t;
|
|
1241
|
+
});
|
|
1242
|
+
}), c(t, function(e) {
|
|
1243
|
+
var t = -1;
|
|
1244
|
+
c(e, function(e) {
|
|
1245
|
+
var s = r(e);
|
|
1246
|
+
if (s.length) {
|
|
1247
|
+
s = L(s, function(e) {
|
|
1248
|
+
return o[e];
|
|
1249
|
+
});
|
|
1250
|
+
for (var c = (s.length - 1) / 2, l = Math.floor(c), u = Math.ceil(c); l <= u; ++l) {
|
|
1251
|
+
var d = s[l];
|
|
1252
|
+
a[e] === e && t < o[d] && !hr(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
|
|
1253
|
+
}
|
|
1254
|
+
}
|
|
1255
|
+
});
|
|
1256
|
+
}), {
|
|
1257
|
+
root: i,
|
|
1258
|
+
align: a
|
|
1259
|
+
};
|
|
1260
|
+
}
|
|
1261
|
+
function _r(e, t, n, r, i) {
|
|
1262
|
+
var a = {}, o = vr(e, t, n, i), s = i ? "borderLeft" : "borderRight";
|
|
1263
|
+
function l(e, t) {
|
|
1264
|
+
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();
|
|
1265
|
+
}
|
|
1266
|
+
function u(e) {
|
|
1267
|
+
a[e] = o.inEdges(e).reduce(function(e, t) {
|
|
1268
|
+
return Math.max(e, a[t.v] + o.edge(t));
|
|
1269
|
+
}, 0);
|
|
1270
|
+
}
|
|
1271
|
+
function d(t) {
|
|
1272
|
+
var n = o.outEdges(t).reduce(function(e, t) {
|
|
1273
|
+
return Math.min(e, a[t.w] - o.edge(t));
|
|
1274
|
+
}, Infinity), r = e.node(t);
|
|
1275
|
+
n !== Infinity && r.borderType !== s && (a[t] = Math.max(a[t], n));
|
|
1276
|
+
}
|
|
1277
|
+
return l(u, o.predecessors.bind(o)), l(d, o.successors.bind(o)), c(r, function(e) {
|
|
1278
|
+
a[e] = a[n[e]];
|
|
1279
|
+
}), a;
|
|
1280
|
+
}
|
|
1281
|
+
function vr(e, t, n, r) {
|
|
1282
|
+
var i = new E(), a = e.graph(), o = Cr(a.nodesep, a.edgesep, r);
|
|
1283
|
+
return c(t, function(t) {
|
|
1284
|
+
var r;
|
|
1285
|
+
c(t, function(t) {
|
|
1286
|
+
var a = n[t];
|
|
1287
|
+
if (i.setNode(a), r) {
|
|
1288
|
+
var s = n[r], c = i.edge(s, a);
|
|
1289
|
+
i.setEdge(s, a, Math.max(o(e, t, r), c || 0));
|
|
1290
|
+
}
|
|
1291
|
+
r = t;
|
|
1292
|
+
});
|
|
1293
|
+
}), i;
|
|
1294
|
+
}
|
|
1295
|
+
function yr(e, t) {
|
|
1296
|
+
return M(T(t), function(t) {
|
|
1297
|
+
var n = -Infinity, r = Infinity;
|
|
1298
|
+
return Ye(t, function(t, i) {
|
|
1299
|
+
var a = wr(e, i) / 2;
|
|
1300
|
+
n = Math.max(t + a, n), r = Math.min(t - a, r);
|
|
1301
|
+
}), n - r;
|
|
1302
|
+
});
|
|
1303
|
+
}
|
|
1304
|
+
function br(e, t) {
|
|
1305
|
+
var n = T(t), r = y(n), i = j(n);
|
|
1306
|
+
c(["u", "d"], function(n) {
|
|
1307
|
+
c(["l", "r"], function(a) {
|
|
1308
|
+
var o = n + a, s = e[o], c;
|
|
1309
|
+
if (s !== t) {
|
|
1310
|
+
var l = T(s);
|
|
1311
|
+
c = a === "l" ? r - y(l) : i - j(l), c && (e[o] = A(s, function(e) {
|
|
1312
|
+
return e + c;
|
|
1313
|
+
}));
|
|
1314
|
+
}
|
|
1315
|
+
});
|
|
1316
|
+
});
|
|
1317
|
+
}
|
|
1318
|
+
function xr(e, t) {
|
|
1319
|
+
return A(e.ul, function(n, r) {
|
|
1320
|
+
if (t) return e[t.toLowerCase()][r];
|
|
1321
|
+
var i = L(v(e, r));
|
|
1322
|
+
return (i[1] + i[2]) / 2;
|
|
1323
|
+
});
|
|
1324
|
+
}
|
|
1325
|
+
function Sr(e) {
|
|
1326
|
+
var t = U(e), n = x(dr(e, t), fr(e, t)), r = {}, i;
|
|
1327
|
+
return c(["u", "d"], function(a) {
|
|
1328
|
+
i = a === "u" ? t : T(t).reverse(), c(["l", "r"], function(t) {
|
|
1329
|
+
t === "r" && (i = v(i, function(e) {
|
|
1330
|
+
return T(e).reverse();
|
|
1331
|
+
}));
|
|
1332
|
+
var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = gr(e, i, n, o), c = _r(e, i, s.root, s.align, t === "r");
|
|
1333
|
+
t === "r" && (c = A(c, function(e) {
|
|
1334
|
+
return -e;
|
|
1335
|
+
})), r[a + t] = c;
|
|
1336
|
+
});
|
|
1337
|
+
}), br(r, yr(e, r)), xr(r, e.graph().align);
|
|
1338
|
+
}
|
|
1339
|
+
function Cr(e, t, n) {
|
|
1340
|
+
return function(r, i, a) {
|
|
1341
|
+
var o = r.node(i), s = r.node(a), c = 0, l;
|
|
1342
|
+
if (c += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos")) switch (o.labelpos.toLowerCase()) {
|
|
1343
|
+
case "l":
|
|
1344
|
+
l = -o.width / 2;
|
|
1345
|
+
break;
|
|
1346
|
+
case "r":
|
|
1347
|
+
l = o.width / 2;
|
|
1348
|
+
break;
|
|
1349
|
+
}
|
|
1350
|
+
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()) {
|
|
1351
|
+
case "l":
|
|
1352
|
+
l = s.width / 2;
|
|
1353
|
+
break;
|
|
1354
|
+
case "r":
|
|
1355
|
+
l = -s.width / 2;
|
|
1356
|
+
break;
|
|
1357
|
+
}
|
|
1358
|
+
return l && (c += n ? l : -l), l = 0, c;
|
|
1359
|
+
};
|
|
1360
|
+
}
|
|
1361
|
+
function wr(e, t) {
|
|
1362
|
+
return e.node(t).width;
|
|
1363
|
+
}
|
|
1364
|
+
//#endregion
|
|
1365
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/position/index.js
|
|
1366
|
+
function Tr(e) {
|
|
1367
|
+
e = Jt(e), Er(e), Xe(Sr(e), function(t, n) {
|
|
1368
|
+
e.node(n).x = t;
|
|
1369
|
+
});
|
|
1370
|
+
}
|
|
1371
|
+
function Er(e) {
|
|
1372
|
+
var t = U(e), n = e.graph().ranksep, r = 0;
|
|
1373
|
+
c(t, function(t) {
|
|
1374
|
+
var i = j(v(t, function(t) {
|
|
1375
|
+
return e.node(t).height;
|
|
1376
|
+
}));
|
|
1377
|
+
c(t, function(t) {
|
|
1378
|
+
e.node(t).y = r + i / 2;
|
|
1379
|
+
}), r += i + n;
|
|
1380
|
+
});
|
|
1381
|
+
}
|
|
1382
|
+
//#endregion
|
|
1383
|
+
//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/dagre/layout.js
|
|
1384
|
+
function Dr(e, t) {
|
|
1385
|
+
var n = t && t.debugTiming ? tn : nn;
|
|
1386
|
+
n("layout", () => {
|
|
1387
|
+
var t = n(" buildLayoutGraph", () => Rr(e));
|
|
1388
|
+
n(" runLayout", () => Or(t, n)), n(" updateInputGraph", () => kr(e, t));
|
|
1389
|
+
});
|
|
1390
|
+
}
|
|
1391
|
+
function Or(e, t) {
|
|
1392
|
+
t(" makeSpaceForEdgeLabels", () => zr(e)), t(" removeSelfEdges", () => Jr(e)), t(" acyclic", () => Wt(e)), t(" nestingGraph.run", () => Ln(e)), t(" rank", () => Nn(Jt(e))), t(" injectEdgeLabelProxies", () => Br(e)), t(" removeEmptyRanks", () => Zt(e)), t(" nestingGraph.cleanup", () => Vn(e)), t(" normalizeRanks", () => Xt(e)), t(" assignRankMinMax", () => Vr(e)), t(" removeEdgeLabelProxies", () => Hr(e)), t(" normalize.run", () => fn(e)), t(" parentDummyChains", () => cr(e)), t(" addBorderSegments", () => rn(e)), t(" order", () => ir(e)), t(" insertSelfEdges", () => Yr(e)), t(" adjustCoordinateSystem", () => on(e)), t(" position", () => Tr(e)), t(" positionSelfEdges", () => Xr(e)), t(" removeBorderNodes", () => qr(e)), t(" normalize.undo", () => mn(e)), t(" fixupEdgeLabelCoords", () => Gr(e)), t(" undoCoordinateSystem", () => sn(e)), t(" translateGraph", () => Ur(e)), t(" assignNodeIntersects", () => Wr(e)), t(" reversePoints", () => Kr(e)), t(" acyclic.undo", () => Kt(e));
|
|
1393
|
+
}
|
|
1394
|
+
function kr(e, t) {
|
|
1395
|
+
c(e.nodes(), function(n) {
|
|
1396
|
+
var r = e.node(n), i = t.node(n);
|
|
1397
|
+
r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
|
|
1398
|
+
}), c(e.edges(), function(n) {
|
|
1399
|
+
var r = e.edge(n), i = t.edge(n);
|
|
1400
|
+
r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
|
|
1401
|
+
}), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
|
|
1402
|
+
}
|
|
1403
|
+
var Ar = [
|
|
1404
|
+
"nodesep",
|
|
1405
|
+
"edgesep",
|
|
1406
|
+
"ranksep",
|
|
1407
|
+
"marginx",
|
|
1408
|
+
"marginy"
|
|
1409
|
+
], jr = {
|
|
1410
|
+
ranksep: 50,
|
|
1411
|
+
edgesep: 20,
|
|
1412
|
+
nodesep: 50,
|
|
1413
|
+
rankdir: "tb"
|
|
1414
|
+
}, Mr = [
|
|
1415
|
+
"acyclicer",
|
|
1416
|
+
"ranker",
|
|
1417
|
+
"rankdir",
|
|
1418
|
+
"align"
|
|
1419
|
+
], Nr = ["width", "height"], Pr = {
|
|
1420
|
+
width: 0,
|
|
1421
|
+
height: 0
|
|
1422
|
+
}, Fr = [
|
|
1423
|
+
"minlen",
|
|
1424
|
+
"weight",
|
|
1425
|
+
"width",
|
|
1426
|
+
"height",
|
|
1427
|
+
"labeloffset"
|
|
1428
|
+
], Ir = {
|
|
1429
|
+
minlen: 1,
|
|
1430
|
+
weight: 1,
|
|
1431
|
+
width: 0,
|
|
1432
|
+
height: 0,
|
|
1433
|
+
labeloffset: 10,
|
|
1434
|
+
labelpos: "r"
|
|
1435
|
+
}, Lr = ["labelpos"];
|
|
1436
|
+
function Rr(e) {
|
|
1437
|
+
var t = new E({
|
|
1438
|
+
multigraph: !0,
|
|
1439
|
+
compound: !0
|
|
1440
|
+
}), n = $(e.graph());
|
|
1441
|
+
return t.setGraph(x({}, jr, Q(n, Ar), F(n, Mr))), c(e.nodes(), function(n) {
|
|
1442
|
+
var r = $(e.node(n));
|
|
1443
|
+
t.setNode(n, Ge(Q(r, Nr), Pr)), t.setParent(n, e.parent(n));
|
|
1444
|
+
}), c(e.edges(), function(n) {
|
|
1445
|
+
var r = $(e.edge(n));
|
|
1446
|
+
t.setEdge(n, x({}, Ir, Q(r, Fr), F(r, Lr)));
|
|
1447
|
+
}), t;
|
|
1448
|
+
}
|
|
1449
|
+
function zr(e) {
|
|
1450
|
+
var t = e.graph();
|
|
1451
|
+
t.ranksep /= 2, c(e.edges(), function(n) {
|
|
1452
|
+
var r = e.edge(n);
|
|
1453
|
+
r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
|
|
1454
|
+
});
|
|
1455
|
+
}
|
|
1456
|
+
function Br(e) {
|
|
1457
|
+
c(e.edges(), function(t) {
|
|
1458
|
+
var n = e.edge(t);
|
|
1459
|
+
if (n.width && n.height) {
|
|
1460
|
+
var r = e.node(t.v);
|
|
1461
|
+
H(e, "edge-proxy", {
|
|
1462
|
+
rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
|
|
1463
|
+
e: t
|
|
1464
|
+
}, "_ep");
|
|
1465
|
+
}
|
|
1466
|
+
});
|
|
1467
|
+
}
|
|
1468
|
+
function Vr(e) {
|
|
1469
|
+
var t = 0;
|
|
1470
|
+
c(e.nodes(), function(n) {
|
|
1471
|
+
var r = e.node(n);
|
|
1472
|
+
r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = j(t, r.maxRank));
|
|
1473
|
+
}), e.graph().maxRank = t;
|
|
1474
|
+
}
|
|
1475
|
+
function Hr(e) {
|
|
1476
|
+
c(e.nodes(), function(t) {
|
|
1477
|
+
var n = e.node(t);
|
|
1478
|
+
n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
|
|
1479
|
+
});
|
|
1480
|
+
}
|
|
1481
|
+
function Ur(e) {
|
|
1482
|
+
var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
|
|
1483
|
+
function l(e) {
|
|
1484
|
+
var a = e.x, o = e.y, s = e.width, c = e.height;
|
|
1485
|
+
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);
|
|
1486
|
+
}
|
|
1487
|
+
c(e.nodes(), function(t) {
|
|
1488
|
+
l(e.node(t));
|
|
1489
|
+
}), c(e.edges(), function(t) {
|
|
1490
|
+
var n = e.edge(t);
|
|
1491
|
+
Object.prototype.hasOwnProperty.call(n, "x") && l(n);
|
|
1492
|
+
}), t -= o, r -= s, c(e.nodes(), function(n) {
|
|
1493
|
+
var i = e.node(n);
|
|
1494
|
+
i.x -= t, i.y -= r;
|
|
1495
|
+
}), c(e.edges(), function(n) {
|
|
1496
|
+
var i = e.edge(n);
|
|
1497
|
+
c(i.points, function(e) {
|
|
1498
|
+
e.x -= t, e.y -= r;
|
|
1499
|
+
}), Object.prototype.hasOwnProperty.call(i, "x") && (i.x -= t), Object.prototype.hasOwnProperty.call(i, "y") && (i.y -= r);
|
|
1500
|
+
}), a.width = n - t + o, a.height = i - r + s;
|
|
1501
|
+
}
|
|
1502
|
+
function Wr(e) {
|
|
1503
|
+
c(e.edges(), function(t) {
|
|
1504
|
+
var n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
|
|
1505
|
+
n.points ? (a = n.points[0], o = n.points[n.points.length - 1]) : (n.points = [], a = i, o = r), n.points.unshift(Yt(r, a)), n.points.push(Yt(i, o));
|
|
1506
|
+
});
|
|
1507
|
+
}
|
|
1508
|
+
function Gr(e) {
|
|
1509
|
+
c(e.edges(), function(t) {
|
|
1510
|
+
var n = e.edge(t);
|
|
1511
|
+
if (Object.prototype.hasOwnProperty.call(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
|
|
1512
|
+
case "l":
|
|
1513
|
+
n.x -= n.width / 2 + n.labeloffset;
|
|
1514
|
+
break;
|
|
1515
|
+
case "r":
|
|
1516
|
+
n.x += n.width / 2 + n.labeloffset;
|
|
1517
|
+
break;
|
|
1518
|
+
}
|
|
1519
|
+
});
|
|
1520
|
+
}
|
|
1521
|
+
function Kr(e) {
|
|
1522
|
+
c(e.edges(), function(t) {
|
|
1523
|
+
var n = e.edge(t);
|
|
1524
|
+
n.reversed && n.points.reverse();
|
|
1525
|
+
});
|
|
1526
|
+
}
|
|
1527
|
+
function qr(e) {
|
|
1528
|
+
c(e.nodes(), function(t) {
|
|
1529
|
+
if (e.children(t).length) {
|
|
1530
|
+
var n = e.node(t), r = e.node(n.borderTop), i = e.node(n.borderBottom), a = e.node(O(n.borderLeft)), o = e.node(O(n.borderRight));
|
|
1531
|
+
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;
|
|
1532
|
+
}
|
|
1533
|
+
}), c(e.nodes(), function(t) {
|
|
1534
|
+
e.node(t).dummy === "border" && e.removeNode(t);
|
|
1535
|
+
});
|
|
1536
|
+
}
|
|
1537
|
+
function Jr(e) {
|
|
1538
|
+
c(e.edges(), function(t) {
|
|
1539
|
+
if (t.v === t.w) {
|
|
1540
|
+
var n = e.node(t.v);
|
|
1541
|
+
n.selfEdges ||= [], n.selfEdges.push({
|
|
1542
|
+
e: t,
|
|
1543
|
+
label: e.edge(t)
|
|
1544
|
+
}), e.removeEdge(t);
|
|
1545
|
+
}
|
|
1546
|
+
});
|
|
1547
|
+
}
|
|
1548
|
+
function Yr(e) {
|
|
1549
|
+
c(U(e), function(t) {
|
|
1550
|
+
var n = 0;
|
|
1551
|
+
c(t, function(t, r) {
|
|
1552
|
+
var i = e.node(t);
|
|
1553
|
+
i.order = r + n, c(i.selfEdges, function(t) {
|
|
1554
|
+
H(e, "selfedge", {
|
|
1555
|
+
width: t.label.width,
|
|
1556
|
+
height: t.label.height,
|
|
1557
|
+
rank: i.rank,
|
|
1558
|
+
order: r + ++n,
|
|
1559
|
+
e: t.e,
|
|
1560
|
+
label: t.label
|
|
1561
|
+
}, "_se");
|
|
1562
|
+
}), delete i.selfEdges;
|
|
1563
|
+
});
|
|
1564
|
+
});
|
|
1565
|
+
}
|
|
1566
|
+
function Xr(e) {
|
|
1567
|
+
c(e.nodes(), function(t) {
|
|
1568
|
+
var n = e.node(t);
|
|
1569
|
+
if (n.dummy === "selfedge") {
|
|
1570
|
+
var r = e.node(n.e.v), i = r.x + r.width / 2, a = r.y, o = n.x - i, s = r.height / 2;
|
|
1571
|
+
e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [
|
|
1572
|
+
{
|
|
1573
|
+
x: i + 2 * o / 3,
|
|
1574
|
+
y: a - s
|
|
1575
|
+
},
|
|
1576
|
+
{
|
|
1577
|
+
x: i + 5 * o / 6,
|
|
1578
|
+
y: a - s
|
|
1579
|
+
},
|
|
1580
|
+
{
|
|
1581
|
+
x: i + o,
|
|
1582
|
+
y: a
|
|
1583
|
+
},
|
|
1584
|
+
{
|
|
1585
|
+
x: i + 5 * o / 6,
|
|
1586
|
+
y: a + s
|
|
1587
|
+
},
|
|
1588
|
+
{
|
|
1589
|
+
x: i + 2 * o / 3,
|
|
1590
|
+
y: a + s
|
|
1591
|
+
}
|
|
1592
|
+
], n.label.x = n.x, n.label.y = n.y;
|
|
1593
|
+
}
|
|
1594
|
+
});
|
|
1595
|
+
}
|
|
1596
|
+
function Q(e, t) {
|
|
1597
|
+
return A(F(e, t), Number);
|
|
1598
|
+
}
|
|
1599
|
+
function $(e) {
|
|
1600
|
+
var t = {};
|
|
1601
|
+
return c(e, function(e, n) {
|
|
1602
|
+
t[n.toLowerCase()] = e;
|
|
1603
|
+
}), t;
|
|
1604
|
+
}
|
|
1605
|
+
//#endregion
|
|
1606
|
+
export { Dr as t };
|