@plumile/ui 0.1.112 → 0.1.114

package/lib/esm/node_modules/dagre-d3-es/src/dagre/nesting-graph.js

@@ -1,18 +1,18 @@
 import e from "../../../lodash-es/forEach.js";
-import t from "../../../lodash-es/reduce.js";
-import n from "../../../lodash-es/values.js";
-import r from "../../../lodash-es/max.js";
+import t from "../../../lodash-es/values.js";
+import n from "../../../lodash-es/max.js";
+import r from "../../../lodash-es/reduce.js";
 import { addBorderNode as i, addDummyNode as a } from "./util.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/nesting-graph.js
-function o(t) {
-	var i = a(t, "root", {}, "_root"), o = c(t), u = r(n(o)) - 1, d = 2 * u + 1;
-	t.graph().nestingRoot = i, e(t.edges(), function(e) {
-		t.edge(e).minlen *= d;
+function o(r) {
+	var i = a(r, "root", {}, "_root"), o = c(r), u = n(t(o)) - 1, d = 2 * u + 1;
+	r.graph().nestingRoot = i, e(r.edges(), function(e) {
+		r.edge(e).minlen *= d;
 	});
-	var f = l(t) + 1;
-	e(t.children(), function(e) {
-		s(t, i, d, f, u, o, e);
-	}), t.graph().nodeRankFactor = d;
+	var f = l(r) + 1;
+	e(r.children(), function(e) {
+		s(r, i, d, f, u, o, e);
+	}), r.graph().nodeRankFactor = d;
 }
 function s(t, n, r, a, o, c, l) {
 	var u = t.children(l);
@@ -54,7 +54,7 @@ function c(t) {
 	}), n;
 }
 function l(e) {
-	return t(e.edges(), function(t, n) {
+	return r(e.edges(), function(t, n) {
 		return t + e.edge(n).weight;
 	}, 0);
 }

package/lib/esm/node_modules/dagre-d3-es/src/dagre/order/cross-count.js

@@ -1,6 +1,6 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/flatten.js";
-import n from "../../../../lodash-es/forEach.js";
+import e from "../../../../lodash-es/flatten.js";
+import t from "../../../../lodash-es/forEach.js";
+import n from "../../../../lodash-es/map.js";
 import r from "../../../../lodash-es/sortBy.js";
 import i from "../../../../lodash-es/zipObject.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/order/cross-count.js
@@ -9,10 +9,10 @@ function a(e, t) {
 	return n;
 }
 function o(a, o, s) {
-	for (var c = i(s, e(s, function(e, t) {
+	for (var c = i(s, n(s, function(e, t) {
 		return t;
-	})), l = t(e(o, function(t) {
-		return r(e(a.outEdges(t), function(e) {
+	})), l = e(n(o, function(e) {
+		return r(n(a.outEdges(e), function(e) {
 			return {
 				pos: c[e.w],
 				weight: a.edge(e).weight
@@ -21,10 +21,10 @@ function o(a, o, s) {
 	})), u = 1; u < s.length;) u <<= 1;
 	var d = 2 * u - 1;
 	--u;
-	var f = e(Array(d), function() {
+	var f = n(Array(d), function() {
 		return 0;
 	}), p = 0;
-	return n(l.forEach(function(e) {
+	return t(l.forEach(function(e) {
 		var t = e.pos + u;
 		f[t] += e.weight;
 		for (var n = 0; t > 0;) t % 2 && (n += f[t + 1]), t = t - 1 >> 1, f[t] += e.weight;

package/lib/esm/node_modules/dagre-d3-es/src/dagre/order/index.js

@@ -1,6 +1,6 @@
-import e from "../../../../lodash-es/map.js";
+import e from "../../../../lodash-es/cloneDeep.js";
 import t from "../../../../lodash-es/forEach.js";
-import n from "../../../../lodash-es/cloneDeep.js";
+import n from "../../../../lodash-es/map.js";
 import r from "../../../../lodash-es/range.js";
 import { Graph as i } from "../../graphlib/graph.js";
 import "../../graphlib/index.js";
@@ -11,19 +11,19 @@ import { crossCount as l } from "./cross-count.js";
 import { initOrder as u } from "./init-order.js";
 import { sortSubgraph as d } from "./sort-subgraph.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/order/index.js
-function f(e) {
-	var t = o(e), i = p(e, r(1, t + 1), "inEdges"), s = p(e, r(t - 1, -1, -1), "outEdges"), c = u(e);
-	h(e, c);
+function f(t) {
+	var n = o(t), i = p(t, r(1, n + 1), "inEdges"), s = p(t, r(n - 1, -1, -1), "outEdges"), c = u(t);
+	h(t, c);
 	for (var d = Infinity, f, g = 0, _ = 0; _ < 4; ++g, ++_) {
-		m(g % 2 ? i : s, g % 4 >= 2), c = a(e);
-		var v = l(e, c);
-		v < d && (_ = 0, f = n(c), d = v);
+		m(g % 2 ? i : s, g % 4 >= 2), c = a(t);
+		var v = l(t, c);
+		v < d && (_ = 0, f = e(c), d = v);
 	}
-	h(e, f);
+	h(t, f);
 }
-function p(t, n, r) {
-	return e(n, function(e) {
-		return c(t, e, r);
+function p(e, t, r) {
+	return n(t, function(t) {
+		return c(e, t, r);
 	});
 }
 function m(e, n) {

package/lib/esm/node_modules/dagre-d3-es/src/dagre/order/init-order.js

@@ -1,6 +1,6 @@
-import e from "../../../../lodash-es/map.js";
+import e from "../../../../lodash-es/forEach.js";
 import t from "../../../../lodash-es/filter.js";
-import n from "../../../../lodash-es/forEach.js";
+import n from "../../../../lodash-es/map.js";
 import r from "../../../../lodash-es/has.js";
 import i from "../../../../lodash-es/max.js";
 import a from "../../../../lodash-es/range.js";
@@ -9,15 +9,15 @@ import o from "../../../../lodash-es/sortBy.js";
 function s(s) {
 	var c = {}, l = t(s.nodes(), function(e) {
 		return !s.children(e).length;
-	}), u = e(a(i(e(l, function(e) {
+	}), u = n(a(i(n(l, function(e) {
 		return s.node(e).rank;
 	})) + 1), function() {
 		return [];
 	});
-	function d(e) {
-		r(c, e) || (c[e] = !0, u[s.node(e).rank].push(e), n(s.successors(e), d));
+	function d(t) {
+		r(c, t) || (c[t] = !0, u[s.node(t).rank].push(t), e(s.successors(t), d));
 	}
-	return n(o(l, function(e) {
+	return e(o(l, function(e) {
 		return s.node(e).rank;
 	}), d), u;
 }

package/lib/esm/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js

@@ -1,12 +1,12 @@
-import e from "../../../../lodash-es/map.js";
+import e from "../../../../lodash-es/forEach.js";
 import t from "../../../../lodash-es/filter.js";
-import n from "../../../../lodash-es/forEach.js";
+import n from "../../../../lodash-es/map.js";
 import r from "../../../../lodash-es/isUndefined.js";
 import i from "../../../../lodash-es/pick.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js
-function a(e, i) {
+function a(n, i) {
 	var a = {};
-	return n(e, function(e, t) {
+	return e(n, function(e, t) {
 		var n = a[e.v] = {
 			indegree: 0,
 			in: [],
@@ -15,7 +15,7 @@ function a(e, i) {
 			i: t
 		};
 		r(e.barycenter) || (n.barycenter = e.barycenter, n.weight = e.weight);
-	}), n(i.edges(), function(e) {
+	}), e(i.edges(), function(e) {
 		var t = a[e.v], n = a[e.w];
 		!r(t) && !r(n) && (n.indegree++, t.out.push(a[e.w]));
 	}), o(t(a, function(e) {
@@ -36,9 +36,9 @@ function o(a) {
 	}
 	for (; a.length;) {
 		var u = a.pop();
-		o.push(u), n(u.in.reverse(), c(u)), n(u.out, l(u));
+		o.push(u), e(u.in.reverse(), c(u)), e(u.out, l(u));
 	}
-	return e(t(o, function(e) {
+	return n(t(o, function(e) {
 		return !e.merged;
 	}), function(e) {
 		return i(e, [

package/lib/esm/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js

@@ -1,6 +1,6 @@
-import e from "../../../../lodash-es/filter.js";
-import t from "../../../../lodash-es/flatten.js";
-import n from "../../../../lodash-es/forEach.js";
+import e from "../../../../lodash-es/flatten.js";
+import t from "../../../../lodash-es/forEach.js";
+import n from "../../../../lodash-es/filter.js";
 import r from "../../../../lodash-es/isUndefined.js";
 import { barycenter as i } from "./barycenter.js";
 import { resolveConflicts as a } from "./resolve-conflicts.js";
@@ -8,11 +8,11 @@ import { sort as o } from "./sort.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js
 function s(r, u, d, f) {
 	var p = r.children(u), m = r.node(u), h = m ? m.borderLeft : void 0, g = m ? m.borderRight : void 0, _ = {};
-	h && (p = e(p, function(e) {
+	h && (p = n(p, function(e) {
 		return e !== h && e !== g;
 	}));
 	var v = i(r, p);
-	n(v, function(e) {
+	t(v, function(e) {
 		if (r.children(e.v).length) {
 			var t = s(r, e.v, d, f);
 			_[e.v] = t, Object.prototype.hasOwnProperty.call(t, "barycenter") && l(e, t);
@@ -21,7 +21,7 @@ function s(r, u, d, f) {
 	var y = a(v, d);
 	c(y, _);
 	var b = o(y, f);
-	if (h && (b.vs = t([
+	if (h && (b.vs = e([
 		h,
 		b.vs,
 		g
@@ -31,9 +31,9 @@ function s(r, u, d, f) {
 	}
 	return b;
 }
-function c(e, r) {
-	n(e, function(e) {
-		e.vs = t(e.vs.map(function(e) {
+function c(n, r) {
+	t(n, function(t) {
+		t.vs = e(t.vs.map(function(e) {
 			return r[e] ? r[e].vs : e;
 		}));
 	});

package/lib/esm/node_modules/dagre-d3-es/src/dagre/order/sort.js

@@ -1,23 +1,23 @@
 import e from "../../../../lodash-es/flatten.js";
-import t from "../../../../lodash-es/forEach.js";
-import n from "../../../../lodash-es/last.js";
+import t from "../../../../lodash-es/last.js";
+import n from "../../../../lodash-es/forEach.js";
 import r from "../../../../lodash-es/sortBy.js";
 import { partition as i } from "../util.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/order/sort.js
-function a(n, a) {
-	var c = i(n, function(e) {
+function a(t, a) {
+	var c = i(t, function(e) {
 		return Object.prototype.hasOwnProperty.call(e, "barycenter");
 	}), l = c.lhs, u = r(c.rhs, function(e) {
 		return -e.i;
 	}), d = [], f = 0, p = 0, m = 0;
-	l.sort(s(!!a)), m = o(d, u, m), t(l, function(e) {
+	l.sort(s(!!a)), m = o(d, u, m), n(l, function(e) {
 		m += e.vs.length, d.push(e.vs), f += e.barycenter * e.weight, p += e.weight, m = o(d, u, m);
 	});
 	var h = { vs: e(d) };
 	return p && (h.barycenter = f / p, h.weight = p), h;
 }
-function o(e, t, r) {
-	for (var i; t.length && (i = n(t)).i <= r;) t.pop(), e.push(i.vs), r++;
+function o(e, n, r) {
+	for (var i; n.length && (i = t(n)).i <= r;) n.pop(), e.push(i.vs), r++;
 	return r;
 }
 function s(e) {

package/lib/esm/node_modules/dagre-d3-es/src/dagre/position/bk.js

@@ -1,62 +1,62 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/min.js";
+import e from "../../../../lodash-es/merge.js";
+import t from "../../../../lodash-es/last.js";
 import n from "../../../../lodash-es/forEach.js";
-import r from "../../../../lodash-es/reduce.js";
-import i from "../../../../lodash-es/merge.js";
-import a from "../../../../lodash-es/last.js";
-import o from "../../../../lodash-es/find.js";
-import s from "../../../../lodash-es/forIn.js";
-import c from "../../../../lodash-es/values.js";
-import l from "../../../../lodash-es/mapValues.js";
-import u from "../../../../lodash-es/max.js";
-import d from "../../../../lodash-es/minBy.js";
-import f from "../../../../lodash-es/range.js";
+import r from "../../../../lodash-es/find.js";
+import i from "../../../../lodash-es/map.js";
+import a from "../../../../lodash-es/forIn.js";
+import o from "../../../../lodash-es/values.js";
+import s from "../../../../lodash-es/mapValues.js";
+import c from "../../../../lodash-es/max.js";
+import l from "../../../../lodash-es/min.js";
+import u from "../../../../lodash-es/minBy.js";
+import d from "../../../../lodash-es/range.js";
+import f from "../../../../lodash-es/reduce.js";
 import p from "../../../../lodash-es/sortBy.js";
 import { Graph as m } from "../../graphlib/graph.js";
 import "../../graphlib/index.js";
 import { buildLayerMatrix as h } from "../util.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/position/bk.js
-function g(e, t) {
+function g(e, r) {
 	var i = {};
-	function o(t, r) {
-		var o = 0, s = 0, c = t.length, l = a(r);
-		return n(r, function(t, a) {
+	function a(r, a) {
+		var o = 0, s = 0, c = r.length, l = t(a);
+		return n(a, function(t, r) {
 			var u = v(e, t), d = u ? e.node(u).order : c;
-			(u || t === l) && (n(r.slice(s, a + 1), function(t) {
+			(u || t === l) && (n(a.slice(s, r + 1), function(t) {
 				n(e.predecessors(t), function(n) {
 					var r = e.node(n), a = r.order;
 					(a < o || d < a) && !(r.dummy && e.node(t).dummy) && y(i, n, t);
 				});
-			}), s = a + 1, o = d);
-		}), r;
+			}), s = r + 1, o = d);
+		}), a;
 	}
-	return r(t, o), i;
+	return f(r, a), i;
 }
 function _(e, t) {
-	var i = {};
-	function a(t, r, a, o, s) {
+	var r = {};
+	function i(t, i, a, o, s) {
 		var c;
-		n(f(r, a), function(r) {
-			c = t[r], e.node(c).dummy && n(e.predecessors(c), function(t) {
+		n(d(i, a), function(i) {
+			c = t[i], e.node(c).dummy && n(e.predecessors(c), function(t) {
 				var n = e.node(t);
-				n.dummy && (n.order < o || n.order > s) && y(i, t, c);
+				n.dummy && (n.order < o || n.order > s) && y(r, t, c);
 			});
 		});
 	}
-	function o(t, r) {
-		var i = -1, o, s = 0;
+	function a(t, r) {
+		var a = -1, o, s = 0;
 		return n(r, function(n, c) {
 			if (e.node(n).dummy === "border") {
 				var l = e.predecessors(n);
-				l.length && (o = e.node(l[0]).order, a(r, s, c, i, o), s = c, i = o);
+				l.length && (o = e.node(l[0]).order, i(r, s, c, a, o), s = c, a = o);
 			}
-			a(r, s, r.length, o, t.length);
+			i(r, s, r.length, o, t.length);
 		}), r;
 	}
-	return r(t, o), i;
+	return f(t, a), r;
 }
 function v(e, t) {
-	if (e.node(t).dummy) return o(e.predecessors(t), function(t) {
+	if (e.node(t).dummy) return r(e.predecessors(t), function(t) {
 		return e.node(t).dummy;
 	});
 }
@@ -146,48 +146,48 @@ function C(e, t, r, i) {
 	}), a;
 }
 function w(e, t) {
-	return d(c(t), function(t) {
+	return u(o(t), function(t) {
 		var n = -Infinity, r = Infinity;
-		return s(t, function(t, i) {
+		return a(t, function(t, i) {
 			var a = k(e, i) / 2;
 			n = Math.max(t + a, n), r = Math.min(t - a, r);
 		}), n - r;
 	});
 }
-function T(e, r) {
-	var i = c(r), a = t(i), o = u(i);
-	n(["u", "d"], function(i) {
+function T(e, t) {
+	var r = o(t), i = l(r), a = c(r);
+	n(["u", "d"], function(r) {
 		n(["l", "r"], function(n) {
-			var s = i + n, d = e[s], f;
-			if (d !== r) {
-				var p = c(d);
-				f = n === "l" ? a - t(p) : o - u(p), f && (e[s] = l(d, function(e) {
+			var u = r + n, d = e[u], f;
+			if (d !== t) {
+				var p = o(d);
+				f = n === "l" ? i - l(p) : a - c(p), f && (e[u] = s(d, function(e) {
 					return e + f;
 				}));
 			}
 		});
 	});
 }
-function E(t, n) {
-	return l(t.ul, function(r, i) {
-		if (n) return t[n.toLowerCase()][i];
-		var a = p(e(t, i));
+function E(e, t) {
+	return s(e.ul, function(n, r) {
+		if (t) return e[t.toLowerCase()][r];
+		var a = p(i(e, r));
 		return (a[1] + a[2]) / 2;
 	});
 }
 function D(t) {
-	var r = h(t), a = i(g(t, r), _(t, r)), o = {}, s;
-	return n(["u", "d"], function(i) {
-		s = i === "u" ? r : c(r).reverse(), n(["l", "r"], function(n) {
-			n === "r" && (s = e(s, function(e) {
-				return c(e).reverse();
+	var r = h(t), a = e(g(t, r), _(t, r)), c = {}, l;
+	return n(["u", "d"], function(e) {
+		l = e === "u" ? r : o(r).reverse(), n(["l", "r"], function(n) {
+			n === "r" && (l = i(l, function(e) {
+				return o(e).reverse();
 			}));
-			var r = (i === "u" ? t.predecessors : t.successors).bind(t), u = x(t, s, a, r), d = S(t, s, u.root, u.align, n === "r");
-			n === "r" && (d = l(d, function(e) {
+			var r = (e === "u" ? t.predecessors : t.successors).bind(t), u = x(t, l, a, r), d = S(t, l, u.root, u.align, n === "r");
+			n === "r" && (d = s(d, function(e) {
 				return -e;
-			})), o[i + n] = d;
+			})), c[e + n] = d;
 		});
-	}), T(o, w(t, o)), E(o, t.graph().align);
+	}), T(c, w(t, c)), E(c, t.graph().align);
 }
 function O(e, t, n) {
 	return function(r, i, a) {

package/lib/esm/node_modules/dagre-d3-es/src/dagre/position/index.js

@@ -1,5 +1,5 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/forEach.js";
+import e from "../../../../lodash-es/forEach.js";
+import t from "../../../../lodash-es/map.js";
 import n from "../../../../lodash-es/forOwn.js";
 import r from "../../../../lodash-es/max.js";
 import { asNonCompoundGraph as i, buildLayerMatrix as a } from "../util.js";
@@ -12,11 +12,11 @@ function s(e) {
 }
 function c(n) {
 	var i = a(n), o = n.graph().ranksep, s = 0;
-	t(i, function(i) {
-		var a = r(e(i, function(e) {
+	e(i, function(i) {
+		var a = r(t(i, function(e) {
 			return n.node(e).height;
 		}));
-		t(i, function(e) {
+		e(i, function(e) {
 			n.node(e).y = s + a / 2;
 		}), s += a + o;
 	});

package/lib/esm/node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js

@@ -1,5 +1,5 @@
-import e from "../../../../lodash-es/filter.js";
-import t from "../../../../lodash-es/forEach.js";
+import e from "../../../../lodash-es/forEach.js";
+import t from "../../../../lodash-es/filter.js";
 import n from "../../../../lodash-es/find.js";
 import r from "../../../../lodash-es/minBy.js";
 import { simplify as i } from "../util.js";
@@ -15,24 +15,24 @@ function u(e) {
 	m(t), d(t, e);
 	for (var n, r; n = g(t);) r = _(t, e, n), v(t, e, n, r);
 }
-function d(e, n) {
-	var r = c(e, e.nodes());
-	r = r.slice(0, r.length - 1), t(r, function(t) {
-		f(e, n, t);
+function d(t, n) {
+	var r = c(t, t.nodes());
+	r = r.slice(0, r.length - 1), e(r, function(e) {
+		f(t, n, e);
 	});
 }
 function f(e, t, n) {
 	var r = e.node(n).parent;
 	e.edge(n, r).cutvalue = p(e, t, n);
 }
-function p(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(n.nodeEdges(r), function(t) {
-		var o = t.v === r, c = o ? t.w : t.v;
+function p(t, n, r) {
+	var i = t.node(r).parent, a = !0, o = n.edge(r, i), s = 0;
+	return o ||= (a = !1, n.edge(i, r)), s = o.weight, e(n.nodeEdges(r), function(e) {
+		var o = e.v === r, c = o ? e.w : e.v;
 		if (c !== i) {
-			var l = o === a, u = n.edge(t).weight;
-			if (s += l ? u : -u, b(e, r, c)) {
-				var d = e.edge(r, c).cutvalue;
+			var l = o === a, u = n.edge(e).weight;
+			if (s += l ? u : -u, b(t, r, c)) {
+				var d = t.edge(r, c).cutvalue;
 				s += l ? -d : d;
 			}
 		}
@@ -41,10 +41,10 @@ function p(e, n, r) {
 function m(e, t) {
 	arguments.length < 2 && (t = e.nodes()[0]), h(e, {}, 1, t);
 }
-function h(e, n, r, i, a) {
-	var o = r, s = e.node(i);
-	return n[i] = !0, t(e.neighbors(i), function(t) {
-		Object.prototype.hasOwnProperty.call(n, t) || (r = h(e, n, r, t, i));
+function h(t, n, r, i, a) {
+	var o = r, s = t.node(i);
+	return n[i] = !0, e(t.neighbors(i), function(e) {
+		Object.prototype.hasOwnProperty.call(n, e) || (r = h(t, n, r, e, i));
 	}), s.low = o, s.lim = r++, a ? s.parent = a : delete s.parent, r;
 }
 function g(e) {
@@ -52,12 +52,12 @@ function g(e) {
 		return e.edge(t).cutvalue < 0;
 	});
 }
-function _(t, n, i) {
+function _(e, n, i) {
 	var a = i.v, s = i.w;
 	n.hasEdge(a, s) || (a = i.w, s = i.v);
-	var c = t.node(a), l = t.node(s), u = c, d = !1;
-	return c.lim > l.lim && (u = l, d = !0), r(e(n.edges(), function(e) {
-		return d === x(t, t.node(e.v), u) && d !== x(t, t.node(e.w), u);
+	var c = e.node(a), l = e.node(s), u = c, d = !1;
+	return c.lim > l.lim && (u = l, d = !0), r(t(n.edges(), function(t) {
+		return d === x(e, e.node(t.v), u) && d !== x(e, e.node(t.w), u);
 	}), function(e) {
 		return o(n, e);
 	});
@@ -66,13 +66,13 @@ function v(e, t, n, r) {
 	var i = n.v, a = n.w;
 	e.removeEdge(i, a), e.setEdge(r.v, r.w, {}), m(e), d(e, t), y(e, t);
 }
-function y(e, r) {
-	var i = l(e, n(e.nodes(), function(e) {
+function y(t, r) {
+	var i = l(t, n(t.nodes(), function(e) {
 		return !r.node(e).parent;
 	}));
-	i = i.slice(1), t(i, function(t) {
-		var n = e.node(t).parent, i = r.edge(t, n), a = !1;
-		i || (i = r.edge(n, t), a = !0), r.node(t).rank = r.node(n).rank + (a ? i.minlen : -i.minlen);
+	i = i.slice(1), e(i, function(e) {
+		var n = t.node(e).parent, i = r.edge(e, n), a = !1;
+		i || (i = r.edge(n, e), a = !0), r.node(e).rank = r.node(n).rank + (a ? i.minlen : -i.minlen);
 	});
 }
 function b(e, t, n) {

package/lib/esm/node_modules/dagre-d3-es/src/dagre/rank/util.js

@@ -1,19 +1,19 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/min.js";
-import n from "../../../../lodash-es/forEach.js";
+import e from "../../../../lodash-es/forEach.js";
+import t from "../../../../lodash-es/map.js";
+import n from "../../../../lodash-es/min.js";
 //#region ../../node_modules/dagre-d3-es/src/dagre/rank/util.js
 function r(r) {
 	var i = {};
-	function a(n) {
-		var o = r.node(n);
-		if (Object.prototype.hasOwnProperty.call(i, n)) return o.rank;
-		i[n] = !0;
-		var s = t(e(r.outEdges(n), function(e) {
+	function a(e) {
+		var o = r.node(e);
+		if (Object.prototype.hasOwnProperty.call(i, e)) return o.rank;
+		i[e] = !0;
+		var s = n(t(r.outEdges(e), function(e) {
 			return a(e.w) - r.edge(e).minlen;
 		}));
 		return (s === Infinity || s == null) && (s = 0), o.rank = s;
 	}
-	n(r.sources(), a);
+	e(r.sources(), a);
 }
 function i(e, t) {
 	return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;