@jackuait/blok 0.10.5 → 0.10.7

package/dist/chunks/{graphlib-Cye9EPNq.mjs → graphlib-BXNPwKuI.mjs}

@@ -1,10 +1,12 @@
-import { A as e, I as t, a as n, at as r, c as i, d as a, i as o, n as s, o as c, q as l, r as u, rt as d, t as f } from "./_baseUniq-gAuHRtRF.mjs";
+import { E as e, P as t, R as n, t as r } from "./isArrayLikeObject-DzUNFfIK.mjs";
+import { D as i, S as a, a as o, i as s, n as c, r as l, s as u, t as d } from "./_baseUniq-C977U_l-.mjs";
+import { t as f } from "./isEmpty-D8B0aRsG.mjs";
 //#region node_modules/lodash-es/union.js
-var p = l(function(t) {
-	return f(e(t, 1, a, !0));
+var p = e(function(e) {
+	return d(a(e, 1, r, !0));
 }), m = "\0", h = "\0", g = "
", _ = class {
 	constructor(e = {}) {
-		this._isDirected = Object.prototype.hasOwnProperty.call(e, "directed") ? e.directed : !0, this._isMultigraph = Object.prototype.hasOwnProperty.call(e, "multigraph") ? e.multigraph : !1, this._isCompound = Object.prototype.hasOwnProperty.call(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = d(void 0), this._defaultEdgeLabelFn = d(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[h] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+		this._isDirected = Object.prototype.hasOwnProperty.call(e, "directed") ? e.directed : !0, this._isMultigraph = Object.prototype.hasOwnProperty.call(e, "multigraph") ? e.multigraph : !1, this._isCompound = Object.prototype.hasOwnProperty.call(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = t(void 0), this._defaultEdgeLabelFn = t(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[h] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
 	}
 	isDirected() {
 		return this._isDirected;
@@ -22,29 +24,29 @@ var p = l(function(t) {
 		return this._label;
 	}
 	setDefaultNodeLabel(e) {
-		return r(e) || (e = d(e)), this._defaultNodeLabelFn = e, this;
+		return n(e) || (e = t(e)), this._defaultNodeLabelFn = e, this;
 	}
 	nodeCount() {
 		return this._nodeCount;
 	}
 	nodes() {
-		return t(this._nodes);
+		return i(this._nodes);
 	}
 	sources() {
 		var e = this;
-		return c(this.nodes(), function(t) {
-			return o(e._in[t]);
+		return o(this.nodes(), function(t) {
+			return f(e._in[t]);
 		});
 	}
 	sinks() {
 		var e = this;
-		return c(this.nodes(), function(t) {
-			return o(e._out[t]);
+		return o(this.nodes(), function(t) {
+			return f(e._out[t]);
 		});
 	}
 	setNodes(e, t) {
 		var n = arguments, r = this;
-		return i(e, function(e) {
+		return u(e, function(e) {
 			n.length > 1 ? r.setNode(e, t) : r.setNode(e);
 		}), this;
 	}
@@ -59,19 +61,19 @@ var p = l(function(t) {
 	}
 	removeNode(e) {
 		if (Object.prototype.hasOwnProperty.call(this._nodes, e)) {
-			var n = (e) => this.removeEdge(this._edgeObjs[e]);
-			delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], i(this.children(e), (e) => {
+			var t = (e) => this.removeEdge(this._edgeObjs[e]);
+			delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], u(this.children(e), (e) => {
 				this.setParent(e);
-			}), delete this._children[e]), i(t(this._in[e]), n), delete this._in[e], delete this._preds[e], i(t(this._out[e]), n), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+			}), delete this._children[e]), u(i(this._in[e]), t), delete this._in[e], delete this._preds[e], u(i(this._out[e]), t), delete this._out[e], delete this._sucs[e], --this._nodeCount;
 		}
 		return this;
 	}
 	setParent(e, t) {
 		if (!this._isCompound) throw Error("Cannot set parent in a non-compound graph");
-		if (u(t)) t = h;
+		if (l(t)) t = h;
 		else {
 			t += "";
-			for (var n = t; !u(n); n = this.parent(n)) if (n === e) throw Error("Setting " + t + " as parent of " + e + " would create a cycle");
+			for (var n = t; !l(n); n = this.parent(n)) if (n === e) throw Error("Setting " + t + " as parent of " + e + " would create a cycle");
 			this.setNode(t);
 		}
 		return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
@@ -86,19 +88,19 @@ var p = l(function(t) {
 		}
 	}
 	children(e) {
-		if (u(e) && (e = h), this._isCompound) {
-			var n = this._children[e];
-			if (n) return t(n);
+		if (l(e) && (e = h), this._isCompound) {
+			var t = this._children[e];
+			if (t) return i(t);
 		} else if (e === h) return this.nodes();
 		else if (this.hasNode(e)) return [];
 	}
 	predecessors(e) {
-		var n = this._preds[e];
-		if (n) return t(n);
+		var t = this._preds[e];
+		if (t) return i(t);
 	}
 	successors(e) {
-		var n = this._sucs[e];
-		if (n) return t(n);
+		var t = this._sucs[e];
+		if (t) return i(t);
 	}
 	neighbors(e) {
 		var t = this.predecessors(e);
@@ -115,41 +117,41 @@ var p = l(function(t) {
 		});
 		t.setGraph(this.graph());
 		var n = this;
-		i(this._nodes, function(n, r) {
+		u(this._nodes, function(n, r) {
 			e(r) && t.setNode(r, n);
-		}), i(this._edgeObjs, function(e) {
+		}), u(this._edgeObjs, function(e) {
 			t.hasNode(e.v) && t.hasNode(e.w) && t.setEdge(e, n.edge(e));
 		});
 		var r = {};
-		function a(e) {
-			var i = n.parent(e);
-			return i === void 0 || t.hasNode(i) ? (r[e] = i, i) : i in r ? r[i] : a(i);
+		function i(e) {
+			var a = n.parent(e);
+			return a === void 0 || t.hasNode(a) ? (r[e] = a, a) : a in r ? r[a] : i(a);
 		}
-		return this._isCompound && i(t.nodes(), function(e) {
-			t.setParent(e, a(e));
+		return this._isCompound && u(t.nodes(), function(e) {
+			t.setParent(e, i(e));
 		}), t;
 	}
 	setDefaultEdgeLabel(e) {
-		return r(e) || (e = d(e)), this._defaultEdgeLabelFn = e, this;
+		return n(e) || (e = t(e)), this._defaultEdgeLabelFn = e, this;
 	}
 	edgeCount() {
 		return this._edgeCount;
 	}
 	edges() {
-		return n(this._edgeObjs);
+		return s(this._edgeObjs);
 	}
 	setPath(e, t) {
 		var n = this, r = arguments;
-		return s(e, function(e, i) {
+		return c(e, function(e, i) {
 			return r.length > 1 ? n.setEdge(e, i, t) : n.setEdge(e, i), i;
 		}), this;
 	}
 	setEdge() {
 		var e, t, n, r, i = !1, a = arguments[0];
-		typeof a == "object" && a && "v" in a ? (e = a.v, t = a.w, n = a.name, arguments.length === 2 && (r = arguments[1], i = !0)) : (e = a, t = arguments[1], n = arguments[3], arguments.length > 2 && (r = arguments[2], i = !0)), e = "" + e, t = "" + t, u(n) || (n = "" + n);
+		typeof a == "object" && a && "v" in a ? (e = a.v, t = a.w, n = a.name, arguments.length === 2 && (r = arguments[1], i = !0)) : (e = a, t = arguments[1], n = arguments[3], arguments.length > 2 && (r = arguments[2], i = !0)), e = "" + e, t = "" + t, l(n) || (n = "" + n);
 		var o = b(this._isDirected, e, t, n);
 		if (Object.prototype.hasOwnProperty.call(this._edgeLabels, o)) return i && (this._edgeLabels[o] = r), this;
-		if (!u(n) && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
+		if (!l(n) && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
 		this.setNode(e), this.setNode(t), this._edgeLabels[o] = i ? r : this._defaultEdgeLabelFn(e, t, n);
 		var s = x(this._isDirected, e, t, n);
 		return e = s.v, t = s.w, Object.freeze(s), this._edgeObjs[o] = s, v(this._preds[t], e), v(this._sucs[e], t), this._in[t][o] = s, this._out[e][o] = s, this._edgeCount++, this;
@@ -167,21 +169,21 @@ var p = l(function(t) {
 		return i && (e = i.v, t = i.w, delete this._edgeLabels[r], delete this._edgeObjs[r], y(this._preds[t], e), y(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
 	}
 	inEdges(e, t) {
-		var r = this._in[e];
-		if (r) {
-			var i = n(r);
-			return t ? c(i, function(e) {
+		var n = this._in[e];
+		if (n) {
+			var r = s(n);
+			return t ? o(r, function(e) {
 				return e.v === t;
-			}) : i;
+			}) : r;
 		}
 	}
 	outEdges(e, t) {
-		var r = this._out[e];
-		if (r) {
-			var i = n(r);
-			return t ? c(i, function(e) {
+		var n = this._out[e];
+		if (n) {
+			var r = s(n);
+			return t ? o(r, function(e) {
 				return e.w === t;
-			}) : i;
+			}) : r;
 		}
 	}
 	nodeEdges(e, t) {
@@ -202,7 +204,7 @@ function b(e, t, n, r) {
 		var o = i;
 		i = a, a = o;
 	}
-	return i + g + a + g + (u(r) ? m : r);
+	return i + g + a + g + (l(r) ? m : r);
 }
 function x(e, t, n, r) {
 	var i = "" + t, a = "" + n;