@nxgt/material-vue 0.15.3 → 0.19.0

package/dist/graphlib-CrmIPC4m.js

@@ -0,0 +1,372 @@
+import { B as e, C as t, F as n, I as r, M as i, N as a, k as o, t as s, x as c, y as l } from "./isArrayLikeObject-VG1KOJ3m.js";
+import { d as u, f as d, i as f, n as p, o as m, p as h, r as g } from "./_baseIsEqual-Cj6hHjs0.js";
+import { n as _, r as v, s as y, t as b } from "./isEmpty-CMjyBU-a.js";
+//#region node_modules/lodash-es/noop.js
+function x() {}
+//#endregion
+//#region node_modules/lodash-es/_baseFindIndex.js
+function S(e, t, n, r) {
+	for (var i = e.length, a = n + (r ? 1 : -1); r ? a-- : ++a < i;) if (t(e[a], a, e)) return a;
+	return -1;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseIsNaN.js
+function C(e) {
+	return e !== e;
+}
+//#endregion
+//#region node_modules/lodash-es/_strictIndexOf.js
+function ee(e, t, n) {
+	for (var r = n - 1, i = e.length; ++r < i;) if (e[r] === t) return r;
+	return -1;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseIndexOf.js
+function w(e, t, n) {
+	return t === t ? ee(e, t, n) : S(e, C, n);
+}
+//#endregion
+//#region node_modules/lodash-es/_arrayIncludes.js
+function T(e, t) {
+	return !!(e != null && e.length) && w(e, t, 0) > -1;
+}
+//#endregion
+//#region node_modules/lodash-es/_isFlattenable.js
+var E = e ? e.isConcatSpreadable : void 0;
+function D(e) {
+	return n(e) || l(e) || !!(E && e && e[E]);
+}
+//#endregion
+//#region node_modules/lodash-es/_baseFlatten.js
+function O(e, t, n, r, i) {
+	var a = -1, o = e.length;
+	for (n ||= D, i ||= []; ++a < o;) {
+		var s = e[a];
+		t > 0 && n(s) ? t > 1 ? O(s, t - 1, n, r, i) : d(i, s) : r || (i[i.length] = s);
+	}
+	return i;
+}
+//#endregion
+//#region node_modules/lodash-es/_arrayReduce.js
+function k(e, t, n, r) {
+	var i = -1, a = e == null ? 0 : e.length;
+	for (r && a && (n = e[++i]); ++i < a;) n = t(n, e[i], i, e);
+	return n;
+}
+//#endregion
+//#region node_modules/lodash-es/_createBaseEach.js
+function A(e, t) {
+	return function(n, r) {
+		if (n == null) return n;
+		if (!c(n)) return e(n, r);
+		for (var i = n.length, a = t ? i : -1, o = Object(n); (t ? a-- : ++a < i) && r(o[a], a, o) !== !1;);
+		return n;
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/_baseEach.js
+var j = A(_);
+//#endregion
+//#region node_modules/lodash-es/_arrayIncludesWith.js
+function M(e, t, n) {
+	for (var r = -1, i = e == null ? 0 : e.length; ++r < i;) if (n(t, e[r])) return !0;
+	return !1;
+}
+//#endregion
+//#region node_modules/lodash-es/_castFunction.js
+function N(e) {
+	return typeof e == "function" ? e : a;
+}
+//#endregion
+//#region node_modules/lodash-es/forEach.js
+function P(e, t) {
+	return (n(e) ? y : j)(e, N(t));
+}
+//#endregion
+//#region node_modules/lodash-es/_baseFilter.js
+function F(e, t) {
+	var n = [];
+	return j(e, function(e, r, i) {
+		t(e, r, i) && n.push(e);
+	}), n;
+}
+//#endregion
+//#region node_modules/lodash-es/filter.js
+function I(e, t) {
+	return (n(e) ? u : F)(e, v(t, 3));
+}
+//#endregion
+//#region node_modules/lodash-es/_baseValues.js
+function L(e, t) {
+	return r(t, function(t) {
+		return e[t];
+	});
+}
+//#endregion
+//#region node_modules/lodash-es/values.js
+function R(e) {
+	return e == null ? [] : L(e, h(e));
+}
+//#endregion
+//#region node_modules/lodash-es/isUndefined.js
+function z(e) {
+	return e === void 0;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseReduce.js
+function B(e, t, n, r, i) {
+	return i(e, function(e, i, a) {
+		n = r ? (r = !1, e) : t(n, e, i, a);
+	}), n;
+}
+//#endregion
+//#region node_modules/lodash-es/reduce.js
+function V(e, t, r) {
+	var i = n(e) ? k : B, a = arguments.length < 3;
+	return i(e, v(t, 4), r, a, j);
+}
+//#endregion
+//#region node_modules/lodash-es/_createSet.js
+var H = m && 1 / p(new m([, -0]))[1] == Infinity ? function(e) {
+	return new m(e);
+} : x, U = 200;
+function W(e, t, n) {
+	var r = -1, i = T, a = e.length, o = !0, s = [], c = s;
+	if (n) o = !1, i = M;
+	else if (a >= U) {
+		var l = t ? null : H(e);
+		if (l) return p(l);
+		o = !1, i = g, c = new f();
+	} else c = t ? [] : s;
+	outer: for (; ++r < a;) {
+		var u = e[r], d = t ? t(u) : u;
+		if (u = n || u !== 0 ? u : 0, o && d === d) {
+			for (var m = c.length; m--;) if (c[m] === d) continue outer;
+			t && c.push(d), s.push(u);
+		} else i(c, d, n) || (c !== s && c.push(d), s.push(u));
+	}
+	return s;
+}
+//#endregion
+//#region node_modules/lodash-es/union.js
+var G = t(function(e) {
+	return W(O(e, 1, s, !0));
+}), K = "\0", q = "\0", J = "
", Y = class {
+	constructor(e = {}) {
+		this._isDirected = !Object.prototype.hasOwnProperty.call(e, "directed") || e.directed, 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 = o(void 0), this._defaultEdgeLabelFn = o(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[q] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+	}
+	isDirected() {
+		return this._isDirected;
+	}
+	isMultigraph() {
+		return this._isMultigraph;
+	}
+	isCompound() {
+		return this._isCompound;
+	}
+	setGraph(e) {
+		return this._label = e, this;
+	}
+	graph() {
+		return this._label;
+	}
+	setDefaultNodeLabel(e) {
+		return i(e) || (e = o(e)), this._defaultNodeLabelFn = e, this;
+	}
+	nodeCount() {
+		return this._nodeCount;
+	}
+	nodes() {
+		return h(this._nodes);
+	}
+	sources() {
+		var e = this;
+		return I(this.nodes(), function(t) {
+			return b(e._in[t]);
+		});
+	}
+	sinks() {
+		var e = this;
+		return I(this.nodes(), function(t) {
+			return b(e._out[t]);
+		});
+	}
+	setNodes(e, t) {
+		var n = arguments, r = this;
+		return P(e, function(e) {
+			n.length > 1 ? r.setNode(e, t) : r.setNode(e);
+		}), this;
+	}
+	setNode(e, t) {
+		return Object.prototype.hasOwnProperty.call(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = q, this._children[e] = {}, this._children[q][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+	}
+	node(e) {
+		return this._nodes[e];
+	}
+	hasNode(e) {
+		return Object.prototype.hasOwnProperty.call(this._nodes, e);
+	}
+	removeNode(e) {
+		if (Object.prototype.hasOwnProperty.call(this._nodes, e)) {
+			var t = (e) => this.removeEdge(this._edgeObjs[e]);
+			delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], P(this.children(e), (e) => {
+				this.setParent(e);
+			}), delete this._children[e]), P(h(this._in[e]), t), delete this._in[e], delete this._preds[e], P(h(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 (z(t)) t = q;
+		else {
+			t += "";
+			for (var n = t; !z(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;
+	}
+	_removeFromParentsChildList(e) {
+		delete this._children[this._parent[e]][e];
+	}
+	parent(e) {
+		if (this._isCompound) {
+			var t = this._parent[e];
+			if (t !== q) return t;
+		}
+	}
+	children(e) {
+		if (z(e) && (e = q), this._isCompound) {
+			var t = this._children[e];
+			if (t) return h(t);
+		} else if (e === q) return this.nodes();
+		else if (this.hasNode(e)) return [];
+	}
+	predecessors(e) {
+		var t = this._preds[e];
+		if (t) return h(t);
+	}
+	successors(e) {
+		var t = this._sucs[e];
+		if (t) return h(t);
+	}
+	neighbors(e) {
+		var t = this.predecessors(e);
+		if (t) return G(t, this.successors(e));
+	}
+	isLeaf(e) {
+		return (this.isDirected() ? this.successors(e) : this.neighbors(e)).length === 0;
+	}
+	filterNodes(e) {
+		var t = new this.constructor({
+			directed: this._isDirected,
+			multigraph: this._isMultigraph,
+			compound: this._isCompound
+		});
+		t.setGraph(this.graph());
+		var n = this;
+		P(this._nodes, function(n, r) {
+			e(r) && t.setNode(r, n);
+		}), P(this._edgeObjs, function(e) {
+			t.hasNode(e.v) && t.hasNode(e.w) && t.setEdge(e, n.edge(e));
+		});
+		var r = {};
+		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 && P(t.nodes(), function(e) {
+			t.setParent(e, i(e));
+		}), t;
+	}
+	setDefaultEdgeLabel(e) {
+		return i(e) || (e = o(e)), this._defaultEdgeLabelFn = e, this;
+	}
+	edgeCount() {
+		return this._edgeCount;
+	}
+	edges() {
+		return R(this._edgeObjs);
+	}
+	setPath(e, t) {
+		var n = this, r = arguments;
+		return V(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, z(n) || (n = "" + n);
+		var o = Q(this._isDirected, e, t, n);
+		if (Object.prototype.hasOwnProperty.call(this._edgeLabels, o)) return i && (this._edgeLabels[o] = r), this;
+		if (!z(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 = te(this._isDirected, e, t, n);
+		return e = s.v, t = s.w, Object.freeze(s), this._edgeObjs[o] = s, X(this._preds[t], e), X(this._sucs[e], t), this._in[t][o] = s, this._out[e][o] = s, this._edgeCount++, this;
+	}
+	edge(e, t, n) {
+		var r = arguments.length === 1 ? $(this._isDirected, arguments[0]) : Q(this._isDirected, e, t, n);
+		return this._edgeLabels[r];
+	}
+	hasEdge(e, t, n) {
+		var r = arguments.length === 1 ? $(this._isDirected, arguments[0]) : Q(this._isDirected, e, t, n);
+		return Object.prototype.hasOwnProperty.call(this._edgeLabels, r);
+	}
+	removeEdge(e, t, n) {
+		var r = arguments.length === 1 ? $(this._isDirected, arguments[0]) : Q(this._isDirected, e, t, n), i = this._edgeObjs[r];
+		return i && (e = i.v, t = i.w, delete this._edgeLabels[r], delete this._edgeObjs[r], Z(this._preds[t], e), Z(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
+	}
+	inEdges(e, t) {
+		var n = this._in[e];
+		if (n) {
+			var r = R(n);
+			return t ? I(r, function(e) {
+				return e.v === t;
+			}) : r;
+		}
+	}
+	outEdges(e, t) {
+		var n = this._out[e];
+		if (n) {
+			var r = R(n);
+			return t ? I(r, function(e) {
+				return e.w === t;
+			}) : r;
+		}
+	}
+	nodeEdges(e, t) {
+		var n = this.inEdges(e, t);
+		if (n) return n.concat(this.outEdges(e, t));
+	}
+};
+Y.prototype._nodeCount = 0, Y.prototype._edgeCount = 0;
+function X(e, t) {
+	e[t] ? e[t]++ : e[t] = 1;
+}
+function Z(e, t) {
+	--e[t] || delete e[t];
+}
+function Q(e, t, n, r) {
+	var i = "" + t, a = "" + n;
+	if (!e && i > a) {
+		var o = i;
+		i = a, a = o;
+	}
+	return i + J + a + J + (z(r) ? K : r);
+}
+function te(e, t, n, r) {
+	var i = "" + t, a = "" + n;
+	if (!e && i > a) {
+		var o = i;
+		i = a, a = o;
+	}
+	var s = {
+		v: i,
+		w: a
+	};
+	return r && (s.name = r), s;
+}
+function $(e, t) {
+	return Q(e, t.v, t.w, t.name);
+}
+//#endregion
+export { I as a, j as c, R as i, O as l, V as n, P as o, z as r, N as s, Y as t, S as u };