@loopstack/loopstack-studio 0.27.0 → 0.29.0

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

@@ -1,58 +1,58 @@
-import merge_default from "../../../../lodash-es/merge.js";
-import map_default from "../../../../lodash-es/map.js";
-import min_default from "../../../../lodash-es/min.js";
-import forEach_default from "../../../../lodash-es/forEach.js";
-import reduce_default from "../../../../lodash-es/reduce.js";
 import last_default from "../../../../lodash-es/last.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
 import find_default from "../../../../lodash-es/find.js";
+import map_default from "../../../../lodash-es/map.js";
 import forIn_default from "../../../../lodash-es/forIn.js";
 import values_default from "../../../../lodash-es/values.js";
 import mapValues_default from "../../../../lodash-es/mapValues.js";
 import max_default from "../../../../lodash-es/max.js";
+import merge_default from "../../../../lodash-es/merge.js";
+import min_default from "../../../../lodash-es/min.js";
 import minBy_default from "../../../../lodash-es/minBy.js";
 import range_default from "../../../../lodash-es/range.js";
+import reduce_default from "../../../../lodash-es/reduce.js";
 import sortBy_default from "../../../../lodash-es/sortBy.js";
 import { Graph } from "../../graphlib/graph.js";
 import "../../graphlib/index.js";
 import { buildLayerMatrix } from "../util.js";
-function findType1Conflicts(e, _) {
-	var v = {};
-	function S(_, b) {
-		var S = 0, C = 0, w = _.length, T = last_default(b);
-		return forEach_default(b, function(_, x) {
-			var E = findOtherInnerSegmentNode(e, _), D = E ? e.node(E).order : w;
-			(E || _ === T) && (forEach_default(b.slice(C, x + 1), function(_) {
-				forEach_default(e.predecessors(_), function(y) {
-					var b = e.node(y), x = b.order;
-					(x < S || D < x) && !(b.dummy && e.node(_).dummy) && addConflict(v, y, _);
+function findType1Conflicts(v, y) {
+	var b = {};
+	function x(y, x) {
+		var S = 0, C = 0, w = y.length, T = last_default(x);
+		return forEach_default(x, function(e, y) {
+			var E = findOtherInnerSegmentNode(v, e), D = E ? v.node(E).order : w;
+			(E || e === T) && (forEach_default(x.slice(C, y + 1), function(e) {
+				forEach_default(v.predecessors(e), function(_) {
+					var y = v.node(_), x = y.order;
+					(x < S || D < x) && !(y.dummy && v.node(e).dummy) && addConflict(b, _, e);
 				});
-			}), C = x + 1, S = D);
-		}), b;
+			}), C = y + 1, S = D);
+		}), x;
 	}
-	return reduce_default(_, S), v;
+	return reduce_default(y, x), b;
 }
-function findType2Conflicts(e, _) {
-	var v = {};
-	function x(_, b, x, S, C) {
+function findType2Conflicts(e, v) {
+	var y = {};
+	function b(v, b, x, S, C) {
 		var w;
 		forEach_default(range_default(b, x), function(b) {
-			w = _[b], e.node(w).dummy && forEach_default(e.predecessors(w), function(_) {
-				var y = e.node(_);
-				y.dummy && (y.order < S || y.order > C) && addConflict(v, _, w);
+			w = v[b], e.node(w).dummy && forEach_default(e.predecessors(w), function(_) {
+				var v = e.node(_);
+				v.dummy && (v.order < S || v.order > C) && addConflict(y, _, w);
 			});
 		});
 	}
-	function S(_, v) {
-		var b = -1, S, C = 0;
-		return forEach_default(v, function(y, w) {
-			if (e.node(y).dummy === "border") {
-				var T = e.predecessors(y);
-				T.length && (S = e.node(T[0]).order, x(v, C, w, b, S), C = w, b = S);
+	function x(v, y) {
+		var x = -1, S, C = 0;
+		return forEach_default(y, function(_, w) {
+			if (e.node(_).dummy === "border") {
+				var T = e.predecessors(_);
+				T.length && (S = e.node(T[0]).order, b(y, C, w, x, S), C = w, x = S);
 			}
-			x(v, C, v.length, S, _.length);
-		}), v;
+			b(y, C, y.length, S, v.length);
+		}), y;
 	}
-	return reduce_default(_, S), v;
+	return reduce_default(v, x), y;
 }
 function findOtherInnerSegmentNode(e, _) {
 	if (e.node(_).dummy) return find_default(e.predecessors(_), function(_) {
@@ -85,23 +85,23 @@ function hasConflict(e, _, v) {
 	}
 	return !!e[_] && Object.prototype.hasOwnProperty.call(e[_], v);
 }
-function verticalAlignment(e, _, v, b) {
+function verticalAlignment(e, v, y, b) {
 	var x = {}, S = {}, C = {};
-	return forEach_default(_, function(e) {
+	return forEach_default(v, function(e) {
 		forEach_default(e, function(e, _) {
 			x[e] = e, S[e] = e, C[e] = _;
 		});
-	}), forEach_default(_, function(e) {
-		var _ = -1;
+	}), forEach_default(v, function(e) {
+		var v = -1;
 		forEach_default(e, function(e) {
-			var y = b(e);
-			if (y.length) {
-				y = sortBy_default(y, function(e) {
+			var _ = b(e);
+			if (_.length) {
+				_ = sortBy_default(_, function(e) {
 					return C[e];
 				});
-				for (var w = (y.length - 1) / 2, T = Math.floor(w), E = Math.ceil(w); T <= E; ++T) {
-					var D = y[T];
-					S[e] === e && _ < C[D] && !hasConflict(v, e, D) && (S[D] = e, S[e] = x[e] = x[D], _ = C[D]);
+				for (var w = (_.length - 1) / 2, T = Math.floor(w), E = Math.ceil(w); T <= E; ++T) {
+					var D = _[T];
+					S[e] === e && v < C[D] && !hasConflict(y, e, D) && (S[D] = e, S[e] = x[e] = x[D], v = C[D]);
 				}
 			}
 		});
@@ -110,8 +110,8 @@ function verticalAlignment(e, _, v, b) {
 		align: S
 	};
 }
-function horizontalCompaction(e, _, v, b, x) {
-	var S = {}, C = buildBlockGraph(e, _, v, x), w = x ? "borderLeft" : "borderRight";
+function horizontalCompaction(e, v, y, b, x) {
+	var S = {}, C = buildBlockGraph(e, v, y, x), w = x ? "borderLeft" : "borderRight";
 	function T(e, _) {
 		for (var v = C.nodes(), y = v.pop(), b = {}; y;) b[y] ? e(y) : (b[y] = !0, v.push(y), v = v.concat(_(y))), y = v.pop();
 	}
@@ -127,18 +127,18 @@ function horizontalCompaction(e, _, v, b, x) {
 		v !== Infinity && y.borderType !== w && (S[_] = Math.max(S[_], v));
 	}
 	return T(E, C.predecessors.bind(C)), T(D, C.successors.bind(C)), forEach_default(b, function(e) {
-		S[e] = S[v[e]];
+		S[e] = S[y[e]];
 	}), S;
 }
-function buildBlockGraph(e, _, v, b) {
+function buildBlockGraph(e, v, y, b) {
 	var x = new Graph(), S = e.graph(), C = sep(S.nodesep, S.edgesep, b);
-	return forEach_default(_, function(_) {
+	return forEach_default(v, function(v) {
 		var b;
-		forEach_default(_, function(_) {
-			var y = v[_];
-			if (x.setNode(y), b) {
-				var S = v[b], w = x.edge(S, y);
-				x.setEdge(S, y, Math.max(C(e, _, b), w || 0));
+		forEach_default(v, function(_) {
+			var v = y[_];
+			if (x.setNode(v), b) {
+				var S = y[b], w = x.edge(S, v);
+				x.setEdge(S, v, Math.max(C(e, _, b), w || 0));
 			}
 			b = _;
 		});
@@ -153,40 +153,40 @@ function findSmallestWidthAlignment(e, _) {
 		}), v - y;
 	});
 }
-function alignCoordinates(e, _) {
-	var b = values_default(_), x = min_default(b), S = max_default(b);
-	forEach_default(["u", "d"], function(b) {
-		forEach_default(["l", "r"], function(y) {
-			var C = b + y, D = e[C], O;
-			if (D !== _) {
+function alignCoordinates(e, v) {
+	var y = values_default(v), b = min_default(y), w = max_default(y);
+	forEach_default(["u", "d"], function(y) {
+		forEach_default(["l", "r"], function(_) {
+			var E = y + _, D = e[E], O;
+			if (D !== v) {
 				var k = values_default(D);
-				O = y === "l" ? x - min_default(k) : S - max_default(k), O && (e[C] = mapValues_default(D, function(e) {
+				O = _ === "l" ? b - min_default(k) : w - max_default(k), O && (e[E] = mapValues_default(D, function(e) {
 					return e + O;
 				}));
 			}
 		});
 	});
 }
-function balance(e, v) {
-	return mapValues_default(e.ul, function(y, b) {
-		if (v) return e[v.toLowerCase()][b];
+function balance(e, _) {
+	return mapValues_default(e.ul, function(v, b) {
+		if (_) return e[_.toLowerCase()][b];
 		var x = sortBy_default(map_default(e, b));
 		return (x[1] + x[2]) / 2;
 	});
 }
-function positionX(v) {
-	var b = buildLayerMatrix(v), x = merge_default(findType1Conflicts(v, b), findType2Conflicts(v, b)), S = {}, C;
-	return forEach_default(["u", "d"], function(e) {
-		C = e === "u" ? b : values_default(b).reverse(), forEach_default(["l", "r"], function(y) {
-			y === "r" && (C = map_default(C, function(e) {
+function positionX(e) {
+	var v = buildLayerMatrix(e), b = merge_default(findType1Conflicts(e, v), findType2Conflicts(e, v)), C = {}, T;
+	return forEach_default(["u", "d"], function(w) {
+		T = w === "u" ? v : values_default(v).reverse(), forEach_default(["l", "r"], function(_) {
+			_ === "r" && (T = map_default(T, function(e) {
 				return values_default(e).reverse();
 			}));
-			var b = (e === "u" ? v.predecessors : v.successors).bind(v), E = verticalAlignment(v, C, x, b), D = horizontalCompaction(v, C, E.root, E.align, y === "r");
-			y === "r" && (D = mapValues_default(D, function(e) {
+			var v = (w === "u" ? e.predecessors : e.successors).bind(e), E = verticalAlignment(e, T, b, v), D = horizontalCompaction(e, T, E.root, E.align, _ === "r");
+			_ === "r" && (D = mapValues_default(D, function(e) {
 				return -e;
-			})), S[e + y] = D;
+			})), C[w + _] = D;
 		});
-	}), alignCoordinates(S, findSmallestWidthAlignment(v, S)), balance(S, v.graph().align);
+	}), alignCoordinates(C, findSmallestWidthAlignment(e, C)), balance(C, e.graph().align);
 }
 function sep(e, _, v) {
 	return function(y, b, x) {

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

@@ -1,5 +1,5 @@
-import map_default from "../../../../lodash-es/map.js";
 import forEach_default from "../../../../lodash-es/forEach.js";
+import map_default from "../../../../lodash-es/map.js";
 import forOwn_default from "../../../../lodash-es/forOwn.js";
 import max_default from "../../../../lodash-es/max.js";
 import { asNonCompoundGraph, buildLayerMatrix } from "../util.js";

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

@@ -1,5 +1,5 @@
-import filter_default from "../../../../lodash-es/filter.js";
 import forEach_default from "../../../../lodash-es/forEach.js";
+import filter_default from "../../../../lodash-es/filter.js";
 import find_default from "../../../../lodash-es/find.js";
 import minBy_default from "../../../../lodash-es/minBy.js";
 import { simplify } from "../util.js";
@@ -15,24 +15,24 @@ function networkSimplex(e) {
 	initLowLimValues(d), initCutValues(d, e);
 	for (var f, p; f = leaveEdge(d);) p = enterEdge(d, e, f), exchangeEdges(d, e, f, p);
 }
-function initCutValues(e, f) {
-	var p = postorder(e, e.nodes());
-	p = p.slice(0, p.length - 1), forEach_default(p, function(d) {
-		assignCutValue(e, f, d);
+function initCutValues(d, f) {
+	var p = postorder(d, d.nodes());
+	p = p.slice(0, p.length - 1), forEach_default(p, function(e) {
+		assignCutValue(d, f, e);
 	});
 }
 function assignCutValue(e, d, f) {
 	var p = e.node(f).parent;
 	e.edge(f, p).cutvalue = calcCutValue(e, d, f);
 }
-function calcCutValue(e, f, p) {
-	var m = e.node(p).parent, h = !0, g = f.edge(p, m), _ = 0;
-	return g ||= (h = !1, f.edge(m, p)), _ = g.weight, forEach_default(f.nodeEdges(p), function(d) {
-		var g = d.v === p, v = g ? d.w : d.v;
+function calcCutValue(d, f, p) {
+	var m = d.node(p).parent, h = !0, g = f.edge(p, m), _ = 0;
+	return g ||= (h = !1, f.edge(m, p)), _ = g.weight, forEach_default(f.nodeEdges(p), function(e) {
+		var g = e.v === p, v = g ? e.w : e.v;
 		if (v !== m) {
-			var y = g === h, b = f.edge(d).weight;
-			if (_ += y ? b : -b, isTreeEdge(e, p, v)) {
-				var x = e.edge(p, v).cutvalue;
+			var y = g === h, b = f.edge(e).weight;
+			if (_ += y ? b : -b, isTreeEdge(d, p, v)) {
+				var x = d.edge(p, v).cutvalue;
 				_ += y ? -x : x;
 			}
 		}
@@ -41,10 +41,10 @@ function calcCutValue(e, f, p) {
 function initLowLimValues(e, d) {
 	arguments.length < 2 && (d = e.nodes()[0]), dfsAssignLowLim(e, {}, 1, d);
 }
-function dfsAssignLowLim(e, f, p, m, h) {
-	var g = p, _ = e.node(m);
-	return f[m] = !0, forEach_default(e.neighbors(m), function(d) {
-		Object.prototype.hasOwnProperty.call(f, d) || (p = dfsAssignLowLim(e, f, p, d, m));
+function dfsAssignLowLim(d, f, p, m, h) {
+	var g = p, _ = d.node(m);
+	return f[m] = !0, forEach_default(d.neighbors(m), function(e) {
+		Object.prototype.hasOwnProperty.call(f, e) || (p = dfsAssignLowLim(d, f, p, e, m));
 	}), _.low = g, _.lim = p++, h ? _.parent = h : delete _.parent, p;
 }
 function leaveEdge(e) {
@@ -52,12 +52,12 @@ function leaveEdge(e) {
 		return e.edge(d).cutvalue < 0;
 	});
 }
-function enterEdge(d, f, m) {
+function enterEdge(e, f, m) {
 	var h = m.v, _ = m.w;
 	f.hasEdge(h, _) || (h = m.w, _ = m.v);
-	var v = d.node(h), y = d.node(_), b = v, x = !1;
-	return v.lim > y.lim && (b = y, x = !0), minBy_default(filter_default(f.edges(), function(e) {
-		return x === isDescendant(d, d.node(e.v), b) && x !== isDescendant(d, d.node(e.w), b);
+	var v = e.node(h), y = e.node(_), b = v, x = !1;
+	return v.lim > y.lim && (b = y, x = !0), minBy_default(filter_default(f.edges(), function(d) {
+		return x === isDescendant(e, e.node(d.v), b) && x !== isDescendant(e, e.node(d.w), b);
 	}), function(e) {
 		return slack(f, e);
 	});
@@ -66,13 +66,13 @@ function exchangeEdges(e, d, f, p) {
 	var m = f.v, h = f.w;
 	e.removeEdge(m, h), e.setEdge(p.v, p.w, {}), initLowLimValues(e), initCutValues(e, d), updateRanks(e, d);
 }
-function updateRanks(e, p) {
-	var m = preorder(e, find_default(e.nodes(), function(e) {
+function updateRanks(d, p) {
+	var m = preorder(d, find_default(d.nodes(), function(e) {
 		return !p.node(e).parent;
 	}));
-	m = m.slice(1), forEach_default(m, function(d) {
-		var f = e.node(d).parent, m = p.edge(d, f), h = !1;
-		m || (m = p.edge(f, d), h = !0), p.node(d).rank = p.node(f).rank + (h ? m.minlen : -m.minlen);
+	m = m.slice(1), forEach_default(m, function(e) {
+		var f = d.node(e).parent, m = p.edge(e, f), h = !1;
+		m || (m = p.edge(f, e), h = !0), p.node(e).rank = p.node(f).rank + (h ? m.minlen : -m.minlen);
 	});
 }
 function isTreeEdge(e, d, f) {

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

@@ -1,20 +1,20 @@
+import forEach_default from "../../../../lodash-es/forEach.js";
 import map_default from "../../../../lodash-es/map.js";
 import min_default from "../../../../lodash-es/min.js";
-import forEach_default from "../../../../lodash-es/forEach.js";
 function longestPath(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 = min_default(map_default(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 = min_default(map_default(r.outEdges(e), function(e) {
 			return a(e.w) - r.edge(e).minlen;
 		}));
 		return (s === Infinity || s == null) && (s = 0), o.rank = s;
 	}
 	forEach_default(r.sources(), a);
 }
-function slack(e, t) {
-	return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
+function slack(e, n) {
+	return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
 }
 export { longestPath, slack };

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

@@ -1,10 +1,10 @@
-import map_default from "../../../lodash-es/map.js";
-import min_default from "../../../lodash-es/min.js";
-import forEach_default from "../../../lodash-es/forEach.js";
 import now_default from "../../../lodash-es/now.js";
+import forEach_default from "../../../lodash-es/forEach.js";
+import map_default from "../../../lodash-es/map.js";
 import has_default from "../../../lodash-es/has.js";
 import isUndefined_default from "../../../lodash-es/isUndefined.js";
 import max_default from "../../../lodash-es/max.js";
+import min_default from "../../../lodash-es/min.js";
 import range_default from "../../../lodash-es/range.js";
 import uniqueId_default from "../../../lodash-es/uniqueId.js";
 import { Graph } from "../graphlib/graph.js";
@@ -17,27 +17,27 @@ function addDummyNode(e, p, m, h) {
 	return m.dummy = p, e.setNode(g, m), g;
 }
 function simplify(e) {
-	var p = new Graph().setGraph(e.graph());
-	return forEach_default(e.nodes(), function(m) {
-		p.setNode(m, e.node(m));
-	}), forEach_default(e.edges(), function(m) {
-		var h = p.edge(m.v, m.w) || {
+	var m = new Graph().setGraph(e.graph());
+	return forEach_default(e.nodes(), function(p) {
+		m.setNode(p, e.node(p));
+	}), forEach_default(e.edges(), function(p) {
+		var h = m.edge(p.v, p.w) || {
 			weight: 0,
 			minlen: 1
-		}, g = e.edge(m);
-		p.setEdge(m.v, m.w, {
+		}, g = e.edge(p);
+		m.setEdge(p.v, p.w, {
 			weight: h.weight + g.weight,
 			minlen: Math.max(h.minlen, g.minlen)
 		});
-	}), p;
+	}), m;
 }
 function asNonCompoundGraph(e) {
-	var p = new Graph({ multigraph: e.isMultigraph() }).setGraph(e.graph());
-	return forEach_default(e.nodes(), function(m) {
-		e.children(m).length || p.setNode(m, e.node(m));
-	}), forEach_default(e.edges(), function(m) {
-		p.setEdge(m, e.edge(m));
-	}), p;
+	var m = new Graph({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+	return forEach_default(e.nodes(), function(p) {
+		e.children(p).length || m.setNode(p, e.node(p));
+	}), forEach_default(e.edges(), function(p) {
+		m.setEdge(p, e.edge(p));
+	}), m;
 }
 function intersectRect(e, p) {
 	var m = e.x, h = e.y, g = p.x - m, _ = p.y - h, v = e.width / 2, y = e.height / 2;
@@ -48,36 +48,36 @@ function intersectRect(e, p) {
 		y: h + x
 	};
 }
-function buildLayerMatrix(p) {
-	var h = map_default(range_default(maxRank(p) + 1), function() {
+function buildLayerMatrix(e) {
+	var h = map_default(range_default(maxRank(e) + 1), function() {
 		return [];
 	});
-	return forEach_default(p.nodes(), function(e) {
-		var m = p.node(e), g = m.rank;
-		isUndefined_default(g) || (h[g][m.order] = e);
+	return forEach_default(e.nodes(), function(p) {
+		var m = e.node(p), _ = m.rank;
+		isUndefined_default(_) || (h[_][m.order] = p);
 	}), h;
 }
-function normalizeRanks(h) {
-	var _ = min_default(map_default(h.nodes(), function(e) {
-		return h.node(e).rank;
+function normalizeRanks(e) {
+	var g = min_default(map_default(e.nodes(), function(p) {
+		return e.node(p).rank;
 	}));
-	forEach_default(h.nodes(), function(e) {
-		var p = h.node(e);
-		has_default(p, "rank") && (p.rank -= _);
+	forEach_default(e.nodes(), function(p) {
+		var m = e.node(p);
+		has_default(m, "rank") && (m.rank -= g);
 	});
 }
-function removeEmptyRanks(h) {
-	var g = min_default(map_default(h.nodes(), function(e) {
-		return h.node(e).rank;
-	})), v = [];
-	forEach_default(h.nodes(), function(e) {
-		var p = h.node(e).rank - g;
-		v[p] || (v[p] = []), v[p].push(e);
+function removeEmptyRanks(e) {
+	var h = min_default(map_default(e.nodes(), function(p) {
+		return e.node(p).rank;
+	})), _ = [];
+	forEach_default(e.nodes(), function(p) {
+		var m = e.node(p).rank - h;
+		_[m] || (_[m] = []), _[m].push(p);
 	});
-	var y = 0, b = h.graph().nodeRankFactor;
-	forEach_default(v, function(e, p) {
-		isUndefined_default(e) && p % b !== 0 ? --y : y && forEach_default(e, function(e) {
-			h.node(e).rank += y;
+	var y = 0, b = e.graph().nodeRankFactor;
+	forEach_default(_, function(m, h) {
+		isUndefined_default(m) && h % b !== 0 ? --y : y && forEach_default(m, function(p) {
+			e.node(p).rank += y;
 		});
 	});
 }
@@ -88,27 +88,27 @@ function addBorderNode(e, p, m, h) {
 	};
 	return arguments.length >= 4 && (g.rank = m, g.order = h), addDummyNode(e, "border", g, p);
 }
-function maxRank(p) {
-	return max_default(map_default(p.nodes(), function(e) {
-		var m = p.node(e).rank;
+function maxRank(e) {
+	return max_default(map_default(e.nodes(), function(p) {
+		var m = e.node(p).rank;
 		if (!isUndefined_default(m)) return m;
 	}));
 }
-function partition(e, p) {
+function partition(e, m) {
 	var h = {
 		lhs: [],
 		rhs: []
 	};
 	return forEach_default(e, function(e) {
-		p(e) ? h.lhs.push(e) : h.rhs.push(e);
+		m(e) ? h.lhs.push(e) : h.rhs.push(e);
 	}), h;
 }
-function time(e, p) {
-	var m = now_default();
+function time(p, m) {
+	var h = now_default();
 	try {
-		return p();
+		return m();
 	} finally {
-		console.log(e + " time: " + (now_default() - m) + "ms");
+		console.log(p + " time: " + (now_default() - h) + "ms");
 	}
 }
 function notime(e, p) {