@spteck/react-controls-v2 2.3.7 → 2.3.8

package/dist/dagre-Dd8wCGc6.js

@@ -0,0 +1,1305 @@
+import { t as e } from "./graphlib-CPo7oIsu.js";
+import * as t from "lodash-es";
+//#region node_modules/dagre-d3-es/src/dagre/data/list.js
+var n = class {
+	constructor() {
+		var e = {};
+		e._next = e._prev = e, this._sentinel = e;
+	}
+	dequeue() {
+		var e = this._sentinel, t = e._prev;
+		if (t !== e) return r(t), t;
+	}
+	enqueue(e) {
+		var t = this._sentinel;
+		e._prev && e._next && r(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, i)), n = n._prev;
+		return "[" + e.join(", ") + "]";
+	}
+};
+function r(e) {
+	e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function i(e, t) {
+	if (e !== "_next" && e !== "_prev") return t;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/greedy-fas.js
+var a = t.constant(1);
+function o(e, n) {
+	if (e.nodeCount() <= 1) return [];
+	var r = l(e, n || a), i = s(r.graph, r.buckets, r.zeroIdx);
+	return t.flatten(t.map(i, function(t) {
+		return e.outEdges(t.v, t.w);
+	}));
+}
+function s(e, t, n) {
+	for (var r = [], i = t[t.length - 1], a = t[0], o; e.nodeCount();) {
+		for (; o = a.dequeue();) c(e, t, n, o);
+		for (; o = i.dequeue();) c(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(c(e, t, n, o, !0));
+				break;
+			}
+		}
+	}
+	return r;
+}
+function c(e, n, r, i, a) {
+	var o = a ? [] : void 0;
+	return t.forEach(e.inEdges(i.v), function(t) {
+		var i = e.edge(t), s = e.node(t.v);
+		a && o.push({
+			v: t.v,
+			w: t.w
+		}), s.out -= i, u(n, r, s);
+	}), t.forEach(e.outEdges(i.v), function(t) {
+		var i = e.edge(t), a = t.w, o = e.node(a);
+		o.in -= i, u(n, r, o);
+	}), e.removeNode(i.v), o;
+}
+function l(r, i) {
+	var a = new e(), o = 0, s = 0;
+	t.forEach(r.nodes(), function(e) {
+		a.setNode(e, {
+			v: e,
+			in: 0,
+			out: 0
+		});
+	}), t.forEach(r.edges(), function(e) {
+		var t = a.edge(e.v, e.w) || 0, n = i(e), r = t + n;
+		a.setEdge(e.v, e.w, r), s = Math.max(s, a.node(e.v).out += n), o = Math.max(o, a.node(e.w).in += n);
+	});
+	var c = t.range(s + o + 3).map(function() {
+		return new n();
+	}), l = o + 1;
+	return t.forEach(a.nodes(), function(e) {
+		u(c, l, a.node(e));
+	}), {
+		graph: a,
+		buckets: c,
+		zeroIdx: l
+	};
+}
+function u(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 d(e) {
+	var n = e.graph().acyclicer === "greedy" ? o(e, r(e)) : f(e);
+	t.forEach(n, function(n) {
+		var r = e.edge(n);
+		e.removeEdge(n), r.forwardName = n.name, r.reversed = !0, e.setEdge(n.w, n.v, r, t.uniqueId("rev"));
+	});
+	function r(e) {
+		return function(t) {
+			return e.edge(t).weight;
+		};
+	}
+}
+function f(e) {
+	var n = [], r = {}, i = {};
+	function a(o) {
+		Object.prototype.hasOwnProperty.call(i, o) || (i[o] = !0, r[o] = !0, t.forEach(e.outEdges(o), function(e) {
+			Object.prototype.hasOwnProperty.call(r, e.w) ? n.push(e) : a(e.w);
+		}), delete r[o]);
+	}
+	return t.forEach(e.nodes(), a), n;
+}
+function p(e) {
+	t.forEach(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 m(e, n, r, i) {
+	var a;
+	do
+		a = t.uniqueId(i);
+	while (e.hasNode(a));
+	return r.dummy = n, e.setNode(a, r), a;
+}
+function ee(n) {
+	var r = new e().setGraph(n.graph());
+	return t.forEach(n.nodes(), function(e) {
+		r.setNode(e, n.node(e));
+	}), t.forEach(n.edges(), function(e) {
+		var t = r.edge(e.v, e.w) || {
+			weight: 0,
+			minlen: 1
+		}, i = n.edge(e);
+		r.setEdge(e.v, e.w, {
+			weight: t.weight + i.weight,
+			minlen: Math.max(t.minlen, i.minlen)
+		});
+	}), r;
+}
+function h(n) {
+	var r = new e({ multigraph: n.isMultigraph() }).setGraph(n.graph());
+	return t.forEach(n.nodes(), function(e) {
+		n.children(e).length || r.setNode(e, n.node(e));
+	}), t.forEach(n.edges(), function(e) {
+		r.setEdge(e, n.edge(e));
+	}), r;
+}
+function g(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 _(e) {
+	var n = t.map(t.range(b(e) + 1), function() {
+		return [];
+	});
+	return t.forEach(e.nodes(), function(r) {
+		var i = e.node(r), a = i.rank;
+		t.isUndefined(a) || (n[a][i.order] = r);
+	}), n;
+}
+function v(e) {
+	var n = t.min(t.map(e.nodes(), function(t) {
+		return e.node(t).rank;
+	}));
+	t.forEach(e.nodes(), function(r) {
+		var i = e.node(r);
+		t.has(i, "rank") && (i.rank -= n);
+	});
+}
+function te(e) {
+	var n = t.min(t.map(e.nodes(), function(t) {
+		return e.node(t).rank;
+	})), r = [];
+	t.forEach(e.nodes(), function(t) {
+		var i = e.node(t).rank - n;
+		r[i] || (r[i] = []), r[i].push(t);
+	});
+	var i = 0, a = e.graph().nodeRankFactor;
+	t.forEach(r, function(n, r) {
+		t.isUndefined(n) && r % a !== 0 ? --i : i && t.forEach(n, function(t) {
+			e.node(t).rank += i;
+		});
+	});
+}
+function y(e, t, n, r) {
+	var i = {
+		width: 0,
+		height: 0
+	};
+	return arguments.length >= 4 && (i.rank = n, i.order = r), m(e, "border", i, t);
+}
+function b(e) {
+	return t.max(t.map(e.nodes(), function(n) {
+		var r = e.node(n).rank;
+		if (!t.isUndefined(r)) return r;
+	}));
+}
+function x(e, n) {
+	var r = {
+		lhs: [],
+		rhs: []
+	};
+	return t.forEach(e, function(e) {
+		n(e) ? r.lhs.push(e) : r.rhs.push(e);
+	}), r;
+}
+function ne(e, n) {
+	var r = t.now();
+	try {
+		return n();
+	} finally {
+		console.log(e + " time: " + (t.now() - r) + "ms");
+	}
+}
+function re(e, t) {
+	return t();
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/add-border-segments.js
+function ie(e) {
+	function n(r) {
+		var i = e.children(r), a = e.node(r);
+		if (i.length && t.forEach(i, n), Object.prototype.hasOwnProperty.call(a, "minRank")) {
+			a.borderLeft = [], a.borderRight = [];
+			for (var o = a.minRank, s = a.maxRank + 1; o < s; ++o) S(e, "borderLeft", "_bl", r, a, o), S(e, "borderRight", "_br", r, a, o);
+		}
+	}
+	t.forEach(e.children(), n);
+}
+function S(e, t, n, r, i, a) {
+	var o = {
+		width: 0,
+		height: 0,
+		rank: a,
+		borderType: t
+	}, s = i[t][a - 1], c = m(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 ae(e) {
+	var t = e.graph().rankdir.toLowerCase();
+	(t === "lr" || t === "rl") && C(e);
+}
+function oe(e) {
+	var t = e.graph().rankdir.toLowerCase();
+	(t === "bt" || t === "rl") && T(e), (t === "lr" || t === "rl") && (se(e), C(e));
+}
+function C(e) {
+	t.forEach(e.nodes(), function(t) {
+		w(e.node(t));
+	}), t.forEach(e.edges(), function(t) {
+		w(e.edge(t));
+	});
+}
+function w(e) {
+	var t = e.width;
+	e.width = e.height, e.height = t;
+}
+function T(e) {
+	t.forEach(e.nodes(), function(t) {
+		E(e.node(t));
+	}), t.forEach(e.edges(), function(n) {
+		var r = e.edge(n);
+		t.forEach(r.points, E), Object.prototype.hasOwnProperty.call(r, "y") && E(r);
+	});
+}
+function E(e) {
+	e.y = -e.y;
+}
+function se(e) {
+	t.forEach(e.nodes(), function(t) {
+		D(e.node(t));
+	}), t.forEach(e.edges(), function(n) {
+		var r = e.edge(n);
+		t.forEach(r.points, D), Object.prototype.hasOwnProperty.call(r, "x") && D(r);
+	});
+}
+function D(e) {
+	var t = e.x;
+	e.x = e.y, e.y = t;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/normalize.js
+function ce(e) {
+	e.graph().dummyChains = [], t.forEach(e.edges(), function(t) {
+		le(e, t);
+	});
+}
+function le(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 = m(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 ue(e) {
+	t.forEach(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 O(e) {
+	var n = {};
+	function r(i) {
+		var a = e.node(i);
+		if (Object.prototype.hasOwnProperty.call(n, i)) return a.rank;
+		n[i] = !0;
+		var o = t.min(t.map(e.outEdges(i), function(t) {
+			return r(t.w) - e.edge(t).minlen;
+		}));
+		return (o === Infinity || o == null) && (o = 0), a.rank = o;
+	}
+	t.forEach(e.sources(), r);
+}
+function k(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 A(t) {
+	var n = new e({ directed: !1 }), r = t.nodes()[0], i = t.nodeCount();
+	n.setNode(r, {});
+	for (var a, o; de(n, t) < i;) a = fe(n, t), o = n.hasNode(a.v) ? k(t, a) : -k(t, a), pe(n, t, o);
+	return n;
+}
+function de(e, n) {
+	function r(i) {
+		t.forEach(n.nodeEdges(i), function(t) {
+			var a = t.v, o = i === a ? t.w : a;
+			!e.hasNode(o) && !k(n, t) && (e.setNode(o, {}), e.setEdge(i, o, {}), r(o));
+		});
+	}
+	return t.forEach(e.nodes(), r), e.nodeCount();
+}
+function fe(e, n) {
+	return t.minBy(n.edges(), function(t) {
+		if (e.hasNode(t.v) !== e.hasNode(t.w)) return k(n, t);
+	});
+}
+function pe(e, n, r) {
+	t.forEach(e.nodes(), function(e) {
+		n.node(e).rank += r;
+	});
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
+t.constant(1), t.constant(1), me.CycleException = j;
+function me(e) {
+	var n = {}, r = {}, i = [];
+	function a(o) {
+		if (Object.prototype.hasOwnProperty.call(r, o)) throw new j();
+		Object.prototype.hasOwnProperty.call(n, o) || (r[o] = !0, n[o] = !0, t.each(e.predecessors(o), a), delete r[o], i.push(o));
+	}
+	if (t.each(e.sinks(), a), t.size(n) !== e.nodeCount()) throw new j();
+	return i;
+}
+function j() {}
+j.prototype = /* @__PURE__ */ Error();
+//#endregion
+//#region node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
+function M(e, n, r) {
+	t.isArray(n) || (n = [n]);
+	var i = (e.isDirected() ? e.successors : e.neighbors).bind(e), a = [], o = {};
+	return t.each(n, function(t) {
+		if (!e.hasNode(t)) throw Error("Graph does not have node: " + t);
+		N(e, t, r === "post", o, i, a);
+	}), a;
+}
+function N(e, n, r, i, a, o) {
+	Object.prototype.hasOwnProperty.call(i, n) || (i[n] = !0, r || o.push(n), t.each(a(n), function(t) {
+		N(e, t, r, i, a, o);
+	}), r && o.push(n));
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
+function he(e, t) {
+	return M(e, t, "post");
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
+function ge(e, t) {
+	return M(e, t, "pre");
+}
+P.initLowLimValues = R, P.initCutValues = F, P.calcCutValue = L, P.leaveEdge = B, P.enterEdge = V, P.exchangeEdges = H;
+function P(e) {
+	e = ee(e), O(e);
+	var t = A(e);
+	R(t), F(t, e);
+	for (var n, r; n = B(t);) r = V(t, e, n), H(t, e, n, r);
+}
+function F(e, n) {
+	var r = he(e, e.nodes());
+	r = r.slice(0, r.length - 1), t.forEach(r, function(t) {
+		I(e, n, t);
+	});
+}
+function I(e, t, n) {
+	var r = e.node(n).parent;
+	e.edge(n, r).cutvalue = L(e, t, n);
+}
+function L(e, n, r) {
+	var i = e.node(r).parent, a = !0, o = n.edge(r, i), s = 0;
+	return o ||= (a = !1, n.edge(i, r)), s = o.weight, t.forEach(n.nodeEdges(r), function(t) {
+		var o = t.v === r, c = o ? t.w : t.v;
+		if (c !== i) {
+			var l = o === a, u = n.edge(t).weight;
+			if (s += l ? u : -u, ve(e, r, c)) {
+				var d = e.edge(r, c).cutvalue;
+				s += l ? -d : d;
+			}
+		}
+	}), s;
+}
+function R(e, t) {
+	arguments.length < 2 && (t = e.nodes()[0]), z(e, {}, 1, t);
+}
+function z(e, n, r, i, a) {
+	var o = r, s = e.node(i);
+	return n[i] = !0, t.forEach(e.neighbors(i), function(t) {
+		Object.prototype.hasOwnProperty.call(n, t) || (r = z(e, n, r, t, i));
+	}), s.low = o, s.lim = r++, a ? s.parent = a : delete s.parent, r;
+}
+function B(e) {
+	return t.find(e.edges(), function(t) {
+		return e.edge(t).cutvalue < 0;
+	});
+}
+function V(e, n, r) {
+	var i = r.v, a = r.w;
+	n.hasEdge(i, a) || (i = r.w, a = r.v);
+	var o = e.node(i), s = e.node(a), c = o, l = !1;
+	o.lim > s.lim && (c = s, l = !0);
+	var u = t.filter(n.edges(), function(t) {
+		return l === U(e, e.node(t.v), c) && l !== U(e, e.node(t.w), c);
+	});
+	return t.minBy(u, function(e) {
+		return k(n, e);
+	});
+}
+function H(e, t, n, r) {
+	var i = n.v, a = n.w;
+	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), R(e), F(e, t), _e(e, t);
+}
+function _e(e, n) {
+	var r = ge(e, t.find(e.nodes(), function(e) {
+		return !n.node(e).parent;
+	}));
+	r = r.slice(1), t.forEach(r, function(t) {
+		var r = e.node(t).parent, i = n.edge(t, r), a = !1;
+		i || (i = n.edge(r, t), a = !0), n.node(t).rank = n.node(r).rank + (a ? i.minlen : -i.minlen);
+	});
+}
+function ve(e, t, n) {
+	return e.hasEdge(t, n);
+}
+function U(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 ye(e) {
+	switch (e.graph().ranker) {
+		case "network-simplex":
+			W(e);
+			break;
+		case "tight-tree":
+			xe(e);
+			break;
+		case "longest-path":
+			be(e);
+			break;
+		default: W(e);
+	}
+}
+var be = O;
+function xe(e) {
+	O(e), A(e);
+}
+function W(e) {
+	P(e);
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/nesting-graph.js
+function Se(e) {
+	var n = m(e, "root", {}, "_root"), r = Ce(e), i = t.max(t.values(r)) - 1, a = 2 * i + 1;
+	e.graph().nestingRoot = n, t.forEach(e.edges(), function(t) {
+		e.edge(t).minlen *= a;
+	});
+	var o = we(e) + 1;
+	t.forEach(e.children(), function(t) {
+		G(e, n, a, o, i, r, t);
+	}), e.graph().nodeRankFactor = a;
+}
+function G(e, n, r, i, a, o, s) {
+	var c = e.children(s);
+	if (!c.length) {
+		s !== n && e.setEdge(n, s, {
+			weight: 0,
+			minlen: r
+		});
+		return;
+	}
+	var l = y(e, "_bt"), u = y(e, "_bb"), d = e.node(s);
+	e.setParent(l, s), d.borderTop = l, e.setParent(u, s), d.borderBottom = u, t.forEach(c, function(t) {
+		G(e, n, r, i, a, o, t);
+		var c = e.node(t), d = c.borderTop ? c.borderTop : t, f = c.borderBottom ? c.borderBottom : t, p = c.borderTop ? i : 2 * i, m = d === f ? a - o[s] + 1 : 1;
+		e.setEdge(l, d, {
+			weight: p,
+			minlen: m,
+			nestingEdge: !0
+		}), e.setEdge(f, u, {
+			weight: p,
+			minlen: m,
+			nestingEdge: !0
+		});
+	}), e.parent(s) || e.setEdge(n, l, {
+		weight: 0,
+		minlen: a + o[s]
+	});
+}
+function Ce(e) {
+	var n = {};
+	function r(i, a) {
+		var o = e.children(i);
+		o && o.length && t.forEach(o, function(e) {
+			r(e, a + 1);
+		}), n[i] = a;
+	}
+	return t.forEach(e.children(), function(e) {
+		r(e, 1);
+	}), n;
+}
+function we(e) {
+	return t.reduce(e.edges(), function(t, n) {
+		return t + e.edge(n).weight;
+	}, 0);
+}
+function Te(e) {
+	var n = e.graph();
+	e.removeNode(n.nestingRoot), delete n.nestingRoot, t.forEach(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 Ee(e, n, r) {
+	var i = {}, a;
+	t.forEach(r, function(t) {
+		for (var r = e.parent(t), o, s; r;) {
+			if (o = e.parent(r), o ? (s = i[o], i[o] = r) : (s = a, a = r), s && s !== r) {
+				n.setEdge(s, r);
+				return;
+			}
+			r = o;
+		}
+	});
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
+function De(n, r, i) {
+	var a = Oe(n), o = new e({ compound: !0 }).setGraph({ root: a }).setDefaultNodeLabel(function(e) {
+		return n.node(e);
+	});
+	return t.forEach(n.nodes(), function(e) {
+		var s = n.node(e), c = n.parent(e);
+		(s.rank === r || s.minRank <= r && r <= s.maxRank) && (o.setNode(e), o.setParent(e, c || a), t.forEach(n[i](e), function(r) {
+			var i = r.v === e ? r.w : r.v, a = o.edge(i, e), s = t.isUndefined(a) ? 0 : a.weight;
+			o.setEdge(i, e, { weight: n.edge(r).weight + s });
+		}), Object.prototype.hasOwnProperty.call(s, "minRank") && o.setNode(e, {
+			borderLeft: s.borderLeft[r],
+			borderRight: s.borderRight[r]
+		}));
+	}), o;
+}
+function Oe(e) {
+	for (var n; e.hasNode(n = t.uniqueId("_root")););
+	return n;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/order/cross-count.js
+function ke(e, t) {
+	for (var n = 0, r = 1; r < t.length; ++r) n += Ae(e, t[r - 1], t[r]);
+	return n;
+}
+function Ae(e, n, r) {
+	for (var i = t.zipObject(r, t.map(r, function(e, t) {
+		return t;
+	})), a = t.flatten(t.map(n, function(n) {
+		return t.sortBy(t.map(e.outEdges(n), function(t) {
+			return {
+				pos: i[t.w],
+				weight: e.edge(t).weight
+			};
+		}), "pos");
+	})), o = 1; o < r.length;) o <<= 1;
+	var s = 2 * o - 1;
+	--o;
+	var c = t.map(Array(s), function() {
+		return 0;
+	}), l = 0;
+	return t.forEach(a.forEach(function(e) {
+		var t = e.pos + o;
+		c[t] += e.weight;
+		for (var n = 0; t > 0;) t % 2 && (n += c[t + 1]), t = t - 1 >> 1, c[t] += e.weight;
+		l += e.weight * n;
+	})), l;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/order/init-order.js
+function je(e) {
+	var n = {}, r = t.filter(e.nodes(), function(t) {
+		return !e.children(t).length;
+	}), i = t.max(t.map(r, function(t) {
+		return e.node(t).rank;
+	})), a = t.map(t.range(i + 1), function() {
+		return [];
+	});
+	function o(r) {
+		t.has(n, r) || (n[r] = !0, a[e.node(r).rank].push(r), t.forEach(e.successors(r), o));
+	}
+	var s = t.sortBy(r, function(t) {
+		return e.node(t).rank;
+	});
+	return t.forEach(s, o), a;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/order/barycenter.js
+function Me(e, n) {
+	return t.map(n, function(n) {
+		var r = e.inEdges(n);
+		if (r.length) {
+			var i = t.reduce(r, 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: n,
+				barycenter: i.sum / i.weight,
+				weight: i.weight
+			};
+		} else return { v: n };
+	});
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
+function Ne(e, n) {
+	var r = {};
+	return t.forEach(e, function(e, n) {
+		var i = r[e.v] = {
+			indegree: 0,
+			in: [],
+			out: [],
+			vs: [e.v],
+			i: n
+		};
+		t.isUndefined(e.barycenter) || (i.barycenter = e.barycenter, i.weight = e.weight);
+	}), t.forEach(n.edges(), function(e) {
+		var n = r[e.v], i = r[e.w];
+		!t.isUndefined(n) && !t.isUndefined(i) && (i.indegree++, n.out.push(r[e.w]));
+	}), Pe(t.filter(r, function(e) {
+		return !e.indegree;
+	}));
+}
+function Pe(e) {
+	var n = [];
+	function r(e) {
+		return function(n) {
+			n.merged || (t.isUndefined(n.barycenter) || t.isUndefined(e.barycenter) || n.barycenter >= e.barycenter) && Fe(e, n);
+		};
+	}
+	function i(t) {
+		return function(n) {
+			n.in.push(t), --n.indegree === 0 && e.push(n);
+		};
+	}
+	for (; e.length;) {
+		var a = e.pop();
+		n.push(a), t.forEach(a.in.reverse(), r(a)), t.forEach(a.out, i(a));
+	}
+	return t.map(t.filter(n, function(e) {
+		return !e.merged;
+	}), function(e) {
+		return t.pick(e, [
+			"vs",
+			"i",
+			"barycenter",
+			"weight"
+		]);
+	});
+}
+function Fe(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 Ie(e, n) {
+	var r = x(e, function(e) {
+		return Object.prototype.hasOwnProperty.call(e, "barycenter");
+	}), i = r.lhs, a = t.sortBy(r.rhs, function(e) {
+		return -e.i;
+	}), o = [], s = 0, c = 0, l = 0;
+	i.sort(Le(!!n)), l = K(o, a, l), t.forEach(i, function(e) {
+		l += e.vs.length, o.push(e.vs), s += e.barycenter * e.weight, c += e.weight, l = K(o, a, l);
+	});
+	var u = { vs: t.flatten(o) };
+	return c && (u.barycenter = s / c, u.weight = c), u;
+}
+function K(e, n, r) {
+	for (var i; n.length && (i = t.last(n)).i <= r;) n.pop(), e.push(i.vs), r++;
+	return r;
+}
+function Le(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 q(e, n, r, i) {
+	var a = e.children(n), o = e.node(n), s = o ? o.borderLeft : void 0, c = o ? o.borderRight : void 0, l = {};
+	s && (a = t.filter(a, function(e) {
+		return e !== s && e !== c;
+	}));
+	var u = Me(e, a);
+	t.forEach(u, function(t) {
+		if (e.children(t.v).length) {
+			var n = q(e, t.v, r, i);
+			l[t.v] = n, Object.prototype.hasOwnProperty.call(n, "barycenter") && ze(t, n);
+		}
+	});
+	var d = Ne(u, r);
+	Re(d, l);
+	var f = Ie(d, i);
+	if (s && (f.vs = t.flatten([
+		s,
+		f.vs,
+		c
+	]), e.predecessors(s).length)) {
+		var p = e.node(e.predecessors(s)[0]), m = e.node(e.predecessors(c)[0]);
+		Object.prototype.hasOwnProperty.call(f, "barycenter") || (f.barycenter = 0, f.weight = 0), f.barycenter = (f.barycenter * f.weight + p.order + m.order) / (f.weight + 2), f.weight += 2;
+	}
+	return f;
+}
+function Re(e, n) {
+	t.forEach(e, function(e) {
+		e.vs = t.flatten(e.vs.map(function(e) {
+			return n[e] ? n[e].vs : e;
+		}));
+	});
+}
+function ze(e, n) {
+	t.isUndefined(e.barycenter) ? (e.barycenter = n.barycenter, e.weight = n.weight) : (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight);
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/order/index.js
+function Be(e) {
+	var n = b(e), r = J(e, t.range(1, n + 1), "inEdges"), i = J(e, t.range(n - 1, -1, -1), "outEdges"), a = je(e);
+	Y(e, a);
+	for (var o = Infinity, s, c = 0, l = 0; l < 4; ++c, ++l) {
+		Ve(c % 2 ? r : i, c % 4 >= 2), a = _(e);
+		var u = ke(e, a);
+		u < o && (l = 0, s = t.cloneDeep(a), o = u);
+	}
+	Y(e, s);
+}
+function J(e, n, r) {
+	return t.map(n, function(t) {
+		return De(e, t, r);
+	});
+}
+function Ve(n, r) {
+	var i = new e();
+	t.forEach(n, function(e) {
+		var n = e.graph().root, a = q(e, n, i, r);
+		t.forEach(a.vs, function(t, n) {
+			e.node(t).order = n;
+		}), Ee(e, i, a.vs);
+	});
+}
+function Y(e, n) {
+	t.forEach(n, function(n) {
+		t.forEach(n, function(t, n) {
+			e.node(t).order = n;
+		});
+	});
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js
+function He(e) {
+	var n = We(e);
+	t.forEach(e.graph().dummyChains, function(t) {
+		for (var r = e.node(t), i = r.edgeObj, a = Ue(e, n, i.v, i.w), o = a.path, s = a.lca, c = 0, l = o[c], u = !0; t !== i.w;) {
+			if (r = e.node(t), 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(t, l), t = e.successors(t)[0];
+		}
+	});
+}
+function Ue(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 We(e) {
+	var n = {}, r = 0;
+	function i(a) {
+		var o = r;
+		t.forEach(e.children(a), i), n[a] = {
+			low: o,
+			lim: r++
+		};
+	}
+	return t.forEach(e.children(), i), n;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/position/bk.js
+function Ge(e, n) {
+	var r = {};
+	function i(n, i) {
+		var a = 0, o = 0, s = n.length, c = t.last(i);
+		return t.forEach(i, function(n, l) {
+			var u = qe(e, n), d = u ? e.node(u).order : s;
+			(u || n === c) && (t.forEach(i.slice(o, l + 1), function(n) {
+				t.forEach(e.predecessors(n), function(t) {
+					var i = e.node(t), o = i.order;
+					(o < a || d < o) && !(i.dummy && e.node(n).dummy) && X(r, t, n);
+				});
+			}), o = l + 1, a = d);
+		}), i;
+	}
+	return t.reduce(n, i), r;
+}
+function Ke(e, n) {
+	var r = {};
+	function i(n, i, a, o, s) {
+		var c;
+		t.forEach(t.range(i, a), function(i) {
+			c = n[i], e.node(c).dummy && t.forEach(e.predecessors(c), function(t) {
+				var n = e.node(t);
+				n.dummy && (n.order < o || n.order > s) && X(r, t, c);
+			});
+		});
+	}
+	function a(n, r) {
+		var a = -1, o, s = 0;
+		return t.forEach(r, function(t, c) {
+			if (e.node(t).dummy === "border") {
+				var l = e.predecessors(t);
+				l.length && (o = e.node(l[0]).order, i(r, s, c, a, o), s = c, a = o);
+			}
+			i(r, s, r.length, o, n.length);
+		}), r;
+	}
+	return t.reduce(n, a), r;
+}
+function qe(e, n) {
+	if (e.node(n).dummy) return t.find(e.predecessors(n), function(t) {
+		return e.node(t).dummy;
+	});
+}
+function X(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 Je(e, t, n) {
+	if (t > n) {
+		var r = t;
+		t = n, n = r;
+	}
+	return !!e[t] && Object.prototype.hasOwnProperty.call(e[t], n);
+}
+function Ye(e, n, r, i) {
+	var a = {}, o = {}, s = {};
+	return t.forEach(n, function(e) {
+		t.forEach(e, function(e, t) {
+			a[e] = e, o[e] = e, s[e] = t;
+		});
+	}), t.forEach(n, function(e) {
+		var n = -1;
+		t.forEach(e, function(e) {
+			var c = i(e);
+			if (c.length) {
+				c = t.sortBy(c, function(e) {
+					return s[e];
+				});
+				for (var l = (c.length - 1) / 2, u = Math.floor(l), d = Math.ceil(l); u <= d; ++u) {
+					var f = c[u];
+					o[e] === e && n < s[f] && !Je(r, e, f) && (o[f] = e, o[e] = a[e] = a[f], n = s[f]);
+				}
+			}
+		});
+	}), {
+		root: a,
+		align: o
+	};
+}
+function Xe(e, n, r, i, a) {
+	var o = {}, s = Ze(e, n, r, a), c = a ? "borderLeft" : "borderRight";
+	function l(e, t) {
+		for (var n = s.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 u(e) {
+		o[e] = s.inEdges(e).reduce(function(e, t) {
+			return Math.max(e, o[t.v] + s.edge(t));
+		}, 0);
+	}
+	function d(t) {
+		var n = s.outEdges(t).reduce(function(e, t) {
+			return Math.min(e, o[t.w] - s.edge(t));
+		}, Infinity), r = e.node(t);
+		n !== Infinity && r.borderType !== c && (o[t] = Math.max(o[t], n));
+	}
+	return l(u, s.predecessors.bind(s)), l(d, s.successors.bind(s)), t.forEach(i, function(e) {
+		o[e] = o[r[e]];
+	}), o;
+}
+function Ze(n, r, i, a) {
+	var o = new e(), s = n.graph(), c = nt(s.nodesep, s.edgesep, a);
+	return t.forEach(r, function(e) {
+		var r;
+		t.forEach(e, function(e) {
+			var t = i[e];
+			if (o.setNode(t), r) {
+				var a = i[r], s = o.edge(a, t);
+				o.setEdge(a, t, Math.max(c(n, e, r), s || 0));
+			}
+			r = e;
+		});
+	}), o;
+}
+function Qe(e, n) {
+	return t.minBy(t.values(n), function(n) {
+		var r = -Infinity, i = Infinity;
+		return t.forIn(n, function(t, n) {
+			var a = rt(e, n) / 2;
+			r = Math.max(t + a, r), i = Math.min(t - a, i);
+		}), r - i;
+	});
+}
+function $e(e, n) {
+	var r = t.values(n), i = t.min(r), a = t.max(r);
+	t.forEach(["u", "d"], function(r) {
+		t.forEach(["l", "r"], function(o) {
+			var s = r + o, c = e[s], l;
+			if (c !== n) {
+				var u = t.values(c);
+				l = o === "l" ? i - t.min(u) : a - t.max(u), l && (e[s] = t.mapValues(c, function(e) {
+					return e + l;
+				}));
+			}
+		});
+	});
+}
+function et(e, n) {
+	return t.mapValues(e.ul, function(r, i) {
+		if (n) return e[n.toLowerCase()][i];
+		var a = t.sortBy(t.map(e, i));
+		return (a[1] + a[2]) / 2;
+	});
+}
+function tt(e) {
+	var n = _(e), r = t.merge(Ge(e, n), Ke(e, n)), i = {}, a;
+	return t.forEach(["u", "d"], function(o) {
+		a = o === "u" ? n : t.values(n).reverse(), t.forEach(["l", "r"], function(n) {
+			n === "r" && (a = t.map(a, function(e) {
+				return t.values(e).reverse();
+			}));
+			var s = (o === "u" ? e.predecessors : e.successors).bind(e), c = Ye(e, a, r, s), l = Xe(e, a, c.root, c.align, n === "r");
+			n === "r" && (l = t.mapValues(l, function(e) {
+				return -e;
+			})), i[o + n] = l;
+		});
+	}), $e(i, Qe(e, i)), et(i, e.graph().align);
+}
+function nt(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 rt(e, t) {
+	return e.node(t).width;
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/position/index.js
+function it(e) {
+	e = h(e), at(e), t.forOwn(tt(e), function(t, n) {
+		e.node(n).x = t;
+	});
+}
+function at(e) {
+	var n = _(e), r = e.graph().ranksep, i = 0;
+	t.forEach(n, function(n) {
+		var a = t.max(t.map(n, function(t) {
+			return e.node(t).height;
+		}));
+		t.forEach(n, function(t) {
+			e.node(t).y = i + a / 2;
+		}), i += a + r;
+	});
+}
+//#endregion
+//#region node_modules/dagre-d3-es/src/dagre/layout.js
+function ot(e, t) {
+	var n = t && t.debugTiming ? ne : re;
+	n("layout", () => {
+		var t = n("  buildLayoutGraph", () => _t(e));
+		n("  runLayout", () => st(t, n)), n("  updateInputGraph", () => ct(e, t));
+	});
+}
+function st(e, t) {
+	t("    makeSpaceForEdgeLabels", () => vt(e)), t("    removeSelfEdges", () => Et(e)), t("    acyclic", () => d(e)), t("    nestingGraph.run", () => Se(e)), t("    rank", () => ye(h(e))), t("    injectEdgeLabelProxies", () => yt(e)), t("    removeEmptyRanks", () => te(e)), t("    nestingGraph.cleanup", () => Te(e)), t("    normalizeRanks", () => v(e)), t("    assignRankMinMax", () => bt(e)), t("    removeEdgeLabelProxies", () => xt(e)), t("    normalize.run", () => ce(e)), t("    parentDummyChains", () => He(e)), t("    addBorderSegments", () => ie(e)), t("    order", () => Be(e)), t("    insertSelfEdges", () => Dt(e)), t("    adjustCoordinateSystem", () => ae(e)), t("    position", () => it(e)), t("    positionSelfEdges", () => Ot(e)), t("    removeBorderNodes", () => Tt(e)), t("    normalize.undo", () => ue(e)), t("    fixupEdgeLabelCoords", () => Ct(e)), t("    undoCoordinateSystem", () => oe(e)), t("    translateGraph", () => Z(e)), t("    assignNodeIntersects", () => St(e)), t("    reversePoints", () => wt(e)), t("    acyclic.undo", () => p(e));
+}
+function ct(e, n) {
+	t.forEach(e.nodes(), function(t) {
+		var r = e.node(t), i = n.node(t);
+		r && (r.x = i.x, r.y = i.y, n.children(t).length && (r.width = i.width, r.height = i.height));
+	}), t.forEach(e.edges(), function(t) {
+		var r = e.edge(t), i = n.edge(t);
+		r.points = i.points, Object.prototype.hasOwnProperty.call(i, "x") && (r.x = i.x, r.y = i.y);
+	}), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
+}
+var lt = [
+	"nodesep",
+	"edgesep",
+	"ranksep",
+	"marginx",
+	"marginy"
+], ut = {
+	ranksep: 50,
+	edgesep: 20,
+	nodesep: 50,
+	rankdir: "tb"
+}, dt = [
+	"acyclicer",
+	"ranker",
+	"rankdir",
+	"align"
+], ft = ["width", "height"], pt = {
+	width: 0,
+	height: 0
+}, mt = [
+	"minlen",
+	"weight",
+	"width",
+	"height",
+	"labeloffset"
+], ht = {
+	minlen: 1,
+	weight: 1,
+	width: 0,
+	height: 0,
+	labeloffset: 10,
+	labelpos: "r"
+}, gt = ["labelpos"];
+function _t(n) {
+	var r = new e({
+		multigraph: !0,
+		compound: !0
+	}), i = $(n.graph());
+	return r.setGraph(t.merge({}, ut, Q(i, lt), t.pick(i, dt))), t.forEach(n.nodes(), function(e) {
+		var i = $(n.node(e));
+		r.setNode(e, t.defaults(Q(i, ft), pt)), r.setParent(e, n.parent(e));
+	}), t.forEach(n.edges(), function(e) {
+		var i = $(n.edge(e));
+		r.setEdge(e, t.merge({}, ht, Q(i, mt), t.pick(i, gt)));
+	}), r;
+}
+function vt(e) {
+	var n = e.graph();
+	n.ranksep /= 2, t.forEach(e.edges(), function(t) {
+		var r = e.edge(t);
+		r.minlen *= 2, r.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? r.width += r.labeloffset : r.height += r.labeloffset);
+	});
+}
+function yt(e) {
+	t.forEach(e.edges(), function(t) {
+		var n = e.edge(t);
+		if (n.width && n.height) {
+			var r = e.node(t.v);
+			m(e, "edge-proxy", {
+				rank: (e.node(t.w).rank - r.rank) / 2 + r.rank,
+				e: t
+			}, "_ep");
+		}
+	});
+}
+function bt(e) {
+	var n = 0;
+	t.forEach(e.nodes(), function(r) {
+		var i = e.node(r);
+		i.borderTop && (i.minRank = e.node(i.borderTop).rank, i.maxRank = e.node(i.borderBottom).rank, n = t.max(n, i.maxRank));
+	}), e.graph().maxRank = n;
+}
+function xt(e) {
+	t.forEach(e.nodes(), function(t) {
+		var n = e.node(t);
+		n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
+	});
+}
+function Z(e) {
+	var n = Infinity, r = 0, i = Infinity, a = 0, o = e.graph(), s = o.marginx || 0, c = o.marginy || 0;
+	function l(e) {
+		var t = e.x, o = e.y, s = e.width, c = e.height;
+		n = Math.min(n, t - s / 2), r = Math.max(r, t + s / 2), i = Math.min(i, o - c / 2), a = Math.max(a, o + c / 2);
+	}
+	t.forEach(e.nodes(), function(t) {
+		l(e.node(t));
+	}), t.forEach(e.edges(), function(t) {
+		var n = e.edge(t);
+		Object.prototype.hasOwnProperty.call(n, "x") && l(n);
+	}), n -= s, i -= c, t.forEach(e.nodes(), function(t) {
+		var r = e.node(t);
+		r.x -= n, r.y -= i;
+	}), t.forEach(e.edges(), function(r) {
+		var a = e.edge(r);
+		t.forEach(a.points, function(e) {
+			e.x -= n, e.y -= i;
+		}), Object.prototype.hasOwnProperty.call(a, "x") && (a.x -= n), Object.prototype.hasOwnProperty.call(a, "y") && (a.y -= i);
+	}), o.width = r - n + s, o.height = a - i + c;
+}
+function St(e) {
+	t.forEach(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(g(r, a)), n.points.push(g(i, o));
+	});
+}
+function Ct(e) {
+	t.forEach(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 wt(e) {
+	t.forEach(e.edges(), function(t) {
+		var n = e.edge(t);
+		n.reversed && n.points.reverse();
+	});
+}
+function Tt(e) {
+	t.forEach(e.nodes(), function(n) {
+		if (e.children(n).length) {
+			var r = e.node(n), i = e.node(r.borderTop), a = e.node(r.borderBottom), o = e.node(t.last(r.borderLeft)), s = e.node(t.last(r.borderRight));
+			r.width = Math.abs(s.x - o.x), r.height = Math.abs(a.y - i.y), r.x = o.x + r.width / 2, r.y = i.y + r.height / 2;
+		}
+	}), t.forEach(e.nodes(), function(t) {
+		e.node(t).dummy === "border" && e.removeNode(t);
+	});
+}
+function Et(e) {
+	t.forEach(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 Dt(e) {
+	var n = _(e);
+	t.forEach(n, function(n) {
+		var r = 0;
+		t.forEach(n, function(n, i) {
+			var a = e.node(n);
+			a.order = i + r, t.forEach(a.selfEdges, function(t) {
+				m(e, "selfedge", {
+					width: t.label.width,
+					height: t.label.height,
+					rank: a.rank,
+					order: i + ++r,
+					e: t.e,
+					label: t.label
+				}, "_se");
+			}), delete a.selfEdges;
+		});
+	});
+}
+function Ot(e) {
+	t.forEach(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 Q(e, n) {
+	return t.mapValues(t.pick(e, n), Number);
+}
+function $(e) {
+	var n = {};
+	return t.forEach(e, function(e, t) {
+		n[t.toLowerCase()] = e;
+	}), n;
+}
+//#endregion
+export { ot as t };
+
+//# sourceMappingURL=dagre-Dd8wCGc6.js.map