@nxgt/material 1.13.0 → 1.16.1

package/dist/graphlib-BzZgFilE.js

@@ -0,0 +1,493 @@
+import { Cm as e } from "./main-rnuPG-xT.js";
+import { G as t, J as n, K as r, X as i, nt as a, q as o, rt as s, tt as c } from "./lib-CuGr3v8i.js";
+import { B as l, C as u, E as d, F as f, I as p, M as m, N as h, P as ee, S as te, a as ne, c as g, f as _, i as re, k as v, n as ie, o as ae, s as y, t as b, x, y as S } from "./isArrayLikeObject-VG1KOJ3m.js";
+//#region node_modules/lodash-es/noop.js
+function oe() {}
+//#endregion
+//#region node_modules/lodash-es/_arrayEach.js
+function C(e, t) {
+	for (var n = -1, r = e == null ? 0 : e.length; ++n < r && t(e[n], n, e) !== !1;);
+	return e;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseFindIndex.js
+function w(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 se(e) {
+	return e !== e;
+}
+//#endregion
+//#region node_modules/lodash-es/_strictIndexOf.js
+function ce(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 le(e, t, n) {
+	return t === t ? ce(e, t, n) : w(e, se, n);
+}
+//#endregion
+//#region node_modules/lodash-es/_arrayIncludes.js
+function ue(e, t) {
+	return !!(e != null && e.length) && le(e, t, 0) > -1;
+}
+//#endregion
+//#region node_modules/lodash-es/_isFlattenable.js
+var T = l ? l.isConcatSpreadable : void 0;
+function de(e) {
+	return f(e) || S(e) || !!(T && e && e[T]);
+}
+//#endregion
+//#region node_modules/lodash-es/_baseFlatten.js
+function E(e, t, n, r, i) {
+	var o = -1, s = e.length;
+	for (n ||= de, i ||= []; ++o < s;) {
+		var c = e[o];
+		t > 0 && n(c) ? t > 1 ? E(c, t - 1, n, r, i) : a(i, c) : r || (i[i.length] = c);
+	}
+	return i;
+}
+//#endregion
+//#region node_modules/lodash-es/_arrayReduce.js
+function fe(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/_baseIsMatch.js
+var pe = 1, me = 2;
+function he(e, n, r, i) {
+	var a = r.length, o = a, s = !i;
+	if (e == null) return !o;
+	for (e = Object(e); a--;) {
+		var c = r[a];
+		if (s && c[2] ? c[1] !== e[c[0]] : !(c[0] in e)) return !1;
+	}
+	for (; ++a < o;) {
+		c = r[a];
+		var l = c[0], u = e[l], d = c[1];
+		if (s && c[2]) {
+			if (u === void 0 && !(l in e)) return !1;
+		} else {
+			var f = new re();
+			if (i) var p = i(u, d, l, e, n, f);
+			if (!(p === void 0 ? t(d, u, pe | me, i, f) : p)) return !1;
+		}
+	}
+	return !0;
+}
+//#endregion
+//#region node_modules/lodash-es/_isStrictComparable.js
+function D(e) {
+	return e === e && !ee(e);
+}
+//#endregion
+//#region node_modules/lodash-es/_getMatchData.js
+function ge(e) {
+	for (var t = s(e), n = t.length; n--;) {
+		var r = t[n], i = e[r];
+		t[n] = [
+			r,
+			i,
+			D(i)
+		];
+	}
+	return t;
+}
+//#endregion
+//#region node_modules/lodash-es/_matchesStrictComparable.js
+function O(e, t) {
+	return function(n) {
+		return n != null && n[e] === t && (t !== void 0 || e in Object(n));
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/_baseMatches.js
+function _e(e) {
+	var t = ge(e);
+	return t.length == 1 && t[0][2] ? O(t[0][0], t[0][1]) : function(n) {
+		return n === e || he(n, e, t);
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/_baseHasIn.js
+function k(e, t) {
+	return e != null && t in Object(e);
+}
+//#endregion
+//#region node_modules/lodash-es/_hasPath.js
+function A(e, t, n) {
+	t = g(t, e);
+	for (var r = -1, i = t.length, a = !1; ++r < i;) {
+		var o = y(t[r]);
+		if (!(a = e != null && n(e, o))) break;
+		e = e[o];
+	}
+	return a || ++r != i ? a : (i = e == null ? 0 : e.length, !!i && te(i) && d(o, i) && (f(e) || S(e)));
+}
+//#endregion
+//#region node_modules/lodash-es/hasIn.js
+function j(e, t) {
+	return e != null && A(e, t, k);
+}
+//#endregion
+//#region node_modules/lodash-es/_baseMatchesProperty.js
+var M = 1, N = 2;
+function P(e, n) {
+	return _(e) && D(n) ? O(y(e), n) : function(r) {
+		var i = ne(r, e);
+		return i === void 0 && i === n ? j(r, e) : t(n, i, M | N);
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/_baseProperty.js
+function F(e) {
+	return function(t) {
+		return t?.[e];
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/_basePropertyDeep.js
+function I(e) {
+	return function(t) {
+		return ae(t, e);
+	};
+}
+//#endregion
+//#region node_modules/lodash-es/property.js
+function ve(e) {
+	return _(e) ? F(y(e)) : I(e);
+}
+//#endregion
+//#region node_modules/lodash-es/_baseIteratee.js
+function L(e) {
+	return typeof e == "function" ? e : e == null ? h : typeof e == "object" ? f(e) ? P(e[0], e[1]) : _e(e) : ve(e);
+}
+//#endregion
+//#region node_modules/lodash-es/_baseForOwn.js
+function R(e, t) {
+	return e && ie(e, t, s);
+}
+//#endregion
+//#region node_modules/lodash-es/_createBaseEach.js
+function ye(e, t) {
+	return function(n, r) {
+		if (n == null) return n;
+		if (!x(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 z = ye(R);
+//#endregion
+//#region node_modules/lodash-es/_arrayIncludesWith.js
+function be(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 B(e) {
+	return typeof e == "function" ? e : h;
+}
+//#endregion
+//#region node_modules/lodash-es/forEach.js
+function V(e, t) {
+	return (f(e) ? C : z)(e, B(t));
+}
+//#endregion
+//#region node_modules/lodash-es/_baseFilter.js
+function xe(e, t) {
+	var n = [];
+	return z(e, function(e, r, i) {
+		t(e, r, i) && n.push(e);
+	}), n;
+}
+//#endregion
+//#region node_modules/lodash-es/filter.js
+function H(e, t) {
+	return (f(e) ? c : xe)(e, L(t, 3));
+}
+//#endregion
+//#region node_modules/lodash-es/_baseValues.js
+function Se(e, t) {
+	return p(t, function(t) {
+		return e[t];
+	});
+}
+//#endregion
+//#region node_modules/lodash-es/values.js
+function U(e) {
+	return e == null ? [] : Se(e, s(e));
+}
+//#endregion
+//#region node_modules/lodash-es/isUndefined.js
+function W(e) {
+	return e === void 0;
+}
+//#endregion
+//#region node_modules/lodash-es/_baseReduce.js
+function Ce(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 G(e, t, n) {
+	var r = f(e) ? fe : Ce, i = arguments.length < 3;
+	return r(e, L(t, 4), n, i, z);
+}
+//#endregion
+//#region node_modules/lodash-es/_createSet.js
+var we = i && 1 / r(new i([, -0]))[1] == Infinity ? function(e) {
+	return new i(e);
+} : oe, Te = 200;
+function Ee(e, t, i) {
+	var a = -1, s = ue, c = e.length, l = !0, u = [], d = u;
+	if (i) l = !1, s = be;
+	else if (c >= Te) {
+		var f = t ? null : we(e);
+		if (f) return r(f);
+		l = !1, s = o, d = new n();
+	} else d = t ? [] : u;
+	outer: for (; ++a < c;) {
+		var p = e[a], m = t ? t(p) : p;
+		if (p = i || p !== 0 ? p : 0, l && m === m) {
+			for (var h = d.length; h--;) if (d[h] === m) continue outer;
+			t && d.push(m), u.push(p);
+		} else s(d, m, i) || (d !== u && d.push(m), u.push(p));
+	}
+	return u;
+}
+//#endregion
+//#region node_modules/lodash-es/union.js
+var De = u(function(e) {
+	return Ee(E(e, 1, b, !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 = v(void 0), this._defaultEdgeLabelFn = v(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 m(e) || (e = v(e)), this._defaultNodeLabelFn = e, this;
+	}
+	nodeCount() {
+		return this._nodeCount;
+	}
+	nodes() {
+		return s(this._nodes);
+	}
+	sources() {
+		var t = this;
+		return H(this.nodes(), function(n) {
+			return e(t._in[n]);
+		});
+	}
+	sinks() {
+		var t = this;
+		return H(this.nodes(), function(n) {
+			return e(t._out[n]);
+		});
+	}
+	setNodes(e, t) {
+		var n = arguments, r = this;
+		return V(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], V(this.children(e), (e) => {
+				this.setParent(e);
+			}), delete this._children[e]), V(s(this._in[e]), t), delete this._in[e], delete this._preds[e], V(s(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 (W(t)) t = q;
+		else {
+			t += "";
+			for (var n = t; !W(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 (W(e) && (e = q), this._isCompound) {
+			var t = this._children[e];
+			if (t) return s(t);
+		} else if (e === q) return this.nodes();
+		else if (this.hasNode(e)) return [];
+	}
+	predecessors(e) {
+		var t = this._preds[e];
+		if (t) return s(t);
+	}
+	successors(e) {
+		var t = this._sucs[e];
+		if (t) return s(t);
+	}
+	neighbors(e) {
+		var t = this.predecessors(e);
+		if (t) return De(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;
+		V(this._nodes, function(n, r) {
+			e(r) && t.setNode(r, n);
+		}), V(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 && V(t.nodes(), function(e) {
+			t.setParent(e, i(e));
+		}), t;
+	}
+	setDefaultEdgeLabel(e) {
+		return m(e) || (e = v(e)), this._defaultEdgeLabelFn = e, this;
+	}
+	edgeCount() {
+		return this._edgeCount;
+	}
+	edges() {
+		return U(this._edgeObjs);
+	}
+	setPath(e, t) {
+		var n = this, r = arguments;
+		return G(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, W(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 (!W(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 = Oe(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 = U(n);
+			return t ? H(r, function(e) {
+				return e.v === t;
+			}) : r;
+		}
+	}
+	outEdges(e, t) {
+		var n = this._out[e];
+		if (n) {
+			var r = U(n);
+			return t ? H(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 + (W(r) ? K : r);
+}
+function Oe(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 { H as a, z as c, F as d, j as f, C as g, w as h, U as i, R as l, E as m, G as n, V as o, A as p, W as r, B as s, Y as t, L as u };

package/dist/{hooks-DReKyuyc.js → hooks-tbav1b16.js}

@@ -1,4 +1,4 @@
-import { l as e } from "./i18n-DtDrodl8.js";
+import { l as e } from "./i18n-CGol3PGw.js";
 import { F as t, I as n, N as r, P as i, n as a, t as o, w as s } from "./number.utils-BR3XO6me.js";
 import { useCallback as c, useEffect as l, useLayoutEffect as u, useMemo as d, useRef as f, useState as p } from "react";
 import { useNavigate as m, useSearchParams as h } from "react-router";

package/dist/hooks.js

@@ -1,3 +1,3 @@
-import { _ as e, a as t, c as n, g as r, h as i, i as a, l as o, n as s, o as c, r as l, s as u, t as d, v as f, y as p } from "./hooks-DReKyuyc.js";
+import { _ as e, a as t, c as n, g as r, h as i, i as a, l as o, n as s, o as c, r as l, s as u, t as d, v as f, y as p } from "./hooks-tbav1b16.js";
 import { L as m } from "./number.utils-BR3XO6me.js";
 export { f as applyResolvedTheme, l as buildOptions, a as extractNode, p as resolveTheme, e as useAllowedTransitions, r as useHeadingSpy, m as useIsClient, o as useIsMobile, i as useLocalizedDate, u as useNavigationHandler, n as useNavigationHandlers, c as useNumberFormatter, t as useOptions, s as useSearchParam, d as useTheme };