@nxgt/material 2.0.1 → 2.2.0

package/dist/dagre-6A5THRUB-0G8VOjTo.js

@@ -1,2191 +0,0 @@
-import { B as e, C as t, D as n, E as r, F as i, I as a, L as o, N as s, P as c, R as l, T as u, V as d, _ as f, c as p, g as m, i as ee, k as h, l as g, n as te, o as ne, s as re, v as ie, w as ae, x as oe, z as se } from "./isArrayLikeObject-VG1KOJ3m.js";
-import { $ as ce, Q as le, Y as _, Z as ue, et as de, it as fe, nt as pe, rt as me } from "./lib-BDc9msmn.js";
-import { C as he, S as v, T as ge, _ as _e, b as y, g as ve, h as ye, m as b, v as be, w as xe, x, y as Se } from "./i18n-CGol3PGw.js";
-import { a as S, c as Ce, d as we, f as Te, g as Ee, h as De, i as C, l as Oe, m as ke, n as w, o as T, p as Ae, r as E, s as je, t as D, u as O } from "./graphlib-DXJ-RYOD.js";
-import { n as k } from "./src-ripuExsx.js";
-import "./chunk-ZIGJFQKS-7XzdXF8V.js";
-import { n as A } from "./chunk-Y2CYZVJY-i11wjrBe.js";
-import { x as Me } from "./chunk-O7XYJQB3-kPU-FrcW.js";
-import "./chunk-742MDFTN-B7xNATkT.js";
-import "./chunk-MBY4JIJT-CKKv0vlf.js";
-import "./chunk-7PRAP22T-1TE3ytg4.js";
-import { c as Ne } from "./chunk-7INBJB4K-BgETHnGm.js";
-import { a as Pe, i as Fe, n as Ie } from "./chunk-5DYCD2WN-BepRdgxI.js";
-import { a as Le, i as Re, l as ze } from "./chunk-Z7XXMR3K-DFs9CL0g.js";
-import { r as Be } from "./chunk-UA2S7LBM-BUjL6NMa.js";
-import { c as Ve, i as He, n as j, o as Ue, r as We, s as Ge, t as Ke } from "./chunk-3FUC2YCW-CAJ0rgCP.js";
-//#region node_modules/lodash-es/_trimmedEndIndex.js
-var qe = /\s/;
-function Je(e) {
-	for (var t = e.length; t-- && qe.test(e.charAt(t)););
-	return t;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseTrim.js
-var Ye = /^\s+/;
-function Xe(e) {
-	return e && e.slice(0, Je(e) + 1).replace(Ye, "");
-}
-//#endregion
-//#region node_modules/lodash-es/toNumber.js
-var Ze = NaN, Qe = /^[-+]0x[0-9a-f]+$/i, $e = /^0b[01]+$/i, et = /^0o[0-7]+$/i, tt = parseInt;
-function nt(e) {
-	if (typeof e == "number") return e;
-	if (o(e)) return Ze;
-	if (c(e)) {
-		var t = typeof e.valueOf == "function" ? e.valueOf() : e;
-		e = c(t) ? t + "" : t;
-	}
-	if (typeof e != "string") return e === 0 ? e : +e;
-	e = Xe(e);
-	var n = $e.test(e);
-	return n || et.test(e) ? tt(e.slice(2), n ? 2 : 8) : Qe.test(e) ? Ze : +e;
-}
-//#endregion
-//#region node_modules/lodash-es/toFinite.js
-var rt = Infinity, it = 17976931348623157e292;
-function M(e) {
-	return e ? (e = nt(e), e === rt || e === -rt ? (e < 0 ? -1 : 1) * it : e === e ? e : 0) : e === 0 ? e : 0;
-}
-//#endregion
-//#region node_modules/lodash-es/toInteger.js
-function at(e) {
-	var t = M(e), n = t % 1;
-	return t === t ? n ? t - n : t : 0;
-}
-//#endregion
-//#region node_modules/lodash-es/flatten.js
-function N(e) {
-	return e != null && e.length ? ke(e, 1) : [];
-}
-//#endregion
-//#region node_modules/lodash-es/_flatRest.js
-function ot(e) {
-	return n(ae(e, void 0, N), e + "");
-}
-//#endregion
-//#region node_modules/lodash-es/_hasUnicode.js
-var st = RegExp("[\\u200d\\ud800-\\udfff\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff\\ufe0e\\ufe0f]");
-function ct(e) {
-	return st.test(e);
-}
-//#endregion
-//#region node_modules/lodash-es/_baseAssign.js
-function lt(e, t) {
-	return e && v(t, me(t), e);
-}
-//#endregion
-//#region node_modules/lodash-es/_baseAssignIn.js
-function ut(e, t) {
-	return e && v(t, y(t), e);
-}
-//#endregion
-//#region node_modules/lodash-es/_copySymbols.js
-function dt(e, t) {
-	return v(e, ce(e), t);
-}
-//#endregion
-//#region node_modules/lodash-es/_getSymbolsIn.js
-var ft = Object.getOwnPropertySymbols ? function(e) {
-	for (var t = []; e;) pe(t, ce(e)), e = Se(e);
-	return t;
-} : de;
-//#endregion
-//#region node_modules/lodash-es/_copySymbolsIn.js
-function pt(e, t) {
-	return v(e, ft(e), t);
-}
-//#endregion
-//#region node_modules/lodash-es/_getAllKeysIn.js
-function mt(e) {
-	return le(e, y, ft);
-}
-//#endregion
-//#region node_modules/lodash-es/_initCloneArray.js
-var ht = Object.prototype.hasOwnProperty;
-function gt(e) {
-	var t = e.length, n = new e.constructor(t);
-	return t && typeof e[0] == "string" && ht.call(e, "index") && (n.index = e.index, n.input = e.input), n;
-}
-//#endregion
-//#region node_modules/lodash-es/_cloneDataView.js
-function _t(e, t) {
-	var n = t ? _e(e.buffer) : e.buffer;
-	return new e.constructor(n, e.byteOffset, e.byteLength);
-}
-//#endregion
-//#region node_modules/lodash-es/_cloneRegExp.js
-var vt = /\w*$/;
-function yt(e) {
-	var t = new e.constructor(e.source, vt.exec(e));
-	return t.lastIndex = e.lastIndex, t;
-}
-//#endregion
-//#region node_modules/lodash-es/_cloneSymbol.js
-var bt = e ? e.prototype : void 0, xt = bt ? bt.valueOf : void 0;
-function St(e) {
-	return xt ? Object(xt.call(e)) : {};
-}
-//#endregion
-//#region node_modules/lodash-es/_initCloneByTag.js
-var Ct = "[object Boolean]", wt = "[object Date]", Tt = "[object Map]", Et = "[object Number]", Dt = "[object RegExp]", Ot = "[object Set]", kt = "[object String]", At = "[object Symbol]", jt = "[object ArrayBuffer]", Mt = "[object DataView]", Nt = "[object Float32Array]", Pt = "[object Float64Array]", Ft = "[object Int8Array]", It = "[object Int16Array]", Lt = "[object Int32Array]", Rt = "[object Uint8Array]", zt = "[object Uint8ClampedArray]", Bt = "[object Uint16Array]", Vt = "[object Uint32Array]";
-function Ht(e, t, n) {
-	var r = e.constructor;
-	switch (t) {
-		case jt: return _e(e);
-		case Ct:
-		case wt: return new r(+e);
-		case Mt: return _t(e, n);
-		case Nt:
-		case Pt:
-		case Ft:
-		case It:
-		case Lt:
-		case Rt:
-		case zt:
-		case Bt:
-		case Vt: return ve(e, n);
-		case Tt: return new r();
-		case Et:
-		case kt: return new r(e);
-		case Dt: return yt(e);
-		case Ot: return new r();
-		case At: return St(e);
-	}
-}
-//#endregion
-//#region node_modules/lodash-es/_baseIsMap.js
-var Ut = "[object Map]";
-function Wt(e) {
-	return l(e) && _(e) == Ut;
-}
-//#endregion
-//#region node_modules/lodash-es/isMap.js
-var Gt = m && m.isMap, Kt = Gt ? f(Gt) : Wt, qt = "[object Set]";
-function Jt(e) {
-	return l(e) && _(e) == qt;
-}
-//#endregion
-//#region node_modules/lodash-es/isSet.js
-var Yt = m && m.isSet, Xt = Yt ? f(Yt) : Jt, Zt = 1, Qt = 2, $t = 4, en = "[object Arguments]", tn = "[object Array]", nn = "[object Boolean]", rn = "[object Date]", an = "[object Error]", on = "[object Function]", sn = "[object GeneratorFunction]", cn = "[object Map]", ln = "[object Number]", un = "[object Object]", dn = "[object RegExp]", fn = "[object Set]", pn = "[object String]", mn = "[object Symbol]", hn = "[object WeakMap]", gn = "[object ArrayBuffer]", _n = "[object DataView]", vn = "[object Float32Array]", yn = "[object Float64Array]", bn = "[object Int8Array]", xn = "[object Int16Array]", Sn = "[object Int32Array]", Cn = "[object Uint8Array]", wn = "[object Uint8ClampedArray]", Tn = "[object Uint16Array]", En = "[object Uint32Array]", P = {};
-P[en] = P[tn] = P[gn] = P[_n] = P[nn] = P[rn] = P[vn] = P[yn] = P[bn] = P[xn] = P[Sn] = P[cn] = P[ln] = P[un] = P[dn] = P[fn] = P[pn] = P[mn] = P[Cn] = P[wn] = P[Tn] = P[En] = !0, P[an] = P[on] = P[hn] = !1;
-function F(e, t, n, r, a, o) {
-	var s, l = t & Zt, u = t & Qt, d = t & $t;
-	if (n && (s = a ? n(e, r, a, o) : n(e)), s !== void 0) return s;
-	if (!c(e)) return e;
-	var f = i(e);
-	if (f) {
-		if (s = gt(e), !l) return ge(e, s);
-	} else {
-		var p = _(e), m = p == on || p == sn;
-		if (ie(e)) return be(e, l);
-		if (p == un || p == en || m && !a) {
-			if (s = u || m ? {} : ye(e), !l) return u ? pt(e, ut(s, e)) : dt(e, lt(s, e));
-		} else {
-			if (!P[p]) return a ? e : {};
-			s = Ht(e, p, l);
-		}
-	}
-	o ||= new ee();
-	var h = o.get(e);
-	if (h) return h;
-	o.set(e, s), Xt(e) ? e.forEach(function(r) {
-		s.add(F(r, t, n, r, e, o));
-	}) : Kt(e) && e.forEach(function(r, i) {
-		s.set(i, F(r, t, n, i, e, o));
-	});
-	var g = f ? void 0 : (d ? u ? mt : ue : u ? y : me)(e);
-	return Ee(g || e, function(r, i) {
-		g && (i = r, r = e[i]), he(s, i, F(r, t, n, i, e, o));
-	}), s;
-}
-//#endregion
-//#region node_modules/lodash-es/cloneDeep.js
-var Dn = 1, On = 4;
-function kn(e) {
-	return F(e, Dn | On);
-}
-//#endregion
-//#region node_modules/lodash-es/now.js
-var An = function() {
-	return d.Date.now();
-}, jn = Object.prototype, Mn = jn.hasOwnProperty, Nn = t(function(e, t) {
-	e = Object(e);
-	var n = -1, r = t.length, i = r > 2 ? t[2] : void 0;
-	for (i && x(t[0], t[1], i) && (r = 1); ++n < r;) for (var a = t[n], o = y(a), s = -1, c = o.length; ++s < c;) {
-		var l = o[s], d = e[l];
-		(d === void 0 || u(d, jn[l]) && !Mn.call(e, l)) && (e[l] = a[l]);
-	}
-	return e;
-});
-//#endregion
-//#region node_modules/lodash-es/last.js
-function I(e) {
-	var t = e == null ? 0 : e.length;
-	return t ? e[t - 1] : void 0;
-}
-//#endregion
-//#region node_modules/lodash-es/_createFind.js
-function Pn(e) {
-	return function(t, n, r) {
-		var i = Object(t);
-		if (!oe(t)) {
-			var a = O(n, 3);
-			t = me(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 Fn = Math.max;
-function In(e, t, n) {
-	var r = e == null ? 0 : e.length;
-	if (!r) return -1;
-	var i = n == null ? 0 : at(n);
-	return i < 0 && (i = Fn(r + i, 0)), De(e, O(t, 3), i);
-}
-//#endregion
-//#region node_modules/lodash-es/find.js
-var L = Pn(In);
-//#endregion
-//#region node_modules/lodash-es/_baseMap.js
-function Ln(e, t) {
-	var n = -1, r = oe(e) ? Array(e.length) : [];
-	return Ce(e, function(e, i, a) {
-		r[++n] = t(e, i, a);
-	}), r;
-}
-//#endregion
-//#region node_modules/lodash-es/map.js
-function R(e, t) {
-	return (i(e) ? a : Ln)(e, O(t, 3));
-}
-//#endregion
-//#region node_modules/lodash-es/forIn.js
-function Rn(e, t) {
-	return e == null ? e : te(e, je(t), y);
-}
-//#endregion
-//#region node_modules/lodash-es/forOwn.js
-function zn(e, t) {
-	return e && Oe(e, je(t));
-}
-//#endregion
-//#region node_modules/lodash-es/_baseGt.js
-function Bn(e, t) {
-	return e > t;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseHas.js
-var Vn = Object.prototype.hasOwnProperty;
-function Hn(e, t) {
-	return e != null && Vn.call(e, t);
-}
-//#endregion
-//#region node_modules/lodash-es/has.js
-function Un(e, t) {
-	return e != null && Ae(e, t, Hn);
-}
-//#endregion
-//#region node_modules/lodash-es/isString.js
-var Wn = "[object String]";
-function Gn(e) {
-	return typeof e == "string" || !i(e) && l(e) && se(e) == Wn;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseLt.js
-function Kn(e, t) {
-	return e < t;
-}
-//#endregion
-//#region node_modules/lodash-es/mapValues.js
-function z(e, t) {
-	var n = {};
-	return t = O(t, 3), Oe(e, function(e, r, i) {
-		xe(n, r, t(e, r, i));
-	}), n;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseExtremum.js
-function B(e, t, n) {
-	for (var r = -1, i = e.length; ++r < i;) {
-		var a = e[r], s = t(a);
-		if (s != null && (c === void 0 ? s === s && !o(s) : n(s, c))) var c = s, l = a;
-	}
-	return l;
-}
-//#endregion
-//#region node_modules/lodash-es/max.js
-function V(e) {
-	return e && e.length ? B(e, s, Bn) : void 0;
-}
-//#endregion
-//#region node_modules/lodash-es/min.js
-function H(e) {
-	return e && e.length ? B(e, s, Kn) : void 0;
-}
-//#endregion
-//#region node_modules/lodash-es/minBy.js
-function qn(e, t) {
-	return e && e.length ? B(e, O(t, 2), Kn) : void 0;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseSet.js
-function Jn(e, t, n, i) {
-	if (!c(e)) return e;
-	t = p(t, e);
-	for (var a = -1, o = t.length, s = o - 1, l = e; l != null && ++a < o;) {
-		var u = re(t[a]), d = n;
-		if (u === "__proto__" || u === "constructor" || u === "prototype") return e;
-		if (a != s) {
-			var f = l[u];
-			d = i ? i(f, u, l) : void 0, d === void 0 && (d = c(f) ? f : r(t[a + 1]) ? [] : {});
-		}
-		he(l, u, d), l = l[u];
-	}
-	return e;
-}
-//#endregion
-//#region node_modules/lodash-es/_basePickBy.js
-function Yn(e, t, n) {
-	for (var r = -1, i = t.length, a = {}; ++r < i;) {
-		var o = t[r], s = ne(e, o);
-		n(s, o) && Jn(a, p(o, e), s);
-	}
-	return a;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseSortBy.js
-function Xn(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 Zn(e, t) {
-	if (e !== t) {
-		var n = e !== void 0, r = e === null, i = e === e, a = o(e), s = t !== void 0, c = t === null, l = t === t, u = o(t);
-		if (!c && !u && !a && e > t || a && s && l && !c && !u || r && s && l || !n && l || !i) return 1;
-		if (!r && !a && !u && e < t || u && n && i && !r && !a || c && n && i || !s && i || !l) return -1;
-	}
-	return 0;
-}
-//#endregion
-//#region node_modules/lodash-es/_compareMultiple.js
-function Qn(e, t, n) {
-	for (var r = -1, i = e.criteria, a = t.criteria, o = i.length, s = n.length; ++r < o;) {
-		var c = Zn(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 $n(e, t, n) {
-	t = t.length ? a(t, function(e) {
-		return i(e) ? function(t) {
-			return ne(t, e.length === 1 ? e[0] : e);
-		} : e;
-	}) : [s];
-	var r = -1;
-	return t = a(t, f(O)), Xn(Ln(e, function(e, n, i) {
-		return {
-			criteria: a(t, function(t) {
-				return t(e);
-			}),
-			index: ++r,
-			value: e
-		};
-	}), function(e, t) {
-		return Qn(e, t, n);
-	});
-}
-//#endregion
-//#region node_modules/lodash-es/_asciiSize.js
-var er = we("length"), tr = "\\ud800-\\udfff", nr = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff", rr = "\\ufe0e\\ufe0f", ir = "[" + tr + "]", ar = "[" + nr + "]", U = "\\ud83c[\\udffb-\\udfff]", or = "(?:" + ar + "|" + U + ")", sr = "[^" + tr + "]", cr = "(?:\\ud83c[\\udde6-\\uddff]){2}", lr = "[\\ud800-\\udbff][\\udc00-\\udfff]", ur = "\\u200d", dr = or + "?", fr = "[" + rr + "]?", pr = "(?:" + ur + "(?:" + [
-	sr,
-	cr,
-	lr
-].join("|") + ")" + fr + dr + ")*", mr = fr + dr + pr, hr = "(?:" + [
-	sr + ar + "?",
-	ar,
-	cr,
-	lr,
-	ir
-].join("|") + ")", gr = RegExp(U + "(?=" + U + ")|" + hr + mr, "g");
-function _r(e) {
-	for (var t = gr.lastIndex = 0; gr.test(e);) ++t;
-	return t;
-}
-//#endregion
-//#region node_modules/lodash-es/_stringSize.js
-function vr(e) {
-	return ct(e) ? _r(e) : er(e);
-}
-//#endregion
-//#region node_modules/lodash-es/_basePick.js
-function yr(e, t) {
-	return Yn(e, t, function(t, n) {
-		return Te(e, n);
-	});
-}
-//#endregion
-//#region node_modules/lodash-es/pick.js
-var W = ot(function(e, t) {
-	return e == null ? {} : yr(e, t);
-}), br = Math.ceil, xr = Math.max;
-function Sr(e, t, n, r) {
-	for (var i = -1, a = xr(br((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 Cr(e) {
-	return function(t, n, r) {
-		return r && typeof r != "number" && x(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), Sr(t, n, r, e);
-	};
-}
-//#endregion
-//#region node_modules/lodash-es/range.js
-var G = Cr(), wr = "[object Map]", Tr = "[object Set]";
-function Er(e) {
-	if (e == null) return 0;
-	if (oe(e)) return Gn(e) ? vr(e) : e.length;
-	var t = _(e);
-	return t == wr || t == Tr ? e.size : fe(e).length;
-}
-//#endregion
-//#region node_modules/lodash-es/sortBy.js
-var K = t(function(e, t) {
-	if (e == null) return [];
-	var n = t.length;
-	return n > 1 && x(e, t[0], t[1]) ? t = [] : n > 2 && x(t[0], t[1], t[2]) && (t = [t[0]]), $n(e, ke(t, 1), []);
-}), Dr = 0;
-function q(e) {
-	var t = ++Dr;
-	return g(e) + t;
-}
-//#endregion
-//#region node_modules/lodash-es/_baseZipObject.js
-function Or(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 kr(e, t) {
-	return Or(e || [], t || [], he);
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/data/list.js
-var Ar = class {
-	constructor() {
-		var e = {};
-		e._next = e._prev = e, this._sentinel = e;
-	}
-	dequeue() {
-		var e = this._sentinel, t = e._prev;
-		if (t !== e) return jr(t), t;
-	}
-	enqueue(e) {
-		var t = this._sentinel;
-		e._prev && e._next && jr(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, Mr)), n = n._prev;
-		return "[" + e.join(", ") + "]";
-	}
-};
-function jr(e) {
-	e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
-}
-function Mr(e, t) {
-	if (e !== "_next" && e !== "_prev") return t;
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/greedy-fas.js
-var Nr = h(1);
-function Pr(e, t) {
-	if (e.nodeCount() <= 1) return [];
-	var n = Ir(e, t || Nr);
-	return N(R(Fr(n.graph, n.buckets, n.zeroIdx), function(t) {
-		return e.outEdges(t.v, t.w);
-	}));
-}
-function Fr(e, t, n) {
-	for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
-		for (; o = a.dequeue();) J(e, t, n, o);
-		for (; o = i.dequeue();) J(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(J(e, t, n, o, !0));
-				break;
-			}
-		}
-	}
-	return r;
-}
-function J(e, t, n, r, i) {
-	var a = i ? [] : void 0;
-	return T(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, Lr(t, n, s);
-	}), T(e.outEdges(r.v), function(r) {
-		var i = e.edge(r), a = r.w, o = e.node(a);
-		o.in -= i, Lr(t, n, o);
-	}), e.removeNode(r.v), a;
-}
-function Ir(e, t) {
-	var n = new D(), r = 0, i = 0;
-	T(e.nodes(), function(e) {
-		n.setNode(e, {
-			v: e,
-			in: 0,
-			out: 0
-		});
-	}), T(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 = G(i + r + 3).map(function() {
-		return new Ar();
-	}), o = r + 1;
-	return T(n.nodes(), function(e) {
-		Lr(a, o, n.node(e));
-	}), {
-		graph: n,
-		buckets: a,
-		zeroIdx: o
-	};
-}
-function Lr(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 Rr(e) {
-	T(e.graph().acyclicer === "greedy" ? Pr(e, t(e)) : zr(e), function(t) {
-		var n = e.edge(t);
-		e.removeEdge(t), n.forwardName = t.name, n.reversed = !0, e.setEdge(t.w, t.v, n, q("rev"));
-	});
-	function t(e) {
-		return function(t) {
-			return e.edge(t).weight;
-		};
-	}
-}
-function zr(e) {
-	var t = [], n = {}, r = {};
-	function i(a) {
-		Object.prototype.hasOwnProperty.call(r, a) || (r[a] = !0, n[a] = !0, T(e.outEdges(a), function(e) {
-			Object.prototype.hasOwnProperty.call(n, e.w) ? t.push(e) : i(e.w);
-		}), delete n[a]);
-	}
-	return T(e.nodes(), i), t;
-}
-function Br(e) {
-	T(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 = q(r);
-	while (e.hasNode(i));
-	return n.dummy = t, e.setNode(i, n), i;
-}
-function Vr(e) {
-	var t = new D().setGraph(e.graph());
-	return T(e.nodes(), function(n) {
-		t.setNode(n, e.node(n));
-	}), T(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 Hr(e) {
-	var t = new D({ multigraph: e.isMultigraph() }).setGraph(e.graph());
-	return T(e.nodes(), function(n) {
-		e.children(n).length || t.setNode(n, e.node(n));
-	}), T(e.edges(), function(n) {
-		t.setEdge(n, e.edge(n));
-	}), t;
-}
-function Ur(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 = R(G(qr(e) + 1), function() {
-		return [];
-	});
-	return T(e.nodes(), function(n) {
-		var r = e.node(n), i = r.rank;
-		E(i) || (t[i][r.order] = n);
-	}), t;
-}
-function Wr(e) {
-	var t = H(R(e.nodes(), function(t) {
-		return e.node(t).rank;
-	}));
-	T(e.nodes(), function(n) {
-		var r = e.node(n);
-		Un(r, "rank") && (r.rank -= t);
-	});
-}
-function Gr(e) {
-	var t = H(R(e.nodes(), function(t) {
-		return e.node(t).rank;
-	})), n = [];
-	T(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;
-	T(n, function(t, n) {
-		E(t) && n % i !== 0 ? --r : r && T(t, function(t) {
-			e.node(t).rank += r;
-		});
-	});
-}
-function Kr(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 qr(e) {
-	return V(R(e.nodes(), function(t) {
-		var n = e.node(t).rank;
-		if (!E(n)) return n;
-	}));
-}
-function Jr(e, t) {
-	var n = {
-		lhs: [],
-		rhs: []
-	};
-	return T(e, function(e) {
-		t(e) ? n.lhs.push(e) : n.rhs.push(e);
-	}), n;
-}
-function Yr(e, t) {
-	var n = An();
-	try {
-		return t();
-	} finally {
-		console.log(e + " time: " + (An() - n) + "ms");
-	}
-}
-function Xr(e, t) {
-	return t();
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/add-border-segments.js
-function Zr(e) {
-	function t(n) {
-		var r = e.children(n), i = e.node(n);
-		if (r.length && T(r, t), Object.prototype.hasOwnProperty.call(i, "minRank")) {
-			i.borderLeft = [], i.borderRight = [];
-			for (var a = i.minRank, o = i.maxRank + 1; a < o; ++a) Qr(e, "borderLeft", "_bl", n, i, a), Qr(e, "borderRight", "_br", n, i, a);
-		}
-	}
-	T(e.children(), t);
-}
-function Qr(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 $r(e) {
-	var t = e.graph().rankdir.toLowerCase();
-	(t === "lr" || t === "rl") && ti(e);
-}
-function ei(e) {
-	var t = e.graph().rankdir.toLowerCase();
-	(t === "bt" || t === "rl") && ri(e), (t === "lr" || t === "rl") && (ai(e), ti(e));
-}
-function ti(e) {
-	T(e.nodes(), function(t) {
-		ni(e.node(t));
-	}), T(e.edges(), function(t) {
-		ni(e.edge(t));
-	});
-}
-function ni(e) {
-	var t = e.width;
-	e.width = e.height, e.height = t;
-}
-function ri(e) {
-	T(e.nodes(), function(t) {
-		ii(e.node(t));
-	}), T(e.edges(), function(t) {
-		var n = e.edge(t);
-		T(n.points, ii), Object.prototype.hasOwnProperty.call(n, "y") && ii(n);
-	});
-}
-function ii(e) {
-	e.y = -e.y;
-}
-function ai(e) {
-	T(e.nodes(), function(t) {
-		oi(e.node(t));
-	}), T(e.edges(), function(t) {
-		var n = e.edge(t);
-		T(n.points, oi), Object.prototype.hasOwnProperty.call(n, "x") && oi(n);
-	});
-}
-function oi(e) {
-	var t = e.x;
-	e.x = e.y, e.y = t;
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/normalize.js
-function si(e) {
-	e.graph().dummyChains = [], T(e.edges(), function(t) {
-		ci(e, t);
-	});
-}
-function ci(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 li(e) {
-	T(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 ui(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 = H(R(e.outEdges(r), function(t) {
-			return n(t.w) - e.edge(t).minlen;
-		}));
-		return (a === Infinity || a == null) && (a = 0), i.rank = a;
-	}
-	T(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 di(e) {
-	var t = new D({ directed: !1 }), n = e.nodes()[0], r = e.nodeCount();
-	t.setNode(n, {});
-	for (var i, a; fi(t, e) < r;) i = pi(t, e), a = t.hasNode(i.v) ? Z(e, i) : -Z(e, i), mi(t, e, a);
-	return t;
-}
-function fi(e, t) {
-	function n(r) {
-		T(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 T(e.nodes(), n), e.nodeCount();
-}
-function pi(e, t) {
-	return qn(t.edges(), function(n) {
-		if (e.hasNode(n.v) !== e.hasNode(n.w)) return Z(t, n);
-	});
-}
-function mi(e, t, n) {
-	T(e.nodes(), function(e) {
-		t.node(e).rank += n;
-	});
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
-h(1), h(1), hi.CycleException = Q;
-function hi(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, T(e.predecessors(a), i), delete n[a], r.push(a));
-	}
-	if (T(e.sinks(), i), Er(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 gi(e, t, n) {
-	i(t) || (t = [t]);
-	var r = (e.isDirected() ? e.successors : e.neighbors).bind(e), a = [], o = {};
-	return T(t, function(t) {
-		if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
-		_i(e, t, n === "post", o, r, a);
-	}), a;
-}
-function _i(e, t, n, r, i, a) {
-	Object.prototype.hasOwnProperty.call(r, t) || (r[t] = !0, n || a.push(t), T(i(t), function(t) {
-		_i(e, t, n, r, i, a);
-	}), n && a.push(t));
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
-function vi(e, t) {
-	return gi(e, t, "post");
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
-function yi(e, t) {
-	return gi(e, t, "pre");
-}
-$.initLowLimValues = Ci, $.initCutValues = bi, $.calcCutValue = Si, $.leaveEdge = Ti, $.enterEdge = Ei, $.exchangeEdges = Di;
-function $(e) {
-	e = Vr(e), ui(e);
-	var t = di(e);
-	Ci(t), bi(t, e);
-	for (var n, r; n = Ti(t);) r = Ei(t, e, n), Di(t, e, n, r);
-}
-function bi(e, t) {
-	var n = vi(e, e.nodes());
-	n = n.slice(0, n.length - 1), T(n, function(n) {
-		xi(e, t, n);
-	});
-}
-function xi(e, t, n) {
-	var r = e.node(n).parent;
-	e.edge(n, r).cutvalue = Si(e, t, n);
-}
-function Si(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, T(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, ki(e, n, c)) {
-				var d = e.edge(n, c).cutvalue;
-				o += l ? -d : d;
-			}
-		}
-	}), o;
-}
-function Ci(e, t) {
-	arguments.length < 2 && (t = e.nodes()[0]), wi(e, {}, 1, t);
-}
-function wi(e, t, n, r, i) {
-	var a = n, o = e.node(r);
-	return t[r] = !0, T(e.neighbors(r), function(i) {
-		Object.prototype.hasOwnProperty.call(t, i) || (n = wi(e, t, n, i, r));
-	}), o.low = a, o.lim = n++, i ? o.parent = i : delete o.parent, n;
-}
-function Ti(e) {
-	return L(e.edges(), function(t) {
-		return e.edge(t).cutvalue < 0;
-	});
-}
-function Ei(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), qn(S(t.edges(), function(t) {
-		return c === Ai(e, e.node(t.v), s) && c !== Ai(e, e.node(t.w), s);
-	}), function(e) {
-		return Z(t, e);
-	});
-}
-function Di(e, t, n, r) {
-	var i = n.v, a = n.w;
-	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), Ci(e), bi(e, t), Oi(e, t);
-}
-function Oi(e, t) {
-	var n = yi(e, L(e.nodes(), function(e) {
-		return !t.node(e).parent;
-	}));
-	n = n.slice(1), T(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 ki(e, t, n) {
-	return e.hasEdge(t, n);
-}
-function Ai(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 ji(e) {
-	switch (e.graph().ranker) {
-		case "network-simplex":
-			Pi(e);
-			break;
-		case "tight-tree":
-			Ni(e);
-			break;
-		case "longest-path":
-			Mi(e);
-			break;
-		default: Pi(e);
-	}
-}
-var Mi = ui;
-function Ni(e) {
-	ui(e), di(e);
-}
-function Pi(e) {
-	$(e);
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/nesting-graph.js
-function Fi(e) {
-	var t = Y(e, "root", {}, "_root"), n = Li(e), r = V(C(n)) - 1, i = 2 * r + 1;
-	e.graph().nestingRoot = t, T(e.edges(), function(t) {
-		e.edge(t).minlen *= i;
-	});
-	var a = Ri(e) + 1;
-	T(e.children(), function(o) {
-		Ii(e, t, i, a, r, n, o);
-	}), e.graph().nodeRankFactor = i;
-}
-function Ii(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 = Kr(e, "_bt"), l = Kr(e, "_bb"), u = e.node(o);
-	e.setParent(c, o), u.borderTop = c, e.setParent(l, o), u.borderBottom = l, T(s, function(s) {
-		Ii(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 Li(e) {
-	var t = {};
-	function n(r, i) {
-		var a = e.children(r);
-		a && a.length && T(a, function(e) {
-			n(e, i + 1);
-		}), t[r] = i;
-	}
-	return T(e.children(), function(e) {
-		n(e, 1);
-	}), t;
-}
-function Ri(e) {
-	return w(e.edges(), function(t, n) {
-		return t + e.edge(n).weight;
-	}, 0);
-}
-function zi(e) {
-	var t = e.graph();
-	e.removeNode(t.nestingRoot), delete t.nestingRoot, T(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 Bi(e, t, n) {
-	var r = {}, i;
-	T(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 Vi(e, t, n) {
-	var r = Hi(e), i = new D({ compound: !0 }).setGraph({ root: r }).setDefaultNodeLabel(function(t) {
-		return e.node(t);
-	});
-	return T(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), T(e[n](a), function(t) {
-			var n = t.v === a ? t.w : t.v, r = i.edge(n, a), o = E(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 Hi(e) {
-	for (var t; e.hasNode(t = q("_root")););
-	return t;
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/order/cross-count.js
-function Ui(e, t) {
-	for (var n = 0, r = 1; r < t.length; ++r) n += Wi(e, t[r - 1], t[r]);
-	return n;
-}
-function Wi(e, t, n) {
-	for (var r = kr(n, R(n, function(e, t) {
-		return t;
-	})), i = N(R(t, function(t) {
-		return K(R(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 = R(Array(o), function() {
-		return 0;
-	}), c = 0;
-	return T(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 Gi(e) {
-	var t = {}, n = S(e.nodes(), function(t) {
-		return !e.children(t).length;
-	}), r = R(G(V(R(n, function(t) {
-		return e.node(t).rank;
-	})) + 1), function() {
-		return [];
-	});
-	function i(n) {
-		Un(t, n) || (t[n] = !0, r[e.node(n).rank].push(n), T(e.successors(n), i));
-	}
-	return T(K(n, function(t) {
-		return e.node(t).rank;
-	}), i), r;
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/order/barycenter.js
-function Ki(e, t) {
-	return R(t, function(t) {
-		var n = e.inEdges(t);
-		if (n.length) {
-			var r = w(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
-			};
-		} else return { v: t };
-	});
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
-function qi(e, t) {
-	var n = {};
-	return T(e, function(e, t) {
-		var r = n[e.v] = {
-			indegree: 0,
-			in: [],
-			out: [],
-			vs: [e.v],
-			i: t
-		};
-		E(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
-	}), T(t.edges(), function(e) {
-		var t = n[e.v], r = n[e.w];
-		!E(t) && !E(r) && (r.indegree++, t.out.push(n[e.w]));
-	}), Ji(S(n, function(e) {
-		return !e.indegree;
-	}));
-}
-function Ji(e) {
-	var t = [];
-	function n(e) {
-		return function(t) {
-			t.merged || (E(t.barycenter) || E(e.barycenter) || t.barycenter >= e.barycenter) && Yi(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), T(i.in.reverse(), n(i)), T(i.out, r(i));
-	}
-	return R(S(t, function(e) {
-		return !e.merged;
-	}), function(e) {
-		return W(e, [
-			"vs",
-			"i",
-			"barycenter",
-			"weight"
-		]);
-	});
-}
-function Yi(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 Xi(e, t) {
-	var n = Jr(e, function(e) {
-		return Object.prototype.hasOwnProperty.call(e, "barycenter");
-	}), r = n.lhs, i = K(n.rhs, function(e) {
-		return -e.i;
-	}), a = [], o = 0, s = 0, c = 0;
-	r.sort(Qi(!!t)), c = Zi(a, i, c), T(r, function(e) {
-		c += e.vs.length, a.push(e.vs), o += e.barycenter * e.weight, s += e.weight, c = Zi(a, i, c);
-	});
-	var l = { vs: N(a) };
-	return s && (l.barycenter = o / s, l.weight = s), l;
-}
-function Zi(e, t, n) {
-	for (var r; t.length && (r = I(t)).i <= n;) t.pop(), e.push(r.vs), n++;
-	return n;
-}
-function Qi(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 $i(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 = Ki(e, i);
-	T(l, function(t) {
-		if (e.children(t.v).length) {
-			var i = $i(e, t.v, n, r);
-			c[t.v] = i, Object.prototype.hasOwnProperty.call(i, "barycenter") && ta(t, i);
-		}
-	});
-	var u = qi(l, n);
-	ea(u, c);
-	var d = Xi(u, r);
-	if (o && (d.vs = N([
-		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 ea(e, t) {
-	T(e, function(e) {
-		e.vs = N(e.vs.map(function(e) {
-			return t[e] ? t[e].vs : e;
-		}));
-	});
-}
-function ta(e, t) {
-	E(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 na(e) {
-	var t = qr(e), n = ra(e, G(1, t + 1), "inEdges"), r = ra(e, G(t - 1, -1, -1), "outEdges"), i = Gi(e);
-	aa(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 = Ui(e, i);
-		l < a && (c = 0, o = kn(i), a = l);
-	}
-	aa(e, o);
-}
-function ra(e, t, n) {
-	return R(t, function(t) {
-		return Vi(e, t, n);
-	});
-}
-function ia(e, t) {
-	var n = new D();
-	T(e, function(e) {
-		var r = e.graph().root, i = $i(e, r, n, t);
-		T(i.vs, function(t, n) {
-			e.node(t).order = n;
-		}), Bi(e, n, i.vs);
-	});
-}
-function aa(e, t) {
-	T(t, function(t) {
-		T(t, function(t, n) {
-			e.node(t).order = n;
-		});
-	});
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
-function oa(e) {
-	var t = ca(e);
-	T(e.graph().dummyChains, function(n) {
-		for (var r = e.node(n), i = r.edgeObj, a = sa(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 sa(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 ca(e) {
-	var t = {}, n = 0;
-	function r(i) {
-		var a = n;
-		T(e.children(i), r), t[i] = {
-			low: a,
-			lim: n++
-		};
-	}
-	return T(e.children(), r), t;
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/position/bk.js
-function la(e, t) {
-	var n = {};
-	function r(t, r) {
-		var i = 0, a = 0, o = t.length, s = I(r);
-		return T(r, function(t, c) {
-			var l = da(e, t), u = l ? e.node(l).order : o;
-			(l || t === s) && (T(r.slice(a, c + 1), function(t) {
-				T(e.predecessors(t), function(r) {
-					var a = e.node(r), o = a.order;
-					(o < i || u < o) && !(a.dummy && e.node(t).dummy) && fa(n, r, t);
-				});
-			}), a = c + 1, i = u);
-		}), r;
-	}
-	return w(t, r), n;
-}
-function ua(e, t) {
-	var n = {};
-	function r(t, r, i, a, o) {
-		var s;
-		T(G(r, i), function(r) {
-			s = t[r], e.node(s).dummy && T(e.predecessors(s), function(t) {
-				var r = e.node(t);
-				r.dummy && (r.order < a || r.order > o) && fa(n, t, s);
-			});
-		});
-	}
-	function i(t, n) {
-		var i = -1, a, o = 0;
-		return T(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 w(t, i), n;
-}
-function da(e, t) {
-	if (e.node(t).dummy) return L(e.predecessors(t), function(t) {
-		return e.node(t).dummy;
-	});
-}
-function fa(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 pa(e, t, n) {
-	if (t > n) {
-		var r = t;
-		t = n, n = r;
-	}
-	return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
-}
-function ma(e, t, n, r) {
-	var i = {}, a = {}, o = {};
-	return T(t, function(e) {
-		T(e, function(e, t) {
-			i[e] = e, a[e] = e, o[e] = t;
-		});
-	}), T(t, function(e) {
-		var t = -1;
-		T(e, function(e) {
-			var s = r(e);
-			if (s.length) {
-				s = K(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] && !pa(n, e, d) && (a[d] = e, a[e] = i[e] = i[d], t = o[d]);
-				}
-			}
-		});
-	}), {
-		root: i,
-		align: a
-	};
-}
-function ha(e, t, n, r, i) {
-	var a = {}, o = ga(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)), T(r, function(e) {
-		a[e] = a[n[e]];
-	}), a;
-}
-function ga(e, t, n, r) {
-	var i = new D(), a = e.graph(), o = xa(a.nodesep, a.edgesep, r);
-	return T(t, function(t) {
-		var r;
-		T(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 _a(e, t) {
-	return qn(C(t), function(t) {
-		var n = -Infinity, r = Infinity;
-		return Rn(t, function(t, i) {
-			var a = Sa(e, i) / 2;
-			n = Math.max(t + a, n), r = Math.min(t - a, r);
-		}), n - r;
-	});
-}
-function va(e, t) {
-	var n = C(t), r = H(n), i = V(n);
-	T(["u", "d"], function(n) {
-		T(["l", "r"], function(a) {
-			var o = n + a, s = e[o], c;
-			if (s !== t) {
-				var l = C(s);
-				c = a === "l" ? r - H(l) : i - V(l), c && (e[o] = z(s, function(e) {
-					return e + c;
-				}));
-			}
-		});
-	});
-}
-function ya(e, t) {
-	return z(e.ul, function(n, r) {
-		if (t) return e[t.toLowerCase()][r];
-		var i = K(R(e, r));
-		return (i[1] + i[2]) / 2;
-	});
-}
-function ba(e) {
-	var t = X(e), n = b(la(e, t), ua(e, t)), r = {}, i;
-	return T(["u", "d"], function(a) {
-		i = a === "u" ? t : C(t).reverse(), T(["l", "r"], function(t) {
-			t === "r" && (i = R(i, function(e) {
-				return C(e).reverse();
-			}));
-			var o = (a === "u" ? e.predecessors : e.successors).bind(e), s = ma(e, i, n, o), c = ha(e, i, s.root, s.align, t === "r");
-			t === "r" && (c = z(c, function(e) {
-				return -e;
-			})), r[a + t] = c;
-		});
-	}), va(r, _a(e, r)), ya(r, e.graph().align);
-}
-function xa(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;
-				break;
-		}
-		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;
-				break;
-		}
-		return l && (c += n ? l : -l), l = 0, c;
-	};
-}
-function Sa(e, t) {
-	return e.node(t).width;
-}
-//#endregion
-//#region node_modules/dagre-d3-es/src/dagre/position/index.js
-function Ca(e) {
-	e = Hr(e), wa(e), zn(ba(e), function(t, n) {
-		e.node(n).x = t;
-	});
-}
-function wa(e) {
-	var t = X(e), n = e.graph().ranksep, r = 0;
-	T(t, function(t) {
-		var i = V(R(t, function(t) {
-			return e.node(t).height;
-		}));
-		T(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 Ta(e, t) {
-	var n = t && t.debugTiming ? Yr : Xr;
-	n("layout", () => {
-		var t = n("  buildLayoutGraph", () => Ia(e));
-		n("  runLayout", () => Ea(t, n)), n("  updateInputGraph", () => Da(e, t));
-	});
-}
-function Ea(e, t) {
-	t("    makeSpaceForEdgeLabels", () => La(e)), t("    removeSelfEdges", () => Ka(e)), t("    acyclic", () => Rr(e)), t("    nestingGraph.run", () => Fi(e)), t("    rank", () => ji(Hr(e))), t("    injectEdgeLabelProxies", () => Ra(e)), t("    removeEmptyRanks", () => Gr(e)), t("    nestingGraph.cleanup", () => zi(e)), t("    normalizeRanks", () => Wr(e)), t("    assignRankMinMax", () => za(e)), t("    removeEdgeLabelProxies", () => Ba(e)), t("    normalize.run", () => si(e)), t("    parentDummyChains", () => oa(e)), t("    addBorderSegments", () => Zr(e)), t("    order", () => na(e)), t("    insertSelfEdges", () => qa(e)), t("    adjustCoordinateSystem", () => $r(e)), t("    position", () => Ca(e)), t("    positionSelfEdges", () => Ja(e)), t("    removeBorderNodes", () => Ga(e)), t("    normalize.undo", () => li(e)), t("    fixupEdgeLabelCoords", () => Ua(e)), t("    undoCoordinateSystem", () => ei(e)), t("    translateGraph", () => Va(e)), t("    assignNodeIntersects", () => Ha(e)), t("    reversePoints", () => Wa(e)), t("    acyclic.undo", () => Br(e));
-}
-function Da(e, t) {
-	T(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));
-	}), T(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 Oa = [
-	"nodesep",
-	"edgesep",
-	"ranksep",
-	"marginx",
-	"marginy"
-], ka = {
-	ranksep: 50,
-	edgesep: 20,
-	nodesep: 50,
-	rankdir: "tb"
-}, Aa = [
-	"acyclicer",
-	"ranker",
-	"rankdir",
-	"align"
-], ja = ["width", "height"], Ma = {
-	width: 0,
-	height: 0
-}, Na = [
-	"minlen",
-	"weight",
-	"width",
-	"height",
-	"labeloffset"
-], Pa = {
-	minlen: 1,
-	weight: 1,
-	width: 0,
-	height: 0,
-	labeloffset: 10,
-	labelpos: "r"
-}, Fa = ["labelpos"];
-function Ia(e) {
-	var t = new D({
-		multigraph: !0,
-		compound: !0
-	}), n = Xa(e.graph());
-	return t.setGraph(b({}, ka, Ya(n, Oa), W(n, Aa))), T(e.nodes(), function(n) {
-		var r = Xa(e.node(n));
-		t.setNode(n, Nn(Ya(r, ja), Ma)), t.setParent(n, e.parent(n));
-	}), T(e.edges(), function(n) {
-		var r = Xa(e.edge(n));
-		t.setEdge(n, b({}, Pa, Ya(r, Na), W(r, Fa)));
-	}), t;
-}
-function La(e) {
-	var t = e.graph();
-	t.ranksep /= 2, T(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 Ra(e) {
-	T(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 za(e) {
-	var t = 0;
-	T(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 = V(t, r.maxRank));
-	}), e.graph().maxRank = t;
-}
-function Ba(e) {
-	T(e.nodes(), function(t) {
-		var n = e.node(t);
-		n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
-	});
-}
-function Va(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);
-	}
-	T(e.nodes(), function(t) {
-		c(e.node(t));
-	}), T(e.edges(), function(t) {
-		var n = e.edge(t);
-		Object.prototype.hasOwnProperty.call(n, "x") && c(n);
-	}), t -= o, r -= s, T(e.nodes(), function(n) {
-		var i = e.node(n);
-		i.x -= t, i.y -= r;
-	}), T(e.edges(), function(n) {
-		var i = e.edge(n);
-		T(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 Ha(e) {
-	T(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(Ur(r, a)), n.points.push(Ur(i, o));
-	});
-}
-function Ua(e) {
-	T(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;
-				break;
-		}
-	});
-}
-function Wa(e) {
-	T(e.edges(), function(t) {
-		var n = e.edge(t);
-		n.reversed && n.points.reverse();
-	});
-}
-function Ga(e) {
-	T(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(I(n.borderLeft)), o = e.node(I(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;
-		}
-	}), T(e.nodes(), function(t) {
-		e.node(t).dummy === "border" && e.removeNode(t);
-	});
-}
-function Ka(e) {
-	T(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 qa(e) {
-	T(X(e), function(t) {
-		var n = 0;
-		T(t, function(t, r) {
-			var i = e.node(t);
-			i.order = r + n, T(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 Ja(e) {
-	T(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 Ya(e, t) {
-	return z(W(e, t), Number);
-}
-function Xa(e) {
-	var t = {};
-	return T(e, function(e, n) {
-		t[n.toLowerCase()] = e;
-	}), t;
-}
-//#endregion
-//#region node_modules/mermaid/dist/chunks/mermaid.core/dagre-6A5THRUB.mjs
-var Za = /* @__PURE__ */ A((e, t, n) => Math.max(t, Math.min(n, e)), "clamp"), Qa = /* @__PURE__ */ A((e = "TB") => {
-	switch (e) {
-		case "BT": return "bottom";
-		case "LR": return "right";
-		case "RL": return "left";
-		default: return "top";
-	}
-}, "getDefaultSelfLoopSide"), $a = /* @__PURE__ */ A((e) => e === "flowchart" || e === "flowchart-v2" || e === "stateDiagram" || e === "er" || e === "classDiagram", "shouldMergeSelfLoopSegments"), eo = [
-	"x",
-	"y",
-	"width",
-	"height",
-	"labelBBox",
-	"intersect",
-	"calcIntersect",
-	"diff",
-	"clusterNode"
-], to = /* @__PURE__ */ A((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 Qa(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" : Qa(i);
-}, "getSelfLoopSide"), no = /* @__PURE__ */ A((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 = Za(Math.max(r, e.width * .35), 36, c), u = Za(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"), ro = /* @__PURE__ */ A((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"), io = /* @__PURE__ */ A((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 = to(e, l, n, c.start, a), f = no(l, d, t, u.width ?? 0), p = ro(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"), ao = /* @__PURE__ */ A(async ({ element: e, graph: t, diagramType: n, id: r, parentCluster: i, siteConfig: a }) => {
-	let o = t.graph().rankdir;
-	k.trace("Dir in recursive render - dir:", o);
-	let { clusters: s, edgePaths: c, edgeLabels: l, nodes: u, rootGroups: d } = He(e, { edgePathsClass: "edgePaths" });
-	t.nodes() ? k.info("Recursive render XXX", t.nodes()) : k.info("No nodes found for", t), t.edges().length > 0 && k.info("Recursive edges", t.edge(t.edges()[0]));
-	let f = $a(n);
-	await Promise.all(t.nodes().map(async function(e) {
-		let s = t.node(e);
-		if (i !== void 0) {
-			let n = JSON.parse(JSON.stringify(i.clusterData));
-			k.trace("Setting data for parent cluster XXX\n Node.id = ", e, "\n data=", n.height, "\nParent cluster", i.height), t.setNode(i.id, n), t.parent(e) || (k.trace("Setting parent", e, i.id), t.setParent(e, i.id, n));
-		}
-		if (k.info("(Insert) Node XXX" + e + ": " + JSON.stringify(t.node(e))), s?.clusterNode) {
-			k.info("Cluster identified XBX", e, s.width, t.node(e));
-			let { ranksep: i, nodesep: o } = t.graph();
-			s.graph.setGraph({
-				...s.graph.graph(),
-				ranksep: i + 25,
-				nodesep: o
-			});
-			let c = await po({
-				element: u,
-				graph: s.graph,
-				diagramType: n,
-				id: r,
-				parentCluster: t.node(e),
-				siteConfig: a
-			}), l = c.elem;
-			Ne(s, l), s.diff = c.diff || 0, k.info("New compound node after recursive render XAX", e, "width", s.width, "height", s.height), Pe(l, s);
-		} else t.children(e).length > 0 ? (k.trace("Cluster - the non recursive path XBX", e, s.id, s, s.width, "Graph:", t), k.trace(Ue(s.id, t)), j.set(s.id, {
-			id: Ue(s.id, t),
-			node: s
-		})) : (k.trace("Node - the non recursive path XAX", e, u, t.node(e), o), await Ge(u, t.node(e), {
-			config: a,
-			dir: o
-		}));
-	})), await (/* @__PURE__ */ A(async () => {
-		let e = t.edges().map(async function(e) {
-			let n = t.edge(e.v, e.w, e.name);
-			if (k.info("Edge " + e.v + " -> " + e.w + ": " + JSON.stringify(e)), k.info("Edge " + e.v + " -> " + e.w + ": ", e, " ", JSON.stringify(t.edge(e))), k.info("Fix", j, "ids:", e.v, e.w, "Translating: ", j.get(e.v), j.get(e.w)), f && 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 Le(l, e), n.width = e.width, n.height = e.height, n.labelStyle = e.labelStyle;
-				return;
-			}
-			await Le(l, n);
-		});
-		await Promise.all(e);
-	}, "processEdges"))();
-	let { subGraphTitleTotalMargin: p } = Ie(a);
-	return {
-		elem: d,
-		graph: t,
-		groups: {
-			clusters: s,
-			edgePaths: c,
-			edgeLabels: l,
-			nodes: u,
-			rootGroups: d
-		},
-		diagramType: n,
-		id: r,
-		mergeSelfLoops: f,
-		subGraphTitleTotalMargin: p
-	};
-}, "measureDagreGraph"), oo = /* @__PURE__ */ A((e) => {
-	k.info("############################################# XXX"), k.info("###                Layout                 ### XXX"), k.info("############################################# XXX"), Ta(e);
-}, "runDagreGraphLayout"), so = /* @__PURE__ */ A((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"), co = /* @__PURE__ */ A((e, t) => {
-	eo.forEach((n) => {
-		t[n] !== void 0 && (e[n] = t[n]);
-	});
-}, "applyDagreNodeLayout"), lo = /* @__PURE__ */ A((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__ */ A((e, t) => {
-	let { graph: n, mergeSelfLoops: r, subGraphTitleTotalMargin: i = 0 } = t, a = new Map(e.nodes.map((e) => [e.id, e]));
-	Ve(n).forEach((e) => {
-		let t = so(n, e, i);
-		if (!t) return;
-		co(n.node(e), t);
-		let r = a.get(e);
-		r && co(r, t);
-	});
-	let o = i / 2;
-	return e.edges = io(n, o, { mergeSelfLoops: r }).map(({ edge: e, start: t, end: n }) => lo(e, t, n, o)), e;
-}, "applyDagreLayoutResult"), fo = /* @__PURE__ */ A(async ({ elem: e, graph: t, groups: { clusters: n, edgePaths: r }, diagramType: i, id: a, mergeSelfLoops: o, subGraphTitleTotalMargin: s }) => {
-	let c = 0;
-	await Promise.all(Ve(t).map(async function(e) {
-		let r = t.node(e);
-		if (k.info("Position XBX => " + e + ": (" + r.x, "," + r.y, ") width: ", r.width, " height: ", r.height), r?.clusterNode) r.y += s, k.info("A tainted cluster node XBX1", e, r.id, r.width, r.height, r.x, r.y, t.parent(e)), j.get(r.id).node = r, Fe(r);
-		else if (t.children(e).length > 0) {
-			k.info("A pure cluster node XBX1", e, r.id, r.x, r.y, r.width, r.height, t.parent(e)), r.height += s, t.node(r.parentId);
-			let i = r?.padding / 2 || 0, a = r?.labelBBox?.height || 0, o = a - i || 0;
-			k.debug("OffsetY", o, "labelHeight", a, "halfPadding", i), await Be(n, r), j.get(r.id).node = r;
-		} else {
-			let e = t.node(r.parentId);
-			r.y += s / 2, k.info("A regular node XBX1 - using the padding", r.id, "parent", r.parentId, r.width, r.height, r.x, r.y, "offsetY", r.offsetY, "parent", e, e?.offsetY, r), Fe(r);
-		}
-	}));
-	let l = s / 2;
-	return io(t, l, { mergeSelfLoops: o }).forEach(function({ edge: e, start: n, end: o }) {
-		k.info("Edge " + n + " -> " + o + ": " + JSON.stringify(e), e), e.points.forEach((e) => e.y += l), ze(e, Re(r, e, j, i, t.node(n), t.node(o), a));
-	}), t.nodes().forEach(function(e) {
-		let n = t.node(e);
-		k.info(e, n.type, n.diff), n.isGroup && (c = n.diff);
-	}), k.warn("Returning from recursive render XAX", e, c), {
-		elem: e,
-		diff: c
-	};
-}, "paintDagreLayoutCore"), po = /* @__PURE__ */ A(async (e) => {
-	let t = await ao(e);
-	return oo(t.graph), await fo(t);
-}, "renderDagreSubgraph"), mo = /* @__PURE__ */ A((e) => {
-	let t = new D({
-		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) => {
-		t.setNode(e.id, { ...e }), e.parentId && t.setParent(e.id, e.parentId);
-	}), k.debug("Edges:", e.edges), e.edges.forEach((e) => {
-		if (e.start === e.end) {
-			let n = e.start, r = n + "---" + n + "---1", i = n + "---" + n + "---2", a = t.node(n);
-			t.setNode(r, {
-				domId: r,
-				id: r,
-				parentId: a.parentId,
-				labelStyle: "",
-				label: "",
-				padding: 0,
-				shape: "labelRect",
-				style: "",
-				width: 10,
-				height: 10
-			}), t.setParent(r, a.parentId), t.setNode(i, {
-				domId: i,
-				id: i,
-				parentId: a.parentId,
-				labelStyle: "",
-				padding: 0,
-				shape: "labelRect",
-				label: "",
-				style: "",
-				width: 10,
-				height: 10
-			}), t.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 = n + "-cyclic-special-1", c.startLabelRight = "", c.startLabelLeft = "", c.endLabelLeft = "", c.endLabelRight = "", c.arrowTypeStart = "none", c.arrowTypeEnd = "none", c.id = n + "-cyclic-special-mid", l.label = "", l.startLabelRight = "", l.startLabelLeft = "", l.arrowTypeStart = "none", a.isGroup && (s.fromCluster = n, l.toCluster = n), l.id = n + "-cyclic-special-2", l.arrowTypeStart = "none", t.setEdge(n, r, s, n + "-cyclic-special-0"), t.setEdge(r, i, c, n + "-cyclic-special-1"), t.setEdge(i, n, l, n + "-cyclic-special-2");
-		} else t.setEdge(e.start, e.end, { ...e }, e.id);
-	}), Ke(t), { graph: t };
-}, "prepareLayoutForDagre"), ho = /* @__PURE__ */ A(async (e, { element: t, preparedLayout: n }) => {
-	let r = n ?? mo(e), i = Me(), a = await ao({
-		element: t,
-		graph: r.graph,
-		diagramType: e.type,
-		id: e.diagramId,
-		parentCluster: void 0,
-		siteConfig: i
-	});
-	return r.measuredLayout = a, a;
-}, "measureDagreLayout"), go = /* @__PURE__ */ A((e, t) => {
-	let n = t.preparedLayout?.measuredLayout;
-	if (!n) throw Error("runDagreLayoutCore requires measureDagreLayout to run first");
-	return oo(n.graph), uo(e, n), n;
-}, "runDagreLayoutCore"), _o = We({
-	prepareLayout: mo,
-	measureLayout: ho,
-	runLayoutCore: go,
-	paintOptions: {
-		clusterDb: j,
-		getNodes: /* @__PURE__ */ A((e, { measure: t }) => Ve(t.graph).map((e) => t.graph.node(e)).filter(Boolean), "getDagrePaintNodes"),
-		getEdgeNode: /* @__PURE__ */ A((e, t, { measure: n }) => e ? n.graph.node(e) : void 0, "getDagreEdgeNode"),
-		skipNode: /* @__PURE__ */ A((e, { measure: t }) => !t.graph.hasNode(e.id), "skipNode"),
-		isCluster: /* @__PURE__ */ A((e, { measure: t }) => t.graph.hasNode(e.id) && (t.graph.children(e.id) ?? []).length > 0, "isCluster")
-	}
-});
-//#endregion
-export { uo as applyDagreLayoutResult, io as getEdgesToRender, ho as measureDagreLayout, mo as prepareLayoutForDagre, _o as render, go as runDagreLayoutCore };