@loopstack/loopstack-studio 0.28.0 → 0.29.0

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

@@ -1,12 +1,12 @@
 import isFunction_default from "../../../lodash-es/isFunction.js";
 import constant_default from "../../../lodash-es/constant.js";
-import isEmpty_default from "../../../lodash-es/isEmpty.js";
 import keys_default from "../../../lodash-es/keys.js";
-import filter_default from "../../../lodash-es/filter.js";
 import forEach_default from "../../../lodash-es/forEach.js";
-import reduce_default from "../../../lodash-es/reduce.js";
+import filter_default from "../../../lodash-es/filter.js";
 import values_default from "../../../lodash-es/values.js";
+import isEmpty_default from "../../../lodash-es/isEmpty.js";
 import isUndefined_default from "../../../lodash-es/isUndefined.js";
+import reduce_default from "../../../lodash-es/reduce.js";
 import union_default from "../../../lodash-es/union.js";
 var DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
", Graph = class {
 	constructor(e = {}) {
@@ -27,8 +27,8 @@ var DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
", Graph = c
 	graph() {
 		return this._label;
 	}
-	setDefaultNodeLabel(p) {
-		return isFunction_default(p) || (p = constant_default(p)), this._defaultNodeLabelFn = p, this;
+	setDefaultNodeLabel(f) {
+		return isFunction_default(f) || (f = constant_default(f)), this._defaultNodeLabelFn = f, this;
 	}
 	nodeCount() {
 		return this._nodeCount;
@@ -38,24 +38,24 @@ var DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
", Graph = c
 	}
 	sources() {
 		var e = this;
-		return filter_default(this.nodes(), function(f) {
-			return isEmpty_default(e._in[f]);
+		return filter_default(this.nodes(), function(d) {
+			return isEmpty_default(e._in[d]);
 		});
 	}
 	sinks() {
 		var e = this;
-		return filter_default(this.nodes(), function(f) {
-			return isEmpty_default(e._out[f]);
+		return filter_default(this.nodes(), function(d) {
+			return isEmpty_default(e._out[d]);
 		});
 	}
-	setNodes(e, f) {
-		var p = arguments, m = this;
+	setNodes(e, d) {
+		var f = arguments, m = this;
 		return forEach_default(e, function(e) {
-			p.length > 1 ? m.setNode(e, f) : m.setNode(e);
+			f.length > 1 ? m.setNode(e, d) : m.setNode(e);
 		}), this;
 	}
-	setNode(e, f) {
-		return Object.prototype.hasOwnProperty.call(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = f), this) : (this._nodes[e] = arguments.length > 1 ? f : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = GRAPH_NODE, this._children[e] = {}, this._children[GRAPH_NODE][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+	setNode(e, d) {
+		return Object.prototype.hasOwnProperty.call(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = d), this) : (this._nodes[e] = arguments.length > 1 ? d : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = GRAPH_NODE, this._children[e] = {}, this._children[GRAPH_NODE][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
 	}
 	node(e) {
 		return this._nodes[e];
@@ -65,78 +65,78 @@ var DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
", Graph = c
 	}
 	removeNode(e) {
 		if (Object.prototype.hasOwnProperty.call(this._nodes, e)) {
-			var f = (e) => this.removeEdge(this._edgeObjs[e]);
+			var d = (e) => this.removeEdge(this._edgeObjs[e]);
 			delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], forEach_default(this.children(e), (e) => {
 				this.setParent(e);
-			}), delete this._children[e]), forEach_default(keys_default(this._in[e]), f), delete this._in[e], delete this._preds[e], forEach_default(keys_default(this._out[e]), f), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+			}), delete this._children[e]), forEach_default(keys_default(this._in[e]), d), delete this._in[e], delete this._preds[e], forEach_default(keys_default(this._out[e]), d), delete this._out[e], delete this._sucs[e], --this._nodeCount;
 		}
 		return this;
 	}
-	setParent(e, f) {
+	setParent(e, d) {
 		if (!this._isCompound) throw Error("Cannot set parent in a non-compound graph");
-		if (isUndefined_default(f)) f = GRAPH_NODE;
+		if (isUndefined_default(d)) d = GRAPH_NODE;
 		else {
-			f += "";
-			for (var p = f; !isUndefined_default(p); p = this.parent(p)) if (p === e) throw Error("Setting " + f + " as parent of " + e + " would create a cycle");
-			this.setNode(f);
+			d += "";
+			for (var f = d; !isUndefined_default(f); f = this.parent(f)) if (f === e) throw Error("Setting " + d + " as parent of " + e + " would create a cycle");
+			this.setNode(d);
 		}
-		return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = f, this._children[f][e] = !0, this;
+		return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = d, this._children[d][e] = !0, this;
 	}
 	_removeFromParentsChildList(e) {
 		delete this._children[this._parent[e]][e];
 	}
 	parent(e) {
 		if (this._isCompound) {
-			var f = this._parent[e];
-			if (f !== GRAPH_NODE) return f;
+			var d = this._parent[e];
+			if (d !== GRAPH_NODE) return d;
 		}
 	}
 	children(e) {
 		if (isUndefined_default(e) && (e = GRAPH_NODE), this._isCompound) {
-			var f = this._children[e];
-			if (f) return keys_default(f);
+			var d = this._children[e];
+			if (d) return keys_default(d);
 		} else if (e === GRAPH_NODE) return this.nodes();
 		else if (this.hasNode(e)) return [];
 	}
 	predecessors(e) {
-		var f = this._preds[e];
-		if (f) return keys_default(f);
+		var d = this._preds[e];
+		if (d) return keys_default(d);
 	}
 	successors(e) {
-		var f = this._sucs[e];
-		if (f) return keys_default(f);
+		var d = this._sucs[e];
+		if (d) return keys_default(d);
 	}
 	neighbors(e) {
-		var f = this.predecessors(e);
-		if (f) return union_default(f, this.successors(e));
+		var d = this.predecessors(e);
+		if (d) return union_default(d, this.successors(e));
 	}
 	isLeaf(e) {
 		return (this.isDirected() ? this.successors(e) : this.neighbors(e)).length === 0;
 	}
 	filterNodes(e) {
-		var f = new this.constructor({
+		var d = new this.constructor({
 			directed: this._isDirected,
 			multigraph: this._isMultigraph,
 			compound: this._isCompound
 		});
-		f.setGraph(this.graph());
-		var p = this;
-		forEach_default(this._nodes, function(p, m) {
-			e(m) && f.setNode(m, p);
+		d.setGraph(this.graph());
+		var f = this;
+		forEach_default(this._nodes, function(f, p) {
+			e(p) && d.setNode(p, f);
 		}), forEach_default(this._edgeObjs, function(e) {
-			f.hasNode(e.v) && f.hasNode(e.w) && f.setEdge(e, p.edge(e));
+			d.hasNode(e.v) && d.hasNode(e.w) && d.setEdge(e, f.edge(e));
 		});
 		var m = {};
 		function h(e) {
-			var g = p.parent(e);
-			return g === void 0 || f.hasNode(g) ? (m[e] = g, g) : g in m ? m[g] : h(g);
+			var p = f.parent(e);
+			return p === void 0 || d.hasNode(p) ? (m[e] = p, p) : p in m ? m[p] : h(p);
 		}
-		return this._isCompound && forEach_default(f.nodes(), function(e) {
-			f.setParent(e, h(e));
-		}), f;
+		return this._isCompound && forEach_default(d.nodes(), function(e) {
+			d.setParent(e, h(e));
+		}), d;
 	}
-	setDefaultEdgeLabel(p) {
-		return isFunction_default(p) || (p = constant_default(p)), this._defaultEdgeLabelFn = p, this;
+	setDefaultEdgeLabel(f) {
+		return isFunction_default(f) || (f = constant_default(f)), this._defaultEdgeLabelFn = f, this;
 	}
 	edgeCount() {
 		return this._edgeCount;
@@ -144,85 +144,85 @@ var DEFAULT_EDGE_NAME = "\0", GRAPH_NODE = "\0", EDGE_KEY_DELIM = "
", Graph = c
 	edges() {
 		return values_default(this._edgeObjs);
 	}
-	setPath(e, f) {
-		var p = this, m = arguments;
-		return reduce_default(e, function(e, h) {
-			return m.length > 1 ? p.setEdge(e, h, f) : p.setEdge(e, h), h;
+	setPath(e, d) {
+		var f = this, p = arguments;
+		return reduce_default(e, function(e, m) {
+			return p.length > 1 ? f.setEdge(e, m, d) : f.setEdge(e, m), m;
 		}), this;
 	}
 	setEdge() {
-		var e, f, p, m, h = !1, g = arguments[0];
-		typeof g == "object" && g && "v" in g ? (e = g.v, f = g.w, p = g.name, arguments.length === 2 && (m = arguments[1], h = !0)) : (e = g, f = arguments[1], p = arguments[3], arguments.length > 2 && (m = arguments[2], h = !0)), e = "" + e, f = "" + f, isUndefined_default(p) || (p = "" + p);
-		var _ = edgeArgsToId(this._isDirected, e, f, p);
-		if (Object.prototype.hasOwnProperty.call(this._edgeLabels, _)) return h && (this._edgeLabels[_] = m), this;
-		if (!isUndefined_default(p) && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
-		this.setNode(e), this.setNode(f), this._edgeLabels[_] = h ? m : this._defaultEdgeLabelFn(e, f, p);
-		var v = edgeArgsToObj(this._isDirected, e, f, p);
-		return e = v.v, f = v.w, Object.freeze(v), this._edgeObjs[_] = v, incrementOrInitEntry(this._preds[f], e), incrementOrInitEntry(this._sucs[e], f), this._in[f][_] = v, this._out[e][_] = v, this._edgeCount++, this;
-	}
-	edge(e, f, p) {
-		var m = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, f, p);
-		return this._edgeLabels[m];
-	}
-	hasEdge(e, f, p) {
-		var m = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, f, p);
-		return Object.prototype.hasOwnProperty.call(this._edgeLabels, m);
-	}
-	removeEdge(e, f, p) {
-		var m = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, f, p), h = this._edgeObjs[m];
-		return h && (e = h.v, f = h.w, delete this._edgeLabels[m], delete this._edgeObjs[m], decrementOrRemoveEntry(this._preds[f], e), decrementOrRemoveEntry(this._sucs[e], f), delete this._in[f][m], delete this._out[e][m], this._edgeCount--), this;
-	}
-	inEdges(e, f) {
-		var p = this._in[e];
-		if (p) {
-			var m = values_default(p);
-			return f ? filter_default(m, function(e) {
-				return e.v === f;
-			}) : m;
+		var e, d, f, p, m = !1, h = arguments[0];
+		typeof h == "object" && h && "v" in h ? (e = h.v, d = h.w, f = h.name, arguments.length === 2 && (p = arguments[1], m = !0)) : (e = h, d = arguments[1], f = arguments[3], arguments.length > 2 && (p = arguments[2], m = !0)), e = "" + e, d = "" + d, isUndefined_default(f) || (f = "" + f);
+		var g = edgeArgsToId(this._isDirected, e, d, f);
+		if (Object.prototype.hasOwnProperty.call(this._edgeLabels, g)) return m && (this._edgeLabels[g] = p), this;
+		if (!isUndefined_default(f) && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
+		this.setNode(e), this.setNode(d), this._edgeLabels[g] = m ? p : this._defaultEdgeLabelFn(e, d, f);
+		var v = edgeArgsToObj(this._isDirected, e, d, f);
+		return e = v.v, d = v.w, Object.freeze(v), this._edgeObjs[g] = v, incrementOrInitEntry(this._preds[d], e), incrementOrInitEntry(this._sucs[e], d), this._in[d][g] = v, this._out[e][g] = v, this._edgeCount++, this;
+	}
+	edge(e, d, f) {
+		var p = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, d, f);
+		return this._edgeLabels[p];
+	}
+	hasEdge(e, d, f) {
+		var p = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, d, f);
+		return Object.prototype.hasOwnProperty.call(this._edgeLabels, p);
+	}
+	removeEdge(e, d, f) {
+		var p = arguments.length === 1 ? edgeObjToId(this._isDirected, arguments[0]) : edgeArgsToId(this._isDirected, e, d, f), m = this._edgeObjs[p];
+		return m && (e = m.v, d = m.w, delete this._edgeLabels[p], delete this._edgeObjs[p], decrementOrRemoveEntry(this._preds[d], e), decrementOrRemoveEntry(this._sucs[e], d), delete this._in[d][p], delete this._out[e][p], this._edgeCount--), this;
+	}
+	inEdges(e, d) {
+		var f = this._in[e];
+		if (f) {
+			var p = values_default(f);
+			return d ? filter_default(p, function(e) {
+				return e.v === d;
+			}) : p;
 		}
 	}
-	outEdges(e, f) {
-		var p = this._out[e];
-		if (p) {
-			var m = values_default(p);
-			return f ? filter_default(m, function(e) {
-				return e.w === f;
-			}) : m;
+	outEdges(e, d) {
+		var f = this._out[e];
+		if (f) {
+			var p = values_default(f);
+			return d ? filter_default(p, function(e) {
+				return e.w === d;
+			}) : p;
 		}
 	}
-	nodeEdges(e, f) {
-		var p = this.inEdges(e, f);
-		if (p) return p.concat(this.outEdges(e, f));
+	nodeEdges(e, d) {
+		var f = this.inEdges(e, d);
+		if (f) return f.concat(this.outEdges(e, d));
 	}
 };
 Graph.prototype._nodeCount = 0, Graph.prototype._edgeCount = 0;
-function incrementOrInitEntry(e, f) {
-	e[f] ? e[f]++ : e[f] = 1;
+function incrementOrInitEntry(e, d) {
+	e[d] ? e[d]++ : e[d] = 1;
 }
-function decrementOrRemoveEntry(e, f) {
-	--e[f] || delete e[f];
+function decrementOrRemoveEntry(e, d) {
+	--e[d] || delete e[d];
 }
-function edgeArgsToId(e, f, p, m) {
-	var h = "" + f, g = "" + p;
-	if (!e && h > g) {
-		var _ = h;
-		h = g, g = _;
+function edgeArgsToId(e, d, f, p) {
+	var m = "" + d, h = "" + f;
+	if (!e && m > h) {
+		var g = m;
+		m = h, h = g;
 	}
-	return h + EDGE_KEY_DELIM + g + EDGE_KEY_DELIM + (isUndefined_default(m) ? DEFAULT_EDGE_NAME : m);
+	return m + EDGE_KEY_DELIM + h + EDGE_KEY_DELIM + (isUndefined_default(p) ? DEFAULT_EDGE_NAME : p);
 }
-function edgeArgsToObj(e, f, p, m) {
-	var h = "" + f, g = "" + p;
-	if (!e && h > g) {
-		var _ = h;
-		h = g, g = _;
-	}
-	var v = {
-		v: h,
-		w: g
+function edgeArgsToObj(e, d, f, p) {
+	var m = "" + d, h = "" + f;
+	if (!e && m > h) {
+		var g = m;
+		m = h, h = g;
+	}
+	var _ = {
+		v: m,
+		w: h
 	};
-	return m && (v.name = m), v;
+	return p && (_.name = p), _;
 }
-function edgeObjToId(e, f) {
-	return edgeArgsToId(e, f.v, f.w, f.name);
+function edgeObjToId(e, d) {
+	return edgeArgsToId(e, d.v, d.w, d.name);
 }
 export { Graph };

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

@@ -1,32 +1,32 @@
-import map_default from "../../../lodash-es/map.js";
 import clone_default from "../../../lodash-es/clone.js";
+import map_default from "../../../lodash-es/map.js";
 import isUndefined_default from "../../../lodash-es/isUndefined.js";
 import "./graph.js";
-function write(e) {
+function write(n) {
 	var r = {
 		options: {
-			directed: e.isDirected(),
-			multigraph: e.isMultigraph(),
-			compound: e.isCompound()
+			directed: n.isDirected(),
+			multigraph: n.isMultigraph(),
+			compound: n.isCompound()
 		},
-		nodes: writeNodes(e),
-		edges: writeEdges(e)
+		nodes: writeNodes(n),
+		edges: writeEdges(n)
 	};
-	return isUndefined_default(e.graph()) || (r.value = clone_default(e.graph())), r;
+	return isUndefined_default(n.graph()) || (r.value = clone_default(n.graph())), r;
 }
-function writeNodes(n) {
-	return map_default(n.nodes(), function(e) {
-		var r = n.node(e), i = n.parent(e), a = { v: e };
+function writeNodes(e) {
+	return map_default(e.nodes(), function(n) {
+		var r = e.node(n), i = e.parent(n), a = { v: n };
 		return isUndefined_default(r) || (a.value = r), isUndefined_default(i) || (a.parent = i), a;
 	});
 }
-function writeEdges(n) {
-	return map_default(n.edges(), function(e) {
-		var r = n.edge(e), i = {
-			v: e.v,
-			w: e.w
+function writeEdges(e) {
+	return map_default(e.edges(), function(n) {
+		var r = e.edge(n), i = {
+			v: n.v,
+			w: n.w
 		};
-		return isUndefined_default(e.name) || (i.name = e.name), isUndefined_default(r) || (i.value = r), i;
+		return isUndefined_default(n.name) || (i.name = n.name), isUndefined_default(r) || (i.value = r), i;
 	});
 }
 export { write };