@sheetxl/formulas 0.8.0-beta.22 → 0.8.0-beta.23

package/node/esm/index.mjs

@@ -1,10 +1,10 @@
 /**
-* @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.22
+* @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: MIT
 */
-import { C as t, D as n, E as e, O as r, S as o, T as u, _ as i, a as l, b as a, c as s, d as c, f, g as h, h as g, i as m, k as N, l as I, m as M, n as p, o as A, p as w, r as d, s as E, t as B, u as C, v as S, w as R, x as b, y as v } from "./C9L7LxTSt6UkMRQJ.mjs";
+import { C as t, D as n, E as e, O as r, S as o, T as u, _ as i, a as l, b as a, c as s, d as c, f, g as h, h as g, i as m, k as N, l as I, m as p, n as M, o as A, p as w, r as d, s as E, t as B, u as C, v as S, w as R, x as b, y as v } from "./BBsG5_MNOOBzpkm3.mjs";
 import { FormulaContext as y, FormulaError as T, IRange as V, Scalar as x, ScalarType as D, ValueKind as O, WildCard as F } from "@sheetxl/primitives";
 import P from "bessel";
 import { bahttext as L } from "bahttext";
@@ -209,13 +209,13 @@ function mt(t, n) {
 	return It(Nt(t)) - It(Nt(n));
 }
 function Nt(t) {
-	return null === t ? 0 : "boolean" == typeof t ? t ? 1 : 0 : Mt(t);
+	return null === t ? 0 : "boolean" == typeof t ? t ? 1 : 0 : pt(t);
 }
 function It(t) {
 	if (!(t >= 0) || Math.floor(t) > y.getSerialDate(9999, 12, 31)) throw T.BuiltIn.Num;
 	return Math.floor(t);
 }
-function Mt(t) {
+function pt(t) {
 	if (null === t) return 0;
 	if ("string" == typeof t) try {
 		return y.parseAsNumber(t);
@@ -224,7 +224,7 @@ function Mt(t) {
 	}
 	return y.parseAsSerialDate(t);
 }
-function pt(t) {
+function Mt(t) {
 	return null === t ? 0 : y.parseAsNumber(t);
 }
 function At(t, n) {
@@ -232,11 +232,11 @@ function At(t, n) {
 	return n(t);
 }
 function wt(t, n) {
-	const e = It(At(t, Mt)), { year: r, month: o, day: u } = y.getDateParts(e), { year: i, month: l } = Rt(r, o, Bt(n));
+	const e = It(At(t, pt)), { year: r, month: o, day: u } = y.getDateParts(e), { year: i, month: l } = Rt(r, o, Bt(n));
 	return Et(i, l, y.getSerialDate(i, l, Math.min(u, St(i, l))));
 }
 function dt(t, n) {
-	const e = It(At(t, Mt)), { year: r, month: o } = y.getDateParts(e), { year: u, month: i } = Rt(r, o, Bt(n));
+	const e = It(At(t, pt)), { year: r, month: o } = y.getDateParts(e), { year: u, month: i } = Rt(r, o, Bt(n));
 	return Et(u, i, y.getSerialDate(u, i, St(u, i)));
 }
 function Et(t, n, e) {
@@ -245,7 +245,7 @@ function Et(t, n, e) {
 	return e;
 }
 function Bt(t) {
-	return Math.trunc(At(t, pt));
+	return Math.trunc(At(t, Mt));
 }
 var Ct = [
 	31,
@@ -303,7 +303,7 @@ function xt(t) {
 }
 function Dt(t, n, e = 1, r) {
 	const o = xt(e);
-	let u = It(At(t, Mt)), i = It(At(n, Mt)), l = 1;
+	let u = It(At(t, pt)), i = It(At(n, pt)), l = 1;
 	if (u > i) {
 		l = -1;
 		const t = u;
@@ -335,7 +335,7 @@ function _t() {
 	return y.formatResults("Short Date"), Math.floor(y.getNow());
 }
 function Ut(t, n = 1) {
-	const e = Yt[Math.trunc(n)];
+	const e = Yt[Zt(n)];
 	if (!e) throw T.BuiltIn.Num;
 	return e[y.getDateParts(t).dow % 7];
 }
@@ -350,7 +350,7 @@ function Xt(t, n = 1) {
 	}
 	else e = y.parseAsSerialDate(t);
 	e = It(e);
-	const r = null === n ? 0 : Math.trunc(y.parseAsNumber(n));
+	const r = null === n ? 0 : Zt(y.parseAsNumber(n));
 	if (21 === r) return vt(e);
 	const o = jt[r];
 	if (void 0 === o) throw T.BuiltIn.Num;
@@ -361,10 +361,11 @@ function kt(t, n, e) {
 	return Ht(t, n, 1, e);
 }
 function Ht(t, n, e = 1, r) {
-	const o = It(At(t, Mt)), u = Math.floor(At(n, pt));
+	const o = It(At(t, pt)), u = Math.floor(At(n, Mt));
+	if (0 === u) return o;
 	if (T.isError(e)) throw T.BuiltIn.Num;
 	const i = xt(e);
-	if (7 === i.length && 0 !== u) throw T.BuiltIn.Value;
+	if (7 === i.length) throw T.BuiltIn.Value;
 	const l = zt(r), a = Kt(), s = y.getSerialDate(9999, 12, 31), c = u < 0 ? -1 : 1;
 	let f = Math.abs(u), h = o;
 	for (; f > 0;) {
@@ -524,38 +525,42 @@ function zt(t) {
 	const n = /* @__PURE__ */ new Set();
 	for (let e = 0; e < (t?.length ?? 0); e++) {
 		const r = t[e];
-		null != r && n.add(It(Mt(r)));
+		null != r && n.add(It(pt(r)));
 	}
 	return n;
 }
 function Wt(t) {
 	return Math.floor(t + Qt);
 }
-var Qt = 1 / 4194304, Zt = U({
-	BESSELI: () => en,
-	BESSELJ: () => rn,
-	BESSELK: () => on,
-	BESSELY: () => un
-}), Jt = 2 ** 27 + 1, tn = (t) => {
+var Qt = 1 / 4194304;
+function Zt(t) {
+	return t >= 0 ? Math.floor(t + Qt) : Math.trunc(t);
+}
+var Jt = U({
+	BESSELI: () => rn,
+	BESSELJ: () => on,
+	BESSELK: () => un,
+	BESSELY: () => ln
+}), tn = 2 ** 27 + 1, nn = (t) => {
 	if (T.isError(t)) throw t;
 	if (void 0 === t) throw T.BuiltIn.NA;
 	return null === t ? 0 : y.parseAsNumber(t);
-}, nn = (t) => {
+}, en = (t) => {
 	const n = Math.trunc(t);
 	return n < 0 || n > 1e7 ? NaN : n;
 };
-function en(t, n) {
-	const e = tn(t), r = nn(tn(n));
+function rn(t, n) {
+	const e = nn(t), r = en(nn(n));
 	if (Number.isNaN(r)) return NaN;
 	const o = P.besseli(Math.abs(e), r);
 	return e < 0 && r % 2 == 1 ? -o : o;
 }
-function rn(t, n) {
-	const e = tn(t), r = nn(tn(n));
-	return Number.isNaN(r) || Math.abs(e) > Jt ? NaN : P.besselj(e, r);
-}
 function on(t, n) {
-	const e = tn(t), r = nn(tn(n));
+	const e = nn(t), r = en(nn(n));
+	return Number.isNaN(r) || Math.abs(e) > tn ? NaN : P.besselj(e, r);
+}
+function un(t, n) {
+	const e = nn(t), r = en(nn(n));
 	if (Number.isNaN(r)) return NaN;
 	if (!(e > 0)) return P.besselk(e, r);
 	let o = X(P.besselk(e, 0));
@@ -568,36 +573,36 @@ function on(t, n) {
 	}
 	return u;
 }
-function un(t, n) {
-	const e = tn(t), r = nn(tn(n));
-	return Number.isNaN(r) || Math.abs(e) > Jt ? NaN : P.bessely(e, r);
-}
-var ln = U({
-	BIN2DEC: () => an,
-	BIN2HEX: () => sn,
-	BIN2OCT: () => cn,
-	BITAND: () => fn,
-	BITLSHIFT: () => hn,
-	BITOR: () => gn,
-	BITRSHIFT: () => mn,
-	BITXOR: () => Nn,
-	DEC2BIN: () => In,
+function ln(t, n) {
+	const e = nn(t), r = en(nn(n));
+	return Number.isNaN(r) || Math.abs(e) > tn ? NaN : P.bessely(e, r);
+}
+var an = U({
+	BIN2DEC: () => sn,
+	BIN2HEX: () => cn,
+	BIN2OCT: () => fn,
+	BITAND: () => hn,
+	BITLSHIFT: () => gn,
+	BITOR: () => mn,
+	BITRSHIFT: () => Nn,
+	BITXOR: () => In,
+	DEC2BIN: () => pn,
 	DEC2HEX: () => Mn,
-	DEC2OCT: () => pn,
-	HEX2BIN: () => An,
-	HEX2DEC: () => wn,
-	HEX2OCT: () => dn,
-	OCT2BIN: () => En,
-	OCT2DEC: () => Bn,
-	OCT2HEX: () => Cn
+	DEC2OCT: () => An,
+	HEX2BIN: () => wn,
+	HEX2DEC: () => dn,
+	HEX2OCT: () => En,
+	OCT2BIN: () => Bn,
+	OCT2DEC: () => Cn,
+	OCT2HEX: () => Sn
 });
-function an(t) {
-	const n = On(t, Sn);
-	return 10 === n.length && "1" === n.substring(0, 1) ? parseInt(n.substring(1), 2) + Vn : parseInt(n, 2);
+function sn(t) {
+	const n = Fn(t, Rn);
+	return 10 === n.length && "1" === n.substring(0, 1) ? parseInt(n.substring(1), 2) + xn : parseInt(n, 2);
 }
-function sn(t, n) {
-	n = xn(n);
-	const e = On(t, Sn);
+function cn(t, n) {
+	n = Dn(n);
+	const e = Fn(t, Rn);
 	if (t = parseInt(e, 2), 10 === e.length && "1" === e.substring(0, 1)) return (parseInt(e.substring(1), 2) + 0xfffffffe00).toString(16).toUpperCase();
 	const r = t.toString(16);
 	if (void 0 === n) return r.toUpperCase();
@@ -605,9 +610,9 @@ function sn(t, n) {
 	if ((n = Math.trunc(n)) >= r.length) return ("0".repeat(n - r.length) + r).toUpperCase();
 	throw T.BuiltIn.Num;
 }
-function cn(t, n) {
-	n = xn(n);
-	const e = On(t, Sn);
+function fn(t, n) {
+	n = Dn(n);
+	const e = Fn(t, Rn);
 	if (t = parseInt(e, 2), 10 === e.length && "1" === e.substring(0, 1)) return (parseInt(e.substring(1), 2) + 1073741312).toString(8);
 	const r = t.toString(8);
 	if (void 0 === n) return r.toUpperCase();
@@ -615,30 +620,30 @@ function cn(t, n) {
 	if ((n = Math.trunc(n)) >= r.length) return "0".repeat(n - r.length) + r;
 	throw T.BuiltIn.Num;
 }
-function fn(t, n) {
-	return t = Pn(t), n = Pn(n), _n(t, n, (t, n) => t & n);
-}
 function hn(t, n) {
-	t = Pn(t);
-	const e = Ln(n);
+	return t = Ln(t), n = Ln(n), Un(t, n, (t, n) => t & n);
+}
+function gn(t, n) {
+	t = Ln(t);
+	const e = _n(n);
 	if (0 === t) return 0;
 	if (Math.abs(e) > 53) return NaN;
 	if (e < 0) return Math.trunc(t / 2 ** -e);
 	if (e > 48) return 0;
 	const r = BigInt(t) << BigInt(e);
-	return r > BigInt(Fn) ? NaN : Number(r);
-}
-function gn(t, n) {
-	return t = Pn(t), n = Pn(n), _n(t, n, (t, n) => t | n);
+	return r > BigInt(Pn) ? NaN : Number(r);
 }
 function mn(t, n) {
-	return hn(t = Pn(t), -Ln(n));
+	return t = Ln(t), n = Ln(n), Un(t, n, (t, n) => t | n);
 }
 function Nn(t, n) {
-	return t = Pn(t), n = Pn(n), _n(t, n, (t, n) => t ^ n);
+	return gn(t = Ln(t), -_n(n));
 }
 function In(t, n) {
-	if (n = xn(n), (t = Dn(t)) < Vn || t > Tn) throw T.BuiltIn.Num;
+	return t = Ln(t), n = Ln(n), Un(t, n, (t, n) => t ^ n);
+}
+function pn(t, n) {
+	if (n = Dn(n), (t = On(t)) < xn || t > Vn) throw T.BuiltIn.Num;
 	if (t < 0) return "1" + "0".repeat(9 - (512 + t).toString(2).length) + (512 + t).toString(2);
 	const e = parseInt(t, 10).toString(2);
 	if (void 0 === n) return e;
@@ -647,7 +652,7 @@ function In(t, n) {
 	return "0".repeat(n - e.length) + e;
 }
 function Mn(t, n) {
-	if (n = xn(n), (t = Dn(t)) < -549755813888 || t >= 549755813888) throw T.BuiltIn.Num;
+	if (n = Dn(n), (t = On(t)) < -549755813888 || t >= 549755813888) throw T.BuiltIn.Num;
 	if (t < 0) return (1099511627776 + t).toString(16).toUpperCase();
 	const e = parseInt(t, 10).toString(16);
 	if (void 0 === n) return e.toUpperCase();
@@ -655,8 +660,8 @@ function Mn(t, n) {
 	if (n < e.length) throw T.BuiltIn.Num;
 	return "0".repeat(n - e.length) + e.toUpperCase();
 }
-function pn(t, n) {
-	if (n = xn(n), (t = Dn(t)) < -536870912 || t >= 536870912) throw T.BuiltIn.Num;
+function An(t, n) {
+	if (n = Dn(n), (t = On(t)) < -536870912 || t >= 536870912) throw T.BuiltIn.Num;
 	if (t < 0) return (t + 1073741824).toString(8);
 	const e = parseInt(t, 10).toString(8);
 	if (void 0 === n) return e.toUpperCase();
@@ -664,62 +669,62 @@ function pn(t, n) {
 	if (n < e.length) throw T.BuiltIn.Num;
 	return "0".repeat(n - e.length) + e;
 }
-function An(t, n) {
-	n = xn(n);
-	const e = On(t, bn), r = 10 === e.length && "f" === e.substring(0, 1).toLowerCase(), o = r ? parseInt(e, 16) - 1099511627776 : parseInt(e, 16);
-	if (o < Vn || o > Tn) return NaN;
+function wn(t, n) {
+	n = Dn(n);
+	const e = Fn(t, vn), r = 10 === e.length && "f" === e.substring(0, 1).toLowerCase(), o = r ? parseInt(e, 16) - 1099511627776 : parseInt(e, 16);
+	if (o < xn || o > Vn) return NaN;
 	if (r) return "1" + "0".repeat(9 - (o + 512).toString(2).length) + (o + 512).toString(2);
 	const u = o.toString(2);
 	return void 0 === n ? u : (n = Math.trunc(n)) <= 0 || n < u.length ? NaN : "0".repeat(n - u.length) + u;
 }
-function wn(t) {
-	const n = parseInt(On(t, bn), 16);
+function dn(t) {
+	const n = parseInt(Fn(t, vn), 16);
 	return n >= 549755813888 ? n - 1099511627776 : n;
 }
-function dn(t, n) {
-	n = xn(n);
-	const e = wn(On(t, bn));
-	if (e > vn || e < yn) throw T.BuiltIn.Num;
-	return pn(e, n);
-}
 function En(t, n) {
-	n = xn(n);
-	const e = On(t, Rn);
+	n = Dn(n);
+	const e = dn(Fn(t, vn));
+	if (e > yn || e < Tn) throw T.BuiltIn.Num;
+	return An(e, n);
+}
+function Bn(t, n) {
+	n = Dn(n);
+	const e = Fn(t, bn);
 	if (void 0 !== n && n > 10) throw T.BuiltIn.Num;
 	if (void 0 !== n && n < 0) throw T.BuiltIn.Num;
 	n = void 0 === n ? NaN : Math.trunc(n);
-	const r = 10 === e.length && "7" === e.substring(0, 1), o = Bn(e);
-	if (o < Vn || o > Tn) throw T.BuiltIn.Num;
+	const r = 10 === e.length && "7" === e.substring(0, 1), o = Cn(e);
+	if (o < xn || o > Vn) throw T.BuiltIn.Num;
 	if (r) return "1" + "0".repeat(9 - (512 + o).toString(2).length) + (512 + o).toString(2);
 	const u = o.toString(2);
 	if (0 === n) return u;
 	if (n < u.length) throw T.BuiltIn.Num;
 	return "0".repeat(n - u.length) + u;
 }
-function Bn(t) {
-	const n = parseInt(On(t, Rn), 8);
+function Cn(t) {
+	const n = parseInt(Fn(t, bn), 8);
 	return n >= 536870912 ? n - 1073741824 : n;
 }
-function Cn(t, n) {
-	n = xn(n);
-	const e = On(t, Rn);
+function Sn(t, n) {
+	n = Dn(n);
+	const e = Fn(t, bn);
 	if ((n = void 0 === n ? NaN : Math.trunc(n)) < 0 || n > 10) return NaN;
-	const r = Bn(e), o = Mn(r);
+	const r = Cn(e), o = Mn(r);
 	return 0 === n || r < 0 ? o : n < o.length ? NaN : "0".repeat(n - o.length) + o;
 }
-var Sn = /^[01]{1,10}$/, Rn = /^[0-7]{1,10}$/, bn = /^[0-9a-fA-F]{1,10}$/, vn = 536870911, yn = -536870912, Tn = 511, Vn = -512, xn = (t) => {
+var Rn = /^[01]{1,10}$/, bn = /^[0-7]{1,10}$/, vn = /^[0-9a-fA-F]{1,10}$/, yn = 536870911, Tn = -536870912, Vn = 511, xn = -512, Dn = (t) => {
 	if (void 0 === t) return;
 	if ("boolean" == typeof t) throw T.BuiltIn.Value;
 	const n = Math.trunc(null === t ? 0 : y.parseAsNumber(t));
 	if (n < 1 || n > 10) throw T.BuiltIn.Num;
 	return n;
-}, Dn = (t) => {
+}, On = (t) => {
 	if (T.isError(t)) throw t;
 	if (void 0 === t) throw T.BuiltIn.NA;
 	if (null === t) return 0;
 	if ("boolean" == typeof t) throw T.BuiltIn.Value;
 	return Math.trunc(y.parseAsNumber(t));
-}, On = (t, n) => {
+}, Fn = (t, n) => {
 	if (T.isError(t)) throw t;
 	if (void 0 === t) throw T.BuiltIn.NA;
 	if (null === t) return "0";
@@ -729,7 +734,7 @@ var Sn = /^[01]{1,10}$/, Rn = /^[0-7]{1,10}$/, bn = /^[0-9a-fA-F]{1,10}$/, vn =
 	if ("" === e) return "0";
 	if (!n.test(e)) throw T.BuiltIn.Num;
 	return e;
-}, Fn = 0xffffffffffff, Pn = (t) => {
+}, Pn = 0xffffffffffff, Ln = (t) => {
 	if (T.isError(t)) throw t;
 	const n = typeof t;
 	if ("boolean" === n) return t ? 1 : 0;
@@ -740,46 +745,46 @@ var Sn = /^[01]{1,10}$/, Rn = /^[0-7]{1,10}$/, bn = /^[0-9a-fA-F]{1,10}$/, vn =
 		if ("string" !== n) throw T.BuiltIn.Value;
 		e = y.parseAsNumber(t);
 	}
-	if (e < 0 || e > Fn || Math.floor(e) !== e) throw T.BuiltIn.Num;
+	if (e < 0 || e > Pn || Math.floor(e) !== e) throw T.BuiltIn.Num;
 	return e;
-}, Ln = (t) => {
+}, _n = (t) => {
 	if (T.isError(t)) throw t;
 	return null == t ? 0 : "boolean" == typeof t ? t ? 1 : 0 : Math.trunc(y.parseAsNumber(t));
-}, _n = (t, n, e) => Number(e(BigInt(t), BigInt(n))), Un = U({ CONVERT: () => Xn });
-function Xn(t, n, e) {
-	t = null == t ? 0 : y.parseAsNumber(t), n = kn(n), e = kn(e);
-	const r = zn(n), o = zn(e);
+}, Un = (t, n, e) => Number(e(BigInt(t), BigInt(n))), Xn = U({ CONVERT: () => kn });
+function kn(t, n, e) {
+	t = null == t ? 0 : y.parseAsNumber(t), n = Hn(n), e = Hn(e);
+	const r = Wn(n), o = Wn(e);
 	if (null === r || null === o || r.unit[3] !== o.unit[3]) throw T.BuiltIn.NA;
 	return "temperature" === r.unit[3] ? function(t, n, e) {
 		if (n === e) return t;
-		const r = jn[`${n}>${e}`];
-		return r ? r(t) : Gn[e](Hn[n](t));
+		const r = Yn[`${n}>${e}`];
+		return r ? r(t) : jn[e](Gn[n](t));
 	}(t * r.multiplier, r.unit[1], o.unit[1]) / o.multiplier : t * (r.unit[5] / o.unit[5]) * (r.multiplier / o.multiplier);
 }
-function kn(t) {
+function Hn(t) {
 	if (T.isError(t)) throw t;
 	if ("boolean" == typeof t) throw T.BuiltIn.Value;
 	return null == t ? "" : String(t);
 }
-var Hn = {
+var Gn = {
 	C: (t) => t,
 	F: (t) => (t - 32) / 1.8,
 	K: (t) => t - 273.15,
 	Rank: (t) => t / 1.8 - 273.15,
 	Reau: (t) => t / .8
-}, Gn = {
+}, jn = {
 	C: (t) => t,
 	F: (t) => 1.8 * t + 32,
 	K: (t) => t + 273.15,
 	Rank: (t) => 1.8 * (t + 273.15),
 	Reau: (t) => .8 * t
-}, jn = {
+}, Yn = {
 	"F>Rank": (t) => t + 459.67,
 	"Rank>F": (t) => t - 459.67,
 	"K>Rank": (t) => 1.8 * t,
 	"Rank>K": (t) => t / 1.8,
 	"F>Reau": (t) => .8 * (t - 32) / 1.8
-}, Yn = [
+}, qn = [
 	[
 		"a.u. of energy",
 		"Eh",
@@ -1856,14 +1861,14 @@ var Hn = {
 		"none",
 		1
 	]
-], qn = (() => {
+], $n = (() => {
 	const t = /* @__PURE__ */ new Map();
-	for (const n of Yn) {
+	for (const n of qn) {
 		t.set(n[1], n);
 		for (const e of n[2] ?? []) t.set(e, n);
 	}
 	return t;
-})(), $n = {
+})(), Kn = {
 	Y: 24,
 	Z: 21,
 	E: 18,
@@ -1885,7 +1890,7 @@ var Hn = {
 	a: -18,
 	z: -21,
 	y: -24
-}, Kn = {
+}, zn = {
 	Yi: 80,
 	Zi: 70,
 	Ei: 60,
@@ -1895,24 +1900,24 @@ var Hn = {
 	Mi: 20,
 	ki: 10
 };
-function zn(t) {
-	const n = qn.get(t);
+function Wn(t) {
+	const n = $n.get(t);
 	if (n) return {
 		unit: n,
 		multiplier: 1
 	};
-	const e = Kn[t.slice(0, 2)];
+	const e = zn[t.slice(0, 2)];
 	if (void 0 !== e) {
-		const n = qn.get(t.slice(2));
+		const n = $n.get(t.slice(2));
 		if ("si+binary" === n?.[4]) return {
 			unit: n,
 			multiplier: 2 ** e
 		};
 	}
 	for (const n of [t.slice(0, 2), t.slice(0, 1)]) {
-		const e = $n[n];
+		const e = Kn[n];
 		if (void 0 === e) continue;
-		const r = qn.get(t.slice(n.length));
+		const r = $n.get(t.slice(n.length));
 		if (r && "none" !== r[4]) return {
 			unit: r,
 			multiplier: Number("1e" + e * (r[6] ?? 1))
@@ -1920,21 +1925,21 @@ function zn(t) {
 	}
 	return null;
 }
-var Wn = U({
-	DELTA: () => Qn,
-	GESTEP: () => Zn
+var Qn = U({
+	DELTA: () => Zn,
+	GESTEP: () => Jn
 });
-function Qn(t, n = 0) {
-	return n = Jn(n), (t = Jn(t)) === n ? 1 : 0;
-}
 function Zn(t, n = 0) {
-	return n = Jn(n), (t = Jn(t)) >= n ? 1 : 0;
+	return n = te(n), (t = te(t)) === n ? 1 : 0;
 }
-function Jn(t) {
+function Jn(t, n = 0) {
+	return n = te(n), (t = te(t)) >= n ? 1 : 0;
+}
+function te(t) {
 	if (void 0 === t) throw T.BuiltIn.NA;
 	return null === t ? 0 : y.parseAsNumber(t);
 }
-var te = [
+var ne = [
 	57.15623566586292,
 	-59.59796035547549,
 	14.136097974741746,
@@ -1950,14 +1955,14 @@ var te = [
 	-26190838401581408e-21,
 	36899182659531625e-22
 ];
-function ne(t) {
+function ee(t) {
 	let n = t, e = t + 5.2421875;
 	e = (t + .5) * Math.log(e) - e;
 	let r = .9999999999999971;
-	for (let t = 0; t < 14; t++) r += te[t] / ++n;
+	for (let t = 0; t < 14; t++) r += ne[t] / ++n;
 	return e + Math.log(2.5066282746310007 * r / t);
 }
-function ee(t) {
+function re(t) {
 	const n = [
 		-1.716185138865495,
 		24.76565080557592,
@@ -1990,10 +1995,10 @@ function ee(t) {
 	else if (c > s) for (let t = 0; t < i; ++t) o *= s, s++;
 	return u && (o = u / o), o;
 }
-function re(t, n) {
-	if (!(t <= 0 || n <= 0)) return t + n > 170 ? Math.exp(ie(t, n)) : ee(t) * ee(n) / ee(t + n);
+function oe(t, n) {
+	if (!(t <= 0 || n <= 0)) return t + n > 170 ? Math.exp(le(t, n)) : re(t) * re(n) / re(t + n);
 }
-var oe = [
+var ue = [
 	1 / 12,
 	-1 / 360,
 	1 / 1260,
@@ -2002,18 +2007,18 @@ var oe = [
 	-691 / 360360,
 	1 / 156
 ];
-function ue(t) {
+function ie(t) {
 	const n = 1 / (t * t);
 	let e = 0;
-	for (let t = oe.length - 1; t >= 0; t--) e = (e + oe[t]) * n;
+	for (let t = ue.length - 1; t >= 0; t--) e = (e + ue[t]) * n;
 	return e * t;
 }
-var ie = (t, n) => {
+var le = (t, n) => {
 	const e = t < n ? t : n, r = t < n ? n : t;
-	return r < 30 ? ne(t) + ne(n) - ne(t + n) : ne(e) - function(t, n) {
-		return n * Math.log(t) + (t + n - .5) * Math.log1p(n / t) - n + ue(t + n) - ue(t);
+	return r < 30 ? ee(t) + ee(n) - ee(t + n) : ee(e) - function(t, n) {
+		return n * Math.log(t) + (t + n - .5) * Math.log1p(n / t) - n + ie(t + n) - ie(t);
 	}(r, e);
-}, le = [
+}, ae = [
 	-1.3026537197817094,
 	.6419697923564902,
 	.019476473204185836,
@@ -2043,29 +2048,29 @@ var ie = (t, n) => {
 	121e-18,
 	-28e-18
 ];
-function ae(t) {
+function se(t) {
 	let n = 0, e = 0;
 	const r = 2 / (2 + t), o = 4 * r - 2;
-	for (let t = le.length - 1; t > 0; t--) {
+	for (let t = ae.length - 1; t > 0; t--) {
 		const r = n;
-		n = o * n - e + le[t], e = r;
+		n = o * n - e + ae[t], e = r;
 	}
-	return r * Math.exp(-t * t + .5 * (le[0] + o * n) - e);
+	return r * Math.exp(-t * t + .5 * (ae[0] + o * n) - e);
 }
-var se = (t) => t >= 0 ? 1 - ae(t) : ae(-t) - 1, ce = (t) => t >= 0 ? ae(t) : 2 - ae(-t);
-function fe(t) {
+var ce = (t) => t >= 0 ? 1 - se(t) : se(-t) - 1, fe = (t) => t >= 0 ? se(t) : 2 - se(-t);
+function he(t) {
 	if (t >= 2) return -100;
 	if (t <= 0) return 100;
 	const n = t < 1 ? t : 2 - t, e = Math.sqrt(-2 * Math.log(n / 2));
 	let r = -.70711 * ((2.30753 + .27061 * e) / (1 + e * (.99229 + .04481 * e)) - e);
 	for (let t = 0; t < 2; t++) {
-		const t = ce(r) - n;
+		const t = fe(r) - n;
 		r += t / (1.1283791670955126 * Math.exp(-r * r) - r * t);
 	}
 	return t < 1 ? r : -r;
 }
-var he = (t, n) => Ne(t, n, !1), ge = 1e8;
-function me(t) {
+var ge = (t, n) => Ie(t, n, !1), me = 1e8;
+function Ne(t) {
 	if (Math.abs(t) < .03) {
 		let n = 0;
 		for (let e = 14; e >= 0; e--) n = n * t + 2 * (e % 2 == 0 ? -1 : 1) / (e + 3);
@@ -2073,16 +2078,16 @@ function me(t) {
 	}
 	return (2 * (t - Math.log1p(t)) / (t * t) - 1) / t;
 }
-function Ne(t, n, e) {
+function Ie(t, n, e) {
 	if (n < 0 || t <= 0) return NaN;
-	if (t >= ge) {
+	if (t >= me) {
 		const r = function(t, n) {
-			const e = n / t - 1, r = me(e), o = r * e, u = Math.sqrt(1 + o), i = t * e * e * (1 + o) / 2;
-			return .5 * ce(Math.sign(e) * Math.sqrt(i)) + Math.exp(-i) / Math.sqrt(2 * Math.PI * t) * (r / (u * (u + 1)));
+			const e = n / t - 1, r = Ne(e), o = r * e, u = Math.sqrt(1 + o), i = t * e * e * (1 + o) / 2;
+			return .5 * fe(Math.sign(e) * Math.sqrt(i)) + Math.exp(-i) / Math.sqrt(2 * Math.PI * t) * (r / (u * (u + 1)));
 		}(t, n);
 		return e ? r : 1 - r;
 	}
-	const r = ne(t), o = -~(8.5 * Math.log(t >= 1 ? t : 1 / t) + .4 * t + 17);
+	const r = ee(t), o = -~(8.5 * Math.log(t >= 1 ? t : 1 / t) + .4 * t + 17);
 	if (n < t + 1) {
 		let u = t, i = 1 / t, l = i;
 		for (let t = 1; t <= o; t++) {
@@ -2100,8 +2105,8 @@ function Ne(t, n, e) {
 	const s = a * Math.exp(-n + t * Math.log(n) - r);
 	return e ? s : 1 - s;
 }
-function Ie(t, n) {
-	const e = 4 * Number.EPSILON, r = n - 1, o = ne(n);
+function pe(t, n) {
+	const e = 4 * Number.EPSILON, r = n - 1, o = ee(n);
 	let u, i = 0, l = 0;
 	if (t >= 1) return 1 / 0;
 	if (t <= 0) return 0;
@@ -2115,7 +2120,7 @@ function Ie(t, n) {
 	}
 	for (let a = 0; a < 100; a++) {
 		if (u <= 0) return 0;
-		const a = he(n, u) - t;
+		const a = ge(n, u) - t;
 		let s;
 		s = n > 1 ? l * Math.exp(-(u - r) + r * (Math.log(u) - i)) : Math.exp(-u + r * Math.log(u) - o);
 		const c = a / s;
@@ -2137,17 +2142,17 @@ function Me(t, n, e) {
 	}
 	return s;
 }
-var pe = (t, n, e) => Ae(t, 1 - t, n, e);
-function Ae(t, n, e, r) {
-	return t < 0 || t > 1 ? NaN : t < (e + 1) / (e + r + 2) ? we(t, n, e, r) * Me(t, e, r) / e : 1 - we(n, t, r, e) * Me(n, r, e) / r;
-}
+var Ae = (t, n, e) => we(t, 1 - t, n, e);
 function we(t, n, e, r) {
+	return t < 0 || t > 1 ? NaN : t < (e + 1) / (e + r + 2) ? de(t, n, e, r) * Me(t, e, r) / e : 1 - de(n, t, r, e) * Me(n, r, e) / r;
+}
+function de(t, n, e, r) {
 	if (0 === t || 1 === t) return 0;
 	const o = t < .5 ? Math.log1p(-t) : Math.log(n);
-	return Math.exp(e * Math.log(t) + r * o - ie(e, r));
+	return Math.exp(e * Math.log(t) + r * o - le(e, r));
 }
-function de(t, n, e) {
-	if (!Number.isFinite(ne(n)) || !Number.isFinite(ne(e))) return NaN;
+function Ee(t, n, e) {
+	if (!Number.isFinite(ee(n)) || !Number.isFinite(ee(e))) return NaN;
 	const r = 4 * Number.EPSILON, o = n - 1, u = e - 1;
 	let i, l;
 	if (t <= 0) return 0;
@@ -2163,152 +2168,152 @@ function de(t, n, e) {
 		const u = l + Math.exp(e * o) / e;
 		i = t < l / u ? Math.pow(n * u * t, 1 / n) : 1 - Math.pow(e * u * (1 - t), 1 / e);
 	}
-	const a = -ie(n, e);
+	const a = -le(n, e);
 	for (let s = 0; s < 100; s++) {
 		if (0 === i || 1 === i) return i;
-		const c = pe(i, n, e) - t;
+		const c = Ae(i, n, e) - t;
 		l = Math.exp(o * Math.log(i) + u * Math.log1p(-i) + a);
 		const f = c / l;
 		if (i -= l = f / (1 - .5 * Math.min(1, f * (o / i - u / (1 - i)))), i <= 0 && (i = .5 * (i + l)), i >= 1 && (i = .5 * (i + l + 1)), Math.abs(l) < r * i && s > 0) break;
 	}
 	return i;
 }
-var Ee = U({
-	ERF: () => Ce,
-	ERFC: () => Re,
-	ERFC_PRECISE: () => be,
-	ERF_PRECISE: () => Se
-}), Be = (t) => {
+var Be = U({
+	ERF: () => Se,
+	ERFC: () => be,
+	ERFC_PRECISE: () => ve,
+	ERF_PRECISE: () => Re
+}), Ce = (t) => {
 	if (T.isError(t)) throw t;
 	return null === t ? 0 : y.parseAsNumber(t);
 };
-function Ce(t, n) {
-	if (void 0 === t) throw T.BuiltIn.NA;
-	const e = Be(t);
-	return void 0 === n ? se(e) : se(Be(n)) - se(e);
-}
-function Se(t) {
+function Se(t, n) {
 	if (void 0 === t) throw T.BuiltIn.NA;
-	return se(Be(t));
+	const e = Ce(t);
+	return void 0 === n ? ce(e) : ce(Ce(n)) - ce(e);
 }
 function Re(t) {
 	if (void 0 === t) throw T.BuiltIn.NA;
-	return ce(Be(t));
+	return ce(Ce(t));
 }
 function be(t) {
 	if (void 0 === t) throw T.BuiltIn.NA;
-	return ce(Be(t));
+	return fe(Ce(t));
+}
+function ve(t) {
+	if (void 0 === t) throw T.BuiltIn.NA;
+	return fe(Ce(t));
 }
-var ve = Math.PI, ye = 2 ** 27, Te = 134217729, Ve = (t, n) => {
+var ye = Math.PI, Te = 2 ** 27, Ve = 134217729, xe = (t, n) => {
 	const e = t + n, r = e - t;
 	return [e, t - (e - r) + (n - r)];
-}, xe = (t) => {
-	const n = ve / 2, e = Math.round(t / n), [r, o] = ((t, n) => {
-		const e = t * n, r = Te * t, o = r - (r - t), u = t - o, i = Te * n, l = i - (i - n), a = n - l;
+}, De = (t) => {
+	const n = ye / 2, e = Math.round(t / n), [r, o] = ((t, n) => {
+		const e = t * n, r = Ve * t, o = r - (r - t), u = t - o, i = Ve * n, l = i - (i - n), a = n - l;
 		return [e, o * l - e + o * a + u * l + u * a];
-	})(e, n), [u, i] = Ve(t, -r), [l, a] = Ve(u, i - o - 61257422745431e-30 * e);
+	})(e, n), [u, i] = xe(t, -r), [l, a] = xe(u, i - o - 61257422745431e-30 * e);
 	return [
 		(e % 4 + 4) % 4,
 		l,
 		a
 	];
-}, De = (t, n) => Math.sin(t) + Math.cos(t) * n, Oe = (t, n) => Math.cos(t) - Math.sin(t) * n;
-function Fe(t) {
-	const [n, e, r] = xe(t);
-	switch (n) {
-		case 0: return De(e, r);
-		case 1: return Oe(e, r);
-		case 2: return -De(e, r);
-		default: return -Oe(e, r);
-	}
-}
+}, Oe = (t, n) => Math.sin(t) + Math.cos(t) * n, Fe = (t, n) => Math.cos(t) - Math.sin(t) * n;
 function Pe(t) {
-	const [n, e, r] = xe(t);
+	const [n, e, r] = De(t);
 	switch (n) {
 		case 0: return Oe(e, r);
-		case 1: return -De(e, r);
+		case 1: return Fe(e, r);
 		case 2: return -Oe(e, r);
-		default: return De(e, r);
-	}
-}
-var Le = (t) => Fe(t) / Pe(t), _e = U({
-	COMPLEX: () => Ue,
-	IMABS: () => Xe,
-	IMAGINARY: () => ke,
-	IMARGUMENT: () => He,
-	IMCONJUGATE: () => Ye,
-	IMCOS: () => ir,
-	IMCOSH: () => lr,
-	IMCOT: () => ar,
-	IMCOTH: () => sr,
-	IMCSC: () => cr,
-	IMCSCH: () => fr,
-	IMDIV: () => hr,
-	IMEXP: () => gr,
-	IMLN: () => mr,
-	IMLOG: () => Nr,
-	IMLOG10: () => Ir,
+		default: return -Fe(e, r);
+	}
+}
+function Le(t) {
+	const [n, e, r] = De(t);
+	switch (n) {
+		case 0: return Fe(e, r);
+		case 1: return -Oe(e, r);
+		case 2: return -Fe(e, r);
+		default: return Oe(e, r);
+	}
+}
+var _e = (t) => Pe(t) / Le(t), Ue = U({
+	COMPLEX: () => Xe,
+	IMABS: () => ke,
+	IMAGINARY: () => He,
+	IMARGUMENT: () => Ge,
+	IMCONJUGATE: () => qe,
+	IMCOS: () => lr,
+	IMCOSH: () => ar,
+	IMCOT: () => sr,
+	IMCOTH: () => cr,
+	IMCSC: () => fr,
+	IMCSCH: () => hr,
+	IMDIV: () => gr,
+	IMEXP: () => mr,
+	IMLN: () => Nr,
+	IMLOG: () => Ir,
+	IMLOG10: () => pr,
 	IMLOG2: () => Mr,
-	IMPOWER: () => pr,
-	IMPRODUCT: () => Ar,
-	IMREAL: () => wr,
-	IMSEC: () => dr,
-	IMSECH: () => Er,
-	IMSIN: () => Br,
-	IMSINH: () => Cr,
-	IMSQRT: () => Sr,
-	IMSUB: () => Rr,
-	IMSUM: () => br,
-	IMTAN: () => vr,
-	IMTANH: () => yr
+	IMPOWER: () => Ar,
+	IMPRODUCT: () => wr,
+	IMREAL: () => dr,
+	IMSEC: () => Er,
+	IMSECH: () => Br,
+	IMSIN: () => Cr,
+	IMSINH: () => Sr,
+	IMSQRT: () => Rr,
+	IMSUB: () => br,
+	IMSUM: () => vr,
+	IMTAN: () => yr,
+	IMTANH: () => Tr
 });
-function Ue(t, n, e = "i") {
+function Xe(t, n, e = "i") {
 	if (T.isError(e)) throw e;
 	if (e || (e = "i"), "i" !== e && "j" !== e) throw T.BuiltIn.Value;
-	const r = ur(t), o = ur(n);
+	const r = ir(t), o = ir(n);
 	if (0 === r && 0 === o) return y.toText(0);
 	if (0 === r) return 1 === o ? e : -1 === o ? "-" + e : y.toText(o) + e;
 	if (0 === o) return y.toText(r);
 	let u = o > 0 ? "+" : "";
 	return 1 === o ? y.toText(r) + u + e : -1 === o ? y.toText(r) + u + "-" + e : y.toText(r) + u + y.toText(o) + e;
 }
-function Xe(t) {
-	const { real: n, im: e } = Pr(t);
-	return Math.hypot(n, e);
-}
 function ke(t) {
-	return Pr(t).im;
+	const { real: n, im: e } = Lr(t);
+	return Math.hypot(n, e);
 }
 function He(t) {
-	const { real: n, im: e } = Pr(t);
+	return Lr(t).im;
+}
+function Ge(t) {
+	const { real: n, im: e } = Lr(t);
 	if (0 === n && 0 === e) throw T.BuiltIn.Div0;
-	return Ge(n, e);
+	return je(n, e);
 }
-var Ge = (t, n) => 0 === t && 0 === n ? 0 : 0 === t ? n > 0 ? Math.PI / 2 : -Math.PI / 2 : 0 === n ? t > 0 ? 0 : Math.PI : t > 0 ? Math.atan(n / t) : n > 0 ? Math.atan(n / t) + Math.PI : Math.atan(n / t) - Math.PI, je = (t, n) => {
+var je = (t, n) => 0 === t && 0 === n ? 0 : 0 === t ? n > 0 ? Math.PI / 2 : -Math.PI / 2 : 0 === n ? t > 0 ? 0 : Math.PI : t > 0 ? Math.atan(n / t) : n > 0 ? Math.atan(n / t) + Math.PI : Math.atan(n / t) - Math.PI, Ye = (t, n) => {
 	const e = Math.log(Math.sqrt(t * t + n * n));
 	if (!Number.isFinite(e)) throw T.BuiltIn.Num;
 	return e;
 };
-function Ye(t) {
-	const { real: n, im: e, unit: r } = Pr(t);
-	return 0 !== e ? Ue(n, -e, r) : y.toText(n);
-}
-var qe = (t) => (Math.exp(t) + Math.exp(-t)) / 2, $e = (t) => (Math.exp(t) - Math.exp(-t)) / 2, Ke = (t, n) => ({
-	real: Pe(t) * qe(n),
-	im: -Fe(t) * $e(n)
-}), ze = (t, n) => ({
-	real: Fe(t) * qe(n),
-	im: Pe(t) * $e(n)
+function qe(t) {
+	const { real: n, im: e, unit: r } = Lr(t);
+	return 0 !== e ? Xe(n, -e, r) : y.toText(n);
+}
+var $e = (t) => (Math.exp(t) + Math.exp(-t)) / 2, Ke = (t) => (Math.exp(t) - Math.exp(-t)) / 2, ze = (t, n) => ({
+	real: Le(t) * $e(n),
+	im: -Pe(t) * Ke(n)
 }), We = (t, n) => ({
-	real: Pe(n) * qe(t),
-	im: Fe(n) * $e(t)
+	real: Pe(t) * $e(n),
+	im: Le(t) * Ke(n)
 }), Qe = (t, n) => ({
-	real: Pe(n) * $e(t),
-	im: Fe(n) * qe(t)
-}), Ze = {
+	real: Le(n) * $e(t),
+	im: Pe(n) * Ke(t)
+}), Ze = (t, n) => ({
+	real: Le(n) * Ke(t),
+	im: Pe(n) * $e(t)
+}), Je = {
 	real: 1,
 	im: 0
-}, Je = (t, n) => {
+}, tr = (t, n) => {
 	if (0 === n.real && 0 === n.im) throw T.BuiltIn.Num;
 	if (0 === t.im && 0 === n.im) return {
 		real: t.real / n.real,
@@ -2327,209 +2332,209 @@ var qe = (t) => (Math.exp(t) + Math.exp(-t)) / 2, $e = (t) => (Math.exp(t) - Mat
 		real: (t.real * n.real + t.im * n.im) / e,
 		im: (t.im * n.real - t.real * n.im) / e
 	};
-}, tr = (t) => {
-	if (Math.abs(t) >= ye) throw T.BuiltIn.Num;
-}, nr = (t, n) => {
+}, nr = (t) => {
+	if (Math.abs(t) >= Te) throw T.BuiltIn.Num;
+}, er = (t, n) => {
 	const e = Math.tanh(n);
 	if (1 === Math.abs(e)) return {
 		real: 0,
 		im: e
 	};
-	if (tr(t), 0 === n) return {
-		real: Fe(t) / Pe(t),
+	if (nr(t), 0 === n) return {
+		real: Pe(t) / Le(t),
 		im: 0
 	};
-	const r = Pe(2 * t) + Math.cosh(2 * n);
+	const r = Le(2 * t) + Math.cosh(2 * n);
 	if (0 === r) throw T.BuiltIn.Num;
 	return {
-		real: Fe(2 * t) / r,
+		real: Pe(2 * t) / r,
 		im: Math.sinh(2 * n) / r
 	};
-}, er = (t, n) => {
+}, rr = (t, n) => {
 	const e = Math.tanh(n);
 	if (1 === Math.abs(e)) return {
 		real: 0,
 		im: -e
 	};
 	if (0 === n) {
-		if (Math.abs(t) >= ye) return {
+		if (Math.abs(t) >= Te) return {
 			real: 0,
 			im: 0
 		};
-		const n = Fe(t);
+		const n = Pe(t);
 		if (0 === n) throw T.BuiltIn.Num;
 		return {
-			real: Pe(t) / n,
+			real: Le(t) / n,
 			im: 0
 		};
 	}
-	tr(t);
-	const r = Math.cosh(2 * n) - Pe(2 * t);
+	nr(t);
+	const r = Math.cosh(2 * n) - Le(2 * t);
 	if (0 === r) throw T.BuiltIn.Num;
 	return {
-		real: Fe(2 * t) / r,
+		real: Pe(2 * t) / r,
 		im: -Math.sinh(2 * n) / r
 	};
-}, rr = (t, n) => {
-	if (Number.isFinite(n.real) && Number.isFinite(n.im) && Math.abs(t) >= ye) throw T.BuiltIn.Num;
+}, or = (t, n) => {
+	if (Number.isFinite(n.real) && Number.isFinite(n.im) && Math.abs(t) >= Te) throw T.BuiltIn.Num;
 	return n;
-}, or = (t) => {
+}, ur = (t) => {
 	if (!Number.isFinite(t.real) || !Number.isFinite(t.im)) throw T.BuiltIn.Num;
 	return t;
-}, ur = (t) => {
+}, ir = (t) => {
 	if (T.isError(t)) throw t;
 	if (void 0 === t) throw T.BuiltIn.NA;
 	return null === t ? 0 : y.parseAsNumber(t);
 };
-function ir(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = or(rr(n, Ke(n, e)));
-	return Ue(o.real, o.im, r);
-}
 function lr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = or(rr(e, We(n, e)));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = ur(or(n, ze(n, e)));
+	return Xe(o.real, o.im, r);
 }
 function ar(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = er(n, e);
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = ur(or(e, Qe(n, e)));
+	return Xe(o.real, o.im, r);
 }
 function sr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Je(We(n, e), Qe(n, e));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = rr(n, e);
+	return Xe(o.real, o.im, r);
 }
 function cr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Je(Ze, rr(n, ze(n, e)));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = tr(Qe(n, e), Ze(n, e));
+	return Xe(o.real, o.im, r);
 }
 function fr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Je(Ze, rr(e, Qe(n, e)));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = tr(Je, or(n, We(n, e)));
+	return Xe(o.real, o.im, r);
+}
+function hr(t) {
+	const { real: n, im: e, unit: r } = Lr(t), o = tr(Je, or(e, Ze(n, e)));
+	return Xe(o.real, o.im, r);
 }
-function hr(t, n) {
-	const e = Pr(Fr(t)), r = e.real, o = e.im, u = e.unit, i = Pr(Fr(n)), l = i.real, a = i.im, s = i.unit;
+function gr(t, n) {
+	const e = Lr(Pr(t)), r = e.real, o = e.im, u = e.unit, i = Lr(Pr(n)), l = i.real, a = i.im, s = i.unit;
 	if (0 === l && 0 === a || u !== s) throw T.BuiltIn.Num;
-	const c = u, f = Math.pow(l, 2) + Math.pow(a, 2), h = or({
+	const c = u, f = Math.pow(l, 2) + Math.pow(a, 2), h = ur({
 		real: (r * l + o * a) / f,
 		im: (o * l - r * a) / f
 	});
-	return Ue(h.real, h.im, c);
+	return Xe(h.real, h.im, c);
 }
-function gr(t) {
-	const { real: n, im: e, unit: r } = Pr(t);
+function mr(t) {
+	const { real: n, im: e, unit: r } = Lr(t);
 	let o = Math.exp(n);
 	if (!Number.isFinite(o)) {
 		if (0 === e) throw T.BuiltIn.Num;
 		o = Number.MAX_VALUE;
 	}
-	const u = or(rr(e, {
-		real: o * Pe(e),
-		im: o * Fe(e)
+	const u = ur(or(e, {
+		real: o * Le(e),
+		im: o * Pe(e)
 	}));
-	return Ue(u.real, u.im, r);
+	return Xe(u.real, u.im, r);
 }
-function mr(t) {
-	const { real: n, im: e, unit: r } = Pr(t);
-	return Ue(je(n, e), Ge(n, e), r);
+function Nr(t) {
+	const { real: n, im: e, unit: r } = Lr(t);
+	return Xe(Ye(n, e), je(n, e), r);
 }
-function Nr(t, n = 10) {
-	const e = mr(t);
-	return T.isError(e) ? e : n <= 0 || 1 === n ? NaN : hr(e, Math.log(n));
+function Ir(t, n = 10) {
+	const e = Nr(t);
+	return T.isError(e) ? e : n <= 0 || 1 === n ? NaN : gr(e, Math.log(n));
 }
-function Ir(t) {
-	const { real: n, im: e, unit: r } = Pr(t);
-	return Ue(je(n, e) / Math.LN10, Ge(n, e) / Math.LN10, r);
+function pr(t) {
+	const { real: n, im: e, unit: r } = Lr(t);
+	return Xe(Ye(n, e) / Math.LN10, je(n, e) / Math.LN10, r);
 }
 function Mr(t) {
-	const { real: n, im: e, unit: r } = Pr(t);
-	return Ue(je(n, e) / Math.LN2, Ge(n, e) / Math.LN2, r);
+	const { real: n, im: e, unit: r } = Lr(t);
+	return Xe(Ye(n, e) / Math.LN2, je(n, e) / Math.LN2, r);
 }
-function pr(t, n) {
-	const { real: e, im: r, unit: o } = Pr(Fr(t)), u = y.parseAsNumber(Fr(n) ?? 0), i = Math.sqrt(e * e + r * r);
+function Ar(t, n) {
+	const { real: e, im: r, unit: o } = Lr(Pr(t)), u = y.parseAsNumber(Pr(n) ?? 0), i = Math.sqrt(e * e + r * r);
 	if (0 === e && 0 === r) {
-		if (u > 0) return Ue(0, 0, o);
+		if (u > 0) return Xe(0, 0, o);
 		throw T.BuiltIn.Num;
 	}
 	const l = u * Math.log(i);
 	if (!Number.isFinite(l)) throw T.BuiltIn.Num;
 	const a = Math.pow(i, u);
 	if (!Number.isFinite(a)) throw T.BuiltIn.Num;
-	const s = u * Ge(e, r), c = rr(s, {
-		real: a * Pe(s),
-		im: a * Fe(s)
+	const s = u * je(e, r), c = or(s, {
+		real: a * Le(s),
+		im: a * Pe(s)
 	});
-	return Ue(c.real, c.im, o);
+	return Xe(c.real, c.im, o);
 }
-function Ar(t) {
+function wr(t) {
 	const n = t.length;
-	if (0 === n) return Ue(0, 0, "i");
-	const e = Pr(t[0]);
-	let r = Ue(e.real, e.im, e.unit);
+	if (0 === n) return Xe(0, 0, "i");
+	const e = Lr(t[0]);
+	let r = Xe(e.real, e.im, e.unit);
 	for (let e = 1; e < n; e++) {
-		const n = t[e], o = Pr(r), u = Pr(n), i = o.unit;
+		const n = t[e], o = Lr(r), u = Lr(n), i = o.unit;
 		if (i !== u.unit) throw T.BuiltIn.Value;
 		const l = o.real, a = o.im, s = u.real, c = u.im, f = {
 			real: l * s - a * c,
 			im: l * c + a * s
 		};
 		if (!Number.isFinite(f.real) || !Number.isFinite(f.im)) throw T.BuiltIn.Value;
-		r = Ue(f.real, f.im, i);
+		r = Xe(f.real, f.im, i);
 	}
 	return r;
 }
-function wr(t) {
-	return Pr(t).real;
-}
 function dr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Je(Ze, rr(n, Ke(n, e)));
-	return Ue(o.real, o.im, r);
+	return Lr(t).real;
 }
 function Er(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Je(Ze, rr(e, We(n, e)));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = tr(Je, or(n, ze(n, e)));
+	return Xe(o.real, o.im, r);
 }
 function Br(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = or(rr(n, ze(n, e)));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = tr(Je, or(e, Qe(n, e)));
+	return Xe(o.real, o.im, r);
 }
 function Cr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = or(rr(e, Qe(n, e)));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = ur(or(n, We(n, e)));
+	return Xe(o.real, o.im, r);
 }
 function Sr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Math.sqrt(Math.sqrt(n * n + e * e));
+	const { real: n, im: e, unit: r } = Lr(t), o = ur(or(e, Ze(n, e)));
+	return Xe(o.real, o.im, r);
+}
+function Rr(t) {
+	const { real: n, im: e, unit: r } = Lr(t), o = Math.sqrt(Math.sqrt(n * n + e * e));
 	if (!Number.isFinite(o)) throw T.BuiltIn.Num;
-	const u = Ge(n, e) / 2;
-	return Ue(o * Pe(u), o * Fe(u), r);
+	const u = je(n, e) / 2;
+	return Xe(o * Le(u), o * Pe(u), r);
 }
-function Rr(t, n) {
-	const e = Pr(Fr(t)), r = e.real, o = e.im, u = e.unit, i = Pr(Fr(n)), l = i.real, a = i.im;
+function br(t, n) {
+	const e = Lr(Pr(t)), r = e.real, o = e.im, u = e.unit, i = Lr(Pr(n)), l = i.real, a = i.im;
 	if (u !== i.unit) throw T.BuiltIn.Num;
-	return Ue(r - l, o - a, u);
+	return Xe(r - l, o - a, u);
 }
-function br(t) {
+function vr(t) {
 	let n, e = 0, r = 0;
 	const o = t.length;
 	for (let u = 0; u < o; u++) {
-		const o = t[u], { real: i, im: l, unit: a } = Pr(o);
+		const o = t[u], { real: i, im: l, unit: a } = Lr(o);
 		if (n || (n = a), n !== a) throw T.BuiltIn.Value;
 		e += i, r += l;
 	}
-	return Ue(e, r, n);
-}
-function vr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = nr(n, e);
-	return Ue(o.real, o.im, r);
+	return Xe(e, r, n);
 }
 function yr(t) {
-	const { real: n, im: e, unit: r } = Pr(t), o = Je(Qe(n, e), We(n, e));
-	return Ue(o.real, o.im, r);
+	const { real: n, im: e, unit: r } = Lr(t), o = er(n, e);
+	return Xe(o.real, o.im, r);
+}
+function Tr(t) {
+	const { real: n, im: e, unit: r } = Lr(t), o = tr(Ze(n, e), Qe(n, e));
+	return Xe(o.real, o.im, r);
 }
-var Tr = String.raw`[+-]?\s*[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?`, Vr = new RegExp(String.raw`^\s*([+-]?\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), xr = new RegExp(String.raw`^\s*(${Tr})\s*([+-]\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), Dr = /^\s*[+-]?\s*$/, Or = (t) => Dr.test(t) ? Number(`${t.replace(/\s+/g, "")}1`) : Number(t.replace(/\s+/g, "")), Fr = (t) => {
+var Vr = String.raw`[+-]?\s*[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?`, xr = new RegExp(String.raw`^\s*([+-]?\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), Dr = new RegExp(String.raw`^\s*(${Vr})\s*([+-]\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), Or = /^\s*[+-]?\s*$/, Fr = (t) => Or.test(t) ? Number(`${t.replace(/\s+/g, "")}1`) : Number(t.replace(/\s+/g, "")), Pr = (t) => {
 	if (T.isError(t)) throw t;
 	if (void 0 === t) throw T.BuiltIn.NA;
 	return t;
 };
-function Pr(t) {
+function Lr(t) {
 	let n = 0, e = 0, r = "i";
 	if ("number" == typeof t) return {
 		real: t,
@@ -2550,23 +2555,23 @@ function Pr(t) {
 			unit: r
 		};
 	} catch (t) {}
-	let o = t.match(Vr);
-	if (o) return e = Or(o[1]), r = o[2], {
+	let o = t.match(xr);
+	if (o) return e = Fr(o[1]), r = o[2], {
 		real: n,
 		im: e,
 		unit: r
 	};
-	if (o = t.match(xr), o) return n = Or(o[1]), e = Or(o[2]), r = o[3], {
+	if (o = t.match(Dr), o) return n = Fr(o[1]), e = Fr(o[2]), r = o[3], {
 		real: n,
 		im: e,
 		unit: r
 	};
 	throw T.BuiltIn.Num;
 }
-var Lr = U({
-	FXHISTORY: () => no,
-	STOCKHISTORY: () => Zr
-}), _r = 864e5, Ur = (t) => Math.round(Date.parse(`${t}T00:00:00Z`) / _r) + 25569, Xr = (t) => (/* @__PURE__ */ new Date((Math.floor(t) - 25569) * _r)).toISOString().slice(0, 10), kr = [
+var _r = U({
+	FXHISTORY: () => eo,
+	STOCKHISTORY: () => Jr
+}), Ur = 864e5, Xr = (t) => Math.round(Date.parse(`${t}T00:00:00Z`) / Ur) + 25569, kr = (t) => (/* @__PURE__ */ new Date((Math.floor(t) - 25569) * Ur)).toISOString().slice(0, 10), Hr = [
 	"Date",
 	"Close",
 	"Open",
@@ -2574,12 +2579,12 @@ var Lr = U({
 	"Low",
 	"Volume"
 ];
-function Hr(t, n) {
-	const e = t.properties.split(",").map((t) => kr[Number(t)]), r = [];
+function Gr(t, n) {
+	const e = t.properties.split(",").map((t) => Hr[Number(t)]), r = [];
 	2 === t.headers && r.push(e.map((n, e) => 0 === e ? t.instrument : null)), t.headers >= 1 && r.push([...e]);
 	const o = Array.from(n.keys()).sort();
 	for (const u of o) {
-		const o = Ur(u);
+		const o = Xr(u);
 		if (o < t.start || o > t.end) continue;
 		const i = n.get(u);
 		r.push(e.map((t) => "Date" === t ? o : i[t] ?? null));
@@ -2587,17 +2592,17 @@ function Hr(t, n) {
 	if (0 === r.length) throw T.BuiltIn.NA;
 	return r;
 }
-function Gr(t) {
+function jr(t) {
 	const n = [];
 	for (const e of t ?? []) {
 		if (null == e) continue;
 		const t = Number(e);
-		if (!Number.isInteger(t) || t < 0 || t >= kr.length) throw T.BuiltIn.Value;
+		if (!Number.isInteger(t) || t < 0 || t >= Hr.length) throw T.BuiltIn.Value;
 		n.push(t);
 	}
 	return n.length > 0 ? n.join(",") : "0,1";
 }
-function jr(t, n) {
+function Yr(t, n) {
 	const e = Math.floor(t), r = void 0 === n ? e : Math.floor(n);
 	if (e < 1 || r < e) throw T.BuiltIn.Value;
 	return {
@@ -2605,7 +2610,7 @@ function jr(t, n) {
 		end: r
 	};
 }
-function Yr(t, n, e) {
+function qr(t, n, e) {
 	const r = /* @__PURE__ */ new Map();
 	for (const n of t) {
 		const t = n.payload.url, e = r.get(t);
@@ -2617,7 +2622,7 @@ function Yr(t, n, e) {
 		for (const t of o) t.onCancel(() => {
 			0 === --u && r.abort();
 		});
-		qr(n, t, r.signal).then((t) => {
+		$r(n, t, r.signal).then((t) => {
 			let n;
 			try {
 				n = e(t);
@@ -2626,7 +2631,7 @@ function Yr(t, n, e) {
 				return;
 			}
 			for (const t of o) try {
-				t.resolve(Hr(t.payload, n));
+				t.resolve(Gr(t.payload, n));
 			} catch (n) {
 				t.reject(n);
 			}
@@ -2635,7 +2640,7 @@ function Yr(t, n, e) {
 		});
 	}
 }
-async function qr(t, n, e) {
+async function $r(t, n, e) {
 	const r = await t.fetch(n, {
 		signal: e,
 		headers: { Accept: "application/json" }
@@ -2644,7 +2649,7 @@ async function qr(t, n, e) {
 	if (!r.ok) throw new T.Value(`HTTP ${r.status}`);
 	return r.json();
 }
-var $r = "https://www.alphavantage.co/query", Kr = [
+var Kr = "https://www.alphavantage.co/query", zr = [
 	{
 		fn: "TIME_SERIES_DAILY",
 		key: "Time Series (Daily)"
@@ -2657,32 +2662,32 @@ var $r = "https://www.alphavantage.co/query", Kr = [
 		fn: "TIME_SERIES_MONTHLY",
 		key: "Monthly Time Series"
 	}
-], zr = {
+], Wr = {
 	Open: "1. open",
 	High: "2. high",
 	Low: "3. low",
 	Close: "4. close",
 	Volume: "5. volume"
 };
-function Wr() {
+function Qr() {
 	const t = globalThis.ALPHAVANTAGE_API_KEY;
 	if ("string" == typeof t && t) return t;
 	const n = globalThis.process?.env?.ALPHAVANTAGE_API_KEY;
 	return "string" == typeof n && n ? n : "demo";
 }
-function Qr(t, n) {
-	Yr(t, n, (t) => {
+function Zr(t, n) {
+	qr(t, n, (t) => {
 		if (!t || "object" != typeof t) throw T.BuiltIn.Value;
 		if (t["Error Message"]) throw T.BuiltIn.NA;
 		const n = t.Information ?? t.Note;
 		if (n) throw new T.Value(String(n));
-		const e = Kr.map((n) => t[n.key]).find((t) => t && "object" == typeof t);
+		const e = zr.map((n) => t[n.key]).find((t) => t && "object" == typeof t);
 		if (!e) throw T.BuiltIn.NA;
 		const r = /* @__PURE__ */ new Map();
 		for (const t of Object.keys(e)) {
 			const n = e[t], o = {};
-			for (const t of Object.keys(zr)) {
-				const e = n[zr[t]];
+			for (const t of Object.keys(Wr)) {
+				const e = n[Wr[t]];
 				o[t] = void 0 === e ? null : Number(e);
 			}
 			r.set(t, o);
@@ -2690,24 +2695,24 @@ function Qr(t, n) {
 		return r;
 	});
 }
-function Zr(t, n, e, r = 0, o = 1, u) {
-	const { start: i, end: l } = jr(n, e), a = t.trim().toUpperCase();
+function Jr(t, n, e, r = 0, o = 1, u) {
+	const { start: i, end: l } = Yr(n, e), a = t.trim().toUpperCase();
 	if (!a) throw T.BuiltIn.Value;
-	const s = Kr[Math.trunc(r)];
+	const s = zr[Math.trunc(r)];
 	if (!s) throw T.BuiltIn.Value;
 	const c = {
-		url: `${$r}?function=${s.fn}&symbol=${encodeURIComponent(a)}&outputsize=full&apikey=${encodeURIComponent(Wr())}`,
+		url: `${Kr}?function=${s.fn}&symbol=${encodeURIComponent(a)}&outputsize=full&apikey=${encodeURIComponent(Qr())}`,
 		headers: Math.trunc(o),
-		properties: Gr(u),
+		properties: jr(u),
 		start: i,
 		end: l,
 		instrument: a
 	};
-	return y.defer(Qr, c), [[T.BuiltIn.Busy]];
+	return y.defer(Zr, c), [[T.BuiltIn.Busy]];
 }
-var Jr = "https://api.frankfurter.dev/v1";
-function to(t, n) {
-	Yr(t, n, (t) => {
+var to = "https://api.frankfurter.dev/v1";
+function no(t, n) {
+	qr(t, n, (t) => {
 		const n = t?.rates;
 		if (!n || "object" != typeof n) throw T.BuiltIn.NA;
 		const e = /* @__PURE__ */ new Map();
@@ -2718,49 +2723,49 @@ function to(t, n) {
 		return e;
 	});
 }
-function no(t, n, e, r, o = 1) {
-	const { start: u, end: i } = jr(e, r), l = t.trim().toUpperCase(), a = n.trim().toUpperCase();
+function eo(t, n, e, r, o = 1) {
+	const { start: u, end: i } = Yr(e, r), l = t.trim().toUpperCase(), a = n.trim().toUpperCase();
 	if (!/^[A-Z]{3}$/.test(l) || !/^[A-Z]{3}$/.test(a)) throw T.BuiltIn.Value;
 	const s = {
-		url: `${Jr}/${Xr(u)}..${Xr(i)}?from=${l}&to=${a}`,
+		url: `${to}/${kr(u)}..${kr(i)}?from=${l}&to=${a}`,
 		headers: Math.trunc(o),
 		properties: "0,1",
 		start: u,
 		end: i,
 		instrument: `${l}/${a}`
 	};
-	return y.defer(to, s), [[T.BuiltIn.Busy]];
+	return y.defer(no, s), [[T.BuiltIn.Busy]];
 }
-var eo = (t, n, e = 0) => {
+var ro = (t, n, e = 0) => {
 	const r = (t) => T.isError(t) ? t : n(t);
 	return y.getArgs().getKindAt(e) === O.Reference ? r(t.getValueAt(0, 0)) : y.createRange(t.getRowCount(), t.getColumnCount(), (n, e) => r(t.getValueAt(e.rowIndex, e.colIndex)));
-}, ro = U({
-	CELL: () => oo,
-	ERROR_TYPE: () => uo,
-	INFO: () => io,
-	ISBLANK: () => lo,
-	ISDATE: () => ao,
-	ISEMAIL: () => so,
-	ISERR: () => co,
-	ISERROR: () => fo,
-	ISEVEN: () => ho,
-	ISFORMULA: () => go,
-	ISLOGICAL: () => mo,
-	ISNA: () => No,
-	ISNONTEXT: () => Io,
-	ISNUMBER: () => po,
-	ISODD: () => Ao,
-	ISOMITTED: () => Eo,
-	ISREF: () => Co,
-	ISTEXT: () => So,
-	ISURL: () => Bo,
-	N: () => Ro,
-	NA: () => vo,
-	SHEET: () => To,
-	SHEETS: () => Vo,
-	TYPE: () => Do
+}, oo = U({
+	CELL: () => uo,
+	ERROR_TYPE: () => io,
+	INFO: () => lo,
+	ISBLANK: () => ao,
+	ISDATE: () => so,
+	ISEMAIL: () => co,
+	ISERR: () => fo,
+	ISERROR: () => ho,
+	ISEVEN: () => go,
+	ISFORMULA: () => mo,
+	ISLOGICAL: () => No,
+	ISNA: () => Io,
+	ISNONTEXT: () => po,
+	ISNUMBER: () => Ao,
+	ISODD: () => wo,
+	ISOMITTED: () => Bo,
+	ISREF: () => So,
+	ISTEXT: () => Ro,
+	ISURL: () => Co,
+	N: () => bo,
+	NA: () => yo,
+	SHEET: () => Vo,
+	SHEETS: () => xo,
+	TYPE: () => Oo
 });
-function oo(t, n) {
+function uo(t, n) {
 	let e = null;
 	switch (n || (n = y.getReference()), t) {
 		case "address":
@@ -2790,10 +2795,10 @@ function oo(t, n) {
 	}
 	return e;
 }
-function uo(t) {
+function io(t) {
 	return T.isError(t) ? t.getCode() : T.BuiltIn.NA;
 }
-function io(t) {
+function lo(t) {
 	if ("directory" === t) {
 		try {
 			return y.getRuntime().getLocation();
@@ -2810,10 +2815,10 @@ function io(t) {
 	if ("user" === t) return y.getRuntime().getUser() || (y.formatResults("@[Red]"), "Unidentified");
 	throw T.BuiltIn.Value;
 }
-function lo(t) {
+function ao(t) {
 	return null === t;
 }
-function ao(t) {
+function so(t) {
 	if ("string" != typeof t) return !1;
 	try {
 		return y.parseAsSerialDate(t), !0;
@@ -2821,50 +2826,50 @@ function ao(t) {
 		return !1;
 	}
 }
-function so(t) {
-	return "string" == typeof t && (t.length > 7 && "mailto:" === t.substring(0, 7).toLowerCase() ? !/\s/.test(t) : /^[^\s@]+@[^\s@]+\.[^\s@]+$/i.test(t));
-}
 function co(t) {
-	return T.isError(t) && !(t instanceof T.NA);
+	return "string" == typeof t && (t.length > 7 && "mailto:" === t.substring(0, 7).toLowerCase() ? !/\s/.test(t) : /^[^\s@]+@[^\s@]+\.[^\s@]+$/i.test(t));
 }
 function fo(t) {
-	return T.isError(t);
+	return T.isError(t) && !(t instanceof T.NA);
 }
 function ho(t) {
-	return wo(t);
+	return T.isError(t);
 }
 function go(t) {
-	const n = (t = yo(t)).getCoords(), e = n.scope ?? void 0;
-	return y.createRange(t.getRowCount(), t.getColumnCount(), (t, r) => null !== y.getFormulaAt(n.rowStart + r.rowIndex, n.colStart + r.colIndex, e));
+	return Eo(t);
 }
 function mo(t) {
-	return "boolean" == typeof t;
+	const n = (t = To(t)).getCoords(), e = n.scope ?? void 0;
+	return y.createRange(t.getRowCount(), t.getColumnCount(), (t, r) => null !== y.getFormulaAt(n.rowStart + r.rowIndex, n.colStart + r.colIndex, e));
 }
 function No(t) {
-	return t instanceof T.NA;
+	return "boolean" == typeof t;
 }
 function Io(t) {
+	return t instanceof T.NA;
+}
+function po(t) {
 	return !Mo(t);
 }
 function Mo(t) {
 	return "string" == typeof t || !0 === t?.isIRichData && "string" == typeof t.toPrimitive?.();
 }
-function po(t) {
+function Ao(t) {
 	return "number" == typeof t;
 }
-function Ao(t) {
-	const n = wo(t);
+function wo(t) {
+	const n = Eo(t);
 	return T.isError(n) ? n : !n;
 }
-function wo(t) {
+function Eo(t) {
 	if ("boolean" == typeof t) return T.BuiltIn.Value;
 	const n = null == t ? 0 : y.parseAsNumber(t);
 	return Math.trunc(j(n)) % 2 == 0;
 }
-function Eo(t) {
+function Bo(t) {
 	return y.getArgs().getKindAt(0) === O.Omitted;
 }
-function Bo(t) {
+function Co(t) {
 	if ("string" != typeof t) return !1;
 	try {
 		const n = new URL(t);
@@ -2872,28 +2877,28 @@ function Bo(t) {
 	} catch {
 		return !1;
 	}
-	return Oo.test(t);
+	return Fo.test(t);
 }
-function Co(t) {
+function So(t) {
 	if (!t || 0 === t.length) return !1;
 	for (let n = 0; n < t.length; n++) if (!t[n]?.isIReferenceRange) return !1;
 	return !0;
 }
-function So(t) {
+function Ro(t) {
 	return Mo(t);
 }
-function Ro(t) {
+function bo(t) {
 	if (y.getArgs().getKindAt(0) === O.Lambda) return T.BuiltIn.Value;
 	const n = !0 === t?.isIRange ? t : null;
-	return n ? eo(n, bo) : bo(t);
+	return n ? ro(n, vo) : vo(t);
 }
-var bo = (t) => "number" == typeof t ? t : "boolean" == typeof t ? Number(t) : 0;
-function vo() {
+var vo = (t) => "number" == typeof t ? t : "boolean" == typeof t ? Number(t) : 0;
+function yo() {
 	return T.BuiltIn.NA;
 }
-var yo = (t) => Array.isArray(t) ? t[0] : t;
-function To(t) {
-	if (void 0 === (t = void 0 === t ? void 0 : yo(t))) {
+var To = (t) => Array.isArray(t) ? t[0] : t;
+function Vo(t) {
+	if (void 0 === (t = void 0 === t ? void 0 : To(t))) {
 		const t = y.getSheetIndex();
 		return t >= 0 ? t + 1 : T.BuiltIn.NA;
 	}
@@ -2906,15 +2911,15 @@ function To(t) {
 	const e = y.getSheetIndex(n);
 	return e >= 0 ? e + 1 : T.BuiltIn.NA;
 }
-function Vo(t) {
+function xo(t) {
 	if (void 0 === t) return y.getSheetCount();
 	if (Array.isArray(t) && t.isSheetSpan) {
 		const n = t[0];
 		return y.getSheetIndex(n) >= 0 ? t.length : T.BuiltIn.NA;
 	}
-	return (t = yo(t)).isIReferenceRange ? 1 : T.BuiltIn.NA;
+	return (t = To(t)).isIReferenceRange ? 1 : T.BuiltIn.NA;
 }
-var xo = {
+var Do = {
 	[O.Number]: 1,
 	[O.Null]: 1,
 	[O.String]: 2,
@@ -2924,11 +2929,11 @@ var xo = {
 	[O.RichData]: 128,
 	[O.Lambda]: 128
 };
-function Do(t) {
-	if (T.isError(t)) return xo[O.Error];
+function Oo(t) {
+	if (T.isError(t)) return Do[O.Error];
 	let n = y.getArgs().getKindAt(0);
 	if (n === O.Reference) {
-		if (t.getColumnCount() > 1 || t.getRowCount() > 1) return xo[O.Array];
+		if (t.getColumnCount() > 1 || t.getRowCount() > 1) return Do[O.Array];
 		n = function(t) {
 			if (null === t) return O.Null;
 			if (T.isError(t)) return O.Error;
@@ -2947,23 +2952,23 @@ function Do(t) {
 			return O.Number;
 		}(t.getValueAt(0, 0));
 	}
-	return xo[n] ?? 1;
+	return Do[n] ?? 1;
 }
-var Oo = /* @__PURE__ */ new RegExp("^([a-zA-Z]+:\\/\\/)?((([a-z\\d]([a-z\\d-]*[a-z\\d])*)\\.)+[a-z]{2,}|((\\d{1,3}\\.){3}\\d{1,3}))(\\:\\d+)?(\\/[-a-z\\d%_.~+]*)*(\\?[;&a-z\\d%_.~+=-]*)?(\\#[-a-z\\d_]*)?$", "i"), Fo = U({
-	DATESTRING: () => Po,
-	NUMBERSTRING: () => Lo
+var Fo = /* @__PURE__ */ new RegExp("^([a-zA-Z]+:\\/\\/)?((([a-z\\d]([a-z\\d-]*[a-z\\d])*)\\.)+[a-z]{2,}|((\\d{1,3}\\.){3}\\d{1,3}))(\\:\\d+)?(\\/[-a-z\\d%_.~+]*)*(\\?[;&a-z\\d%_.~+=-]*)?(\\#[-a-z\\d_]*)?$", "i"), Po = U({
+	DATESTRING: () => Lo,
+	NUMBERSTRING: () => _o
 });
-function Po(t) {
+function Lo(t) {
 	return T.BuiltIn.NA;
 }
-function Lo(t, n) {
+function _o(t, n) {
 	return T.BuiltIn.NA;
 }
-var _o = U({ PHONETIC: () => Uo });
-function Uo(t) {
+var Uo = U({ PHONETIC: () => Xo });
+function Xo(t) {
 	return T.BuiltIn.NA;
 }
-function Xo(t, n, e, r, o) {
+function ko(t, n, e, r, o) {
 	let u = null;
 	e && (u = y.getResizedReference(e.getCoords(), t.getRowCount(), t.getColumnCount()));
 	const i = y.createCriteria(n), l = i(null);
@@ -2991,35 +2996,35 @@ function Xo(t, n, e, r, o) {
 		return r;
 	}(r, t, n)) } : void 0);
 }
-var ko = (t, n) => (t ?? 0) + n, Ho = (t, n) => t, Go = U({
-	AND: () => Yo,
-	BYCOL: () => qo,
-	BYROW: () => $o,
-	FALSE: () => Ko,
-	FLATTEN: () => zo,
-	IF: () => Wo,
-	IFERROR: () => Qo,
-	IFNA: () => Zo,
-	IFS: () => Jo,
-	LAMBDA: () => tu,
-	LET: () => nu,
-	MAKEARRAY: () => eu,
-	MAP: () => ru,
-	NOT: () => ou,
-	OR: () => uu,
-	REDUCE: () => iu,
-	REDUCEIF: () => lu,
-	SCAN: () => au,
-	SWITCH: () => su,
-	TRUE: () => cu,
-	XOR: () => fu
-}), jo = (t) => "number" == typeof t ? X(t) : t;
-function Yo(t) {
+var Ho = (t, n) => (t ?? 0) + n, Go = (t, n) => t, jo = U({
+	AND: () => qo,
+	BYCOL: () => $o,
+	BYROW: () => Ko,
+	FALSE: () => zo,
+	FLATTEN: () => Wo,
+	IF: () => Qo,
+	IFERROR: () => Zo,
+	IFNA: () => Jo,
+	IFS: () => tu,
+	LAMBDA: () => nu,
+	LET: () => eu,
+	MAKEARRAY: () => ru,
+	MAP: () => ou,
+	NOT: () => uu,
+	OR: () => iu,
+	REDUCE: () => lu,
+	REDUCEIF: () => au,
+	SCAN: () => su,
+	SWITCH: () => cu,
+	TRUE: () => fu,
+	XOR: () => hu
+}), Yo = (t) => "number" == typeof t ? X(t) : t;
+function qo(t) {
 	let n = !1, e = !1;
 	for (const r of t) for (const t of r.values()) n = !0, t || (e = !0);
 	return n ? !e : T.BuiltIn.Value;
 }
-function qo(t, n) {
+function $o(t, n) {
 	if (!n) return T.BuiltIn.Calc;
 	const e = t.getColumnCount(), r = new Array(e);
 	for (let o = 0; o < e; o++) r[o] = n(t.slice({
@@ -3028,7 +3033,7 @@ function qo(t, n) {
 	}));
 	return y.createRange(1, e, [r]);
 }
-function $o(t, n) {
+function Ko(t, n) {
 	if (!n) return T.BuiltIn.Calc;
 	const e = t.getRowCount(), r = new Array(e);
 	for (let o = 0; o < e; o++) r[o] = [n(t.slice({
@@ -3037,33 +3042,33 @@ function $o(t, n) {
 	}))];
 	return y.createRange(e, 1, r);
 }
-function Ko() {
+function zo() {
 	return !1;
 }
-function zo(t) {
+function Wo(t) {
 	return t.map((t) => t.flatten()).reduce((t, n) => t.concat(n));
 }
-function Wo(t, n, e) {
+function Qo(t, n, e) {
 	return t ? n : e;
 }
-function Qo(t, n) {
+function Zo(t, n) {
 	return T.isError(t) ? n : t;
 }
-function Zo(t, n) {
+function Jo(t, n) {
 	return T.BuiltIn.NA.equals(t) ? n : t;
 }
-function Jo(t) {
+function tu(t) {
 	for (const [n, e] of t) {
 		if (T.isError(n)) return n;
 		if (n) return e;
 	}
 	return T.BuiltIn.NA;
 }
-function tu(t) {
+function nu(t) {
 	return T.BuiltIn.Calc;
 }
-function nu(t, n, e, ...r) {}
-function eu(t, n, e) {
+function eu(t, n, e, ...r) {}
+function ru(t, n, e) {
 	if (t !== Math.trunc(t) || n !== Math.trunc(n) || t < 1 || n < 1) return T.BuiltIn.Value;
 	const r = y.getEntireCoords();
 	if (t > r.rowEnd + 1 || n > r.colEnd + 1) return T.BuiltIn.Value;
@@ -3075,7 +3080,7 @@ function eu(t, n, e) {
 	}
 	return y.createRange(t, n, o);
 }
-function ru(t, n) {
+function ou(t, n) {
 	const e = n.length, r = e > 0 ? n[e - 1] : null;
 	if ("function" != typeof r) return T.BuiltIn.Value;
 	const o = [t];
@@ -3108,15 +3113,15 @@ function ru(t, n) {
 	}
 	return y.createRange(i, a, h);
 }
-function ou(t) {
+function uu(t) {
 	return !t;
 }
-function uu(t) {
+function iu(t) {
 	let n = !1, e = !1;
 	for (const r of t) for (const t of r.values()) n = !0, t && (e = !0);
 	return n ? e : T.BuiltIn.Value;
 }
-function iu(t, n, e) {
+function lu(t, n, e) {
 	if (Array.isArray(t)) return T.BuiltIn.Value;
 	let r = t, o = void 0 !== t;
 	const u = !0 === n.isIReferenceRange, i = n.entries({
@@ -3138,10 +3143,10 @@ function iu(t, n, e) {
 	}
 	return r;
 }
-function lu(t, n, e, r) {
-	return Xo(t, n, e, r, null);
+function au(t, n, e, r) {
+	return ko(t, n, e, r, null);
 }
-function au(t, n, e) {
+function su(t, n, e) {
 	const r = n.getRowCount(), o = n.getColumnCount();
 	if (Array.isArray(t)) return y.createRange(r, o, () => T.BuiltIn.Value);
 	const u = !0 === n.isIReferenceRange;
@@ -3162,70 +3167,70 @@ function au(t, n, e) {
 	}
 	return y.createRange(r, o, a);
 }
-function su(t, n, e) {
-	const r = jo(t ?? 0);
+function cu(t, n, e) {
+	const r = Yo(t ?? 0);
 	for (const [t, e] of n) {
 		if (T.isError(t)) return t;
-		if (0 === y.compare(r, jo(t ?? 0))) return e ?? 0;
+		if (0 === y.compare(r, Yo(t ?? 0))) return e ?? 0;
 	}
 	return void 0 !== e ? e : T.BuiltIn.NA;
 }
-function cu() {
+function fu() {
 	return !0;
 }
-function fu(t) {
+function hu(t) {
 	let n = !1, e = 0;
 	for (const r of t) for (const t of r.values()) n = !0, t && e++;
 	return n ? e % 2 == 1 : T.BuiltIn.Value;
 }
-var hu = Object.freeze({ includeEmpty: !0 }), gu = Object.freeze({ axis: V.Axis.Column }), mu = Object.freeze({ axis: V.Axis.Row }), Nu = (Object.freeze({
+var gu = Object.freeze({ includeEmpty: !0 }), mu = Object.freeze({ axis: V.Axis.Column }), Nu = Object.freeze({ axis: V.Axis.Row }), Iu = (Object.freeze({
 	type: D.Number,
 	axis: V.Axis.Column
 }), U({
-	ADDRESS: () => Iu,
+	ADDRESS: () => pu,
 	AREAS: () => Mu,
-	ARRAYFORMULA: () => Au,
-	ARRAY_CONSTRAIN: () => pu,
-	CHOOSE: () => wu,
-	CHOOSECOLS: () => du,
-	CHOOSEROWS: () => Eu,
-	COLUMN: () => Bu,
-	COLUMNS: () => Cu,
-	DROP: () => Su,
-	EXPAND: () => bu,
-	FIELDVALUE: () => vu,
-	FILTER: () => Vu,
-	FORMULATEXT: () => Du,
-	GETPIVOTDATA: () => Ou,
-	HLOOKUP: () => Lu,
-	HSTACK: () => Uu,
-	HYPERLINK: () => Xu,
-	IMAGE: () => Hu,
-	INDEX: () => Gu,
-	INDIRECT: () => ju,
-	LOOKUP: () => Yu,
-	MATCH: () => qu,
-	OFFSET: () => $u,
-	ROW: () => Ku,
-	ROWS: () => zu,
-	RTD: () => Wu,
-	SORT: () => Qu,
-	SORTBY: () => ni,
-	TAKE: () => ei,
-	TOCOL: () => oi,
-	TOROW: () => ui,
-	TRANSPOSE: () => ii,
-	TRIMRANGE: () => li,
-	UNIQUE: () => si,
-	VLOOKUP: () => ci,
-	VSTACK: () => fi,
-	WRAPCOLS: () => gi,
-	WRAPROWS: () => mi,
-	XLOOKUP: () => Ni,
-	XMATCH: () => Ii
+	ARRAYFORMULA: () => wu,
+	ARRAY_CONSTRAIN: () => Au,
+	CHOOSE: () => du,
+	CHOOSECOLS: () => Eu,
+	CHOOSEROWS: () => Bu,
+	COLUMN: () => Cu,
+	COLUMNS: () => Su,
+	DROP: () => Ru,
+	EXPAND: () => vu,
+	FIELDVALUE: () => yu,
+	FILTER: () => xu,
+	FORMULATEXT: () => Ou,
+	GETPIVOTDATA: () => Fu,
+	HLOOKUP: () => _u,
+	HSTACK: () => Xu,
+	HYPERLINK: () => ku,
+	IMAGE: () => Gu,
+	INDEX: () => ju,
+	INDIRECT: () => Yu,
+	LOOKUP: () => qu,
+	MATCH: () => $u,
+	OFFSET: () => Ku,
+	ROW: () => zu,
+	ROWS: () => Wu,
+	RTD: () => Qu,
+	SORT: () => Zu,
+	SORTBY: () => ei,
+	TAKE: () => ri,
+	TOCOL: () => ui,
+	TOROW: () => ii,
+	TRANSPOSE: () => li,
+	TRIMRANGE: () => ai,
+	UNIQUE: () => ci,
+	VLOOKUP: () => fi,
+	VSTACK: () => hi,
+	WRAPCOLS: () => mi,
+	WRAPROWS: () => Ni,
+	XLOOKUP: () => Ii,
+	XMATCH: () => pi
 }));
-function Iu(t, n, e = 1, r = !0, o = void 0) {
-	const u = wi(t), i = wi(n), l = wi(e), a = y.getEntireCoords();
+function pu(t, n, e = 1, r = !0, o = void 0) {
+	const u = di(t), i = di(n), l = di(e), a = y.getEntireCoords();
 	if (l < 1 || l > 4) throw T.BuiltIn.Value;
 	const s = !r && (2 === l || 4 === l);
 	if (!r && (3 === l || 4 === l) ? Math.abs(u) > a.rowEnd : u < 1 || u > a.rowEnd + 1) throw T.BuiltIn.Value;
@@ -3242,7 +3247,7 @@ function Iu(t, n, e = 1, r = !0, o = void 0) {
 function Mu(t) {
 	return t.length;
 }
-function pu(t, n, e) {
+function Au(t, n, e) {
 	return n < 0 || e < 0 ? T.BuiltIn.Num : (n = Math.trunc(n), e = Math.trunc(e), n < 1 || e < 1 ? T.BuiltIn.Ref : t.slice({
 		rowStart: 0,
 		colStart: 0,
@@ -3250,17 +3255,17 @@ function pu(t, n, e) {
 		colEnd: Math.min(e, t.getColumnCount()) - 1
 	}));
 }
-function Au(t) {
+function wu(t) {
 	return t;
 }
-function wu(t, n) {
+function du(t, n) {
 	const e = n.length;
 	if (e < 1 || e > 254) throw T.BuiltIn.Value;
 	const r = Math.trunc(t);
 	if (r < 1 || r > e) throw T.BuiltIn.Value;
 	return n[r - 1];
 }
-function du(t, n) {
+function Eu(t, n) {
 	if (t.length > 1) return T.BuiltIn.Ref;
 	const e = t[0], r = e.getColumnCount(), o = n.map((t) => {
 		const n = Math.trunc(t);
@@ -3271,7 +3276,7 @@ function du(t, n) {
 	});
 	return e.take(o, V.Axis.Column);
 }
-function Eu(t, n) {
+function Bu(t, n) {
 	if (t.length > 1) return T.BuiltIn.Ref;
 	const e = t[0], r = e.getRowCount(), o = n.map((t) => {
 		const n = Math.trunc(t);
@@ -3282,17 +3287,17 @@ function Eu(t, n) {
 	});
 	return e.take(o, V.Axis.Row);
 }
-function Bu(t) {
+function Cu(t) {
 	if (!t || 0 === t.length) return y.getColumn() + 1;
 	if (t.length > 1) return T.BuiltIn.Ref;
 	const n = [], e = t[0].getCoords(), r = e.colStart, o = e.colEnd;
 	for (let t = r; t <= o; t++) n.push(t + 1);
 	return n;
 }
-function Cu(t) {
+function Su(t) {
 	return t.length > 1 ? T.BuiltIn.Ref : t[0].getColumnCount();
 }
-function Su(t, n, e) {
+function Ru(t, n, e) {
 	const r = t.getRowCount(), o = t.getColumnCount();
 	if (e = Math.trunc(e ?? 0), n = Math.trunc(n), Math.abs(n) >= r || Math.abs(e) >= o) return T.BuiltIn.Calc;
 	const u = n >= 0 ? n : 0, i = n >= 0 ? r - 1 : r + n - 1, l = e >= 0 ? e : 0, a = e >= 0 ? o - 1 : o + e - 1;
@@ -3303,17 +3308,17 @@ function Su(t, n, e) {
 		colEnd: a
 	});
 }
-var Ru = (t) => !0 === t?.isIRange ? t : y.createRange(1, 1, t);
-function bu(t, n, e, r = T.BuiltIn.NA) {
-	const o = Ru(t), u = o.getRowCount(), i = o.getColumnCount(), l = void 0 === n ? u : Math.trunc(n), a = void 0 === e ? i : Math.trunc(e);
+var bu = (t) => !0 === t?.isIRange ? t : y.createRange(1, 1, t);
+function vu(t, n, e, r = T.BuiltIn.NA) {
+	const o = bu(t), u = o.getRowCount(), i = o.getColumnCount(), l = void 0 === n ? u : Math.trunc(n), a = void 0 === e ? i : Math.trunc(e);
 	if (l > 2147483647 || a > 2147483647) return T.BuiltIn.Value;
 	if (l < u || a < i) return T.BuiltIn.Value;
 	const s = y.getEntireCoords(), c = s.rowEnd - s.rowStart + 1;
 	return l > c || a > c ? T.BuiltIn.Num : o.resize(l, a, r);
 }
-function vu(t, n) {
+function yu(t, n) {
 	if (!0 !== t?.isIRichData || T.isError(t)) return T.BuiltIn.Field;
-	const r = yu(t.getKind(), n);
+	const r = Tu(t.getKind(), n);
 	if (!r) return T.BuiltIn.Field;
 	if ((t.getPropertyMeta ? t.getPropertyMeta(r.name) : r.meta)?.excludeFrom?.dotNotation) return T.BuiltIn.Field;
 	const o = t.getProperty(r.name), u = !0 === o?.isIRichData ? o.toArray?.() : null;
@@ -3321,19 +3326,19 @@ function vu(t, n) {
 	const i = u.length, l = i > 0 ? u[0].length : 0;
 	return 0 === i || 0 === l ? T.BuiltIn.Field : 1 === i && 1 === l ? u[0][0] : y.createRange(i, l, u);
 }
-var yu = (t, n) => {
+var Tu = (t, n) => {
 	const e = t.getProperty(n);
 	if (e) return e;
 	const r = n.toUpperCase(), o = t.getProperties();
 	for (let t = 0; t < o.length; t++) if (o[t].name.toUpperCase() === r) return o[t];
 	return null;
-}, Tu = Object.freeze({ type: null });
-function Vu(t, n, e) {
+}, Vu = Object.freeze({ type: null });
+function xu(t, n, e) {
 	if (t.length > 1 || n.length > 1) return T.BuiltIn.Ref;
 	const r = t[0], o = n[0];
-	return xu(r, o, e);
+	return Du(r, o, e);
 }
-var xu = (t, n, e) => {
+var Du = (t, n, e) => {
 	const r = t.getRowCount(), o = t.getColumnCount(), u = n.getRowCount(), i = n.getColumnCount(), l = 1 === i, a = 1 === u;
 	if (l && u !== r) throw T.BuiltIn.Value;
 	if (a && i !== o) throw T.BuiltIn.Value;
@@ -3342,7 +3347,7 @@ var xu = (t, n, e) => {
 	const f = t.filter((t, e) => {
 		const r = l ? e.rowIndex : e.colIndex;
 		if (r !== s) {
-			const t = l ? n.getValueAt(r, 0, Tu) : n.getValueAt(0, r, Tu);
+			const t = l ? n.getValueAt(r, 0, Vu) : n.getValueAt(0, r, Vu);
 			if (T.isError(t)) throw t;
 			let e = t;
 			if ("string" == typeof e) {
@@ -3364,7 +3369,7 @@ var xu = (t, n, e) => {
 	}
 	return f;
 };
-function Du(t) {
+function Ou(t) {
 	if (t.length > 1) {
 		const n = t[0];
 		return y.createRange(n.getRowCount(), n.getColumnCount(), () => T.BuiltIn.NA);
@@ -3375,21 +3380,21 @@ function Du(t) {
 		return null === o ? T.BuiltIn.NA : "=" + o;
 	});
 }
-function Ou(t, n, e) {
+function Fu(t, n, e) {
 	const r = 1 === n.length ? n[0] : null, o = r ? y.getPivotAt(r) : null;
 	if (!o) return T.BuiltIn.Ref;
 	if (!1 === o.isComputed?.()) {
 		const t = y.getValueAt(y.getRow(), y.getColumn());
 		return null != t ? t : T.BuiltIn.Ref;
 	}
-	const u = Fu(o, String(t ?? ""));
+	const u = Pu(o, String(t ?? ""));
 	if (-1 === u) return T.BuiltIn.Ref;
 	const i = /* @__PURE__ */ new Map(), l = o.getFields();
 	for (const [t, n] of e ?? []) {
 		if (void 0 === n) return T.BuiltIn.Ref;
 		const e = String(t ?? "").toLowerCase(), r = l.findIndex((t) => t.name.toLowerCase() === e);
 		if (-1 === r) return T.BuiltIn.Ref;
-		const o = Pu(l[r].items, n);
+		const o = Lu(l[r].items, n);
 		if (-1 === o) return T.BuiltIn.Ref;
 		const u = i.get(r);
 		if (void 0 !== u && u !== o) return T.BuiltIn.Ref;
@@ -3397,24 +3402,24 @@ function Ou(t, n, e) {
 	}
 	return o.getValue(u, i) ?? T.BuiltIn.Ref;
 }
-var Fu = (t, n) => {
+var Pu = (t, n) => {
 	const e = n.toLowerCase(), r = t.getDataFields(), o = r.findIndex((t) => t.name.toLowerCase() === e);
 	return -1 !== o ? o : r.findIndex((t) => t.sourceName.toLowerCase() === e);
-}, Pu = (t, n) => {
+}, Lu = (t, n) => {
 	if ("string" == typeof n) {
 		const e = n.toLowerCase();
 		return t.findIndex((t) => (t.name ?? t.text).toLowerCase() === e);
 	}
 	return "number" == typeof n || "boolean" == typeof n ? t.findIndex((t) => t.value === n) : -1;
 };
-function Lu(t, n, e, r = !0) {
+function _u(t, n, e, r = !0) {
 	if (T.isError(t)) return t;
 	if (n.length > 1) return T.BuiltIn.NA;
 	const o = n[0];
-	if (Ai()) return T.BuiltIn.NA;
-	const u = wi(e);
+	if (wi()) return T.BuiltIn.NA;
+	const u = di(e);
 	if (u < 1) return T.BuiltIn.Value;
-	const i = u > o.getRowCount(), l = (t) => i ? T.BuiltIn.Ref : o.getValueAt(u - 1, t) ?? null, a = typeof t, s = di(t);
+	const i = u > o.getRowCount(), l = (t) => i ? T.BuiltIn.Ref : o.getValueAt(u - 1, t) ?? null, a = typeof t, s = Ei(t);
 	if (r) {
 		let n = null, e = -1, r = !0, u = !1;
 		const i = o.entries({
@@ -3430,18 +3435,18 @@ function Lu(t, n, e, r = !0) {
 				s = i.next();
 				continue;
 			}
-			const h = pi(o, t);
+			const h = Ai(o, t);
 			if (r) {
 				n = o, e = f, r = !1, h > 0 && (u = !0), s = i.next();
 				continue;
 			}
-			const g = pi(n, t);
+			const g = Ai(n, t);
 			if (h > 0 && (u = !0), g > 0 && h > 0) return T.BuiltIn.NA;
 			if (u && 0 === g && h < 0) return l(e);
 			if (null != n && h > 0 && g <= 0) return l(e);
 			n = o, e = f, s = i.next();
 		}
-		return r || pi(n, t) > 0 ? T.BuiltIn.NA : l(e);
+		return r || Ai(n, t) > 0 ? T.BuiltIn.NA : l(e);
 	}
 	if (!s) {
 		const n = o.slice({
@@ -3463,7 +3468,7 @@ function Lu(t, n, e, r = !0) {
 	}
 	return T.BuiltIn.NA;
 }
-var _u = (t, n) => {
+var Uu = (t, n) => {
 	const e = y.getEntireCoords(), r = e.rowEnd - e.rowStart + 1, o = n === V.Axis.Column;
 	let u = 0;
 	const i = t.length;
@@ -3473,10 +3478,10 @@ var _u = (t, n) => {
 	}
 	return u > r ? T.BuiltIn.Num : t.reduce((t, e) => t.concat(e, n));
 };
-function Uu(t) {
-	return _u(t, V.Axis.Column);
+function Xu(t) {
+	return Uu(t, V.Axis.Column);
 }
-function Xu(t, n) {
+function ku(t, n) {
 	const e = y.getArgs();
 	let r = n;
 	return e.getLength() < 2 ? r = void 0 : null != r && e.getKindAt(1) !== O.Omitted || (r = 0), y.createRichData("hyperlink", {
@@ -3484,7 +3489,7 @@ function Xu(t, n) {
 		friendly: r
 	});
 }
-function ku(t, n) {
+function Hu(t, n) {
 	const e = /* @__PURE__ */ new Map();
 	for (const n of t) {
 		const t = n.payload.source, r = e.get(t);
@@ -3520,7 +3525,7 @@ function ku(t, n) {
 		for (const t of r) t.reject(n);
 	});
 }
-function Hu(t, n = void 0, e = 0, r = void 0, o = void 0) {
+function Gu(t, n = void 0, e = 0, r = void 0, o = void 0) {
 	if (!t) return T.BuiltIn.Value;
 	const u = Math.trunc(e);
 	if (u < 0 || u > 3) return T.BuiltIn.Value;
@@ -3530,12 +3535,12 @@ function Hu(t, n = void 0, e = 0, r = void 0, o = void 0) {
 		if (void 0 !== r && r < 1 || void 0 !== o && o < 1) return T.BuiltIn.Value;
 		void 0 !== r && (i.height = r), void 0 !== o && (i.width = o);
 	} else if (void 0 !== r || void 0 !== o) return T.BuiltIn.Value;
-	return y.defer(ku, i) ?? T.BuiltIn.Busy;
+	return y.defer(Hu, i) ?? T.BuiltIn.Busy;
 }
-function Gu(t, n, e = void 0, r = 1) {
+function ju(t, n, e = void 0, r = 1) {
 	if (n ??= 0, n < 0 || void 0 !== e && e < 0 || r < 1) return T.BuiltIn.Value;
 	let o = H(n), u = void 0 === e ? 0 : H(e);
-	const i = wi(r);
+	const i = di(r);
 	if (i > t.length) return T.BuiltIn.Ref;
 	const l = t[i - 1];
 	if (0 === l.size && !l.isIReferenceRange) return o <= 1 && u <= 1 ? 0 : T.BuiltIn.Ref;
@@ -3563,10 +3568,10 @@ function Gu(t, n, e = void 0, r = 1) {
 		colEnd: g
 	});
 }
-function ju(t, n = !0) {
+function Yu(t, n = !0) {
 	return y.getReference(t, !n);
 }
-function Yu(t, n, e) {
+function qu(t, n, e) {
 	if (T.isError(t)) return t;
 	if (n.length > 1) return T.BuiltIn.NA;
 	const r = n[0];
@@ -3574,15 +3579,15 @@ function Yu(t, n, e) {
 	const o = r.getRowCount(), u = r.getColumnCount(), i = o > 1 && u > 1;
 	if (i && !e) {
 		if (u > o) {
-			const n = vi(t, r, !0);
+			const n = yi(t, r, !0);
 			return -1 === n ? T.BuiltIn.NA : r.getValueAt(o - 1, n) ?? null;
 		}
 		{
-			const n = vi(t, r, !1);
+			const n = yi(t, r, !1);
 			return -1 === n ? T.BuiltIn.NA : r.getValueAt(n, u - 1) ?? null;
 		}
 	}
-	const l = i ? u > o : 1 === o, a = vi(t, r, l);
+	const l = i ? u > o : 1 === o, a = yi(t, r, l);
 	return -1 === a ? T.BuiltIn.NA : e ? function(t, n, e) {
 		const r = t.getRowCount(), o = t.getColumnCount();
 		if (r > 1 && o > 1) return T.BuiltIn.NA;
@@ -3594,14 +3599,14 @@ function Yu(t, n, e) {
 		return n >= (u ? r : o) ? T.BuiltIn.NA : (u ? t.getValueAt(n, 0) : t.getValueAt(0, n)) ?? 0;
 	}(e, a, l ? u : o) : (l ? r.getValueAt(0, a) : r.getValueAt(a, 0)) ?? 0;
 }
-function qu(t, n, e = 1) {
-	if (n.length > 1 || Ai()) return T.BuiltIn.NA;
+function $u(t, n, e = 1) {
+	if (n.length > 1 || wi()) return T.BuiltIn.NA;
 	const r = 0 === e ? 0 : e > 0 ? -1 : 1, o = 0 === e ? 1 : e > 0 ? 2 : -2;
 	return Mi(t, n[0], r, o, 0 === e, !0);
 }
-function $u(t, n, e, r, o) {
+function Ku(t, n, e, r, o) {
 	n = Math.trunc(n), e = Math.trunc(e);
-	const u = t.getCoords(), [i, l] = yi(u.rowStart + n, r ?? t.getRowCount()), [a, s] = yi(u.colStart + e, o ?? t.getColumnCount());
+	const u = t.getCoords(), [i, l] = Ti(u.rowStart + n, r ?? t.getRowCount()), [a, s] = Ti(u.colStart + e, o ?? t.getColumnCount());
 	return y.getReference({
 		rowStart: i,
 		colStart: a,
@@ -3610,28 +3615,28 @@ function $u(t, n, e, r, o) {
 		scope: u.scope
 	});
 }
-function Ku(t) {
+function zu(t) {
 	if (!t || 0 === t.length) return y.getRow() + 1;
 	if (t.length > 1) return T.BuiltIn.Ref;
 	const n = [], e = t[0].getCoords(), r = e.rowStart, o = e.rowEnd;
 	for (let t = r; t <= o; t++) n.push([t + 1]);
 	return n;
 }
-function zu(t) {
+function Wu(t) {
 	return t.length > 1 ? T.BuiltIn.Ref : t[0].getRowCount();
 }
-function Wu(t, n, e) {
+function Qu(t, n, e) {
 	return T.BuiltIn.NA;
 }
-function Qu(t, n, e, r = !1) {
-	const o = Ru(t), u = o.getRowCount(), i = o.getColumnCount(), l = r ? V.Axis.Column : V.Axis.Row, a = r ? u : i, s = function(t, n) {
+function Zu(t, n, e, r = !1) {
+	const o = bu(t), u = o.getRowCount(), i = o.getColumnCount(), l = r ? V.Axis.Column : V.Axis.Row, a = r ? u : i, s = function(t, n) {
 		if (t.length > n) throw T.BuiltIn.Value;
 		return t.map((t) => {
 			const e = Math.trunc(j(t));
 			if (!(e >= 1 && e <= n)) throw T.BuiltIn.Value;
 			return e - 1;
 		});
-	}(Ju(n), a), c = ti(Ju(e), s.length), f = s.map((t) => r ? o.slice({
+	}(ti(n), a), c = ni(ti(e), s.length), f = s.map((t) => r ? o.slice({
 		rowStart: t,
 		rowEnd: t
 	}) : o.slice({
@@ -3640,18 +3645,18 @@ function Qu(t, n, e, r = !1) {
 	})), h = o.argsort(f, c, l);
 	return o.take(h, l).resize(u, i);
 }
-var Zu = Object.freeze({
+var Ju = Object.freeze({
 	includeEmpty: !0,
 	onError: "value"
 });
-function Ju(t) {
+function ti(t) {
 	if (!t) return [1];
 	if (t.getRowCount() > 1 && t.getColumnCount() > 1) throw T.BuiltIn.Value;
 	if (t.isIReferenceRange && 1 === t.getRowCount() && 1 === t.getColumnCount()) {
 		const n = t.getValueAt(0, 0);
 		if (T.isError(n)) throw n;
 	}
-	return t.getValuesFlat(Zu).map((t) => {
+	return t.getValuesFlat(Ju).map((t) => {
 		if ("number" == typeof t) return t;
 		if (null === t) return 0;
 		if ("boolean" == typeof t) return t ? 1 : 0;
@@ -3659,7 +3664,7 @@ function Ju(t) {
 		throw T.BuiltIn.Value;
 	});
 }
-function ti(t, n) {
+function ni(t, n) {
 	if (1 !== t.length && t.length !== n) throw T.BuiltIn.Value;
 	const e = t.map((t) => {
 		const n = Math.floor(t);
@@ -3668,8 +3673,8 @@ function ti(t, n) {
 	});
 	return e.length === n ? e : new Array(n).fill(e[0]);
 }
-function ni(t, n) {
-	const e = Ru(t), r = n.map(([t]) => t), o = ti(n.map(([, t]) => t ?? 1), r.length), u = e.getRowCount(), i = e.getColumnCount();
+function ei(t, n) {
+	const e = bu(t), r = n.map(([t]) => t), o = ni(n.map(([, t]) => t ?? 1), r.length), u = e.getRowCount(), i = e.getColumnCount();
 	if (1 === u && 1 === i) {
 		const t = e.getValueAt(0, 0);
 		if (T.isError(t)) return t;
@@ -3696,7 +3701,7 @@ function ni(t, n) {
 	const a = e.argsort(r, o, l);
 	return e.take(a, l).resize(u, i);
 }
-function ei(t, n, e) {
+function ri(t, n, e) {
 	const r = void 0 === n ? void 0 : Math.trunc(n), o = void 0 === e ? void 0 : Math.trunc(e);
 	if (0 === r || 0 === o) return T.BuiltIn.Calc;
 	const u = t.getRowCount(), i = t.getColumnCount(), l = void 0 === r || r >= 0 ? 0 : Math.max(0, u + r), a = void 0 === r ? u : r >= 0 ? Math.min(r, u) : u, s = void 0 === o || o >= 0 ? 0 : Math.max(0, i + o), c = void 0 === o ? i : o >= 0 ? Math.min(o, i) : i;
@@ -3707,10 +3712,10 @@ function ei(t, n, e) {
 		colEnd: c - 1
 	});
 }
-var ri = (t, n, e, r) => {
+var oi = (t, n, e, r) => {
 	const o = Math.trunc(n);
 	if (!(o >= 0 && o <= 3)) return T.BuiltIn.Value;
-	const u = r === V.Axis.Column, i = e ? gu : mu, l = [], a = t.length;
+	const u = r === V.Axis.Column, i = e ? mu : Nu, l = [], a = t.length;
 	for (let n = 0; n < a; n++) {
 		const r = t[n], u = r.getColumnCount(), a = r.getRowCount(), s = new Array(u * a).fill(null), c = r.entries(i);
 		let f = c.next();
@@ -3718,24 +3723,24 @@ var ri = (t, n, e, r) => {
 			const { value: t, coords: n } = f.value;
 			f = c.next(), s[e ? n.colIndex * a + n.rowIndex : n.rowIndex * u + n.colIndex] = t;
 		}
-		for (let t = 0; t < s.length; t++) bi(s[t], o) || l.push(s[t]);
+		for (let t = 0; t < s.length; t++) vi(s[t], o) || l.push(s[t]);
 	}
 	if (0 === l.length) return T.BuiltIn.Calc;
 	const s = t[0].empty().sparseBuilder(r);
 	for (let t = 0; t < l.length; t++) u ? s.pushAt(t, 0, l[t]) : s.pushAt(0, t, l[t]);
 	return s.build().resize(u ? l.length : 1, u ? 1 : l.length);
 };
-function oi(t, n = 0, e = !1) {
-	return ri(t, n, e, V.Axis.Column);
-}
 function ui(t, n = 0, e = !1) {
-	return ri(t, n, e, V.Axis.Row);
+	return oi(t, n, e, V.Axis.Column);
+}
+function ii(t, n = 0, e = !1) {
+	return oi(t, n, e, V.Axis.Row);
 }
-function ii(t) {
+function li(t) {
 	return t.transpose();
 }
-function li(t, n = 3, e = 3) {
-	if (!ai(n) || !ai(e)) return T.BuiltIn.Value;
+function ai(t, n = 3, e = 3) {
+	if (!si(n) || !si(e)) return T.BuiltIn.Value;
 	const r = t.getRowCount(), o = t.getColumnCount();
 	if (0 === r || 0 === o) return T.BuiltIn.Calc;
 	let u = 0, i = r - 1, l = 0, a = o - 1;
@@ -3772,20 +3777,20 @@ function li(t, n = 3, e = 3) {
 		colEnd: a
 	});
 }
-var ai = (t) => Number.isInteger(t) && t >= 0 && t <= 3;
-function si(t, n = !1, e = !1) {
-	const r = Ru(t), o = n ? V.Axis.Column : V.Axis.Row, u = r.uniqueIndices(o, e);
+var si = (t) => Number.isInteger(t) && t >= 0 && t <= 3;
+function ci(t, n = !1, e = !1) {
+	const r = bu(t), o = n ? V.Axis.Column : V.Axis.Row, u = r.uniqueIndices(o, e);
 	if (0 === u.length) throw T.BuiltIn.Calc;
 	return r.take(u, o);
 }
-function ci(t, n, e, r = !0) {
+function fi(t, n, e, r = !0) {
 	if (T.isError(t)) return t;
 	if (n.length > 1) return T.BuiltIn.NA;
 	const o = n[0];
-	if (Ai()) return T.BuiltIn.NA;
-	const u = wi(e);
+	if (wi()) return T.BuiltIn.NA;
+	const u = di(e);
 	if (u < 1) return T.BuiltIn.Value;
-	const i = u > o.getColumnCount(), l = (t) => i ? T.BuiltIn.Ref : o.getValueAt(t, u - 1) ?? null, a = typeof t, s = di(t);
+	const i = u > o.getColumnCount(), l = (t) => i ? T.BuiltIn.Ref : o.getValueAt(t, u - 1) ?? null, a = typeof t, s = Ei(t);
 	if (r) {
 		let n = null, e = -1, r = !0, u = !1;
 		const i = o.entries({
@@ -3801,18 +3806,18 @@ function ci(t, n, e, r = !0) {
 				s = i.next();
 				continue;
 			}
-			const h = pi(o, t);
+			const h = Ai(o, t);
 			if (r) {
 				n = o, e = f, r = !1, h > 0 && (u = !0), s = i.next();
 				continue;
 			}
-			const g = pi(n, t);
+			const g = Ai(n, t);
 			if (h > 0 && (u = !0), g > 0 && h > 0) return T.BuiltIn.NA;
 			if (u && 0 === g && h < 0) return l(e);
 			if (null != n && h > 0 && g <= 0) return l(e);
 			n = o, e = f, s = i.next();
 		}
-		return r || pi(n, t) > 0 ? T.BuiltIn.NA : l(e);
+		return r || Ai(n, t) > 0 ? T.BuiltIn.NA : l(e);
 	}
 	if (!s) {
 		const n = o.slice({
@@ -3834,11 +3839,11 @@ function ci(t, n, e, r = !0) {
 	}
 	return T.BuiltIn.NA;
 }
-function fi(t) {
-	return _u(t, V.Axis.Row);
+function hi(t) {
+	return Uu(t, V.Axis.Row);
 }
-var hi = (t, n, e, r) => {
-	const o = Ru(t), { rows: u, columns: i } = o.getShape();
+var gi = (t, n, e, r) => {
+	const o = bu(t), { rows: u, columns: i } = o.getShape();
 	if (u > 1 && i > 1) return T.BuiltIn.Value;
 	const l = Math.trunc(n);
 	if (!(l >= 1 && l <= 2147483647)) return T.BuiltIn.Num;
@@ -3853,13 +3858,13 @@ var hi = (t, n, e, r) => {
 	for (let t = a; t < f * s; t++) c ? h.pushAt(Math.floor(t / s), t % s, e) : h.pushAt(t % s, Math.floor(t / s), e);
 	return h.build();
 };
-function gi(t, n, e = T.BuiltIn.NA) {
-	return hi(t, n, e, V.Axis.Column);
-}
 function mi(t, n, e = T.BuiltIn.NA) {
-	return hi(t, n, e, V.Axis.Row);
+	return gi(t, n, e, V.Axis.Column);
 }
-function Ni(t, n, e, r = T.BuiltIn.NA, o = 0, u = 1) {
+function Ni(t, n, e = T.BuiltIn.NA) {
+	return gi(t, n, e, V.Axis.Row);
+}
+function Ii(t, n, e, r = T.BuiltIn.NA, o = 0, u = 1) {
 	if (![
 		0,
 		-1,
@@ -3881,13 +3886,13 @@ function Ni(t, n, e, r = T.BuiltIn.NA, o = 0, u = 1) {
 		if (1 === l.getRowCount()) s = !1;
 		else if (1 !== l.getColumnCount()) throw T.BuiltIn.Value;
 	}
-	if (null == t) a = Ci(i, o, u);
+	if (null == t) a = Si(i, o, u);
 	else if (0 !== o && 2 !== o || 1 !== u && -1 !== u) {
-		const n = i.getValuesFlat(hu), e = [], r = [];
+		const n = i.getValuesFlat(gu), e = [], r = [];
 		for (let t = 0; t < n.length; t++) null !== n[t] && void 0 !== n[t] && (e.push(n[t]), r.push(t));
-		const l = Ri(t, e, o, u);
+		const l = bi(t, e, o, u);
 		a = -1 === l ? -1 : r[l];
-	} else a = Si(i, t, -1 === u, di(t, 2 === o));
+	} else a = Ri(i, t, -1 === u, Ei(t, 2 === o));
 	if (-1 === a) return r;
 	if (a < (s ? l.getColumnCount() : l.getRowCount())) {
 		if (!0 === l.isIReferenceRange) {
@@ -3916,7 +3921,7 @@ function Ni(t, n, e, r = T.BuiltIn.NA, o = 0, u = 1) {
 	}
 	return l.getValueAt(s ? 0 : a, s ? a : 0);
 }
-function Ii(t, n, e = 0, r = 1) {
+function pi(t, n, e = 0, r = 1) {
 	return n.length > 1 ? T.BuiltIn.NA : Mi(t, n[0], e, r, 2 === e);
 }
 function Mi(t, n, e, r, o, u = !1) {
@@ -3936,16 +3941,16 @@ function Mi(t, n, e, r, o, u = !1) {
 	if (n.getColumnCount() > 1 && n.getRowCount() > 1) throw T.BuiltIn.Value;
 	if (null == t) {
 		if (u) return T.BuiltIn.NA;
-		const t = Ci(n, e, r);
+		const t = Si(n, e, r);
 		return -1 === t ? T.BuiltIn.NA : t + 1;
 	}
 	if (!(0 !== e && 2 !== e || 1 !== r && -1 !== r)) {
-		const e = Si(n, t, -1 === r, o ? di(t, !0) : null);
+		const e = Ri(n, t, -1 === r, o ? Ei(t, !0) : null);
 		return -1 === e ? T.BuiltIn.NA : e + 1;
 	}
-	const i = n.getValuesFlat(hu), l = [], a = [];
+	const i = n.getValuesFlat(gu), l = [], a = [];
 	for (let t = 0; t < i.length; t++) null !== i[t] && void 0 !== i[t] && (l.push(i[t]), a.push(t));
-	const s = !u || 2 !== r && -2 !== r ? Ri(t, l, e, r, o) : function(t, n, e) {
+	const s = !u || 2 !== r && -2 !== r ? bi(t, l, e, r, o) : function(t, n, e) {
 		const r = (e) => typeof t[e] == typeof n;
 		let o = 0, u = t.length - 1, i = -1;
 		for (; o <= u;) {
@@ -3958,9 +3963,9 @@ function Mi(t, n, e, r, o, u = !1) {
 					if (a < o) break;
 				}
 			}
-			const s = pi(t[a], n);
+			const s = Ai(t[a], n);
 			if (0 === s) {
-				for (; a + 1 < t.length && r(a + 1) && 0 === pi(t[a + 1], n);) a++;
+				for (; a + 1 < t.length && r(a + 1) && 0 === Ai(t[a + 1], n);) a++;
 				return a;
 			}
 			(e ? s < 0 : s > 0) ? (i = a, o = Math.max(l, a) + 1) : u = Math.min(l, a) - 1;
@@ -3969,32 +3974,32 @@ function Mi(t, n, e, r, o, u = !1) {
 	}(l, t, 2 === r);
 	return -1 === s ? T.BuiltIn.NA : a[s] + 1;
 }
-function pi(t, n) {
+function Ai(t, n) {
 	return "number" == typeof t && "number" == typeof n ? t < n ? -1 : t > n ? 1 : 0 : y.compare(t, n);
 }
-function Ai() {
+function wi() {
 	const t = y.getArgs().getKindAt(1);
 	return t !== O.Reference && t !== O.Array;
 }
-function wi(t) {
+function di(t) {
 	return Number.isFinite(t) ? Math.trunc(0 === t ? 0 : Number(t.toPrecision(15))) : t;
 }
-function di(t, n = !1) {
+function Ei(t, n = !1) {
 	return "string" != typeof t ? null : (n ? /[*?~]/.test(t) : F.isWildCard(t)) ? F.toRegex(t, "i", !0) : null;
 }
-function Ei(t, n, e, r) {
+function Bi(t, n, e, r) {
 	let o = 0, u = t.length - 1, i = -1, l = -1;
 	for (; o <= u;) {
-		const e = o + u >>> 1, a = null === n ? Bi(t[e]) : pi(t[e], n);
+		const e = o + u >>> 1, a = null === n ? Ci(t[e]) : Ai(t[e], n);
 		0 === a ? (i = e, r ? u = e - 1 : o = e + 1) : (r ? a < 0 : a > 0) ? (l = e, o = e + 1) : u = e - 1;
 	}
 	return -1 !== i ? i : 0 === e || 2 === e ? -1 : (r ? -1 === e : 1 === e) ? l : l + 1 < t.length ? l + 1 : -1;
 }
-function Bi(t) {
+function Ci(t) {
 	return null == t ? 0 : -1;
 }
-function Ci(t, n, e) {
-	if (2 === e || -2 === e) return Ei(t.getValuesFlat(hu), null, n, 2 === e);
+function Si(t, n, e) {
+	if (2 === e || -2 === e) return Bi(t.getValuesFlat(gu), null, n, 2 === e);
 	const r = -1 === e, o = 1 === t.getRowCount(), u = t.entries({
 		axis: o ? V.Axis.Row : V.Axis.Column,
 		includeEmpty: !0,
@@ -4004,11 +4009,11 @@ function Ci(t, n, e) {
 	for (; !a.done;) {
 		const { value: t, coords: e } = a.value, r = o ? e.colIndex : e.rowIndex;
 		if (null == t) return r;
-		-1 === n && (-1 === i || pi(t, l) > 0) && (i = r, l = t), a = u.next();
+		-1 === n && (-1 === i || Ai(t, l) > 0) && (i = r, l = t), a = u.next();
 	}
 	return i;
 }
-function Si(t, n, e, r) {
+function Ri(t, n, e, r) {
 	if (null === r) return t.indexOf(n, { reverse: e });
 	const o = 1 === t.getRowCount(), u = t.entries({
 		axis: o ? V.Axis.Row : V.Axis.Column,
@@ -4018,14 +4023,14 @@ function Si(t, n, e, r) {
 	let i = u.next();
 	for (; !i.done;) {
 		const { value: t, coords: e } = i.value;
-		if (null != t && (r ? "string" == typeof t && r.test(t) : 0 === pi(t, n))) return o ? e.colIndex : e.rowIndex;
+		if (null != t && (r ? "string" == typeof t && r.test(t) : 0 === Ai(t, n))) return o ? e.colIndex : e.rowIndex;
 		i = u.next();
 	}
 	return -1;
 }
-function Ri(t, n, e, r, o = 2 === e) {
-	const u = o ? di(t, !0) : null;
-	if (2 === r || -2 === r) return Ei(n, t, e, 2 === r);
+function bi(t, n, e, r, o = 2 === e) {
+	const u = o ? Ei(t, !0) : null;
+	if (2 === r || -2 === r) return Bi(n, t, e, 2 === r);
 	const i = -1 === r ? -1 : 1, l = -1 === r ? n.length - 1 : 0, a = -1 === r ? -1 : n.length;
 	if (0 === e || 2 === e) {
 		for (let e = l; e !== a; e += i) {
@@ -4033,7 +4038,7 @@ function Ri(t, n, e, r, o = 2 === e) {
 			if (null != r) {
 				if (u) {
 					if ("string" == typeof r && u.test(r)) return e;
-				} else if (0 === pi(r, t)) return e;
+				} else if (0 === Ai(r, t)) return e;
 			}
 		}
 		return -1;
@@ -4042,16 +4047,16 @@ function Ri(t, n, e, r, o = 2 === e) {
 	for (let r = l; r !== a; r += i) {
 		const o = n[r];
 		if (null == o) continue;
-		const u = pi(o, t);
+		const u = Ai(o, t);
 		if (0 === u) return r;
-		-1 === e ? u < 0 && (-1 === s || pi(o, c) > 0) && (s = r, c = o) : u > 0 && (-1 === s || pi(o, c) < 0) && (s = r, c = o);
+		-1 === e ? u < 0 && (-1 === s || Ai(o, c) > 0) && (s = r, c = o) : u > 0 && (-1 === s || Ai(o, c) < 0) && (s = r, c = o);
 	}
 	return s;
 }
-function bi(t, n) {
+function vi(t, n) {
 	return 0 !== n && ((1 === n || 3 === n) && null === t || !(2 !== n && 3 !== n || !T.isError(t)));
 }
-function vi(t, n, e) {
+function yi(t, n, e) {
 	const r = typeof t;
 	let o = -1, u = null, i = !1;
 	const l = e ? V.Axis.Row : V.Axis.Column, a = n.entries({
@@ -4074,20 +4079,20 @@ function vi(t, n, e) {
 			s = a.next();
 			continue;
 		}
-		const f = pi(n, t);
+		const f = Ai(n, t);
 		if (f > 0 && (i = !0), f <= 0) {
-			const e = null !== u && 0 === pi(u, t);
+			const e = null !== u && 0 === Ai(u, t);
 			i && e || (o = c, u = n);
 		}
 		s = a.next();
 	}
 	return o;
 }
-var yi = (t, n) => {
+var Ti = (t, n) => {
 	if (0 === n) throw T.BuiltIn.Ref;
 	const e = Math.trunc(n), r = n > 0 ? t : t + e + 1, o = n > 0 ? t + e - 1 : t;
 	return r > o ? [o, r] : [r, o];
-}, Ti = (t) => {
+}, Vi = (t) => {
 	const n = t.length, e = t.map((t) => [...t]), r = Array.from({ length: n }, (t, n) => n);
 	let o = 1;
 	for (let t = 0; t < n; t++) {
@@ -4112,7 +4117,7 @@ var yi = (t, n) => {
 		singular: !1
 	};
 };
-function Vi(t, n, e, r, o, u) {
+function xi(t, n, e, r, o, u) {
 	const i = n.map((t) => t[0]), l = i[0].getColumnCount(), a = i[0].getRowCount();
 	for (let t = 1; t < i.length; t++) if (i[t].getColumnCount() !== l || i[t].getRowCount() !== a) throw T.BuiltIn.Value;
 	if (r && (r.getColumnCount() !== l || r.getRowCount() !== a)) throw T.BuiltIn.Value;
@@ -4132,98 +4137,98 @@ function Vi(t, n, e, r, o, u) {
 	}, null, f && u ? { emptyFold: u } : void 0);
 	return null !== N ? N : o;
 }
-function xi(t) {
+function Di(t) {
 	return (n, e) => T.isError(n) ? n : T.isError(e) ? e : t(n, e);
 }
-function Di(t) {
+function Oi(t) {
 	const n = t.getCode();
 	return n === T.Code.Null || n === T.Code.GettingData ? T.BuiltIn.Num : t;
 }
-function Oi(t) {
+function Fi(t) {
 	const n = t.firstError();
-	return 1 === t.size && t.isIReferenceRange ? n : Di(n);
+	return 1 === t.size && t.isIReferenceRange ? n : Oi(n);
 }
-var Fi = (t) => {
+var Pi = (t) => {
 	let n = 1;
 	for (let e = t; e >= 2; e--) n *= e;
 	return n;
-}, Pi = (t, n) => {
+}, Li = (t, n) => {
 	const e = Math.min(n, t - n);
 	let r = 1;
 	for (let n = 1; n <= e; n++) if (r = r / n * (t - e + n), !Number.isFinite(r)) return NaN;
 	return r;
-}, Li = U({
-	ABS: () => _i,
-	AGGREGATE: () => Xi,
-	ARABIC: () => ki,
-	BASE: () => Hi,
-	CEILING: () => Gi,
-	CEILING_MATH: () => ji,
-	CEILING_PRECISE: () => Yi,
-	COMBIN: () => $i,
-	COMBINA: () => Ki,
-	DECIMAL: () => zi,
-	DEGREES: () => Wi,
-	ECMA_CEILING: () => qi,
-	EVEN: () => Qi,
-	EXP: () => Zi,
-	FACT: () => Ji,
-	FACTDOUBLE: () => tl,
-	FLOOR: () => nl,
-	FLOOR_MATH: () => el,
-	FLOOR_PRECISE: () => rl,
-	GCD: () => ol,
-	INT: () => ul,
-	ISO_CEILING: () => il,
-	LCM: () => ll,
-	LN: () => al,
-	LOG: () => sl,
-	LOG10: () => cl,
-	MDETERM: () => hl,
-	MINVERSE: () => gl,
-	MMULT: () => ml,
-	MOD: () => Nl,
-	MROUND: () => pl,
-	MULTINOMIAL: () => Al,
-	MUNIT: () => wl,
-	ODD: () => dl,
-	PERCENTOF: () => El,
-	PI: () => Bl,
-	POWER: () => Sl,
-	PRODUCT: () => Rl,
-	QUOTIENT: () => bl,
-	RADIANS: () => vl,
-	RAND: () => yl,
-	RANDARRAY: () => Tl,
-	RANDBETWEEN: () => Vl,
-	ROMAN: () => xl,
-	ROUND: () => Dl,
-	ROUNDDOWN: () => Ol,
-	ROUNDUP: () => Fl,
-	SEQUENCE: () => Ll,
-	SERIESSUM: () => _l,
-	SIGN: () => Xl,
-	SQRT: () => kl,
-	SQRTPI: () => Hl,
-	SUBTOTAL: () => Gl,
-	SUM: () => jl,
-	SUMIF: () => Yl,
-	SUMIFS: () => ql,
-	SUMPRODUCT: () => $l,
-	SUMSQ: () => Kl,
-	SUMX2MY2: () => zl,
-	SUMX2PY2: () => Wl,
-	SUMXMY2: () => Ql,
-	TRUNC: () => Zl
+}, _i = U({
+	ABS: () => Ui,
+	AGGREGATE: () => ki,
+	ARABIC: () => Hi,
+	BASE: () => Gi,
+	CEILING: () => ji,
+	CEILING_MATH: () => Yi,
+	CEILING_PRECISE: () => qi,
+	COMBIN: () => Ki,
+	COMBINA: () => zi,
+	DECIMAL: () => Wi,
+	DEGREES: () => Qi,
+	ECMA_CEILING: () => $i,
+	EVEN: () => Zi,
+	EXP: () => Ji,
+	FACT: () => tl,
+	FACTDOUBLE: () => nl,
+	FLOOR: () => el,
+	FLOOR_MATH: () => rl,
+	FLOOR_PRECISE: () => ol,
+	GCD: () => ul,
+	INT: () => il,
+	ISO_CEILING: () => ll,
+	LCM: () => al,
+	LN: () => sl,
+	LOG: () => cl,
+	LOG10: () => fl,
+	MDETERM: () => gl,
+	MINVERSE: () => ml,
+	MMULT: () => Nl,
+	MOD: () => Il,
+	MROUND: () => Al,
+	MULTINOMIAL: () => wl,
+	MUNIT: () => dl,
+	ODD: () => El,
+	PERCENTOF: () => Bl,
+	PI: () => Cl,
+	POWER: () => Rl,
+	PRODUCT: () => bl,
+	QUOTIENT: () => vl,
+	RADIANS: () => yl,
+	RAND: () => Tl,
+	RANDARRAY: () => Vl,
+	RANDBETWEEN: () => xl,
+	ROMAN: () => Dl,
+	ROUND: () => Ol,
+	ROUNDDOWN: () => Fl,
+	ROUNDUP: () => Pl,
+	SEQUENCE: () => _l,
+	SERIESSUM: () => Ul,
+	SIGN: () => kl,
+	SQRT: () => Hl,
+	SQRTPI: () => Gl,
+	SUBTOTAL: () => jl,
+	SUM: () => Yl,
+	SUMIF: () => ql,
+	SUMIFS: () => $l,
+	SUMPRODUCT: () => Kl,
+	SUMSQ: () => zl,
+	SUMX2MY2: () => Wl,
+	SUMX2PY2: () => Ql,
+	SUMXMY2: () => Zl,
+	TRUNC: () => Jl
 });
-function _i(t) {
+function Ui(t) {
 	return Math.abs(t);
 }
-var Ui = (t, n, e) => {
+var Xi = (t, n, e) => {
 	const r = t.length;
 	return 0 === r || n < 1 || n > r ? T.BuiltIn.Num : t[Math.trunc(e ? r - n : n - 1)];
 };
-function Xi(t, n, e, ...r) {
+function ki(t, n, e, ...r) {
 	const o = y.getArgs().getAreaCountAt(2) > 1;
 	e = y.flattenAreas(e);
 	const u = Math.trunc(t), i = Math.trunc(n);
@@ -4262,7 +4267,7 @@ function Xi(t, n, e, ...r) {
 	else if (2 !== u && 3 !== u) {
 		for (const t of m) if (t.hasError()) return t.firstError();
 	}
-	const N = m.reduce((t, n) => t.concat(n, V.Axis.Row, null)), I = N.getStats().getAggregates(), M = () => N.getStats().getSortedNumbers();
+	const N = m.reduce((t, n) => t.concat(n, V.Axis.Row, null)), I = N.getStats().getAggregates(), p = () => N.getStats().getSortedNumbers();
 	switch (u) {
 		case 1: {
 			const t = I.numericalCount ?? 0;
@@ -4292,7 +4297,7 @@ function Xi(t, n, e, ...r) {
 		case 11:
 			if ((I.numericalCount ?? 0) < 1) throw T.BuiltIn.Div0;
 			return I.varP;
-		case 12: return M().getPercentile(.5) ?? T.BuiltIn.Num;
+		case 12: return p().getPercentile(.5) ?? T.BuiltIn.Num;
 		case 13: {
 			const t = N.getStats().getFrequencies({ filterFn: (t) => "number" == typeof t }).getValueCounts({
 				sortBy: "frequency",
@@ -4300,33 +4305,33 @@ function Xi(t, n, e, ...r) {
 			}).next();
 			return t.done || t.value[1] < 2 ? T.BuiltIn.NA : t.value[0];
 		}
-		case 14: return Ui(M().getValues(), f, !0);
-		case 15: return Ui(M().getValues(), f, !1);
-		case 16: return M().getPercentile(f) ?? T.BuiltIn.Num;
-		case 17: return M().getPercentile(Math.trunc(f) / 4) ?? T.BuiltIn.Num;
-		case 18: return M().getPercentile(f, !0) ?? T.BuiltIn.Num;
-		case 19: return M().getPercentile(Math.trunc(f) / 4, !0) ?? T.BuiltIn.Num;
+		case 14: return Xi(p().getValues(), f, !0);
+		case 15: return Xi(p().getValues(), f, !1);
+		case 16: return p().getPercentile(f) ?? T.BuiltIn.Num;
+		case 17: return p().getPercentile(Math.trunc(f) / 4) ?? T.BuiltIn.Num;
+		case 18: return p().getPercentile(f, !0) ?? T.BuiltIn.Num;
+		case 19: return p().getPercentile(Math.trunc(f) / 4, !0) ?? T.BuiltIn.Num;
 		default: return T.BuiltIn.Value;
 	}
 }
-function ki(t) {
-	if (t.length > ia) throw new T.Value("Roman numeral too long in ARABIC evaluation.");
+function Hi(t) {
+	if (t.length > la) throw new T.Value("Roman numeral too long in ARABIC evaluation.");
 	const n = t.replace(/^[ \t\n\r]+|[ \t\n\r]+$/g, ""), e = n.startsWith("-"), r = e ? n.slice(1) : n;
 	if (e && "" === r) throw T.BuiltIn.Num;
 	let o = 0, u = 0;
 	for (let t = r.length - 1; t >= 0; t--) {
-		const n = ua[r[t].toUpperCase()];
+		const n = ia[r[t].toUpperCase()];
 		if (void 0 === n) throw new T.Value("Invalid roman numeral in ARABIC evaluation.");
 		n < u ? o -= n : (o += n, u = n);
 	}
 	return e ? -o : o;
 }
-function Hi(t, n, e = 1) {
+function Gi(t, n, e = 1) {
 	if (t < 0 || e < 0) return NaN;
 	const r = Math.trunc(t), o = Math.trunc(n), u = Math.trunc(e);
-	return r >= 2 ** 53 || o < 2 || o > 36 || u > ia ? NaN : (0 === r ? "" : r.toString(o).toUpperCase()).padStart(u, "0");
+	return r >= 2 ** 53 || o < 2 || o > 36 || u > la ? NaN : (0 === r ? "" : r.toString(o).toUpperCase()).padStart(u, "0");
 }
-function Gi(t, n) {
+function ji(t, n) {
 	if (0 === n) return 0;
 	if (0 === X(n)) throw T.BuiltIn.Div0;
 	if (t > 0 && n < 0) return NaN;
@@ -4335,33 +4340,33 @@ function Gi(t, n) {
 	const o = Math.floor(r);
 	return t < 0 ? n < 0 ? -e * (o + 1) : -e * o : (o + 1) * e;
 }
-function ji(t, n, e = 0) {
+function Yi(t, n, e = 0) {
 	if (0 === (n = Math.abs(n ?? 1))) return 0;
-	const r = Gi(t, n);
+	const r = ji(t, n);
 	return t >= 0 || !e || r === t ? r : r - n;
 }
-function Yi(t, n = 1) {
-	return 0 === n ? 0 : Gi(t, Math.abs(n));
-}
-function qi(t, n) {
-	return Gi(t, n);
+function qi(t, n = 1) {
+	return 0 === n ? 0 : ji(t, Math.abs(n));
 }
 function $i(t, n) {
+	return ji(t, n);
+}
+function Ki(t, n) {
 	if (t < 0 || n < 0) return NaN;
 	const e = Math.trunc(t), r = Math.trunc(n);
-	return e > 2147483646 || e < r ? NaN : Pi(e, r);
+	return e > 2147483646 || e < r ? NaN : Li(e, r);
 }
-function Ki(t, n) {
+function zi(t, n) {
 	const e = Math.trunc(t), r = Math.trunc(n);
 	if (0 === r && (0 === e || 1 === e)) return 1;
 	if (t < 0 || n < 0) return NaN;
 	const o = e + r - 1;
-	return o > 2147483646 || o < r ? NaN : Pi(o, r);
+	return o > 2147483646 || o < r ? NaN : Li(o, r);
 }
-function zi(t, n) {
+function Wi(t, n) {
 	const e = Math.trunc(n);
 	if (e < 2 || e > 36) return NaN;
-	if (t.length > ia) throw T.BuiltIn.Value;
+	if (t.length > la) throw T.BuiltIn.Value;
 	let r = t.replace(/^[ \t]+/, "");
 	if (16 === e) {
 		const t = r.search(/[xX]/);
@@ -4375,29 +4380,29 @@ function zi(t, n) {
 	}
 	return o;
 }
-function Wi(t) {
+function Qi(t) {
 	return t * (180 / Math.PI);
 }
-function Qi(t) {
+function Zi(t) {
 	let n = Math.ceil(Math.abs(t));
 	return n = 1 & n ? n + 1 : n, t < 0 ? -n : n;
 }
-function Zi(t) {
+function Ji(t) {
 	return Math.exp(t);
 }
-function Ji(t) {
+function tl(t) {
 	if (t < 0) return NaN;
 	const n = Math.trunc(j(t));
-	return n > 170 ? NaN : Fi(n);
+	return n > 170 ? NaN : Pi(n);
 }
-function tl(t) {
+function nl(t) {
 	const n = Ml(t);
 	if (n < -1) return NaN;
 	let e = 1;
 	for (let t = Math.trunc(n); t > 1; t -= 2) if (e *= t, !Number.isFinite(e)) return NaN;
 	return e;
 }
-function nl(t, n) {
+function el(t, n) {
 	if (0 === t) return 0;
 	if (0 === n) throw T.BuiltIn.Div0;
 	if (0 === X(n)) throw T.BuiltIn.Div0;
@@ -4407,88 +4412,88 @@ function nl(t, n) {
 	const o = Math.floor(r);
 	return t < 0 ? n < 0 ? -e * o : -e * (o + 1) : o * e;
 }
-function el(t, n = t > 0 ? 1 : -1, e = 0) {
+function rl(t, n = t > 0 ? 1 : -1, e = 0) {
 	if (0 === n) return 0;
-	const r = Math.abs(n), o = nl(t, r);
+	const r = Math.abs(n), o = el(t, r);
 	return t >= 0 || !e || o === t ? o : o + r;
 }
-function rl(t, n = 1) {
-	return 0 === n ? 0 : nl(t, Math.abs(n));
+function ol(t, n = 1) {
+	return 0 === n ? 0 : el(t, Math.abs(n));
 }
-function ol(t) {
-	sa(t);
+function ul(t) {
+	ca(t);
 	let n, e = t[0];
-	if (e < 0 || e > ma) return NaN;
+	if (e < 0 || e > Na) return NaN;
 	e = Math.abs(Math.trunc(e));
 	const r = t.length;
 	for (let o = 1; o < r; o++) {
-		if (n = t[o], n < 0 || n > ma) return NaN;
+		if (n = t[o], n < 0 || n > Na) return NaN;
 		for (n = Math.abs(Math.trunc(n)); e && n;) e > n ? e %= n : n %= e;
 		e += n;
 	}
 	return e;
 }
-function ul(t) {
+function il(t) {
 	const n = Math.round(t);
 	return j(t) === j(n) ? n : Math.floor(t);
 }
-function il(t, n = 1) {
-	return Yi(t, n);
+function ll(t, n = 1) {
+	return qi(t, n);
 }
-function ll(t) {
-	sa(t);
+function al(t) {
+	ca(t);
 	let n, e, r, o = t[0];
-	if (o < 0 || o > ma) return NaN;
+	if (o < 0 || o > Na) return NaN;
 	o = Math.abs(Math.trunc(o));
 	const u = t.length;
 	for (let i = 1; i < u; i++) {
 		const u = t[i];
-		if (u < 0 || u > ma) return NaN;
+		if (u < 0 || u > Na) return NaN;
 		if (n = Math.abs(Math.trunc(u)), 0 !== o && 0 !== n) {
 			for (e = o, r = n; e && r;) e > r ? e %= r : r %= e;
-			if (o = o / (e + r) * n, o > ma) return NaN;
+			if (o = o / (e + r) * n, o > Na) return NaN;
 		} else o = 0;
 	}
 	return o;
 }
-function al(t) {
+function sl(t) {
 	return t <= 0 ? NaN : Math.log(t);
 }
-function sl(t, n) {
+function cl(t, n) {
 	if (t <= 0) return NaN;
 	if (void 0 === n) return Math.log10(t);
 	if (1 === n) throw T.BuiltIn.Div0;
 	return n <= 0 ? NaN : Math.log(t) / Math.log(n);
 }
-function cl(t) {
+function fl(t) {
 	return t <= 0 ? NaN : Math.log10(t);
 }
-var fl = (t) => {
+var hl = (t) => {
 	const n = t.getValues();
 	for (const t of n) for (const n of t) if ("number" != typeof n) return T.isError(n) ? n : T.BuiltIn.Value;
 	return n;
 };
-function hl(t) {
+function gl(t) {
 	if (t.hasError()) return t.firstError();
 	const { rows: n, columns: e } = t.getShape();
 	if (n !== e) return T.BuiltIn.Value;
-	const r = fl(t);
+	const r = hl(t);
 	return Array.isArray(r) ? ((t) => {
-		const { lu: n, sign: e, singular: r } = Ti(t);
+		const { lu: n, sign: e, singular: r } = Vi(t);
 		if (r) return 0;
 		let o = e;
 		for (let t = 0; t < n.length; t++) o = X(o * n[t][t]);
 		return Number.isFinite(o) ? o : NaN;
 	})(r) : r;
 }
-function gl(t) {
+function ml(t) {
 	if (t.hasError()) return t.firstError();
 	const { rows: n, columns: e } = t.getShape();
 	if (n !== e) return T.BuiltIn.Value;
-	const r = fl(t);
+	const r = hl(t);
 	if (!Array.isArray(r)) return r;
 	const o = ((t) => {
-		const n = t.length, { lu: e, perm: r, singular: o } = Ti(t);
+		const n = t.length, { lu: e, perm: r, singular: o } = Vi(t);
 		if (o) return null;
 		const u = Array.from({ length: n }, () => new Array(n).fill(0));
 		for (let t = 0; t < n; t++) {
@@ -4508,10 +4513,10 @@ function gl(t) {
 	})(r);
 	return null === o ? T.BuiltIn.Num : o;
 }
-function ml(t, n) {
-	const e = fl(t);
+function Nl(t, n) {
+	const e = hl(t);
 	if (!Array.isArray(e)) return e;
-	const r = fl(n);
+	const r = hl(n);
 	if (!Array.isArray(r)) return r;
 	const { rows: o, columns: u } = t.getShape(), { rows: i, columns: l } = n.getShape();
 	if (u !== i) return T.BuiltIn.Value;
@@ -4527,14 +4532,14 @@ function ml(t, n) {
 	}
 	return a;
 }
-function Nl(t, n) {
+function Il(t, n) {
 	if (0 === X(n)) throw T.BuiltIn.Div0;
 	if (0 !== t && 0 === X(t)) return NaN;
-	if (Math.abs(t / n) > Il) return NaN;
+	if (Math.abs(t / n) > pl) return NaN;
 	let e = t % n;
 	return 0 !== e && e < 0 != n < 0 && (e += n), e === n ? 0 : e;
 }
-var Il = 1099511627776;
+var pl = 1099511627776;
 function Ml(t) {
 	if (void 0 === t) throw T.BuiltIn.NA;
 	if (null === t) return 0;
@@ -4542,7 +4547,7 @@ function Ml(t) {
 	if (T.isError(t)) throw t;
 	return y.parseAsNumber(t);
 }
-function pl(t, n) {
+function Al(t, n) {
 	const e = Ml(t), r = Ml(n);
 	if (0 === r) return 0;
 	if (e > 0 && r < 0 || e < 0 && r > 0) return NaN;
@@ -4551,8 +4556,8 @@ function pl(t, n) {
 	const u = Math.floor(o);
 	return (o - u >= .499999999999995 ? u + 1 : u) * r;
 }
-function Al(t) {
-	sa(t);
+function wl(t) {
+	ca(t);
 	const n = [];
 	let e = 0;
 	const r = t.length;
@@ -4564,10 +4569,10 @@ function Al(t) {
 	}
 	if (e > 170) return NaN;
 	let o = 1;
-	for (let t = 0; t < n.length; t++) o *= Fi(n[t]);
-	return Fi(e) / o;
+	for (let t = 0; t < n.length; t++) o *= Pi(n[t]);
+	return Pi(e) / o;
 }
-function wl(t) {
+function dl(t) {
 	const n = Math.trunc(t);
 	if (n <= 0) return T.BuiltIn.Value;
 	const e = y.getEntireCoords();
@@ -4576,12 +4581,12 @@ function wl(t) {
 	for (let t = 0; t < n; t++) r.pushAt(t, t, 1);
 	return r.build();
 }
-function dl(t) {
+function El(t) {
 	if (0 === t) return 1;
 	let n = Math.ceil(Math.abs(t));
 	return n = 1 & n ? n : n + 1, t > 0 ? n : -n;
 }
-function El(t, n) {
+function Bl(t, n) {
 	t = y.flattenAreas(t), n = y.flattenAreas(n);
 	const e = y.getArgs(), r = [t, n];
 	for (let t = 0; t < 2; t++) if (r[t].hasError()) {
@@ -4592,41 +4597,41 @@ function El(t, n) {
 	if (0 === X(u)) throw T.BuiltIn.Div0;
 	return X(o / u);
 }
-function Bl() {
+function Cl() {
 	return Math.PI;
 }
-var Cl = 4294967294;
-function Sl(t, n) {
+var Sl = 4294967294;
+function Rl(t, n) {
 	if (0 === t) {
 		if (n < 0) throw T.BuiltIn.Div0;
 		if (0 === n) return NaN;
 	}
 	return t < 0 ? function(t, n) {
-		if (Number.isInteger(n) && Math.abs(n) <= Cl) return t ** n;
+		if (Number.isInteger(n) && Math.abs(n) <= Sl) return t ** n;
 		const e = Number((1 / n).toPrecision(15));
 		return Number.isInteger(e) && 1 === Math.abs(e % 2) ? -((-t) ** n) : NaN;
 	}(t, n) : t ** n;
 }
-function Rl(t) {
+function bl(t) {
 	let n = 0, e = !1;
 	for (const r of t) for (const t of r.values()) n = e ? X(n * t) : t, e = !0;
 	return e ? n : 0;
 }
-function bl(t, n) {
+function vl(t, n) {
 	const e = Ml(t), r = Ml(n);
 	if (0 === r) throw T.BuiltIn.Div0;
 	return Math.trunc(e / r);
 }
-function vl(t) {
+function yl(t) {
 	return t * (Math.PI / 180);
 }
-function yl() {
+function Tl() {
 	return y.getRandom();
 }
-function Tl(t = 1, n = 1, e = 0, r = 1, o = !1) {
-	const u = Pl(t);
+function Vl(t = 1, n = 1, e = 0, r = 1, o = !1) {
+	const u = Ll(t);
 	if ("number" != typeof u) return u;
-	const i = Pl(n);
+	const i = Ll(n);
 	if ("number" != typeof i) return i;
 	const l = !0 === o;
 	return e > r ? T.BuiltIn.Value : !l || e === Math.trunc(e) && r === Math.trunc(r) ? y.createRange(u, i, () => {
@@ -4635,39 +4640,39 @@ function Tl(t = 1, n = 1, e = 0, r = 1, o = !1) {
 		return t > r ? r : t;
 	}) : T.BuiltIn.Value;
 }
-function Vl(t, n) {
+function xl(t, n) {
 	const e = Ml(n), r = Ml(t);
 	if (r > e) return NaN;
 	const o = Math.ceil(X(r)), u = Math.ceil(X(e));
 	return o + Math.floor(y.getRandom() * (u - o + 1));
 }
-function xl(t, n = 0) {
+function Dl(t, n = 0) {
 	const e = "boolean" == typeof n ? n ? 0 : 4 : Math.trunc(null === n ? 0 : y.parseAsNumber(n));
 	if ((t = Math.trunc(t)) < 0 || t > 3999) return T.BuiltIn.Value;
 	if (e < 0 || e > 4) return T.BuiltIn.Value;
 	if (0 === t) return "";
 	let r = t, o = "";
-	for (let t = 0; t <= oa / 2; t++) {
+	for (let t = 0; t <= ua / 2; t++) {
 		let n = 2 * t;
-		const u = Math.floor(r / ra[n]);
+		const u = Math.floor(r / oa[n]);
 		if (u % 5 == 4) {
 			let t = 4 === u ? n - 1 : n - 2, i = 0;
-			for (; i < e && n < oa;) i++, ra[t] - ra[n + 1] <= r ? n++ : i = e;
-			o += ea[n] + ea[t], r = r + ra[n] - ra[t];
+			for (; i < e && n < ua;) i++, oa[t] - oa[n + 1] <= r ? n++ : i = e;
+			o += ra[n] + ra[t], r = r + oa[n] - oa[t];
 		} else {
-			u > 4 && (o += ea[n - 1], r -= ra[n - 1]);
-			let t = Math.floor(r / ra[n]);
-			for (r -= t * ra[n]; t > 0; t--) o += ea[n];
+			u > 4 && (o += ra[n - 1], r -= oa[n - 1]);
+			let t = Math.floor(r / oa[n]);
+			for (r -= t * oa[n]; t > 0; t--) o += ra[n];
 		}
 	}
 	return o;
 }
-function Dl(t, n) {
+function Ol(t, n) {
 	const e = H(n);
-	if (e >= ta) return 0;
+	if (e >= na) return 0;
 	const r = t > 0 ? 1 : -1, o = Math.abs(t);
 	if (0 === e) return r * Math.round(j(o));
-	const u = na(e);
+	const u = ea(e);
 	if (void 0 === u) return e > 0 ? t : 0;
 	if (e > 0) {
 		const n = j(j(o) * u);
@@ -4675,10 +4680,10 @@ function Dl(t, n) {
 	}
 	return r * Math.round(j(o / u)) * u;
 }
-function Ol(t, n) {
-	const e = Jl(n), r = t > 0 ? 1 : -1, o = Math.abs(t);
+function Fl(t, n) {
+	const e = ta(n), r = t > 0 ? 1 : -1, o = Math.abs(t);
 	if (0 === e) return r * Math.floor(j(o));
-	const u = na(e);
+	const u = ea(e);
 	if (void 0 === u) return e > 0 ? t : 0;
 	if (e > 0) {
 		const n = j(j(o) * u);
@@ -4686,22 +4691,22 @@ function Ol(t, n) {
 	}
 	return r * Math.floor(j(o / u)) * u;
 }
-function Fl(t, n) {
-	const e = Jl(n), r = Ol(t, e);
+function Pl(t, n) {
+	const e = ta(n), r = Fl(t, e);
 	if (r === j(t)) return r;
 	const o = r + Math.sign(t) * Math.pow(10, -e);
 	return Number.isFinite(o) ? o : NaN;
 }
-var Pl = (t) => {
+var Ll = (t) => {
 	if (t <= -1.1920928955078125e-7) return T.BuiltIn.Value;
 	const n = Math.trunc(j(t));
 	return n <= 0 ? T.BuiltIn.Calc : n > y.getEntireCoords().rowEnd + 1 ? T.BuiltIn.Value : n;
 };
-function Ll(t, n = 1, e = 1, r = 1) {
+function _l(t, n = 1, e = 1, r = 1) {
 	t ??= 1;
-	const o = Pl(t);
+	const o = Ll(t);
 	if ("number" != typeof o) return o;
-	const u = Pl(n);
+	const u = Ll(n);
 	if ("number" != typeof u) return u;
 	let i = e;
 	return y.createRange(o, u, () => {
@@ -4709,43 +4714,43 @@ function Ll(t, n = 1, e = 1, r = 1) {
 		return i += r, t;
 	});
 }
-function _l(t, n, e, r) {
+function Ul(t, n, e, r) {
 	const o = Ml(t), u = Ml(n), i = Ml(e);
 	if (void 0 === r) throw T.BuiltIn.NA;
 	if (T.isError(r)) throw r;
 	const l = y.getArgs().getRawAt(3), a = l, s = !0 === a?.isIRange, c = s && 1 === a.size && !0 === a.isIReferenceRange;
 	if (!s || c) {
 		const t = s ? a.getValueAt(0, 0) ?? null : l;
-		return (null === t ? 0 : y.parseAsNumber(t)) * Ul(o, u);
+		return (null === t ? 0 : y.parseAsNumber(t)) * Xl(o, u);
 	}
 	let f = 0, h = 0;
-	for (const t of r.values(ga)) if (null !== t) {
+	for (const t of r.values(ma)) if (null !== t) {
 		if (T.isError(t)) throw t;
 		if ("number" != typeof t) throw T.BuiltIn.Value;
-		f += t * Ul(o, u + h * i), h++;
+		f += t * Xl(o, u + h * i), h++;
 	}
 	return f;
 }
-var Ul = (t, n) => {
+var Xl = (t, n) => {
 	if (0 === t && n <= 0) throw T.BuiltIn.Num;
 	const e = Math.pow(t, n);
 	if (Number.isNaN(e)) return 0;
 	if (!Number.isFinite(e)) throw T.BuiltIn.Num;
 	return e;
 };
-function Xl(t) {
+function kl(t) {
 	const n = X(t);
 	return n > 0 ? 1 : 0 === n ? 0 : -1;
 }
-function kl(t) {
+function Hl(t) {
 	return Math.sqrt(t);
 }
-function Hl(t) {
+function Gl(t) {
 	const n = Ml(t);
 	return n < 0 ? NaN : Math.sqrt(n * Math.PI);
 }
-function Gl(t, n) {
-	const e = Math.trunc(t), r = e >= 101, o = r ? e - 100 : e, u = r ? void 0 : ha;
+function jl(t, n) {
+	const e = Math.trunc(t), r = e >= 101, o = r ? e - 100 : e, u = r ? void 0 : ga;
 	let i = n.map((t) => y.filterHidden(t, u)).map((t) => y.filterTotals(t));
 	if (2 !== o && 3 !== o) {
 		for (const t of i) if (t.hasError()) return t.firstError();
@@ -4783,7 +4788,7 @@ function Gl(t, n) {
 		default: return T.BuiltIn.Value;
 	}
 }
-function jl(t) {
+function Yl(t) {
 	let n = 0, e = null;
 	for (const r of t) {
 		const t = r.getStats(), o = t.getAggregates();
@@ -4791,13 +4796,13 @@ function jl(t) {
 	}
 	return e ? e.getSnappedSum(n) : n;
 }
-function Yl(t, n, e) {
-	return Xo(t, n, e, xi((t, n) => (null === t && (t = 0), "number" != typeof n ? t : t + n)), Ho);
+function ql(t, n, e) {
+	return ko(t, n, e, Di((t, n) => (null === t && (t = 0), "number" != typeof n ? t : t + n)), Go);
 }
-function ql(t, n) {
-	return Vi(y, n, xi((t, n) => "number" != typeof n ? t : null === t ? n : t + n), t, 0, Ho);
+function $l(t, n) {
+	return xi(y, n, Di((t, n) => "number" != typeof n ? t : null === t ? n : t + n), t, 0, Go);
 }
-function $l(t) {
+function Kl(t) {
 	const n = y.getArgs().getRepeatingArgsAt(0);
 	for (let t = 0, e = n.getLength(); t < e; t++) {
 		const e = n.getRawAt(t);
@@ -4818,26 +4823,26 @@ function $l(t) {
 		for (const n of e.values()) "number" == typeof n && (t += n);
 		return t;
 	}
-	return aa(e, r, la);
+	return sa(e, r, aa);
 }
-function Kl(t) {
+function zl(t) {
 	let n = 0;
 	for (const e of t) for (const t of e.values()) n += X(t ** 2);
 	return n;
 }
-function zl(t, n) {
-	return fa(t, n, (t, n) => X(t ** 2) - X(n ** 2));
-}
 function Wl(t, n) {
-	return fa(t, n, (t, n) => X(t ** 2) + X(n ** 2));
+	return ha(t, n, (t, n) => X(t ** 2) - X(n ** 2));
 }
 function Ql(t, n) {
-	return fa(t, n, (t, n) => X((t - n) ** 2));
+	return ha(t, n, (t, n) => X(t ** 2) + X(n ** 2));
 }
-function Zl(t, n = 0) {
-	const e = Jl(n);
+function Zl(t, n) {
+	return ha(t, n, (t, n) => X((t - n) ** 2));
+}
+function Jl(t, n = 0) {
+	const e = ta(n);
 	if (0 === e) return Math.trunc(j(t));
-	const r = na(e);
+	const r = ea(e);
 	if (void 0 === r) return e > 0 ? t : 0;
 	if (e > 0) {
 		const n = j(j(t) * r);
@@ -4845,10 +4850,10 @@ function Zl(t, n = 0) {
 	}
 	return Math.trunc(j(t / r)) * r;
 }
-var Jl = (t) => Math.trunc(t), ta = 2147483646, na = (t) => {
+var ta = (t) => Math.trunc(t), na = 2147483646, ea = (t) => {
 	const n = Math.pow(10, Math.abs(t));
 	return Number.isFinite(n) ? n : void 0;
-}, ea = [
+}, ra = [
 	"M",
 	"D",
 	"C",
@@ -4856,7 +4861,7 @@ var Jl = (t) => Math.trunc(t), ta = 2147483646, na = (t) => {
 	"X",
 	"V",
 	"I"
-], ra = [
+], oa = [
 	1e3,
 	500,
 	100,
@@ -4864,246 +4869,246 @@ var Jl = (t) => Math.trunc(t), ta = 2147483646, na = (t) => {
 	10,
 	5,
 	1
-], oa = ra.length - 1, ua = Object.fromEntries(ea.map((t, n) => [t, ra[n]])), ia = 255, la = (t) => {
+], ua = oa.length - 1, ia = Object.fromEntries(ra.map((t, n) => [t, oa[n]])), la = 255, aa = (t) => {
 	let n = t[0];
 	const e = t.length;
 	for (let r = 1; r < e; r++) n = X(n * t[r]);
 	return n;
-}, aa = (t, n, e) => t.alignReduce(n, (t, n) => {
+}, sa = (t, n, e) => t.alignReduce(n, (t, n) => {
 	const r = n.length;
 	for (let e = 0; e < r; e++) if ("number" != typeof n[e]) return t;
 	return t + e(n);
-}, 0), sa = (t) => {
+}, 0), ca = (t) => {
 	if (y.getArgs().getRepeatingArgsAt(0).getKindAt(0) === O.Omitted) throw T.BuiltIn.NA;
 	if (0 === t.length) throw T.BuiltIn.Value;
-}, ca = (t, n) => {
+}, fa = (t, n) => {
 	if (1 !== t.getRowCount() || 1 !== t.getColumnCount()) return;
 	if (y.getArgs().getKindAt(n) === O.Array) return;
 	const e = t.getValueAt(0, 0);
 	if (null === e) throw T.BuiltIn.Value;
 	if (T.isError(e)) throw e;
-}, fa = (t, n, e) => {
-	ca(t, 0), ca(n, 1);
+}, ha = (t, n, e) => {
+	fa(t, 0), fa(n, 1);
 	const r = t.getRowCount(), o = t.getColumnCount();
 	if (r * o !== n.getRowCount() * n.getColumnCount()) throw T.BuiltIn.NA;
 	r === n.getRowCount() && o === n.getColumnCount() || (n = n.reshape(r, o));
-	for (const n of t.values(ga)) if (T.isError(n)) throw Di(n);
-	for (const t of n.values(ga)) if (T.isError(t)) throw Di(t);
+	for (const n of t.values(ma)) if (T.isError(n)) throw Oi(n);
+	for (const t of n.values(ma)) if (T.isError(t)) throw Oi(t);
 	let u = 0;
 	const i = t.alignReduce([n], (t, n) => "number" != typeof n[0] || "number" != typeof n[1] ? t : (u++, t + e(n[0], n[1])), 0);
 	if (0 === u) throw T.BuiltIn.Div0;
 	return i;
-}, ha = { onlyWhileFiltered: !0 }, ga = { axis: V.Axis.Row }, ma = 9007199254740992, Na = U({
-	ACOS: () => Ia,
+}, ga = { onlyWhileFiltered: !0 }, ma = { axis: V.Axis.Row }, Na = 9007199254740992, Ia = U({
+	ACOS: () => pa,
 	ACOSH: () => Ma,
-	ACOT: () => pa,
-	ACOTH: () => Aa,
-	ASIN: () => wa,
-	ASINH: () => da,
-	ATAN: () => Ea,
-	ATAN2: () => Ba,
-	ATANH: () => Ca,
-	COS: () => Sa,
-	COSH: () => Ra,
-	COT: () => ba,
-	COTH: () => va,
-	CSC: () => ya,
-	CSCH: () => Ta,
-	SEC: () => Va,
-	SECH: () => xa,
-	SIN: () => Da,
-	SINH: () => Oa,
-	TAN: () => Fa,
-	TANH: () => Pa
+	ACOT: () => Aa,
+	ACOTH: () => wa,
+	ASIN: () => da,
+	ASINH: () => Ea,
+	ATAN: () => Ba,
+	ATAN2: () => Ca,
+	ATANH: () => Sa,
+	COS: () => Ra,
+	COSH: () => ba,
+	COT: () => va,
+	COTH: () => ya,
+	CSC: () => Ta,
+	CSCH: () => Va,
+	SEC: () => xa,
+	SECH: () => Da,
+	SIN: () => Oa,
+	SINH: () => Fa,
+	TAN: () => Pa,
+	TANH: () => La
 });
-function Ia(t) {
+function pa(t) {
 	return t > 1 || t < -1 ? NaN : Math.PI / 2 - Math.asin(t);
 }
 function Ma(t) {
 	return t < 1 ? NaN : Math.log(t + Math.sqrt(t * t - 1));
 }
-function pa(t) {
+function Aa(t) {
 	const n = Math.atan(X(1 / t));
 	return t < 0 ? Math.PI + n : n;
 }
-function Aa(t) {
+function wa(t) {
 	return Math.abs(t) <= 1 ? NaN : Math.abs(t) <= 2 ? Math.log((t + 1) / (t - 1)) / 2 : G(X(1 / t));
 }
-function wa(t) {
+function da(t) {
 	return t > 1 || t < -1 ? NaN : Math.asin(t);
 }
-function da(t) {
+function Ea(t) {
 	const n = Math.abs(t), e = Math.log(n + Math.sqrt(n * n + 1));
 	return t < 0 ? -e : e;
 }
-function Ea(t) {
+function Ba(t) {
 	return Math.atan(t);
 }
-function Ba(t, n) {
+function Ca(t, n) {
 	if (0 === n && 0 === t) throw T.BuiltIn.Div0;
 	const e = n / t;
 	if (0 !== t && !Number.isFinite(e)) return NaN;
 	const r = Math.atan(e);
 	return t >= 0 ? r : n >= 0 ? r + Math.PI : r - Math.PI;
 }
-function Ca(t) {
-	return Math.abs(t) >= 1 ? NaN : G(t);
-}
 function Sa(t) {
-	return Math.abs(t) >= ye ? NaN : Pe(t);
+	return Math.abs(t) >= 1 ? NaN : G(t);
 }
 function Ra(t) {
-	return Number.isFinite(Math.exp(Math.abs(t))) ? Math.cosh(t) : NaN;
+	return Math.abs(t) >= Te ? NaN : Le(t);
 }
 function ba(t) {
-	if (Math.abs(t) >= ye) return NaN;
-	if (0 === t) throw T.BuiltIn.Div0;
-	return 1 / Le(t);
+	return Number.isFinite(Math.exp(Math.abs(t))) ? Math.cosh(t) : NaN;
 }
 function va(t) {
+	if (Math.abs(t) >= Te) return NaN;
 	if (0 === t) throw T.BuiltIn.Div0;
-	return X(1 / Math.tanh(t));
+	return 1 / _e(t);
 }
 function ya(t) {
-	if (Math.abs(t) >= ye) return NaN;
 	if (0 === t) throw T.BuiltIn.Div0;
-	return 1 / Fe(t);
+	return X(1 / Math.tanh(t));
 }
 function Ta(t) {
+	if (Math.abs(t) >= Te) return NaN;
 	if (0 === t) throw T.BuiltIn.Div0;
-	return X(1 / Math.sinh(t));
+	return 1 / Pe(t);
 }
 function Va(t) {
-	return Math.abs(t) >= ye ? NaN : 1 / Pe(t);
+	if (0 === t) throw T.BuiltIn.Div0;
+	return X(1 / Math.sinh(t));
 }
 function xa(t) {
-	return X(1 / Math.cosh(t));
+	return Math.abs(t) >= Te ? NaN : 1 / Le(t);
 }
 function Da(t) {
-	return Math.abs(t) >= ye ? NaN : Fe(t);
+	return X(1 / Math.cosh(t));
 }
 function Oa(t) {
-	return Number.isFinite(Math.exp(Math.abs(t))) ? Math.sinh(t) : NaN;
+	return Math.abs(t) >= Te ? NaN : Pe(t);
 }
 function Fa(t) {
-	return Math.abs(t) >= ye ? NaN : Le(t);
+	return Number.isFinite(Math.exp(Math.abs(t))) ? Math.sinh(t) : NaN;
 }
 function Pa(t) {
-	return Math.tanh(t);
+	return Math.abs(t) >= Te ? NaN : _e(t);
 }
-var La = U({
-	ADD: () => Ua,
-	DIVIDE: () => Xa,
-	EQ: () => ka,
-	GT: () => Ha,
-	GTE: () => Ga,
-	ISBETWEEN: () => Ja,
-	LT: () => ja,
-	LTE: () => Ya,
-	MINUS: () => qa,
-	MULTIPLY: () => $a,
-	NE: () => Ka,
-	POW: () => za,
-	UMINUS: () => Wa,
-	UNARY_PERCENT: () => Qa,
-	UPLUS: () => Za
-}), _a = (t) => t > -22250738585072014e-324 && t < 22250738585072014e-324 ? 0 : t;
-function Ua(t, n) {
-	return t + n;
+function La(t) {
+	return Math.tanh(t);
 }
+var _a = U({
+	ADD: () => Xa,
+	DIVIDE: () => ka,
+	EQ: () => Ha,
+	GT: () => Ga,
+	GTE: () => ja,
+	ISBETWEEN: () => ts,
+	LT: () => Ya,
+	LTE: () => qa,
+	MINUS: () => $a,
+	MULTIPLY: () => Ka,
+	NE: () => za,
+	POW: () => Wa,
+	UMINUS: () => Qa,
+	UNARY_PERCENT: () => Za,
+	UPLUS: () => Ja
+}), Ua = (t) => t > -22250738585072014e-324 && t < 22250738585072014e-324 ? 0 : t;
 function Xa(t, n) {
-	if (0 === _a(n)) throw T.BuiltIn.Div0;
-	return _a(t / n);
+	return t + n;
 }
 function ka(t, n) {
-	return 0 === y.compare(t, n);
+	if (0 === Ua(n)) throw T.BuiltIn.Div0;
+	return Ua(t / n);
 }
 function Ha(t, n) {
-	return y.compare(t, n) > 0;
+	return 0 === y.compare(t, n);
 }
 function Ga(t, n) {
-	return y.compare(t, n) >= 0;
+	return y.compare(t, n) > 0;
 }
 function ja(t, n) {
-	return y.compare(t, n) < 0;
+	return y.compare(t, n) >= 0;
 }
 function Ya(t, n) {
-	return y.compare(t, n) <= 0;
+	return y.compare(t, n) < 0;
 }
 function qa(t, n) {
-	return t - n;
+	return y.compare(t, n) <= 0;
 }
 function $a(t, n) {
-	return _a(t * n);
+	return t - n;
 }
 function Ka(t, n) {
-	return 0 !== y.compare(t, n);
+	return Ua(t * n);
 }
 function za(t, n) {
+	return 0 !== y.compare(t, n);
+}
+function Wa(t, n) {
 	if (0 === t) {
 		if (n < 0) throw T.BuiltIn.Div0;
 		if (0 === n) return NaN;
 	}
 	if (t < 0) {
-		if (Number.isInteger(n) && Math.abs(n) <= 4294967294) return _a(t ** n);
+		if (Number.isInteger(n) && Math.abs(n) <= 4294967294) return Ua(t ** n);
 		const e = Number((1 / n).toPrecision(15));
-		return Number.isInteger(e) && 1 === Math.abs(e % 2) ? _a(-((-t) ** n)) : NaN;
+		return Number.isInteger(e) && 1 === Math.abs(e % 2) ? Ua(-((-t) ** n)) : NaN;
 	}
-	return _a(t ** n);
-}
-function Wa(t) {
-	return -1 * t;
+	return Ua(t ** n);
 }
 function Qa(t) {
-	return Xa(t, 100);
+	return -1 * t;
 }
 function Za(t) {
+	return ka(t, 100);
+}
+function Ja(t) {
 	return t;
 }
-function Ja(t, n, e, r = !0, o = !0) {
+function ts(t, n, e, r = !0, o = !0) {
 	return (r ? t >= n : t > n) && (o ? t <= e : t < e);
 }
-var ts = (t) => !!t.isIReferenceRange, ns = (t) => Object.freeze({ coerce: (n, e, r, o) => {
-	const u = ts(o);
+var ns = (t) => !!t.isIReferenceRange, es = (t) => Object.freeze({ coerce: (n, e, r, o) => {
+	const u = ns(o);
 	if (e === D.String) return u ? 0 : t;
 	if (e === D.Boolean) return u ? n ? 1 : 0 : null;
 	if (T.isError(n)) throw n;
 	return null;
-} }), es = ns(null), rs = ns(0), os = (t, n) => {
+} }), rs = es(null), os = es(0), us = (t, n) => {
 	if ("number" == typeof t) return t;
 	if ("boolean" == typeof t) return n ? t ? 1 : 0 : null;
 	if ("string" == typeof t) return n ? 0 : null;
 	if (T.isError(t)) throw t;
 	return null;
-}, us = U({
-	AVEDEV: () => is,
-	AVERAGE: () => ls,
-	AVERAGEA: () => as,
-	AVERAGEIF: () => ss,
-	AVERAGEIFS: () => cs,
-	AVERAGE_WEIGHTED: () => fs,
-	COUNT: () => hs,
-	COUNTA: () => gs,
-	COUNTBLANK: () => ms,
-	COUNTIF: () => Ns,
-	COUNTIFS: () => Is,
+}, is = U({
+	AVEDEV: () => ls,
+	AVERAGE: () => as,
+	AVERAGEA: () => ss,
+	AVERAGEIF: () => cs,
+	AVERAGEIFS: () => fs,
+	AVERAGE_WEIGHTED: () => hs,
+	COUNT: () => gs,
+	COUNTA: () => ms,
+	COUNTBLANK: () => Ns,
+	COUNTIF: () => Is,
+	COUNTIFS: () => ps,
 	COUNTUNIQUE: () => Ms,
-	COUNTUNIQUEIFS: () => ps,
-	LARGE: () => As,
-	MAX: () => ws,
-	MAXA: () => ds,
-	MAXIF: () => Es,
-	MAXIFS: () => Bs,
-	MEDIAN: () => Cs,
-	MIN: () => Ss,
-	MINA: () => Rs,
-	MINIF: () => bs,
-	MINIFS: () => vs,
-	PERMUT: () => ys,
-	PERMUTATIONA: () => Ts,
-	SMALL: () => Vs
+	COUNTUNIQUEIFS: () => As,
+	LARGE: () => ws,
+	MAX: () => ds,
+	MAXA: () => Es,
+	MAXIF: () => Bs,
+	MAXIFS: () => Cs,
+	MEDIAN: () => Ss,
+	MIN: () => Rs,
+	MINA: () => bs,
+	MINIF: () => vs,
+	MINIFS: () => ys,
+	PERMUT: () => Ts,
+	PERMUTATIONA: () => Vs,
+	SMALL: () => xs
 });
-function is(t) {
+function ls(t) {
 	let n = 0;
 	const e = [];
 	for (const r of t) for (const t of r.values()) n += t, e.push(t);
@@ -5114,21 +5119,21 @@ function is(t) {
 	for (let t = 0; t < r; t++) n += Math.abs(e[t] - o);
 	return n / r;
 }
-function ls(t) {
-	return Os(t);
-}
 function as(t) {
-	return Os(t, rs);
+	return Fs(t);
 }
-function ss(t, n, e) {
-	const r = Xo(t, n, e, (t, n) => "number" != typeof n ? t : t + 1, Ho), o = Xo(t, n, e, xi((t, n) => (null === t && (t = 0), "number" != typeof n ? t : t + n)), Ho);
+function ss(t) {
+	return Fs(t, os);
+}
+function cs(t, n, e) {
+	const r = ko(t, n, e, (t, n) => "number" != typeof n ? t : t + 1, Go), o = ko(t, n, e, Di((t, n) => (null === t && (t = 0), "number" != typeof n ? t : t + n)), Go);
 	return T.isError(o) ? o : r ? o / r : T.BuiltIn.Div0;
 }
-function cs(t, n) {
-	const e = Vi(y, n, xi((t, n) => "number" != typeof n ? t : null === t ? n : t + n), t, null, Ho), r = Vi(y, n, (t, n) => "number" != typeof n ? t : null === t ? 1 : t + 1, t, 0, Ho);
+function fs(t, n) {
+	const e = xi(y, n, Di((t, n) => "number" != typeof n ? t : null === t ? n : t + n), t, null, Go), r = xi(y, n, (t, n) => "number" != typeof n ? t : null === t ? 1 : t + 1, t, 0, Go);
 	return T.isError(e) ? e : 0 === r || null === r ? T.BuiltIn.Div0 : e / r;
 }
-function fs(t) {
+function hs(t) {
 	let n = 0, e = 0;
 	const r = t.length;
 	for (let o = 0; o < r; o++) {
@@ -5144,12 +5149,12 @@ function fs(t) {
 	if (0 === e) throw T.BuiltIn.Div0;
 	return n / e;
 }
-function hs(t) {
+function gs(t) {
 	let n = 0;
 	for (const e of t) T.isError(e) || (n += e.getStats().getAggregates().numericalCount ?? 0);
 	return n;
 }
-function gs(t) {
+function ms(t) {
 	const n = y.getArgs().getRepeatingArgsAt(0);
 	let e = 0;
 	for (let r = 0; r < t.length; r++) {
@@ -5162,28 +5167,28 @@ function gs(t) {
 	}
 	return e;
 }
-function ms(t) {
+function Ns(t) {
 	if (y.getArgs().getAreaCountAt(0) > 1) return T.BuiltIn.Value;
 	let n = 0;
 	for (const { value: e } of t.entries({ includeEmpty: !1 })) "" !== e && n++;
 	return t.getColumnCount() * t.getRowCount() - n;
 }
-function Ns(t, n) {
-	return Xo(t, n, void 0, (t) => null === t ? 1 : t + 1, ko);
+function Is(t, n) {
+	return ko(t, n, void 0, (t) => null === t ? 1 : t + 1, Ho);
 }
-function Is(t) {
-	return Vi(y, t, (t) => null === t ? 1 : t + 1, void 0, 0, ko);
+function ps(t) {
+	return xi(y, t, (t) => null === t ? 1 : t + 1, void 0, 0, Ho);
 }
 function Ms(t) {
 	const n = /* @__PURE__ */ new Set(), e = t.length;
 	for (let r = 0; r < e; r++) {
 		const e = t[r];
-		if (T.isError(e)) n.add(xs(e));
-		else for (const t of e.values()) n.add(xs(t));
+		if (T.isError(e)) n.add(Ds(e));
+		else for (const t of e.values()) n.add(Ds(t));
 	}
 	return n.size;
 }
-function ps(t, n) {
+function As(t, n) {
 	const e = t.getRowCount(), r = t.getColumnCount(), o = n.length, u = new Array(o), i = new Array(o);
 	for (let t = 0; t < o; t++) {
 		const o = n[t][0];
@@ -5195,26 +5200,26 @@ function ps(t, n) {
 		const e = n[0];
 		if (null === e) return t;
 		for (let e = 0; e < o; e++) if (!i[e](n[e + 1])) return t;
-		return l.add(xs(e)), t;
+		return l.add(Ds(e)), t;
 	}, null), l.size;
 }
-function As(t, n) {
+function ws(t, n) {
 	const e = y.flattenAreas(t).getStats().getSortedNumbers().getLarge(n);
 	return null === e ? NaN : e;
 }
-function ws(t) {
-	return Ds(t, !0);
-}
 function ds(t) {
-	return Ds(t, !0, es);
+	return Os(t, !0);
 }
-function Es(t, n, e) {
-	return Xo(t, n, e, xi((t, n) => "number" != typeof n ? t ?? 0 : null === t ? n : Math.max(t, n)), Ho);
+function Es(t) {
+	return Os(t, !0, rs);
 }
-function Bs(t, n) {
-	return Vi(y, n, xi((t, n) => "number" != typeof n ? t : null === t ? n : Math.max(t, n)), t, 0, Ho);
+function Bs(t, n, e) {
+	return ko(t, n, e, Di((t, n) => "number" != typeof n ? t ?? 0 : null === t ? n : Math.max(t, n)), Go);
 }
-function Cs(t) {
+function Cs(t, n) {
+	return xi(y, n, Di((t, n) => "number" != typeof n ? t : null === t ? n : Math.max(t, n)), t, 0, Go);
+}
+function Ss(t) {
 	const n = [];
 	for (const e of t) for (const t of e.values()) n.push(t);
 	if (0 === n.length) return NaN;
@@ -5226,37 +5231,37 @@ function Cs(t) {
 	}
 	return n[Math.floor(e / 2)];
 }
-function Ss(t) {
-	return Ds(t, !1);
-}
 function Rs(t) {
-	return Ds(t, !1, es);
+	return Os(t, !1);
 }
-function bs(t, n, e) {
-	return Xo(t, n, e, xi((t, n) => "number" != typeof n ? t ?? 0 : null === t ? n : Math.min(t, n)), Ho);
+function bs(t) {
+	return Os(t, !1, rs);
 }
-function vs(t, n) {
-	return Vi(y, n, xi((t, n) => "number" != typeof n ? t : null === t ? n : Math.min(t, n)), t, 0, Ho);
+function vs(t, n, e) {
+	return ko(t, n, e, Di((t, n) => "number" != typeof n ? t ?? 0 : null === t ? n : Math.min(t, n)), Go);
 }
 function ys(t, n) {
+	return xi(y, n, Di((t, n) => "number" != typeof n ? t : null === t ? n : Math.min(t, n)), t, 0, Go);
+}
+function Ts(t, n) {
 	if (t = Math.trunc(t), n = Math.trunc(n), t < 0 || n < 0 || n > t) return NaN;
 	if (t > 2147483646) return NaN;
 	let e = 1;
 	for (let r = t; r > t - n; r--) if (e *= r, !Number.isFinite(e)) return NaN;
 	return e;
 }
-function Ts(t, n) {
+function Vs(t, n) {
 	return t = Math.trunc(t), n = Math.trunc(n), t < 0 || n < 0 || t > 2147483646 || n > 2147483646 ? NaN : Math.pow(t, n);
 }
-function Vs(t, n) {
+function xs(t, n) {
 	const e = (t = y.flattenAreas(t)).getStats().getSortedNumbers().getSmall(n);
 	return null === e ? NaN : e;
 }
-var xs = (t) => {
+var Ds = (t) => {
 	if (null === t) return "\0";
 	const n = typeof t;
 	return "number" === n ? "
" + t.toString() : "string" === n ? "" + t : "boolean" === n ? "" + (t ? "1" : "0") : T.isError(t) ? "" + t.getCode() : "" + String(t);
-}, Ds = (t, n, e) => {
+}, Os = (t, n, e) => {
 	let r = 0, o = !1;
 	for (const u of t) {
 		const t = u.getStats(e).getAggregates();
@@ -5265,7 +5270,7 @@ var xs = (t) => {
 		r = o ? n ? Math.max(r, i) : Math.min(r, i) : i, o = !0;
 	}
 	return o ? r : 0;
-}, Os = (t, n) => {
+}, Fs = (t, n) => {
 	let e = 0, r = 0, o = null;
 	for (const u of t) {
 		const t = u.getStats(n), i = t.getAggregates();
@@ -5273,63 +5278,55 @@ var xs = (t) => {
 	}
 	if (0 === r) throw T.BuiltIn.Div0;
 	return (o ? o.getSnappedSum(e) : e) / r;
-}, Fs = (t, n, e) => Math.exp(-.5 * Math.log(2 * Math.PI) - Math.log(e) - Math.pow(t - n, 2) / (2 * e * e)), Ps = (t, n, e) => .5 * ce(-(t - n) / Math.sqrt(2 * e * e)), Ls = (t, n, e) => -1.4142135623730951 * e * fe(2 * t) + n;
-function _s(t, n, e) {
+}, Ps = (t, n, e) => Math.exp(-.5 * Math.log(2 * Math.PI) - Math.log(e) - Math.pow(t - n, 2) / (2 * e * e)), Ls = (t, n, e) => .5 * fe(-(t - n) / Math.sqrt(2 * e * e)), _s = (t, n, e) => -1.4142135623730951 * e * he(2 * t) + n;
+function Us(t, n, e) {
 	return t < 0 ? 0 : 0 === t && 1 === n ? 1 / e : n >= 30 ? Math.exp(function(t, n) {
 		const e = n / t - 1;
-		return -t * e * e * (1 + me(e) * e) / 2 - Math.log1p(e) - .5 * Math.log(t) - .5 * Math.log(2 * Math.PI) - ue(t);
-	}(n, t / e)) / e : Math.exp((n - 1) * Math.log(t) - t / e - ne(n) - n * Math.log(e));
+		return -t * e * e * (1 + Ne(e) * e) / 2 - Math.log1p(e) - .5 * Math.log(t) - .5 * Math.log(2 * Math.PI) - ie(t);
+	}(n, t / e)) / e : Math.exp((n - 1) * Math.log(t) - t / e - ee(n) - n * Math.log(e));
 }
-function Us(t, n) {
-	return t < 0 ? 1 : ((t, n) => Ne(t, n, !0))(n / 2, t / 2);
+function Xs(t, n) {
+	return t < 0 ? 1 : ((t, n) => Ie(t, n, !0))(n / 2, t / 2);
 }
-var Xs = (t, n) => 2 * Ie(t, .5 * n);
-function ks(t, n, e) {
+var ks = (t, n) => 2 * pe(t, .5 * n);
+function Hs(t, n, e) {
 	if (t < 0) return 0;
 	const r = n * t + e;
-	return Ae(n * t / r, e / r, n / 2, e / 2);
+	return we(n * t / r, e / r, n / 2, e / 2);
 }
-var Hs = (t, n, e) => e / (n * (1 / de(t, n / 2, e / 2) - 1));
-function Gs(t, n) {
+var Gs = (t, n, e) => e / (n * (1 / Ee(t, n / 2, e / 2) - 1));
+function js(t, n) {
 	if (!Number.isFinite(t * t)) return NaN;
-	const e = .5 * js(t, n);
+	const e = .5 * Ys(t, n);
 	return t > 0 ? e : 1 - e;
 }
-function js(t, n) {
+function Ys(t, n) {
 	const e = n + t * t;
-	return Ae(n / e, t * t / e, n / 2, .5);
+	return we(n / e, t * t / e, n / 2, .5);
 }
-function Ys(t, n) {
-	let e = de(2 * Math.min(t, 1 - t), .5 * n, .5);
+function qs(t, n) {
+	let e = Ee(2 * Math.min(t, 1 - t), .5 * n, .5);
 	return e = Math.sqrt(n * (1 - e) / e), t > .5 ? e : -e;
 }
-var qs = 1e5;
-function $s(t, n) {
+var $s = 1e5;
+function Ks(t, n) {
 	if (n < 0 || t % 1 != 0 || t < 0) return 0;
-	const e = t <= 170 ? Math.pow(n, t) * Math.exp(-n) / Fi(t) : 1 / 0;
-	return Number.isFinite(e) ? e : 0 === n ? 0 === t ? 1 : 0 : Math.exp(t * Math.log(n) - n - ne(t + 1));
+	const e = t <= 170 ? Math.pow(n, t) * Math.exp(-n) / Pi(t) : 1 / 0;
+	return Number.isFinite(e) ? e : 0 === n ? 0 === t ? 1 : 0 : Math.exp(t * Math.log(n) - n - ee(t + 1));
 }
-var Ks = (t, n, e) => {
+var zs = (t, n, e) => {
 	if (0 === e || 1 === e) return n * e === t ? 1 : 0;
-	const r = Pi(n, t) * Math.pow(e, t) * Math.pow(1 - e, n - t);
-	return Number.isFinite(r) ? r : Math.exp(ne(n + 1) - ne(t + 1) - ne(n - t + 1) + t * Math.log(e) + (n - t) * Math.log(1 - e));
+	const r = Li(n, t) * Math.pow(e, t) * Math.pow(1 - e, n - t);
+	return Number.isFinite(r) ? r : Math.exp(ee(n + 1) - ee(t + 1) - ee(n - t + 1) + t * Math.log(e) + (n - t) * Math.log(1 - e));
 };
-function zs(t, n, e) {
-	let r;
-	const o = 1e-10;
-	if (t < 0) return 0;
-	if (t >= n) return 1;
-	if (e < 0 || e > 1 || n <= 0) return NaN;
-	const u = e, i = (t = Math.floor(t)) + 1, l = n - t, a = i + l, s = Math.exp(ne(a) - ne(l) - ne(i) + i * Math.log(u) + l * Math.log(1 - u));
-	return r = u < (i + 1) / (a + 2) ? s * Qs(u, i, l, o) : 1 - s * Qs(1 - u, l, i, o), Math.round(1 / o * (1 - r)) / (1 / o);
-}
 function Ws(t, n, e) {
-	return t !== t >>> 0 || t < 0 ? 0 : Pi(t + n - 1, n - 1) * Math.pow(1 - e, t) * Math.pow(e, n);
+	return t < 0 ? 0 : t >= n ? 1 : e < 0 || e > 1 || n <= 0 ? NaN : 0 === e ? 1 : 1 === e ? 0 : we(1 - e, e, n - (t = Math.floor(t)), t + 1);
 }
-function Qs(t, n, e, r) {
-	let o, u = 0, i = 1, l = 1, a = 1, s = 0, c = 0;
-	for (; Math.abs((l - c) / l) > r;) c = l, o = -(n + s) * (n + e + s) * t / (n + 2 * s) / (n + 2 * s + 1), u = l + o * u, i = a + o * i, s += 1, o = s * (e - s) * t / (n + 2 * s - 1) / (n + 2 * s), l = u + o * l, a = i + o * a, u /= a, i /= a, l /= a, a = 1;
-	return l / n;
+function Qs(t, n, e) {
+	if (t !== t >>> 0) return 0;
+	if (t < 0) return 0;
+	const r = Li(t + n - 1, n - 1) * Math.pow(1 - e, t) * Math.pow(e, n);
+	return Number.isFinite(r) ? r : Math.exp(ee(t + n) - ee(t + 1) - ee(n) + t * Math.log1p(-e) + n * Math.log(e));
 }
 var Zs = U({
 	BETADIST: () => lc,
@@ -5343,8 +5340,8 @@ var Zs = U({
 	CHIDIST: () => Ic,
 	CHIINV: () => Ac,
 	CHISQ_DIST: () => Nc,
-	CHISQ_DIST_RT: () => Mc,
-	CHISQ_INV: () => pc,
+	CHISQ_DIST_RT: () => pc,
+	CHISQ_INV: () => Mc,
 	CHISQ_INV_RT: () => wc,
 	CHISQ_TEST: () => dc,
 	CHITEST: () => Ec,
@@ -5393,8 +5390,8 @@ var Zs = U({
 	MODE: () => gf,
 	MODE_MULT: () => Nf,
 	MODE_SNGL: () => If,
-	NEGBINOMDIST: () => pf,
-	NEGBINOM_DIST: () => Mf,
+	NEGBINOMDIST: () => Mf,
+	NEGBINOM_DIST: () => pf,
 	NORMDIST: () => wf,
 	NORMINV: () => Ef,
 	NORMSDIST: () => Cf,
@@ -5443,11 +5440,11 @@ var Zs = U({
 	VAR: () => mh,
 	VARA: () => Ih,
 	VARP: () => hh,
-	VARPA: () => Mh,
+	VARPA: () => ph,
 	VAR_P: () => fh,
 	VAR_S: () => gh,
 	WEIBULL: () => Ah,
-	WEIBULL_DIST: () => ph,
+	WEIBULL_DIST: () => Mh,
 	ZTEST: () => dh,
 	Z_TEST: () => wh
 }), Js = 1e10, tc = 22250738585072014e-324, nc = (t) => ((t) => {
@@ -5465,28 +5462,28 @@ var Zs = U({
 }, oc = 2 ** -22, uc = (t, n, e) => {
 	let r = 0, o = Math.floor(t);
 	for (; r < o;) {
-		const u = r + Math.floor((o - r) / 2), i = zs(u, t, n) > e, l = i ? r : u + 1, a = i ? u : o;
+		const u = r + Math.floor((o - r) / 2), i = Ws(u, t, n) > e, l = i ? r : u + 1, a = i ? u : o;
 		if (l === r && a === o) break;
 		r = l, o = a;
 	}
-	return zs(r, t, n) > e ? r : NaN;
+	return Ws(r, t, n) > e ? r : NaN;
 };
 function ic(t, n, e, r, o = 0, u = 1) {
-	return n <= 0 || e <= 0 || t < o || t > u || o === u ? NaN : (t = (t - o) / (u - o), r ? ((t, n, e) => t > 1 || t < 0 ? t > 1 ? 1 : 0 : pe(t, n, e))(t, n, e) : function(t, n, e) {
-		return t > 1 || t < 0 ? 0 : 1 === n && 1 === e ? 1 : n < 512 && e < 512 ? Math.pow(t, n - 1) * Math.pow(1 - t, e - 1) / re(n, e) : Math.exp((n - 1) * Math.log(t) + (e - 1) * Math.log(1 - t) - ie(n, e));
+	return n <= 0 || e <= 0 || t < o || t > u || o === u ? NaN : (t = (t - o) / (u - o), r ? ((t, n, e) => t > 1 || t < 0 ? t > 1 ? 1 : 0 : Ae(t, n, e))(t, n, e) : function(t, n, e) {
+		return t > 1 || t < 0 ? 0 : 1 === n && 1 === e ? 1 : n < 512 && e < 512 ? Math.pow(t, n - 1) * Math.pow(1 - t, e - 1) / oe(n, e) : Math.exp((n - 1) * Math.log(t) + (e - 1) * Math.log(1 - t) - le(n, e));
 	}(t, n, e) / (u - o));
 }
 function lc(t, n, e, r = 0, o = 1) {
 	return ic(t, n, e, !0, r, o);
 }
 function ac(t, n, e, r = 0, o = 1) {
-	return n <= 0 || e <= 0 || t <= 0 || t >= 1 || r >= o ? NaN : ((t, n, e) => de(t, n, e))(t, n, e) * (o - r) + r;
+	return n <= 0 || e <= 0 || t <= 0 || t >= 1 || r >= o ? NaN : ((t, n, e) => Ee(t, n, e))(t, n, e) * (o - r) + r;
 }
 function sc(t, n, e, r = 0, o = 1) {
 	return ac(t, n, e, r, o);
 }
 function cc(t, n, e, r) {
-	return t = Math.trunc(t), (n = Math.trunc(n)) < 0 || e < 0 || e > 1 || t < 0 || t > n || n > 2147483646 ? NaN : r ? zs(t, n, e) : Ks(t, n, e);
+	return t = Math.trunc(t), (n = Math.trunc(n)) < 0 || e < 0 || e > 1 || t < 0 || t > n || n > 2147483646 ? NaN : r ? Ws(t, n, e) : zs(t, n, e);
 }
 function fc(t, n, e, r) {
 	return cc(t, n, e, r);
@@ -5494,9 +5491,9 @@ function fc(t, n, e, r) {
 function hc(t, n, e, r = e) {
 	if (t = Math.trunc(t), e = Math.trunc(e), r = Math.trunc(r), t < 0 || n < 0 || n > 1 || e < 0 || e > t || r < e || r > t) return NaN;
 	if (t > 2147483646) return NaN;
-	if (r - e > gc) return zs(r, t, n) - (e > 0 ? zs(e - 1, t, n) : 0);
+	if (r - e > gc) return Ws(r, t, n) - (e > 0 ? Ws(e - 1, t, n) : 0);
 	let o = 0;
-	for (let u = e; u <= r; u++) o += Ks(u, t, n);
+	for (let u = e; u <= r; u++) o += zs(u, t, n);
 	return o;
 }
 var gc = 1e5;
@@ -5505,33 +5502,33 @@ function mc(t, n, e) {
 }
 function Nc(t, n, e) {
 	return n = Math.trunc(n), t < 0 || n < 1 || n > Js ? NaN : e ? function(t, n) {
-		return t < 0 ? 0 : he(n / 2, t / 2);
+		return t < 0 ? 0 : ge(n / 2, t / 2);
 	}(t, n) : function(t, n) {
-		return t < 0 ? 0 : 0 === t && 2 === n ? .5 : Math.exp((n / 2 - 1) * Math.log(t) - t / 2 - n / 2 * Math.log(2) - ne(n / 2));
+		return t < 0 ? 0 : 0 === t && 2 === n ? .5 : Math.exp((n / 2 - 1) * Math.log(t) - t / 2 - n / 2 * Math.log(2) - ee(n / 2));
 	}(t, n);
 }
 function Ic(t, n) {
-	return Mc(t, n);
-}
-function Mc(t, n) {
-	return n = Math.trunc(n), t < 0 || n < 1 || n > Js ? NaN : Us(t, n);
+	return pc(t, n);
 }
 function pc(t, n) {
-	return n = Math.trunc(n), t < 0 || t >= 1 || n < 1 || n > Js ? NaN : Xs(t, n);
+	return n = Math.trunc(n), t < 0 || n < 1 || n > Js ? NaN : Xs(t, n);
+}
+function Mc(t, n) {
+	return n = Math.trunc(n), t < 0 || t >= 1 || n < 1 || n > Js ? NaN : ks(t, n);
 }
 function Ac(t, n) {
 	return wc(t, n);
 }
 function wc(t, n) {
-	return n = Math.trunc(n), t <= 0 || t > 1 || n < 1 || n > Js ? NaN : Xs(1 - t, n);
+	return n = Math.trunc(n), t <= 0 || t > 1 || n < 1 || n > Js ? NaN : ks(1 - t, n);
 }
 function dc(t, n) {
 	const e = Bh(t) ?? Bh(n);
 	if (e) return e;
 	const r = t.getRowCount(), o = t.getColumnCount();
 	if (r * o !== n.getRowCount() * n.getColumnCount()) throw T.BuiltIn.NA;
-	if (t.hasError()) return Oi(t);
-	if (n.hasError()) return Oi(n);
+	if (t.hasError()) return Fi(t);
+	if (n.hasError()) return Fi(n);
 	if (1 === r && 1 === o) throw T.BuiltIn.NA;
 	let u;
 	n.getRowCount() === r && n.getColumnCount() === o || (n = n.reshape(r, o)), u = 1 === r ? o - 1 : 1 === o ? r - 1 : (r - 1) * (o - 1);
@@ -5543,14 +5540,14 @@ function dc(t, n) {
 			i += (t - n) ** 2 / n, l++;
 		}
 	}
-	return 0 === l ? T.BuiltIn.Div0 : Number.isFinite(i) ? Mc(i, u) : T.BuiltIn.Num;
+	return 0 === l ? T.BuiltIn.Div0 : Number.isFinite(i) ? pc(i, u) : T.BuiltIn.Num;
 }
 function Ec(t, n) {
 	return dc(t, n);
 }
 function Bc(t, n, e) {
 	return e = Math.trunc(e), t <= 0 || t >= 1 || n <= 0 || e < 1 || 1 - t / 2 == 1 ? NaN : function(t, n, e) {
-		return 1 + Math.abs(Ls(t / 2, 0, 1) * n / Math.sqrt(e)) - 1;
+		return 1 + Math.abs(_s(t / 2, 0, 1) * n / Math.sqrt(e)) - 1;
 	}(t, n, e);
 }
 function Cc(t, n, e) {
@@ -5560,7 +5557,7 @@ function Sc(t, n, e) {
 	if (e = Math.trunc(e), t <= 0 || t >= 1 || n <= 0 || e < 1) return NaN;
 	if (1 === e) throw T.BuiltIn.Div0;
 	return e - 1 > Js || t / 2 < tc ? NaN : function(t, n, e) {
-		return 1 + Math.abs(Ys(t / 2, e - 1) * n / Math.sqrt(e)) - 1;
+		return 1 + Math.abs(qs(t / 2, e - 1) * n / Math.sqrt(e)) - 1;
 	}(t, n, e);
 }
 function Rc(t, n) {
@@ -5598,8 +5595,8 @@ function Dc(t, n, e) {
 	return xc(t, n, e);
 }
 function Oc(t, n, e, r) {
-	return t < 0 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : r ? ks(t, n, e) : function(t, n, e) {
-		return t < 0 ? 0 : 0 === t && n < 2 ? 1 / 0 : 0 === t && 2 === n ? 1 : n < 512 && e < 512 ? 1 / re(n / 2, e / 2) * Math.pow(n / e, n / 2) * Math.pow(t, n / 2 - 1) * Math.pow(1 + n / e * t, -(n + e) / 2) : Math.exp(n / 2 * Math.log(n / e) + (n / 2 - 1) * Math.log(t) - (n + e) / 2 * Math.log(1 + n / e * t) - ie(n / 2, e / 2));
+	return t < 0 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : r ? Hs(t, n, e) : function(t, n, e) {
+		return t < 0 ? 0 : 0 === t && n < 2 ? 1 / 0 : 0 === t && 2 === n ? 1 : n < 512 && e < 512 ? 1 / oe(n / 2, e / 2) * Math.pow(n / e, n / 2) * Math.pow(t, n / 2 - 1) * Math.pow(1 + n / e * t, -(n + e) / 2) : Math.exp(n / 2 * Math.log(n / e) + (n / 2 - 1) * Math.log(t) - (n + e) / 2 * Math.log(1 + n / e * t) - le(n / 2, e / 2));
 	}(t, n, e));
 }
 function Fc(t, n, e) {
@@ -5609,23 +5606,23 @@ function Pc(t, n, e) {
 	return t < 0 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : function(t, n, e) {
 		if (t < 0) return 1;
 		const r = n * t + e;
-		return Ae(e / r, n * t / r, e / 2, n / 2);
+		return we(e / r, n * t / r, e / 2, n / 2);
 	}(t, n, e));
 }
 function Lc(t, n, e) {
-	return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : Hs(t, n, e));
+	return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : Gs(t, n, e));
 }
 function _c(t, n, e) {
 	return Uc(t, n, e);
 }
 function Uc(t, n, e) {
-	return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : Hs(1 - t, n, e));
+	return t < 0 || t > 1 || n < 1 || e < 1 ? NaN : (n = Math.trunc(n), e = Math.trunc(e), n > Js || e > Js ? NaN : Gs(1 - t, n, e));
 }
 function Xc(t, n) {
 	const e = Bh(t) ?? Bh(n);
 	if (e) return e;
-	if (t.hasError()) return Oi(t);
-	if (n.hasError()) return Oi(n);
+	if (t.hasError()) return Fi(t);
+	if (n.hasError()) return Fi(n);
 	const r = [], o = [];
 	for (const [e, u] of [[t, r], [n, o]]) e.forEach((t) => {
 		"number" == typeof t && u.push(t);
@@ -5641,7 +5638,7 @@ function Xc(t, n) {
 	for (let t = 0; t < o.length; t++) a += (i - o[t]) ** 2;
 	if (a /= o.length - 1, l = X(l), a = X(a), 0 === l || 0 === a) return T.BuiltIn.Div0;
 	if (!Number.isFinite(l) || !Number.isFinite(a)) return T.BuiltIn.Num;
-	const s = ks(l / a, r.length - 1, o.length - 1);
+	const s = Hs(l / a, r.length - 1, o.length - 1);
 	return 2 * Math.min(s, 1 - s);
 }
 function kc(t, n) {
@@ -5690,31 +5687,31 @@ function qc(t, n) {
 	return u[e.length][0] = l, u;
 }
 function $c(t) {
-	return 0 === t || t < 0 && t === Math.trunc(t) ? NaN : ee(t);
+	return 0 === t || t < 0 && t === Math.trunc(t) ? NaN : re(t);
 }
 function Kc(t, n, e, r) {
-	return t < 0 || n <= 0 || e <= 0 ? NaN : Number.isFinite(ne(n)) && Number.isFinite(t / e * 2) ? r ? function(t, n, e) {
-		return t < 0 ? 0 : he(n, t / e);
-	}(t, n, e) : _s(t, n, e) : NaN;
+	return t < 0 || n <= 0 || e <= 0 ? NaN : Number.isFinite(ee(n)) && Number.isFinite(t / e * 2) ? r ? function(t, n, e) {
+		return t < 0 ? 0 : ge(n, t / e);
+	}(t, n, e) : Us(t, n, e) : NaN;
 }
 function zc(t, n, e, r) {
 	return Kc(t, n, e, r);
 }
 function Wc(t, n, e) {
-	return t < 0 || t >= 1 || n <= 0 || e <= 0 ? NaN : (r = e, Ie(t, n) * r);
+	return t < 0 || t >= 1 || n <= 0 || e <= 0 ? NaN : (r = e, pe(t, n) * r);
 	var r;
 }
 function Qc(t, n, e) {
 	return Wc(t, n, e);
 }
 function Zc(t) {
-	return t <= 0 ? NaN : ne(t);
+	return t <= 0 ? NaN : ee(t);
 }
 function Jc(t) {
-	return t <= 0 ? NaN : ne(t);
+	return t <= 0 ? NaN : ee(t);
 }
 function tf(t) {
-	return Ps(t, 0, 1) - .5;
+	return Ls(t, 0, 1) - .5;
 }
 function nf(t) {
 	const n = [];
@@ -5741,10 +5738,10 @@ function rf(t, n, e, r, o) {
 	const u = (t) => {
 		if (t > n || t > e) return 0;
 		if (n - t > r - e) return 0;
-		const o = $i(e, t) * $i(r - e, n - t) / $i(r, n);
+		const o = Ki(e, t) * Ki(r - e, n - t) / Ki(r, n);
 		if (Number.isFinite(o)) return o;
 		if (r > 2147483646) return NaN;
-		const u = (t, n) => ne(t + 1) - ne(n + 1) - ne(t - n + 1);
+		const u = (t, n) => ee(t + 1) - ee(n + 1) - ee(t - n + 1);
 		return Math.exp(u(e, t) + u(r - e, n - t) - u(r, n));
 	};
 	if (!o) return u(t);
@@ -5780,7 +5777,7 @@ function lf(t) {
 }
 function af(t, n, e, r) {
 	return t <= 0 || e <= 0 ? NaN : r ? function(t, n, e) {
-		return t < 0 ? 0 : .5 * ce(-(Math.log(t) - n) / Math.sqrt(2 * e * e));
+		return t < 0 ? 0 : .5 * fe(-(Math.log(t) - n) / Math.sqrt(2 * e * e));
 	}(t, n, e) : function(t, n, e) {
 		return t <= 0 ? 0 : Math.exp(-Math.log(t) - .5 * Math.log(2 * Math.PI) - Math.log(e) - Math.pow(Math.log(t) - n, 2) / (2 * e * e));
 	}(t, n, e);
@@ -5789,7 +5786,7 @@ function sf(t, n, e) {
 	return af(t, n, e, !0);
 }
 function cf(t, n, e) {
-	return t <= 0 || t >= 1 || e <= 0 ? NaN : (r = t, o = n, u = e, Math.exp(-1.4142135623730951 * u * fe(2 * r) + o));
+	return t <= 0 || t >= 1 || e <= 0 ? NaN : (r = t, o = n, u = e, Math.exp(-1.4142135623730951 * u * he(2 * r) + o));
 	var r, o, u;
 }
 function ff(t, n, e) {
@@ -5810,7 +5807,7 @@ function gf(t) {
 	return If(t);
 }
 var mf = (t) => {
-	for (const n of t) if (1 === n.size && ts(n) && n.entries({ includeEmpty: !1 }).next().done) throw T.BuiltIn.Value;
+	for (const n of t) if (1 === n.size && ns(n) && n.entries({ includeEmpty: !1 }).next().done) throw T.BuiltIn.Value;
 };
 function Nf(t) {
 	const n = hf();
@@ -5865,46 +5862,46 @@ function If(t) {
 	for (const [t, { count: n, firstSeen: r }] of e) n < 2 || (n > u || n === u && r < i) && (o = t, u = n, i = r);
 	return null === o ? T.BuiltIn.NA : o;
 }
-function Mf(t, n, e, r) {
+function pf(t, n, e, r) {
 	return t < 0 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), e <= 0 || e >= 1 || n < 1 ? NaN : r ? function(t, n, e) {
 		if (t < 0) return 0;
 		let r = 0, o = !1;
-		const u = Math.min(t, qs);
+		const u = Math.min(t, $s);
 		for (let i = 0; i <= u; i++) {
-			const u = Ws(i, n, e);
-			if (!Number.isFinite(u)) return pe(e, n, Math.floor(t) + 1);
+			const u = Qs(i, n, e);
+			if (!Number.isFinite(u)) return Ae(e, n, Math.floor(t) + 1);
 			if (0 === u && o) return r;
 			0 !== u && (o = !0), r += u;
 		}
-		return o && t <= qs ? r : pe(e, n, Math.floor(t) + 1);
-	}(t, n, e) : Ws(t, n, e));
+		return o && t <= $s ? r : Ae(e, n, Math.floor(t) + 1);
+	}(t, n, e) : Qs(t, n, e));
 }
-function pf(t, n, e) {
-	return Mf(t, n, e, !1);
+function Mf(t, n, e) {
+	return pf(t, n, e, !1);
 }
 function Af(t, n, e, r) {
 	if (e <= 0) return NaN;
-	if (r) return Ps(t, n, e);
+	if (r) return Ls(t, n, e);
 	const o = (t - n) / e;
-	return Number.isFinite(o * o) ? Fs(t, n, e) : NaN;
+	return Number.isFinite(o * o) ? Ps(t, n, e) : NaN;
 }
 function wf(t, n, e, r) {
 	return Af(t, n, e, r);
 }
 function df(t, n, e) {
-	return t <= 0 || t >= 1 || e <= 0 ? NaN : Ls(t, n, e);
+	return t <= 0 || t >= 1 || e <= 0 ? NaN : _s(t, n, e);
 }
 function Ef(t, n, e) {
 	return df(t, n, e);
 }
 function Bf(t, n) {
-	return n ? Ps(t, 0, 1) : Number.isFinite(t * t) ? Fs(t, 0, 1) : NaN;
+	return n ? Ls(t, 0, 1) : Number.isFinite(t * t) ? Ps(t, 0, 1) : NaN;
 }
 function Cf(t) {
 	return Bf(t, !0);
 }
 function Sf(t) {
-	return t <= 0 || t >= 1 ? NaN : Ls(t, 0, 1);
+	return t <= 0 || t >= 1 ? NaN : _s(t, 0, 1);
 }
 function Rf(t) {
 	return Sf(t);
@@ -5940,19 +5937,19 @@ function Of(t) {
 	return Number.isFinite(t * t) ? Math.exp(-.5 * t * t) / Eh : NaN;
 }
 function Ff(t, n, e) {
-	return t < 0 || n < 0 ? NaN : (t = Math.trunc(t), Number.isFinite(ne(t + 1)) ? e ? function(t, n) {
+	return t < 0 || n < 0 ? NaN : (t = Math.trunc(t), Number.isFinite(ee(t + 1)) ? e ? function(t, n) {
 		if (t < 0) return 0;
 		if (t <= 170) {
 			const e = [];
-			for (let r = 0; r <= t; r++) e.push($s(r, n));
+			for (let r = 0; r <= t; r++) e.push(Ks(r, n));
 			if (e.every(Number.isFinite)) {
 				let t = 0;
 				for (let n = e.length - 1; n >= 0; n--) t += e[n];
 				return t;
 			}
 		}
-		return 1 - he(Math.floor(t) + 1, n);
-	}(t, n) : $s(t, n) : NaN);
+		return 1 - ge(Math.floor(t) + 1, n);
+	}(t, n) : Ks(t, n) : NaN);
 }
 function Pf(t, n, e) {
 	return !e && t >= 0 && t < 1 && n < 0 ? Math.exp(-n) : Ff(t, n, e);
@@ -5961,8 +5958,8 @@ function Lf(t, n, e, r) {
 	mf([t, n]);
 	const o = t.flatten(), u = n.flatten();
 	if (o.getRowCount() !== u.getRowCount()) return T.BuiltIn.NA;
-	if (t.hasError()) return Oi(t);
-	if (n.hasError()) return Oi(n);
+	if (t.hasError()) return Fi(t);
+	if (n.hasError()) return Fi(n);
 	const i = r ?? e;
 	let l = 0, a = 0;
 	for (const [[t, n]] of o.alignValues([u])) "number" == typeof t && "number" == typeof n && (l += n, t >= e && t <= i && (a += n));
@@ -6082,7 +6079,7 @@ function Jf(t) {
 	return Math.sqrt(n);
 }
 function th(t) {
-	const n = Mh(t);
+	const n = ph(t);
 	return Math.sqrt(n);
 }
 function nh(t, n) {
@@ -6092,31 +6089,31 @@ function nh(t, n) {
 function eh(t, n, e) {
 	return (n = Math.trunc(n)) < 1 || n > Js ? NaN : e ? 0 === t ? .5 : function(t, n) {
 		if (!Number.isFinite(t * t)) return NaN;
-		const e = .5 * js(t, n);
+		const e = .5 * Ys(t, n);
 		return t > 0 ? 1 - e : e;
-	}(t, n) : function(t, n) {
-		return n = n > 1e100 ? 1e100 : n, 1 / (Math.sqrt(n) * re(.5, n / 2)) * Math.pow(1 + t * t / n, -(n + 1) / 2);
-	}(t, n);
+	}(t, n) : Number.isFinite(t * t) ? function(t, n) {
+		return n = n > 1e100 ? 1e100 : n, 1 / (Math.sqrt(n) * oe(.5, n / 2)) * Math.pow(1 + t * t / n, -(n + 1) / 2);
+	}(t, n) : NaN;
 }
 function rh(t, n, e) {
 	return t < 0 || 1 !== (e = Math.floor(e + oc)) && 2 !== e ? NaN : 1 === e ? uh(t, n) : oh(t, n);
 }
 function oh(t, n) {
-	return (n = Math.trunc(n)) < 1 || t < 0 || n > Js ? NaN : 2 * Gs(t, n);
+	return (n = Math.trunc(n)) < 1 || t < 0 || n > Js ? NaN : 2 * js(t, n);
 }
 function uh(t, n) {
-	return (n = Math.trunc(n)) < 1 || n > Js ? NaN : 0 === t ? .5 : Gs(t, n);
+	return (n = Math.trunc(n)) < 1 || n > Js ? NaN : 0 === t ? .5 : js(t, n);
 }
 function ih(t, n) {
 	if (0 === t && 1 === Math.trunc(n)) throw T.BuiltIn.Div0;
-	return t <= 0 || t >= 1 || n < 1 || (n = Math.trunc(n)) > Js ? NaN : 1 === n ? Math.tan(Math.PI * (t - .5)) : Ys(t, n);
+	return t <= 0 || t >= 1 || n < 1 || (n = Math.trunc(n)) > Js ? NaN : 1 === n ? Math.tan(Math.PI * (t - .5)) : qs(t, n);
 }
 function lh(t, n) {
 	return ah(t, n);
 }
 function ah(t, n) {
 	if (0 === t && 1 === Math.trunc(n)) throw T.BuiltIn.Div0;
-	return t <= 0 || n < 1 || (n = Math.trunc(n)) > Js ? NaN : 1 === n ? Math.tan(Math.PI * (.5 - t / 2)) : -Ys(t / 2, n);
+	return t <= 0 || n < 1 || (n = Math.trunc(n)) > Js ? NaN : 1 === n ? Math.tan(Math.PI * (.5 - t / 2)) : -qs(t / 2, n);
 }
 function sh(t, n) {
 	if ((t = y.flattenAreas(t)).hasError()) return t.firstError();
@@ -6141,7 +6138,7 @@ function sh(t, n) {
 var ch = { axis: V.Axis.Row };
 function fh(t) {
 	let n = 0, e = 0;
-	const r = ls(t);
+	const r = as(t);
 	for (const o of t) for (const t of o.values()) n += Math.pow(t - r, 2), e++;
 	const o = n / e;
 	return isNaN(o) ? NaN : o;
@@ -6151,7 +6148,7 @@ function hh(t) {
 }
 function gh(t) {
 	let n = 0, e = 0;
-	const r = ls(t);
+	const r = as(t);
 	for (const o of t) for (const t of o.values({
 		type: D.Number,
 		onError: "value"
@@ -6166,9 +6163,9 @@ var Nh = (t) => {
 	const n = [];
 	let e = 0;
 	for (const r of t) {
-		const t = ts(r);
+		const t = ns(r);
 		for (const o of r.values({ type: null })) {
-			const r = os(o, t);
+			const r = us(o, t);
 			null !== r && (n.push(r), e += r);
 		}
 	}
@@ -6185,12 +6182,12 @@ function Ih(t) {
 	if (e < 2) throw T.BuiltIn.Div0;
 	return n / (e - 1);
 }
-function Mh(t) {
+function ph(t) {
 	const { sigma: n, count: e } = Nh(t);
 	if (0 === e) throw T.BuiltIn.Div0;
 	return n / e;
 }
-function ph(t, n, e, r) {
+function Mh(t, n, e, r) {
 	if (t < 0 || n <= 0 || e <= 0) return NaN;
 	if (!r && 0 === t) return 0;
 	const o = Math.pow(t / e, n);
@@ -6202,7 +6199,7 @@ function ph(t, n, e, r) {
 	return u / i * Math.exp(-o);
 }
 function Ah(t, n, e, r) {
-	return ph(t, n, e, r);
+	return Mh(t, n, e, r);
 }
 function wh(t, n, e) {
 	const r = [];
@@ -6229,7 +6226,7 @@ function wh(t, n, e) {
 function dh(t, n, e) {
 	return wh(t, n, e);
 }
-var Eh = 2.5066282746310002, Bh = (t) => 1 === t.size && ts(t) ? t.hasError() ? t.firstError() : t.entries({ includeEmpty: !1 }).next().done ? T.BuiltIn.Value : null : null;
+var Eh = 2.5066282746310002, Bh = (t) => 1 === t.size && ns(t) ? t.hasError() ? t.firstError() : t.entries({ includeEmpty: !1 }).next().done ? T.BuiltIn.Value : null : null;
 function Ch(t, n) {
 	const e = Bh(t) ?? Bh(n);
 	if (e) return e;
@@ -6239,8 +6236,8 @@ function Ch(t, n) {
 	const u = [], i = [];
 	for (const [e] of t.alignValues([n])) {
 		const t = e[0], n = e[1];
-		if (T.isError(t)) return Di(t);
-		if (T.isError(n)) return Di(n);
+		if (T.isError(t)) return Oi(t);
+		if (T.isError(n)) return Oi(n);
 		"number" == typeof t && "number" == typeof n && (i.push(t), u.push(n));
 	}
 	const l = i.length;
@@ -6372,8 +6369,8 @@ var Dh = [
 	NUMBERVALUE: () => mg,
 	PROPER: () => Ng,
 	REPLACE: () => Ig,
-	REPLACEB: () => Mg,
-	REPT: () => pg,
+	REPLACEB: () => pg,
+	REPT: () => Mg,
 	RIGHT: () => Ag,
 	RIGHTB: () => wg,
 	SEARCH: () => dg,
@@ -6570,10 +6567,10 @@ function Ng(t) {
 function Ig(t, n, e, r) {
 	return e + k < 0 ? T.BuiltIn.Value : (n = H(n), e = H(e), n < 1 ? T.BuiltIn.Value : Hg(t) ? t.slice(0, om(t, n - 1)) + r + t.slice(om(t, n - 1 + e)) : t.slice(0, n - 1) + r + t.slice(n - 1 + e));
 }
-function Mg(t, n, e, r) {
+function pg(t, n, e, r) {
 	return e + k < 0 ? T.BuiltIn.Value : (n = H(n), e = H(e), n < 1 ? T.BuiltIn.Value : t.slice(0, n - 1) + r + t.slice(n - 1 + e));
 }
-function pg(t, n) {
+function Mg(t, n) {
 	return (n = Math.floor(n)) < 0 || t.length * n > x.MAX_TEXT_LENGTH ? T.BuiltIn.Value : t.repeat(n);
 }
 function Ag(t, n = 1) {
@@ -6622,11 +6619,12 @@ function Cg(t, n, e, r) {
 }
 function Sg(t) {
 	const n = !0 === t?.isIRange ? t : null;
-	return n ? eo(n, Rg) : Rg(t);
+	return n ? ro(n, Rg) : Rg(t);
 }
 var Rg = (t) => "string" == typeof t ? t : "";
 function bg(t, n) {
-	if (null === t && (t = 0), "" === n) return "";
+	if (null === t && (t = 0), "" === n) return "number" == typeof t && t < 0 ? "-" : "";
+	if (n.length > 255) return T.BuiltIn.Value;
 	if ("string" == typeof t && "" !== t.trim()) try {
 		t = y.parseAsNumber(t.trim());
 	} catch (t) {}
@@ -6842,7 +6840,7 @@ function cm(t, n) {
 }
 async function fm(t) {
 	if (!mm || !Nm) try {
-		Mm ??= gm(), await Mm;
+		pm ??= gm(), await pm;
 	} catch (t) {
 		Im || (Im = !0, console.warn(`FILTERXML is unavailable: XML libraries could not be loaded (${t?.message ?? t}).`));
 	}
@@ -6880,7 +6878,7 @@ var gm = async () => {
 	Nm = t;
 	const e = n.DOMParser;
 	mm = new e();
-}, mm = null, Nm = null, Im = !1, Mm = null, pm = U({ IMPORTDATA: () => Em }), Am = "Resource at url not found.";
+}, mm = null, Nm = null, Im = !1, pm = null, Mm = U({ IMPORTDATA: () => Em }), Am = "Resource at url not found.";
 function wm(t) {
 	const n = t.split(/[?#]/, 1)[0];
 	return /\.tsv$/i.test(n) ? "	" : ",";
@@ -6949,5 +6947,5 @@ async function bm(t, n, e) {
 		throw T.isError(t, T.Code.Blocked) ? new T.Value(t.message) : T.BuiltIn.Value;
 	}
 }
-var vm = () => import("./BTD5KvdGRxzNBnIO.mjs"), ym = () => import("./B3CtWsu1zcvVUOHj.mjs"), Tm = () => import("./xn78EHJuEdJzKXGc.mjs"), Vm = () => import("./DRDr9L2X9CIvxuWt.mjs"), xm = () => import("./DR8Bh2icTbAyj4uJ.mjs"), Dm = () => import("./DendOKspRKG9r9QD.mjs"), Om = () => import("./qrWn2IOfCdT1WOLg.mjs"), Fm = () => import("./awo6QFGSb30mviA0.mjs"), Pm = () => import("./P-8nL0ZP1fTNGWQB.mjs"), Lm = () => import("./DF2fTusbVBu8mgCF.mjs"), _m = () => import("./D6OcKlcUZD6M68BV.mjs"), Um = () => import("./IcAzgM7RZrZL6-4K.mjs"), Xm = () => import("./CZ0BLs5xhvTaPYDh.mjs"), km = () => import("./CjuoNisbPcjTNdVY.mjs"), Hm = () => import("./D0XkRZWFT2pe1SLZ.mjs"), Gm = () => import("./DupAjLOP54THnRnY.mjs"), jm = () => import("./BbSaG4eBosLvgrSS.mjs"), Ym = () => import("./DXbuB8TogW81jsqq.mjs"), qm = () => import("./PuqvOodiIfHenP7g.mjs"), $m = () => import("./ybd6oHZq8FS_MqtL.mjs"), Km = () => import("./DIRl4nTHGc7r-yI_.mjs"), zm = () => import("./CGnTNCRQ0gUUFyr0.mjs"), Wm = () => import("./DQpO5BTkOABHXJWL.mjs"), Qm = () => import("./C93t272f69uXW73e.mjs"), Zm = () => import("./BegSQDj4tl7gUEZB.mjs"), Jm = (y, T, V) => (V || (V = /* @__PURE__ */ new Map()), T(V, y, Y, N, vm, "Database"), T(V, y, ct, n, ym, "Date & Time", r), T(V, y, Zt, e, Tm, "Engineering"), T(V, y, ln, u, Vm, "Engineering"), T(V, y, Un, R, xm, "Engineering"), T(V, y, Wn, t, Dm, "Engineering"), T(V, y, Ee, o, Om, "Engineering"), T(V, y, _e, b, Fm, "Engineering"), T(V, y, Lr, a, Pm, "Financial"), T(V, y, ro, S, Lm, "Information", v), T(V, y, Fo, i, _m, "Japanese"), T(V, y, _o, h, Um, "Japanese"), T(V, y, Go, g, Xm, "Logical"), T(V, y, Nu, w, km, "Lookup & Reference", M), T(V, y, Li, c, Hm, "Math & Trig", f), T(V, y, Na, C, Gm, "Math & Trig"), T(V, y, La, I, jm, "Operators"), T(V, y, Zs, s, Ym, "Statistical"), T(V, y, us, E, qm, "Statistical"), T(V, y, Sh, A, $m, "Testing"), T(V, y, Hh, l, Km, "Text"), T(V, y, lm, m, zm, "Thai"), T(V, y, sm, d, Wm, "Web"), T(V, y, pm, p, Qm, "Web"), T(V, y, Bm, B, Zm, "Web"), V);
+var vm = () => import("./B8Lb4ycMbsisimyJ.mjs"), ym = () => import("./09cs4iXujO7ozZKl.mjs"), Tm = () => import("./CcHSbpd59O15t-0s.mjs"), Vm = () => import("./j3fzAwgnII1ABYoy.mjs"), xm = () => import("./Cwmf3WtWvqEbXl9w.mjs"), Dm = () => import("./CEL8D-iv8wA9zzGP.mjs"), Om = () => import("./B4cV-4I4AxsDqTeg.mjs"), Fm = () => import("./B4JL4tyPYordrFSn.mjs"), Pm = () => import("./DgQs_yv8yoyN7IvY.mjs"), Lm = () => import("./tT_Sh3neAQCj8w1k.mjs"), _m = () => import("./OkSc7RXqdqBX_dhB.mjs"), Um = () => import("./BXyl3EySzcpdcg4a.mjs"), Xm = () => import("./UzUKr0PdyOTCvFQK.mjs"), km = () => import("./DBovrQMoOcTgfyy5.mjs"), Hm = () => import("./DRcy1_Zqu53jue2l.mjs"), Gm = () => import("./DTtayzMN3z3KzrEs.mjs"), jm = () => import("./Bgm6ooSL37aLrze-.mjs"), Ym = () => import("./-3OnHOj2LLDR1fc_.mjs"), qm = () => import("./C6XhGX3n-kOXcVe-.mjs"), $m = () => import("./KGE7M7zDiMjCOz64.mjs"), Km = () => import("./CRPSImZV4jAnwQKI.mjs"), zm = () => import("./BgWNOg6VC2WA3Wld.mjs"), Wm = () => import("./CHRc41kLdyeK5TBj.mjs"), Qm = () => import("./DhGoS8Vi10avRc0T.mjs"), Zm = () => import("./DKarKpru6FjwvLA_.mjs"), Jm = (y, T, V) => (V || (V = /* @__PURE__ */ new Map()), T(V, y, Y, N, vm, "Database"), T(V, y, ct, n, ym, "Date & Time", r), T(V, y, Jt, e, Tm, "Engineering"), T(V, y, an, u, Vm, "Engineering"), T(V, y, Xn, R, xm, "Engineering"), T(V, y, Qn, t, Dm, "Engineering"), T(V, y, Be, o, Om, "Engineering"), T(V, y, Ue, b, Fm, "Engineering"), T(V, y, _r, a, Pm, "Financial"), T(V, y, oo, S, Lm, "Information", v), T(V, y, Po, i, _m, "Japanese"), T(V, y, Uo, h, Um, "Japanese"), T(V, y, jo, g, Xm, "Logical"), T(V, y, Iu, w, km, "Lookup & Reference", p), T(V, y, _i, c, Hm, "Math & Trig", f), T(V, y, Ia, C, Gm, "Math & Trig"), T(V, y, _a, I, jm, "Operators"), T(V, y, Zs, s, Ym, "Statistical"), T(V, y, is, E, qm, "Statistical"), T(V, y, Sh, A, $m, "Testing"), T(V, y, Hh, l, Km, "Text"), T(V, y, lm, m, zm, "Thai"), T(V, y, sm, d, Wm, "Web"), T(V, y, Mm, M, Qm, "Web"), T(V, y, Bm, B, Zm, "Web"), V);
 export { Jm as default };