@pi-outpost/embed 0.32.3 → 0.33.0

package/dist/dagre-W4DXFKR2-ECmxkO0T.js

@@ -0,0 +1,2356 @@
+import { n as e } from "./chunk-Y2CYZVJY-CwsV_8W4.js";
+import { m as t } from "./src-Dkp7vqs8.js";
+import { b as n } from "./chunk-VPRB5NB3-DJh7spRO.js";
+import "./chunk-3YJQHVM4-BNbfg-7y.js";
+import "./chunk-HJ2JQQFS-CgYTXthn.js";
+import "./chunk-E2ZNV5FY-Bu796yUY.js";
+import "./chunk-4EA7E6EY-B5P7n2an.js";
+import { c as r } from "./chunk-XC4XBNZT-CSiWBPH9.js";
+import { a as i, i as a, n as o } from "./chunk-DBDB3WZW-DpEOsLsQ.js";
+import { a as s, i as c, l } from "./chunk-2BW5OAIV-DWtmlmt_.js";
+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-CQa_B3rm.js";
+import { r as Le } from "./chunk-NTY3LDVX-CvRtOCpm.js";
+import { c as Re, i as ze, n as j, o as Be, r as Ve, s as He, t as Ue } from "./chunk-FVRAUYC3-tiT7dtx-.js";
+//#region ../node_modules/lodash-es/_trimmedEndIndex.js
+var We = /\s/;
+function Ge(e) {
+	for (var t = e.length; t-- && We.test(e.charAt(t)););
+	return t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseTrim.js
+var Ke = /^\s+/;
+function qe(e) {
+	return e && e.slice(0, Ge(e) + 1).replace(Ke, "");
+}
+//#endregion
+//#region ../node_modules/lodash-es/toNumber.js
+var Je = NaN, Ye = /^[-+]0x[0-9a-f]+$/i, Xe = /^0b[01]+$/i, Ze = /^0o[0-7]+$/i, Qe = parseInt;
+function $e(e) {
+	if (typeof e == "number") return e;
+	if (ye(e)) return Je;
+	if (b(e)) {
+		var t = typeof e.valueOf == "function" ? e.valueOf() : e;
+		e = b(t) ? t + "" : t;
+	}
+	if (typeof e != "string") return e === 0 ? e : +e;
+	e = qe(e);
+	var n = Xe.test(e);
+	return n || Ze.test(e) ? Qe(e.slice(2), n ? 2 : 8) : Ye.test(e) ? Je : +e;
+}
+//#endregion
+//#region ../node_modules/lodash-es/toFinite.js
+var et = 1 / 0, tt = 17976931348623157e292;
+function M(e) {
+	return e ? (e = $e(e), e === et || e === -et ? (e < 0 ? -1 : 1) * tt : e === e ? e : 0) : e === 0 ? e : 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/toInteger.js
+function nt(e) {
+	var t = M(e), n = t % 1;
+	return t === t ? n ? t - n : t : 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseCreate.js
+var rt = Object.create, it = function() {
+	function e() {}
+	return function(t) {
+		if (!b(t)) return {};
+		if (rt) return rt(t);
+		e.prototype = t;
+		var n = new e();
+		return e.prototype = void 0, n;
+	};
+}();
+//#endregion
+//#region ../node_modules/lodash-es/_copyArray.js
+function at(e, t) {
+	var n = -1, r = e.length;
+	for (t ||= Array(r); ++n < r;) t[n] = e[n];
+	return t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseAssignValue.js
+function N(e, t, n) {
+	t == "__proto__" && ke ? ke(e, t, {
+		configurable: !0,
+		enumerable: !0,
+		value: n,
+		writable: !0
+	}) : e[t] = n;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_assignValue.js
+var ot = Object.prototype.hasOwnProperty;
+function P(e, t, n) {
+	var r = e[t];
+	(!(ot.call(e, t) && _(r, n)) || n === void 0 && !(t in e)) && N(e, t, n);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_copyObject.js
+function F(e, t, n, r) {
+	var i = !n;
+	n ||= {};
+	for (var a = -1, o = t.length; ++a < o;) {
+		var s = t[a], c = r ? r(n[s], e[s], s, n, e) : void 0;
+		c === void 0 && (c = e[s]), i ? N(n, s, c) : P(n, s, c);
+	}
+	return n;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_isIterateeCall.js
+function I(e, t, n) {
+	if (!b(n)) return !1;
+	var r = typeof t;
+	return (r == "number" ? A(n) && de(t, n.length) : r == "string" && t in n) ? _(n[t], e) : !1;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_createAssigner.js
+function st(e) {
+	return f(function(t, n) {
+		var r = -1, i = n.length, a = i > 1 ? n[i - 1] : void 0, o = i > 2 ? n[2] : void 0;
+		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;) {
+			var s = n[r];
+			s && e(t, s, r, a);
+		}
+		return t;
+	});
+}
+//#endregion
+//#region ../node_modules/lodash-es/_nativeKeysIn.js
+function ct(e) {
+	var t = [];
+	if (e != null) for (var n in Object(e)) t.push(n);
+	return t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseKeysIn.js
+var lt = Object.prototype.hasOwnProperty;
+function ut(e) {
+	if (!b(e)) return ct(e);
+	var t = ce(e), n = [];
+	for (var r in e) r == "constructor" && (t || !lt.call(e, r)) || n.push(r);
+	return n;
+}
+//#endregion
+//#region ../node_modules/lodash-es/keysIn.js
+function L(e) {
+	return A(e) ? ae(e, !0) : ut(e);
+}
+//#endregion
+//#region ../node_modules/lodash-es/flatten.js
+function R(e) {
+	return e != null && e.length ? p(e, 1) : [];
+}
+//#endregion
+//#region ../node_modules/lodash-es/_flatRest.js
+function dt(e) {
+	return re(fe(e, void 0, R), e + "");
+}
+//#endregion
+//#region ../node_modules/lodash-es/_getPrototype.js
+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);
+function yt(e) {
+	if (!k(e) || De(e) != pt) return !1;
+	var t = ft(e);
+	if (t === null) return !0;
+	var n = _t.call(t, "constructor") && t.constructor;
+	return typeof n == "function" && n instanceof n && gt.call(n) == vt;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_hasUnicode.js
+var bt = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
+function xt(e) {
+	return bt.test(e);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseAssign.js
+function St(e, t) {
+	return e && F(t, we(t), e);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseAssignIn.js
+function Ct(e, t) {
+	return e && F(t, L(t), e);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_cloneBuffer.js
+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;
+function Ot(e, t) {
+	if (t) return e.slice();
+	var n = e.length, r = Dt ? Dt(n) : new e.constructor(n);
+	return e.copy(r), r;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_copySymbols.js
+function kt(e, t) {
+	return F(e, ge(e), t);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_getSymbolsIn.js
+var At = Object.getOwnPropertySymbols ? function(e) {
+	for (var t = []; e;) Pe(t, ge(e)), e = ft(e);
+	return t;
+} : Fe;
+//#endregion
+//#region ../node_modules/lodash-es/_copySymbolsIn.js
+function jt(e, t) {
+	return F(e, At(e), t);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_getAllKeysIn.js
+function Mt(e) {
+	return Ie(e, L, At);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_initCloneArray.js
+var Nt = Object.prototype.hasOwnProperty;
+function Pt(e) {
+	var t = e.length, n = new e.constructor(t);
+	return t && typeof e[0] == "string" && Nt.call(e, "index") && (n.index = e.index, n.input = e.input), n;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_cloneArrayBuffer.js
+function Ft(e) {
+	var t = new e.constructor(e.byteLength);
+	return new be(t).set(new be(e)), t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_cloneDataView.js
+function It(e, t) {
+	var n = t ? Ft(e.buffer) : e.buffer;
+	return new e.constructor(n, e.byteOffset, e.byteLength);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_cloneRegExp.js
+var Lt = /\w*$/;
+function Rt(e) {
+	var t = new e.constructor(e.source, Lt.exec(e));
+	return t.lastIndex = e.lastIndex, t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_cloneSymbol.js
+var zt = Ae ? Ae.prototype : void 0, Bt = zt ? zt.valueOf : void 0;
+function Vt(e) {
+	return Bt ? Object(Bt.call(e)) : {};
+}
+//#endregion
+//#region ../node_modules/lodash-es/_cloneTypedArray.js
+function Ht(e, t) {
+	var n = t ? Ft(e.buffer) : e.buffer;
+	return new e.constructor(n, e.byteOffset, e.length);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_initCloneByTag.js
+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]";
+function ln(e, t, n) {
+	var r = e.constructor;
+	switch (t) {
+		case Zt: return Ft(e);
+		case Ut:
+		case Wt: return new r(+e);
+		case Qt: return It(e, n);
+		case $t:
+		case en:
+		case tn:
+		case nn:
+		case rn:
+		case an:
+		case on:
+		case sn:
+		case cn: return Ht(e, n);
+		case Gt: return new r();
+		case Kt:
+		case Yt: return new r(e);
+		case qt: return Rt(e);
+		case Jt: return new r();
+		case Xt: return Vt(e);
+	}
+}
+//#endregion
+//#region ../node_modules/lodash-es/_initCloneObject.js
+function un(e) {
+	return typeof e.constructor == "function" && !ce(e) ? it(ft(e)) : {};
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseIsMap.js
+var dn = "[object Map]";
+function fn(e) {
+	return k(e) && x(e) == dn;
+}
+//#endregion
+//#region ../node_modules/lodash-es/isMap.js
+var pn = v && v.isMap, mn = pn ? g(pn) : fn, hn = "[object Set]";
+function gn(e) {
+	return k(e) && x(e) == hn;
+}
+//#endregion
+//#region ../node_modules/lodash-es/isSet.js
+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 = {};
+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;
+function B(e, t, n, r, i, a) {
+	var o, s = t & yn, c = t & bn, l = t & xn;
+	if (n && (o = i ? n(e, r, i, a) : n(e)), o !== void 0) return o;
+	if (!b(e)) return e;
+	var u = y(e);
+	if (u) {
+		if (o = Pt(e), !s) return at(e, o);
+	} else {
+		var d = x(e), f = d == Dn || d == On;
+		if (te(e)) return Ot(e, s);
+		if (d == jn || d == Sn || f && !i) {
+			if (o = c || f ? {} : un(e), !s) return c ? jt(e, Ct(o, e)) : kt(e, St(o, e));
+		} else {
+			if (!z[d]) return i ? e : {};
+			o = ln(e, d, s);
+		}
+	}
+	a ||= new le();
+	var p = a.get(e);
+	if (p) return p;
+	a.set(e, o), vn(e) ? e.forEach(function(r) {
+		o.add(B(r, t, n, r, e, a));
+	}) : mn(e) && e.forEach(function(r, i) {
+		o.set(i, B(r, t, n, i, e, a));
+	});
+	var m = u ? void 0 : (l ? c ? Mt : Ne : c ? L : we)(e);
+	return ee(m || e, function(r, i) {
+		m && (i = r, r = e[i]), P(o, i, B(r, t, n, i, e, a));
+	}), o;
+}
+//#endregion
+//#region ../node_modules/lodash-es/cloneDeep.js
+var Jn = 1, Yn = 4;
+function Xn(e) {
+	return B(e, Jn | Yn);
+}
+//#endregion
+//#region ../node_modules/lodash-es/now.js
+var Zn = function() {
+	return Se.Date.now();
+}, Qn = Object.prototype, $n = Qn.hasOwnProperty, er = f(function(e, t) {
+	e = Object(e);
+	var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
+	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;) {
+		var l = o[s], u = e[l];
+		(u === void 0 || _(u, Qn[l]) && !$n.call(e, l)) && (e[l] = a[l]);
+	}
+	return e;
+});
+//#endregion
+//#region ../node_modules/lodash-es/_assignMergeValue.js
+function tr(e, t, n) {
+	(n !== void 0 && !_(e[t], n) || n === void 0 && !(t in e)) && N(e, t, n);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_safeGet.js
+function nr(e, t) {
+	if ((t !== "constructor" || typeof e[t] != "function") && t != "__proto__") return e[t];
+}
+//#endregion
+//#region ../node_modules/lodash-es/toPlainObject.js
+function rr(e) {
+	return F(e, L(e));
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseMergeDeep.js
+function ir(e, t, n, r, i, a, o) {
+	var s = nr(e, n), c = nr(t, n), l = o.get(c);
+	if (l) {
+		tr(e, n, l);
+		return;
+	}
+	var u = a ? a(s, c, n + "", e, t, o) : void 0, d = u === void 0;
+	if (d) {
+		var f = y(c), p = !f && te(c), m = !f && !p && oe(c);
+		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;
+	}
+	d && (o.set(c, u), i(u, c, r, a, o), o.delete(c)), tr(e, n, u);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseMerge.js
+function ar(e, t, n, r, i) {
+	e !== t && ve(t, function(a, o) {
+		if (i ||= new le(), b(a)) ir(e, t, o, n, ar, r, i);
+		else {
+			var s = r ? r(nr(e, o), a, o + "", e, t, i) : void 0;
+			s === void 0 && (s = a), tr(e, o, s);
+		}
+	}, L);
+}
+//#endregion
+//#region ../node_modules/lodash-es/last.js
+function V(e) {
+	var t = e == null ? 0 : e.length;
+	return t ? e[t - 1] : void 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_createFind.js
+function or(e) {
+	return function(t, n, r) {
+		var i = Object(t);
+		if (!A(t)) {
+			var a = C(n, 3);
+			t = we(t), n = function(e) {
+				return a(i[e], e, i);
+			};
+		}
+		var o = e(t, n, r);
+		return o > -1 ? i[a ? t[o] : o] : void 0;
+	};
+}
+//#endregion
+//#region ../node_modules/lodash-es/findIndex.js
+var sr = Math.max;
+function cr(e, t, n) {
+	var r = e == null ? 0 : e.length;
+	if (!r) return -1;
+	var i = n == null ? 0 : nt(n);
+	return i < 0 && (i = sr(r + i, 0)), pe(e, C(t, 3), i);
+}
+//#endregion
+//#region ../node_modules/lodash-es/find.js
+var lr = or(cr);
+//#endregion
+//#region ../node_modules/lodash-es/_baseMap.js
+function ur(e, t) {
+	var n = -1, r = A(e) ? Array(e.length) : [];
+	return Te(e, function(e, i, a) {
+		r[++n] = t(e, i, a);
+	}), r;
+}
+//#endregion
+//#region ../node_modules/lodash-es/map.js
+function H(e, t) {
+	return (y(e) ? u : ur)(e, C(t, 3));
+}
+//#endregion
+//#region ../node_modules/lodash-es/forIn.js
+function dr(e, t) {
+	return e == null ? e : ve(e, je(t), L);
+}
+//#endregion
+//#region ../node_modules/lodash-es/forOwn.js
+function fr(e, t) {
+	return e && Me(e, je(t));
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseGt.js
+function pr(e, t) {
+	return e > t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseHas.js
+var mr = Object.prototype.hasOwnProperty;
+function hr(e, t) {
+	return e != null && mr.call(e, t);
+}
+//#endregion
+//#region ../node_modules/lodash-es/has.js
+function gr(e, t) {
+	return e != null && xe(e, t, hr);
+}
+//#endregion
+//#region ../node_modules/lodash-es/isString.js
+var _r = "[object String]";
+function vr(e) {
+	return typeof e == "string" || !y(e) && k(e) && De(e) == _r;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseLt.js
+function yr(e, t) {
+	return e < t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/mapValues.js
+function U(e, t) {
+	var n = {};
+	return t = C(t, 3), Me(e, function(e, r, i) {
+		N(n, r, t(e, r, i));
+	}), n;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseExtremum.js
+function br(e, t, n) {
+	for (var r = -1, i = e.length; ++r < i;) {
+		var a = e[r], o = t(a);
+		if (o != null && (s === void 0 ? o === o && !ye(o) : n(o, s))) var s = o, c = a;
+	}
+	return c;
+}
+//#endregion
+//#region ../node_modules/lodash-es/max.js
+function W(e) {
+	return e && e.length ? br(e, me, pr) : void 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/merge.js
+var xr = st(function(e, t, n) {
+	ar(e, t, n);
+});
+//#endregion
+//#region ../node_modules/lodash-es/min.js
+function G(e) {
+	return e && e.length ? br(e, me, yr) : void 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/minBy.js
+function Sr(e, t) {
+	return e && e.length ? br(e, C(t, 2), yr) : void 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseSet.js
+function Cr(e, t, n, r) {
+	if (!b(e)) return e;
+	t = m(t, e);
+	for (var i = -1, a = t.length, o = a - 1, s = e; s != null && ++i < a;) {
+		var c = h(t[i]), l = n;
+		if (c === "__proto__" || c === "constructor" || c === "prototype") return e;
+		if (i != o) {
+			var u = s[c];
+			l = r ? r(u, c, s) : void 0, l === void 0 && (l = b(u) ? u : de(t[i + 1]) ? [] : {});
+		}
+		P(s, c, l), s = s[c];
+	}
+	return e;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_basePickBy.js
+function wr(e, t, n) {
+	for (var r = -1, i = t.length, a = {}; ++r < i;) {
+		var o = t[r], s = ue(e, o);
+		n(s, o) && Cr(a, m(o, e), s);
+	}
+	return a;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseSortBy.js
+function Tr(e, t) {
+	var n = e.length;
+	for (e.sort(t); n--;) e[n] = e[n].value;
+	return e;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_compareAscending.js
+function Er(e, t) {
+	if (e !== t) {
+		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);
+		if (!s && !l && !a && e > t || a && o && c && !s && !l || r && o && c || !n && c || !i) return 1;
+		if (!r && !a && !l && e < t || l && n && i && !r && !a || s && n && i || !o && i || !c) return -1;
+	}
+	return 0;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_compareMultiple.js
+function Dr(e, t, n) {
+	for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
+		var c = Er(i[r], a[r]);
+		if (c) return r >= s ? c : c * (n[r] == "desc" ? -1 : 1);
+	}
+	return e.index - t.index;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseOrderBy.js
+function Or(e, t, n) {
+	t = t.length ? u(t, function(e) {
+		return y(e) ? function(t) {
+			return ue(t, e.length === 1 ? e[0] : e);
+		} : e;
+	}) : [me];
+	var r = -1;
+	return t = u(t, g(C)), Tr(ur(e, function(e, n, i) {
+		return {
+			criteria: u(t, function(t) {
+				return t(e);
+			}),
+			index: ++r,
+			value: e
+		};
+	}), function(e, t) {
+		return Dr(e, t, n);
+	});
+}
+//#endregion
+//#region ../node_modules/lodash-es/_asciiSize.js
+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 + "(?:" + [
+	Lr,
+	Rr,
+	zr
+].join("|") + ")" + Hr + Vr + ")*", Wr = Hr + Vr + Ur, Gr = "(?:" + [
+	Lr + Pr + "?",
+	Pr,
+	Rr,
+	zr,
+	Nr
+].join("|") + ")", Kr = RegExp(Fr + "(?=" + Fr + ")|" + Gr + Wr, "g");
+function qr(e) {
+	for (var t = Kr.lastIndex = 0; Kr.test(e);) ++t;
+	return t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_stringSize.js
+function Jr(e) {
+	return xt(e) ? qr(e) : kr(e);
+}
+//#endregion
+//#region ../node_modules/lodash-es/_basePick.js
+function Yr(e, t) {
+	return wr(e, t, function(t, n) {
+		return Ee(e, n);
+	});
+}
+//#endregion
+//#region ../node_modules/lodash-es/pick.js
+var K = dt(function(e, t) {
+	return e == null ? {} : Yr(e, t);
+}), Xr = Math.ceil, Zr = Math.max;
+function Qr(e, t, n, r) {
+	for (var i = -1, a = Zr(Xr((t - e) / (n || 1)), 0), o = Array(a); a--;) o[r ? a : ++i] = e, e += n;
+	return o;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_createRange.js
+function $r(e) {
+	return function(t, n, r) {
+		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);
+	};
+}
+//#endregion
+//#region ../node_modules/lodash-es/range.js
+var q = $r(), ei = "[object Map]", ti = "[object Set]";
+function ni(e) {
+	if (e == null) return 0;
+	if (A(e)) return vr(e) ? Jr(e) : e.length;
+	var t = x(e);
+	return t == ei || t == ti ? e.size : d(e).length;
+}
+//#endregion
+//#region ../node_modules/lodash-es/sortBy.js
+var J = f(function(e, t) {
+	if (e == null) return [];
+	var n = t.length;
+	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), []);
+}), ri = 0;
+function ii(e) {
+	var t = ++ri;
+	return se(e) + t;
+}
+//#endregion
+//#region ../node_modules/lodash-es/_baseZipObject.js
+function ai(e, t, n) {
+	for (var r = -1, i = e.length, a = t.length, o = {}; ++r < i;) {
+		var s = r < a ? t[r] : void 0;
+		n(o, e[r], s);
+	}
+	return o;
+}
+//#endregion
+//#region ../node_modules/lodash-es/zipObject.js
+function oi(e, t) {
+	return ai(e || [], t || [], P);
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/data/list.js
+var si = class {
+	constructor() {
+		var e = {};
+		e._next = e._prev = e, this._sentinel = e;
+	}
+	dequeue() {
+		var e = this._sentinel, t = e._prev;
+		if (t !== e) return ci(t), t;
+	}
+	enqueue(e) {
+		var t = this._sentinel;
+		e._prev && e._next && ci(e), e._next = t._next, t._next._prev = e, t._next = e, e._prev = t;
+	}
+	toString() {
+		for (var e = [], t = this._sentinel, n = t._prev; n !== t;) e.push(JSON.stringify(n, li)), n = n._prev;
+		return "[" + e.join(", ") + "]";
+	}
+};
+function ci(e) {
+	e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function li(e, t) {
+	if (e !== "_next" && e !== "_prev") return t;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/greedy-fas.js
+var ui = ne(1);
+function di(e, t) {
+	if (e.nodeCount() <= 1) return [];
+	var n = mi(e, t || ui);
+	return R(H(fi(n.graph, n.buckets, n.zeroIdx), function(t) {
+		return e.outEdges(t.v, t.w);
+	}));
+}
+function fi(e, t, n) {
+	for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
+		for (; o = a.dequeue();) pi(e, t, n, o);
+		for (; o = i.dequeue();) pi(e, t, n, o);
+		if (e.nodeCount()) {
+			for (var s = t.length - 2; s > 0; --s) if (o = t[s].dequeue(), o) {
+				r = r.concat(pi(e, t, n, o, !0));
+				break;
+			}
+		}
+	}
+	return r;
+}
+function pi(e, t, n, r, i) {
+	var a = i ? [] : void 0;
+	return E(e.inEdges(r.v), function(r) {
+		var o = e.edge(r), s = e.node(r.v);
+		i && a.push({
+			v: r.v,
+			w: r.w
+		}), s.out -= o, hi(t, n, s);
+	}), E(e.outEdges(r.v), function(r) {
+		var i = e.edge(r), a = r.w, o = e.node(a);
+		o.in -= i, hi(t, n, o);
+	}), e.removeNode(r.v), a;
+}
+function mi(e, t) {
+	var n = new O(), r = 0, i = 0;
+	E(e.nodes(), function(e) {
+		n.setNode(e, {
+			v: e,
+			in: 0,
+			out: 0
+		});
+	}), E(e.edges(), function(e) {
+		var a = n.edge(e.v, e.w) || 0, o = t(e), s = a + o;
+		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);
+	});
+	var a = q(i + r + 3).map(function() {
+		return new si();
+	}), o = r + 1;
+	return E(n.nodes(), function(e) {
+		hi(a, o, n.node(e));
+	}), {
+		graph: n,
+		buckets: a,
+		zeroIdx: o
+	};
+}
+function hi(e, t, n) {
+	n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/acyclic.js
+function gi(e) {
+	var t = e.graph().acyclicer === "greedy" ? di(e, n(e)) : _i(e);
+	E(t, function(t) {
+		var n = e.edge(t);
+		e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, ii("rev"));
+	});
+	function n(e) {
+		return function(t) {
+			return e.edge(t).weight;
+		};
+	}
+}
+function _i(e) {
+	var t = [], n = {}, r = {};
+	function i(a) {
+		Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, E(e.outEdges(a), function(e) {
+			Object.prototype.hasOwnProperty.call(n, e.w) ? t.push(e) : i(e.w);
+		}), delete n[a]);
+	}
+	return E(e.nodes(), i), t;
+}
+function vi(e) {
+	E(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (n.reversed) {
+			e.removeEdge(t);
+			var r = n.forwardName;
+			delete n.reversed, delete n.forwardName, e.setEdge(t.w, t.v, n, r);
+		}
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/util.js
+function Y(e, t, n, r) {
+	var i;
+	do
+		i = ii(r);
+	while (e.hasNode(i));
+	return n.dummy = t, e.setNode(i, n), i;
+}
+function yi(e) {
+	var t = new O().setGraph(e.graph());
+	return E(e.nodes(), function(n) {
+		t.setNode(n, e.node(n));
+	}), E(e.edges(), function(n) {
+		var r = t.edge(n.v, n.w) || {
+			weight: 0,
+			minlen: 1
+		}, i = e.edge(n);
+		t.setEdge(n.v, n.w, {
+			weight: r.weight + i.weight,
+			minlen: Math.max(r.minlen, i.minlen)
+		});
+	}), t;
+}
+function bi(e) {
+	var t = new O({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+	return E(e.nodes(), function(n) {
+		e.children(n).length || t.setNode(n, e.node(n));
+	}), E(e.edges(), function(n) {
+		t.setEdge(n, e.edge(n));
+	}), t;
+}
+function xi(e, t) {
+	var n = e.x, r = e.y, i = t.x - n, a = t.y - r, o = e.width / 2, s = e.height / 2;
+	if (!i && !a) throw Error("Not possible to find intersection inside of the rectangle");
+	var c, l;
+	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), {
+		x: n + c,
+		y: r + l
+	};
+}
+function X(e) {
+	var t = H(q(Ti(e) + 1), function() {
+		return [];
+	});
+	return E(e.nodes(), function(n) {
+		var r = e.node(n), i = r.rank;
+		D(i) || (t[i][r.order] = n);
+	}), t;
+}
+function Si(e) {
+	var t = G(H(e.nodes(), function(t) {
+		return e.node(t).rank;
+	}));
+	E(e.nodes(), function(n) {
+		var r = e.node(n);
+		gr(r, "rank") && (r.rank -= t);
+	});
+}
+function Ci(e) {
+	var t = G(H(e.nodes(), function(t) {
+		return e.node(t).rank;
+	})), n = [];
+	E(e.nodes(), function(r) {
+		var i = e.node(r).rank - t;
+		n[i] || (n[i] = []), n[i].push(r);
+	});
+	var r = 0, i = e.graph().nodeRankFactor;
+	E(n, function(t, n) {
+		D(t) && n % i !== 0 ? --r : r && E(t, function(t) {
+			e.node(t).rank += r;
+		});
+	});
+}
+function wi(e, t, n, r) {
+	var i = {
+		width: 0,
+		height: 0
+	};
+	return arguments.length >= 4 && (i.rank = n, i.order = r), Y(e, "border", i, t);
+}
+function Ti(e) {
+	return W(H(e.nodes(), function(t) {
+		var n = e.node(t).rank;
+		if (!D(n)) return n;
+	}));
+}
+function Ei(e, t) {
+	var n = {
+		lhs: [],
+		rhs: []
+	};
+	return E(e, function(e) {
+		t(e) ? n.lhs.push(e) : n.rhs.push(e);
+	}), n;
+}
+function Di(e, t) {
+	var n = Zn();
+	try {
+		return t();
+	} finally {
+		console.log(e + " time: " + (Zn() - n) + "ms");
+	}
+}
+function Oi(e, t) {
+	return t();
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/add-border-segments.js
+function ki(e) {
+	function t(n) {
+		var r = e.children(n), i = e.node(n);
+		if (r.length && E(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
+			i.borderLeft = [], i.borderRight = [];
+			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);
+		}
+	}
+	E(e.children(), t);
+}
+function Ai(e, t, n, r, i, a) {
+	var o = {
+		width: 0,
+		height: 0,
+		rank: a,
+		borderType: t
+	}, s = i[t][a - 1], c = Y(e, "border", o, n);
+	i[t][a] = c, e.setParent(c, r), s && e.setEdge(s, c, { weight: 1 });
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/coordinate-system.js
+function ji(e) {
+	var t = e.graph().rankdir.toLowerCase();
+	(t === "lr" || t === "rl") && Ni(e);
+}
+function Mi(e) {
+	var t = e.graph().rankdir.toLowerCase();
+	(t === "bt" || t === "rl") && Fi(e), (t === "lr" || t === "rl") && (Li(e), Ni(e));
+}
+function Ni(e) {
+	E(e.nodes(), function(t) {
+		Pi(e.node(t));
+	}), E(e.edges(), function(t) {
+		Pi(e.edge(t));
+	});
+}
+function Pi(e) {
+	var t = e.width;
+	e.width = e.height, e.height = t;
+}
+function Fi(e) {
+	E(e.nodes(), function(t) {
+		Ii(e.node(t));
+	}), E(e.edges(), function(t) {
+		var n = e.edge(t);
+		E(n.points, Ii), Object.prototype.hasOwnProperty.call(n, "y") && Ii(n);
+	});
+}
+function Ii(e) {
+	e.y = -e.y;
+}
+function Li(e) {
+	E(e.nodes(), function(t) {
+		Ri(e.node(t));
+	}), E(e.edges(), function(t) {
+		var n = e.edge(t);
+		E(n.points, Ri), Object.prototype.hasOwnProperty.call(n, "x") && Ri(n);
+	});
+}
+function Ri(e) {
+	var t = e.x;
+	e.x = e.y, e.y = t;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/normalize.js
+function zi(e) {
+	e.graph().dummyChains = [], E(e.edges(), function(t) {
+		Bi(e, t);
+	});
+}
+function Bi(e, t) {
+	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;
+	if (a !== r + 1) {
+		e.removeEdge(t);
+		var l = void 0, u, d;
+		for (d = 0, ++r; r < a; ++d, ++r) s.points = [], l = {
+			width: 0,
+			height: 0,
+			edgeLabel: s,
+			edgeObj: t,
+			rank: r
+		}, 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;
+		e.setEdge(n, i, { weight: s.weight }, o);
+	}
+}
+function Vi(e) {
+	E(e.graph().dummyChains, function(t) {
+		var n = e.node(t), r = n.edgeLabel, i;
+		for (e.setEdge(n.edgeObj, r); n.dummy;) i = e.successors(t)[0], e.removeNode(t), r.points.push({
+			x: n.x,
+			y: n.y
+		}), 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);
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/rank/util.js
+function Hi(e) {
+	var t = {};
+	function n(r) {
+		var i = e.node(r);
+		if (Object.prototype.hasOwnProperty.call(t, r)) return i.rank;
+		t[r] = !0;
+		var a = G(H(e.outEdges(r), function(t) {
+			return n(t.w) - e.edge(t).minlen;
+		}));
+		return (a === Infinity || a == null) && (a = 0), i.rank = a;
+	}
+	E(e.sources(), n);
+}
+function Z(e, t) {
+	return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js
+function Ui(e) {
+	var t = new O({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
+	t.setNode(n, {});
+	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);
+	return t;
+}
+function Wi(e, t) {
+	function n(r) {
+		E(t.nodeEdges(r), function(i) {
+			var a = i.v, o = r === a ? i.w : a;
+			!e.hasNode(o) && !Z(t, i) && (e.setNode(o, {}), e.setEdge(r, o, {}), n(o));
+		});
+	}
+	return E(e.nodes(), n), e.nodeCount();
+}
+function Gi(e, t) {
+	return Sr(t.edges(), function(n) {
+		if (e.hasNode(n.v) !== e.hasNode(n.w)) return Z(t, n);
+	});
+}
+function Ki(e, t, n) {
+	E(e.nodes(), function(e) {
+		t.node(e).rank += n;
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
+ne(1), ne(1), qi.CycleException = Q;
+function qi(e) {
+	var t = {}, n = {}, r = [];
+	function i(a) {
+		if (Object.prototype.hasOwnProperty.call(n, a)) throw new Q();
+		Object.prototype.hasOwnProperty.call(t, a) || (n[a] = !0, t[a] = !0, E(e.predecessors(a), i), delete n[a], r.push(a));
+	}
+	if (E(e.sinks(), i), ni(t) !== e.nodeCount()) throw new Q();
+	return r;
+}
+function Q() {}
+Q.prototype = /* @__PURE__ */ Error();
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
+function Ji(e, t, n) {
+	y(t) || (t = [t]);
+	var r = (e.isDirected() ? e.successors : e.neighbors).bind(e), i = [], a = {};
+	return E(t, function(t) {
+		if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
+		Yi(e, t, n === "post", a, r, i);
+	}), i;
+}
+function Yi(e, t, n, r, i, a) {
+	Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), E(i(t), function(t) {
+		Yi(e, t, n, r, i, a);
+	}), n && a.push(t));
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
+function Xi(e, t) {
+	return Ji(e, t, "post");
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
+function Zi(e, t) {
+	return Ji(e, t, "pre");
+}
+$.initLowLimValues = ta, $.initCutValues = Qi, $.calcCutValue = ea, $.leaveEdge = ra, $.enterEdge = ia, $.exchangeEdges = aa;
+function $(e) {
+	e = yi(e), Hi(e);
+	var t = Ui(e);
+	ta(t), Qi(t, e);
+	for (var n, r; n = ra(t);) r = ia(t, e, n), aa(t, e, n, r);
+}
+function Qi(e, t) {
+	var n = Xi(e, e.nodes());
+	n = n.slice(0, n.length - 1), E(n, function(n) {
+		$i(e, t, n);
+	});
+}
+function $i(e, t, n) {
+	var r = e.node(n).parent;
+	e.edge(n, r).cutvalue = ea(e, t, n);
+}
+function ea(e, t, n) {
+	var r = e.node(n).parent, i = !0, a = t.edge(n, r), o = 0;
+	return a ||= (i = !1, t.edge(r, n)), o = a.weight, E(t.nodeEdges(n), function(a) {
+		var s = a.v === n, c = s ? a.w : a.v;
+		if (c !== r) {
+			var l = s === i, u = t.edge(a).weight;
+			if (o += l ? u : -u, sa(e, n, c)) {
+				var d = e.edge(n, c).cutvalue;
+				o += l ? -d : d;
+			}
+		}
+	}), o;
+}
+function ta(e, t) {
+	arguments.length < 2 && (t = e.nodes()[0]), na(e, {}, 1, t);
+}
+function na(e, t, n, r, i) {
+	var a = n, o = e.node(r);
+	return t[r] = !0, E(e.neighbors(r), function(i) {
+		Object.prototype.hasOwnProperty.call(t, i) || (n = na(e, t, n, i, r));
+	}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
+}
+function ra(e) {
+	return lr(e.edges(), function(t) {
+		return e.edge(t).cutvalue < 0;
+	});
+}
+function ia(e, t, n) {
+	var r = n.v, i = n.w;
+	t.hasEdge(r, i) || (r = n.w, i = n.v);
+	var a = e.node(r), o = e.node(i), s = a, c = !1;
+	return a.lim > o.lim && (s = o, c = !0), Sr(S(t.edges(), function(t) {
+		return c === ca(e, e.node(t.v), s) && c !== ca(e, e.node(t.w), s);
+	}), function(e) {
+		return Z(t, e);
+	});
+}
+function aa(e, t, n, r) {
+	var i = n.v, a = n.w;
+	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), ta(e), Qi(e, t), oa(e, t);
+}
+function oa(e, t) {
+	var n = Zi(e, lr(e.nodes(), function(e) {
+		return !t.node(e).parent;
+	}));
+	n = n.slice(1), E(n, function(n) {
+		var r = e.node(n).parent, i = t.edge(n, r), a = !1;
+		i || (i = t.edge(r, n), a = !0), t.node(n).rank = t.node(r).rank + (a ? i.minlen : -i.minlen);
+	});
+}
+function sa(e, t, n) {
+	return e.hasEdge(t, n);
+}
+function ca(e, t, n) {
+	return n.low <= t.lim && t.lim <= n.lim;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/rank/index.js
+function la(e) {
+	switch (e.graph().ranker) {
+		case "network-simplex":
+			fa(e);
+			break;
+		case "tight-tree":
+			da(e);
+			break;
+		case "longest-path":
+			ua(e);
+			break;
+		default: fa(e);
+	}
+}
+var ua = Hi;
+function da(e) {
+	Hi(e), Ui(e);
+}
+function fa(e) {
+	$(e);
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/nesting-graph.js
+function pa(e) {
+	var t = Y(e, "root", {}, "_root"), n = ha(e), r = W(w(n)) - 1, i = 2 * r + 1;
+	e.graph().nestingRoot = t, E(e.edges(), function(t) {
+		e.edge(t).minlen *= i;
+	});
+	var a = ga(e) + 1;
+	E(e.children(), function(o) {
+		ma(e, t, i, a, r, n, o);
+	}), e.graph().nodeRankFactor = i;
+}
+function ma(e, t, n, r, i, a, o) {
+	var s = e.children(o);
+	if (!s.length) {
+		o !== t && e.setEdge(t, o, {
+			weight: 0,
+			minlen: n
+		});
+		return;
+	}
+	var c = wi(e, "_bt"), l = wi(e, "_bb"), u = e.node(o);
+	e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, E(s, function(s) {
+		ma(e, t, n, r, i, a, s);
+		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;
+		e.setEdge(c, d, {
+			weight: p,
+			minlen: m,
+			nestingEdge: !0
+		}), e.setEdge(f, l, {
+			weight: p,
+			minlen: m,
+			nestingEdge: !0
+		});
+	}), e.parent(o) || e.setEdge(t, c, {
+		weight: 0,
+		minlen: i + a[o]
+	});
+}
+function ha(e) {
+	var t = {};
+	function n(r, i) {
+		var a = e.children(r);
+		a && a.length && E(a, function(e) {
+			n(e, i + 1);
+		}), t[r] = i;
+	}
+	return E(e.children(), function(e) {
+		n(e, 1);
+	}), t;
+}
+function ga(e) {
+	return T(e.edges(), function(t, n) {
+		return t + e.edge(n).weight;
+	}, 0);
+}
+function _a(e) {
+	var t = e.graph();
+	e.removeNode(t.nestingRoot), delete t.nestingRoot, E(e.edges(), function(t) {
+		e.edge(t).nestingEdge && e.removeEdge(t);
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
+function va(e, t, n) {
+	var r = {}, i;
+	E(n, function(n) {
+		for (var a = e.parent(n), o, s; a;) {
+			if (o = e.parent(a), o ? (s = r[o], r[o] = a) : (s = i, i = a), s && s !== a) {
+				t.setEdge(s, a);
+				return;
+			}
+			a = o;
+		}
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
+function ya(e, t, n) {
+	var r = ba(e), i = new O({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
+		return e.node(t);
+	});
+	return E(e.nodes(), function(a) {
+		var o = e.node(a), s = e.parent(a);
+		(o.rank === t || o.minRank <= t && t <= o.maxRank) && (i.setNode(a), i.setParent(a, s || r), E(e[n](a), function(t) {
+			var n = t.v === a ? t.w : t.v, r = i.edge(n, a), o = D(r) ? 0 : r.weight;
+			i.setEdge(n, a, { weight: e.edge(t).weight + o });
+		}), Object.prototype.hasOwnProperty.call(o, "minRank") && i.setNode(a, {
+			borderLeft: o.borderLeft[t],
+			borderRight: o.borderRight[t]
+		}));
+	}), i;
+}
+function ba(e) {
+	for (var t; e.hasNode(t = ii("_root")););
+	return t;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/cross-count.js
+function xa(e, t) {
+	for (var n = 0, r = 1; r < t.length; ++r) n += Sa(e, t[r - 1], t[r]);
+	return n;
+}
+function Sa(e, t, n) {
+	for (var r = oi(n, H(n, function(e, t) {
+		return t;
+	})), i = R(H(t, function(t) {
+		return J(H(e.outEdges(t), function(t) {
+			return {
+				pos: r[t.w],
+				weight: e.edge(t).weight
+			};
+		}), "pos");
+	})), a = 1; a < n.length;) a <<= 1;
+	var o = 2 * a - 1;
+	--a;
+	var s = H(Array(o), function() {
+		return 0;
+	}), c = 0;
+	return E(i.forEach(function(e) {
+		var t = e.pos + a;
+		s[t] += e.weight;
+		for (var n = 0; t > 0;) t % 2 && (n += s[t + 1]), t = t - 1 >> 1, s[t] += e.weight;
+		c += e.weight * n;
+	})), c;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/init-order.js
+function Ca(e) {
+	var t = {}, n = S(e.nodes(), function(t) {
+		return !e.children(t).length;
+	}), r = H(q(W(H(n, function(t) {
+		return e.node(t).rank;
+	})) + 1), function() {
+		return [];
+	});
+	function i(n) {
+		gr(t, n) || (t[n] = !0, r[e.node(n).rank].push(n), E(e.successors(n), i));
+	}
+	var a = J(n, function(t) {
+		return e.node(t).rank;
+	});
+	return E(a, i), r;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/barycenter.js
+function wa(e, t) {
+	return H(t, function(t) {
+		var n = e.inEdges(t);
+		if (n.length) {
+			var r = T(n, function(t, n) {
+				var r = e.edge(n), i = e.node(n.v);
+				return {
+					sum: t.sum + r.weight * i.order,
+					weight: t.weight + r.weight
+				};
+			}, {
+				sum: 0,
+				weight: 0
+			});
+			return {
+				v: t,
+				barycenter: r.sum / r.weight,
+				weight: r.weight
+			};
+		}
+		return { v: t };
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
+function Ta(e, t) {
+	var n = {};
+	return E(e, function(e, t) {
+		var r = n[e.v] = {
+			indegree: 0,
+			in: [],
+			out: [],
+			vs: [e.v],
+			i: t
+		};
+		D(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
+	}), E(t.edges(), function(e) {
+		var t = n[e.v], r = n[e.w];
+		!D(t) && !D(r) && (r.indegree++, t.out.push(n[e.w]));
+	}), Ea(S(n, function(e) {
+		return !e.indegree;
+	}));
+}
+function Ea(e) {
+	var t = [];
+	function n(e) {
+		return function(t) {
+			t.merged || (D(t.barycenter) || D(e.barycenter) || t.barycenter >= e.barycenter) && Da(e, t);
+		};
+	}
+	function r(t) {
+		return function(n) {
+			n.in.push(t), --n.indegree === 0 && e.push(n);
+		};
+	}
+	for (; e.length;) {
+		var i = e.pop();
+		t.push(i), E(i.in.reverse(), n(i)), E(i.out, r(i));
+	}
+	return H(S(t, function(e) {
+		return !e.merged;
+	}), function(e) {
+		return K(e, [
+			"vs",
+			"i",
+			"barycenter",
+			"weight"
+		]);
+	});
+}
+function Da(e, t) {
+	var n = 0, r = 0;
+	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;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/sort.js
+function Oa(e, t) {
+	var n = Ei(e, function(e) {
+		return Object.prototype.hasOwnProperty.call(e, "barycenter");
+	}), r = n.lhs, i = J(n.rhs, function(e) {
+		return -e.i;
+	}), a = [], o = 0, s = 0, c = 0;
+	r.sort(Aa(!!t)), c = ka(a, i, c), E(r, function(e) {
+		c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = ka(a, i, c);
+	});
+	var l = { vs: R(a) };
+	return s && (l.barycenter = o / s, l.weight = s), l;
+}
+function ka(e, t, n) {
+	for (var r; t.length && (r = V(t)).i <= n;) t.pop(), e.push(r.vs), n++;
+	return n;
+}
+function Aa(e) {
+	return function(t, n) {
+		return t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
+	};
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
+function ja(e, t, n, r) {
+	var i = e.children(t), a = e.node(t), o = a ? a.borderLeft : void 0, s = a ? a.borderRight : void 0, c = {};
+	o && (i = S(i, function(e) {
+		return e !== o && e !== s;
+	}));
+	var l = wa(e, i);
+	E(l, function(t) {
+		if (e.children(t.v).length) {
+			var i = ja(e, t.v, n, r);
+			c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && Na(t, i);
+		}
+	});
+	var u = Ta(l, n);
+	Ma(u, c);
+	var d = Oa(u, r);
+	if (o && (d.vs = R([
+		o,
+		d.vs,
+		s
+	]), e.predecessors(o).length)) {
+		var f = e.node(e.predecessors(o)[0]), p = e.node(e.predecessors(s)[0]);
+		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;
+	}
+	return d;
+}
+function Ma(e, t) {
+	E(e, function(e) {
+		e.vs = R(e.vs.map(function(e) {
+			return t[e] ? t[e].vs : e;
+		}));
+	});
+}
+function Na(e, t) {
+	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);
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/order/index.js
+function Pa(e) {
+	var t = Ti(e), n = Fa(e, q(1, t + 1), "inEdges"), r = Fa(e, q(t - 1, -1, -1), "outEdges"), i = Ca(e);
+	La(e, i);
+	for (var a = Infinity, o, s = 0, c = 0; c < 4; ++s, ++c) {
+		Ia(s % 2 ? n : r, s % 4 >= 2), i = X(e);
+		var l = xa(e, i);
+		l < a && (c = 0, o = Xn(i), a = l);
+	}
+	La(e, o);
+}
+function Fa(e, t, n) {
+	return H(t, function(t) {
+		return ya(e, t, n);
+	});
+}
+function Ia(e, t) {
+	var n = new O();
+	E(e, function(e) {
+		var r = e.graph().root, i = ja(e, r, n, t);
+		E(i.vs, function(t, n) {
+			e.node(t).order = n;
+		}), va(e, n, i.vs);
+	});
+}
+function La(e, t) {
+	E(t, function(t) {
+		E(t, function(t, n) {
+			e.node(t).order = n;
+		});
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
+function Ra(e) {
+	var t = Ba(e);
+	E(e.graph().dummyChains, function(n) {
+		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;) {
+			if (r = e.node(n), u) {
+				for (; (l = o[c]) !== s && e.node(l).maxRank < r.rank;) c++;
+				l === s && (u = !1);
+			}
+			if (!u) {
+				for (; c < o.length - 1 && e.node(l = o[c + 1]).minRank <= r.rank;) c++;
+				l = o[c];
+			}
+			e.setParent(n, l), n = e.successors(n)[0];
+		}
+	});
+}
+function za(e, t, n, r) {
+	var i = [], a = [], o = Math.min(t[n].low, t[r].low), s = Math.max(t[n].lim, t[r].lim), c = n, l;
+	do
+		c = e.parent(c), i.push(c);
+	while (c && (t[c].low > o || s > t[c].lim));
+	for (l = c, c = r; (c = e.parent(c)) !== l;) a.push(c);
+	return {
+		path: i.concat(a.reverse()),
+		lca: l
+	};
+}
+function Ba(e) {
+	var t = {}, n = 0;
+	function r(i) {
+		var a = n;
+		E(e.children(i), r), t[i] = {
+			low: a,
+			lim: n++
+		};
+	}
+	return E(e.children(), r), t;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/position/bk.js
+function Va(e, t) {
+	var n = {};
+	function r(t, r) {
+		var i = 0, a = 0, o = t.length, s = V(r);
+		return E(r, function(t, c) {
+			var l = Ua(e, t), u = l ? e.node(l).order : o;
+			(l || t === s) && (E(r.slice(a, c + 1), function(t) {
+				E(e.predecessors(t), function(r) {
+					var a = e.node(r), o = a.order;
+					(o < i || u < o) && !(a.dummy && e.node(t).dummy) && Wa(n, r, t);
+				});
+			}), a = c + 1, i = u);
+		}), r;
+	}
+	return T(t, r), n;
+}
+function Ha(e, t) {
+	var n = {};
+	function r(t, r, i, a, o) {
+		var s;
+		E(q(r, i), function(r) {
+			s = t[r], e.node(s).dummy && E(e.predecessors(s), function(t) {
+				var r = e.node(t);
+				r.dummy && (r.order < a || r.order > o) && Wa(n, t, s);
+			});
+		});
+	}
+	function i(t, n) {
+		var i = -1, a, o = 0;
+		return E(n, function(s, c) {
+			if (e.node(s).dummy === "border") {
+				var l = e.predecessors(s);
+				l.length && (a = e.node(l[0]).order, r(n, o, c, i, a), o = c, i = a);
+			}
+			r(n, o, n.length, a, t.length);
+		}), n;
+	}
+	return T(t, i), n;
+}
+function Ua(e, t) {
+	if (e.node(t).dummy) return lr(e.predecessors(t), function(t) {
+		return e.node(t).dummy;
+	});
+}
+function Wa(e, t, n) {
+	if (t > n) {
+		var r = t;
+		t = n, n = r;
+	}
+	Object.prototype.hasOwnProperty.call(e, t) || Object.defineProperty(e, t, {
+		enumerable: !0,
+		configurable: !0,
+		value: {},
+		writable: !0
+	});
+	var i = e[t];
+	Object.defineProperty(i, n, {
+		enumerable: !0,
+		configurable: !0,
+		value: !0,
+		writable: !0
+	});
+}
+function Ga(e, t, n) {
+	if (t > n) {
+		var r = t;
+		t = n, n = r;
+	}
+	return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
+}
+function Ka(e, t, n, r) {
+	var i = {}, a = {}, o = {};
+	return E(t, function(e) {
+		E(e, function(e, t) {
+			i[e] = e, a[e] = e, o[e] = t;
+		});
+	}), E(t, function(e) {
+		var t = -1;
+		E(e, function(e) {
+			var s = r(e);
+			if (s.length) {
+				s = J(s, function(e) {
+					return o[e];
+				});
+				for (var c = (s.length - 1) / 2, l = Math.floor(c), u = Math.ceil(c); l <= u; ++l) {
+					var d = s[l];
+					a[e] === e && t < o[d] && !Ga(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
+				}
+			}
+		});
+	}), {
+		root: i,
+		align: a
+	};
+}
+function qa(e, t, n, r, i) {
+	var a = {}, o = Ja(e, t, n, i), s = i ? "borderLeft" : "borderRight";
+	function c(e, t) {
+		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();
+	}
+	function l(e) {
+		a[e] = o.inEdges(e).reduce(function(e, t) {
+			return Math.max(e, a[t.v] + o.edge(t));
+		}, 0);
+	}
+	function u(t) {
+		var n = o.outEdges(t).reduce(function(e, t) {
+			return Math.min(e, a[t.w] - o.edge(t));
+		}, Infinity), r = e.node(t);
+		n !== Infinity && r.borderType !== s && (a[t] = Math.max(a[t], n));
+	}
+	return c(l, o.predecessors.bind(o)), c(u, o.successors.bind(o)), E(r, function(e) {
+		a[e] = a[n[e]];
+	}), a;
+}
+function Ja(e, t, n, r) {
+	var i = new O(), a = e.graph(), o = $a(a.nodesep, a.edgesep, r);
+	return E(t, function(t) {
+		var r;
+		E(t, function(t) {
+			var a = n[t];
+			if (i.setNode(a), r) {
+				var s = n[r], c = i.edge(s, a);
+				i.setEdge(s, a, Math.max(o(e, t, r), c || 0));
+			}
+			r = t;
+		});
+	}), i;
+}
+function Ya(e, t) {
+	return Sr(w(t), function(t) {
+		var n = -Infinity, r = Infinity;
+		return dr(t, function(t, i) {
+			var a = eo(e, i) / 2;
+			n = Math.max(t + a, n), r = Math.min(t - a, r);
+		}), n - r;
+	});
+}
+function Xa(e, t) {
+	var n = w(t), r = G(n), i = W(n);
+	E(["u", "d"], function(n) {
+		E(["l", "r"], function(a) {
+			var o = n + a, s = e[o], c;
+			if (s !== t) {
+				var l = w(s);
+				c = a === "l" ? r - G(l) : i - W(l), c && (e[o] = U(s, function(e) {
+					return e + c;
+				}));
+			}
+		});
+	});
+}
+function Za(e, t) {
+	return U(e.ul, function(n, r) {
+		if (t) return e[t.toLowerCase()][r];
+		var i = J(H(e, r));
+		return (i[1] + i[2]) / 2;
+	});
+}
+function Qa(e) {
+	var t = X(e), n = xr(Va(e, t), Ha(e, t)), r = {}, i;
+	return E(["u", "d"], function(a) {
+		i = a === "u" ? t : w(t).reverse(), E(["l", "r"], function(t) {
+			t === "r" && (i = H(i, function(e) {
+				return w(e).reverse();
+			}));
+			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");
+			t === "r" && (c = U(c, function(e) {
+				return -e;
+			})), r[a + t] = c;
+		});
+	}), Xa(r, Ya(e, r)), Za(r, e.graph().align);
+}
+function $a(e, t, n) {
+	return function(r, i, a) {
+		var o = r.node(i), s = r.node(a), c = 0, l;
+		if (c += o.width / 2, Object.prototype.hasOwnProperty.call(o, "labelpos")) switch (o.labelpos.toLowerCase()) {
+			case "l":
+				l = -o.width / 2;
+				break;
+			case "r": l = o.width / 2;
+		}
+		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()) {
+			case "l":
+				l = s.width / 2;
+				break;
+			case "r": l = -s.width / 2;
+		}
+		return l && (c += n ? l : -l), l = 0, c;
+	};
+}
+function eo(e, t) {
+	return e.node(t).width;
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/position/index.js
+function to(e) {
+	e = bi(e), no(e), fr(Qa(e), function(t, n) {
+		e.node(n).x = t;
+	});
+}
+function no(e) {
+	var t = X(e), n = e.graph().ranksep, r = 0;
+	E(t, function(t) {
+		var i = W(H(t, function(t) {
+			return e.node(t).height;
+		}));
+		E(t, function(t) {
+			e.node(t).y = r + i / 2;
+		}), r += i + n;
+	});
+}
+//#endregion
+//#region ../node_modules/dagre-d3-es/src/dagre/layout.js
+function ro(e, t) {
+	var n = t && t.debugTiming ? Di : Oi;
+	n("layout", () => {
+		var t = n("  buildLayoutGraph", () => ho(e));
+		n("  runLayout", () => io(t, n)), n("  updateInputGraph", () => ao(e, t));
+	});
+}
+function io(e, t) {
+	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));
+}
+function ao(e, t) {
+	E(e.nodes(), function(n) {
+		var r = e.node(n), i = t.node(n);
+		r && (r.x = i.x, r.y = i.y, t.children(n).length && (r.width = i.width, r.height = i.height));
+	}), E(e.edges(), function(n) {
+		var r = e.edge(n), i = t.edge(n);
+		r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
+	}), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
+}
+var oo = [
+	"nodesep",
+	"edgesep",
+	"ranksep",
+	"marginx",
+	"marginy"
+], so = {
+	ranksep: 50,
+	edgesep: 20,
+	nodesep: 50,
+	rankdir: "tb"
+}, co = [
+	"acyclicer",
+	"ranker",
+	"rankdir",
+	"align"
+], lo = ["width", "height"], uo = {
+	width: 0,
+	height: 0
+}, fo = [
+	"minlen",
+	"weight",
+	"width",
+	"height",
+	"labeloffset"
+], po = {
+	minlen: 1,
+	weight: 1,
+	width: 0,
+	height: 0,
+	labeloffset: 10,
+	labelpos: "r"
+}, mo = ["labelpos"];
+function ho(e) {
+	var t = new O({
+		multigraph: !0,
+		compound: !0
+	}), n = ko(e.graph());
+	return t.setGraph(xr({}, so, Oo(n, oo), K(n, co))), E(e.nodes(), function(n) {
+		var r = ko(e.node(n));
+		t.setNode(n, er(Oo(r, lo), uo)), t.setParent(n, e.parent(n));
+	}), E(e.edges(), function(n) {
+		var r = ko(e.edge(n));
+		t.setEdge(n, xr({}, po, Oo(r, fo), K(r, mo)));
+	}), t;
+}
+function go(e) {
+	var t = e.graph();
+	t.ranksep /= 2, E(e.edges(), function(n) {
+		var r = e.edge(n);
+		r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
+	});
+}
+function _o(e) {
+	E(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (n.width && n.height) {
+			var r = e.node(t.v);
+			Y(e, "edge-proxy", {
+				rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
+				e: t
+			}, "_ep");
+		}
+	});
+}
+function vo(e) {
+	var t = 0;
+	E(e.nodes(), function(n) {
+		var r = e.node(n);
+		r.borderTop && (r.minRank = e.node(r.borderTop).rank, r.maxRank = e.node(r.borderBottom).rank, t = W(t, r.maxRank));
+	}), e.graph().maxRank = t;
+}
+function yo(e) {
+	E(e.nodes(), function(t) {
+		var n = e.node(t);
+		n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
+	});
+}
+function bo(e) {
+	var t = Infinity, n = 0, r = Infinity, i = 0, a = e.graph(), o = a.marginx || 0, s = a.marginy || 0;
+	function c(e) {
+		var a = e.x, o = e.y, s = e.width, c = e.height;
+		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);
+	}
+	E(e.nodes(), function(t) {
+		c(e.node(t));
+	}), E(e.edges(), function(t) {
+		var n = e.edge(t);
+		Object.prototype.hasOwnProperty.call(n, "x") && c(n);
+	}), t -= o, r -= s, E(e.nodes(), function(n) {
+		var i = e.node(n);
+		i.x -= t, i.y -= r;
+	}), E(e.edges(), function(n) {
+		var i = e.edge(n);
+		E(i.points, function(e) {
+			e.x -= t, e.y -= r;
+		}), Object.prototype.hasOwnProperty.call(i, "x") && (i.x -= t), Object.prototype.hasOwnProperty.call(i, "y") && (i.y -= r);
+	}), a.width = n - t + o, a.height = i - r + s;
+}
+function xo(e) {
+	E(e.edges(), function(t) {
+		var n = e.edge(t), r = e.node(t.v), i = e.node(t.w), a, o;
+		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));
+	});
+}
+function So(e) {
+	E(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (Object.prototype.hasOwnProperty.call(n, "x")) switch ((n.labelpos === "l" || n.labelpos === "r") && (n.width -= n.labeloffset), n.labelpos) {
+			case "l":
+				n.x -= n.width / 2 + n.labeloffset;
+				break;
+			case "r": n.x += n.width / 2 + n.labeloffset;
+		}
+	});
+}
+function Co(e) {
+	E(e.edges(), function(t) {
+		var n = e.edge(t);
+		n.reversed && n.points.reverse();
+	});
+}
+function wo(e) {
+	E(e.nodes(), function(t) {
+		if (e.children(t).length) {
+			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));
+			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;
+		}
+	}), E(e.nodes(), function(t) {
+		e.node(t).dummy === "border" && e.removeNode(t);
+	});
+}
+function To(e) {
+	E(e.edges(), function(t) {
+		if (t.v === t.w) {
+			var n = e.node(t.v);
+			n.selfEdges ||= [], n.selfEdges.push({
+				e: t,
+				label: e.edge(t)
+			}), e.removeEdge(t);
+		}
+	});
+}
+function Eo(e) {
+	var t = X(e);
+	E(t, function(t) {
+		var n = 0;
+		E(t, function(t, r) {
+			var i = e.node(t);
+			i.order = r + n, E(i.selfEdges, function(t) {
+				Y(e, "selfedge", {
+					width: t.label.width,
+					height: t.label.height,
+					rank: i.rank,
+					order: r + ++n,
+					e: t.e,
+					label: t.label
+				}, "_se");
+			}), delete i.selfEdges;
+		});
+	});
+}
+function Do(e) {
+	E(e.nodes(), function(t) {
+		var n = e.node(t);
+		if (n.dummy === "selfedge") {
+			var r = e.node(n.e.v), i = r.x + r.width / 2, a = r.y, o = n.x - i, s = r.height / 2;
+			e.setEdge(n.e, n.label), e.removeNode(t), n.label.points = [
+				{
+					x: i + 2 * o / 3,
+					y: a - s
+				},
+				{
+					x: i + 5 * o / 6,
+					y: a - s
+				},
+				{
+					x: i + o,
+					y: a
+				},
+				{
+					x: i + 5 * o / 6,
+					y: a + s
+				},
+				{
+					x: i + 2 * o / 3,
+					y: a + s
+				}
+			], n.label.x = n.x, n.label.y = n.y;
+		}
+	});
+}
+function Oo(e, t) {
+	return U(K(e, t), Number);
+}
+function ko(e) {
+	var t = {};
+	return E(e, function(e, n) {
+		t[n.toLowerCase()] = e;
+	}), t;
+}
+//#endregion
+//#region ../node_modules/mermaid/dist/chunks/mermaid.core/dagre-W4DXFKR2.mjs
+var Ao = /* @__PURE__ */ e((e, t, n) => Math.max(t, Math.min(n, e)), "clamp"), jo = /* @__PURE__ */ e((e = "TB") => {
+	switch (e) {
+		case "BT": return "bottom";
+		case "LR": return "right";
+		case "RL": return "left";
+		default: return "top";
+	}
+}, "getDefaultSelfLoopSide"), Mo = /* @__PURE__ */ e((e) => e === "flowchart" || e === "flowchart-v2" || e === "stateDiagram" || e === "er" || e === "classDiagram", "shouldMergeSelfLoopSegments"), No = [
+	"x",
+	"y",
+	"width",
+	"height",
+	"labelBBox",
+	"intersect",
+	"calcIntersect",
+	"diff",
+	"clusterNode"
+], Po = /* @__PURE__ */ e((e, t, n, r, i) => {
+	let a = [], o = /* @__PURE__ */ new Set();
+	if (n.forEach(({ start: e, end: t }) => {
+		e !== r && o.add(e), t !== r && o.add(t);
+	}), o.forEach((t) => {
+		let n = e.node(t);
+		typeof n?.x == "number" && typeof n?.y == "number" && a.push(n);
+	}), a.length === 0 && n.forEach(({ edge: e }) => {
+		(e.points ?? []).forEach((e) => {
+			typeof e?.x == "number" && typeof e?.y == "number" && a.push(e);
+		});
+	}), a.length === 0) return jo(i);
+	let s = a.reduce((e, t) => ({
+		x: e.x + t.x / a.length,
+		y: e.y + t.y / a.length
+	}), {
+		x: 0,
+		y: 0
+	}), c = s.x - t.x, l = s.y - t.y;
+	return Math.abs(c) > Math.abs(l) ? c > 0 ? "right" : "left" : Math.abs(l) > 0 ? l > 0 ? "bottom" : "top" : jo(i);
+}, "getSelfLoopSide"), Fo = /* @__PURE__ */ e((e, t = "top", n = 0, r = 0) => {
+	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);
+	switch (t) {
+		case "bottom": {
+			let e = a + s;
+			return [
+				{
+					x: i - l / 2,
+					y: e
+				},
+				{
+					x: i - l / 2,
+					y: e + u
+				},
+				{
+					x: i + l / 2,
+					y: e + u
+				},
+				{
+					x: i + l / 2,
+					y: e
+				}
+			];
+		}
+		case "right": {
+			let e = i + o;
+			return [
+				{
+					x: e,
+					y: a - l / 2
+				},
+				{
+					x: e + u,
+					y: a - l / 2
+				},
+				{
+					x: e + u,
+					y: a + l / 2
+				},
+				{
+					x: e,
+					y: a + l / 2
+				}
+			];
+		}
+		case "left": {
+			let e = i - o;
+			return [
+				{
+					x: e,
+					y: a - l / 2
+				},
+				{
+					x: e - u,
+					y: a - l / 2
+				},
+				{
+					x: e - u,
+					y: a + l / 2
+				},
+				{
+					x: e,
+					y: a + l / 2
+				}
+			];
+		}
+		default: {
+			let e = a - s;
+			return [
+				{
+					x: i - l / 2,
+					y: e
+				},
+				{
+					x: i - l / 2,
+					y: e - u
+				},
+				{
+					x: i + l / 2,
+					y: e - u
+				},
+				{
+					x: i + l / 2,
+					y: e
+				}
+			];
+		}
+	}
+}, "getSelfLoopPoints"), Io = /* @__PURE__ */ e((e, t, n = "top", r = 0, i = {}) => {
+	let a = e.x, o = e.y - r, s = i.width ?? 0, c = i.height ?? 0;
+	switch (n) {
+		case "bottom": return {
+			x: a,
+			y: Math.max(...t.map((e) => e.y)) + c / 2 + 4
+		};
+		case "right": return {
+			x: Math.max(...t.map((e) => e.x)) + s / 2 + 4,
+			y: o
+		};
+		case "left": return {
+			x: Math.min(...t.map((e) => e.x)) - s / 2 - 4,
+			y: o
+		};
+		default: return {
+			x: a,
+			y: Math.min(...t.map((e) => e.y)) - c / 2 - 4
+		};
+	}
+}, "getSelfLoopLabelPosition"), Lo = /* @__PURE__ */ e((e, t = 0, { mergeSelfLoops: n = !0 } = {}) => {
+	let r = /* @__PURE__ */ new Map(), i = [], a = e.graph()?.rankdir;
+	return e.edges().forEach((t) => {
+		let a = e.edge(t);
+		if (n && a.selfLoop) {
+			let e = a.selfLoop.id;
+			r.has(e) || r.set(e, []), r.get(e).push({
+				edge: a,
+				start: t.v,
+				end: t.w
+			});
+		} else i.push({
+			edge: a,
+			start: t.v,
+			end: t.w
+		});
+	}), r.forEach((n) => {
+		if (n.length !== 3) {
+			n.forEach((e) => i.push(e));
+			return;
+		}
+		n.sort((e, t) => e.edge.selfLoop.order - t.edge.selfLoop.order);
+		let [r, o, s] = n, c = r.edge.originalEdge ?? o.edge.originalEdge ?? s.edge.originalEdge ?? o.edge, l = e.node(c.start);
+		if (!l) {
+			n.forEach((e) => i.push(e));
+			return;
+		}
+		let u = {
+			width: o.edge.width,
+			height: o.edge.height
+		}, d = Po(e, l, n, c.start, a), f = Fo(l, d, t, u.width ?? 0), p = Io(l, f, d, t, u), m = {
+			...o.edge,
+			...c,
+			id: c.id,
+			points: f,
+			start: c.start,
+			end: c.end,
+			x: p.x,
+			y: p.y,
+			width: u.width,
+			height: u.height,
+			labelStyle: o.edge.labelStyle,
+			fromCluster: r.edge.fromCluster ?? o.edge.fromCluster ?? s.edge.fromCluster,
+			toCluster: r.edge.toCluster ?? o.edge.toCluster ?? s.edge.toCluster
+		};
+		delete m.selfLoop, delete m.originalEdge, i.push({
+			edge: m,
+			start: m.start,
+			end: m.end
+		});
+	}), i;
+}, "getEdgesToRender"), Ro = /* @__PURE__ */ e(async ({ element: n, graph: a, diagramType: c, id: l, parentCluster: u, siteConfig: d }) => {
+	let f = a.graph().rankdir;
+	t.trace("Dir in recursive render - dir:", f);
+	let { clusters: p, edgePaths: m, edgeLabels: h, nodes: g, rootGroups: ee } = ze(n, { edgePathsClass: "edgePaths" });
+	a.nodes() ? t.info("Recursive render XXX", a.nodes()) : t.info("No nodes found for", a), a.edges().length > 0 && t.info("Recursive edges", a.edge(a.edges()[0]));
+	let _ = Mo(c);
+	await Promise.all(a.nodes().map(async function(e) {
+		let n = a.node(e);
+		if (u !== void 0) {
+			let n = JSON.parse(JSON.stringify(u.clusterData));
+			t.trace("Setting data for parent cluster XXX\n Node.id = ", e, "\n data=", n.height, "\nParent cluster", u.height), a.setNode(u.id, n), a.parent(e) || (t.trace("Setting parent", e, u.id), a.setParent(e, u.id, n));
+		}
+		if (t.info("(Insert) Node XXX" + e + ": " + JSON.stringify(a.node(e))), n?.clusterNode) {
+			t.info("Cluster identified XBX", e, n.width, a.node(e));
+			let { ranksep: o, nodesep: s } = a.graph();
+			n.graph.setGraph({
+				...n.graph.graph(),
+				ranksep: o + 25,
+				nodesep: s
+			});
+			let u = await Go({
+				element: g,
+				graph: n.graph,
+				diagramType: c,
+				id: l,
+				parentCluster: a.node(e),
+				siteConfig: d
+			}), f = u.elem;
+			r(n, f), n.diff = u.diff || 0, t.info("New compound node after recursive render XAX", e, "width", n.width, "height", n.height), i(f, n);
+		} else a.children(e).length > 0 ? (t.trace("Cluster - the non recursive path XBX", e, n.id, n, n.width, "Graph:", a), t.trace(Be(n.id, a)), j.set(n.id, {
+			id: Be(n.id, a),
+			node: n
+		})) : (t.trace("Node - the non recursive path XAX", e, g, a.node(e), f), await He(g, a.node(e), {
+			config: d,
+			dir: f
+		}));
+	})), await (/* @__PURE__ */ e(async () => {
+		let e = a.edges().map(async function(e) {
+			let n = a.edge(e.v, e.w, e.name);
+			if (t.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e)), t.info("Edge " + e.v + " -> " + e.w + ": ", e, " ", JSON.stringify(a.edge(e))), t.info("Fix", j, "ids:", e.v, e.w, "Translating: ", j.get(e.v), j.get(e.w)), _ && n.selfLoop) {
+				if (n.selfLoop.order !== 1) return;
+				let e = {
+					...n.originalEdge,
+					...n,
+					id: n.selfLoop.id,
+					startLabelLeft: n.originalEdge?.startLabelLeft ?? n.startLabelLeft,
+					startLabelRight: n.originalEdge?.startLabelRight ?? n.startLabelRight,
+					endLabelLeft: n.originalEdge?.endLabelLeft ?? n.endLabelLeft,
+					endLabelRight: n.originalEdge?.endLabelRight ?? n.endLabelRight
+				};
+				await s(h, e), n.width = e.width, n.height = e.height, n.labelStyle = e.labelStyle;
+				return;
+			}
+			await s(h, n);
+		});
+		await Promise.all(e);
+	}, "processEdges"))();
+	let { subGraphTitleTotalMargin: te } = o(d);
+	return {
+		elem: ee,
+		graph: a,
+		groups: {
+			clusters: p,
+			edgePaths: m,
+			edgeLabels: h,
+			nodes: g,
+			rootGroups: ee
+		},
+		diagramType: c,
+		id: l,
+		mergeSelfLoops: _,
+		subGraphTitleTotalMargin: te
+	};
+}, "measureDagreGraph"), zo = /* @__PURE__ */ e((e) => {
+	t.info("############################################# XXX"), t.info("###                Layout                 ### XXX"), t.info("############################################# XXX"), ro(e);
+}, "runDagreGraphLayout"), Bo = /* @__PURE__ */ e((e, t, n) => {
+	let r = e.node(t);
+	if (!r) return;
+	let i = { ...r };
+	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;
+}, "normalizeDagreNode"), Vo = /* @__PURE__ */ e((e, t) => {
+	No.forEach((n) => {
+		t[n] !== void 0 && (e[n] = t[n]);
+	});
+}, "applyDagreNodeLayout"), Ho = /* @__PURE__ */ e((e, t, n, r) => ({
+	...e,
+	start: e.start ?? t,
+	end: e.end ?? n,
+	points: (e.points ?? []).map((e) => ({
+		...e,
+		y: typeof e.y == "number" ? e.y + r : e.y
+	}))
+}), "normalizeDagreEdge"), Uo = /* @__PURE__ */ e((e, t) => {
+	let { graph: n, mergeSelfLoops: r, subGraphTitleTotalMargin: i = 0 } = t, a = new Map(e.nodes.map((e) => [e.id, e]));
+	Re(n).forEach((e) => {
+		let t = Bo(n, e, i);
+		if (!t) return;
+		Vo(n.node(e), t);
+		let r = a.get(e);
+		r && Vo(r, t);
+	});
+	let o = i / 2;
+	return e.edges = Lo(n, o, { mergeSelfLoops: r }).map(({ edge: e, start: t, end: n }) => Ho(e, t, n, o)), e;
+}, "applyDagreLayoutResult"), Wo = /* @__PURE__ */ e(async ({ elem: e, graph: n, groups: { clusters: r, edgePaths: i }, diagramType: o, id: s, mergeSelfLoops: u, subGraphTitleTotalMargin: d }) => {
+	let f = 0;
+	await Promise.all(Re(n).map(async function(e) {
+		let i = n.node(e);
+		if (t.info("Position XBX => " + e + ": (" + i.x, "," + i.y, ") width: ", i.width, " height: ", i.height), i?.clusterNode) i.y += d, t.info("A tainted cluster node XBX1", e, i.id, i.width, i.height, i.x, i.y, n.parent(e)), j.get(i.id).node = i, a(i);
+		else if (n.children(e).length > 0) {
+			t.info("A pure cluster node XBX1", e, i.id, i.x, i.y, i.width, i.height, n.parent(e)), i.height += d, n.node(i.parentId);
+			let a = i?.padding / 2 || 0, o = i?.labelBBox?.height || 0, s = o - a || 0;
+			t.debug("OffsetY", s, "labelHeight", o, "halfPadding", a), await Le(r, i), j.get(i.id).node = i;
+		} else {
+			let e = n.node(i.parentId);
+			i.y += d / 2, t.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", e, e?.offsetY, i), a(i);
+		}
+	}));
+	let p = d / 2;
+	return Lo(n, p, { mergeSelfLoops: u }).forEach(function({ edge: e, start: r, end: a }) {
+		t.info("Edge " + r + " -> " + a + ": " + JSON.stringify(e), e), e.points.forEach((e) => e.y += p);
+		let u = n.node(r), d = n.node(a), f = c(i, e, j, o, u, d, s);
+		l(e, f);
+	}), n.nodes().forEach(function(e) {
+		let r = n.node(e);
+		t.info(e, r.type, r.diff), r.isGroup && (f = r.diff);
+	}), t.warn("Returning from recursive render XAX", e, f), {
+		elem: e,
+		diff: f
+	};
+}, "paintDagreLayoutCore"), Go = /* @__PURE__ */ e(async (e) => {
+	let t = await Ro(e);
+	return zo(t.graph), await Wo(t);
+}, "renderDagreSubgraph"), Ko = /* @__PURE__ */ e((e) => {
+	let n = new O({
+		multigraph: !0,
+		compound: !0
+	}).setGraph({
+		rankdir: e.direction,
+		nodesep: e.config?.nodeSpacing || e.nodeSpacing || e.config?.flowchart?.nodeSpacing,
+		ranksep: e.config?.rankSpacing || e.rankSpacing || e.config?.flowchart?.rankSpacing,
+		marginx: 8,
+		marginy: 8
+	}).setDefaultEdgeLabel(function() {
+		return {};
+	});
+	return e.nodes.forEach((e) => {
+		n.setNode(e.id, { ...e }), e.parentId && n.setParent(e.id, e.parentId);
+	}), t.debug("Edges:", e.edges), e.edges.forEach((e) => {
+		if (e.start === e.end) {
+			let t = e.start, r = t + "---" + t + "---1", i = t + "---" + t + "---2", a = n.node(t);
+			n.setNode(r, {
+				domId: r,
+				id: r,
+				parentId: a.parentId,
+				labelStyle: "",
+				label: "",
+				padding: 0,
+				shape: "labelRect",
+				style: "",
+				width: 10,
+				height: 10
+			}), n.setParent(r, a.parentId), n.setNode(i, {
+				domId: i,
+				id: i,
+				parentId: a.parentId,
+				labelStyle: "",
+				padding: 0,
+				shape: "labelRect",
+				label: "",
+				style: "",
+				width: 10,
+				height: 10
+			}), n.setParent(i, a.parentId);
+			let o = structuredClone(e), s = structuredClone(e), c = structuredClone(e), l = structuredClone(e);
+			s.originalEdge = o, s.selfLoop = {
+				id: o.id,
+				order: 0
+			}, c.originalEdge = o, c.selfLoop = {
+				id: o.id,
+				order: 1
+			}, l.originalEdge = o, l.selfLoop = {
+				id: o.id,
+				order: 2
+			}, 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");
+		} else n.setEdge(e.start, e.end, { ...e }, e.id);
+	}), Ue(n), { graph: n };
+}, "prepareLayoutForDagre"), qo = /* @__PURE__ */ e(async (e, { element: t, preparedLayout: r }) => {
+	let i = r ?? Ko(e), a = n(), o = await Ro({
+		element: t,
+		graph: i.graph,
+		diagramType: e.type,
+		id: e.diagramId,
+		parentCluster: void 0,
+		siteConfig: a
+	});
+	return i.measuredLayout = o, o;
+}, "measureDagreLayout"), Jo = /* @__PURE__ */ e((e, t) => {
+	let n = t.preparedLayout?.measuredLayout;
+	if (!n) throw Error("runDagreLayoutCore requires measureDagreLayout to run first");
+	return zo(n.graph), Uo(e, n), n;
+}, "runDagreLayoutCore"), Yo = Ve({
+	prepareLayout: Ko,
+	measureLayout: qo,
+	runLayoutCore: Jo,
+	paintOptions: {
+		clusterDb: j,
+		getNodes: /* @__PURE__ */ e((e, { measure: t }) => Re(t.graph).map((e) => t.graph.node(e)).filter(Boolean), "getDagrePaintNodes"),
+		getEdgeNode: /* @__PURE__ */ e((e, t, { measure: n }) => e ? n.graph.node(e) : void 0, "getDagreEdgeNode"),
+		skipNode: /* @__PURE__ */ e((e, { measure: t }) => !t.graph.hasNode(e.id), "skipNode"),
+		isCluster: /* @__PURE__ */ e((e, { measure: t }) => t.graph.hasNode(e.id) && (t.graph.children(e.id) ?? []).length > 0, "isCluster")
+	}
+});
+//#endregion
+export { Uo as applyDagreLayoutResult, Lo as getEdgesToRender, qo as measureDagreLayout, Ko as prepareLayoutForDagre, Yo as render, Jo as runDagreLayoutCore };