@pie-element/number-line 13.1.2-next.2 → 13.1.2-next.3

package/dist/browser/{impureFunctionsAny.generated-Bqfato71.js → impureFunctionsAny.generated-oSB8bQ6J.js}

@@ -1,4 +1,4 @@
-import { $ as e, $a as t, $i as n, $n as r, $o as i, $r as a, $t as o, A as s, Aa as c, Ai as l, An as u, Ao as d, Ar as f, As as p, At as m, B as h, Ba as g, Bi as _, Bn as v, Bo as y, Br as b, Bt as x, C as S, Ca as C, Ci as w, Cn as T, Co as E, Cr as D, Cs as O, Ct as k, D as A, Da as j, Di as M, Dn as N, Do as P, Dr as F, Ds as ee, Dt as I, E as te, Ea as ne, Ei as L, En as re, Eo as ie, Er as ae, Es as oe, Et as se, F as ce, Fa as le, Fi as ue, Fn as de, Fo as fe, Fr as pe, Fs as me, Ft as he, G as ge, Ga as _e, Gi as ve, Gn as ye, Go as be, Gr as xe, Gt as Se, H as Ce, Ha as we, Hi as Te, Hn as Ee, Ho as De, Hr as Oe, Ht as ke, I as Ae, Ia as je, Ii as Me, In as Ne, Io as Pe, Ir as Fe, It as Ie, J as R, Ja as Le, Ji as Re, Jn as ze, Jo as Be, Jr as Ve, Jt as He, K as Ue, Ka as We, Ki as Ge, Kn as Ke, Ko as z, Kr as qe, Kt as Je, L as Ye, La as Xe, Li as Ze, Ln as Qe, Lo as $e, Lr as et, Lt as tt, M as nt, Ma as rt, Mi as it, Mn as at, Mo as ot, Mr as st, Ms as ct, Mt as lt, N as ut, Na as dt, Ni as ft, Nn as pt, No as mt, Nr as ht, Ns as gt, Nt as _t, O as vt, Oa as yt, Oi as bt, On as xt, Oo as St, Or as Ct, Os as wt, Ot as Tt, P as Et, Pa as Dt, Pi as Ot, Pn as kt, Po as At, Pr as jt, Ps as Mt, Pt as Nt, Q as B, Qa as Pt, Qi as Ft, Qn as It, Qo as Lt, Qr as Rt, Qt as zt, R as Bt, Ra as Vt, Ri as Ht, Rn as Ut, Ro as Wt, Rr as V, Rs as Gt, Rt as Kt, S as qt, Sa as Jt, Si as Yt, Sn as Xt, So as Zt, Sr as Qt, Ss as $t, St as en, T as tn, Ta as nn, Ti as rn, Tn as an, To as on, Tr as sn, Ts as cn, Tt as ln, U as un, Ua as dn, Ui as fn, Un as pn, Uo as mn, Ur as hn, Ut as gn, V as _n, Va as vn, Vi as yn, Vn as bn, Vo as xn, Vr as Sn, Vt as Cn, W as wn, Wa as H, Wi as Tn, Wn as En, Wo as Dn, Wr as On, Wt as kn, X as An, Xa as jn, Xi as Mn, Xn as Nn, Xo as U, Xr as Pn, Xt as Fn, Y as In, Ya as Ln, Yi as Rn, Yn as zn, Yo as Bn, Yr as Vn, Yt as Hn, Z as Un, Za as Wn, Zi as Gn, Zn as Kn, Zo as qn, Zr as Jn, Zt as Yn, _a as Xn, _i as Zn, _n as Qn, _o as $n, _r as er, _s as W, _t as tr, aa as nr, ai as rr, an as ir, ao as ar, ar as or, as as sr, at as cr, ba as lr, bi as ur, bn as dr, bo as fr, br as pr, bs as mr, bt as hr, ca as gr, ci as _r, cn as vr, co as yr, cr as br, cs as xr, ct as Sr, da as Cr, di as wr, dn as Tr, do as Er, dr as Dr, ds as Or, dt as kr, ea as Ar, ei as jr, en as Mr, eo as Nr, er as Pr, es as Fr, et as Ir, fa as Lr, fi as Rr, fn as zr, fo as Br, fr as Vr, fs as Hr, ft as Ur, ga as Wr, gi as Gr, gn as Kr, go as qr, gr as Jr, gs as Yr, gt as Xr, ha as Zr, hi as Qr, hn as $r, ho as ei, hr as ti, hs as ni, ht as ri, ia as ii, ii as ai, in as oi, io as si, ir as ci, is as li, it as ui, j as di, ja as fi, ji as pi, jn as mi, jo as hi, jr as gi, js as G, jt as _i, k as vi, ka as yi, ki as bi, kn as xi, ko as Si, kr as Ci, ks as wi, kt as Ti, la as Ei, li as Di, ln as Oi, lo as ki, lr as Ai, ls as ji, lt as Mi, ma as Ni, mi as Pi, mn as Fi, mo as Ii, mr as Li, ms as K, mt as Ri, na as zi, ni as Bi, nn as Vi, no as Hi, nr as Ui, ns as Wi, nt as Gi, oa as Ki, oi as qi, on as Ji, oo as Yi, or as Xi, os as q, ot as Zi, pa as Qi, pi as $i, pn as ea, po as ta, pr as na, ps as ra, pt as ia, q as aa, qa as oa, qi as sa, qn as ca, qo as la, qr as ua, qt as da, ra as fa, ri as pa, rn as ma, ro as ha, rr as ga, rs as _a, rt as va, sa as ya, si as ba, sn as xa, so as Sa, sr as Ca, ss as wa, st as Ta, ta as Ea, ti as Da, tn as Oa, to as ka, tr as Aa, ts as ja, tt as Ma, ua as Na, ui as Pa, un as Fa, uo as Ia, ur as La, us as Ra, ut as za, va as Ba, vi as Va, vn as Ha, vo as J, vr as Ua, vs as Wa, vt as Ga, w as Ka, wa as qa, wi as Ja, wn as Ya, wo as Xa, wr as Za, ws as Qa, wt as $a, x as eo, xa as to, xi as no, xn as ro, xo as io, xr as ao, xs as Y, xt as oo, ya as so, yi as co, yn as lo, yr as uo, ys as fo, yt as po, z as mo, za as ho, zi as go, zn as _o, zo as vo, zr as yo, zt as bo } from "./dist-D5T-OaLo.js";
+import { $ as e, $a as t, $i as n, $n as r, $o as i, $r as a, $t as o, A as s, Aa as c, Ai as l, An as u, Ao as d, Ar as f, As as p, At as m, B as h, Ba as g, Bi as _, Bn as v, Bo as y, Br as b, Bt as x, C as S, Ca as C, Ci as w, Cn as T, Co as E, Cr as D, Cs as O, Ct as k, D as A, Da as j, Di as M, Dn as N, Do as P, Dr as F, Ds as I, Dt as ee, E as te, Ea as L, Ei as ne, En as re, Eo as ie, Er as R, Es as ae, Et as oe, F as se, Fa as ce, Fi as le, Fn as ue, Fo as de, Fr as fe, Ft as pe, G as me, Ga as he, Gi as ge, Gn as _e, Go as z, Gr as ve, Gt as ye, H as be, Ha as xe, Hi as Se, Hn as Ce, Ho as we, Hr as Te, Ht as Ee, I as De, Ia as Oe, Ii as ke, In as Ae, Io as je, Ir as Me, It as B, J as Ne, Ja as Pe, Ji as Fe, Jn as Ie, Jo as Le, Jr as Re, Jt as ze, K as Be, Ka as Ve, Ki as He, Kn as Ue, Ko as We, Kr as Ge, Kt as Ke, L as qe, La as Je, Li as Ye, Ln as Xe, Lo as Ze, Lr as Qe, Ls as $e, Lt as et, M as tt, Ma as nt, Mi as rt, Mn as it, Mo as at, Mr as ot, Ms as st, Mt as ct, N as lt, Na as ut, Ni as dt, Nn as ft, No as pt, Nr as mt, Ns as ht, Nt as gt, O as _t, Oa as vt, Oi as yt, On as bt, Oo as xt, Or as St, Os as Ct, Ot as wt, P as Tt, Pa as Et, Pi as Dt, Pn as Ot, Po as kt, Pr as At, Ps as jt, Pt as Mt, Q as V, Qa as Nt, Qi as Pt, Qn as Ft, Qo as It, Qr as Lt, Qt as Rt, R as zt, Ra as Bt, Ri as Vt, Rn as Ht, Ro as Ut, Rr as H, Rt as Wt, S as Gt, Sa as Kt, Si as qt, Sn as Jt, So as Yt, Sr as Xt, Ss as Zt, St as Qt, T as $t, Ta as en, Ti as tn, Tn as nn, To as rn, Tr as an, Ts as on, Tt as sn, U as cn, Ua as ln, Ui as un, Un as dn, Uo as fn, Ur as pn, Ut as mn, V as hn, Va as gn, Vi as _n, Vn as vn, Vo as yn, Vr as bn, Vt as xn, W as Sn, Wa as U, Wi as Cn, Wn as wn, Wo as Tn, Wr as En, Wt as Dn, X as On, Xa as kn, Xi as An, Xn as jn, Xo as Mn, Xr as Nn, Xt as Pn, Y as Fn, Ya as In, Yi as Ln, Yn as Rn, Yo as W, Yr as zn, Yt as Bn, Z as Vn, Za as Hn, Zi as Un, Zn as Wn, Zo as Gn, Zr as Kn, Zt as qn, _a as Jn, _i as Yn, _n as Xn, _o as Zn, _r as Qn, _s as $n, _t as er, aa as tr, ai as nr, an as rr, ao as ir, ar, as as G, at as or, ba as sr, bi as cr, bn as lr, bo as ur, br as dr, bs as K, bt as fr, ca as pr, ci as mr, cn as hr, co as gr, cr as _r, cs as vr, ct as yr, da as br, di as xr, dn as Sr, do as Cr, dr as wr, ds as Tr, dt as Er, ea as Dr, ei as Or, en as kr, eo as Ar, er as jr, es as Mr, et as Nr, fa as Pr, fi as Fr, fn as Ir, fo as Lr, fr as Rr, fs as zr, ft as Br, ga as Vr, gi as Hr, gn as Ur, go as Wr, gr as Gr, gs as q, gt as Kr, ha as qr, hi as Jr, hn as Yr, ho as Xr, hr as Zr, hs as Qr, ht as $r, ia as ei, ii as ti, in as ni, io as ri, ir as ii, is as ai, it as oi, j as si, ja as ci, ji as li, jn as ui, jo as di, jr as fi, js as pi, jt as mi, k as hi, ka as gi, ki as _i, kn as vi, ko as yi, kr as bi, ks as xi, kt as Si, la as Ci, li as wi, ln as Ti, lo as Ei, lr as Di, ls as Oi, lt as ki, ma as Ai, mi as ji, mn as Mi, mo as Ni, mr as Pi, ms as Fi, mt as Ii, na as Li, ni as Ri, nn as zi, no as Bi, nr as Vi, ns as Hi, nt as Ui, oa as Wi, oi as Gi, on as Ki, oo as qi, or as Ji, os as Yi, ot as Xi, pa as Zi, pi as Qi, pn as $i, po as ea, pr as ta, ps as J, pt as na, q as ra, qa as ia, qi as aa, qn as oa, qo as sa, qr as ca, qt as la, ra as ua, ri as da, rn as fa, ro as pa, rr as ma, rs as ha, rt as ga, sa as _a, si as va, sn as ya, so as ba, sr as xa, ss as Sa, st as Ca, ta as wa, ti as Ta, tn as Ea, to as Da, tr as Oa, ts as ka, tt as Aa, ua as ja, ui as Ma, un as Na, uo as Pa, ur as Fa, us as Ia, ut as La, va as Ra, vi as za, vn as Ba, vo as Y, vr as Va, vs as Ha, vt as Ua, w as Wa, wa as Ga, wi as Ka, wn as qa, wo as Ja, wr as Ya, ws as Xa, wt as Za, x as Qa, xa as $a, xi as eo, xn as to, xo as no, xr as ro, xs as io, xt as ao, ya as oo, yi as so, yn as co, yo as lo, yr as uo, ys as fo, yt as po, z as mo, za as ho, zi as go, zn as _o, zo as vo, zr as yo, zt as bo } from "./dist-CVf3Suzc.js";
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/keywords.js
 var xo = new Set(["end"]), So = /* #__PURE__ */ z("Node", ["mathWithTransform"], (e) => {
 	var { mathWithTransform: t } = e;
@@ -18,7 +18,7 @@ var xo = new Set(["end"]), So = /* #__PURE__ */ z("Node", ["mathWithTransform"],
 		compile() {
 			var e = this._compile(t, {}), r = {}, i = null;
 			function a(t) {
-				var a = wt(t);
+				var a = I(t);
 				return n(a), e(a, r, i);
 			}
 			return { evaluate: a };
@@ -33,7 +33,7 @@ var xo = new Set(["end"]), So = /* #__PURE__ */ z("Node", ["mathWithTransform"],
 			throw Error("Cannot run map on a Node interface");
 		}
 		_ifNode(e) {
-			if (!K(e)) throw TypeError("Callback function must return a Node");
+			if (!J(e)) throw TypeError("Callback function must return a Node");
 			return e;
 		}
 		traverse(e) {
@@ -67,7 +67,7 @@ var xo = new Set(["end"]), So = /* #__PURE__ */ z("Node", ["mathWithTransform"],
 			});
 		}
 		equals(e) {
-			return e ? this.type === e.type && Bn(this, e) : !1;
+			return e ? this.type === e.type && Le(this, e) : !1;
 		}
 		toString(e) {
 			var t = this._getCustomString(e);
@@ -116,7 +116,7 @@ var xo = new Set(["end"]), So = /* #__PURE__ */ z("Node", ["mathWithTransform"],
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js
 function X(e) {
-	return e && e.isIndexError ? new y(e.index + 1, e.min + 1, e.max === void 0 ? void 0 : e.max + 1) : e;
+	return e && e.isIndexError ? new vo(e.index + 1, e.min + 1, e.max === void 0 ? void 0 : e.max + 1) : e;
 }
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/node/utils/access.js
@@ -129,7 +129,7 @@ function Co(e) {
 			if (typeof e == "string") return t(e, n);
 			if (typeof e == "object") {
 				if (!n.isObjectProperty()) throw TypeError("Cannot apply a numeric index as object property");
-				return G(e, n.getObjectProperty());
+				return p(e, n.getObjectProperty());
 			} else throw TypeError("Cannot apply index: unsupported type of object");
 		} catch (e) {
 			throw X(e);
@@ -140,14 +140,14 @@ function Co(e) {
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js
 var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 	var { subset: t, Node: n } = e, r = Co({ subset: t });
-	function i(e) {
-		return !(Lt(e) || Fr(e) || q(e) || Ra(e) || Yr(e) || Wa(e) || Y(e));
+	function a(e) {
+		return !(Gn(e) || i(e) || G(e) || Oi(e) || Qr(e) || $n(e) || K(e));
 	}
-	class a extends n {
+	class o extends n {
 		constructor(e, t) {
 			var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !1;
-			if (super(), !K(e)) throw TypeError("Node expected for parameter \"object\"");
-			if (!Hr(t)) throw TypeError("IndexNode expected for parameter \"index\"");
+			if (super(), !J(e)) throw TypeError("Node expected for parameter \"object\"");
+			if (!Tr(t)) throw TypeError("IndexNode expected for parameter \"index\"");
 			this.object = e, this.index = t, this.optionalChaining = n;
 		}
 		get name() {
@@ -160,7 +160,7 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 			return !0;
 		}
 		_compile(e, t) {
-			var n = this.object._compile(e, t), i = this.index._compile(e, t), a = this.optionalChaining, o = Lt(this.object) && this.object.optionalChaining;
+			var n = this.object._compile(e, t), i = this.index._compile(e, t), a = this.optionalChaining, o = Gn(this.object) && this.object.optionalChaining;
 			if (this.index.isObjectProperty()) {
 				var s = this.index.getObjectProperty();
 				return function(e, t, r) {
@@ -169,7 +169,7 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 						i.optionalShortCircuit = !0;
 						return;
 					}
-					if (!(o && i != null && i.optionalShortCircuit)) return G(c, s);
+					if (!(o && i != null && i.optionalShortCircuit)) return p(c, s);
 				};
 			} else return function(e, t, s) {
 				var c = s || {}, l = n(e, t, c);
@@ -184,24 +184,24 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 			e(this.object, "object", this), e(this.index, "index", this);
 		}
 		map(e) {
-			return new a(this._ifNode(e(this.object, "object", this)), this._ifNode(e(this.index, "index", this)), this.optionalChaining);
+			return new o(this._ifNode(e(this.object, "object", this)), this._ifNode(e(this.index, "index", this)), this.optionalChaining);
 		}
 		clone() {
-			return new a(this.object, this.index, this.optionalChaining);
+			return new o(this.object, this.index, this.optionalChaining);
 		}
 		_toString(e) {
 			var t = this.object.toString(e);
-			i(this.object) && (t = "(" + t + ")");
+			a(this.object) && (t = "(" + t + ")");
 			var n = this.optionalChaining ? this.index.dotNotation ? "?" : "?." : "";
 			return t + n + this.index.toString(e);
 		}
 		_toHTML(e) {
 			var t = this.object.toHTML(e);
-			return i(this.object) && (t = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + t + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), t + this.index.toHTML(e);
+			return a(this.object) && (t = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + t + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), t + this.index.toHTML(e);
 		}
 		_toTex(e) {
 			var t = this.object.toTex(e);
-			return i(this.object) && (t = "\\left(' + object + '\\right)"), t + this.index.toTex(e);
+			return a(this.object) && (t = "\\left(' + object + '\\right)"), t + this.index.toTex(e);
 		}
 		toJSON() {
 			return {
@@ -212,10 +212,10 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 			};
 		}
 		static fromJSON(e) {
-			return new a(e.object, e.index, e.optionalChaining);
+			return new o(e.object, e.index, e.optionalChaining);
 		}
 	}
-	return J(a, "name", wo), a;
+	return Y(o, "name", wo), o;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -223,7 +223,7 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 	var { Node: t } = e;
 	class n extends t {
 		constructor(e) {
-			if (super(), this.items = e || [], !Array.isArray(this.items) || !this.items.every(K)) throw TypeError("Array containing Nodes expected");
+			if (super(), this.items = e || [], !Array.isArray(this.items) || !this.items.every(J)) throw TypeError("Array containing Nodes expected");
 		}
 		get type() {
 			return Eo;
@@ -232,18 +232,18 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 			return !0;
 		}
 		_compile(e, t) {
-			var n = vo(this.items, function(n) {
+			var n = Ut(this.items, function(n) {
 				return n._compile(e, t);
 			});
 			if (e.config.matrix !== "Array") {
 				var r = e.matrix;
 				return function(e, t, i) {
-					return r(vo(n, function(n) {
+					return r(Ut(n, function(n) {
 						return n(e, t, i);
 					}));
 				};
 			} else return function(e, t, r) {
-				return vo(n, function(n) {
+				return Ut(n, function(n) {
 					return n(e, t, r);
 				});
 			};
@@ -282,15 +282,15 @@ var wo = "AccessorNode", To = /* #__PURE__ */ z(wo, ["subset", "Node"], (e) => {
 		}
 		_toTex(e) {
 			function t(n, r) {
-				var i = n.some(Fr) && !n.every(Fr), a = r || i, o = a ? "&" : "\\\\", s = n.map(function(n) {
+				var a = n.some(i) && !n.every(i), o = r || a, s = o ? "&" : "\\\\", c = n.map(function(n) {
 					return n.items ? t(n.items, !r) : n.toTex(e);
-				}).join(o);
-				return i || !a || a && !r ? "\\begin{bmatrix}" + s + "\\end{bmatrix}" : s;
+				}).join(s);
+				return a || !o || o && !r ? "\\begin{bmatrix}" + c + "\\end{bmatrix}" : c;
 			}
 			return t(this.items, !1);
 		}
 	}
-	return J(n, "name", Eo), n;
+	return Y(n, "name", Eo), n;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -308,7 +308,7 @@ function Oo(e) {
 			if (typeof e == "string") return t(e, r, i);
 			if (typeof e == "object") {
 				if (!r.isObjectProperty()) throw TypeError("Cannot apply a numeric index as object property");
-				return gt(e, r.getObjectProperty(), i), e;
+				return st(e, r.getObjectProperty(), i), e;
 			} else throw TypeError("Cannot apply index: unsupported type of object");
 		} catch (e) {
 			throw X(e);
@@ -524,7 +524,7 @@ var ko = [
 ];
 function Ao(e, t) {
 	if (!t || t !== "auto") return e;
-	for (var n = e; Wa(n);) n = n.content;
+	for (var n = e; $n(n);) n = n.content;
 	return n;
 }
 function Z(e, t, n, r) {
@@ -536,7 +536,7 @@ function Z(e, t, n, r) {
 	}
 	if (a === "OperatorNode:multiply" && i.implicit && n !== "show") {
 		var c = Ao(i.args[0], t);
-		!(q(c) && r && r.getIdentifier() === "OperatorNode:divide" && O(Ao(r.args[0], t))) && !(c.getIdentifier() === "OperatorNode:divide" && O(Ao(c.args[0], t)) && q(Ao(c.args[1]))) && (o += 1);
+		!(G(c) && r && r.getIdentifier() === "OperatorNode:divide" && Zt(Ao(r.args[0], t))) && !(c.getIdentifier() === "OperatorNode:divide" && Zt(Ao(c.args[0], t)) && G(Ao(c.args[1]))) && (o += 1);
 	}
 	return o;
 }
@@ -546,7 +546,7 @@ function jo(e, t) {
 	var r = n.getIdentifier(), i = Z(n, t);
 	if (i === null) return null;
 	var a = ko[i][r];
-	if (U(a, "associativity")) {
+	if (W(a, "associativity")) {
 		if (a.associativity === "left") return "left";
 		if (a.associativity === "right") return "right";
 		throw Error("'" + r + "' has the invalid associativity '" + a.associativity + "'.");
@@ -557,7 +557,7 @@ function Mo(e, t, n) {
 	var r = n === "keep" ? e : e.getContent(), i = n === "keep" ? t : e.getContent(), a = r.getIdentifier(), o = i.getIdentifier(), s = Z(r, n);
 	if (s === null) return null;
 	var c = ko[s][a];
-	if (U(c, "associativeWith") && c.associativeWith instanceof Array) {
+	if (W(c, "associativeWith") && c.associativeWith instanceof Array) {
 		for (var l = 0; l < c.associativeWith.length; l++) if (c.associativeWith[l] === o) return !0;
 		return !1;
 	}
@@ -586,10 +586,10 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 	}
 	class s extends r {
 		constructor(e, t, n) {
-			if (super(), this.object = e, this.index = n ? t : null, this.value = n || t, !Y(e) && !Lt(e)) throw TypeError("SymbolNode or AccessorNode expected as \"object\"");
-			if (Y(e) && e.name === "end") throw Error("Cannot assign to symbol \"end\"");
-			if (this.index && !Hr(this.index)) throw TypeError("IndexNode expected as \"index\"");
-			if (!K(this.value)) throw TypeError("Node expected as \"value\"");
+			if (super(), this.object = e, this.index = n ? t : null, this.value = n || t, !K(e) && !Gn(e)) throw TypeError("SymbolNode or AccessorNode expected as \"object\"");
+			if (K(e) && e.name === "end") throw Error("Cannot assign to symbol \"end\"");
+			if (this.index && !Tr(this.index)) throw TypeError("IndexNode expected as \"index\"");
+			if (!J(this.value)) throw TypeError("Node expected as \"value\"");
 		}
 		get name() {
 			return this.index ? this.index.isObjectProperty() ? this.index.getObjectProperty() : "" : this.object.name || "";
@@ -603,7 +603,7 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 		_compile(e, t) {
 			var n = this.object._compile(e, t), r = this.index ? this.index._compile(e, t) : null, o = this.value._compile(e, t), s = this.object.name;
 			if (!this.index) {
-				if (!Y(this.object)) throw TypeError("SymbolNode expected as object");
+				if (!K(this.object)) throw TypeError("SymbolNode expected as object");
 				return function(e, t, n) {
 					var r = o(e, t, n);
 					return e.set(s, r), r;
@@ -612,9 +612,9 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 				var c = this.index.getObjectProperty();
 				return function(e, t, r) {
 					var i = n(e, t, r), a = o(e, t, r);
-					return gt(i, c, a), a;
+					return st(i, c, a), a;
 				};
-			} else if (Y(this.object)) return function(e, t, i) {
+			} else if (K(this.object)) return function(e, t, i) {
 				var c = n(e, t, i), l = o(e, t, i), u = r(e, t, c);
 				return e.set(s, a(c, u, l)), l;
 			};
@@ -623,8 +623,8 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 				if (this.object.index.isObjectProperty()) {
 					var u = this.object.index.getObjectProperty();
 					return function(e, t, n) {
-						var i = l(e, t, n), s = G(i, u), c = r(e, t, s), d = o(e, t, n);
-						return gt(i, u, a(s, c, d)), d;
+						var i = l(e, t, n), s = p(i, u), c = r(e, t, s), d = o(e, t, n);
+						return st(i, u, a(s, c, d)), d;
 					};
 				} else {
 					var d = this.object.index._compile(e, t);
@@ -668,7 +668,7 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 			return o(this, e && e.parenthesis, e && e.implicit) && (r = `\\left(${r}\\right)`), t + n + "=" + r;
 		}
 	}
-	return J(s, "name", Po), s;
+	return Y(s, "name", Po), s;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -679,7 +679,7 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 			if (super(), !Array.isArray(e)) throw Error("Array expected");
 			this.blocks = e.map(function(e) {
 				var t = e && e.node, n = e && e.visible !== void 0 ? e.visible : !0;
-				if (!K(t)) throw TypeError("Property \"node\" must be a Node");
+				if (!J(t)) throw TypeError("Property \"node\" must be a Node");
 				if (typeof n != "boolean") throw TypeError("Property \"visible\" must be a boolean");
 				return {
 					node: t,
@@ -694,7 +694,7 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 			return !0;
 		}
 		_compile(e, n) {
-			var r = vo(this.blocks, function(t) {
+			var r = Ut(this.blocks, function(t) {
 				return {
 					evaluate: t.node._compile(e, n),
 					visible: t.visible
@@ -702,7 +702,7 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 			});
 			return function(e, n, i) {
 				var a = [];
-				return $e(r, function(t) {
+				return je(r, function(t) {
 					var r = t.evaluate(e, n, i);
 					t.visible && a.push(r);
 				}), new t(a);
@@ -754,7 +754,7 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 			}).join("\\;\\;\n");
 		}
 	}
-	return J(r, "name", Io), r;
+	return Y(r, "name", Io), r;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -763,18 +763,18 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 	function n(e) {
 		if (typeof e == "number" || typeof e == "boolean" || typeof e == "string") return !!e;
 		if (e) {
-			if (Wi(e)) return !e.isZero();
-			if (sr(e)) return !!(e.re || e.im);
-			if ($t(e)) return !!e.value;
+			if (ka(e)) return !e.isZero();
+			if (ai(e)) return !!(e.re || e.im);
+			if (io(e)) return !!e.value;
 		}
 		if (e == null) return !1;
-		throw TypeError("Unsupported type of condition \"" + Qa(e) + "\"");
+		throw TypeError("Unsupported type of condition \"" + O(e) + "\"");
 	}
 	class r extends t {
 		constructor(e, t, n) {
-			if (super(), !K(e)) throw TypeError("Parameter condition must be a Node");
-			if (!K(t)) throw TypeError("Parameter trueExpr must be a Node");
-			if (!K(n)) throw TypeError("Parameter falseExpr must be a Node");
+			if (super(), !J(e)) throw TypeError("Parameter condition must be a Node");
+			if (!J(t)) throw TypeError("Parameter trueExpr must be a Node");
+			if (!J(n)) throw TypeError("Parameter falseExpr must be a Node");
 			this.condition = e, this.trueExpr = t, this.falseExpr = n;
 		}
 		get type() {
@@ -829,11 +829,11 @@ var Po = "AssignmentNode", Fo = /* #__PURE__ */ z(Po, [
 			return "\\begin{cases} {" + this.trueExpr.toTex(e) + "}, &\\quad{\\text{if }\\;" + this.condition.toTex(e) + "}\\\\{" + this.falseExpr.toTex(e) + "}, &\\quad{\\text{otherwise}}\\end{cases}";
 		}
 	}
-	return J(r, "name", Ro), r;
+	return Y(r, "name", Ro), r;
 }, {
 	isClass: !0,
 	isNode: !0
-}), Bo = /* @__PURE__ */ Gt((/* @__PURE__ */ me(((e, t) => {
+}), Bo = /* @__PURE__ */ $e((/* @__PURE__ */ jt(((e, t) => {
 	var n = Object.assign || function(e) {
 		for (var t = 1; t < arguments.length; t++) {
 			var n = arguments[t];
@@ -1127,7 +1127,7 @@ function Go(e) {
 	return (0, Bo.default)(e, { preserveFormatting: !0 });
 }
 function Ko(e, t) {
-	return t = t === void 0 ? !1 : t, t ? U(Wo, e) ? Wo[e] : "\\mathrm{" + Go(e) + "}" : U(Vo, e) ? Vo[e] : Go(e);
+	return t = t === void 0 ? !1 : t, t ? W(Wo, e) ? Wo[e] : "\\mathrm{" + Go(e) + "}" : W(Vo, e) ? Vo[e] : Go(e);
 }
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js
@@ -1157,11 +1157,11 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 			return new r(this.value);
 		}
 		_toString(e) {
-			return De(this.value, e);
+			return yn(this.value, e);
 		}
 		_toHTML(e) {
 			var t = this._toString(e);
-			switch (Qa(this.value)) {
+			switch (O(this.value)) {
 				case "number":
 				case "bigint":
 				case "BigNumber":
@@ -1184,7 +1184,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 		}
 		_toTex(e) {
 			var t = this._toString(e);
-			switch (Qa(this.value)) {
+			switch (O(this.value)) {
 				case "string": return "\\mathtt{" + Go(t) + "}";
 				case "number":
 				case "BigNumber":
@@ -1197,7 +1197,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 			}
 		}
 	}
-	return J(r, "name", qo), r;
+	return Y(r, "name", qo), r;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1211,7 +1211,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 		constructor(e, t, n) {
 			if (super(), typeof e != "string") throw TypeError("String expected for parameter \"name\"");
 			if (!Array.isArray(t)) throw TypeError("Array containing strings or objects expected for parameter \"params\"");
-			if (!K(n)) throw TypeError("Node expected for parameter \"expr\"");
+			if (!J(n)) throw TypeError("Node expected for parameter \"expr\"");
 			if (xo.has(e)) throw Error("Illegal function name, \"" + e + "\" is a reserved keyword");
 			var r = /* @__PURE__ */ new Set();
 			for (var i of t) {
@@ -1233,10 +1233,10 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 		}
 		_compile(e, n) {
 			var r = Object.create(n);
-			$e(this.params, function(e) {
+			je(this.params, function(e) {
 				r[e] = !0;
 			});
-			var i = this.expr, a = i._compile(e, r), o = this.name, s = this.params, c = Wt(this.types, ","), l = o + "(" + Wt(this.params, ", ") + ")";
+			var i = this.expr, a = i._compile(e, r), o = this.name, s = this.params, c = Ze(this.types, ","), l = o + "(" + Ze(this.params, ", ") + ")";
 			return function(e, n, r) {
 				var u = {};
 				u[c] = function() {
@@ -1279,16 +1279,16 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 			return new i(e.name, e.params, e.expr);
 		}
 		_toHTML(e) {
-			for (var t = e && e.parenthesis ? e.parenthesis : "keep", n = [], i = 0; i < this.params.length; i++) n.push("<span class=\"math-symbol math-parameter\">" + xn(this.params[i]) + "</span>");
+			for (var t = e && e.parenthesis ? e.parenthesis : "keep", n = [], i = 0; i < this.params.length; i++) n.push("<span class=\"math-symbol math-parameter\">" + y(this.params[i]) + "</span>");
 			var a = this.expr.toHTML(e);
-			return r(this, t, e && e.implicit) && (a = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + a + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), "<span class=\"math-function\">" + xn(this.name) + "</span><span class=\"math-parenthesis math-round-parenthesis\">(</span>" + n.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-parenthesis math-round-parenthesis\">)</span><span class=\"math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator\">=</span>" + a;
+			return r(this, t, e && e.implicit) && (a = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + a + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), "<span class=\"math-function\">" + y(this.name) + "</span><span class=\"math-parenthesis math-round-parenthesis\">(</span>" + n.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-parenthesis math-round-parenthesis\">)</span><span class=\"math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator\">=</span>" + a;
 		}
 		_toTex(e) {
 			var t = e && e.parenthesis ? e.parenthesis : "keep", n = this.expr.toTex(e);
 			return r(this, t, e && e.implicit) && (n = `\\left(${n}\\right)`), "\\mathrm{" + this.name + "}\\left(" + this.params.map(Ko).join(",") + "\\right)=" + n;
 		}
 	}
-	return J(i, "name", Yo), i;
+	return Y(i, "name", Yo), i;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1296,7 +1296,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 	var { Node: t, size: n } = e;
 	class r extends t {
 		constructor(e, t) {
-			if (super(), this.dimensions = e, this.dotNotation = t || !1, !Array.isArray(e) || !e.every(K)) throw TypeError("Array containing Nodes expected for parameter \"dimensions\"");
+			if (super(), this.dimensions = e, this.dotNotation = t || !1, !Array.isArray(e) || !e.every(J)) throw TypeError("Array containing Nodes expected for parameter \"dimensions\"");
 			if (this.dotNotation && !this.isObjectProperty()) throw Error("dotNotation only applicable for object properties");
 		}
 		get type() {
@@ -1306,20 +1306,20 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 			return !0;
 		}
 		_compile(e, t) {
-			var r = vo(this.dimensions, function(r, a) {
+			var r = Ut(this.dimensions, function(r, i) {
 				if (r.filter((e) => e.isSymbolNode && e.name === "end").length > 0) {
-					var o = Object.create(t);
-					o.end = !0;
-					var s = r._compile(e, o);
+					var a = Object.create(t);
+					a.end = !0;
+					var o = r._compile(e, a);
 					return function(e, t, r) {
-						if (!ra(r) && !i(r) && !mr(r)) throw TypeError("Cannot resolve \"end\": context must be a Matrix, Array, or string but is " + Qa(r));
-						var o = n(r), c = Object.create(t);
-						return c.end = o[a], s(e, c, r);
+						if (!zr(r) && !It(r) && !fo(r)) throw TypeError("Cannot resolve \"end\": context must be a Matrix, Array, or string but is " + O(r));
+						var a = n(r), s = Object.create(t);
+						return s.end = a[i], o(e, s, r);
 					};
 				} else return r._compile(e, t);
-			}), a = G(e, "index");
+			}), i = p(e, "index");
 			return function(e, t, n) {
-				return a(...vo(r, function(r) {
+				return i(...Ut(r, function(r) {
 					return r(e, t, n);
 				}));
 			};
@@ -1335,7 +1335,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 			return new r(this.dimensions.slice(0), this.dotNotation);
 		}
 		isObjectProperty() {
-			return this.dimensions.length === 1 && q(this.dimensions[0]) && typeof this.dimensions[0].value == "string";
+			return this.dimensions.length === 1 && G(this.dimensions[0]) && typeof this.dimensions[0].value == "string";
 		}
 		getObjectProperty() {
 			return this.isObjectProperty() ? this.dimensions[0].value : null;
@@ -1355,7 +1355,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 		}
 		_toHTML(e) {
 			for (var t = [], n = 0; n < this.dimensions.length; n++) t[n] = this.dimensions[n].toHTML();
-			return this.dotNotation ? "<span class=\"math-operator math-accessor-operator\">.</span><span class=\"math-symbol math-property\">" + xn(this.getObjectProperty()) + "</span>" : "<span class=\"math-parenthesis math-square-parenthesis\">[</span>" + t.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-parenthesis math-square-parenthesis\">]</span>";
+			return this.dotNotation ? "<span class=\"math-operator math-accessor-operator\">.</span><span class=\"math-symbol math-property\">" + y(this.getObjectProperty()) + "</span>" : "<span class=\"math-parenthesis math-square-parenthesis\">[</span>" + t.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-parenthesis math-square-parenthesis\">]</span>";
 		}
 		_toTex(e) {
 			var t = this.dimensions.map(function(t) {
@@ -1364,7 +1364,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 			return this.dotNotation ? "." + this.getObjectProperty() : "_{" + t.join(",") + "}";
 		}
 	}
-	return J(r, "name", Zo), r;
+	return Y(r, "name", Zo), r;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1373,7 +1373,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 	class n extends t {
 		constructor(e) {
 			if (super(), this.properties = e || {}, e && (typeof e != "object" || !Object.keys(e).every(function(t) {
-				return K(e[t]);
+				return J(e[t]);
 			}))) throw TypeError("Object containing Nodes expected");
 		}
 		get type() {
@@ -1384,32 +1384,32 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 		}
 		_compile(e, t) {
 			var n = {};
-			for (var r in this.properties) if (U(this.properties, r)) {
-				var i = mn(r), a = JSON.parse(i);
-				n[a] = G(this.properties, r)._compile(e, t);
+			for (var r in this.properties) if (W(this.properties, r)) {
+				var i = we(r), a = JSON.parse(i);
+				n[a] = p(this.properties, r)._compile(e, t);
 			}
 			return function(e, t, r) {
 				var i = {};
-				for (var a in n) U(n, a) && (i[a] = n[a](e, t, r));
+				for (var a in n) W(n, a) && (i[a] = n[a](e, t, r));
 				return i;
 			};
 		}
 		forEach(e) {
-			for (var t in this.properties) U(this.properties, t) && e(this.properties[t], "properties[" + mn(t) + "]", this);
+			for (var t in this.properties) W(this.properties, t) && e(this.properties[t], "properties[" + we(t) + "]", this);
 		}
 		map(e) {
 			var t = {};
-			for (var r in this.properties) U(this.properties, r) && (t[r] = this._ifNode(e(this.properties[r], "properties[" + mn(r) + "]", this)));
+			for (var r in this.properties) W(this.properties, r) && (t[r] = this._ifNode(e(this.properties[r], "properties[" + we(r) + "]", this)));
 			return new n(t);
 		}
 		clone() {
 			var e = {};
-			for (var t in this.properties) U(this.properties, t) && (e[t] = this.properties[t]);
+			for (var t in this.properties) W(this.properties, t) && (e[t] = this.properties[t]);
 			return new n(e);
 		}
 		_toString(e) {
 			var t = [];
-			for (var n in this.properties) U(this.properties, n) && t.push(mn(n) + ": " + this.properties[n].toString(e));
+			for (var n in this.properties) W(this.properties, n) && t.push(we(n) + ": " + this.properties[n].toString(e));
 			return "{" + t.join(", ") + "}";
 		}
 		toJSON() {
@@ -1423,16 +1423,16 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 		}
 		_toHTML(e) {
 			var t = [];
-			for (var n in this.properties) U(this.properties, n) && t.push("<span class=\"math-symbol math-property\">" + xn(n) + "</span><span class=\"math-operator math-assignment-operator math-property-assignment-operator math-binary-operator\">:</span>" + this.properties[n].toHTML(e));
+			for (var n in this.properties) W(this.properties, n) && t.push("<span class=\"math-symbol math-property\">" + y(n) + "</span><span class=\"math-operator math-assignment-operator math-property-assignment-operator math-binary-operator\">:</span>" + this.properties[n].toHTML(e));
 			return "<span class=\"math-parenthesis math-curly-parenthesis\">{</span>" + t.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-parenthesis math-curly-parenthesis\">}</span>";
 		}
 		_toTex(e) {
 			var t = [];
-			for (var n in this.properties) U(this.properties, n) && t.push("\\mathbf{" + n + ":} & " + this.properties[n].toTex(e) + "\\\\");
+			for (var n in this.properties) W(this.properties, n) && t.push("\\mathbf{" + n + ":} & " + this.properties[n].toTex(e) + "\\\\");
 			return "\\left\\{\\begin{array}{ll}" + t.join("\n") + "\\end{array}\\right\\}";
 		}
 	}
-	return J(n, "name", $o), n;
+	return Y(n, "name", $o), n;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1440,7 +1440,7 @@ var qo = "ConstantNode", Jo = /* #__PURE__ */ z(qo, ["Node", "isBounded"], (e) =
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/utils/scope.js
 function ts(e, t) {
-	return new oe(e, new cn(t), new Set(Object.keys(t)));
+	return new on(e, new Xa(t), new Set(Object.keys(t)));
 }
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js
@@ -1448,8 +1448,8 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	var { Node: t } = e;
 	function n(e, t) {
 		var r = e;
-		if (t === "auto") for (; Wa(r);) r = r.content;
-		return q(r) ? !0 : W(r) ? n(r.args[0], t) : !1;
+		if (t === "auto") for (; $n(r);) r = r.content;
+		return G(r) ? !0 : q(r) ? n(r.args[0], t) : !1;
 	}
 	function r(e, t, r, i, a) {
 		var o = Z(e, t, r), s = jo(e, t);
@@ -1507,14 +1507,14 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 				}));
 				break;
 		}
-		if (i.length >= 2 && e.getIdentifier() === "OperatorNode:multiply" && e.implicit && t !== "all" && r === "hide") for (var x = 1; x < c.length; ++x) n(i[x], t) && !c[x - 1] && (t !== "keep" || !Wa(i[x - 1])) && (c[x] = !0);
+		if (i.length >= 2 && e.getIdentifier() === "OperatorNode:multiply" && e.implicit && t !== "all" && r === "hide") for (var x = 1; x < c.length; ++x) n(i[x], t) && !c[x - 1] && (t !== "keep" || !$n(i[x - 1])) && (c[x] = !0);
 		return c;
 	}
 	class i extends t {
 		constructor(e, t, n, r, i) {
 			if (super(), typeof e != "string") throw TypeError("string expected for parameter \"op\"");
 			if (typeof t != "string") throw TypeError("string expected for parameter \"fn\"");
-			if (!Array.isArray(n) || !n.every(K)) throw TypeError("Array containing Nodes expected for parameter \"args\"");
+			if (!Array.isArray(n) || !n.every(J)) throw TypeError("Array containing Nodes expected for parameter \"args\"");
 			this.implicit = r === !0, this.isPercentage = i === !0, this.op = e, this.fn = t, this.args = n || [];
 		}
 		get type() {
@@ -1524,8 +1524,8 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return !0;
 		}
 		_compile(e, t) {
-			if (typeof this.fn != "string" || !ct(e, this.fn)) throw e[this.fn] ? Error("No access to function \"" + this.fn + "\"") : Error("Function " + this.fn + " missing in provided namespace \"math\"");
-			var n = G(e, this.fn), r = vo(this.args, function(n) {
+			if (typeof this.fn != "string" || !pi(e, this.fn)) throw e[this.fn] ? Error("No access to function \"" + this.fn + "\"") : Error("Function " + this.fn + " missing in provided namespace \"math\"");
+			var n = p(e, this.fn), r = Ut(this.args, function(n) {
 				return n._compile(e, t);
 			});
 			if (typeof n == "function" && n.rawArgs === !0) {
@@ -1544,7 +1544,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 					return n(o(e, t, r), s(e, t, r));
 				};
 			} else return function(e, t, i) {
-				return n.apply(null, vo(r, function(n) {
+				return n.apply(null, Ut(r, function(n) {
 					return n(e, t, i);
 				}));
 			};
@@ -1599,15 +1599,15 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			var t = e && e.parenthesis ? e.parenthesis : "keep", n = e && e.implicit ? e.implicit : "hide", i = this.args, a = r(this, t, n, i, !1);
 			if (i.length === 1) {
 				var o = jo(this, t), s = i[0].toHTML(e);
-				return a[0] && (s = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + s + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), o === "right" ? "<span class=\"math-operator math-unary-operator math-lefthand-unary-operator\">" + xn(this.op) + "</span>" + s : s + "<span class=\"math-operator math-unary-operator math-righthand-unary-operator\">" + xn(this.op) + "</span>";
+				return a[0] && (s = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + s + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), o === "right" ? "<span class=\"math-operator math-unary-operator math-lefthand-unary-operator\">" + y(this.op) + "</span>" + s : s + "<span class=\"math-operator math-unary-operator math-righthand-unary-operator\">" + y(this.op) + "</span>";
 			} else if (i.length === 2) {
 				var c = i[0].toHTML(e), l = i[1].toHTML(e);
-				return a[0] && (c = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + c + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), a[1] && (l = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + l + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), this.implicit && this.getIdentifier() === "OperatorNode:multiply" && n === "hide" ? c + "<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>" + l : c + "<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">" + xn(this.op) + "</span>" + l;
+				return a[0] && (c = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + c + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), a[1] && (l = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + l + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), this.implicit && this.getIdentifier() === "OperatorNode:multiply" && n === "hide" ? c + "<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>" + l : c + "<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">" + y(this.op) + "</span>" + l;
 			} else {
 				var u = i.map(function(t, n) {
 					return t = t.toHTML(e), a[n] && (t = "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + t + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>"), t;
 				});
-				return i.length > 2 && (this.getIdentifier() === "OperatorNode:add" || this.getIdentifier() === "OperatorNode:multiply") ? this.implicit && this.getIdentifier() === "OperatorNode:multiply" && n === "hide" ? u.join("<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>") : u.join("<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">" + xn(this.op) + "</span>") : "<span class=\"math-function\">" + xn(this.fn) + "</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>" + u.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-paranthesis math-round-parenthesis\">)</span>";
+				return i.length > 2 && (this.getIdentifier() === "OperatorNode:add" || this.getIdentifier() === "OperatorNode:multiply") ? this.implicit && this.getIdentifier() === "OperatorNode:multiply" && n === "hide" ? u.join("<span class=\"math-operator math-binary-operator math-implicit-binary-operator\"></span>") : u.join("<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">" + y(this.op) + "</span>") : "<span class=\"math-function\">" + y(this.fn) + "</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>" + u.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-paranthesis math-round-parenthesis\">)</span>";
 			}
 		}
 		_toTex(e) {
@@ -1645,7 +1645,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return this.type + ":" + this.fn;
 		}
 	}
-	return J(i, "name", ns), i;
+	return Y(i, "name", ns), i;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1653,7 +1653,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	var { Node: t } = e;
 	class n extends t {
 		constructor(e) {
-			if (super(), !K(e)) throw TypeError("Node expected for parameter \"content\"");
+			if (super(), !J(e)) throw TypeError("Node expected for parameter \"content\"");
 			this.content = e;
 		}
 		get type() {
@@ -1696,7 +1696,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return !e || e && !e.parenthesis || e && e.parenthesis === "keep" ? `\\left(${this.content.toTex(e)}\\right)` : this.content.toTex(e);
 		}
 	}
-	return J(n, "name", is), n;
+	return Y(n, "name", is), n;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1713,7 +1713,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	}
 	class r extends t {
 		constructor(e, t, n) {
-			if (super(), !K(e) || !K(t) || n && !K(n)) throw TypeError("Node expected");
+			if (super(), !J(e) || !J(t) || n && !J(n)) throw TypeError("Node expected");
 			if (arguments.length > 3) throw Error("Too many arguments");
 			this.start = e, this.end = t, this.step = n || null;
 		}
@@ -1725,7 +1725,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 		}
 		needsEnd() {
 			return this.filter(function(e) {
-				return Y(e) && e.name === "end";
+				return K(e) && e.name === "end";
 			}).length > 0;
 		}
 		_compile(e, t) {
@@ -1787,7 +1787,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return r.end && (o = `\\left(${o}\\right)`), i += ":" + o, i;
 		}
 	}
-	return J(r, "name", os), r;
+	return Y(r, "name", os), r;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1816,7 +1816,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 		_compile(e, t) {
 			var n = this, r = this.params.map((n) => n._compile(e, t));
 			return function(t, i, a) {
-				for (var o, s = r[0](t, i, a), c = 0; c < n.conditionals.length; c++) if (o = s, s = r[c + 1](t, i, a), !G(e, n.conditionals[c])(o, s)) return !1;
+				for (var o, s = r[0](t, i, a), c = 0; c < n.conditionals.length; c++) if (o = s, s = r[c + 1](t, i, a), !p(e, n.conditionals[c])(o, s)) return !1;
 				return !0;
 			};
 		}
@@ -1850,7 +1850,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			for (var t = e && e.parenthesis ? e.parenthesis : "keep", r = Z(this, t, e && e.implicit), i = this.params.map(function(n, i) {
 				var a = Z(n, t, e && e.implicit);
 				return t === "all" || a !== null && a <= r ? "<span class=\"math-parenthesis math-round-parenthesis\">(</span>" + n.toHTML(e) + "<span class=\"math-parenthesis math-round-parenthesis\">)</span>" : n.toHTML(e);
-			}), a = i[0], o = 0; o < this.conditionals.length; o++) a += "<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">" + xn(n[this.conditionals[o]]) + "</span>" + i[o + 1];
+			}), a = i[0], o = 0; o < this.conditionals.length; o++) a += "<span class=\"math-operator math-binary-operator math-explicit-binary-operator\">" + y(n[this.conditionals[o]]) + "</span>" + i[o + 1];
 			return a;
 		}
 		_toTex(e) {
@@ -1861,7 +1861,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return i;
 		}
 	}
-	return J(r, "name", cs), r;
+	return Y(r, "name", cs), r;
 }, {
 	isClass: !0,
 	isNode: !0
@@ -1888,10 +1888,10 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 		_compile(e, t) {
 			var r = this.name;
 			if (t[r] === !0) return function(e, t, n) {
-				return G(t, r);
+				return p(t, r);
 			};
 			if (r in e) return function(t, n, i) {
-				return t.has(r) ? t.get(r) : G(e, r);
+				return t.has(r) ? t.get(r) : p(e, r);
 			};
 			var o = i(r);
 			return function(e, t, i) {
@@ -1912,7 +1912,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return this.name;
 		}
 		_toHTML(e) {
-			var t = xn(this.name);
+			var t = y(this.name);
 			return t === "true" || t === "false" ? "<span class=\"math-symbol math-boolean\">" + t + "</span>" : t === "i" ? "<span class=\"math-symbol math-imaginary-symbol\">" + t + "</span>" : t === "Infinity" ? "<span class=\"math-symbol math-infinity-symbol\">" + t + "</span>" : t === "NaN" ? "<span class=\"math-symbol math-nan-symbol\">" + t + "</span>" : t === "null" ? "<span class=\"math-symbol math-null-symbol\">" + t + "</span>" : t === "undefined" ? "<span class=\"math-symbol math-undefined-symbol\">" + t + "</span>" : "<span class=\"math-symbol\">" + t + "</span>";
 		}
 		toJSON() {
@@ -1940,7 +1940,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	"Node",
 	"SymbolNode"
 ], (e) => {
-	var t, { math: n, Node: r, SymbolNode: i } = e, a = (e) => De(e, { truncate: 78 });
+	var t, { math: n, Node: r, SymbolNode: i } = e, a = (e) => yn(e, { truncate: 78 });
 	function o(e, t, n) {
 		for (var r = "", i = /\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi, a = 0, o; (o = i.exec(e)) !== null;) if (r += e.substring(a, o.index), a = o.index, o[0] === "$$") r += "$", a++;
 		else {
@@ -1952,24 +1952,24 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 					r += s;
 					break;
 				case "object":
-					if (K(s)) r += s.toTex(n);
+					if (J(s)) r += s.toTex(n);
 					else if (Array.isArray(s)) r += s.map(function(e, t) {
-						if (K(e)) return e.toTex(n);
+						if (J(e)) return e.toTex(n);
 						throw TypeError("Template: " + o[1] + "[" + t + "] is not a Node.");
 					}).join(",");
 					else throw TypeError("Template: " + o[1] + " has to be a Node, String or array of Nodes");
 					break;
 				default: throw TypeError("Template: " + o[1] + " has to be a Node, String or array of Nodes");
 			}
-			else if (K(s[o[2]] && s[o[2]])) r += s[o[2]].toTex(n);
+			else if (J(s[o[2]] && s[o[2]])) r += s[o[2]].toTex(n);
 			else throw TypeError("Template: " + o[1] + "[" + o[2] + "] is not a Node.");
 		}
 		return r += e.slice(a), r;
 	}
 	class s extends r {
 		constructor(e, t, n) {
-			if (super(), typeof e == "string" && (e = new i(e)), !K(e)) throw TypeError("Node expected as parameter \"fn\"");
-			if (!Array.isArray(t) || !t.every(K)) throw TypeError("Array containing Nodes expected for parameter \"args\"");
+			if (super(), typeof e == "string" && (e = new i(e)), !J(e)) throw TypeError("Node expected as parameter \"fn\"");
+			if (!Array.isArray(t) || !t.every(J)) throw TypeError("Array containing Nodes expected for parameter \"args\"");
 			var r = typeof n;
 			if (!(r === "undefined" || r === "boolean")) throw TypeError("optional flag, if specified, must be boolean");
 			this.fn = e, this.args = t || [], this.optional = !!n;
@@ -1984,13 +1984,13 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return !0;
 		}
 		_compile(e, t) {
-			var n = this.args.map((n) => n._compile(e, t)), r = this.optional || Lt(this.fn) && this.fn.optionalChaining;
-			if (Y(this.fn)) {
+			var n = this.args.map((n) => n._compile(e, t)), r = this.optional || Gn(this.fn) && this.fn.optionalChaining;
+			if (K(this.fn)) {
 				var i = this.fn.name;
 				if (t[i]) {
 					var o = this.args;
 					return function(t, s, c) {
-						var l = G(s, i);
+						var l = p(s, i);
 						if (!(r && l === void 0)) {
 							if (typeof l != "function") throw TypeError(`Argument '${i}' was not a function; received: ${a(l)}`);
 							if (l.rawArgs) return l(o, e, ts(t, s));
@@ -1999,10 +1999,10 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 						}
 					};
 				} else {
-					var c = i in e ? G(e, i) : void 0, l = typeof c == "function" && c.rawArgs === !0, u = (t) => {
+					var c = i in e ? p(e, i) : void 0, l = typeof c == "function" && c.rawArgs === !0, u = (t) => {
 						var n;
 						if (t.has(i)) n = t.get(i);
-						else if (i in e) n = G(e, i);
+						else if (i in e) n = p(e, i);
 						else if (r) n = void 0;
 						else return s.onUndefinedFunction(i);
 						if (typeof n == "function" || r && n === void 0) return n;
@@ -2040,12 +2040,12 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 						};
 					}
 				}
-			} else if (Lt(this.fn) && Hr(this.fn.index) && this.fn.index.isObjectProperty()) {
+			} else if (Gn(this.fn) && Tr(this.fn.index) && this.fn.index.isObjectProperty()) {
 				var f = this.fn.object._compile(e, t), m = this.fn.index.getObjectProperty(), h = this.args;
 				return function(t, i, a) {
 					var o = f(t, i, a);
 					if (!(r && (o == null || o[m] === void 0))) {
-						var s = p(o, m);
+						var s = xi(o, m);
 						if (s != null && s.rawArgs) return s(h, e, ts(t, i));
 						var c = n.map((e) => e(t, i, a));
 						return s.apply(o, c);
@@ -2078,13 +2078,13 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 		}
 		toString(e) {
 			var t, n = this.fn.toString(e);
-			return e && typeof e.handler == "object" && U(e.handler, n) && (t = e.handler[n](this, e)), t === void 0 ? super.toString(e) : t;
+			return e && typeof e.handler == "object" && W(e.handler, n) && (t = e.handler[n](this, e)), t === void 0 ? super.toString(e) : t;
 		}
 		_toString(e) {
 			var t = this.args.map(function(t) {
 				return t.toString(e);
 			});
-			return (ji(this.fn) ? "(" + this.fn.toString(e) + ")" : this.fn.toString(e)) + "(" + t.join(", ") + ")";
+			return (vr(this.fn) ? "(" + this.fn.toString(e) + ")" : this.fn.toString(e)) + "(" + t.join(", ") + ")";
 		}
 		toJSON() {
 			return {
@@ -2097,11 +2097,11 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			var t = this.args.map(function(t) {
 				return t.toHTML(e);
 			});
-			return "<span class=\"math-function\">" + xn(this.fn) + "</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>" + t.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-paranthesis math-round-parenthesis\">)</span>";
+			return "<span class=\"math-function\">" + y(this.fn) + "</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>" + t.join("<span class=\"math-separator\">,</span>") + "<span class=\"math-paranthesis math-round-parenthesis\">)</span>";
 		}
 		toTex(e) {
 			var t;
-			return e && typeof e.handler == "object" && U(e.handler, this.name) && (t = e.handler[this.name](this, e)), t === void 0 ? super.toTex(e) : t;
+			return e && typeof e.handler == "object" && W(e.handler, this.name) && (t = e.handler[this.name](this, e)), t === void 0 ? super.toTex(e) : t;
 		}
 		_toTex(e) {
 			var t = this.args.map(function(t) {
@@ -2131,9 +2131,9 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return this.type + ":" + this.name;
 		}
 	}
-	return t = s, J(s, "name", ds), J(s, "onUndefinedFunction", function(e) {
+	return t = s, Y(s, "name", ds), Y(s, "onUndefinedFunction", function(e) {
 		throw Error("Undefined function " + e);
-	}), J(s, "fromJSON", function(e) {
+	}), Y(s, "fromJSON", function(e) {
 		return new t(e.fn, e.args);
 	}), s;
 }, {
@@ -2161,21 +2161,21 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 ], (e) => {
 	var { typed: t, numeric: n, config: r, AccessorNode: i, ArrayNode: a, AssignmentNode: o, BlockNode: s, ConditionalNode: c, ConstantNode: l, FunctionAssignmentNode: u, FunctionNode: d, IndexNode: f, ObjectNode: p, OperatorNode: m, ParenthesisNode: h, RangeNode: g, RelationalNode: _, SymbolNode: v } = e, y = t(ps, {
 		string: function(e) {
-			return te(e, {});
+			return ee(e, {});
 		},
 		"Array | Matrix": function(e) {
 			return b(e, {});
 		},
 		"string, Object": function(e, t) {
-			return te(e, t.nodes === void 0 ? {} : t.nodes);
+			return ee(e, t.nodes === void 0 ? {} : t.nodes);
 		},
 		"Array | Matrix, Object": b
 	});
 	function b(e) {
 		var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, n = t.nodes === void 0 ? {} : t.nodes;
-		return Pe(e, function(e) {
+		return de(e, function(e) {
 			if (typeof e != "string") throw TypeError("String expected");
-			return te(e, n);
+			return ee(e, n);
 		});
 	}
 	var x = {
@@ -2259,90 +2259,90 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			conditionalLevel: null
 		};
 	}
-	function k(e, t) {
+	function O(e, t) {
 		return e.expression.substr(e.index, t);
 	}
-	function A(e) {
-		return k(e, 1);
+	function k(e) {
+		return O(e, 1);
 	}
-	function j(e) {
+	function A(e) {
 		e.index++;
 	}
-	function M(e) {
+	function j(e) {
 		return e.expression.charAt(e.index - 1);
 	}
-	function N(e) {
+	function M(e) {
 		return e.expression.charAt(e.index + 1);
 	}
-	function P(e) {
+	function N(e) {
 		for (e.tokenType = x.NULL, e.token = "", e.comment = "";;) {
-			if (A(e) === "#") for (; A(e) !== "\n" && A(e) !== "";) e.comment += A(e), j(e);
-			if (y.isWhitespace(A(e), e.nestingLevel)) j(e);
+			if (k(e) === "#") for (; k(e) !== "\n" && k(e) !== "";) e.comment += k(e), A(e);
+			if (y.isWhitespace(k(e), e.nestingLevel)) A(e);
 			else break;
 		}
-		if (A(e) === "") {
+		if (k(e) === "") {
 			e.tokenType = x.DELIMITER;
 			return;
 		}
-		if (A(e) === "\n" && !e.nestingLevel) {
-			e.tokenType = x.DELIMITER, e.token = A(e), j(e);
+		if (k(e) === "\n" && !e.nestingLevel) {
+			e.tokenType = x.DELIMITER, e.token = k(e), A(e);
 			return;
 		}
-		var t = A(e), n = k(e, 2), r = k(e, 3);
+		var t = k(e), n = O(e, 2), r = O(e, 3);
 		if (r.length === 3 && S[r]) {
-			e.tokenType = x.DELIMITER, e.token = r, j(e), j(e), j(e);
+			e.tokenType = x.DELIMITER, e.token = r, A(e), A(e), A(e);
 			return;
 		}
 		if (n.length === 2 && S[n] && (n !== "?." || !y.isDigit(e.expression.charAt(e.index + 2)))) {
-			e.tokenType = x.DELIMITER, e.token = n, j(e), j(e);
+			e.tokenType = x.DELIMITER, e.token = n, A(e), A(e);
 			return;
 		}
 		if (S[t]) {
-			e.tokenType = x.DELIMITER, e.token = t, j(e);
+			e.tokenType = x.DELIMITER, e.token = t, A(e);
 			return;
 		}
 		if (y.isDigitDot(t)) {
 			e.tokenType = x.NUMBER;
-			var i = k(e, 2);
+			var i = O(e, 2);
 			if (i === "0b" || i === "0o" || i === "0x") {
-				for (e.token += A(e), j(e), e.token += A(e), j(e); y.isAlpha(A(e), M(e), N(e)) || y.isDigit(A(e));) e.token += A(e), j(e);
-				if (A(e) === ".") for (e.token += ".", j(e); y.isAlpha(A(e), M(e), N(e)) || y.isDigit(A(e));) e.token += A(e), j(e);
-				else if (A(e) === "i") for (e.token += "i", j(e); y.isDigit(A(e));) e.token += A(e), j(e);
+				for (e.token += k(e), A(e), e.token += k(e), A(e); y.isAlpha(k(e), j(e), M(e)) || y.isDigit(k(e));) e.token += k(e), A(e);
+				if (k(e) === ".") for (e.token += ".", A(e); y.isAlpha(k(e), j(e), M(e)) || y.isDigit(k(e));) e.token += k(e), A(e);
+				else if (k(e) === "i") for (e.token += "i", A(e); y.isDigit(k(e));) e.token += k(e), A(e);
 				return;
 			}
-			if (A(e) === ".") {
-				if (e.token += A(e), j(e), !y.isDigit(A(e))) {
+			if (k(e) === ".") {
+				if (e.token += k(e), A(e), !y.isDigit(k(e))) {
 					e.tokenType = x.DELIMITER;
 					return;
 				}
 			} else {
-				for (; y.isDigit(A(e));) e.token += A(e), j(e);
-				y.isDecimalMark(A(e), N(e)) && (e.token += A(e), j(e));
+				for (; y.isDigit(k(e));) e.token += k(e), A(e);
+				y.isDecimalMark(k(e), M(e)) && (e.token += k(e), A(e));
 			}
-			for (; y.isDigit(A(e));) e.token += A(e), j(e);
-			if (A(e) === "E" || A(e) === "e") {
-				if (y.isDigit(N(e)) || N(e) === "-" || N(e) === "+") {
-					if (e.token += A(e), j(e), (A(e) === "+" || A(e) === "-") && (e.token += A(e), j(e)), !y.isDigit(A(e))) throw R(e, "Digit expected, got \"" + A(e) + "\"");
-					for (; y.isDigit(A(e));) e.token += A(e), j(e);
-					if (y.isDecimalMark(A(e), N(e))) throw R(e, "Digit expected, got \"" + A(e) + "\"");
-				} else if (y.isDecimalMark(N(e), e.expression.charAt(e.index + 2))) throw j(e), R(e, "Digit expected, got \"" + A(e) + "\"");
+			for (; y.isDigit(k(e));) e.token += k(e), A(e);
+			if (k(e) === "E" || k(e) === "e") {
+				if (y.isDigit(M(e)) || M(e) === "-" || M(e) === "+") {
+					if (e.token += k(e), A(e), (k(e) === "+" || k(e) === "-") && (e.token += k(e), A(e)), !y.isDigit(k(e))) throw B(e, "Digit expected, got \"" + k(e) + "\"");
+					for (; y.isDigit(k(e));) e.token += k(e), A(e);
+					if (y.isDecimalMark(k(e), M(e))) throw B(e, "Digit expected, got \"" + k(e) + "\"");
+				} else if (y.isDecimalMark(M(e), e.expression.charAt(e.index + 2))) throw A(e), B(e, "Digit expected, got \"" + k(e) + "\"");
 			}
 			return;
 		}
-		if (y.isAlpha(A(e), M(e), N(e))) {
-			for (; y.isAlpha(A(e), M(e), N(e)) || y.isDigit(A(e));) e.token += A(e), j(e);
-			U(C, e.token) ? e.tokenType = x.DELIMITER : e.tokenType = x.SYMBOL;
+		if (y.isAlpha(k(e), j(e), M(e))) {
+			for (; y.isAlpha(k(e), j(e), M(e)) || y.isDigit(k(e));) e.token += k(e), A(e);
+			W(C, e.token) ? e.tokenType = x.DELIMITER : e.tokenType = x.SYMBOL;
 			return;
 		}
-		for (e.tokenType = x.UNKNOWN; A(e) !== "";) e.token += A(e), j(e);
-		throw R(e, "Syntax error in part \"" + e.token + "\"");
+		for (e.tokenType = x.UNKNOWN; k(e) !== "";) e.token += k(e), A(e);
+		throw B(e, "Syntax error in part \"" + e.token + "\"");
 	}
-	function F(e) {
+	function P(e) {
 		do
-			P(e);
+			N(e);
 		while (e.token === "\n");
 	}
-	function ee(e) {
+	function F(e) {
 		e.nestingLevel++;
 	}
 	function I(e) {
@@ -2363,327 +2363,327 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	}, y.isDigit = function(e) {
 		return e >= "0" && e <= "9";
 	};
-	function te(e, t) {
+	function ee(e, t) {
 		var n = D();
-		Mt(n, {
+		ht(n, {
 			expression: e,
 			extraNodes: t
-		}), P(n);
-		var r = ne(n);
-		if (n.token !== "") throw n.tokenType === x.DELIMITER ? Le(n, "Unexpected operator " + n.token) : R(n, "Unexpected part \"" + n.token + "\"");
+		}), N(n);
+		var r = te(n);
+		if (n.token !== "") throw n.tokenType === x.DELIMITER ? Ne(n, "Unexpected operator " + n.token) : B(n, "Unexpected part \"" + n.token + "\"");
 		return r;
 	}
-	function ne(e) {
+	function te(e) {
 		var t, n = [], r;
 		for (e.token !== "" && e.token !== "\n" && e.token !== ";" && (t = L(e), e.comment && (t.comment = e.comment)); e.token === "\n" || e.token === ";";) n.length === 0 && t && (r = e.token !== ";", n.push({
 			node: t,
 			visible: r
-		})), P(e), e.token !== "\n" && e.token !== ";" && e.token !== "" && (t = L(e), e.comment && (t.comment = e.comment), r = e.token !== ";", n.push({
+		})), N(e), e.token !== "\n" && e.token !== ";" && e.token !== "" && (t = L(e), e.comment && (t.comment = e.comment), r = e.token !== ";", n.push({
 			node: t,
 			visible: r
 		}));
 		return n.length > 0 ? new s(n) : (t || (t = new l(void 0), e.comment && (t.comment = e.comment)), t);
 	}
 	function L(e) {
-		var t, n, r, i, a = re(e);
+		var t, n, r, i, a = ne(e);
 		if (e.token === "=") {
-			if (Y(a)) return t = a.name, F(e), r = L(e), new o(new v(t), r);
-			if (Lt(a)) {
-				if (a.optionalChaining) throw R(e, "Cannot assign to optional chain");
-				return F(e), r = L(e), new o(a.object, a.index, r);
-			} else if (Ra(a) && Y(a.fn) && (i = !0, n = [], t = a.name, a.args.forEach(function(e, t) {
-				Y(e) ? n[t] = e.name : i = !1;
-			}), i)) return F(e), r = L(e), new u(t, n, r);
-			throw R(e, "Invalid left hand side of assignment operator =");
+			if (K(a)) return t = a.name, P(e), r = L(e), new o(new v(t), r);
+			if (Gn(a)) {
+				if (a.optionalChaining) throw B(e, "Cannot assign to optional chain");
+				return P(e), r = L(e), new o(a.object, a.index, r);
+			} else if (Oi(a) && K(a.fn) && (i = !0, n = [], t = a.name, a.args.forEach(function(e, t) {
+				K(e) ? n[t] = e.name : i = !1;
+			}), i)) return P(e), r = L(e), new u(t, n, r);
+			throw B(e, "Invalid left hand side of assignment operator =");
 		}
 		return a;
 	}
-	function re(e) {
-		for (var t = ie(e); e.token === "?";) {
+	function ne(e) {
+		for (var t = re(e); e.token === "?";) {
 			var n = e.conditionalLevel;
-			e.conditionalLevel = e.nestingLevel, F(e);
+			e.conditionalLevel = e.nestingLevel, P(e);
 			var r = t, i = L(e);
-			if (e.token !== ":") throw R(e, "False part of conditional expression expected");
-			e.conditionalLevel = null, F(e), t = new c(r, i, L(e)), e.conditionalLevel = n;
+			if (e.token !== ":") throw B(e, "False part of conditional expression expected");
+			e.conditionalLevel = null, P(e), t = new c(r, i, L(e)), e.conditionalLevel = n;
 		}
 		return t;
 	}
+	function re(e) {
+		for (var t = ie(e); e.token === "or";) P(e), t = new m("or", "or", [t, ie(e)]);
+		return t;
+	}
 	function ie(e) {
-		for (var t = ae(e); e.token === "or";) F(e), t = new m("or", "or", [t, ae(e)]);
+		for (var t = R(e); e.token === "xor";) P(e), t = new m("xor", "xor", [t, R(e)]);
+		return t;
+	}
+	function R(e) {
+		for (var t = ae(e); e.token === "and";) P(e), t = new m("and", "and", [t, ae(e)]);
 		return t;
 	}
 	function ae(e) {
-		for (var t = oe(e); e.token === "xor";) F(e), t = new m("xor", "xor", [t, oe(e)]);
+		for (var t = oe(e); e.token === "|";) P(e), t = new m("|", "bitOr", [t, oe(e)]);
 		return t;
 	}
 	function oe(e) {
-		for (var t = se(e); e.token === "and";) F(e), t = new m("and", "and", [t, se(e)]);
+		for (var t = se(e); e.token === "^|";) P(e), t = new m("^|", "bitXor", [t, se(e)]);
 		return t;
 	}
 	function se(e) {
-		for (var t = ce(e); e.token === "|";) F(e), t = new m("|", "bitOr", [t, ce(e)]);
+		for (var t = ce(e); e.token === "&";) P(e), t = new m("&", "bitAnd", [t, ce(e)]);
 		return t;
 	}
 	function ce(e) {
-		for (var t = le(e); e.token === "^|";) F(e), t = new m("^|", "bitXor", [t, le(e)]);
-		return t;
-	}
-	function le(e) {
-		for (var t = ue(e); e.token === "&";) F(e), t = new m("&", "bitAnd", [t, ue(e)]);
-		return t;
-	}
-	function ue(e) {
-		for (var t = [de(e)], n = [], r = {
+		for (var t = [le(e)], n = [], r = {
 			"==": "equal",
 			"!=": "unequal",
 			"<": "smaller",
 			">": "larger",
 			"<=": "smallerEq",
 			">=": "largerEq"
-		}; U(r, e.token);) {
+		}; W(r, e.token);) {
 			var i = {
 				name: e.token,
 				fn: r[e.token]
 			};
-			n.push(i), F(e), t.push(de(e));
+			n.push(i), P(e), t.push(le(e));
 		}
 		return t.length === 1 ? t[0] : t.length === 2 ? new m(n[0].name, n[0].fn, t) : new _(n.map((e) => e.fn), t);
 	}
-	function de(e) {
-		for (var t = fe(e), n, r, i, a = {
+	function le(e) {
+		for (var t = ue(e), n, r, i, a = {
 			"<<": "leftShift",
 			">>": "rightArithShift",
 			">>>": "rightLogShift"
-		}; U(a, e.token);) n = e.token, r = a[n], F(e), i = [t, fe(e)], t = new m(n, r, i);
+		}; W(a, e.token);) n = e.token, r = a[n], P(e), i = [t, ue(e)], t = new m(n, r, i);
 		return t;
 	}
-	function fe(e) {
-		for (var t = pe(e), n, r, i, a = {
+	function ue(e) {
+		for (var t = fe(e), n, r, i, a = {
 			to: "to",
 			in: "to"
-		}; U(a, e.token);) n = e.token, r = a[n], F(e), n === "in" && "])},;".includes(e.token) ? t = new m("*", "multiply", [t, new v("in")], !0) : (i = [t, pe(e)], t = new m(n, r, i));
+		}; W(a, e.token);) n = e.token, r = a[n], P(e), n === "in" && "])},;".includes(e.token) ? t = new m("*", "multiply", [t, new v("in")], !0) : (i = [t, fe(e)], t = new m(n, r, i));
 		return t;
 	}
-	function pe(e) {
+	function fe(e) {
 		var t, n = [];
 		if (e.token === ":") {
-			if (e.conditionalLevel === e.nestingLevel) throw R(e, "The true-expression of a conditional operator may not be empty");
+			if (e.conditionalLevel === e.nestingLevel) throw B(e, "The true-expression of a conditional operator may not be empty");
 			t = new l(1);
-		} else t = me(e);
+		} else t = pe(e);
 		if (e.token === ":" && e.conditionalLevel !== e.nestingLevel) {
-			for (n.push(t); e.token === ":" && n.length < 3;) F(e), e.token === ")" || e.token === "]" || e.token === "," || e.token === "" ? n.push(new v("end")) : n.push(me(e));
+			for (n.push(t); e.token === ":" && n.length < 3;) P(e), e.token === ")" || e.token === "]" || e.token === "," || e.token === "" ? n.push(new v("end")) : n.push(pe(e));
 			t = n.length === 3 ? new g(n[0], n[2], n[1]) : new g(n[0], n[1]);
 		}
 		return t;
 	}
-	function me(e) {
-		for (var t = he(e), n, r, i, a = {
+	function pe(e) {
+		for (var t = me(e), n, r, i, a = {
 			"+": "add",
 			"-": "subtract"
-		}; U(a, e.token);) {
-			n = e.token, r = a[n], F(e);
-			var o = he(e);
+		}; W(a, e.token);) {
+			n = e.token, r = a[n], P(e);
+			var o = me(e);
 			i = o.isPercentage ? [t, new m("*", "multiply", [t, o])] : [t, o], t = new m(n, r, i);
 		}
 		return t;
 	}
-	function he(e) {
-		for (var t = ge(e), n = t, r, i, a = {
+	function me(e) {
+		for (var t = he(e), n = t, r, i, a = {
 			"*": "multiply",
 			".*": "dotMultiply",
 			"/": "divide",
 			"./": "dotDivide",
 			"%": "mod",
 			mod: "mod"
-		}; U(a, e.token);) r = e.token, i = a[r], F(e), n = ge(e), t = new m(r, i, [t, n]);
+		}; W(a, e.token);) r = e.token, i = a[r], P(e), n = he(e), t = new m(r, i, [t, n]);
 		return t;
 	}
-	function ge(e) {
-		for (var t = _e(e), n = t; e.tokenType === x.SYMBOL || e.token === "in" && q(t) || e.token === "in" && W(t) && t.fn === "unaryMinus" && q(t.args[0]) || e.tokenType === x.NUMBER && !q(n) && (!W(n) || n.op === "!") || e.token === "(";) n = _e(e), t = new m("*", "multiply", [t, n], !0);
+	function he(e) {
+		for (var t = ge(e), n = t; e.tokenType === x.SYMBOL || e.token === "in" && G(t) || e.token === "in" && q(t) && t.fn === "unaryMinus" && G(t.args[0]) || e.tokenType === x.NUMBER && !G(n) && (!q(n) || n.op === "!") || e.token === "(";) n = ge(e), t = new m("*", "multiply", [t, n], !0);
 		return t;
 	}
-	function _e(e) {
-		for (var t = ve(e), n = t, r = []; e.token === "/" && O(n);) if (r.push(Mt({}, e)), F(e), e.tokenType === x.NUMBER) if (r.push(Mt({}, e)), F(e), e.tokenType === x.SYMBOL || e.token === "(" || e.token === "in") Mt(e, r.pop()), r.pop(), n = ve(e), t = new m("/", "divide", [t, n]);
+	function ge(e) {
+		for (var t = _e(e), n = t, r = []; e.token === "/" && Zt(n);) if (r.push(ht({}, e)), P(e), e.tokenType === x.NUMBER) if (r.push(ht({}, e)), P(e), e.tokenType === x.SYMBOL || e.token === "(" || e.token === "in") ht(e, r.pop()), r.pop(), n = _e(e), t = new m("/", "divide", [t, n]);
 		else {
-			r.pop(), Mt(e, r.pop());
+			r.pop(), ht(e, r.pop());
 			break;
 		}
 		else {
-			Mt(e, r.pop());
+			ht(e, r.pop());
 			break;
 		}
 		return t;
 	}
-	function ve(e) {
-		var t = ye(e);
+	function _e(e) {
+		var t = z(e);
 		if (e.token === "%") {
-			var n = Mt({}, e);
-			F(e);
+			var n = ht({}, e);
+			P(e);
 			try {
-				ye(e), Mt(e, n);
+				z(e), ht(e, n);
 			} catch {
 				t = new m("/", "divide", [t, new l(100)], !1, !0);
 			}
 		}
 		return t;
 	}
-	function ye(e) {
+	function z(e) {
 		var t, n, r, i = {
 			"-": "unaryMinus",
 			"+": "unaryPlus",
 			"~": "bitNot",
 			not: "not"
 		};
-		return U(i, e.token) ? (r = i[e.token], t = e.token, F(e), n = [ye(e)], new m(t, r, n)) : xe(e);
+		return W(i, e.token) ? (r = i[e.token], t = e.token, P(e), n = [z(e)], new m(t, r, n)) : ve(e);
 	}
-	function xe(e) {
-		var t = Se(e), n, r, i;
-		return (e.token === "^" || e.token === ".^") && (n = e.token, r = n === "^" ? "pow" : "dotPow", F(e), i = [t, ye(e)], t = new m(n, r, i)), t;
+	function ve(e) {
+		var t = ye(e), n, r, i;
+		return (e.token === "^" || e.token === ".^") && (n = e.token, r = n === "^" ? "pow" : "dotPow", P(e), i = [t, z(e)], t = new m(n, r, i)), t;
 	}
-	function Se(e) {
-		for (var t = Ce(e); e.token === "??";) F(e), t = new m("??", "nullish", [t, Ce(e)]);
+	function ye(e) {
+		for (var t = be(e); e.token === "??";) P(e), t = new m("??", "nullish", [t, be(e)]);
 		return t;
 	}
-	function Ce(e) {
-		for (var t = we(e), n, r, i, a = {
+	function be(e) {
+		for (var t = xe(e), n, r, i, a = {
 			"!": "factorial",
 			"'": "ctranspose"
-		}; U(a, e.token);) n = e.token, r = a[n], P(e), i = [t], t = new m(n, r, i), t = Ee(e, t);
+		}; W(a, e.token);) n = e.token, r = a[n], N(e), i = [t], t = new m(n, r, i), t = Ce(e, t);
 		return t;
 	}
-	function we(e) {
+	function xe(e) {
 		var t = [];
-		if (e.tokenType === x.SYMBOL && U(e.extraNodes, e.token)) {
+		if (e.tokenType === x.SYMBOL && W(e.extraNodes, e.token)) {
 			var n = e.extraNodes[e.token];
-			if (P(e), e.token === "(") {
-				if (t = [], ee(e), P(e), e.token !== ")") for (t.push(L(e)); e.token === ",";) P(e), t.push(L(e));
-				if (e.token !== ")") throw R(e, "Parenthesis ) expected");
-				I(e), P(e);
+			if (N(e), e.token === "(") {
+				if (t = [], F(e), N(e), e.token !== ")") for (t.push(L(e)); e.token === ",";) N(e), t.push(L(e));
+				if (e.token !== ")") throw B(e, "Parenthesis ) expected");
+				I(e), N(e);
 			}
 			return new n(t);
 		}
-		return Te(e);
+		return Se(e);
 	}
-	function Te(e) {
+	function Se(e) {
 		var t, r;
-		return e.tokenType === x.SYMBOL || e.tokenType === x.DELIMITER && e.token in C ? (r = e.token, P(e), t = U(w, r) ? new l(w[r]) : T.includes(r) ? new l(n(r, "number")) : new v(r), t = Ee(e, t), t) : De(e);
+		return e.tokenType === x.SYMBOL || e.tokenType === x.DELIMITER && e.token in C ? (r = e.token, N(e), t = W(w, r) ? new l(w[r]) : T.includes(r) ? new l(n(r, "number")) : new v(r), t = Ce(e, t), t) : we(e);
 	}
-	function Ee(e, t, n) {
+	function Ce(e, t, n) {
 		for (var r;;) {
 			var a = !1;
-			e.token === "?." && (a = !0, P(e));
+			e.token === "?." && (a = !0, N(e));
 			var o = (e.token === "(" || e.token === "[" || e.token === ".") && (!n || n.includes(e.token));
 			if (!(a || o)) break;
-			if (r = [], e.token === "(") if (a || Y(t) || Lt(t)) {
-				if (ee(e), P(e), e.token !== ")") for (r.push(L(e)); e.token === ",";) P(e), r.push(L(e));
-				if (e.token !== ")") throw R(e, "Parenthesis ) expected");
-				I(e), P(e), t = new d(t, r, a);
+			if (r = [], e.token === "(") if (a || K(t) || Gn(t)) {
+				if (F(e), N(e), e.token !== ")") for (r.push(L(e)); e.token === ",";) N(e), r.push(L(e));
+				if (e.token !== ")") throw B(e, "Parenthesis ) expected");
+				I(e), N(e), t = new d(t, r, a);
 			} else return t;
 			else if (e.token === "[") {
-				if (ee(e), P(e), e.token !== "]") for (r.push(L(e)); e.token === ",";) P(e), r.push(L(e));
-				if (e.token !== "]") throw R(e, "Parenthesis ] expected");
-				I(e), P(e), t = new i(t, new f(r), a);
+				if (F(e), N(e), e.token !== "]") for (r.push(L(e)); e.token === ",";) N(e), r.push(L(e));
+				if (e.token !== "]") throw B(e, "Parenthesis ] expected");
+				I(e), N(e), t = new i(t, new f(r), a);
 			} else {
-				if (a || P(e), !(e.tokenType === x.SYMBOL || e.tokenType === x.DELIMITER && e.token in C)) {
+				if (a || N(e), !(e.tokenType === x.SYMBOL || e.tokenType === x.DELIMITER && e.token in C)) {
 					var s = "Property name expected after ";
-					throw s += a ? "optional chain" : "dot", R(e, s);
+					throw s += a ? "optional chain" : "dot", B(e, s);
 				}
-				r.push(new l(e.token)), P(e), t = new i(t, new f(r, !0), a);
+				r.push(new l(e.token)), N(e), t = new i(t, new f(r, !0), a);
 			}
 		}
 		return t;
 	}
-	function De(e) {
+	function we(e) {
 		var t, n;
-		return e.token === "\"" || e.token === "'" ? (n = Oe(e, e.token), t = new l(n), t = Ee(e, t), t) : ke(e);
+		return e.token === "\"" || e.token === "'" ? (n = Te(e, e.token), t = new l(n), t = Ce(e, t), t) : Ee(e);
 	}
-	function Oe(e, t) {
-		for (var n = ""; A(e) !== "" && A(e) !== t;) if (A(e) === "\\") {
-			j(e);
-			var r = A(e), i = E[r];
+	function Te(e, t) {
+		for (var n = ""; k(e) !== "" && k(e) !== t;) if (k(e) === "\\") {
+			A(e);
+			var r = k(e), i = E[r];
 			if (i !== void 0) n += i, e.index += 1;
 			else if (r === "u") {
 				var a = e.expression.slice(e.index + 1, e.index + 5);
 				if (/^[0-9A-Fa-f]{4}$/.test(a)) n += String.fromCharCode(parseInt(a, 16)), e.index += 5;
-				else throw R(e, `Invalid unicode character \\u${a}`);
-			} else throw R(e, `Bad escape character \\${r}`);
-		} else n += A(e), j(e);
-		if (P(e), e.token !== t) throw R(e, `End of string ${t} expected`);
-		return P(e), n;
+				else throw B(e, `Invalid unicode character \\u${a}`);
+			} else throw B(e, `Bad escape character \\${r}`);
+		} else n += k(e), A(e);
+		if (N(e), e.token !== t) throw B(e, `End of string ${t} expected`);
+		return N(e), n;
 	}
-	function ke(e) {
+	function Ee(e) {
 		var t, n, r, i;
 		if (e.token === "[") {
-			if (ee(e), P(e), e.token !== "]") {
-				var o = Ae(e);
+			if (F(e), N(e), e.token !== "]") {
+				var o = De(e);
 				if (e.token === ";") {
-					for (r = 1, n = [o]; e.token === ";";) P(e), e.token !== "]" && (n[r] = Ae(e), r++);
-					if (e.token !== "]") throw R(e, "End of matrix ] expected");
-					I(e), P(e), i = n[0].items.length;
-					for (var s = 1; s < r; s++) if (n[s].items.length !== i) throw Le(e, "Column dimensions mismatch (" + n[s].items.length + " !== " + i + ")");
+					for (r = 1, n = [o]; e.token === ";";) N(e), e.token !== "]" && (n[r] = De(e), r++);
+					if (e.token !== "]") throw B(e, "End of matrix ] expected");
+					I(e), N(e), i = n[0].items.length;
+					for (var s = 1; s < r; s++) if (n[s].items.length !== i) throw Ne(e, "Column dimensions mismatch (" + n[s].items.length + " !== " + i + ")");
 					t = new a(n);
 				} else {
-					if (e.token !== "]") throw R(e, "End of matrix ] expected");
-					I(e), P(e), t = o;
+					if (e.token !== "]") throw B(e, "End of matrix ] expected");
+					I(e), N(e), t = o;
 				}
-			} else I(e), P(e), t = new a([]);
-			return Ee(e, t);
+			} else I(e), N(e), t = new a([]);
+			return Ce(e, t);
 		}
-		return je(e);
+		return Oe(e);
 	}
-	function Ae(e) {
-		for (var t = [L(e)], n = 1; e.token === ",";) P(e), e.token !== "]" && e.token !== ";" && (t[n] = L(e), n++);
+	function De(e) {
+		for (var t = [L(e)], n = 1; e.token === ",";) N(e), e.token !== "]" && e.token !== ";" && (t[n] = L(e), n++);
 		return new a(t);
 	}
-	function je(e) {
+	function Oe(e) {
 		if (e.token === "{") {
-			ee(e);
+			F(e);
 			var t, n = {};
 			do
-				if (P(e), e.token !== "}") {
-					if (e.token === "\"" || e.token === "'") t = Oe(e, e.token);
-					else if (e.tokenType === x.SYMBOL || e.tokenType === x.DELIMITER && e.token in C) t = e.token, P(e);
-					else throw R(e, "Symbol or string expected as object key");
-					if (e.token !== ":") throw R(e, "Colon : expected after object key");
-					P(e), n[t] = L(e);
+				if (N(e), e.token !== "}") {
+					if (e.token === "\"" || e.token === "'") t = Te(e, e.token);
+					else if (e.tokenType === x.SYMBOL || e.tokenType === x.DELIMITER && e.token in C) t = e.token, N(e);
+					else throw B(e, "Symbol or string expected as object key");
+					if (e.token !== ":") throw B(e, "Colon : expected after object key");
+					N(e), n[t] = L(e);
 				}
 			while (e.token === ",");
-			if (e.token !== "}") throw R(e, "Comma , or bracket } expected after object value");
-			I(e), P(e);
+			if (e.token !== "}") throw B(e, "Comma , or bracket } expected after object value");
+			I(e), N(e);
 			var r = new p(n);
-			return r = Ee(e, r), r;
+			return r = Ce(e, r), r;
 		}
-		return Me(e);
+		return ke(e);
 	}
-	function Me(e) {
+	function ke(e) {
 		var t;
 		if (e.tokenType === x.NUMBER) {
-			t = e.token, P(e);
-			var i = be(t, r);
+			t = e.token, N(e);
+			var i = Tn(t, r);
 			return new l(n(t, i));
 		}
-		return Ne(e);
+		return Ae(e);
 	}
-	function Ne(e) {
+	function Ae(e) {
 		var t;
 		if (e.token === "(") {
-			if (ee(e), P(e), t = L(e), e.token !== ")") throw R(e, "Parenthesis ) expected");
-			return I(e), P(e), t = new h(t), t = Ee(e, t), t;
+			if (F(e), N(e), t = L(e), e.token !== ")") throw B(e, "Parenthesis ) expected");
+			return I(e), N(e), t = new h(t), t = Ce(e, t), t;
 		}
-		return Fe(e);
+		return je(e);
 	}
-	function Fe(e) {
-		throw e.token === "" ? R(e, "Unexpected end of expression") : R(e, "Value expected");
+	function je(e) {
+		throw e.token === "" ? B(e, "Unexpected end of expression") : B(e, "Value expected");
 	}
-	function Ie(e) {
+	function Me(e) {
 		return e.index - e.token.length + 1;
 	}
-	function R(e, t) {
-		var n = Ie(e), r = /* @__PURE__ */ SyntaxError(t + " (char " + n + ")");
+	function B(e, t) {
+		var n = Me(e), r = /* @__PURE__ */ SyntaxError(t + " (char " + n + ")");
 		return r.char = n, r;
 	}
-	function Le(e, t) {
-		var n = Ie(e), r = /* @__PURE__ */ SyntaxError(t + " (char " + n + ")");
+	function Ne(e, t) {
+		var n = Me(e), r = /* @__PURE__ */ SyntaxError(t + " (char " + n + ")");
 		return r.char = n, r;
 	}
 	return t.addConversion({
@@ -2698,7 +2698,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			return n(e).compile();
 		},
 		"Array | Matrix": function(e) {
-			return Pe(e, function(e) {
+			return de(e, function(e) {
 				return n(e).compile();
 			});
 		}
@@ -2707,20 +2707,20 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	var { typed: t, parse: n } = e;
 	return t(_s, {
 		string: function(e) {
-			var t = ee();
+			var t = ae();
 			return n(e).compile().evaluate(t);
 		},
 		"string, Map | Object": function(e, t) {
 			return n(e).compile().evaluate(t);
 		},
 		"Array | Matrix": function(e) {
-			var t = ee();
-			return Pe(e, function(e) {
+			var t = ae();
+			return de(e, function(e) {
 				return n(e).compile().evaluate(t);
 			});
 		},
 		"Array | Matrix, Map | Object": function(e, t) {
-			return Pe(e, function(e) {
+			return de(e, function(e) {
 				return n(e).compile().evaluate(t);
 			});
 		}
@@ -2730,7 +2730,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	function r() {
 		if (!(this instanceof r)) throw SyntaxError("Constructor must be called with the new operator");
 		Object.defineProperty(this, "scope", {
-			value: ee(),
+			value: ae(),
 			writable: !1
 		});
 	}
@@ -2739,7 +2739,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 	}, r.prototype.get = function(e) {
 		if (this.scope.has(e)) return this.scope.get(e);
 	}, r.prototype.getAll = function() {
-		return wi(this.scope);
+		return Ct(this.scope);
 	}, r.prototype.getAllAsMap = function() {
 		return this.scope;
 	};
@@ -2764,7 +2764,7 @@ var ns = "OperatorNode", rs = /* #__PURE__ */ z(ns, ["Node"], (e) => {
 			variables: {},
 			functions: {}
 		};
-		for (var [t, n] of this.scope) if (xr(n)) {
+		for (var [t, n] of this.scope) if (Sa(n)) {
 			if (!bs(n)) throw Error(`Cannot serialize external function ${t}`);
 			e.functions[t] = `${n.syntax} = ${n.expr}`;
 		} else e.variables[t] = n;
@@ -2810,13 +2810,13 @@ var xs = "parser", Ss = /* #__PURE__ */ z(xs, ["typed", "Parser"], (e) => {
 				} catch (e) {
 					c = e;
 				}
-				c !== void 0 && !Or(c) && (n += "        " + De(c, { precision: 14 }) + "\n");
+				c !== void 0 && !Ia(c) && (n += "        " + yn(c, { precision: 14 }) + "\n");
 			}
 			n += "\n", r && t("config(originalConfig)", { originalConfig: i });
 		}
 		return e.mayThrow && e.mayThrow.length && (n += "Throws: " + e.mayThrow.join(", ") + "\n\n"), e.seealso && e.seealso.length && (n += "See also: " + e.seealso.join(", ") + "\n"), n;
 	}, n.prototype.toJSON = function() {
-		var e = Be(this.doc);
+		var e = sa(this.doc);
 		return e.mathjs = "Help", e;
 	}, n.fromJSON = function(e) {
 		var t = {};
@@ -2832,14 +2832,14 @@ var xs = "parser", Ss = /* #__PURE__ */ z(xs, ["typed", "Parser"], (e) => {
 	var { on: t, math: n, typed: r } = e;
 	function i(e) {
 		if (!(this instanceof i)) throw SyntaxError("Constructor must be called with the new operator");
-		_a(e) ? this.value = e.value : this.value = e;
+		Hi(e) ? this.value = e.value : this.value = e;
 	}
 	i.prototype.type = "Chain", i.prototype.isChain = !0, i.prototype.done = function() {
 		return this.value;
 	}, i.prototype.valueOf = function() {
 		return this.value;
 	}, i.prototype.toString = function() {
-		return De(this.value);
+		return yn(this.value);
 	}, i.prototype.toJSON = function() {
 		return {
 			mathjs: "Chain",
@@ -2852,7 +2852,7 @@ var xs = "parser", Ss = /* #__PURE__ */ z(xs, ["typed", "Parser"], (e) => {
 		typeof t == "function" && (i.prototype[e] = s(t));
 	}
 	function o(e, t) {
-		qn(i.prototype, e, function() {
+		Mn(i.prototype, e, function() {
 			var e = t();
 			if (typeof e == "function") return s(e);
 		});
@@ -2873,7 +2873,7 @@ var xs = "parser", Ss = /* #__PURE__ */ z(xs, ["typed", "Parser"], (e) => {
 		if (typeof e == "string") a(e, t);
 		else {
 			var n = function(t) {
-				U(e, t) && c[t] === void 0 && o(t, () => e[t]);
+				W(e, t) && c[t] === void 0 && o(t, () => e[t]);
 			};
 			for (var r in e) n(r);
 		}
@@ -7168,12 +7168,12 @@ var xs = "parser", Ss = /* #__PURE__ */ z(xs, ["typed", "Parser"], (e) => {
 	return t(Rs, { any: function(e) {
 		var t, i = e;
 		if (typeof e != "string") {
-			for (t in n) if (U(n, t) && e === n[t]) {
+			for (t in n) if (W(n, t) && e === n[t]) {
 				i = t;
 				break;
 			}
 		}
-		var a = G(Ls, i);
+		var a = p(Ls, i);
 		if (!a) {
 			var o = typeof i == "function" ? i.name : i;
 			throw Error("No documentation found on \"" + o + "\"");
@@ -7205,10 +7205,10 @@ var xs = "parser", Ss = /* #__PURE__ */ z(xs, ["typed", "Parser"], (e) => {
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/function/algebra/simplify/wildcards.js
 function Ws(e) {
-	return q(e) || W(e) && e.isUnary() && q(e.args[0]);
+	return G(e) || q(e) && e.isUnary() && G(e.args[0]);
 }
 function Gs(e) {
-	return !!(q(e) || (Ra(e) || W(e)) && e.args.every(Gs) || Wa(e) && Gs(e.content));
+	return !!(G(e) || (Oi(e) || q(e)) && e.args.every(Gs) || $n(e) && Gs(e.content));
 }
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js
@@ -7226,7 +7226,7 @@ function qs(e) {
 	for (var t = 1; t < arguments.length; t++) {
 		var n = arguments[t] == null ? {} : arguments[t];
 		t % 2 ? Ks(Object(n), !0).forEach(function(t) {
-			J(e, t, n[t]);
+			Y(e, t, n[t]);
 		}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(n)) : Ks(Object(n)).forEach(function(t) {
 			Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(n, t));
 		});
@@ -7291,18 +7291,18 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	};
 	function u(e, t) {
 		var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : s, r = o;
-		if (typeof e == "string" ? r = e : W(e) ? r = e.fn.toString() : Ra(e) ? r = e.name : Wa(e) && (r = "paren"), U(n, r)) {
+		if (typeof e == "string" ? r = e : q(e) ? r = e.fn.toString() : Oi(e) ? r = e.name : $n(e) && (r = "paren"), W(n, r)) {
 			var i = n[r];
-			if (U(i, t)) return i[t];
-			if (U(s, r)) return s[r][t];
+			if (W(i, t)) return i[t];
+			if (W(s, r)) return s[r][t];
 		}
-		if (U(n, o)) {
+		if (W(n, o)) {
 			var a = n[o];
-			return U(a, t) ? a[t] : s[o][t];
+			return W(a, t) ? a[t] : s[o][t];
 		}
-		if (U(s, r)) {
+		if (W(s, r)) {
 			var c = s[r];
-			if (U(c, t)) return c[t];
+			if (W(c, t)) return c[t];
 		}
 		return s[o][t];
 	}
@@ -7314,7 +7314,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	}
 	function p(e, t) {
 		var n = qs({}, e);
-		for (var r in t) U(e, r) ? n[r] = qs(qs({}, t[r]), e[r]) : n[r] = t[r];
+		for (var r in t) W(e, r) ? n[r] = qs(qs({}, t[r]), e[r]) : n[r] = t[r];
 		return n;
 	}
 	function m(e, t) {
@@ -7326,7 +7326,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		var n, r = [], i = function(e) {
 			for (var t = 0; t < e.args.length; t++) {
 				var a = e.args[t];
-				W(a) && n === a.op ? i(a) : r.push(a);
+				q(a) && n === a.op ? i(a) : r.push(a);
 			}
 		};
 		return f(e, t) ? (n = e.op, i(e), r) : e.args;
@@ -7350,7 +7350,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		}
 	}
 	function v(e) {
-		return W(e) ? function(t) {
+		return q(e) ? function(t) {
 			try {
 				return new n(e.op, e.fn, t, e.implicit);
 			} catch (e) {
@@ -7400,7 +7400,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	t.addConversion({
 		from: "Object",
 		to: "Map",
-		convert: wt
+		convert: I
 	});
 	var O = t("simplify", {
 		Node: F,
@@ -7413,11 +7413,11 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	t.removeConversion({
 		from: "Object",
 		to: "Map",
-		convert: wt
+		convert: I
 	}), O.defaultContext = T, O.realContext = E, O.positiveContext = D;
 	function k(e) {
 		return e.transform(function(e) {
-			return Wa(e) ? k(e.content) : e;
+			return $n(e) ? k(e.content) : e;
 		});
 	}
 	var A = {
@@ -7711,7 +7711,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		return new h("_p" + N++);
 	}
 	function F(e, t) {
-		var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : ee(), r = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : {}, a = r.consoleDebug;
+		var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : ae(), r = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : {}, a = r.consoleDebug;
 		t = M(t || O.rules, r.context);
 		var o = i(e, n);
 		o = k(o);
@@ -7731,7 +7731,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		}
 		return o;
 	}
-	function I(e, t, n) {
+	function ee(e, t, n) {
 		var r = e;
 		if (e) for (var i = 0; i < e.length; ++i) {
 			var a = te(e[i], t, n);
@@ -7745,7 +7745,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		}
 		var a = b(t.imposeContext, n), o = e;
 		if (o instanceof p || o instanceof u) {
-			var l = I(o.args, t, n);
+			var l = ee(o.args, t, n);
 			l !== o.args && (o = o.clone(), o.args = l);
 		} else if (o instanceof m) {
 			if (o.content) {
@@ -7753,7 +7753,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 				h !== o.content && (o = new m(h));
 			}
 		} else if (o instanceof c) {
-			var g = I(o.items, t, n);
+			var g = ee(o.items, t, n);
 			g !== o.items && (o = new c(g));
 		} else if (o instanceof s) {
 			var v = o.object;
@@ -7761,23 +7761,23 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 			var y = o.index;
 			o.index && (y = te(o.index, t, n)), (v !== o.object || y !== o.index) && (o = new s(v, y));
 		} else if (o instanceof d) {
-			var x = I(o.dimensions, t, n);
+			var x = ee(o.dimensions, t, n);
 			x !== o.dimensions && (o = new d(x));
 		} else if (o instanceof f) {
 			var S = !1, C = {};
 			for (var w in o.properties) C[w] = te(o.properties[w], t, n), C[w] !== o.properties[w] && (S = !0);
 			S && (o = new f(C));
 		}
-		var T = t.r, E = ae(t.l, o, a)[0];
-		if (!E && t.expanded && (T = t.expanded.r, E = ae(t.expanded.l, o, a)[0]), !E && t.expandedNC1 && (T = t.expandedNC1.r, E = ae(t.expandedNC1.l, o, a)[0], E ||= (T = t.expandedNC2.r, ae(t.expandedNC2.l, o, a)[0])), E) {
+		var T = t.r, E = R(t.l, o, a)[0];
+		if (!E && t.expanded && (T = t.expanded.r, E = R(t.expanded.l, o, a)[0]), !E && t.expandedNC1 && (T = t.expandedNC1.r, E = R(t.expandedNC1.l, o, a)[0], E ||= (T = t.expandedNC2.r, R(t.expandedNC2.l, o, a)[0])), E) {
 			var D = o.implicit;
 			o = T.clone(), D && "implicit" in T && (o.implicit = !0), o = o.transform(function(e) {
-				return e.isSymbolNode && U(E.placeholders, e.name) ? E.placeholders[e.name].clone() : e;
+				return e.isSymbolNode && W(E.placeholders, e.name) ? E.placeholders[e.name].clone() : e;
 			});
 		}
 		return t.repeat && o !== e && (o = te(o, t, n)), o;
 	}
-	function ne(e, t) {
+	function L(e, t) {
 		var n = [], r, i, a = w(e);
 		if (v(e, t)) for (var o = 0; o < e.args.length; o++) i = e.args.slice(0), i.splice(o, 1), r = i.length === 1 ? i[0] : a(i), n.push(a([e.args[o], r]));
 		else for (var s = 1; s < e.args.length; s++) {
@@ -7786,19 +7786,19 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		}
 		return n;
 	}
-	function L(e, t) {
+	function ne(e, t) {
 		var n = { placeholders: {} };
 		if (!e.placeholders && !t.placeholders) return n;
 		if (!e.placeholders) return t;
 		if (!t.placeholders) return e;
-		for (var r in e.placeholders) if (U(e.placeholders, r) && (n.placeholders[r] = e.placeholders[r], U(t.placeholders, r) && !oe(e.placeholders[r], t.placeholders[r]))) return null;
-		for (var i in t.placeholders) U(t.placeholders, i) && (n.placeholders[i] = t.placeholders[i]);
+		for (var r in e.placeholders) if (W(e.placeholders, r) && (n.placeholders[r] = e.placeholders[r], W(t.placeholders, r) && !oe(e.placeholders[r], t.placeholders[r]))) return null;
+		for (var i in t.placeholders) W(t.placeholders, i) && (n.placeholders[i] = t.placeholders[i]);
 		return n;
 	}
 	function re(e, t) {
 		var n = [];
 		if (e.length === 0 || t.length === 0) return n;
-		for (var r, i = 0; i < e.length; i++) for (var a = 0; a < t.length; a++) r = L(e[i], t[a]), r && n.push(r);
+		for (var r, i = 0; i < e.length; i++) for (var a = 0; a < t.length; a++) r = ne(e[i], t[a]), r && n.push(r);
 		return n;
 	}
 	function ie(e) {
@@ -7809,7 +7809,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		}
 		return n;
 	}
-	function ae(e, t, n, i) {
+	function R(e, t, n, i) {
 		var a = [{ placeholders: {} }];
 		if (e instanceof p && t instanceof p || e instanceof u && t instanceof u) {
 			if (e instanceof p) {
@@ -7817,23 +7817,23 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 			} else if (e instanceof u && e.name !== t.name) return [];
 			if (t.args.length === 1 && e.args.length === 1 || !y(t, n) && t.args.length === e.args.length || i) {
 				for (var o = [], s = 0; s < e.args.length; s++) {
-					var c = ae(e.args[s], t.args[s], n);
+					var c = R(e.args[s], t.args[s], n);
 					if (c.length === 0) break;
 					o.push(c);
 				}
 				if (o.length !== e.args.length) {
 					if (!v(t, n) || e.args.length === 1) return [];
 					if (e.args.length > 2) throw Error("permuting >2 commutative non-associative rule arguments not yet implemented");
-					var d = ae(e.args[0], t.args[1], n);
+					var d = R(e.args[0], t.args[1], n);
 					if (d.length === 0) return [];
-					var f = ae(e.args[1], t.args[0], n);
+					var f = R(e.args[1], t.args[0], n);
 					if (f.length === 0) return [];
 					o = [d, f];
 				}
 				a = ie(o);
 			} else if (t.args.length >= 2 && e.args.length === 2) {
-				for (var m = ne(t, n), g = [], _ = 0; _ < m.length; _++) {
-					var b = ae(e, m[_], n, !0);
+				for (var m = L(t, n), g = [], _ = 0; _ < m.length; _++) {
+					var b = R(e, m[_], n, !0);
 					g = g.concat(b);
 				}
 				return g;
@@ -7850,15 +7850,15 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 					break;
 				case "c":
 				case "cl":
-					if (q(t)) a[0].placeholders[e.name] = t;
+					if (G(t)) a[0].placeholders[e.name] = t;
 					else return [];
 					break;
 				case "v":
-					if (!q(t)) a[0].placeholders[e.name] = t;
+					if (!G(t)) a[0].placeholders[e.name] = t;
 					else return [];
 					break;
 				case "vl":
-					if (Y(t)) a[0].placeholders[e.name] = t;
+					if (K(t)) a[0].placeholders[e.name] = t;
 					else return [];
 					break;
 				case "cd":
@@ -7916,61 +7916,61 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	"OperatorNode",
 	"SymbolNode"
 ], (e) => {
-	var { typed: t, config: n, mathWithTransform: r, matrix: i, isBounded: a, fraction: o, bignumber: s, AccessorNode: c, ArrayNode: l, ConstantNode: u, FunctionNode: d, IndexNode: f, ObjectNode: p, OperatorNode: m, SymbolNode: h } = e, { isCommutative: g, isAssociative: _, allChildren: v, createMakeNodeFunction: y } = Js({
-		FunctionNode: d,
-		OperatorNode: m,
-		SymbolNode: h
-	}), b = t("simplifyConstant", {
-		Node: (e) => w(M(e, {})),
+	var { typed: t, config: n, mathWithTransform: r, matrix: a, isBounded: o, fraction: s, bignumber: c, AccessorNode: l, ArrayNode: u, ConstantNode: d, FunctionNode: f, IndexNode: p, ObjectNode: m, OperatorNode: h, SymbolNode: g } = e, { isCommutative: _, isAssociative: v, allChildren: y, createMakeNodeFunction: b } = Js({
+		FunctionNode: f,
+		OperatorNode: h,
+		SymbolNode: g
+	}), x = t("simplifyConstant", {
+		Node: (e) => T(N(e, {})),
 		"Node, Object": function(e, t) {
-			return w(M(e, t));
+			return T(N(e, t));
 		}
 	});
-	function x(e) {
-		return wa(e) ? e.valueOf() : e instanceof Array ? e.map(x) : ra(e) ? i(x(e.valueOf())) : e;
+	function S(e) {
+		return Yi(e) ? e.valueOf() : e instanceof Array ? e.map(S) : zr(e) ? a(S(e.valueOf())) : e;
 	}
-	function S(e, t, n) {
+	function C(e, t, n) {
 		try {
 			return r[e].apply(null, t);
 		} catch {
-			return t = t.map(x), D(r[e].apply(null, t), n);
+			return t = t.map(S), O(r[e].apply(null, t), n);
 		}
 	}
-	var C = t({
-		Fraction: k,
+	var w = t({
+		Fraction: A,
 		number: function(e) {
-			return e < 0 ? O(new u(-e)) : new u(e);
+			return e < 0 ? k(new d(-e)) : new d(e);
 		},
 		BigNumber: function(e) {
-			return e < 0 ? O(new u(-e)) : new u(e);
+			return e < 0 ? k(new d(-e)) : new d(e);
 		},
 		bigint: function(e) {
-			return e < 0n ? O(new u(-e)) : new u(e);
+			return e < 0n ? k(new d(-e)) : new d(e);
 		},
 		Complex: function(e) {
 			throw Error("Cannot convert Complex number to Node");
 		},
 		string: function(e) {
-			return new u(e);
+			return new d(e);
 		},
 		Matrix: function(e) {
-			return new l(e.valueOf().map((e) => C(e)));
+			return new u(e.valueOf().map((e) => w(e)));
 		}
 	});
-	function w(e) {
-		return K(e) ? e : C(e);
+	function T(e) {
+		return J(e) ? e : w(e);
 	}
-	function T(e, t) {
-		if (t && t.exactFractions !== !1 && a(e) && o) {
-			var n = o(e), r = t && typeof t.fractionsLimit == "number" ? t.fractionsLimit : Infinity;
+	function D(e, t) {
+		if (t && t.exactFractions !== !1 && o(e) && s) {
+			var n = s(e), r = t && typeof t.fractionsLimit == "number" ? t.fractionsLimit : Infinity;
 			if (n.valueOf() === e && n.n < r && n.d < r) return n;
 		}
 		return e;
 	}
-	var D = t({
+	var O = t({
 		"string, Object": function(e, t) {
-			var r = be(e, n);
-			return r === "BigNumber" ? (s === void 0 && E(), s(e)) : r === "bigint" ? BigInt(e) : r === "Fraction" ? (o === void 0 && Xa(), o(e)) : T(parseFloat(e), t);
+			var r = Tn(e, n);
+			return r === "BigNumber" ? (c === void 0 && Yt(), c(e)) : r === "bigint" ? BigInt(e) : r === "Fraction" ? (s === void 0 && E(), s(e)) : D(parseFloat(e), t);
 		},
 		"Fraction, Object": function(e, t) {
 			return e;
@@ -7979,112 +7979,112 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 			return e;
 		},
 		"number, Object": function(e, t) {
-			return T(e, t);
+			return D(e, t);
 		},
 		"bigint, Object": function(e, t) {
 			return e;
 		},
 		"Complex, Object": function(e, t) {
-			return e.im === 0 ? T(e.re, t) : e;
+			return e.im === 0 ? D(e.re, t) : e;
 		},
 		"Matrix, Object": function(e, t) {
-			return i(T(e.valueOf()));
+			return a(D(e.valueOf()));
 		},
 		"Array, Object": function(e, t) {
-			return e.map(T);
+			return e.map(D);
 		}
 	});
-	function O(e) {
-		return new m("-", "unaryMinus", [e]);
-	}
 	function k(e) {
-		var t = (e) => n.number === "BigNumber" && s ? s(e) : Number(e), r = e.s * e.n, i = r < 0n ? new m("-", "unaryMinus", [new u(-t(r))]) : new u(t(r));
-		return e.d === 1n ? i : new m("/", "divide", [i, new u(t(e.d))]);
+		return new h("-", "unaryMinus", [e]);
 	}
-	function A(e, t, n) {
-		if (!Hr(t)) return new c(w(e), w(t));
-		if (Fr(e) || ra(e)) {
-			for (var r = Array.from(t.dimensions); r.length > 0;) if (q(r[0]) && typeof r[0].value != "string") {
-				var a = D(r.shift().value, n);
-				Fr(e) ? e = e.items[a - 1] : (e = e.valueOf()[a - 1], e instanceof Array && (e = i(e)));
-			} else if (r.length > 1 && q(r[1]) && typeof r[1].value != "string") {
-				var o = D(r[1].value, n), s = [], d = Fr(e) ? e.items : e.valueOf();
-				for (var p of d) if (Fr(p)) s.push(p.items[o - 1]);
-				else if (ra(e)) s.push(p[o - 1]);
+	function A(e) {
+		var t = (e) => n.number === "BigNumber" && c ? c(e) : Number(e), r = e.s * e.n, i = r < 0n ? new h("-", "unaryMinus", [new d(-t(r))]) : new d(t(r));
+		return e.d === 1n ? i : new h("/", "divide", [i, new d(t(e.d))]);
+	}
+	function j(e, t, n) {
+		if (!Tr(t)) return new l(T(e), T(t));
+		if (i(e) || zr(e)) {
+			for (var r = Array.from(t.dimensions); r.length > 0;) if (G(r[0]) && typeof r[0].value != "string") {
+				var o = O(r.shift().value, n);
+				i(e) ? e = e.items[o - 1] : (e = e.valueOf()[o - 1], e instanceof Array && (e = a(e)));
+			} else if (r.length > 1 && G(r[1]) && typeof r[1].value != "string") {
+				var s = O(r[1].value, n), c = [], f = i(e) ? e.items : e.valueOf();
+				for (var m of f) if (i(m)) c.push(m.items[s - 1]);
+				else if (zr(e)) c.push(m[s - 1]);
 				else break;
-				if (s.length === d.length) e = Fr(e) ? new l(s) : i(s), r.splice(1, 1);
+				if (c.length === f.length) e = i(e) ? new u(c) : a(c), r.splice(1, 1);
 				else break;
 			} else break;
-			return r.length === t.dimensions.length ? new c(w(e), t) : r.length > 0 ? (t = new f(r), new c(w(e), t)) : e;
+			return r.length === t.dimensions.length ? new l(T(e), t) : r.length > 0 ? (t = new p(r), new l(T(e), t)) : e;
 		}
-		if (Yr(e) && t.dimensions.length === 1 && q(t.dimensions[0])) {
-			var m = t.dimensions[0].value;
-			return m in e.properties ? e.properties[m] : new u();
+		if (Qr(e) && t.dimensions.length === 1 && G(t.dimensions[0])) {
+			var h = t.dimensions[0].value;
+			return h in e.properties ? e.properties[h] : new d();
 		}
-		return new c(w(e), t);
+		return new l(T(e), t);
 	}
-	function j(e, t, n, r) {
+	function M(e, t, n, r) {
 		var i = t.shift(), a = t.reduce((t, i) => {
-			if (!K(i)) {
+			if (!J(i)) {
 				var a = t.pop();
-				if (K(a)) return [a, i];
+				if (J(a)) return [a, i];
 				try {
-					return t.push(S(e, [a, i], r)), t;
+					return t.push(C(e, [a, i], r)), t;
 				} catch {
 					t.push(a);
 				}
 			}
-			return t.push(w(t.pop())), [n([t.length === 1 ? t[0] : n(t), w(i)])];
+			return t.push(T(t.pop())), [n([t.length === 1 ? t[0] : n(t), T(i)])];
 		}, [i]);
-		return a.length === 1 ? a[0] : n([a[0], C(a[1])]);
+		return a.length === 1 ? a[0] : n([a[0], w(a[1])]);
 	}
-	function M(e, t) {
+	function N(e, t) {
 		switch (e.type) {
 			case "SymbolNode": return e;
 			case "ConstantNode":
 				switch (typeof e.value) {
-					case "number": return D(e.value, t);
-					case "bigint": return D(e.value, t);
+					case "number": return O(e.value, t);
+					case "bigint": return O(e.value, t);
 					case "string": return e.value;
-					default: if (!isNaN(e.value)) return D(e.value, t);
+					default: if (!isNaN(e.value)) return O(e.value, t);
 				}
 				return e;
 			case "FunctionNode":
 				if (r[e.name] && r[e.name].rawArgs) return e;
 				if (!["add", "multiply"].includes(e.name)) {
-					var n = e.args.map((e) => M(e, t));
-					if (!n.some(K)) try {
-						return S(e.name, n, t);
+					var n = e.args.map((e) => N(e, t));
+					if (!n.some(J)) try {
+						return C(e.name, n, t);
 					} catch {}
-					if (e.name === "size" && n.length === 1 && Fr(n[0])) {
-						for (var a = [], o = n[0]; Fr(o);) a.push(o.items.length), o = o.items[0];
-						return i(a);
+					if (e.name === "size" && n.length === 1 && i(n[0])) {
+						for (var o = [], s = n[0]; i(s);) o.push(s.items.length), s = s.items[0];
+						return a(o);
 					}
-					return new d(e.name, n.map(w));
+					return new f(e.name, n.map(T));
 				}
 			case "OperatorNode":
-				var s = e.fn.toString(), c, u, m = y(e);
-				if (W(e) && e.isUnary()) c = [M(e.args[0], t)], u = K(c[0]) ? m(c) : S(s, c, t);
-				else if (_(e, t.context)) if (c = v(e, t.context), c = c.map((e) => M(e, t)), g(s, t.context)) {
-					for (var h = [], x = [], C = 0; C < c.length; C++) K(c[C]) ? x.push(c[C]) : h.push(c[C]);
-					h.length > 1 ? (u = j(s, h, m, t), x.unshift(u), u = j(s, x, m, t)) : u = j(s, c, m, t);
-				} else u = j(s, c, m, t);
-				else c = e.args.map((e) => M(e, t)), u = j(s, c, m, t);
-				return u;
-			case "ParenthesisNode": return M(e.content, t);
-			case "AccessorNode": return A(M(e.object, t), M(e.index, t), t);
+				var c = e.fn.toString(), l, d, h = b(e);
+				if (q(e) && e.isUnary()) l = [N(e.args[0], t)], d = J(l[0]) ? h(l) : C(c, l, t);
+				else if (v(e, t.context)) if (l = y(e, t.context), l = l.map((e) => N(e, t)), _(c, t.context)) {
+					for (var g = [], S = [], w = 0; w < l.length; w++) J(l[w]) ? S.push(l[w]) : g.push(l[w]);
+					g.length > 1 ? (d = M(c, g, h, t), S.unshift(d), d = M(c, S, h, t)) : d = M(c, l, h, t);
+				} else d = M(c, l, h, t);
+				else l = e.args.map((e) => N(e, t)), d = M(c, l, h, t);
+				return d;
+			case "ParenthesisNode": return N(e.content, t);
+			case "AccessorNode": return j(N(e.object, t), N(e.index, t), t);
 			case "ArrayNode":
-				var T = e.items.map((e) => M(e, t));
-				return T.some(K) ? new l(T.map(w)) : i(T);
-			case "IndexNode": return new f(e.dimensions.map((e) => b(e, t)));
+				var E = e.items.map((e) => N(e, t));
+				return E.some(J) ? new u(E.map(T)) : a(E);
+			case "IndexNode": return new p(e.dimensions.map((e) => x(e, t)));
 			case "ObjectNode":
-				var E = {};
-				for (var O in e.properties) E[O] = b(e.properties[O], t);
-				return new p(E);
+				var D = {};
+				for (var k in e.properties) D[k] = x(e.properties[k], t);
+				return new m(D);
 			default: throw Error(`Unimplemented node type in simplifyConstant: ${e.type}`);
 		}
 	}
-	return b;
+	return x;
 }), Zs = "simplifyCore", Qs = /* #__PURE__ */ z(Zs, [
 	"typed",
 	"parse",
@@ -8105,106 +8105,106 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	"ParenthesisNode",
 	"SymbolNode"
 ], (e) => {
-	var { typed: t, parse: n, equal: r, isZero: i, add: a, subtract: o, multiply: s, divide: c, pow: l, AccessorNode: u, ArrayNode: d, ConstantNode: f, FunctionNode: p, IndexNode: m, ObjectNode: h, OperatorNode: g, ParenthesisNode: _, SymbolNode: v } = e, y = new f(0), b = new f(1), x = new f(!0), S = new f(!1);
-	function C(e) {
-		return W(e) && [
+	var { typed: t, parse: n, equal: r, isZero: a, add: o, subtract: s, multiply: c, divide: l, pow: u, AccessorNode: d, ArrayNode: f, ConstantNode: p, FunctionNode: m, IndexNode: h, ObjectNode: g, OperatorNode: _, ParenthesisNode: v, SymbolNode: y } = e, b = new p(0), x = new p(1), S = new p(!0), C = new p(!1);
+	function w(e) {
+		return q(e) && [
 			"and",
 			"not",
 			"or"
 		].includes(e.op);
 	}
-	var { hasProperty: w, isCommutative: T } = Js({
-		FunctionNode: p,
-		OperatorNode: g,
-		SymbolNode: v
+	var { hasProperty: T, isCommutative: E } = Js({
+		FunctionNode: m,
+		OperatorNode: _,
+		SymbolNode: y
 	});
-	function E(e) {
+	function D(e) {
 		var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, n = t ? t.context : void 0;
-		if (w(e, "trivial", n)) {
-			if (Ra(e) && e.args.length === 1) return E(e.args[0], t);
-			var a = !1, o = 0;
+		if (T(e, "trivial", n)) {
+			if (Oi(e) && e.args.length === 1) return D(e.args[0], t);
+			var o = !1, s = 0;
 			if (e.forEach((e) => {
-				++o, o === 1 && (a = E(e, t));
-			}), o === 1) return a;
-		}
-		var s = e;
-		if (Ra(s)) {
-			var c = No(s.name);
-			if (c) {
-				if (s.args.length > 2 && w(s, "associative", n)) for (; s.args.length > 2;) {
-					var l = s.args.pop(), f = s.args.pop();
-					s.args.push(new g(c, s.name, [l, f]));
+				++s, s === 1 && (o = D(e, t));
+			}), s === 1) return o;
+		}
+		var c = e;
+		if (Oi(c)) {
+			var l = No(c.name);
+			if (l) {
+				if (c.args.length > 2 && T(c, "associative", n)) for (; c.args.length > 2;) {
+					var u = c.args.pop(), p = c.args.pop();
+					c.args.push(new _(l, c.name, [u, p]));
 				}
-				s = new g(c, s.name, s.args);
-			} else return new p(E(s.fn), s.args.map((e) => E(e, t)));
-		}
-		if (W(s) && s.isUnary()) {
-			var _ = E(s.args[0], t);
-			if (s.op === "~" && W(_) && _.isUnary() && _.op === "~" || s.op === "not" && W(_) && _.isUnary() && _.op === "not" && C(_.args[0])) return _.args[0];
-			var v = !0;
-			if (s.op === "-" && W(_) && (_.isBinary() && _.fn === "subtract" && (s = new g("-", "subtract", [_.args[1], _.args[0]]), v = !1), _.isUnary() && _.op === "-")) return _.args[0];
-			if (v) return new g(s.op, s.fn, [_]);
-		}
-		if (W(s) && s.isBinary()) {
-			var D = E(s.args[0], t), O = E(s.args[1], t);
-			if (s.op === "+") {
-				if (q(D) && i(D.value)) return O;
-				if (q(O) && i(O.value)) return D;
-				W(O) && O.isUnary() && O.op === "-" && (O = O.args[0], s = new g("-", "subtract", [D, O]));
+				c = new _(l, c.name, c.args);
+			} else return new m(D(c.fn), c.args.map((e) => D(e, t)));
+		}
+		if (q(c) && c.isUnary()) {
+			var v = D(c.args[0], t);
+			if (c.op === "~" && q(v) && v.isUnary() && v.op === "~" || c.op === "not" && q(v) && v.isUnary() && v.op === "not" && w(v.args[0])) return v.args[0];
+			var y = !0;
+			if (c.op === "-" && q(v) && (v.isBinary() && v.fn === "subtract" && (c = new _("-", "subtract", [v.args[1], v.args[0]]), y = !1), v.isUnary() && v.op === "-")) return v.args[0];
+			if (y) return new _(c.op, c.fn, [v]);
+		}
+		if (q(c) && c.isBinary()) {
+			var O = D(c.args[0], t), k = D(c.args[1], t);
+			if (c.op === "+") {
+				if (G(O) && a(O.value)) return k;
+				if (G(k) && a(k.value)) return O;
+				q(k) && k.isUnary() && k.op === "-" && (k = k.args[0], c = new _("-", "subtract", [O, k]));
 			}
-			if (s.op === "-") return W(O) && O.isUnary() && O.op === "-" ? E(new g("+", "add", [D, O.args[0]]), t) : q(D) && i(D.value) ? E(new g("-", "unaryMinus", [O])) : q(O) && i(O.value) ? D : new g(s.op, s.fn, [D, O]);
-			if (s.op === "*") {
-				if (q(D)) {
-					if (i(D.value)) return y;
-					if (r(D.value, 1)) return O;
+			if (c.op === "-") return q(k) && k.isUnary() && k.op === "-" ? D(new _("+", "add", [O, k.args[0]]), t) : G(O) && a(O.value) ? D(new _("-", "unaryMinus", [k])) : G(k) && a(k.value) ? O : new _(c.op, c.fn, [O, k]);
+			if (c.op === "*") {
+				if (G(O)) {
+					if (a(O.value)) return b;
+					if (r(O.value, 1)) return k;
 				}
-				if (q(O)) {
-					if (i(O.value)) return y;
-					if (r(O.value, 1)) return D;
-					if (T(s, n)) return new g(s.op, s.fn, [O, D], s.implicit);
+				if (G(k)) {
+					if (a(k.value)) return b;
+					if (r(k.value, 1)) return O;
+					if (E(c, n)) return new _(c.op, c.fn, [k, O], c.implicit);
 				}
-				return new g(s.op, s.fn, [D, O], s.implicit);
+				return new _(c.op, c.fn, [O, k], c.implicit);
 			}
-			if (s.op === "/") return q(D) && i(D.value) ? y : q(O) && r(O.value, 1) ? D : new g(s.op, s.fn, [D, O]);
-			if (s.op === "^" && q(O)) {
-				if (i(O.value)) return b;
-				if (r(O.value, 1)) return D;
+			if (c.op === "/") return G(O) && a(O.value) ? b : G(k) && r(k.value, 1) ? O : new _(c.op, c.fn, [O, k]);
+			if (c.op === "^" && G(k)) {
+				if (a(k.value)) return x;
+				if (r(k.value, 1)) return O;
 			}
-			if (s.op === "and") {
-				if (q(D)) if (D.value) {
-					if (C(O)) return O;
-					if (q(O)) return O.value ? x : S;
-				} else return S;
-				if (q(O)) if (O.value) {
-					if (C(D)) return D;
-				} else return S;
+			if (c.op === "and") {
+				if (G(O)) if (O.value) {
+					if (w(k)) return k;
+					if (G(k)) return k.value ? S : C;
+				} else return C;
+				if (G(k)) if (k.value) {
+					if (w(O)) return O;
+				} else return C;
 			}
-			if (s.op === "or") {
-				if (q(D)) {
-					if (D.value) return x;
-					if (C(O)) return O;
+			if (c.op === "or") {
+				if (G(O)) {
+					if (O.value) return S;
+					if (w(k)) return k;
 				}
-				if (q(O)) {
-					if (O.value) return x;
-					if (C(D)) return D;
+				if (G(k)) {
+					if (k.value) return S;
+					if (w(O)) return O;
 				}
 			}
-			return new g(s.op, s.fn, [D, O]);
+			return new _(c.op, c.fn, [O, k]);
 		}
-		if (W(s)) return new g(s.op, s.fn, s.args.map((e) => E(e, t)));
-		if (Fr(s)) return new d(s.items.map((e) => E(e, t)));
-		if (Lt(s)) return new u(E(s.object, t), E(s.index, t));
-		if (Hr(s)) return new m(s.dimensions.map((e) => E(e, t)));
-		if (Yr(s)) {
-			var k = {};
-			for (var A in s.properties) k[A] = E(s.properties[A], t);
-			return new h(k);
+		if (q(c)) return new _(c.op, c.fn, c.args.map((e) => D(e, t)));
+		if (i(c)) return new f(c.items.map((e) => D(e, t)));
+		if (Gn(c)) return new d(D(c.object, t), D(c.index, t));
+		if (Tr(c)) return new h(c.dimensions.map((e) => D(e, t)));
+		if (Qr(c)) {
+			var A = {};
+			for (var j in c.properties) A[j] = D(c.properties[j], t);
+			return new g(A);
 		}
-		return s;
+		return c;
 	}
 	return t(Zs, {
-		Node: E,
-		"Node,Object": E
+		Node: D,
+		"Node,Object": D
 	});
 }), $s = /* #__PURE__ */ z("resolve", [
 	"typed",
@@ -8218,25 +8218,25 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	function s(e, t) {
 		var c = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : /* @__PURE__ */ new Set();
 		if (!t) return e;
-		if (Y(e)) {
+		if (K(e)) {
 			if (c.has(e.name)) {
 				var l = Array.from(c).join(", ");
 				throw ReferenceError(`recursive loop of variable definitions among {${l}}`);
 			}
 			var u = t.get(e.name);
-			if (K(u)) {
+			if (J(u)) {
 				var d = new Set(c);
 				return d.add(e.name), s(u, t, d);
 			} else if (typeof u == "number") return n(String(u));
 			else if (u !== void 0) return new r(u);
 			else return e;
-		} else if (W(e)) {
+		} else if (q(e)) {
 			var f = e.args.map(function(e) {
 				return s(e, t, c);
 			});
 			return new a(e.op, e.fn, f, e.implicit);
-		} else if (Wa(e)) return new o(s(e.content, t, c));
-		else if (Ra(e)) {
+		} else if ($n(e)) return new o(s(e.content, t, c));
+		else if (Oi(e)) {
 			var p = e.args.map(function(e) {
 				return s(e, t, c);
 			});
@@ -8247,11 +8247,11 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	return t("resolve", {
 		Node: s,
 		"Node, Map | null | undefined": s,
-		"Node, Object": (e, t) => s(e, wt(t)),
+		"Node, Object": (e, t) => s(e, I(t)),
 		"Array | Matrix": t.referToSelf((e) => (t) => t.map((t) => e(t))),
 		"Array | Matrix, null | undefined": t.referToSelf((e) => (t) => t.map((t) => e(t))),
-		"Array, Object": t.referTo("Array,Map", (e) => (t, n) => e(t, wt(n))),
-		"Matrix, Object": t.referTo("Matrix,Map", (e) => (t, n) => e(t, wt(n))),
+		"Array, Object": t.referTo("Array,Map", (e) => (t, n) => e(t, I(n))),
+		"Matrix, Object": t.referTo("Matrix,Map", (e) => (t, n) => e(t, I(n))),
 		"Array | Matrix, Map": t.referToSelf((e) => (t, n) => t.map((t) => e(t, n)))
 	});
 }), ec = "symbolicEqual", tc = /* #__PURE__ */ z(ec, [
@@ -8263,7 +8263,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	var { parse: t, simplify: n, typed: r, OperatorNode: i } = e;
 	function a(e, t) {
 		var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, a = n(new i("-", "subtract", [e, t]), {}, r);
-		return q(a) && !a.value;
+		return G(a) && !a.value;
 	}
 	return r(ec, {
 		"Node, Node": a,
@@ -8311,10 +8311,10 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 	};
 	var g = t("_derivTex", {
 		"Node, SymbolNode": function(e, t) {
-			return q(e) && Qa(e.value) === "string" ? g(r(e.value).toString(), t.toString(), 1) : g(e.toTex(), t.toString(), 1);
+			return G(e) && O(e.value) === "string" ? g(r(e.value).toString(), t.toString(), 1) : g(e.toTex(), t.toString(), 1);
 		},
 		"Node, ConstantNode": function(e, t) {
-			if (Qa(t.value) === "string") return g(e, r(t.value));
+			if (O(t.value) === "string") return g(e, r(t.value));
 			throw Error("The second parameter to 'derivative' is a non-string constant");
 		},
 		"Node, SymbolNode, ConstantNode": function(e, t, n) {
@@ -8489,9 +8489,9 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 			}
 			if (e.op === "^" && e.isBinary()) {
 				var d = e.args[0], f = e.args[1];
-				if (t(d)) return q(d) && (o(d.value) || a(d.value, 1)) ? y(0) : new u("*", "multiply", [e, new u("*", "multiply", [new l("log", [d.clone()]), v(f.clone(), t)])]);
+				if (t(d)) return G(d) && (o(d.value) || a(d.value, 1)) ? y(0) : new u("*", "multiply", [e, new u("*", "multiply", [new l("log", [d.clone()]), v(f.clone(), t)])]);
 				if (t(f)) {
-					if (q(f)) {
+					if (G(f)) {
 						if (o(f.value)) return y(0);
 						if (a(f.value, 1)) return v(d, t);
 					}
@@ -8504,7 +8504,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		}
 	});
 	function y(e, t) {
-		return new c(s(e, t || be(String(e), n)));
+		return new c(s(e, t || Tn(String(e), n)));
 	}
 	return h;
 }), ic = "rationalize", ac = /* #__PURE__ */ z(ic, /* @__PURE__ */ "config.typed.equal.isZero.add.subtract.multiply.divide.pow.parse.simplifyConstant.simplifyCore.simplify.?bignumber.?fraction.mathWithTransform.matrix.AccessorNode.ArrayNode.ConstantNode.FunctionNode.IndexNode.ObjectNode.OperatorNode.SymbolNode.ParenthesisNode".split("."), (e) => {
@@ -8538,7 +8538,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 			var t = e.type;
 			if (t === "FunctionNode") throw Error("There is an unsolved function call");
 			if (t === "OperatorNode") if (e.op === "^") {
-				if (e.args[1].type !== "ConstantNode" || !Dn(parseFloat(e.args[1].value))) throw Error("There is a non-integer exponent");
+				if (e.args[1].type !== "ConstantNode" || !fn(parseFloat(e.args[1].value))) throw Error("There is a non-integer exponent");
 				c(e.args[0]);
 			} else {
 				if (!o.includes(e.op)) throw Error("Operator " + e.op + " invalid in polynomial expression");
@@ -8781,7 +8781,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 		var r = e.type, i = arguments.length > 1;
 		if (r === "OperatorNode" && e.isBinary()) {
 			var a = !1, o;
-			if (e.op === "^" && (e.args[0].type === "ParenthesisNode" || e.args[0].type === "OperatorNode") && e.args[1].type === "ConstantNode" && (o = parseFloat(e.args[1].value), a = o >= 2 && Dn(o)), a) {
+			if (e.op === "^" && (e.args[0].type === "ParenthesisNode" || e.args[0].type === "OperatorNode") && e.args[1].type === "ConstantNode" && (o = parseFloat(e.args[1].value), a = o >= 2 && fn(o)), a) {
 				if (o > 2) {
 					var s = e.args[0];
 					e = new w("*", "multiply", [s, new w("^", "pow", [e.args[0].cloneDeep(), new b(o - 1)])]);
@@ -8838,7 +8838,7 @@ var Js = /* #__PURE__ */ z("simplifyUtil", [
 				}
 				if (n.op === "^") {
 					if (a.noFil !== 1) throw Error("Constant cannot be powered");
-					if (!Dn(c) || c <= 0) throw Error("Non-integer exponent is not allowed");
+					if (!fn(c) || c <= 0) throw Error("Non-integer exponent is not allowed");
 					for (var l = r + 1; l < c; l++) t[l] = 0;
 					c > r && (t[c] = 0), t[c] += a.cte * (a.oper === "+" ? 1 : -1), r = Math.max(c, r);
 					return;
@@ -8870,7 +8870,7 @@ function cc(e) {
 	for (var t = 1; t < arguments.length; t++) {
 		var n = arguments[t] == null ? {} : arguments[t];
 		t % 2 ? sc(Object(n), !0).forEach(function(t) {
-			J(e, t, n[t]);
+			Y(e, t, n[t]);
 		}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(n)) : sc(Object(n)).forEach(function(t) {
 			Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(n, t));
 		});
@@ -8878,26 +8878,26 @@ function cc(e) {
 	return e;
 }
 var lc = /* #__PURE__ */ z("mapSlices", ["typed", "isInteger"], (e) => {
-	var { typed: t, isInteger: n } = e, r = fe({
+	var { typed: t, isInteger: n } = e, r = kt({
 		typed: t,
 		isInteger: n
 	});
 	return t("mapSlices", { "...any": function(e) {
 		var t = e[1];
-		ni(t) ? e[1] = t - 1 : Wi(t) && (e[1] = t.minus(1));
+		Fi(t) ? e[1] = t - 1 : ka(t) && (e[1] = t.minus(1));
 		try {
 			return r.apply(null, e);
 		} catch (e) {
 			throw X(e);
 		}
 	} });
-}, cc({ isTransformFunction: !0 }, fe.meta)), uc = /* #__PURE__ */ z("column", [
+}, cc({ isTransformFunction: !0 }, kt.meta)), uc = /* #__PURE__ */ z("column", [
 	"typed",
 	"Index",
 	"matrix",
 	"range"
 ], (e) => {
-	var { typed: t, Index: n, matrix: r, range: i } = e, a = Si({
+	var { typed: t, Index: n, matrix: r, range: i } = e, a = xt({
 		typed: t,
 		Index: n,
 		matrix: r,
@@ -8905,7 +8905,7 @@ var lc = /* #__PURE__ */ z("mapSlices", ["typed", "isInteger"], (e) => {
 	});
 	return t("column", { "...any": function(e) {
 		var t = e.length - 1, n = e[t];
-		ni(n) && (e[t] = n - 1);
+		Fi(n) && (e[t] = n - 1);
 		try {
 			return a.apply(null, e);
 		} catch (e) {
@@ -8917,10 +8917,10 @@ var lc = /* #__PURE__ */ z("mapSlices", ["typed", "isInteger"], (e) => {
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js
 function dc(e, t, n) {
 	var r = e.filter(function(e) {
-		return Y(e) && !(e.name in t) && !n.has(e.name);
+		return K(e) && !(e.name in t) && !n.has(e.name);
 	})[0];
 	if (!r) throw Error("No undefined variable found in inline expression \"" + e + "\"");
-	var i = r.name, a = /* @__PURE__ */ new Map(), o = new oe(n, a, new Set([i])), s = e.compile();
+	var i = r.name, a = /* @__PURE__ */ new Map(), o = new on(n, a, new Set([i])), s = e.compile();
 	return function(e) {
 		return a.set(i, e), s.evaluate(o);
 	};
@@ -8953,12 +8953,12 @@ function mc(e) {
 var hc = /* #__PURE__ */ z("filter", ["typed"], (e) => {
 	var { typed: t } = e;
 	function n(e, n, i) {
-		var a = St({ typed: t }), o = fc({ typed: t });
+		var a = P({ typed: t }), o = fc({ typed: t });
 		if (e.length === 0) return a();
 		var s = e[0];
 		if (e.length === 1) return a(s);
 		var c = e.length - 1, l = e[c];
-		return s &&= r(s, i), l &&= Y(l) || ji(l) ? r(l, i) : dc(l, n, i), a(s, o(l, c));
+		return s &&= r(s, i), l &&= K(l) || vr(l) ? r(l, i) : dc(l, n, i), a(s, o(l, c));
 	}
 	n.rawArgs = !0;
 	function r(e, t) {
@@ -8966,13 +8966,13 @@ var hc = /* #__PURE__ */ z("filter", ["typed"], (e) => {
 	}
 	return n;
 }, { isTransformFunction: !0 }), gc = /* #__PURE__ */ z("forEach", ["typed"], (e) => {
-	var { typed: t } = e, n = P({ typed: t }), r = fc({ typed: t });
+	var { typed: t } = e, n = ie({ typed: t }), r = fc({ typed: t });
 	function i(e, t, i) {
 		if (e.length === 0) return n();
 		var o = e[0];
 		if (e.length === 1) return n(o);
 		var s = e.length - 1, c = e[s];
-		return o &&= a(o, i), c &&= Y(c) || ji(c) ? a(c, i) : dc(c, t, i), n(o, r(c, s));
+		return o &&= a(o, i), c &&= K(c) || vr(c) ? a(c, i) : dc(c, t, i), n(o, r(c, s));
 	}
 	i.rawArgs = !0;
 	function a(e, t) {
@@ -8982,30 +8982,30 @@ var hc = /* #__PURE__ */ z("filter", ["typed"], (e) => {
 }, { isTransformFunction: !0 }), _c = /* #__PURE__ */ z("index", ["Index", "getMatrixDataType"], (e) => {
 	var { Index: t, getMatrixDataType: n } = e;
 	return function() {
-		for (var e = [], r = 0, a = arguments.length; r < a; r++) {
-			var o = arguments[r];
-			if (fo(o)) o.start--, o.end -= o.step > 0 ? 0 : 2;
-			else if (o && o.isSet === !0) o = o.map(function(e) {
+		for (var e = [], r = 0, i = arguments.length; r < i; r++) {
+			var a = arguments[r];
+			if (Ha(a)) a.start--, a.end -= a.step > 0 ? 0 : 2;
+			else if (a && a.isSet === !0) a = a.map(function(e) {
 				return e - 1;
 			});
-			else if (i(o) || ra(o)) n(o) !== "boolean" && (o = o.map(function(e) {
+			else if (It(a) || zr(a)) n(a) !== "boolean" && (a = a.map(function(e) {
 				return e - 1;
 			}));
-			else if (ni(o) || ja(o)) o--;
-			else if (Wi(o)) o = o.toNumber() - 1;
-			else if (typeof o != "string") throw TypeError("Dimension must be an Array, Matrix, number, bigint, string, or Range");
-			e[r] = o;
+			else if (Fi(a) || Mr(a)) a--;
+			else if (ka(a)) a = a.toNumber() - 1;
+			else if (typeof a != "string") throw TypeError("Dimension must be an Array, Matrix, number, bigint, string, or Range");
+			e[r] = a;
 		}
-		var s = new t();
-		return t.apply(s, e), s;
+		var o = new t();
+		return t.apply(o, e), o;
 	};
 }, { isTransformFunction: !0 }), vc = /* #__PURE__ */ z("map", ["typed"], (e) => {
-	var { typed: t } = e, n = ie({ typed: t }), r = fc({ typed: t });
+	var { typed: t } = e, n = rn({ typed: t }), r = fc({ typed: t });
 	function i(e, t, i) {
 		if (e.length === 0) return n();
 		if (e.length === 1) return n(e[0]);
 		var a = e.length - 1, o = e.slice(0, a), s = e[a];
-		return o = o.map((e) => c(e, i)), s &&= Y(s) || ji(s) ? c(s, i) : dc(s, t, i), n(...o, r(s, a));
+		return o = o.map((e) => c(e, i)), s &&= K(s) || vr(s) ? c(s, i) : dc(s, t, i), n(...o, r(s, a));
 		function c(e, t) {
 			return e.compile().evaluate(t);
 		}
@@ -9015,15 +9015,15 @@ var hc = /* #__PURE__ */ z("filter", ["typed"], (e) => {
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/transform/utils/dimToZeroBase.js
 function yc(e) {
-	return ni(e) ? e - 1 : Wi(e) ? e.minus(1) : e;
+	return Fi(e) ? e - 1 : ka(e) ? e.minus(1) : e;
 }
 function bc(e) {
-	return ni(e) || Wi(e);
+	return Fi(e) || ka(e);
 }
 //#endregion
 //#region ../../../node_modules/.bun/mathjs@15.2.0/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js
 function xc(e) {
-	if (e.length === 2 && li(e[0])) {
+	if (e.length === 2 && ha(e[0])) {
 		e = e.slice();
 		var t = e[1];
 		bc(t) && (e[1] = yc(t));
@@ -9037,7 +9037,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"larger",
 	"isNaN"
 ], (e) => {
-	var { typed: t, config: n, numeric: r, larger: i, isNaN: a } = e, o = Ii({
+	var { typed: t, config: n, numeric: r, larger: i, isNaN: a } = e, o = Ni({
 		typed: t,
 		config: n,
 		numeric: r,
@@ -9057,7 +9057,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"add",
 	"divide"
 ], (e) => {
-	var { typed: t, add: n, divide: r } = e, i = Ia({
+	var { typed: t, add: n, divide: r } = e, i = Pa({
 		typed: t,
 		add: n,
 		divide: r
@@ -9077,7 +9077,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"smaller",
 	"isNaN"
 ], (e) => {
-	var { typed: t, config: n, numeric: r, smaller: i, isNaN: a } = e, o = ta({
+	var { typed: t, config: n, numeric: r, smaller: i, isNaN: a } = e, o = ea({
 		typed: t,
 		config: n,
 		numeric: r,
@@ -9106,7 +9106,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"isZero",
 	"isPositive"
 ], (e) => {
-	var { typed: t, config: n, matrix: r, bignumber: i, equal: a, smaller: o, smallerEq: s, larger: c, largerEq: l, add: u, isZero: d, isPositive: f } = e, p = Zt({
+	var { typed: t, config: n, matrix: r, bignumber: i, equal: a, smaller: o, smallerEq: s, larger: c, largerEq: l, add: u, isZero: d, isPositive: f } = e, p = no({
 		typed: t,
 		config: n,
 		matrix: r,
@@ -9129,7 +9129,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"matrix",
 	"range"
 ], (e) => {
-	var { typed: t, Index: n, matrix: r, range: i } = e, a = io({
+	var { typed: t, Index: n, matrix: r, range: i } = e, a = ur({
 		typed: t,
 		Index: n,
 		matrix: r,
@@ -9137,7 +9137,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	});
 	return t("row", { "...any": function(e) {
 		var t = e.length - 1, n = e[t];
-		ni(n) && (e[t] = n - 1);
+		Fi(n) && (e[t] = n - 1);
 		try {
 			return a.apply(null, e);
 		} catch (e) {
@@ -9150,7 +9150,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"zeros",
 	"add"
 ], (e) => {
-	var { typed: t, matrix: n, zeros: r, add: i } = e, a = fr({
+	var { typed: t, matrix: n, zeros: r, add: i } = e, a = lo({
 		typed: t,
 		matrix: n,
 		zeros: r,
@@ -9168,14 +9168,14 @@ var Sc = /* #__PURE__ */ z("max", [
 	"matrix",
 	"isInteger"
 ], (e) => {
-	var { typed: t, matrix: n, isInteger: r } = e, i = d({
+	var { typed: t, matrix: n, isInteger: r } = e, i = yi({
 		typed: t,
 		matrix: n,
 		isInteger: r
 	});
 	return t("concat", { "...any": function(e) {
 		var t = e.length - 1, n = e[t];
-		ni(n) ? e[t] = n - 1 : Wi(n) && (e[t] = n.minus(1));
+		Fi(n) ? e[t] = n - 1 : ka(n) && (e[t] = n.minus(1));
 		try {
 			return i.apply(null, e);
 		} catch (e) {
@@ -9189,7 +9189,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"number",
 	"bignumber"
 ], (e) => {
-	var { typed: t, matrix: n, subtract: r, number: i, bignumber: a } = e, o = on({
+	var { typed: t, matrix: n, subtract: r, number: i, bignumber: a } = e, o = Ja({
 		typed: t,
 		matrix: n,
 		subtract: r,
@@ -9210,7 +9210,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"sqrt",
 	"variance"
 ], (e) => {
-	var { typed: t, map: n, sqrt: r, variance: i } = e, a = Sa({
+	var { typed: t, map: n, sqrt: r, variance: i } = e, a = ba({
 		typed: t,
 		map: n,
 		sqrt: r,
@@ -9230,7 +9230,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"add",
 	"numeric"
 ], (e) => {
-	var { typed: t, config: n, add: r, numeric: i } = e, a = Br({
+	var { typed: t, config: n, add: r, numeric: i } = e, a = Lr({
 		typed: t,
 		config: n,
 		add: r,
@@ -9259,7 +9259,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"larger",
 	"mapSlices"
 ], (e) => {
-	var { typed: t, bignumber: n, add: r, subtract: i, divide: a, multiply: o, partitionSelect: s, compare: c, isInteger: l, smaller: u, smallerEq: d, larger: f, mapSlices: p } = e, m = yr({
+	var { typed: t, bignumber: n, add: r, subtract: i, divide: a, multiply: o, partitionSelect: s, compare: c, isInteger: l, smaller: u, smallerEq: d, larger: f, mapSlices: p } = e, m = gr({
 		typed: t,
 		bignumber: n,
 		add: r,
@@ -9292,15 +9292,15 @@ var Sc = /* #__PURE__ */ z("max", [
 	"add",
 	"unaryPlus"
 ], (e) => {
-	var { typed: t, add: n, unaryPlus: r } = e, i = Er({
+	var { typed: t, add: n, unaryPlus: r } = e, i = Cr({
 		typed: t,
 		add: n,
 		unaryPlus: r
 	});
 	return t(Fc, { "...any": function(e) {
-		if (e.length === 2 && li(e[0])) {
+		if (e.length === 2 && ha(e[0])) {
 			var t = e[1];
-			ni(t) ? e[1] = t - 1 : Wi(t) && (e[1] = t.minus(1));
+			Fi(t) ? e[1] = t - 1 : ka(t) && (e[1] = t.minus(1));
 		}
 		try {
 			return i.apply(null, e);
@@ -9317,7 +9317,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"mapSlices",
 	"isNaN"
 ], (e) => {
-	var { typed: t, add: n, subtract: r, multiply: i, divide: a, mapSlices: o, isNaN: s } = e, c = ki({
+	var { typed: t, add: n, subtract: r, multiply: i, divide: a, mapSlices: o, isNaN: s } = e, c = Ei({
 		typed: t,
 		add: n,
 		subtract: r,
@@ -9340,7 +9340,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"zeros",
 	"add"
 ], (e) => {
-	var { typed: t, matrix: n, zeros: r, add: i } = e, a = qr({
+	var { typed: t, matrix: n, zeros: r, add: i } = e, a = Wr({
 		typed: t,
 		matrix: n,
 		zeros: r,
@@ -9355,7 +9355,7 @@ var Sc = /* #__PURE__ */ z("max", [
 		}
 	});
 	function o(e) {
-		return e.replace($n, (e) => "$" + e.slice(1).split(".").map(function(e) {
+		return e.replace(Zn, (e) => "$" + e.slice(1).split(".").map(function(e) {
 			return !isNaN(e) && e.length > 0 ? parseInt(e) - 1 : e;
 		}).join("."));
 	}
@@ -9368,7 +9368,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"not",
 	"concat"
 ], (e) => {
-	var { typed: t, matrix: n, equalScalar: r, zeros: i, not: a, concat: o } = e, s = ei({
+	var { typed: t, matrix: n, equalScalar: r, zeros: i, not: a, concat: o } = e, s = Xr({
 		typed: t,
 		matrix: n,
 		equalScalar: r,
@@ -9378,7 +9378,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	});
 	function c(e, t, n) {
 		var r = e[0].compile().evaluate(n);
-		return !li(r) && !s(r, !0) ? !1 : s(r, e[1].compile().evaluate(n));
+		return !ha(r) && !s(r, !0) ? !1 : s(r, e[1].compile().evaluate(n));
 	}
 	return c.rawArgs = !0, c;
 }, { isTransformFunction: !0 }), Hc = /* #__PURE__ */ z("or", [
@@ -9388,7 +9388,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"DenseMatrix",
 	"concat"
 ], (e) => {
-	var { typed: t, matrix: n, equalScalar: r, DenseMatrix: i, concat: a } = e, o = hi({
+	var { typed: t, matrix: n, equalScalar: r, DenseMatrix: i, concat: a } = e, o = d({
 		typed: t,
 		matrix: n,
 		equalScalar: r,
@@ -9397,7 +9397,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	});
 	function s(e, t, n) {
 		var r = e[0].compile().evaluate(n);
-		return !li(r) && o(r, !1) ? !0 : o(r, e[1].compile().evaluate(n));
+		return !ha(r) && o(r, !1) ? !0 : o(r, e[1].compile().evaluate(n));
 	}
 	return s.rawArgs = !0, s;
 }, { isTransformFunction: !0 }), Uc = /* #__PURE__ */ z("nullish", [
@@ -9407,7 +9407,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"flatten",
 	"deepEqual"
 ], (e) => {
-	var { typed: t, matrix: n, size: r, flatten: i, deepEqual: a } = e, o = ot({
+	var { typed: t, matrix: n, size: r, flatten: i, deepEqual: a } = e, o = di({
 		typed: t,
 		matrix: n,
 		size: r,
@@ -9416,7 +9416,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	});
 	function s(e, t, n) {
 		var r = e[0].compile().evaluate(n);
-		return !li(r) && r != null && r !== void 0 ? r : o(r, e[1].compile().evaluate(n));
+		return !ha(r) && r != null && r !== void 0 ? r : o(r, e[1].compile().evaluate(n));
 	}
 	return s.rawArgs = !0, s;
 }, { isTransformFunction: !0 }), Wc = /* #__PURE__ */ z("bitAnd", [
@@ -9428,7 +9428,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"not",
 	"concat"
 ], (e) => {
-	var { typed: t, matrix: n, equalScalar: r, zeros: i, not: a, concat: o } = e, s = At({
+	var { typed: t, matrix: n, equalScalar: r, zeros: i, not: a, concat: o } = e, s = pt({
 		typed: t,
 		matrix: n,
 		equalScalar: r,
@@ -9438,7 +9438,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	});
 	function c(e, t, n) {
 		var r = e[0].compile().evaluate(n);
-		if (!li(r)) {
+		if (!ha(r)) {
 			if (isNaN(r)) return NaN;
 			if (r === 0 || r === !1) return 0;
 		}
@@ -9452,7 +9452,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	"DenseMatrix",
 	"concat"
 ], (e) => {
-	var { typed: t, matrix: n, equalScalar: r, DenseMatrix: i, concat: a } = e, o = mt({
+	var { typed: t, matrix: n, equalScalar: r, DenseMatrix: i, concat: a } = e, o = at({
 		typed: t,
 		matrix: n,
 		equalScalar: r,
@@ -9461,7 +9461,7 @@ var Sc = /* #__PURE__ */ z("max", [
 	});
 	function s(e, t, n) {
 		var r = e[0].compile().evaluate(n);
-		if (!li(r)) {
+		if (!ha(r)) {
 			if (isNaN(r)) return NaN;
 			if (r === -1) return -1;
 			if (r === !0) return 1;
@@ -9471,27 +9471,27 @@ var Sc = /* #__PURE__ */ z("max", [
 	return s.rawArgs = !0, s;
 }, { isTransformFunction: !0 }), Kc = {}, qc = {}, Jc = {}, $ = So({ mathWithTransform: qc }), Yc = es({ Node: $ }), Xc = rs({ Node: $ }), Zc = as({ Node: $ }), Qc = ls({ Node: $ }), $c = Do({ Node: $ }), el = Lo({
 	Node: $,
-	ResultSet: Et
+	ResultSet: Tt
 }), tl = zo({ Node: $ }), nl = ss({ Node: $ }), rl = oc({ classes: Jc }), il = ws({
 	math: Kc,
-	typed: H
+	typed: U
 }), al = Xo({
 	Node: $,
-	typed: H
+	typed: U
 }), ol = Vs({
 	Chain: il,
-	typed: H
+	typed: U
 }), sl = Jo({
 	Node: $,
-	isBounded: Xi
+	isBounded: Ji
 }), cl = Qo({
 	Node: $,
-	size: Qi
+	size: Zi
 }), ll = To({
 	Node: $,
 	subset: c
 }), ul = Fo({
-	matrix: V,
+	matrix: H,
 	Node: $,
 	subset: c
 }), dl = us({
@@ -9518,18 +9518,18 @@ var Sc = /* #__PURE__ */ z("max", [
 	RangeNode: nl,
 	RelationalNode: Qc,
 	SymbolNode: dl,
-	config: la,
-	numeric: Pa,
-	typed: H
+	config: We,
+	numeric: Ma,
+	typed: U
 }), ml = $s({
 	ConstantNode: sl,
 	FunctionNode: fl,
 	OperatorNode: Xc,
 	ParenthesisNode: Zc,
 	parse: pl,
-	typed: H
+	typed: U
 }), hl = Xs({
-	bignumber: Ri,
+	bignumber: Ii,
 	fraction: _o,
 	AccessorNode: ll,
 	ArrayNode: $c,
@@ -9539,17 +9539,17 @@ var Sc = /* #__PURE__ */ z("max", [
 	ObjectNode: Yc,
 	OperatorNode: Xc,
 	SymbolNode: dl,
-	config: la,
-	isBounded: Xi,
+	config: We,
+	isBounded: Ji,
 	mathWithTransform: qc,
-	matrix: V,
-	typed: H
+	matrix: H,
+	typed: U
 }), gl = gs({
 	parse: pl,
-	typed: H
+	typed: U
 }), _l = vs({
 	parse: pl,
-	typed: H
+	typed: U
 }), vl = Cs({ evaluate: _l }), yl = ys({
 	evaluate: _l,
 	parse: pl
@@ -9563,19 +9563,19 @@ var Sc = /* #__PURE__ */ z("max", [
 	OperatorNode: Xc,
 	ParenthesisNode: Zc,
 	SymbolNode: dl,
-	add: B,
-	divide: vr,
-	equal: dr,
-	isZero: Li,
+	add: V,
+	divide: hr,
+	equal: lr,
+	isZero: Pi,
 	multiply: a,
 	parse: pl,
 	pow: M,
-	subtract: fi,
-	typed: H
+	subtract: ci,
+	typed: U
 }), xl = zs({
 	Help: vl,
 	mathWithTransform: qc,
-	typed: H
+	typed: U
 }), Sl = Ys({
 	AccessorNode: ll,
 	ArrayNode: $c,
@@ -9586,325 +9586,325 @@ var Sc = /* #__PURE__ */ z("max", [
 	OperatorNode: Xc,
 	ParenthesisNode: Zc,
 	SymbolNode: dl,
-	equal: dr,
+	equal: lr,
 	parse: pl,
 	replacer: go,
 	resolve: ml,
 	simplifyConstant: hl,
 	simplifyCore: bl,
-	typed: H
+	typed: U
 });
-Mt(Kc, {
-	e: Fi,
-	false: Ce,
-	fineStructure: at,
-	i: Kn,
+ht(Kc, {
+	e: Mi,
+	false: be,
+	fineStructure: it,
+	i: Wn,
 	Infinity: h,
-	LN10: vt,
+	LN10: _t,
 	LOG10E: s,
-	NaN: _n,
-	null: un,
-	phi: Gr,
-	SQRT1_2: ce,
-	sackurTetrode: Rn,
-	tau: Xe,
-	true: wn,
-	E: Fi,
+	NaN: hn,
+	null: cn,
+	phi: Hr,
+	SQRT1_2: se,
+	sackurTetrode: Ln,
+	tau: Je,
+	true: Sn,
+	E: Mi,
 	version: t,
-	efimovFactor: $r,
-	LN2: vi,
-	pi: Zn,
+	efimovFactor: Yr,
+	LN2: hi,
+	pi: Yn,
 	replacer: go,
 	reviver: rl,
-	SQRT2: Ae,
-	typed: H,
-	PI: Zn,
-	weakMixingAngle: Nr,
-	abs: ge,
-	acos: Ue,
-	acot: R,
-	acsc: An,
+	SQRT2: De,
+	typed: U,
+	PI: Yn,
+	weakMixingAngle: Ar,
+	abs: me,
+	acos: Be,
+	acot: Ne,
+	acsc: On,
 	addScalar: e,
-	arg: Ma,
-	asech: va,
-	asinh: cr,
-	atan: Zi,
-	atanh: Sr,
-	bigint: ia,
-	bitNot: tr,
+	arg: Aa,
+	asech: ga,
+	asinh: or,
+	atan: Xi,
+	atanh: yr,
+	bigint: na,
+	bitNot: er,
 	boolean: k,
-	clone: Tt,
+	clone: wt,
 	combinations: m,
-	complex: he,
+	complex: pe,
 	conj: bo,
-	cos: Cn,
-	cot: gn,
-	csc: Fn,
+	cos: xn,
+	cot: mn,
+	csc: Pn,
 	cube: o,
-	equalScalar: ro,
+	equalScalar: to,
 	erf: T,
-	exp: Ya,
+	exp: qa,
 	expm1: re,
-	filter: mi,
-	flatten: de,
-	forEach: Qe,
-	format: Ut,
-	getMatrixDataType: En,
-	hex: zn,
-	im: Pr,
-	isBounded: Xi,
-	isNaN: Ai,
-	isNumeric: Dr,
-	isPrime: na,
-	LOG2E: di,
-	lgamma: Qt,
-	log10: Za,
-	log2: ae,
-	map: Fe,
-	mode: ua,
-	multiplyScalar: jr,
-	not: pa,
-	number: Di,
-	oct: wr,
-	pickRandom: Va,
-	print: bt,
-	random: Ot,
-	re: Ze,
-	sec: Gn,
-	sign: Na,
-	sin: Cr,
-	size: Qi,
-	splitUnit: to,
-	square: qa,
-	string: yi,
-	subtractScalar: rt,
-	tan: le,
+	filter: ui,
+	flatten: ue,
+	forEach: Xe,
+	format: Ht,
+	getMatrixDataType: wn,
+	hex: Rn,
+	im: jr,
+	isBounded: Ji,
+	isNaN: Di,
+	isNumeric: wr,
+	isPrime: ta,
+	LOG2E: si,
+	lgamma: Xt,
+	log10: Ya,
+	log2: R,
+	map: Me,
+	mode: ca,
+	multiplyScalar: Or,
+	not: da,
+	number: wi,
+	oct: xr,
+	pickRandom: za,
+	print: yt,
+	random: Dt,
+	re: Ye,
+	sec: Un,
+	sign: ja,
+	sin: br,
+	size: Zi,
+	splitUnit: $a,
+	square: Ga,
+	string: gi,
+	subtractScalar: nt,
+	tan: ce,
 	toBest: g,
-	typeOf: dn,
-	acosh: aa,
-	acsch: Un,
-	asec: Gi,
-	bignumber: Ri,
+	typeOf: ln,
+	acosh: ra,
+	acsch: Vn,
+	asec: Ui,
+	bignumber: Ii,
 	chain: ol,
-	combinationsWithRep: _i,
-	cosh: ke,
-	csch: Yn,
-	dot: Fa,
-	hasNumericValue: ze,
-	isFinite: Ca,
-	isNegative: La,
-	isZero: Li,
-	matrix: V,
+	combinationsWithRep: mi,
+	cosh: Ee,
+	csch: qn,
+	dot: Na,
+	hasNumericValue: Ie,
+	isFinite: xa,
+	isNegative: Fa,
+	isZero: Pi,
+	matrix: H,
 	matrixFromFunction: b,
 	multiply: a,
-	ones: Rr,
-	randomInt: ue,
-	resize: yn,
-	sech: Ft,
-	sinh: Lr,
-	sparse: so,
-	sqrt: Jt,
-	squeeze: nn,
-	tanh: je,
-	transpose: we,
-	xgcd: Hi,
-	zeros: si,
-	acoth: In,
-	asin: ui,
-	bin: ri,
-	coth: kn,
-	ctranspose: zt,
-	diag: ir,
-	equal: dr,
+	ones: Fr,
+	randomInt: le,
+	resize: _n,
+	sech: Pt,
+	sinh: Pr,
+	sparse: oo,
+	sqrt: Kt,
+	squeeze: en,
+	tanh: Oe,
+	transpose: xe,
+	xgcd: Bi,
+	zeros: ri,
+	acoth: Fn,
+	asin: oi,
+	bin: $r,
+	coth: Dn,
+	ctranspose: Rt,
+	diag: rr,
+	equal: lr,
 	fraction: _o,
-	identity: It,
-	isInteger: br,
-	kron: er,
-	mapSlices: et,
+	identity: Ft,
+	isInteger: _r,
+	kron: Qn,
+	mapSlices: Qe,
 	matrixFromColumns: yo,
-	num: _r,
+	num: mr,
 	reshape: _,
-	round: Ge,
-	unaryMinus: _e,
-	bernoulli: Ur,
-	cbrt: ln,
-	concat: tt,
-	deepEqual: Oa,
-	dotMultiply: zr,
-	floor: Ne,
-	gcd: pn,
-	isPositive: Vr,
-	larger: Ua,
-	lcm: pr,
-	leftShift: ao,
-	mod: qe,
-	nthRoot: ai,
-	nullish: ba,
-	numeric: Pa,
-	prod: bi,
-	rightArithShift: Te,
-	smaller: Zr,
-	subtract: fi,
+	round: He,
+	unaryMinus: he,
+	bernoulli: Br,
+	cbrt: sn,
+	concat: et,
+	deepEqual: Ea,
+	dotMultiply: Ir,
+	floor: Ae,
+	gcd: dn,
+	isPositive: Rr,
+	larger: Va,
+	lcm: dr,
+	leftShift: ro,
+	mod: Ge,
+	nthRoot: ti,
+	nullish: va,
+	numeric: Ma,
+	prod: _i,
+	rightArithShift: Se,
+	smaller: qr,
+	subtract: ci,
 	to: ho,
-	unaryPlus: We,
-	xor: ha,
-	add: B,
-	atan2: Ta,
-	bitAnd: Xr,
-	bitOr: Ga,
+	unaryPlus: Ve,
+	xor: pa,
+	add: V,
+	atan2: Ca,
+	bitAnd: Kr,
+	bitOr: Ua,
 	bitXor: po,
-	ceil: se,
-	compare: lt,
-	compareText: Nt,
-	composition: Ie,
-	count: da,
-	cross: Hn,
-	diff: Ji,
-	divideScalar: Oi,
-	equalText: Xt,
-	fix: kt,
-	hypot: Nn,
-	intersect: Ui,
-	invmod: or,
+	ceil: oe,
+	compare: ct,
+	compareText: Mt,
+	composition: B,
+	count: la,
+	cross: Bn,
+	diff: Ki,
+	divideScalar: Ti,
+	equalText: Jt,
+	fix: Ot,
+	hypot: jn,
+	intersect: Vi,
+	invmod: ar,
 	largerEq: uo,
 	log: D,
-	lsolve: Ct,
-	matrixFromRows: Sn,
-	min: xe,
-	nthRoots: rr,
-	partitionSelect: Pi,
-	qr: pi,
-	rightLogShift: fn,
-	slu: Ni,
+	lsolve: St,
+	matrixFromRows: bn,
+	min: ve,
+	nthRoots: nr,
+	partitionSelect: ji,
+	qr: li,
+	rightLogShift: un,
+	slu: Ai,
 	subset: c,
-	sum: dt,
-	trace: vn,
-	usolve: Ln,
-	zpk2tf: Yi,
-	catalan: $a,
-	compareNatural: _t,
-	cumsum: Mr,
-	det: ma,
-	dotDivide: Tr,
-	index: Aa,
-	inv: ga,
-	log1p: sn,
-	lsolveAll: Ci,
-	max: Oe,
-	or: $i,
-	pinv: co,
+	sum: ut,
+	trace: gn,
+	usolve: In,
+	zpk2tf: qi,
+	catalan: Za,
+	compareNatural: gt,
+	cumsum: kr,
+	det: fa,
+	dotDivide: Sr,
+	index: Oa,
+	inv: ma,
+	log1p: an,
+	lsolveAll: bi,
+	max: Te,
+	or: Qi,
+	pinv: so,
 	pow: M,
-	setCartesian: Ar,
-	setDistinct: zi,
-	setIsSubset: ii,
-	setPowerset: Ki,
-	smallerEq: Wr,
-	sort: Ba,
+	setCartesian: Dr,
+	setDistinct: Li,
+	setIsSubset: ei,
+	setPowerset: Wi,
+	smallerEq: Vr,
+	sort: Ra,
 	sqrtm: C,
-	unequal: oa,
-	usolveAll: jn,
-	and: Ir,
-	den: Vi,
-	distance: xa,
-	dotPow: ea,
-	expm: an,
+	unequal: ia,
+	usolveAll: kn,
+	and: Nr,
+	den: zi,
+	distance: ya,
+	dotPow: $i,
+	expm: nn,
 	fft: u,
-	gamma: bn,
+	gamma: vn,
 	ifft: r,
 	lup: f,
-	range: Me,
-	row: sa,
-	setDifference: Ea,
-	setMultiplicity: nr,
-	setSymDifference: gr,
-	vacuumImpedance: Wn,
-	wienDisplacement: ka,
-	atomicMass: Mi,
-	bohrMagneton: hr,
-	boltzmann: en,
-	column: Ti,
-	conductanceQuantum: Kt,
-	coulomb: Se,
-	createUnit: He,
-	deuteronMass: oi,
-	eigs: Kr,
-	electronMass: Ha,
+	range: ke,
+	row: aa,
+	setDifference: wa,
+	setMultiplicity: tr,
+	setSymDifference: pr,
+	vacuumImpedance: Hn,
+	wienDisplacement: Da,
+	atomicMass: ki,
+	bohrMagneton: fr,
+	boltzmann: Qt,
+	column: Si,
+	conductanceQuantum: Wt,
+	coulomb: ye,
+	createUnit: ze,
+	deuteronMass: ni,
+	eigs: Ur,
+	electronMass: Ba,
 	factorial: N,
-	fermiCoupling: xi,
-	gasConstant: Ee,
-	gravity: Ke,
-	klitzing: Jr,
+	fermiCoupling: vi,
+	gasConstant: Ce,
+	gravity: Ue,
+	klitzing: Gr,
 	loschmidt: F,
-	magneticConstant: jt,
-	molarMass: Ve,
-	molarPlanckConstant: Pn,
-	neutronMass: Da,
-	nuclearMagneton: qi,
-	permutations: Qr,
-	planckConstant: no,
+	magneticConstant: At,
+	molarMass: Re,
+	molarPlanckConstant: Nn,
+	neutronMass: Ta,
+	nuclearMagneton: Gi,
+	permutations: Jr,
+	planckConstant: eo,
 	planckMass: w,
-	planckTime: rn,
+	planckTime: tn,
 	protonMass: l,
-	quantumOfCirculation: ft,
-	reducedPlanckConstant: Ht,
+	quantumOfCirculation: dt,
+	reducedPlanckConstant: Vt,
 	secondRadiation: n,
-	setSize: ya,
-	speedOfLight: lr,
+	setSize: _a,
+	speedOfLight: sr,
 	stefanBoltzmann: j,
-	thomsonCrossSection: Vt,
-	avogadro: za,
-	bohrRadius: oo,
-	coulombConstant: Je,
-	divide: vr,
-	elementaryCharge: lo,
-	faraday: xt,
+	thomsonCrossSection: Bt,
+	avogadro: La,
+	bohrRadius: ao,
+	coulombConstant: Ke,
+	divide: hr,
+	elementaryCharge: co,
+	faraday: bt,
 	freqz: v,
-	gravitationConstant: ye,
-	inverseConductanceQuantum: ci,
-	lusolve: gi,
-	magneticFluxQuantum: pe,
-	molarMassC12: Vn,
-	multinomial: Rt,
-	planckCharge: ur,
-	planckTemperature: Ja,
-	quantileSeq: it,
-	rydberg: Re,
-	setIntersect: fa,
-	solveODE: Xn,
-	stirlingS2: yt,
-	unit: Le,
-	bellNumbers: kr,
-	electricConstant: Qn,
-	firstRadiation: pt,
-	hartreeEnergy: ca,
-	kldivergence: ti,
-	mean: hn,
-	molarVolume: Jn,
-	planckLength: Yt,
-	setUnion: Ei,
-	variance: Pt,
-	classicalElectronRadius: I,
+	gravitationConstant: _e,
+	inverseConductanceQuantum: ii,
+	lusolve: fi,
+	magneticFluxQuantum: fe,
+	molarMassC12: zn,
+	multinomial: Lt,
+	planckCharge: cr,
+	planckTemperature: Ka,
+	quantileSeq: rt,
+	rydberg: Fe,
+	setIntersect: ua,
+	solveODE: Jn,
+	stirlingS2: vt,
+	unit: Pe,
+	bellNumbers: Er,
+	electricConstant: Xn,
+	firstRadiation: ft,
+	hartreeEnergy: oa,
+	kldivergence: Zr,
+	mean: pn,
+	molarVolume: Kn,
+	planckLength: qt,
+	setUnion: Ci,
+	variance: Nt,
+	classicalElectronRadius: ee,
 	corr: x,
-	median: On,
+	median: En,
 	parse: pl,
-	polynomialRoot: L,
+	polynomialRoot: ne,
 	resolve: ml,
 	simplifyConstant: hl,
-	std: ne,
-	zeta: ar,
+	std: L,
+	zeta: ir,
 	compile: gl,
 	evaluate: _l,
-	mad: ht,
+	mad: mt,
 	simplifyCore: bl,
 	help: xl,
-	norm: Bi,
-	rotationMatrix: ve,
+	norm: Ri,
+	rotationMatrix: ge,
 	simplify: Sl,
 	symbolicEqual: tc({
 		OperatorNode: Xc,
 		parse: pl,
 		simplify: Sl,
-		typed: H
+		typed: U
 	}),
 	derivative: rc({
 		ConstantNode: sl,
@@ -9912,25 +9912,25 @@ Mt(Kc, {
 		OperatorNode: Xc,
 		ParenthesisNode: Zc,
 		SymbolNode: dl,
-		config: la,
-		equal: dr,
-		isZero: Li,
-		numeric: Pa,
+		config: We,
+		equal: lr,
+		isZero: Pi,
+		numeric: Ma,
 		parse: pl,
 		simplify: Sl,
-		typed: H
+		typed: U
 	}),
 	parser: Ss({
 		Parser: yl,
-		typed: H
+		typed: U
 	}),
-	rotate: Tn,
+	rotate: Cn,
 	leafCount: Us({
 		parse: pl,
-		typed: H
+		typed: U
 	}),
 	rationalize: ac({
-		bignumber: Ri,
+		bignumber: Ii,
 		fraction: _o,
 		AccessorNode: ll,
 		ArrayNode: $c,
@@ -9941,199 +9941,199 @@ Mt(Kc, {
 		OperatorNode: Xc,
 		ParenthesisNode: Zc,
 		SymbolNode: dl,
-		add: B,
-		config: la,
-		divide: vr,
-		equal: dr,
-		isZero: Li,
+		add: V,
+		config: We,
+		divide: hr,
+		equal: lr,
+		isZero: Pi,
 		mathWithTransform: qc,
-		matrix: V,
+		matrix: H,
 		multiply: a,
 		parse: pl,
 		pow: M,
 		simplify: Sl,
 		simplifyConstant: hl,
 		simplifyCore: bl,
-		subtract: fi,
-		typed: H
+		subtract: ci,
+		typed: U
 	}),
-	schur: Mn,
-	sylvester: Dt,
-	lyap: st,
-	config: la
-}), Mt(qc, Kc, {
-	map: vc({ typed: H }),
-	filter: hc({ typed: H }),
-	forEach: gc({ typed: H }),
+	schur: An,
+	sylvester: Et,
+	lyap: ot,
+	config: We
+}), ht(qc, Kc, {
+	map: vc({ typed: U }),
+	filter: hc({ typed: U }),
+	forEach: gc({ typed: U }),
 	mapSlices: lc({
-		isInteger: br,
-		typed: H
+		isInteger: _r,
+		typed: U
 	}),
 	or: Hc({
 		DenseMatrix: S,
-		concat: tt,
-		equalScalar: ro,
-		matrix: V,
-		typed: H
+		concat: et,
+		equalScalar: to,
+		matrix: H,
+		typed: U
 	}),
 	and: Vc({
-		add: B,
-		concat: tt,
-		equalScalar: ro,
-		matrix: V,
-		not: pa,
-		typed: H,
-		zeros: si
+		add: V,
+		concat: et,
+		equalScalar: to,
+		matrix: H,
+		not: da,
+		typed: U,
+		zeros: ri
 	}),
 	cumsum: Ic({
-		add: B,
-		typed: H,
-		unaryPlus: We
+		add: V,
+		typed: U,
+		unaryPlus: Ve
 	}),
 	max: Sc({
-		config: la,
-		isNaN: Ai,
-		larger: Ua,
-		numeric: Pa,
-		typed: H
+		config: We,
+		isNaN: Di,
+		larger: Va,
+		numeric: Ma,
+		typed: U
 	}),
 	nullish: Uc({
-		deepEqual: Oa,
-		flatten: de,
-		matrix: V,
-		size: Qi,
-		typed: H
+		deepEqual: Ea,
+		flatten: ue,
+		matrix: H,
+		size: Zi,
+		typed: U
 	}),
 	print: Bc({
-		add: B,
-		matrix: V,
-		typed: H,
-		zeros: si
+		add: V,
+		matrix: H,
+		typed: U,
+		zeros: ri
 	}),
 	bitAnd: Wc({
-		add: B,
-		concat: tt,
-		equalScalar: ro,
-		matrix: V,
-		not: pa,
-		typed: H,
-		zeros: si
+		add: V,
+		concat: et,
+		equalScalar: to,
+		matrix: H,
+		not: da,
+		typed: U,
+		zeros: ri
 	}),
 	concat: Oc({
-		isInteger: br,
-		matrix: V,
-		typed: H
+		isInteger: _r,
+		matrix: H,
+		typed: U
 	}),
 	diff: Ac({
-		bignumber: Ri,
-		matrix: V,
-		number: Di,
-		subtract: fi,
-		typed: H
+		bignumber: Ii,
+		matrix: H,
+		number: wi,
+		subtract: ci,
+		typed: U
 	}),
 	min: wc({
-		config: la,
-		isNaN: Ai,
-		numeric: Pa,
-		smaller: Zr,
-		typed: H
+		config: We,
+		isNaN: Di,
+		numeric: Ma,
+		smaller: qr,
+		typed: U
 	}),
 	subset: Dc({
-		add: B,
-		matrix: V,
-		typed: H,
-		zeros: si
+		add: V,
+		matrix: H,
+		typed: U,
+		zeros: ri
 	}),
 	bitOr: Gc({
 		DenseMatrix: S,
-		concat: tt,
-		equalScalar: ro,
-		matrix: V,
-		typed: H
+		concat: et,
+		equalScalar: to,
+		matrix: H,
+		typed: U
 	}),
 	sum: Nc({
-		add: B,
-		config: la,
-		numeric: Pa,
-		typed: H
+		add: V,
+		config: We,
+		numeric: Ma,
+		typed: U
 	}),
 	index: _c({
 		Index: A,
-		getMatrixDataType: En
+		getMatrixDataType: wn
 	}),
 	row: Ec({
 		Index: A,
-		matrix: V,
-		range: Me,
-		typed: H
+		matrix: H,
+		range: ke,
+		typed: U
 	}),
 	column: uc({
 		Index: A,
-		matrix: V,
-		range: Me,
-		typed: H
+		matrix: H,
+		range: ke,
+		typed: U
 	}),
 	mean: Cc({
-		add: B,
-		divide: vr,
-		typed: H
+		add: V,
+		divide: hr,
+		typed: U
 	}),
 	range: Tc({
-		bignumber: Ri,
-		matrix: V,
-		add: B,
-		config: la,
-		equal: dr,
-		isPositive: Vr,
-		isZero: Li,
-		larger: Ua,
+		bignumber: Ii,
+		matrix: H,
+		add: V,
+		config: We,
+		equal: lr,
+		isPositive: Rr,
+		isZero: Pi,
+		larger: Va,
 		largerEq: uo,
-		smaller: Zr,
-		smallerEq: Wr,
-		typed: H
+		smaller: qr,
+		smallerEq: Vr,
+		typed: U
 	}),
 	variance: Rc({
-		add: B,
-		divide: vr,
-		isNaN: Ai,
-		mapSlices: et,
+		add: V,
+		divide: hr,
+		isNaN: Di,
+		mapSlices: Qe,
 		multiply: a,
-		subtract: fi,
-		typed: H
+		subtract: ci,
+		typed: U
 	}),
 	quantileSeq: Pc({
-		add: B,
-		bignumber: Ri,
-		compare: lt,
-		divide: vr,
-		isInteger: br,
-		larger: Ua,
-		mapSlices: et,
+		add: V,
+		bignumber: Ii,
+		compare: ct,
+		divide: hr,
+		isInteger: _r,
+		larger: Va,
+		mapSlices: Qe,
 		multiply: a,
-		partitionSelect: Pi,
-		smaller: Zr,
-		smallerEq: Wr,
-		subtract: fi,
-		typed: H
+		partitionSelect: ji,
+		smaller: qr,
+		smallerEq: Vr,
+		subtract: ci,
+		typed: U
 	}),
 	std: jc({
-		map: Fe,
-		sqrt: Jt,
-		typed: H,
-		variance: Pt
+		map: Me,
+		sqrt: Kt,
+		typed: U,
+		variance: Nt
 	})
-}), Mt(Jc, {
-	BigNumber: eo,
-	Complex: qt,
-	Fraction: tn,
-	Matrix: nt,
+}), ht(Jc, {
+	BigNumber: Qa,
+	Complex: Gt,
+	Fraction: $t,
+	Matrix: tt,
 	Node: $,
 	ObjectNode: Yc,
 	OperatorNode: Xc,
 	ParenthesisNode: Zc,
-	Range: ut,
+	Range: lt,
 	RelationalNode: Qc,
-	ResultSet: Et,
+	ResultSet: Tt,
 	ArrayNode: $c,
 	BlockNode: el,
 	ConditionalNode: tl,
@@ -10141,13 +10141,13 @@ Mt(Kc, {
 	RangeNode: nl,
 	Chain: il,
 	FunctionAssignmentNode: al,
-	SparseMatrix: Bt,
+	SparseMatrix: zt,
 	ConstantNode: sl,
 	IndexNode: cl,
-	FibonacciHeap: Ka,
+	FibonacciHeap: Wa,
 	ImmutableDenseMatrix: te,
 	Index: A,
-	Spa: Ye,
+	Spa: qe,
 	AccessorNode: ll,
 	AssignmentNode: ul,
 	Unit: mo,
@@ -10159,4 +10159,4 @@ Mt(Kc, {
 //#endregion
 export { _l as t };
 
-//# sourceMappingURL=impureFunctionsAny.generated-Bqfato71.js.map
+//# sourceMappingURL=impureFunctionsAny.generated-oSB8bQ6J.js.map