@loopstack/loopstack-studio 0.25.1 → 0.26.0

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

@@ -1,68 +1,66 @@
-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 { 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;
+import forEach_default from "../../../lodash-es/forEach.js";
+import reduce_default from "../../../lodash-es/reduce.js";
+import values_default from "../../../lodash-es/values.js";
+import max_default from "../../../lodash-es/max.js";
+import { addBorderNode, addDummyNode } from "./util.js";
+function run(n) {
+	var a = addDummyNode(n, "root", {}, "_root"), s = treeDepths(n), u = max_default(values_default(s)) - 1, d = 2 * u + 1;
+	n.graph().nestingRoot = a, forEach_default(n.edges(), function(e) {
+		n.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 = sumWeights(n) + 1;
+	forEach_default(n.children(), function(e) {
+		dfs(n, a, d, f, u, s, e);
+	}), n.graph().nodeRankFactor = d;
 }
-function s(t, n, r, a, o, c, l) {
-	var u = t.children(l);
+function dfs(n, r, i, o, s, c, l) {
+	var u = n.children(l);
 	if (!u.length) {
-		l !== n && t.setEdge(n, l, {
+		l !== r && n.setEdge(r, l, {
 			weight: 0,
-			minlen: r
+			minlen: i
 		});
 		return;
 	}
-	var d = i(t, "_bt"), f = i(t, "_bb"), p = t.node(l);
-	t.setParent(d, l), p.borderTop = d, t.setParent(f, l), p.borderBottom = f, e(u, function(e) {
-		s(t, n, r, a, o, c, e);
-		var i = t.node(e), u = i.borderTop ? i.borderTop : e, p = i.borderBottom ? i.borderBottom : e, m = i.borderTop ? a : 2 * a, h = u === p ? o - c[l] + 1 : 1;
-		t.setEdge(d, u, {
+	var d = addBorderNode(n, "_bt"), f = addBorderNode(n, "_bb"), p = n.node(l);
+	n.setParent(d, l), p.borderTop = d, n.setParent(f, l), p.borderBottom = f, forEach_default(u, function(e) {
+		dfs(n, r, i, o, s, c, e);
+		var a = n.node(e), u = a.borderTop ? a.borderTop : e, p = a.borderBottom ? a.borderBottom : e, m = a.borderTop ? o : 2 * o, h = u === p ? s - c[l] + 1 : 1;
+		n.setEdge(d, u, {
 			weight: m,
 			minlen: h,
 			nestingEdge: !0
-		}), t.setEdge(p, f, {
+		}), n.setEdge(p, f, {
 			weight: m,
 			minlen: h,
 			nestingEdge: !0
 		});
-	}), t.parent(l) || t.setEdge(n, d, {
+	}), n.parent(l) || n.setEdge(r, d, {
 		weight: 0,
-		minlen: o + c[l]
+		minlen: s + c[l]
 	});
 }
-function c(t) {
-	var n = {};
-	function r(i, a) {
-		var o = t.children(i);
-		o && o.length && e(o, function(e) {
-			r(e, a + 1);
-		}), n[i] = a;
+function treeDepths(n) {
+	var r = {};
+	function i(a, o) {
+		var s = n.children(a);
+		s && s.length && forEach_default(s, function(e) {
+			i(e, o + 1);
+		}), r[a] = o;
 	}
-	return e(t.children(), function(e) {
-		r(e, 1);
-	}), n;
+	return forEach_default(n.children(), function(e) {
+		i(e, 1);
+	}), r;
 }
-function l(e) {
-	return t(e.edges(), function(t, n) {
-		return t + e.edge(n).weight;
+function sumWeights(e) {
+	return reduce_default(e.edges(), function(n, r) {
+		return n + e.edge(r).weight;
 	}, 0);
 }
-function u(t) {
-	var n = t.graph();
-	t.removeNode(n.nestingRoot), delete n.nestingRoot, e(t.edges(), function(e) {
-		t.edge(e).nestingEdge && t.removeEdge(e);
+function cleanup(n) {
+	var r = n.graph();
+	n.removeNode(r.nestingRoot), delete r.nestingRoot, forEach_default(n.edges(), function(e) {
+		n.edge(e).nestingEdge && n.removeEdge(e);
 	});
 }
-//#endregion
-export { u as cleanup, o as run };
+export { cleanup, run };

package/dist/node_modules/dagre-d3-es/src/dagre/normalize.js

@@ -1,12 +1,11 @@
-import e from "../../../lodash-es/forEach.js";
-import { addDummyNode as t } from "./util.js";
-//#region ../../node_modules/dagre-d3-es/src/dagre/normalize.js
-function n(t) {
-	t.graph().dummyChains = [], e(t.edges(), function(e) {
-		r(t, e);
+import forEach_default from "../../../lodash-es/forEach.js";
+import { addDummyNode } from "./util.js";
+function run(t) {
+	t.graph().dummyChains = [], forEach_default(t.edges(), function(e) {
+		normalizeEdge(t, e);
 	});
 }
-function r(e, n) {
+function normalizeEdge(e, n) {
 	var r = n.v, i = e.node(r).rank, a = n.w, o = e.node(a).rank, s = n.name, c = e.edge(n), l = c.labelRank;
 	if (o !== i + 1) {
 		e.removeEdge(n);
@@ -17,12 +16,12 @@ function r(e, n) {
 			edgeLabel: c,
 			edgeObj: n,
 			rank: i
-		}, d = t(e, "edge", u, "_d"), i === l && (u.width = c.width, u.height = c.height, u.dummy = "edge-label", u.labelpos = c.labelpos), e.setEdge(r, d, { weight: c.weight }, s), f === 0 && e.graph().dummyChains.push(d), r = d;
+		}, d = addDummyNode(e, "edge", u, "_d"), i === l && (u.width = c.width, u.height = c.height, u.dummy = "edge-label", u.labelpos = c.labelpos), e.setEdge(r, d, { weight: c.weight }, s), f === 0 && e.graph().dummyChains.push(d), r = d;
 		e.setEdge(r, a, { weight: c.weight }, s);
 	}
 }
-function i(t) {
-	e(t.graph().dummyChains, function(e) {
+function undo(t) {
+	forEach_default(t.graph().dummyChains, function(e) {
 		var n = t.node(e), r = n.edgeLabel, i;
 		for (t.setEdge(n.edgeObj, r); n.dummy;) i = t.successors(e)[0], t.removeNode(e), r.points.push({
 			x: n.x,
@@ -30,5 +29,4 @@ function i(t) {
 		}), n.dummy === "edge-label" && (r.x = n.x, r.y = n.y, r.width = n.width, r.height = n.height), e = i, n = t.node(e);
 	});
 }
-//#endregion
-export { n as run, i as undo };
+export { run, undo };

package/dist/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js

@@ -1,8 +1,7 @@
-import e from "../../../../lodash-es/forEach.js";
-//#region ../../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js
-function t(t, n, r) {
+import forEach_default from "../../../../lodash-es/forEach.js";
+function addSubgraphConstraints(t, n, r) {
 	var i = {}, a;
-	e(r, function(e) {
+	forEach_default(r, function(e) {
 		for (var r = t.parent(e), o, s; r;) {
 			if (o = t.parent(r), o ? (s = i[o], i[o] = r) : (s = a, a = r), s && s !== r) {
 				n.setEdge(s, r);
@@ -12,5 +11,4 @@ function t(t, n, r) {
 		}
 	});
 }
-//#endregion
-export { t as addSubgraphConstraints };
+export { addSubgraphConstraints };

package/dist/node_modules/dagre-d3-es/src/dagre/order/barycenter.js

@@ -1,11 +1,10 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/reduce.js";
-//#region ../../node_modules/dagre-d3-es/src/dagre/order/barycenter.js
-function n(n, r) {
-	return e(r, function(e) {
+import map_default from "../../../../lodash-es/map.js";
+import reduce_default from "../../../../lodash-es/reduce.js";
+function barycenter(n, r) {
+	return map_default(r, function(e) {
 		var r = n.inEdges(e);
 		if (r.length) {
-			var i = t(r, function(e, t) {
+			var i = reduce_default(r, function(e, t) {
 				var r = n.edge(t), i = n.node(t.v);
 				return {
 					sum: e.sum + r.weight * i.order,
@@ -23,5 +22,4 @@ function n(n, r) {
 		} else return { v: e };
 	});
 }
-//#endregion
-export { n as barycenter };
+export { barycenter };

package/dist/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js

@@ -1,17 +1,16 @@
-import e from "../../../../lodash-es/forEach.js";
-import t from "../../../../lodash-es/isUndefined.js";
-import n from "../../../../lodash-es/uniqueId.js";
-import { Graph as r } from "../../graphlib/graph.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import isUndefined_default from "../../../../lodash-es/isUndefined.js";
+import uniqueId_default from "../../../../lodash-es/uniqueId.js";
+import { Graph } from "../../graphlib/graph.js";
 import "../../graphlib/index.js";
-//#region ../../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js
-function i(n, i, o) {
-	var s = a(n), c = new r({ compound: !0 }).setGraph({ root: s }).setDefaultNodeLabel(function(e) {
+function buildLayerGraph(n, i, o) {
+	var s = createRootNode(n), c = new Graph({ compound: !0 }).setGraph({ root: s }).setDefaultNodeLabel(function(e) {
 		return n.node(e);
 	});
-	return e(n.nodes(), function(r) {
+	return forEach_default(n.nodes(), function(r) {
 		var a = n.node(r), l = n.parent(r);
-		(a.rank === i || a.minRank <= i && i <= a.maxRank) && (c.setNode(r), c.setParent(r, l || s), e(n[o](r), function(e) {
-			var i = e.v === r ? e.w : e.v, a = c.edge(i, r), o = t(a) ? 0 : a.weight;
+		(a.rank === i || a.minRank <= i && i <= a.maxRank) && (c.setNode(r), c.setParent(r, l || s), forEach_default(n[o](r), function(e) {
+			var i = e.v === r ? e.w : e.v, a = c.edge(i, r), o = isUndefined_default(a) ? 0 : a.weight;
 			c.setEdge(i, r, { weight: n.edge(e).weight + o });
 		}), Object.prototype.hasOwnProperty.call(a, "minRank") && c.setNode(r, {
 			borderLeft: a.borderLeft[i],
@@ -19,9 +18,8 @@ function i(n, i, o) {
 		}));
 	}), c;
 }
-function a(e) {
-	for (var t; e.hasNode(t = n("_root")););
+function createRootNode(e) {
+	for (var t; e.hasNode(t = uniqueId_default("_root")););
 	return t;
 }
-//#endregion
-export { i as buildLayerGraph };
+export { buildLayerGraph };

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

@@ -1,18 +1,17 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/flatten.js";
-import n from "../../../../lodash-es/forEach.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
-function a(e, t) {
-	for (var n = 0, r = 1; r < t.length; ++r) n += o(e, t[r - 1], t[r]);
-	return n;
+import map_default from "../../../../lodash-es/map.js";
+import flatten_default from "../../../../lodash-es/flatten.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import sortBy_default from "../../../../lodash-es/sortBy.js";
+import zipObject_default from "../../../../lodash-es/zipObject.js";
+function crossCount(e, n) {
+	for (var r = 0, i = 1; i < n.length; ++i) r += twoLayerCrossCount(e, n[i - 1], n[i]);
+	return r;
 }
-function o(a, o, s) {
-	for (var c = i(s, e(s, function(e, t) {
-		return t;
-	})), l = t(e(o, function(t) {
-		return r(e(a.outEdges(t), function(e) {
+function twoLayerCrossCount(a, o, s) {
+	for (var c = zipObject_default(s, map_default(s, function(e, n) {
+		return n;
+	})), l = flatten_default(map_default(o, function(n) {
+		return sortBy_default(map_default(a.outEdges(n), function(e) {
 			return {
 				pos: c[e.w],
 				weight: a.edge(e).weight
@@ -21,15 +20,14 @@ 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 = map_default(Array(d), function() {
 		return 0;
 	}), p = 0;
-	return n(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;
-		p += e.weight * n;
+	return forEach_default(l.forEach(function(e) {
+		var n = e.pos + u;
+		f[n] += e.weight;
+		for (var r = 0; n > 0;) n % 2 && (r += f[n + 1]), n = n - 1 >> 1, f[n] += e.weight;
+		p += e.weight * r;
 	})), p;
 }
-//#endregion
-export { a as crossCount };
+export { crossCount };

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

@@ -1,46 +1,44 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/forEach.js";
-import n from "../../../../lodash-es/cloneDeep.js";
-import r from "../../../../lodash-es/range.js";
-import { Graph as i } from "../../graphlib/graph.js";
+import map_default from "../../../../lodash-es/map.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import cloneDeep_default from "../../../../lodash-es/cloneDeep.js";
+import range_default from "../../../../lodash-es/range.js";
+import { Graph } from "../../graphlib/graph.js";
 import "../../graphlib/index.js";
-import { buildLayerMatrix as a, maxRank as o } from "../util.js";
-import { addSubgraphConstraints as s } from "./add-subgraph-constraints.js";
-import { buildLayerGraph as c } from "./build-layer-graph.js";
-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);
-	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);
+import { buildLayerMatrix, maxRank } from "../util.js";
+import { addSubgraphConstraints } from "./add-subgraph-constraints.js";
+import { buildLayerGraph } from "./build-layer-graph.js";
+import { crossCount } from "./cross-count.js";
+import { initOrder } from "./init-order.js";
+import { sortSubgraph } from "./sort-subgraph.js";
+function order(e) {
+	var s = maxRank(e), u = buildLayerGraphs(e, range_default(1, s + 1), "inEdges"), f = buildLayerGraphs(e, range_default(s - 1, -1, -1), "outEdges"), p = initOrder(e);
+	assignOrder(e, p);
+	for (var m = Infinity, h, g = 0, _ = 0; _ < 4; ++g, ++_) {
+		sweepLayerGraphs(g % 2 ? u : f, g % 4 >= 2), p = buildLayerMatrix(e);
+		var v = crossCount(e, p);
+		v < m && (_ = 0, h = cloneDeep_default(p), m = v);
 	}
-	h(e, f);
+	assignOrder(e, h);
 }
-function p(t, n, r) {
-	return e(n, function(e) {
-		return c(t, e, r);
+function buildLayerGraphs(s, c, l) {
+	return map_default(c, function(e) {
+		return buildLayerGraph(s, e, l);
 	});
 }
-function m(e, n) {
-	var r = new i();
-	t(e, function(e) {
-		var i = e.graph().root, a = d(e, i, r, n);
-		t(a.vs, function(t, n) {
-			e.node(t).order = n;
-		}), s(e, r, a.vs);
+function sweepLayerGraphs(e, c) {
+	var l = new Graph();
+	forEach_default(e, function(e) {
+		var u = e.graph().root, d = sortSubgraph(e, u, l, c);
+		forEach_default(d.vs, function(s, c) {
+			e.node(s).order = c;
+		}), addSubgraphConstraints(e, l, d.vs);
 	});
 }
-function h(e, n) {
-	t(n, function(n) {
-		t(n, function(t, n) {
-			e.node(t).order = n;
+function assignOrder(e, c) {
+	forEach_default(c, function(c) {
+		forEach_default(c, function(s, c) {
+			e.node(s).order = c;
 		});
 	});
 }
-//#endregion
-export { f as order };
+export { order };

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

@@ -1,25 +1,23 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/filter.js";
-import n from "../../../../lodash-es/forEach.js";
-import r from "../../../../lodash-es/has.js";
-import i from "../../../../lodash-es/max.js";
-import a from "../../../../lodash-es/range.js";
-import o from "../../../../lodash-es/sortBy.js";
-//#region ../../node_modules/dagre-d3-es/src/dagre/order/init-order.js
-function s(s) {
-	var c = {}, l = t(s.nodes(), function(e) {
+import map_default from "../../../../lodash-es/map.js";
+import filter_default from "../../../../lodash-es/filter.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import has_default from "../../../../lodash-es/has.js";
+import max_default from "../../../../lodash-es/max.js";
+import range_default from "../../../../lodash-es/range.js";
+import sortBy_default from "../../../../lodash-es/sortBy.js";
+function initOrder(s) {
+	var c = {}, l = filter_default(s.nodes(), function(e) {
 		return !s.children(e).length;
-	}), u = e(a(i(e(l, function(e) {
+	}), u = map_default(range_default(max_default(map_default(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));
+		has_default(c, e) || (c[e] = !0, u[s.node(e).rank].push(e), forEach_default(s.successors(e), d));
 	}
-	return n(o(l, function(e) {
+	return forEach_default(sortBy_default(l, function(e) {
 		return s.node(e).rank;
 	}), d), u;
 }
-//#endregion
-export { s as initOrder };
+export { initOrder };

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

@@ -1,47 +1,46 @@
-import e from "../../../../lodash-es/map.js";
-import t from "../../../../lodash-es/filter.js";
-import n from "../../../../lodash-es/forEach.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) {
-	var a = {};
-	return n(e, function(e, t) {
-		var n = a[e.v] = {
+import map_default from "../../../../lodash-es/map.js";
+import filter_default from "../../../../lodash-es/filter.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import isUndefined_default from "../../../../lodash-es/isUndefined.js";
+import pick_default from "../../../../lodash-es/pick.js";
+function resolveConflicts(e, a) {
+	var o = {};
+	return forEach_default(e, function(e, n) {
+		var r = o[e.v] = {
 			indegree: 0,
 			in: [],
 			out: [],
 			vs: [e.v],
-			i: t
+			i: n
 		};
-		r(e.barycenter) || (n.barycenter = e.barycenter, n.weight = e.weight);
-	}), n(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) {
+		isUndefined_default(e.barycenter) || (r.barycenter = e.barycenter, r.weight = e.weight);
+	}), forEach_default(a.edges(), function(e) {
+		var n = o[e.v], r = o[e.w];
+		!isUndefined_default(n) && !isUndefined_default(r) && (r.indegree++, n.out.push(o[e.w]));
+	}), doResolveConflicts(filter_default(o, function(e) {
 		return !e.indegree;
 	}));
 }
-function o(a) {
-	var o = [];
+function doResolveConflicts(o) {
+	var s = [];
 	function c(e) {
-		return function(t) {
-			t.merged || (r(t.barycenter) || r(e.barycenter) || t.barycenter >= e.barycenter) && s(e, t);
+		return function(n) {
+			n.merged || (isUndefined_default(n.barycenter) || isUndefined_default(e.barycenter) || n.barycenter >= e.barycenter) && mergeEntries(e, n);
 		};
 	}
 	function l(e) {
-		return function(t) {
-			t.in.push(e), --t.indegree === 0 && a.push(t);
+		return function(n) {
+			n.in.push(e), --n.indegree === 0 && o.push(n);
 		};
 	}
-	for (; a.length;) {
-		var u = a.pop();
-		o.push(u), n(u.in.reverse(), c(u)), n(u.out, l(u));
+	for (; o.length;) {
+		var u = o.pop();
+		s.push(u), forEach_default(u.in.reverse(), c(u)), forEach_default(u.out, l(u));
 	}
-	return e(t(o, function(e) {
+	return map_default(filter_default(s, function(e) {
 		return !e.merged;
 	}), function(e) {
-		return i(e, [
+		return pick_default(e, [
 			"vs",
 			"i",
 			"barycenter",
@@ -49,9 +48,8 @@ function o(a) {
 		]);
 	});
 }
-function s(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;
+function mergeEntries(e, n) {
+	var r = 0, i = 0;
+	e.weight && (r += e.barycenter * e.weight, i += e.weight), n.weight && (r += n.barycenter * n.weight, i += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = r / i, e.weight = i, e.i = Math.min(n.i, e.i), n.merged = !0;
 }
-//#endregion
-export { a as resolveConflicts };
+export { resolveConflicts };

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

@@ -1,45 +1,43 @@
-import e from "../../../../lodash-es/filter.js";
-import t from "../../../../lodash-es/flatten.js";
-import n from "../../../../lodash-es/forEach.js";
-import r from "../../../../lodash-es/isUndefined.js";
-import { barycenter as i } from "./barycenter.js";
-import { resolveConflicts as a } from "./resolve-conflicts.js";
-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) {
+import filter_default from "../../../../lodash-es/filter.js";
+import flatten_default from "../../../../lodash-es/flatten.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import isUndefined_default from "../../../../lodash-es/isUndefined.js";
+import { barycenter } from "./barycenter.js";
+import { resolveConflicts } from "./resolve-conflicts.js";
+import { sort } from "./sort.js";
+function sortSubgraph(l, u, d, f) {
+	var p = l.children(u), m = l.node(u), h = m ? m.borderLeft : void 0, g = m ? m.borderRight : void 0, _ = {};
+	h && (p = filter_default(p, function(e) {
 		return e !== h && e !== g;
 	}));
-	var v = i(r, p);
-	n(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);
+	var v = barycenter(l, p);
+	forEach_default(v, function(e) {
+		if (l.children(e.v).length) {
+			var c = sortSubgraph(l, e.v, d, f);
+			_[e.v] = c, Object.prototype.hasOwnProperty.call(c, "barycenter") && mergeBarycenters(e, c);
 		}
 	});
-	var y = a(v, d);
-	c(y, _);
-	var b = o(y, f);
-	if (h && (b.vs = t([
+	var y = resolveConflicts(v, d);
+	expandSubgraphs(y, _);
+	var b = sort(y, f);
+	if (h && (b.vs = flatten_default([
 		h,
 		b.vs,
 		g
-	]), r.predecessors(h).length)) {
-		var x = r.node(r.predecessors(h)[0]), S = r.node(r.predecessors(g)[0]);
+	]), l.predecessors(h).length)) {
+		var x = l.node(l.predecessors(h)[0]), S = l.node(l.predecessors(g)[0]);
 		Object.prototype.hasOwnProperty.call(b, "barycenter") || (b.barycenter = 0, b.weight = 0), b.barycenter = (b.barycenter * b.weight + x.order + S.order) / (b.weight + 2), b.weight += 2;
 	}
 	return b;
 }
-function c(e, r) {
-	n(e, function(e) {
-		e.vs = t(e.vs.map(function(e) {
-			return r[e] ? r[e].vs : e;
+function expandSubgraphs(e, l) {
+	forEach_default(e, function(e) {
+		e.vs = flatten_default(e.vs.map(function(e) {
+			return l[e] ? l[e].vs : e;
 		}));
 	});
 }
-function l(e, t) {
-	r(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);
+function mergeBarycenters(e, c) {
+	isUndefined_default(e.barycenter) ? (e.barycenter = c.barycenter, e.weight = c.weight) : (e.barycenter = (e.barycenter * e.weight + c.barycenter * c.weight) / (e.weight + c.weight), e.weight += c.weight);
 }
-//#endregion
-export { s as sortSubgraph };
+export { sortSubgraph };

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

@@ -1,29 +1,27 @@
-import e from "../../../../lodash-es/flatten.js";
-import t from "../../../../lodash-es/forEach.js";
-import n from "../../../../lodash-es/last.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) {
+import flatten_default from "../../../../lodash-es/flatten.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import last_default from "../../../../lodash-es/last.js";
+import sortBy_default from "../../../../lodash-es/sortBy.js";
+import { partition } from "../util.js";
+function sort(i, s) {
+	var c = partition(i, function(e) {
 		return Object.prototype.hasOwnProperty.call(e, "barycenter");
-	}), l = c.lhs, u = r(c.rhs, function(e) {
+	}), l = c.lhs, u = sortBy_default(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) {
-		m += e.vs.length, d.push(e.vs), f += e.barycenter * e.weight, p += e.weight, m = o(d, u, m);
+	l.sort(compareWithBias(!!s)), m = consumeUnsortable(d, u, m), forEach_default(l, function(e) {
+		m += e.vs.length, d.push(e.vs), f += e.barycenter * e.weight, p += e.weight, m = consumeUnsortable(d, u, m);
 	});
-	var h = { vs: e(d) };
+	var h = { vs: flatten_default(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++;
-	return r;
+function consumeUnsortable(e, r, a) {
+	for (var o; r.length && (o = last_default(r)).i <= a;) r.pop(), e.push(o.vs), a++;
+	return a;
 }
-function s(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;
+function compareWithBias(e) {
+	return function(r, i) {
+		return r.barycenter < i.barycenter ? -1 : r.barycenter > i.barycenter ? 1 : e ? i.i - r.i : r.i - i.i;
 	};
 }
-//#endregion
-export { a as sort };
+export { sort };