@loopstack/loopstack-studio 0.24.0 → 0.25.1

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

@@ -1,84 +1,85 @@
-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";
-import { longestPath, slack } from "./util.js";
-import { feasibleTree } from "./feasible-tree.js";
-import { postorder } from "../../graphlib/alg/postorder.js";
-import { preorder } from "../../graphlib/alg/preorder.js";
+import e from "../../../../lodash-es/filter.js";
+import t from "../../../../lodash-es/forEach.js";
+import n from "../../../../lodash-es/find.js";
+import r from "../../../../lodash-es/minBy.js";
+import { simplify as i } from "../util.js";
+import { longestPath as a, slack as o } from "./util.js";
+import { feasibleTree as s } from "./feasible-tree.js";
+import { postorder as c } from "../../graphlib/alg/postorder.js";
+import { preorder as l } from "../../graphlib/alg/preorder.js";
 import "../../graphlib/alg/index.js";
-networkSimplex.initLowLimValues = initLowLimValues, networkSimplex.initCutValues = initCutValues, networkSimplex.calcCutValue = calcCutValue, networkSimplex.leaveEdge = leaveEdge, networkSimplex.enterEdge = enterEdge, networkSimplex.exchangeEdges = exchangeEdges;
-function networkSimplex(e) {
-	e = simplify(e), longestPath(e);
-	var d = feasibleTree(e);
-	initLowLimValues(d), initCutValues(d, e);
-	for (var f, p; f = leaveEdge(d);) p = enterEdge(d, e, f), exchangeEdges(d, e, f, p);
+u.initLowLimValues = m, u.initCutValues = d, u.calcCutValue = p, u.leaveEdge = g, u.enterEdge = _, u.exchangeEdges = v;
+function u(e) {
+	e = i(e), a(e);
+	var t = s(e);
+	m(t), d(t, e);
+	for (var n, r; n = g(t);) r = _(t, e, n), v(t, e, n, r);
 }
-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 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 assignCutValue(e, d, f) {
-	var p = e.node(f).parent;
-	e.edge(f, p).cutvalue = calcCutValue(e, d, f);
+function f(e, t, n) {
+	var r = e.node(n).parent;
+	e.edge(n, r).cutvalue = p(e, t, n);
 }
-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(e).weight;
-			if (_ += y ? b : -b, isTreeEdge(d, p, v)) {
-				var x = d.edge(p, v).cutvalue;
-				_ += y ? -x : x;
+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;
+		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;
+				s += l ? -d : d;
 			}
 		}
-	}), _;
+	}), s;
 }
-function initLowLimValues(e, d) {
-	arguments.length < 2 && (d = e.nodes()[0]), dfsAssignLowLim(e, {}, 1, d);
+function m(e, t) {
+	arguments.length < 2 && (t = e.nodes()[0]), h(e, {}, 1, t);
 }
-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 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));
+	}), s.low = o, s.lim = r++, a ? s.parent = a : delete s.parent, r;
 }
-function leaveEdge(e) {
-	return find_default(e.edges(), function(d) {
-		return e.edge(d).cutvalue < 0;
+function g(e) {
+	return n(e.edges(), function(t) {
+		return e.edge(t).cutvalue < 0;
 	});
 }
-function enterEdge(e, f, m) {
-	var h = m.v, _ = m.w;
-	f.hasEdge(h, _) || (h = m.w, _ = m.v);
-	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 _(t, 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);
 	}), function(e) {
-		return slack(f, e);
+		return o(n, e);
 	});
 }
-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 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 updateRanks(d, p) {
-	var m = preorder(d, find_default(d.nodes(), function(e) {
-		return !p.node(e).parent;
+function y(e, r) {
+	var i = l(e, n(e.nodes(), function(e) {
+		return !r.node(e).parent;
 	}));
-	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);
+	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);
 	});
 }
-function isTreeEdge(e, d, f) {
-	return e.hasEdge(d, f);
+function b(e, t, n) {
+	return e.hasEdge(t, n);
 }
-function isDescendant(e, d, f) {
-	return f.low <= d.lim && d.lim <= f.lim;
+function x(e, t, n) {
+	return n.low <= t.lim && t.lim <= n.lim;
 }
-export { networkSimplex };
+//#endregion
+export { u as networkSimplex };

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

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

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

@@ -1,117 +1,119 @@
-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";
+import e from "../../../lodash-es/map.js";
+import t from "../../../lodash-es/min.js";
+import n from "../../../lodash-es/forEach.js";
+import r from "../../../lodash-es/now.js";
+import i from "../../../lodash-es/has.js";
+import a from "../../../lodash-es/isUndefined.js";
+import o from "../../../lodash-es/max.js";
+import s from "../../../lodash-es/range.js";
+import c from "../../../lodash-es/uniqueId.js";
+import { Graph as l } from "../graphlib/graph.js";
 import "../graphlib/index.js";
-function addDummyNode(e, p, m, h) {
-	var g;
+//#region ../../node_modules/dagre-d3-es/src/dagre/util.js
+function u(e, t, n, r) {
+	var i;
 	do
-		g = uniqueId_default(h);
-	while (e.hasNode(g));
-	return m.dummy = p, e.setNode(g, m), g;
+		i = c(r);
+	while (e.hasNode(i));
+	return n.dummy = t, e.setNode(i, n), i;
 }
-function simplify(e) {
-	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) || {
+function d(e) {
+	var t = new l().setGraph(e.graph());
+	return n(e.nodes(), function(n) {
+		t.setNode(n, e.node(n));
+	}), n(e.edges(), function(n) {
+		var r = t.edge(n.v, n.w) || {
 			weight: 0,
 			minlen: 1
-		}, g = e.edge(p);
-		m.setEdge(p.v, p.w, {
-			weight: h.weight + g.weight,
-			minlen: Math.max(h.minlen, g.minlen)
+		}, i = e.edge(n);
+		t.setEdge(n.v, n.w, {
+			weight: r.weight + i.weight,
+			minlen: Math.max(r.minlen, i.minlen)
 		});
-	}), m;
+	}), t;
 }
-function asNonCompoundGraph(e) {
-	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 f(e) {
+	var t = new l({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+	return n(e.nodes(), function(n) {
+		e.children(n).length || t.setNode(n, e.node(n));
+	}), n(e.edges(), function(n) {
+		t.setEdge(n, e.edge(n));
+	}), t;
 }
-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;
-	if (!g && !_) throw Error("Not possible to find intersection inside of the rectangle");
-	var b, x;
-	return Math.abs(_) * v > Math.abs(g) * y ? (_ < 0 && (y = -y), b = y * g / _, x = y) : (g < 0 && (v = -v), b = v, x = v * _ / g), {
-		x: m + b,
-		y: h + x
+function p(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 buildLayerMatrix(e) {
-	var h = map_default(range_default(maxRank(e) + 1), function() {
+function m(t) {
+	var r = e(s(v(t) + 1), function() {
 		return [];
 	});
-	return forEach_default(e.nodes(), function(p) {
-		var m = e.node(p), _ = m.rank;
-		isUndefined_default(_) || (h[_][m.order] = p);
-	}), h;
+	return n(t.nodes(), function(e) {
+		var n = t.node(e), i = n.rank;
+		a(i) || (r[i][n.order] = e);
+	}), r;
 }
-function normalizeRanks(e) {
-	var g = min_default(map_default(e.nodes(), function(p) {
-		return e.node(p).rank;
+function h(r) {
+	var a = t(e(r.nodes(), function(e) {
+		return r.node(e).rank;
 	}));
-	forEach_default(e.nodes(), function(p) {
-		var m = e.node(p);
-		has_default(m, "rank") && (m.rank -= g);
+	n(r.nodes(), function(e) {
+		var t = r.node(e);
+		i(t, "rank") && (t.rank -= a);
 	});
 }
-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);
+function g(r) {
+	var i = t(e(r.nodes(), function(e) {
+		return r.node(e).rank;
+	})), o = [];
+	n(r.nodes(), function(e) {
+		var t = r.node(e).rank - i;
+		o[t] || (o[t] = []), o[t].push(e);
 	});
-	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;
+	var s = 0, c = r.graph().nodeRankFactor;
+	n(o, function(e, t) {
+		a(e) && t % c !== 0 ? --s : s && n(e, function(e) {
+			r.node(e).rank += s;
 		});
 	});
 }
-function addBorderNode(e, p, m, h) {
-	var g = {
+function _(e, t, n, r) {
+	var i = {
 		width: 0,
 		height: 0
 	};
-	return arguments.length >= 4 && (g.rank = m, g.order = h), addDummyNode(e, "border", g, p);
+	return arguments.length >= 4 && (i.rank = n, i.order = r), u(e, "border", i, t);
 }
-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 v(t) {
+	return o(e(t.nodes(), function(e) {
+		var n = t.node(e).rank;
+		if (!a(n)) return n;
 	}));
 }
-function partition(e, m) {
-	var h = {
+function y(e, t) {
+	var r = {
 		lhs: [],
 		rhs: []
 	};
-	return forEach_default(e, function(e) {
-		m(e) ? h.lhs.push(e) : h.rhs.push(e);
-	}), h;
+	return n(e, function(e) {
+		t(e) ? r.lhs.push(e) : r.rhs.push(e);
+	}), r;
 }
-function time(p, m) {
-	var h = now_default();
+function b(e, t) {
+	var n = r();
 	try {
-		return m();
+		return t();
 	} finally {
-		console.log(p + " time: " + (now_default() - h) + "ms");
+		console.log(e + " time: " + (r() - n) + "ms");
 	}
 }
-function notime(e, p) {
-	return p();
+function x(e, t) {
+	return t();
 }
-export { addBorderNode, addDummyNode, asNonCompoundGraph, buildLayerMatrix, intersectRect, maxRank, normalizeRanks, notime, partition, removeEmptyRanks, simplify, time };
+//#endregion
+export { _ as addBorderNode, u as addDummyNode, f as asNonCompoundGraph, m as buildLayerMatrix, p as intersectRect, v as maxRank, h as normalizeRanks, x as notime, y as partition, g as removeEmptyRanks, d as simplify, b as time };

package/dist/node_modules/dagre-d3-es/src/graphlib/alg/dfs.js

@@ -1,16 +1,18 @@
-import isArray_default from "../../../../lodash-es/isArray.js";
-import forEach_default from "../../../../lodash-es/forEach.js";
-function dfs(r, i, a) {
-	isArray_default(i) || (i = [i]);
-	var o = (r.isDirected() ? r.successors : r.neighbors).bind(r), s = [], c = {};
-	return forEach_default(i, function(e) {
-		if (!r.hasNode(e)) throw Error("Graph does not have node: " + e);
-		doDfs(r, e, a === "post", c, o, s);
+import e from "../../../../lodash-es/isArray.js";
+import t from "../../../../lodash-es/forEach.js";
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js
+function n(n, i, a) {
+	e(i) || (i = [i]);
+	var o = (n.isDirected() ? n.successors : n.neighbors).bind(n), s = [], c = {};
+	return t(i, function(e) {
+		if (!n.hasNode(e)) throw Error("Graph does not have node: " + e);
+		r(n, e, a === "post", c, o, s);
 	}), s;
 }
-function doDfs(e, r, i, a, o, s) {
-	Object.prototype.hasOwnProperty.call(a, r) || (a[r] = !0, i || s.push(r), forEach_default(o(r), function(n) {
-		doDfs(e, n, i, a, o, s);
-	}), i && s.push(r));
+function r(e, n, i, a, o, s) {
+	Object.prototype.hasOwnProperty.call(a, n) || (a[n] = !0, i || s.push(n), t(o(n), function(t) {
+		r(e, t, i, a, o, s);
+	}), i && s.push(n));
 }
-export { dfs };
+//#endregion
+export { n as dfs };

package/dist/node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js

@@ -1,2 +1,3 @@
-import constant_default from "../../../../lodash-es/constant.js";
-constant_default(1);
+import e from "../../../../lodash-es/constant.js";
+e(1);
+//#endregion

package/dist/node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js

@@ -1,2 +1,3 @@
-import constant_default from "../../../../lodash-es/constant.js";
-constant_default(1);
+import e from "../../../../lodash-es/constant.js";
+e(1);
+//#endregion

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

@@ -1,8 +1,8 @@
 import "./dijkstra.js";
 import "./dijkstra-all.js";
 import "./floyd-warshall.js";
-import { topsort } from "./topsort.js";
+import "./topsort.js";
 import "./is-acyclic.js";
-import { postorder } from "./postorder.js";
-import { preorder } from "./preorder.js";
+import "./postorder.js";
+import "./preorder.js";
 import "./prim.js";

package/dist/node_modules/dagre-d3-es/src/graphlib/alg/postorder.js

@@ -1,5 +1,7 @@
-import { dfs } from "./dfs.js";
-function postorder(t, n) {
-	return dfs(t, n, "post");
+import { dfs as e } from "./dfs.js";
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js
+function t(t, n) {
+	return e(t, n, "post");
 }
-export { postorder };
+//#endregion
+export { t as postorder };

package/dist/node_modules/dagre-d3-es/src/graphlib/alg/preorder.js

@@ -1,5 +1,7 @@
-import { dfs } from "./dfs.js";
-function preorder(t, n) {
-	return dfs(t, n, "pre");
+import { dfs as e } from "./dfs.js";
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js
+function t(t, n) {
+	return e(t, n, "pre");
 }
-export { preorder };
+//#endregion
+export { t as preorder };

package/dist/node_modules/dagre-d3-es/src/graphlib/alg/topsort.js

@@ -1,15 +1,17 @@
-import forEach_default from "../../../../lodash-es/forEach.js";
-import size_default from "../../../../lodash-es/size.js";
-topsort.CycleException = CycleException;
-function topsort(r) {
+import e from "../../../../lodash-es/forEach.js";
+import t from "../../../../lodash-es/size.js";
+//#region ../../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js
+n.CycleException = r;
+function n(n) {
 	var i = {}, a = {}, o = [];
-	function s(n) {
-		if (Object.prototype.hasOwnProperty.call(a, n)) throw new CycleException();
-		Object.prototype.hasOwnProperty.call(i, n) || (a[n] = !0, i[n] = !0, forEach_default(r.predecessors(n), s), delete a[n], o.push(n));
+	function s(t) {
+		if (Object.prototype.hasOwnProperty.call(a, t)) throw new r();
+		Object.prototype.hasOwnProperty.call(i, t) || (a[t] = !0, i[t] = !0, e(n.predecessors(t), s), delete a[t], o.push(t));
 	}
-	if (forEach_default(r.sinks(), s), size_default(i) !== r.nodeCount()) throw new CycleException();
+	if (e(n.sinks(), s), t(i) !== n.nodeCount()) throw new r();
 	return o;
 }
-function CycleException() {}
-CycleException.prototype = /* @__PURE__ */ Error();
-export { topsort };
+function r() {}
+r.prototype = /* @__PURE__ */ Error();
+//#endregion
+export { n as topsort };