@sheetxl/formulas 0.8.0-beta.5 → 0.8.0-beta.6

package/node/esm/index.mjs

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.5
+* @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.6
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
@@ -167,7 +167,7 @@ var x = c({
 	DAY: () => F,
 	DAYS: () => P,
 	EDATE: () => k,
-	EOMONTH: () => Y,
+	EOMONTH: () => W,
 	HOUR: () => j,
 	ISOWEEKNUM: () => $,
 	MINUTE: () => Z,
@@ -231,13 +231,13 @@ function H(n, t) {
 }
 function k(r, t) {
 	const e = _(H(r, G)), { year: u, month: o, day: i } = n.getDateParts(e), { year: a, month: s } = Q(u, o, K(t));
-	return W(a, s, n.getSerialDate(a, s, Math.min(i, z(a, s))));
+	return Y(a, s, n.getSerialDate(a, s, Math.min(i, z(a, s))));
 }
-function Y(r, t) {
+function W(r, t) {
 	const e = _(H(r, G)), { year: u, month: o } = n.getDateParts(e), { year: i, month: a } = Q(u, o, K(t));
-	return W(i, a, n.getSerialDate(i, a, z(i, a)));
+	return Y(i, a, n.getSerialDate(i, a, z(i, a)));
 }
-function W(t, e, u) {
+function Y(t, e, u) {
 	if (n.getSerialDate(t, e, 1) < 0) throw r.BuiltIn.Num;
 	if (u > n.getSerialDate(9999, 12, 31)) throw r.BuiltIn.Num;
 	return u;
@@ -574,8 +574,8 @@ var yn = c({
 	DEC2OCT: () => Xn,
 	HEX2BIN: () => Hn,
 	HEX2DEC: () => kn,
-	HEX2OCT: () => Yn,
-	OCT2BIN: () => Wn,
+	HEX2OCT: () => Wn,
+	OCT2BIN: () => Yn,
 	OCT2DEC: () => Kn,
 	OCT2HEX: () => qn
 });
@@ -663,13 +663,13 @@ function kn(n) {
 	const r = parseInt(er(n, jn), 16);
 	return r >= 549755813888 ? r - 1099511627776 : r;
 }
-function Yn(n, t) {
+function Wn(n, t) {
 	t = rr(t);
 	const e = kn(er(n, jn));
 	if (e > $n || e < Zn) throw r.BuiltIn.Num;
 	return Xn(e, t);
 }
-function Wn(n, t) {
+function Yn(n, t) {
 	t = rr(t);
 	const e = er(n, Qn);
 	if (void 0 !== t && t > 10) throw r.BuiltIn.Num;
@@ -2550,30 +2550,30 @@ function Hr(n, r, t) {
 	return i;
 }
 var kr = c({
-	ERF: () => Wr,
+	ERF: () => Yr,
 	ERFC: () => qr,
 	ERFC_PRECISE: () => zr,
 	ERF_PRECISE: () => Kr
-}), Yr = (t) => {
+}), Wr = (t) => {
 	if (r.isError(t)) throw t;
 	return null === t ? 0 : n.parseAsNumber(t);
 };
-function Wr(n, t) {
+function Yr(n, t) {
 	if (void 0 === n) throw r.BuiltIn.NA;
-	const e = Yr(n);
-	return void 0 === t ? yr(e) : yr(Yr(t)) - yr(e);
+	const e = Wr(n);
+	return void 0 === t ? yr(e) : yr(Wr(t)) - yr(e);
 }
 function Kr(n) {
 	if (void 0 === n) throw r.BuiltIn.NA;
-	return yr(Yr(n));
+	return yr(Wr(n));
 }
 function qr(n) {
 	if (void 0 === n) throw r.BuiltIn.NA;
-	return Or(Yr(n));
+	return Or(Wr(n));
 }
 function zr(n) {
 	if (void 0 === n) throw r.BuiltIn.NA;
-	return Or(Yr(n));
+	return Or(Wr(n));
 }
 var Qr = Math.PI, jr = 2 ** 27, $r = 134217729, Zr = (n, r) => {
 	const t = n + r, e = t - n;
@@ -2630,8 +2630,8 @@ var ut = (n) => tt(n) / et(n), ot = c({
 	IMREAL: () => Xt,
 	IMSEC: () => Ht,
 	IMSECH: () => kt,
-	IMSIN: () => Yt,
-	IMSINH: () => Wt,
+	IMSIN: () => Wt,
+	IMSINH: () => Yt,
 	IMSQRT: () => Kt,
 	IMSUB: () => qt,
 	IMSUM: () => zt,
@@ -2863,11 +2863,11 @@ function kt(n) {
 	const { real: r, im: t, unit: e } = ee(n), u = At(Et, Rt(t, It(r, t)));
 	return it(u.real, u.im, e);
 }
-function Yt(n) {
+function Wt(n) {
 	const { real: r, im: t, unit: e } = ee(n), u = Tt(Rt(r, Nt(r, t)));
 	return it(u.real, u.im, e);
 }
-function Wt(n) {
+function Yt(n) {
 	const { real: r, im: t, unit: e } = ee(n), u = Tt(Rt(t, bt(r, t)));
 	return it(u.real, u.im, e);
 }
@@ -3186,7 +3186,7 @@ function Ge(r, t, e, u, o) {
 	}(u, n, r)) } : void 0);
 }
 var Xe = (n, r) => (n ?? 0) + r, He = (n, r) => n, ke = c({
-	AND: () => We,
+	AND: () => Ye,
 	BYCOL: () => Ke,
 	BYROW: () => qe,
 	FALSE: () => ze,
@@ -3207,8 +3207,8 @@ var Xe = (n, r) => (n ?? 0) + r, He = (n, r) => n, ke = c({
 	SWITCH: () => lu,
 	TRUE: () => cu,
 	XOR: () => fu
-}), Ye = (n) => "number" == typeof n ? f(n) : n;
-function We(n) {
+}), We = (n) => "number" == typeof n ? f(n) : n;
+function Ye(n) {
 	let t = !1, e = !1;
 	for (const r of n) for (const n of r.values()) t = !0, n || (e = !0);
 	return t ? !e : r.BuiltIn.Value;
@@ -3357,10 +3357,10 @@ function su(t, e, u) {
 	return n.createRange(o, i, c);
 }
 function lu(t, e, u) {
-	const o = Ye(t ?? 0);
+	const o = We(t ?? 0);
 	for (const [t, u] of e) {
 		if (r.isError(t)) return t;
-		if (0 === n.compare(o, Ye(t ?? 0))) return u ?? 0;
+		if (0 === n.compare(o, We(t ?? 0))) return u ?? 0;
 	}
 	return void 0 !== u ? u : r.BuiltIn.NA;
 }
@@ -3404,8 +3404,8 @@ var Nu = Object.freeze({ includeEmpty: !0 }), Iu = Object.freeze({ axis: t.Axis.
 	HYPERLINK: () => Xu,
 	IMAGE: () => Hu,
 	INDEX: () => ku,
-	INDIRECT: () => Yu,
-	LOOKUP: () => Wu,
+	INDIRECT: () => Wu,
+	LOOKUP: () => Yu,
 	MATCH: () => Ku,
 	OFFSET: () => qu,
 	ROW: () => zu,
@@ -3669,10 +3669,10 @@ function ku(t, e, u = void 0, o = 1) {
 		colEnd: p
 	});
 }
-function Yu(r, t = !0) {
+function Wu(r, t = !0) {
 	return n.getReference(r, !t);
 }
-function Wu(t, e, u) {
+function Yu(t, e, u) {
 	if (r.isError(t)) return t;
 	if (e.length > 1) return r.BuiltIn.NA;
 	const o = e[0];
@@ -4234,8 +4234,8 @@ var Oo = (n) => {
 	CEILING_MATH: () => Go,
 	CEILING_PRECISE: () => Xo,
 	COMBIN: () => ko,
-	COMBINA: () => Yo,
-	DECIMAL: () => Wo,
+	COMBINA: () => Wo,
+	DECIMAL: () => Yo,
 	DEGREES: () => Ko,
 	ECMA_CEILING: () => Ho,
 	EVEN: () => qo,
@@ -4282,8 +4282,8 @@ var Oo = (n) => {
 	SUM: () => Xi,
 	SUMIF: () => Hi,
 	SUMIFS: () => ki,
-	SUMPRODUCT: () => Yi,
-	SUMSQ: () => Wi,
+	SUMPRODUCT: () => Wi,
+	SUMSQ: () => Yi,
 	SUMX2MY2: () => Ki,
 	SUMX2PY2: () => qi,
 	SUMXMY2: () => zi,
@@ -4424,14 +4424,14 @@ function ko(n, r) {
 	const t = Math.trunc(n), e = Math.trunc(r);
 	return t > 2147483646 || t < e ? NaN : Do(t, e);
 }
-function Yo(n, r) {
+function Wo(n, r) {
 	const t = Math.trunc(n), e = Math.trunc(r);
 	if (0 === e && (0 === t || 1 === t)) return 1;
 	if (n < 0 || r < 0) return NaN;
 	const u = t + e - 1;
 	return u > 2147483646 || u < e ? NaN : Do(u, e);
 }
-function Wo(n, t) {
+function Yo(n, t) {
 	const e = Math.trunc(t);
 	if (e < 2 || e > 36) return NaN;
 	if (n.length > ea) throw r.BuiltIn.Value;
@@ -4491,11 +4491,11 @@ function Jo(n, r = 1) {
 function ni(n) {
 	ia(n);
 	let r, t = n[0];
-	if (t < 0 || t > ca) return NaN;
+	if (t < 0 || t > fa) return NaN;
 	t = Math.abs(Math.trunc(t));
 	const e = n.length;
 	for (let u = 1; u < e; u++) {
-		if (r = n[u], r < 0 || r > ca) return NaN;
+		if (r = n[u], r < 0 || r > fa) return NaN;
 		for (r = Math.abs(Math.trunc(r)); t && r;) t > r ? t %= r : r %= t;
 		t += r;
 	}
@@ -4511,15 +4511,15 @@ function ti(n, r = 1) {
 function ei(n) {
 	ia(n);
 	let r, t, e, u = n[0];
-	if (u < 0 || u > ca) return NaN;
+	if (u < 0 || u > fa) return NaN;
 	u = Math.abs(Math.trunc(u));
 	const o = n.length;
 	for (let i = 1; i < o; i++) {
 		const o = n[i];
-		if (o < 0 || o > ca) return NaN;
+		if (o < 0 || o > fa) return NaN;
 		if (r = Math.abs(Math.trunc(o)), 0 !== u && 0 !== r) {
 			for (t = u, e = r; t && e;) t > e ? t %= e : e %= t;
-			if (u = u / (t + e) * r, u > ca) return NaN;
+			if (u = u / (t + e) * r, u > fa) return NaN;
 		} else u = 0;
 	}
 	return u;
@@ -4793,7 +4793,7 @@ function Li(t, e, u, o) {
 		return (null === r ? 0 : n.parseAsNumber(r)) * Fi(i, a);
 	}
 	let g = 0, h = 0;
-	for (const n of o.values(la)) if (null !== n) {
+	for (const n of o.values(ca)) if (null !== n) {
 		if (r.isError(n)) throw n;
 		if ("number" != typeof n) throw r.BuiltIn.Value;
 		g += n * Fi(i, a + h * s), h++;
@@ -4819,41 +4819,41 @@ function _i(n) {
 	return r < 0 ? NaN : Math.sqrt(r * Math.PI);
 }
 function Gi(e, u) {
-	const o = Math.trunc(e), i = o >= 101, a = i ? o - 100 : o;
-	let s = (i ? u.map((r) => n.filterHidden(r)) : u).map((r) => n.filterTotals(r));
+	const o = Math.trunc(e), i = o >= 101, a = i ? o - 100 : o, s = i ? void 0 : la;
+	let l = u.map((r) => n.filterHidden(r, s)).map((r) => n.filterTotals(r));
 	if (2 !== a && 3 !== a) {
-		for (const n of s) if (n.hasError()) return n.firstError();
+		for (const n of l) if (n.hasError()) return n.firstError();
 	}
-	const l = s.reduce((n, r) => n.concat(r, t.Axis.Row, null)), c = l.getStats().getAggregates();
+	const c = l.reduce((n, r) => n.concat(r, t.Axis.Row, null)), f = c.getStats().getAggregates();
 	switch (a) {
 		case 1: {
-			const n = c.numericalCount ?? 0;
+			const n = f.numericalCount ?? 0;
 			if (0 === n) throw r.BuiltIn.Div0;
-			return l.getStats().getSnappedSum() / n;
+			return c.getStats().getSnappedSum() / n;
 		}
-		case 2: return c.numericalCount ?? 0;
-		case 3: return l.getStats().getCount();
-		case 4: return c.max ?? 0;
-		case 5: return c.min ?? 0;
+		case 2: return f.numericalCount ?? 0;
+		case 3: return c.getStats().getCount();
+		case 4: return f.max ?? 0;
+		case 5: return f.min ?? 0;
 		case 6: {
 			let n = 1, r = !1;
-			return l.forEach((t) => {
+			return c.forEach((t) => {
 				"number" == typeof t && (n *= t, r = !0);
 			}), r ? n : 0;
 		}
 		case 7:
-			if ((c.numericalCount ?? 0) < 2) throw r.BuiltIn.Div0;
-			return c.stdDev;
+			if ((f.numericalCount ?? 0) < 2) throw r.BuiltIn.Div0;
+			return f.stdDev;
 		case 8:
-			if ((c.numericalCount ?? 0) < 1) throw r.BuiltIn.Div0;
-			return c.stdDevP;
-		case 9: return l.getStats().getSnappedSum();
+			if ((f.numericalCount ?? 0) < 1) throw r.BuiltIn.Div0;
+			return f.stdDevP;
+		case 9: return c.getStats().getSnappedSum();
 		case 10:
-			if ((c.numericalCount ?? 0) < 2) throw r.BuiltIn.Div0;
-			return c.var;
+			if ((f.numericalCount ?? 0) < 2) throw r.BuiltIn.Div0;
+			return f.var;
 		case 11:
-			if ((c.numericalCount ?? 0) < 1) throw r.BuiltIn.Div0;
-			return c.varP;
+			if ((f.numericalCount ?? 0) < 1) throw r.BuiltIn.Div0;
+			return f.varP;
 		default: return r.BuiltIn.Value;
 	}
 }
@@ -4871,7 +4871,7 @@ function Hi(n, r, t) {
 function ki(r, t) {
 	return Bo(n, t, yo((n, r) => "number" != typeof r ? n : null === n ? r : n + r), r, 0, He);
 }
-function Yi(t) {
+function Wi(t) {
 	const e = n.getArgs().getRepeatingArgsAt(0);
 	for (let n = 0, t = e.getLength(); n < t; n++) {
 		const t = e.getRawAt(n);
@@ -4894,7 +4894,7 @@ function Yi(t) {
 	}
 	return oa(u, o, ua);
 }
-function Wi(n) {
+function Yi(n) {
 	let r = 0;
 	for (const t of n) for (const n of t.values()) r += f(n ** 2);
 	return r;
@@ -4961,223 +4961,223 @@ var ji = (n) => Math.trunc(n), $i = 2147483646, Zi = (n) => {
 	const u = n.getRowCount(), o = n.getColumnCount();
 	if (u * o !== t.getRowCount() * t.getColumnCount()) throw r.BuiltIn.NA;
 	u === t.getRowCount() && o === t.getColumnCount() || (t = t.reshape(u, o));
-	for (const t of n.values(la)) if (r.isError(t)) throw t;
-	for (const n of t.values(la)) if (r.isError(n)) throw n;
+	for (const t of n.values(ca)) if (r.isError(t)) throw t;
+	for (const n of t.values(ca)) if (r.isError(n)) throw n;
 	let i = 0;
 	const a = n.alignReduce([t], (n, r) => "number" != typeof r[0] || "number" != typeof r[1] ? n : (i++, n + e(r[0], r[1])), 0);
 	if (0 === i) throw r.BuiltIn.Div0;
 	return a;
-}, la = { axis: t.Axis.Row }, ca = 9007199254740992, fa = c({
-	ACOS: () => ma,
-	ACOSH: () => ga,
-	ACOT: () => ha,
-	ACOTH: () => pa,
-	ASIN: () => Na,
-	ASINH: () => Ia,
-	ATAN: () => ba,
-	ATAN2: () => Ea,
-	ATANH: () => Aa,
-	COS: () => da,
-	COSH: () => Ma,
-	COT: () => Sa,
-	COTH: () => Ra,
-	CSC: () => Ta,
-	CSCH: () => Ca,
-	SEC: () => wa,
-	SECH: () => va,
-	SIN: () => Ba,
-	SINH: () => ya,
-	TAN: () => Oa,
-	TANH: () => Da
+}, la = { onlyWhileFiltered: !0 }, ca = { axis: t.Axis.Row }, fa = 9007199254740992, ma = c({
+	ACOS: () => ga,
+	ACOSH: () => ha,
+	ACOT: () => pa,
+	ACOTH: () => Na,
+	ASIN: () => Ia,
+	ASINH: () => ba,
+	ATAN: () => Ea,
+	ATAN2: () => Aa,
+	ATANH: () => da,
+	COS: () => Ma,
+	COSH: () => Sa,
+	COT: () => Ra,
+	COTH: () => Ta,
+	CSC: () => Ca,
+	CSCH: () => wa,
+	SEC: () => va,
+	SECH: () => Ba,
+	SIN: () => ya,
+	SINH: () => Oa,
+	TAN: () => Da,
+	TANH: () => xa
 });
-function ma(n) {
+function ga(n) {
 	return n > 1 || n < -1 ? NaN : Math.PI / 2 - Math.asin(n);
 }
-function ga(n) {
+function ha(n) {
 	return n < 1 ? NaN : Math.log(n + Math.sqrt(n * n - 1));
 }
-function ha(n) {
+function pa(n) {
 	const r = Math.atan(f(1 / n));
 	return n < 0 ? Math.PI + r : r;
 }
-function pa(n) {
+function Na(n) {
 	return Math.abs(n) <= 1 ? NaN : Math.abs(n) <= 2 ? Math.log((n + 1) / (n - 1)) / 2 : m(f(1 / n));
 }
-function Na(n) {
+function Ia(n) {
 	return n > 1 || n < -1 ? NaN : Math.asin(n);
 }
-function Ia(n) {
+function ba(n) {
 	const r = Math.abs(n), t = Math.log(r + Math.sqrt(r * r + 1));
 	return n < 0 ? -t : t;
 }
-function ba(n) {
+function Ea(n) {
 	return Math.atan(n);
 }
-function Ea(n, t) {
+function Aa(n, t) {
 	if (0 === t && 0 === n) throw r.BuiltIn.Div0;
 	const e = t / n;
 	if (0 !== n && !Number.isFinite(e)) return NaN;
 	const u = Math.atan(e);
 	return n >= 0 ? u : t >= 0 ? u + Math.PI : u - Math.PI;
 }
-function Aa(n) {
+function da(n) {
 	return Math.abs(n) >= 1 ? NaN : m(n);
 }
-function da(n) {
+function Ma(n) {
 	return Math.abs(n) >= jr ? NaN : et(n);
 }
-function Ma(n) {
+function Sa(n) {
 	return Number.isFinite(Math.exp(Math.abs(n))) ? Math.cosh(n) : NaN;
 }
-function Sa(n) {
+function Ra(n) {
 	if (Math.abs(n) >= jr) return NaN;
 	if (0 === n) throw r.BuiltIn.Div0;
 	return 1 / ut(n);
 }
-function Ra(n) {
+function Ta(n) {
 	if (0 === n) throw r.BuiltIn.Div0;
 	return f(1 / Math.tanh(n));
 }
-function Ta(n) {
+function Ca(n) {
 	if (Math.abs(n) >= jr) return NaN;
 	if (0 === n) throw r.BuiltIn.Div0;
 	return 1 / tt(n);
 }
-function Ca(n) {
+function wa(n) {
 	if (0 === n) throw r.BuiltIn.Div0;
 	return f(1 / Math.sinh(n));
 }
-function wa(n) {
+function va(n) {
 	return Math.abs(n) >= jr ? NaN : 1 / et(n);
 }
-function va(n) {
+function Ba(n) {
 	return f(1 / Math.cosh(n));
 }
-function Ba(n) {
+function ya(n) {
 	return Math.abs(n) >= jr ? NaN : tt(n);
 }
-function ya(n) {
+function Oa(n) {
 	return Number.isFinite(Math.exp(Math.abs(n))) ? Math.sinh(n) : NaN;
 }
-function Oa(n) {
+function Da(n) {
 	return Math.abs(n) >= jr ? NaN : ut(n);
 }
-function Da(n) {
+function xa(n) {
 	return Math.tanh(n);
 }
-var xa = c({
-	ADD: () => La,
-	DIVIDE: () => Fa,
-	EQ: () => Pa,
-	GT: () => Ua,
-	GTE: () => _a,
-	ISBETWEEN: () => Qa,
-	LT: () => Ga,
-	LTE: () => Xa,
-	MINUS: () => Ha,
-	MULTIPLY: () => ka,
+var Va = c({
+	ADD: () => Fa,
+	DIVIDE: () => Pa,
+	EQ: () => Ua,
+	GT: () => _a,
+	GTE: () => Ga,
+	ISBETWEEN: () => ja,
+	LT: () => Xa,
+	LTE: () => Ha,
+	MINUS: () => ka,
+	MULTIPLY: () => Wa,
 	NE: () => Ya,
-	POW: () => Wa,
-	UMINUS: () => Ka,
-	UNARY_PERCENT: () => qa,
-	UPLUS: () => za
-}), Va = (n) => n > -22250738585072014e-324 && n < 22250738585072014e-324 ? 0 : n;
-function La(n, r) {
+	POW: () => Ka,
+	UMINUS: () => qa,
+	UNARY_PERCENT: () => za,
+	UPLUS: () => Qa
+}), La = (n) => n > -22250738585072014e-324 && n < 22250738585072014e-324 ? 0 : n;
+function Fa(n, r) {
 	return n + r;
 }
-function Fa(n, t) {
-	if (0 === Va(t)) throw r.BuiltIn.Div0;
-	return Va(n / t);
+function Pa(n, t) {
+	if (0 === La(t)) throw r.BuiltIn.Div0;
+	return La(n / t);
 }
-function Pa(r, t) {
+function Ua(r, t) {
 	return 0 === n.compare(r, t);
 }
-function Ua(r, t) {
+function _a(r, t) {
 	return n.compare(r, t) > 0;
 }
-function _a(r, t) {
+function Ga(r, t) {
 	return n.compare(r, t) >= 0;
 }
-function Ga(r, t) {
+function Xa(r, t) {
 	return n.compare(r, t) < 0;
 }
-function Xa(r, t) {
+function Ha(r, t) {
 	return n.compare(r, t) <= 0;
 }
-function Ha(n, r) {
+function ka(n, r) {
 	return n - r;
 }
-function ka(n, r) {
-	return Va(n * r);
+function Wa(n, r) {
+	return La(n * r);
 }
 function Ya(r, t) {
 	return 0 !== n.compare(r, t);
 }
-function Wa(n, t) {
+function Ka(n, t) {
 	if (0 === n) {
 		if (t < 0) throw r.BuiltIn.Div0;
 		if (0 === t) return NaN;
 	}
 	if (n < 0) {
-		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return Va(n ** t);
+		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return La(n ** t);
 		const r = Number((1 / t).toPrecision(15));
-		return Number.isInteger(r) && 1 === Math.abs(r % 2) ? Va(-((-n) ** t)) : NaN;
+		return Number.isInteger(r) && 1 === Math.abs(r % 2) ? La(-((-n) ** t)) : NaN;
 	}
-	return Va(n ** t);
-}
-function Ka(n) {
-	return -1 * n;
+	return La(n ** t);
 }
 function qa(n) {
-	return Fa(n, 100);
+	return -1 * n;
 }
 function za(n) {
+	return Pa(n, 100);
+}
+function Qa(n) {
 	return n;
 }
-function Qa(n, r, t, e = !0, u = !0) {
+function ja(n, r, t, e = !0, u = !0) {
 	return (e ? n >= r : n > r) && (u ? n <= t : n < t);
 }
-var ja = (n) => !!n.isIReferenceRange, $a = (n) => Object.freeze({ coerce: (t, e, o, i) => {
-	const a = ja(i);
+var $a = (n) => !!n.isIReferenceRange, Za = (n) => Object.freeze({ coerce: (t, e, o, i) => {
+	const a = $a(i);
 	if (e === u.String) return a ? 0 : n;
 	if (e === u.Boolean) return a ? t ? 1 : 0 : null;
 	if (r.isError(t)) throw t;
 	return null;
-} }), Za = $a(null), Ja = $a(0), ns = (n, t) => {
+} }), Ja = Za(null), ns = Za(0), rs = (n, t) => {
 	if ("number" == typeof n) return n;
 	if ("boolean" == typeof n) return t ? n ? 1 : 0 : null;
 	if ("string" == typeof n) return t ? 0 : null;
 	if (r.isError(n)) throw n;
 	return null;
-}, rs = c({
-	AVEDEV: () => ts,
-	AVERAGE: () => es,
-	AVERAGEA: () => us,
-	AVERAGEIF: () => os,
-	AVERAGEIFS: () => is,
-	AVERAGE_WEIGHTED: () => as,
-	COUNT: () => ss,
-	COUNTA: () => ls,
-	COUNTBLANK: () => cs,
-	COUNTIF: () => fs,
-	COUNTIFS: () => ms,
-	COUNTUNIQUE: () => gs,
-	COUNTUNIQUEIFS: () => hs,
-	LARGE: () => ps,
-	MAX: () => Ns,
-	MAXA: () => Is,
-	MAXIF: () => bs,
-	MAXIFS: () => Es,
-	MEDIAN: () => As,
-	MIN: () => ds,
-	MINA: () => Ms,
-	MINIF: () => Ss,
-	MINIFS: () => Rs,
-	PERMUT: () => Ts,
-	PERMUTATIONA: () => Cs,
-	SMALL: () => ws
+}, ts = c({
+	AVEDEV: () => es,
+	AVERAGE: () => us,
+	AVERAGEA: () => os,
+	AVERAGEIF: () => is,
+	AVERAGEIFS: () => as,
+	AVERAGE_WEIGHTED: () => ss,
+	COUNT: () => ls,
+	COUNTA: () => cs,
+	COUNTBLANK: () => fs,
+	COUNTIF: () => ms,
+	COUNTIFS: () => gs,
+	COUNTUNIQUE: () => hs,
+	COUNTUNIQUEIFS: () => ps,
+	LARGE: () => Ns,
+	MAX: () => Is,
+	MAXA: () => bs,
+	MAXIF: () => Es,
+	MAXIFS: () => As,
+	MEDIAN: () => ds,
+	MIN: () => Ms,
+	MINA: () => Ss,
+	MINIF: () => Rs,
+	MINIFS: () => Ts,
+	PERMUT: () => Cs,
+	PERMUTATIONA: () => ws,
+	SMALL: () => vs
 });
-function ts(n) {
+function es(n) {
 	let t = 0;
 	const e = [];
 	for (const r of n) for (const n of r.values()) t += n, e.push(n);
@@ -5188,21 +5188,21 @@ function ts(n) {
 	for (let n = 0; n < u; n++) t += Math.abs(e[n] - o);
 	return t / u;
 }
-function es(n) {
-	return ys(n);
-}
 function us(n) {
-	return ys(n, Ja);
+	return Os(n);
 }
-function os(n, t, e) {
+function os(n) {
+	return Os(n, ns);
+}
+function is(n, t, e) {
 	const u = Ge(n, t, e, (n, r) => "number" != typeof r ? n : n + 1, He), o = Ge(n, t, e, yo((n, r) => (null === n && (n = 0), "number" != typeof r ? n : n + r)), He);
 	return r.isError(o) ? o : u ? o / u : r.BuiltIn.Div0;
 }
-function is(t, e) {
+function as(t, e) {
 	const u = Bo(n, e, yo((n, r) => "number" != typeof r ? n : null === n ? r : n + r), t, null, He), o = Bo(n, e, (n, r) => "number" != typeof r ? n : null === n ? 1 : n + 1, t, 0, He);
 	return r.isError(u) ? u : 0 === o || null === o ? r.BuiltIn.Div0 : u / o;
 }
-function as(n) {
+function ss(n) {
 	let t = 0, e = 0;
 	const u = n.length;
 	for (let o = 0; o < u; o++) {
@@ -5218,12 +5218,12 @@ function as(n) {
 	if (0 === e) throw r.BuiltIn.Div0;
 	return t / e;
 }
-function ss(n) {
+function ls(n) {
 	let t = 0;
 	for (const e of n) r.isError(e) || (t += e.getStats().getAggregates().numericalCount ?? 0);
 	return t;
 }
-function ls(t) {
+function cs(t) {
 	const e = n.getArgs().getRepeatingArgsAt(0);
 	let u = 0;
 	for (let n = 0; n < t.length; n++) {
@@ -5236,28 +5236,28 @@ function ls(t) {
 	}
 	return u;
 }
-function cs(t) {
+function fs(t) {
 	if (n.getArgs().getAreaCountAt(0) > 1) return r.BuiltIn.Value;
 	let e = 0;
 	for (const { value: n } of t.entries({ includeEmpty: !1 })) "" !== n && e++;
 	return t.getColumnCount() * t.getRowCount() - e;
 }
-function fs(n, r) {
+function ms(n, r) {
 	return Ge(n, r, void 0, (n) => null === n ? 1 : n + 1, Xe);
 }
-function ms(r) {
+function gs(r) {
 	return Bo(n, r, (n) => null === n ? 1 : n + 1, void 0, 0, Xe);
 }
-function gs(n) {
+function hs(n) {
 	const t = /* @__PURE__ */ new Set(), e = n.length;
 	for (let u = 0; u < e; u++) {
 		const e = n[u];
-		if (r.isError(e)) t.add(vs(e));
-		else for (const n of e.values()) t.add(vs(n));
+		if (r.isError(e)) t.add(Bs(e));
+		else for (const n of e.values()) t.add(Bs(n));
 	}
 	return t.size;
 }
-function hs(t, e) {
+function ps(t, e) {
 	const u = t.getRowCount(), o = t.getColumnCount(), i = e.length, a = new Array(i), s = new Array(i);
 	for (let t = 0; t < i; t++) {
 		const i = e[t][0];
@@ -5269,26 +5269,26 @@ function hs(t, e) {
 		const t = r[0];
 		if (null === t) return n;
 		for (let t = 0; t < i; t++) if (!s[t](r[t + 1])) return n;
-		return l.add(vs(t)), n;
+		return l.add(Bs(t)), n;
 	}, null), l.size;
 }
-function ps(r, t) {
+function Ns(r, t) {
 	const e = n.flattenAreas(r).getStats().getSortedNumbers().getLarge(t);
 	return null === e ? NaN : e;
 }
-function Ns(n) {
-	return Bs(n, !0);
-}
 function Is(n) {
-	return Bs(n, !0, Za);
+	return ys(n, !0);
+}
+function bs(n) {
+	return ys(n, !0, Ja);
 }
-function bs(n, r, t) {
+function Es(n, r, t) {
 	return Ge(n, r, t, yo((n, r) => "number" != typeof r ? n ?? 0 : null === n ? r : Math.max(n, r)), He);
 }
-function Es(r, t) {
+function As(r, t) {
 	return Bo(n, t, yo((n, r) => "number" != typeof r ? n : null === n ? r : Math.max(n, r)), r, 0, He);
 }
-function As(n) {
+function ds(n) {
 	const r = [];
 	for (const t of n) for (const n of t.values()) r.push(n);
 	if (0 === r.length) return NaN;
@@ -5300,37 +5300,37 @@ function As(n) {
 	}
 	return r[Math.floor(t / 2)];
 }
-function ds(n) {
-	return Bs(n, !1);
-}
 function Ms(n) {
-	return Bs(n, !1, Za);
+	return ys(n, !1);
+}
+function Ss(n) {
+	return ys(n, !1, Ja);
 }
-function Ss(n, r, t) {
+function Rs(n, r, t) {
 	return Ge(n, r, t, yo((n, r) => "number" != typeof r ? n ?? 0 : null === n ? r : Math.min(n, r)), He);
 }
-function Rs(r, t) {
+function Ts(r, t) {
 	return Bo(n, t, yo((n, r) => "number" != typeof r ? n : null === n ? r : Math.min(n, r)), r, 0, He);
 }
-function Ts(n, r) {
+function Cs(n, r) {
 	if (n = Math.trunc(n), r = Math.trunc(r), n < 0 || r < 0 || r > n) return NaN;
 	if (n > 2147483646) return NaN;
 	let t = 1;
 	for (let e = n; e > n - r; e--) if (t *= e, !Number.isFinite(t)) return NaN;
 	return t;
 }
-function Cs(n, r) {
+function ws(n, r) {
 	return n = Math.trunc(n), r = Math.trunc(r), n < 0 || r < 0 || n > 2147483646 || r > 2147483646 ? NaN : Math.pow(n, r);
 }
-function ws(r, t) {
+function vs(r, t) {
 	const e = (r = n.flattenAreas(r)).getStats().getSortedNumbers().getSmall(t);
 	return null === e ? NaN : e;
 }
-var vs = (n) => {
+var Bs = (n) => {
 	if (null === n) return "\0";
 	const t = typeof n;
 	return "number" === t ? "
" + n.toString() : "string" === t ? "" + n : "boolean" === t ? "" + (n ? "1" : "0") : r.isError(n) ? "" + n.getCode() : "" + String(n);
-}, Bs = (n, r, t) => {
+}, ys = (n, r, t) => {
 	let e = 0, u = !1;
 	for (const o of n) {
 		const n = o.getStats(t).getAggregates();
@@ -5339,7 +5339,7 @@ var vs = (n) => {
 		e = u ? r ? Math.max(e, i) : Math.min(e, i) : i, u = !0;
 	}
 	return u ? e : 0;
-}, ys = (n, t) => {
+}, Os = (n, t) => {
 	let e = 0, u = 0, o = null;
 	for (const r of n) {
 		const n = r.getStats(t), i = n.getAggregates();
@@ -5347,38 +5347,38 @@ var vs = (n) => {
 	}
 	if (0 === u) throw r.BuiltIn.Div0;
 	return (o ? o.getSnappedSum(e) : e) / u;
-}, Os = (n, r, t) => Math.exp(-.5 * Math.log(2 * Math.PI) - Math.log(t) - Math.pow(n - r, 2) / (2 * t * t)), Ds = (n, r, t) => .5 * Or(-(n - r) / Math.sqrt(2 * t * t)), xs = (n, r, t) => -1.4142135623730951 * t * Dr(2 * n) + r;
-function Vs(n, r, t) {
+}, Ds = (n, r, t) => Math.exp(-.5 * Math.log(2 * Math.PI) - Math.log(t) - Math.pow(n - r, 2) / (2 * t * t)), xs = (n, r, t) => .5 * Or(-(n - r) / Math.sqrt(2 * t * t)), Vs = (n, r, t) => -1.4142135623730951 * t * Dr(2 * n) + r;
+function Ls(n, r, t) {
 	return n < 0 ? 0 : 0 === n && 1 === r ? 1 / t : r >= 30 ? Math.exp(function(n, r) {
 		const t = r / n - 1;
 		return -n * t * t * (1 + Lr(t) * t) / 2 - Math.log1p(t) - .5 * Math.log(n) - .5 * Math.log(2 * Math.PI) - Cr(n);
 	}(r, n / t)) / t : Math.exp((r - 1) * Math.log(n) - n / t - Mr(r) - r * Math.log(t));
 }
-function Ls(n, r) {
+function Fs(n, r) {
 	return n < 0 ? 1 : ((n, r) => Fr(n, r, !0))(r / 2, n / 2);
 }
-var Fs = (n, r) => 2 * Pr(n, .5 * r);
-function Ps(n, r, t) {
+var Ps = (n, r) => 2 * Pr(n, .5 * r);
+function Us(n, r, t) {
 	if (n < 0) return 0;
 	const e = r * n + t;
 	return Gr(r * n / e, t / e, r / 2, t / 2);
 }
-var Us = (n, r, t) => t / (r * (1 / Hr(n, r / 2, t / 2) - 1));
-function _s(n, r) {
+var _s = (n, r, t) => t / (r * (1 / Hr(n, r / 2, t / 2) - 1));
+function Gs(n, r) {
 	if (!Number.isFinite(n * n)) return NaN;
-	const t = .5 * Gs(n, r);
+	const t = .5 * Xs(n, r);
 	return n > 0 ? t : 1 - t;
 }
-function Gs(n, r) {
+function Xs(n, r) {
 	const t = r + n * n;
 	return Gr(r / t, n * n / t, r / 2, .5);
 }
-function Xs(n, r) {
+function Hs(n, r) {
 	let t = Hr(2 * Math.min(n, 1 - n), .5 * r, .5);
 	return t = Math.sqrt(r * (1 - t) / t), n > .5 ? t : -t;
 }
-var Hs = 1e5;
-function ks(n, r) {
+var ks = 1e5;
+function Ws(n, r) {
 	if (r < 0 || n % 1 != 0 || n < 0) return 0;
 	const t = n <= 170 ? Math.pow(r, n) * Math.exp(-r) / Oo(n) : Infinity;
 	return Number.isFinite(t) ? t : 0 === r ? 0 === n ? 1 : 0 : Math.exp(n * Math.log(r) - r - Mr(n + 1));
@@ -5388,219 +5388,219 @@ var Ys = (n, r, t) => {
 	const e = Do(r, n) * Math.pow(t, n) * Math.pow(1 - t, r - n);
 	return Number.isFinite(e) ? e : Math.exp(Mr(r + 1) - Mr(n + 1) - Mr(r - n + 1) + n * Math.log(t) + (r - n) * Math.log(1 - t));
 };
-function Ws(n, r, t) {
+function Ks(n, r, t) {
 	let e;
 	const u = 1e-10;
 	if (n < 0) return 0;
 	if (n >= r) return 1;
 	if (t < 0 || t > 1 || r <= 0) return NaN;
 	const o = t, i = (n = Math.floor(n)) + 1, a = r - n, s = i + a, l = Math.exp(Mr(s) - Mr(a) - Mr(i) + i * Math.log(o) + a * Math.log(1 - o));
-	return e = o < (i + 1) / (s + 2) ? l * qs(o, i, a, u) : 1 - l * qs(1 - o, a, i, u), Math.round(1 / u * (1 - e)) / (1 / u);
+	return e = o < (i + 1) / (s + 2) ? l * zs(o, i, a, u) : 1 - l * zs(1 - o, a, i, u), Math.round(1 / u * (1 - e)) / (1 / u);
 }
-function Ks(n, r, t) {
+function qs(n, r, t) {
 	return n !== n >>> 0 || n < 0 ? 0 : Do(n + r - 1, r - 1) * Math.pow(1 - t, n) * Math.pow(t, r);
 }
-function qs(n, r, t, e) {
+function zs(n, r, t, e) {
 	let u, o = 0, i = 1, a = 1, s = 1, l = 0, c = 0;
 	for (; Math.abs((a - c) / a) > e;) c = a, u = -(r + l) * (r + t + l) * n / (r + 2 * l) / (r + 2 * l + 1), o = a + u * o, i = s + u * i, l += 1, u = l * (t - l) * n / (r + 2 * l - 1) / (r + 2 * l), a = o + u * a, s = i + u * s, o /= s, i /= s, a /= s, s = 1;
 	return a / r;
 }
-var zs = c({
-	BETADIST: () => el,
-	BETAINV: () => ol,
-	BETA_DIST: () => tl,
-	BETA_INV: () => ul,
-	BINOMDIST: () => al,
-	BINOM_DIST: () => il,
-	BINOM_DIST_RANGE: () => sl,
-	BINOM_INV: () => cl,
-	CHIDIST: () => ml,
-	CHIINV: () => pl,
-	CHISQ_DIST: () => fl,
-	CHISQ_DIST_RT: () => gl,
-	CHISQ_INV: () => hl,
-	CHISQ_INV_RT: () => Nl,
-	CHISQ_TEST: () => Il,
-	CHITEST: () => bl,
-	CONFIDENCE: () => Al,
-	CONFIDENCE_NORM: () => El,
-	CONFIDENCE_T: () => dl,
-	CORREL: () => Ml,
-	COVAR: () => Sl,
-	COVARIANCE_P: () => Rl,
-	COVARIANCE_S: () => Tl,
-	CRITBINOM: () => Cl,
-	DEVSQ: () => wl,
-	EXPONDIST: () => Bl,
-	EXPON_DIST: () => vl,
-	FDIST: () => Ol,
-	FINV: () => Vl,
-	FISHER: () => Ul,
-	FISHERINV: () => _l,
-	FORECAST: () => Gl,
-	FORECAST_LINEAR: () => Xl,
-	FREQUENCY: () => Hl,
-	FTEST: () => Pl,
-	F_DIST: () => yl,
-	F_DIST_RT: () => Dl,
-	F_INV: () => xl,
-	F_INV_RT: () => Ll,
-	F_TEST: () => Fl,
-	GAMMA: () => kl,
-	GAMMADIST: () => Wl,
-	GAMMAINV: () => ql,
-	GAMMALN: () => zl,
-	GAMMALN_PRECISE: () => Ql,
+var Qs = c({
+	BETADIST: () => ul,
+	BETAINV: () => il,
+	BETA_DIST: () => el,
+	BETA_INV: () => ol,
+	BINOMDIST: () => sl,
+	BINOM_DIST: () => al,
+	BINOM_DIST_RANGE: () => ll,
+	BINOM_INV: () => fl,
+	CHIDIST: () => gl,
+	CHIINV: () => Nl,
+	CHISQ_DIST: () => ml,
+	CHISQ_DIST_RT: () => hl,
+	CHISQ_INV: () => pl,
+	CHISQ_INV_RT: () => Il,
+	CHISQ_TEST: () => bl,
+	CHITEST: () => El,
+	CONFIDENCE: () => dl,
+	CONFIDENCE_NORM: () => Al,
+	CONFIDENCE_T: () => Ml,
+	CORREL: () => Sl,
+	COVAR: () => Rl,
+	COVARIANCE_P: () => Tl,
+	COVARIANCE_S: () => Cl,
+	CRITBINOM: () => wl,
+	DEVSQ: () => vl,
+	EXPONDIST: () => yl,
+	EXPON_DIST: () => Bl,
+	FDIST: () => Dl,
+	FINV: () => Ll,
+	FISHER: () => _l,
+	FISHERINV: () => Gl,
+	FORECAST: () => Xl,
+	FORECAST_LINEAR: () => Hl,
+	FREQUENCY: () => kl,
+	FTEST: () => Ul,
+	F_DIST: () => Ol,
+	F_DIST_RT: () => xl,
+	F_INV: () => Vl,
+	F_INV_RT: () => Fl,
+	F_TEST: () => Pl,
+	GAMMA: () => Wl,
+	GAMMADIST: () => Kl,
+	GAMMAINV: () => zl,
+	GAMMALN: () => Ql,
+	GAMMALN_PRECISE: () => jl,
 	GAMMA_DIST: () => Yl,
-	GAMMA_INV: () => Kl,
-	GAUSS: () => jl,
-	GEOMEAN: () => $l,
-	HARMEAN: () => Zl,
-	HYPGEOMDIST: () => nc,
-	HYPGEOM_DIST: () => Jl,
-	INTERCEPT: () => rc,
-	KURT: () => tc,
-	LOGINV: () => ic,
-	LOGNORMDIST: () => uc,
-	LOGNORM_DIST: () => ec,
-	LOGNORM_INV: () => oc,
-	MODE: () => sc,
-	MODE_MULT: () => cc,
-	MODE_SNGL: () => fc,
-	NEGBINOMDIST: () => gc,
-	NEGBINOM_DIST: () => mc,
-	NORMDIST: () => pc,
-	NORMINV: () => Ic,
-	NORMSDIST: () => Ec,
-	NORMSINV: () => dc,
-	NORM_DIST: () => hc,
-	NORM_INV: () => Nc,
-	NORM_S_DIST: () => bc,
-	NORM_S_INV: () => Ac,
-	PEARSON: () => Mc,
-	PERCENTILE: () => Sc,
-	PERCENTILE_EXC: () => Rc,
-	PERCENTILE_INC: () => Tc,
-	PERCENTRANK: () => Cc,
-	PERCENTRANK_EXC: () => wc,
-	PERCENTRANK_INC: () => vc,
-	PHI: () => Bc,
-	POISSON: () => Oc,
-	POISSON_DIST: () => yc,
-	PROB: () => Dc,
-	QUARTILE: () => xc,
-	QUARTILE_EXC: () => Vc,
-	QUARTILE_INC: () => Lc,
-	RANK: () => Fc,
-	RANK_AVG: () => Pc,
-	RANK_EQ: () => Uc,
-	RSQ: () => _c,
-	SKEW: () => Gc,
-	SKEW_P: () => Xc,
-	SLOPE: () => Hc,
-	STANDARDIZE: () => kc,
-	STDEV: () => Wc,
-	STDEVA: () => zc,
-	STDEVP: () => qc,
-	STDEVPA: () => Qc,
-	STDEV_P: () => Kc,
+	GAMMA_INV: () => ql,
+	GAUSS: () => $l,
+	GEOMEAN: () => Zl,
+	HARMEAN: () => Jl,
+	HYPGEOMDIST: () => rc,
+	HYPGEOM_DIST: () => nc,
+	INTERCEPT: () => tc,
+	KURT: () => ec,
+	LOGINV: () => ac,
+	LOGNORMDIST: () => oc,
+	LOGNORM_DIST: () => uc,
+	LOGNORM_INV: () => ic,
+	MODE: () => lc,
+	MODE_MULT: () => fc,
+	MODE_SNGL: () => mc,
+	NEGBINOMDIST: () => hc,
+	NEGBINOM_DIST: () => gc,
+	NORMDIST: () => Nc,
+	NORMINV: () => bc,
+	NORMSDIST: () => Ac,
+	NORMSINV: () => Mc,
+	NORM_DIST: () => pc,
+	NORM_INV: () => Ic,
+	NORM_S_DIST: () => Ec,
+	NORM_S_INV: () => dc,
+	PEARSON: () => Sc,
+	PERCENTILE: () => Rc,
+	PERCENTILE_EXC: () => Tc,
+	PERCENTILE_INC: () => Cc,
+	PERCENTRANK: () => wc,
+	PERCENTRANK_EXC: () => vc,
+	PERCENTRANK_INC: () => Bc,
+	PHI: () => yc,
+	POISSON: () => Dc,
+	POISSON_DIST: () => Oc,
+	PROB: () => xc,
+	QUARTILE: () => Vc,
+	QUARTILE_EXC: () => Lc,
+	QUARTILE_INC: () => Fc,
+	RANK: () => Pc,
+	RANK_AVG: () => Uc,
+	RANK_EQ: () => _c,
+	RSQ: () => Gc,
+	SKEW: () => Xc,
+	SKEW_P: () => Hc,
+	SLOPE: () => kc,
+	STANDARDIZE: () => Wc,
+	STDEV: () => Kc,
+	STDEVA: () => Qc,
+	STDEVP: () => zc,
+	STDEVPA: () => jc,
+	STDEV_P: () => qc,
 	STDEV_S: () => Yc,
-	STEYX: () => jc,
-	TDIST: () => Zc,
-	TINV: () => tf,
-	TRIMMEAN: () => uf,
-	T_DIST: () => $c,
-	T_DIST_2T: () => Jc,
-	T_DIST_RT: () => nf,
-	T_INV: () => rf,
-	T_INV_2T: () => ef,
-	VAR: () => cf,
-	VARA: () => mf,
-	VARP: () => sf,
-	VARPA: () => gf,
-	VAR_P: () => af,
-	VAR_S: () => lf,
-	WEIBULL: () => pf,
-	WEIBULL_DIST: () => hf,
-	ZTEST: () => If,
-	Z_TEST: () => Nf
-}), Qs = 1e10, js = 22250738585072014e-324, $s = (n) => ((n) => {
+	STEYX: () => $c,
+	TDIST: () => Jc,
+	TINV: () => ef,
+	TRIMMEAN: () => of,
+	T_DIST: () => Zc,
+	T_DIST_2T: () => nf,
+	T_DIST_RT: () => rf,
+	T_INV: () => tf,
+	T_INV_2T: () => uf,
+	VAR: () => ff,
+	VARA: () => gf,
+	VARP: () => lf,
+	VARPA: () => hf,
+	VAR_P: () => sf,
+	VAR_S: () => cf,
+	WEIBULL: () => Nf,
+	WEIBULL_DIST: () => pf,
+	ZTEST: () => bf,
+	Z_TEST: () => If
+}), js = 1e10, $s = 22250738585072014e-324, Zs = (n) => ((n) => {
 	let r = 0;
 	for (let t = 0; t < n.length; t++) r += n[t];
 	return r;
-})(n) / n.length, Zs = (n) => Math.exp($s(n.map(Math.log))), Js = (n, r) => {
-	const t = $s(n);
+})(n) / n.length, Js = (n) => Math.exp(Zs(n.map(Math.log))), nl = (n, r) => {
+	const t = Zs(n);
 	let e = 0;
 	for (let r = 0; r < n.length; r++) {
 		const u = n[r] - t;
 		e += u * u;
 	}
 	return Math.sqrt(e / (n.length - (r ? 1 : 0)));
-}, nl = 2 ** -22, rl = (n, r, t) => {
+}, rl = 2 ** -22, tl = (n, r, t) => {
 	let e = 0, u = Math.floor(n);
 	for (; e < u;) {
-		const o = e + Math.floor((u - e) / 2), i = Ws(o, n, r) > t, a = i ? e : o + 1, s = i ? o : u;
+		const o = e + Math.floor((u - e) / 2), i = Ks(o, n, r) > t, a = i ? e : o + 1, s = i ? o : u;
 		if (a === e && s === u) break;
 		e = a, u = s;
 	}
-	return Ws(e, n, r) > t ? e : NaN;
+	return Ks(e, n, r) > t ? e : NaN;
 };
-function tl(n, r, t, e, u = 0, o = 1) {
+function el(n, r, t, e, u = 0, o = 1) {
 	return r <= 0 || t <= 0 || n < u || n > o || u === o ? NaN : (n = (n - u) / (o - u), e ? ((n, r, t) => n > 1 || n < 0 ? n > 1 ? 1 : 0 : _r(n, r, t))(n, r, t) : function(n, r, t) {
 		return n > 1 || n < 0 ? 0 : 1 === r && 1 === t ? 1 : r < 512 && t < 512 ? Math.pow(n, r - 1) * Math.pow(1 - n, t - 1) / Rr(r, t) : Math.exp((r - 1) * Math.log(n) + (t - 1) * Math.log(1 - n) - wr(r, t));
 	}(n, r, t) / (o - u));
 }
-function el(n, r, t, e = 0, u = 1) {
-	return tl(n, r, t, !0, e, u);
-}
 function ul(n, r, t, e = 0, u = 1) {
-	return r <= 0 || t <= 0 || n <= 0 || n >= 1 || e >= u ? NaN : ((n, r, t) => Hr(n, r, t))(n, r, t) * (u - e) + e;
+	return el(n, r, t, !0, e, u);
 }
 function ol(n, r, t, e = 0, u = 1) {
-	return ul(n, r, t, e, u);
+	return r <= 0 || t <= 0 || n <= 0 || n >= 1 || e >= u ? NaN : ((n, r, t) => Hr(n, r, t))(n, r, t) * (u - e) + e;
 }
-function il(n, r, t, e) {
-	return n = Math.trunc(n), (r = Math.trunc(r)) < 0 || t < 0 || t > 1 || n < 0 || n > r || r > 2147483646 ? NaN : e ? Ws(n, r, t) : Ys(n, r, t);
+function il(n, r, t, e = 0, u = 1) {
+	return ol(n, r, t, e, u);
 }
 function al(n, r, t, e) {
-	return il(n, r, t, e);
+	return n = Math.trunc(n), (r = Math.trunc(r)) < 0 || t < 0 || t > 1 || n < 0 || n > r || r > 2147483646 ? NaN : e ? Ks(n, r, t) : Ys(n, r, t);
 }
-function sl(n, r, t, e = t) {
+function sl(n, r, t, e) {
+	return al(n, r, t, e);
+}
+function ll(n, r, t, e = t) {
 	if (n = Math.trunc(n), t = Math.trunc(t), e = Math.trunc(e), n < 0 || r < 0 || r > 1 || t < 0 || t > n || e < t || e > n) return NaN;
 	if (n > 2147483646) return NaN;
-	if (e - t > ll) return Ws(e, n, r) - (t > 0 ? Ws(t - 1, n, r) : 0);
+	if (e - t > cl) return Ks(e, n, r) - (t > 0 ? Ks(t - 1, n, r) : 0);
 	let u = 0;
 	for (let o = t; o <= e; o++) u += Ys(o, n, r);
 	return u;
 }
-var ll = 1e5;
-function cl(n, r, t) {
-	return (n = Math.floor(n)) < 0 || n > 2147483646 || r <= 0 || r >= 1 || t <= 0 || t >= 1 ? NaN : rl(n, r, t);
-}
+var cl = 1e5;
 function fl(n, r, t) {
-	return r = Math.trunc(r), n < 0 || r < 1 || r > Qs ? NaN : t ? function(n, r) {
+	return (n = Math.floor(n)) < 0 || n > 2147483646 || r <= 0 || r >= 1 || t <= 0 || t >= 1 ? NaN : tl(n, r, t);
+}
+function ml(n, r, t) {
+	return r = Math.trunc(r), n < 0 || r < 1 || r > js ? NaN : t ? function(n, r) {
 		return n < 0 ? 0 : xr(r / 2, n / 2);
 	}(n, r) : function(n, r) {
 		return n < 0 ? 0 : 0 === n && 2 === r ? .5 : Math.exp((r / 2 - 1) * Math.log(n) - n / 2 - r / 2 * Math.log(2) - Mr(r / 2));
 	}(n, r);
 }
-function ml(n, r) {
-	return gl(n, r);
-}
 function gl(n, r) {
-	return r = Math.trunc(r), n < 0 || r < 1 || r > Qs ? NaN : Ls(n, r);
+	return hl(n, r);
 }
 function hl(n, r) {
-	return r = Math.trunc(r), n < 0 || n >= 1 || r < 1 || r > Qs ? NaN : Fs(n, r);
+	return r = Math.trunc(r), n < 0 || r < 1 || r > js ? NaN : Fs(n, r);
 }
 function pl(n, r) {
-	return Nl(n, r);
+	return r = Math.trunc(r), n < 0 || n >= 1 || r < 1 || r > js ? NaN : Ps(n, r);
 }
 function Nl(n, r) {
-	return r = Math.trunc(r), n <= 0 || n > 1 || r < 1 || r > Qs ? NaN : Fs(1 - n, r);
+	return Il(n, r);
 }
-function Il(n, t) {
-	const e = Ef(n) ?? Ef(t);
+function Il(n, r) {
+	return r = Math.trunc(r), n <= 0 || n > 1 || r < 1 || r > js ? NaN : Ps(1 - n, r);
+}
+function bl(n, t) {
+	const e = Af(n) ?? Af(t);
 	if (e) return e;
 	const u = n.getRowCount(), o = n.getColumnCount();
 	if (u * o !== t.getRowCount() * t.getColumnCount()) throw r.BuiltIn.NA;
@@ -5617,45 +5617,45 @@ function Il(n, t) {
 			a += (n - t) ** 2 / t, s++;
 		}
 	}
-	return 0 === s ? r.BuiltIn.Div0 : Number.isFinite(a) ? gl(a, i) : r.BuiltIn.Num;
+	return 0 === s ? r.BuiltIn.Div0 : Number.isFinite(a) ? hl(a, i) : r.BuiltIn.Num;
 }
-function bl(n, r) {
-	return Il(n, r);
+function El(n, r) {
+	return bl(n, r);
 }
-function El(n, r, t) {
+function Al(n, r, t) {
 	return t = Math.trunc(t), n <= 0 || n >= 1 || r <= 0 || t < 1 || 1 - n / 2 == 1 ? NaN : function(n, r, t) {
-		return 1 + Math.abs(xs(n / 2, 0, 1) * r / Math.sqrt(t)) - 1;
+		return 1 + Math.abs(Vs(n / 2, 0, 1) * r / Math.sqrt(t)) - 1;
 	}(n, r, t);
 }
-function Al(n, r, t) {
-	return El(n, r, t);
+function dl(n, r, t) {
+	return Al(n, r, t);
 }
-function dl(n, t, e) {
+function Ml(n, t, e) {
 	if (e = Math.trunc(e), n <= 0 || n >= 1 || t <= 0 || e < 1) return NaN;
 	if (1 === e) throw r.BuiltIn.Div0;
-	return e - 1 > Qs || n / 2 < js ? NaN : function(n, r, t) {
-		return 1 + Math.abs(Xs(n / 2, t - 1) * r / Math.sqrt(t)) - 1;
+	return e - 1 > js || n / 2 < $s ? NaN : function(n, r, t) {
+		return 1 + Math.abs(Hs(n / 2, t - 1) * r / Math.sqrt(t)) - 1;
 	}(n, t, e);
 }
-function Ml(n, t) {
-	const e = Af(n, t);
+function Sl(n, t) {
+	const e = df(n, t);
 	return r.isError(e) ? e : null === e ? r.BuiltIn.NA : Number.isFinite(e.ssX) && Number.isFinite(e.ssY) ? 0 === e.ssX || 0 === e.ssY ? r.BuiltIn.Div0 : e.ssXY / Math.sqrt(e.ssX * e.ssY) : r.BuiltIn.Num;
 }
-function Sl(n, r) {
-	return Rl(n, r);
+function Rl(n, r) {
+	return Tl(n, r);
 }
-function Rl(n, t) {
-	const e = Af(n, t);
+function Tl(n, t) {
+	const e = df(n, t);
 	return r.isError(e) ? e : null === e ? r.BuiltIn.NA : 0 === e.n ? r.BuiltIn.Div0 : Number.isFinite(e.ssXY) ? e.ssXY / e.n : r.BuiltIn.Num;
 }
-function Tl(n, t) {
-	const e = Af(n, t);
+function Cl(n, t) {
+	const e = df(n, t);
 	return r.isError(e) ? e : null === e ? r.BuiltIn.NA : e.n <= 1 ? r.BuiltIn.Div0 : Number.isFinite(e.ssXY) ? e.ssXY / (e.n - 1) : r.BuiltIn.Num;
 }
-function Cl(n, r, t) {
-	return cl(n, r, t);
+function wl(n, r, t) {
+	return fl(n, r, t);
 }
-function wl(n) {
+function vl(n) {
 	let t = 0, e = [];
 	for (const r of n) for (const n of r.values()) t += n, e.push(n);
 	const u = e.length;
@@ -5665,38 +5665,38 @@ function wl(n) {
 	for (let n = 0; n < u; n++) t += (e[n] - o) ** 2;
 	return t;
 }
-function vl(n, r, t) {
+function Bl(n, r, t) {
 	return n < 0 || r <= 0 ? NaN : Number.isFinite(r * n) ? t ? ((n, r) => n < 0 ? 0 : 1 - Math.exp(-r * n))(n, r) : ((n, r) => n < 0 ? 0 : r * Math.exp(-r * n))(n, r) : NaN;
 }
-function Bl(n, r, t) {
-	return vl(n, r, t);
+function yl(n, r, t) {
+	return Bl(n, r, t);
 }
-function yl(n, r, t, e) {
-	return n < 0 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > Qs || t > Qs ? NaN : e ? Ps(n, r, t) : function(n, r, t) {
+function Ol(n, r, t, e) {
+	return n < 0 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > js || t > js ? NaN : e ? Us(n, r, t) : function(n, r, t) {
 		return n < 0 ? 0 : 0 === n && r < 2 ? Infinity : 0 === n && 2 === r ? 1 : r < 512 && t < 512 ? 1 / Rr(r / 2, t / 2) * Math.pow(r / t, r / 2) * Math.pow(n, r / 2 - 1) * Math.pow(1 + r / t * n, -(r + t) / 2) : Math.exp(r / 2 * Math.log(r / t) + (r / 2 - 1) * Math.log(n) - (r + t) / 2 * Math.log(1 + r / t * n) - wr(r / 2, t / 2));
 	}(n, r, t));
 }
-function Ol(n, r, t) {
-	return Dl(n, r, t);
-}
 function Dl(n, r, t) {
-	return n < 0 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > Qs || t > Qs ? NaN : function(n, r, t) {
+	return xl(n, r, t);
+}
+function xl(n, r, t) {
+	return n < 0 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > js || t > js ? NaN : function(n, r, t) {
 		if (n < 0) return 1;
 		const e = r * n + t;
 		return Gr(t / e, r * n / e, t / 2, r / 2);
 	}(n, r, t));
 }
-function xl(n, r, t) {
-	return n < 0 || n > 1 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > Qs || t > Qs ? NaN : Us(n, r, t));
-}
 function Vl(n, r, t) {
-	return Ll(n, r, t);
+	return n < 0 || n > 1 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > js || t > js ? NaN : _s(n, r, t));
 }
 function Ll(n, r, t) {
-	return n < 0 || n > 1 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > Qs || t > Qs ? NaN : Us(1 - n, r, t));
+	return Fl(n, r, t);
 }
-function Fl(n, t) {
-	const e = Ef(n) ?? Ef(t);
+function Fl(n, r, t) {
+	return n < 0 || n > 1 || r < 1 || t < 1 ? NaN : (r = Math.trunc(r), t = Math.trunc(t), r > js || t > js ? NaN : _s(1 - n, r, t));
+}
+function Pl(n, t) {
+	const e = Af(n) ?? Af(t);
 	if (e) return e;
 	if (n.hasError()) return n.firstError();
 	if (t.hasError()) return t.firstError();
@@ -5715,24 +5715,24 @@ function Fl(n, t) {
 	for (let n = 0; n < o.length; n++) l += (a - o[n]) ** 2;
 	if (l /= o.length - 1, s = f(s), l = f(l), 0 === s || 0 === l) return r.BuiltIn.Div0;
 	if (!Number.isFinite(s) || !Number.isFinite(l)) return r.BuiltIn.Num;
-	const c = Ps(s / l, u.length - 1, o.length - 1);
+	const c = Us(s / l, u.length - 1, o.length - 1);
 	return 2 * Math.min(c, 1 - c);
 }
-function Pl(n, r) {
-	return Fl(n, r);
+function Ul(n, r) {
+	return Pl(n, r);
 }
-function Ul(n) {
+function _l(n) {
 	return n > -1 && n < 1 ? Math.log((1 + n) / (1 - n)) / 2 : NaN;
 }
-function _l(n) {
+function Gl(n) {
 	const r = Math.exp(2 * n);
 	return r === Number.POSITIVE_INFINITY ? 1 : (r - 1) / (r + 1);
 }
-function Gl(n, r, t) {
-	return Xl(n, r, t);
+function Xl(n, r, t) {
+	return Hl(n, r, t);
 }
-function Xl(n, t, e) {
-	const u = Af(t, e);
+function Hl(n, t, e) {
+	const u = df(t, e);
 	if (r.isError(u)) return u;
 	if (null === u) return r.BuiltIn.NA;
 	if (0 === u.n || 0 === u.ssX) return r.BuiltIn.Div0;
@@ -5740,7 +5740,7 @@ function Xl(n, t, e) {
 	const o = u.ssXY / u.ssX, i = u.yMean - o * u.xMean + o * n;
 	return Number.isFinite(i) ? i : r.BuiltIn.Num;
 }
-function Hl(r, t) {
+function kl(r, t) {
 	if (r = n.flattenAreas(r), t = n.flattenAreas(t), r.hasError()) throw r.firstError();
 	const e = [];
 	for (const n of t.values()) "number" == typeof n && e.push(n);
@@ -5763,42 +5763,42 @@ function Hl(r, t) {
 	for (let n = 0; n < u.length; n++) u[n] > a && s++;
 	return i[e.length][0] = s, i;
 }
-function kl(n) {
+function Wl(n) {
 	return 0 === n || n < 0 && n === Math.trunc(n) ? NaN : Sr(n);
 }
 function Yl(n, r, t, e) {
 	return n < 0 || r <= 0 || t <= 0 ? NaN : Number.isFinite(Mr(r)) && Number.isFinite(n / t * 2) ? e ? function(n, r, t) {
 		return n < 0 ? 0 : xr(r, n / t);
-	}(n, r, t) : Vs(n, r, t) : NaN;
+	}(n, r, t) : Ls(n, r, t) : NaN;
 }
-function Wl(n, r, t, e) {
+function Kl(n, r, t, e) {
 	return Yl(n, r, t, e);
 }
-function Kl(n, r, t) {
+function ql(n, r, t) {
 	return n < 0 || n >= 1 || r <= 0 || t <= 0 ? NaN : (e = t, Pr(n, r) * e);
 	var e;
 }
-function ql(n, r, t) {
-	return Kl(n, r, t);
-}
-function zl(n) {
-	return n <= 0 ? NaN : Mr(n);
+function zl(n, r, t) {
+	return ql(n, r, t);
 }
 function Ql(n) {
 	return n <= 0 ? NaN : Mr(n);
 }
 function jl(n) {
-	return Ds(n, 0, 1) - .5;
+	return n <= 0 ? NaN : Mr(n);
 }
 function $l(n) {
+	return xs(n, 0, 1) - .5;
+}
+function Zl(n) {
 	const r = [];
 	for (const t of n) for (const n of t.values()) {
 		if (n <= 0) return NaN;
 		r.push(n);
 	}
-	return Zs(r);
+	return Js(r);
 }
-function Zl(n) {
+function Jl(n) {
 	let t = 0, e = 0;
 	for (const r of n) for (const n of r.values()) {
 		if (n <= 0) return NaN;
@@ -5807,7 +5807,7 @@ function Zl(n) {
 	if (0 === t) throw r.BuiltIn.NA;
 	return t / e;
 }
-function Jl(n, r, t, e, u) {
+function nc(n, r, t, e, u) {
 	if (n = Math.trunc(n), r = Math.trunc(r), t = Math.trunc(t), e = Math.trunc(e), n < 0 || r < 0 || t < 0 || e < 0) return NaN;
 	if (r > e) return NaN;
 	if (t > e) return NaN;
@@ -5827,11 +5827,11 @@ function Jl(n, r, t, e, u) {
 	for (let n = 0; n <= a; n++) i += o(n);
 	return i;
 }
-function nc(n, r, t, e) {
-	return Jl(n, r, t, e, !1);
+function rc(n, r, t, e) {
+	return nc(n, r, t, e, !1);
 }
-function rc(n, t) {
-	const e = Af(n, t);
+function tc(n, t) {
+	const e = df(n, t);
 	if (r.isError(e)) return e;
 	if (null === e) return r.BuiltIn.NA;
 	if (0 === e.ssX) return r.BuiltIn.Div0;
@@ -5839,7 +5839,7 @@ function rc(n, t) {
 	const u = e.ssXY / e.ssX, o = e.yMean - u * e.xMean;
 	return Number.isFinite(o) ? o : r.BuiltIn.Num;
 }
-function tc(n) {
+function ec(n) {
 	let t = 0;
 	const e = [];
 	for (const r of n) for (const n of r.values()) t += n, e.push(n);
@@ -5848,28 +5848,28 @@ function tc(n) {
 	t /= u;
 	let o = 0;
 	for (let n = 0; n < u; n++) o += Math.pow(e[n] - t, 4);
-	const i = Js(e, !0);
+	const i = nl(e, !0);
 	if (0 === i) throw r.BuiltIn.Div0;
 	return o /= Math.pow(i, 4), u * (u + 1) / ((u - 1) * (u - 2) * (u - 3)) * o - 3 * (u - 1) * (u - 1) / ((u - 2) * (u - 3));
 }
-function ec(n, r, t, e) {
+function uc(n, r, t, e) {
 	return n <= 0 || t <= 0 ? NaN : e ? function(n, r, t) {
 		return n < 0 ? 0 : .5 * Or(-(Math.log(n) - r) / Math.sqrt(2 * t * t));
 	}(n, r, t) : function(n, r, t) {
 		return n <= 0 ? 0 : Math.exp(-Math.log(n) - .5 * Math.log(2 * Math.PI) - Math.log(t) - Math.pow(Math.log(n) - r, 2) / (2 * t * t));
 	}(n, r, t);
 }
-function uc(n, r, t) {
-	return ec(n, r, t, !0);
-}
 function oc(n, r, t) {
+	return uc(n, r, t, !0);
+}
+function ic(n, r, t) {
 	return n <= 0 || n >= 1 || t <= 0 ? NaN : (e = n, u = r, o = t, Math.exp(-1.4142135623730951 * o * Dr(2 * e) + u));
 	var e, u, o;
 }
-function ic(n, r, t) {
-	return oc(n, r, t);
+function ac(n, r, t) {
+	return ic(n, r, t);
 }
-var ac = () => {
+var sc = () => {
 	const t = n.getArgs().getRepeatingArgsAt(0);
 	for (let n = 0; n < t.getLength(); n++) {
 		if (t.getKindAt(n) === o.Reference) {
@@ -5880,17 +5880,17 @@ var ac = () => {
 	}
 	return null;
 };
-function sc(n) {
-	return fc(n);
+function lc(n) {
+	return mc(n);
 }
-var lc = (n) => {
-	for (const t of n) if (1 === t.size && ja(t) && t.entries({ includeEmpty: !1 }).next().done) throw r.BuiltIn.Value;
+var cc = (n) => {
+	for (const t of n) if (1 === t.size && $a(t) && t.entries({ includeEmpty: !1 }).next().done) throw r.BuiltIn.Value;
 };
-function cc(n) {
-	const t = ac();
+function fc(n) {
+	const t = sc();
 	if (t) throw t;
 	for (const r of n) if (r.hasError()) throw r.firstError();
-	lc(n);
+	cc(n);
 	const e = /* @__PURE__ */ new Map();
 	let u = 0;
 	for (const r of n) {
@@ -5913,10 +5913,10 @@ function cc(n) {
 	const i = [...e.entries()].filter(([, { count: n }]) => n === o).sort((n, r) => n[1].firstSeen - r[1].firstSeen).map(([n]) => [n]);
 	return 0 === i.length ? r.BuiltIn.NA : i;
 }
-function fc(n) {
-	const t = ac();
+function mc(n) {
+	const t = sc();
 	if (t) return t;
-	lc(n);
+	cc(n);
 	const e = /* @__PURE__ */ new Map();
 	let u = 0;
 	for (const r of n) {
@@ -5939,86 +5939,86 @@ function fc(n) {
 	for (const [n, { count: r, firstSeen: t }] of e) r < 2 || (r > i || r === i && t < a) && (o = n, i = r, a = t);
 	return null === o ? r.BuiltIn.NA : o;
 }
-function mc(n, r, t, e) {
+function gc(n, r, t, e) {
 	return n = Math.trunc(n), r = Math.trunc(r), t <= 0 || t >= 1 || n < 0 || r < 1 ? NaN : e ? function(n, r, t) {
 		if (n < 0) return 0;
 		let e = 0, u = !1;
-		const o = Math.min(n, Hs);
+		const o = Math.min(n, ks);
 		for (let i = 0; i <= o; i++) {
-			const o = Ks(i, r, t);
+			const o = qs(i, r, t);
 			if (!Number.isFinite(o)) return _r(t, r, Math.floor(n) + 1);
 			if (0 === o && u) return e;
 			0 !== o && (u = !0), e += o;
 		}
-		return u && n <= Hs ? e : _r(t, r, Math.floor(n) + 1);
-	}(n, r, t) : Ks(n, r, t);
+		return u && n <= ks ? e : _r(t, r, Math.floor(n) + 1);
+	}(n, r, t) : qs(n, r, t);
 }
-function gc(n, r, t) {
-	return mc(n, r, t, !1);
+function hc(n, r, t) {
+	return gc(n, r, t, !1);
 }
-function hc(n, r, t, e) {
+function pc(n, r, t, e) {
 	if (t <= 0) return NaN;
-	if (e) return Ds(n, r, t);
+	if (e) return xs(n, r, t);
 	const u = (n - r) / t;
-	return Number.isFinite(u * u) ? Os(n, r, t) : NaN;
-}
-function pc(n, r, t, e) {
-	return hc(n, r, t, e);
+	return Number.isFinite(u * u) ? Ds(n, r, t) : NaN;
 }
-function Nc(n, r, t) {
-	return n <= 0 || n >= 1 || t <= 0 ? NaN : xs(n, r, t);
+function Nc(n, r, t, e) {
+	return pc(n, r, t, e);
 }
 function Ic(n, r, t) {
-	return Nc(n, r, t);
+	return n <= 0 || n >= 1 || t <= 0 ? NaN : Vs(n, r, t);
 }
-function bc(n, r) {
-	return r ? Ds(n, 0, 1) : Number.isFinite(n * n) ? Os(n, 0, 1) : NaN;
+function bc(n, r, t) {
+	return Ic(n, r, t);
 }
-function Ec(n) {
-	return bc(n, !0);
+function Ec(n, r) {
+	return r ? xs(n, 0, 1) : Number.isFinite(n * n) ? Ds(n, 0, 1) : NaN;
 }
 function Ac(n) {
-	return n <= 0 || n >= 1 ? NaN : xs(n, 0, 1);
+	return Ec(n, !0);
 }
 function dc(n) {
-	return Ac(n);
+	return n <= 0 || n >= 1 ? NaN : Vs(n, 0, 1);
 }
-function Mc(n, r) {
-	return Ml(n, r);
+function Mc(n) {
+	return dc(n);
 }
-function Sc(r, t) {
-	return Tc(r = n.flattenAreas(r), t);
+function Sc(n, r) {
+	return Sl(n, r);
 }
 function Rc(r, t) {
+	return Cc(r = n.flattenAreas(r), t);
+}
+function Tc(r, t) {
 	if ((r = n.flattenAreas(r)).hasError()) throw r.firstError();
 	if (t <= 0 || t >= 1) return NaN;
 	const e = r.getStats().getSortedNumbers().getPercentile(t, !0);
 	return null === e ? NaN : e;
 }
-function Tc(r, t) {
+function Cc(r, t) {
 	if ((r = n.flattenAreas(r)).hasError()) throw r.firstError();
 	if (t < 0 || t > 1) return NaN;
 	const e = r.getStats().getSortedNumbers().getPercentile(t, !1);
 	return null === e ? NaN : e;
 }
-function Cc(r, t, e = 3) {
-	return vc(r = n.flattenAreas(r), t, e);
+function wc(r, t, e = 3) {
+	return Bc(r = n.flattenAreas(r), t, e);
 }
-function wc(t, e, u = 3) {
+function vc(t, e, u = 3) {
 	return (t = n.flattenAreas(t)).hasError() ? t.firstError() : t.getStats().getSortedNumbers().getPercentRankOf(e, !0, u) ?? r.BuiltIn.NA;
 }
-function vc(t, e, u = 3) {
+function Bc(t, e, u = 3) {
 	return (t = n.flattenAreas(t)).hasError() ? t.firstError() : t.getStats().getSortedNumbers().getPercentRankOf(e, !1, u) ?? r.BuiltIn.NA;
 }
-function Bc(n) {
-	return Number.isFinite(n * n) ? Math.exp(-.5 * n * n) / bf : NaN;
+function yc(n) {
+	return Number.isFinite(n * n) ? Math.exp(-.5 * n * n) / Ef : NaN;
 }
-function yc(n, r, t) {
+function Oc(n, r, t) {
 	return n < 0 || r < 0 ? NaN : (n = Math.trunc(n), Number.isFinite(Mr(n + 1)) ? t ? function(n, r) {
 		if (n < 0) return 0;
 		if (n <= 170) {
 			const t = [];
-			for (let e = 0; e <= n; e++) t.push(ks(e, r));
+			for (let e = 0; e <= n; e++) t.push(Ws(e, r));
 			if (t.every(Number.isFinite)) {
 				let n = 0;
 				for (let r = t.length - 1; r >= 0; r--) n += t[r];
@@ -6026,13 +6026,13 @@ function yc(n, r, t) {
 			}
 		}
 		return 1 - xr(Math.floor(n) + 1, r);
-	}(n, r) : ks(n, r) : NaN);
+	}(n, r) : Ws(n, r) : NaN);
 }
-function Oc(n, r, t) {
-	return yc(n, r, t);
+function Dc(n, r, t) {
+	return Oc(n, r, t);
 }
-function Dc(n, t, e, u) {
-	lc([n, t]);
+function xc(n, t, e, u) {
+	cc([n, t]);
 	const o = n.flatten(), i = t.flatten();
 	if (o.getRowCount() !== i.getRowCount()) return r.BuiltIn.NA;
 	if (n.hasError()) return n.firstError();
@@ -6042,38 +6042,38 @@ function Dc(n, t, e, u) {
 	for (const [[n, r]] of o.alignValues([i])) "number" == typeof n && "number" == typeof r && (s += r, n >= e && n <= a && (l += r));
 	return 1e10 !== Math.round(1e10 * s) ? r.BuiltIn.Num : l;
 }
-function xc(r, t) {
-	return Lc(r = n.flattenAreas(r), t);
-}
 function Vc(r, t) {
+	return Fc(r = n.flattenAreas(r), t);
+}
+function Lc(r, t) {
 	if ((r = n.flattenAreas(r)).hasError()) throw r.firstError();
 	if ((t = Math.trunc(t)) < 1 || t > 3) return NaN;
 	const e = t / 4, u = r.getStats().getSortedNumbers().getPercentile(e, !0);
 	return null === u ? NaN : u;
 }
-function Lc(r, t) {
+function Fc(r, t) {
 	if ((r = n.flattenAreas(r)).hasError()) throw r.firstError();
 	if ((t = Math.trunc(t)) < 0 || t > 4) return NaN;
 	const e = t / 4, u = r.getStats().getSortedNumbers().getPercentile(e, !1);
 	return null === u ? NaN : u;
 }
-function Fc(n, r, t = !1) {
-	return Uc(n, r, t);
+function Pc(n, r, t = !1) {
+	return _c(n, r, t);
 }
-function Pc(t, e, u = !1) {
+function Uc(t, e, u = !1) {
 	const o = n.flattenAreas(e);
 	if (o.hasError()) return o.firstError();
 	const i = o.getStats().getSortedNumbers().getRankOf(t, !u, !0);
 	return null === i ? r.BuiltIn.NA : i;
 }
-function Uc(t, e, u = !1) {
+function _c(t, e, u = !1) {
 	const o = n.flattenAreas(e);
 	if (o.hasError()) return o.firstError();
 	const i = o.getStats().getSortedNumbers().getRankOf(t, !u, !1);
 	return null === i ? r.BuiltIn.NA : i;
 }
-function _c(n, t) {
-	const e = Af(n, t);
+function Gc(n, t) {
+	const e = df(n, t);
 	if (r.isError(e)) return e;
 	if (null === e) return r.BuiltIn.NA;
 	if (!Number.isFinite(e.ssX) || !Number.isFinite(e.ssY)) return r.BuiltIn.Num;
@@ -6081,7 +6081,7 @@ function _c(n, t) {
 	const u = e.ssXY / Math.sqrt(e.ssX * e.ssY);
 	return u * u;
 }
-function Gc(n) {
+function Xc(n) {
 	let t = 0, e = 0;
 	for (const r of n) {
 		if (r.hasError()) return r.firstError();
@@ -6103,7 +6103,7 @@ function Gc(n) {
 	});
 	return t / ((t - 1) * (t - 2)) * a;
 }
-function Xc(n) {
+function Hc(n) {
 	let t = 0, e = 0;
 	for (const r of n) {
 		if (r.hasError()) return r.firstError();
@@ -6125,8 +6125,8 @@ function Xc(n) {
 	});
 	return a / t;
 }
-function Hc(n, t) {
-	const e = Af(n, t);
+function kc(n, t) {
+	const e = df(n, t);
 	if (r.isError(e)) return e;
 	if (null === e) return r.BuiltIn.NA;
 	if (0 === e.ssX) return r.BuiltIn.Div0;
@@ -6134,67 +6134,67 @@ function Hc(n, t) {
 	const u = e.ssXY / e.ssX;
 	return Number.isFinite(u) ? u : r.BuiltIn.Num;
 }
-function kc(n, r, t) {
+function Wc(n, r, t) {
 	return t <= 0 ? NaN : (n - r) / t;
 }
 function Yc(n) {
-	const r = lf(n);
+	const r = cf(n);
 	return Math.sqrt(r);
 }
-function Wc(n) {
-	return Yc(n);
-}
 function Kc(n) {
-	const r = af(n);
-	return Math.sqrt(r);
+	return Yc(n);
 }
 function qc(n) {
-	return Kc(n);
+	const r = sf(n);
+	return Math.sqrt(r);
 }
 function zc(n) {
-	const r = mf(n);
-	return Math.sqrt(r);
+	return qc(n);
 }
 function Qc(n) {
 	const r = gf(n);
 	return Math.sqrt(r);
 }
-function jc(n, t) {
-	const e = Af(n, t);
+function jc(n) {
+	const r = hf(n);
+	return Math.sqrt(r);
+}
+function $c(n, t) {
+	const e = df(n, t);
 	return r.isError(e) ? e : null === e ? r.BuiltIn.NA : e.n < 3 || 0 === e.ssX ? r.BuiltIn.Div0 : Number.isFinite(e.ssX) && Number.isFinite(e.ssY) ? Math.sqrt((e.ssY - e.ssXY * e.ssXY / e.ssX) / (e.n - 2)) : r.BuiltIn.Num;
 }
-function $c(n, r, t) {
-	return (r = Math.trunc(r)) < 1 || r > Qs ? NaN : t ? 0 === n ? .5 : function(n, r) {
+function Zc(n, r, t) {
+	return (r = Math.trunc(r)) < 1 || r > js ? NaN : t ? 0 === n ? .5 : function(n, r) {
 		if (!Number.isFinite(n * n)) return NaN;
-		const t = .5 * Gs(n, r);
+		const t = .5 * Xs(n, r);
 		return n > 0 ? 1 - t : t;
 	}(n, r) : function(n, r) {
 		return r = r > 1e100 ? 1e100 : r, 1 / (Math.sqrt(r) * Rr(.5, r / 2)) * Math.pow(1 + n * n / r, -(r + 1) / 2);
 	}(n, r);
 }
-function Zc(n, r, t) {
-	return n < 0 || 1 !== (t = Math.floor(t + nl)) && 2 !== t ? NaN : 1 === t ? nf(n, r) : Jc(n, r);
-}
-function Jc(n, r) {
-	return (r = Math.trunc(r)) < 1 || n < 0 || r > Qs ? NaN : 2 * _s(n, r);
+function Jc(n, r, t) {
+	return n < 0 || 1 !== (t = Math.floor(t + rl)) && 2 !== t ? NaN : 1 === t ? rf(n, r) : nf(n, r);
 }
 function nf(n, r) {
-	return (r = Math.trunc(r)) < 1 || r > Qs ? NaN : 0 === n ? .5 : _s(n, r);
+	return (r = Math.trunc(r)) < 1 || n < 0 || r > js ? NaN : 2 * Gs(n, r);
 }
 function rf(n, r) {
-	return n <= 0 || n >= 1 || r < 1 || (r = Math.trunc(r)) > Qs ? NaN : 1 === r ? Math.tan(Math.PI * (n - .5)) : Xs(n, r);
+	return (r = Math.trunc(r)) < 1 || r > js ? NaN : 0 === n ? .5 : Gs(n, r);
 }
 function tf(n, r) {
-	return ef(n, r);
+	return n <= 0 || n >= 1 || r < 1 || (r = Math.trunc(r)) > js ? NaN : 1 === r ? Math.tan(Math.PI * (n - .5)) : Hs(n, r);
 }
 function ef(n, r) {
-	return n <= 0 || r < 1 || (r = Math.trunc(r)) > Qs ? NaN : 1 === r ? Math.tan(Math.PI * (.5 - n / 2)) : -Xs(n / 2, r);
+	return uf(n, r);
+}
+function uf(n, r) {
+	return n <= 0 || r < 1 || (r = Math.trunc(r)) > js ? NaN : 1 === r ? Math.tan(Math.PI * (.5 - n / 2)) : -Hs(n / 2, r);
 }
-function uf(r, t) {
+function of(r, t) {
 	if ((r = n.flattenAreas(r)).hasError()) return r.firstError();
 	if (t < 0 || t >= 1) return NaN;
 	const e = [];
-	for (const { value: n } of r.entries(of)) "number" == typeof n && e.push(n);
+	for (const { value: n } of r.entries(af)) "number" == typeof n && e.push(n);
 	const u = e.length, o = Math.floor(u * t / 2);
 	let i = 0, a = 0;
 	if (0 === o) {
@@ -6210,20 +6210,20 @@ function uf(r, t) {
 	}
 	return 0 === a ? NaN : i / a;
 }
-var of = { axis: t.Axis.Row };
-function af(n) {
+var af = { axis: t.Axis.Row };
+function sf(n) {
 	let r = 0, t = 0;
-	const e = es(n);
+	const e = us(n);
 	for (const u of n) for (const n of u.values()) r += Math.pow(n - e, 2), t++;
 	const u = r / t;
 	return isNaN(u) ? NaN : u;
 }
-function sf(n) {
-	return af(n);
-}
 function lf(n) {
+	return sf(n);
+}
+function cf(n) {
 	let t = 0, e = 0;
-	const o = es(n);
+	const o = us(n);
 	for (const r of n) for (const n of r.values({
 		type: u.Number,
 		onError: "value"
@@ -6231,16 +6231,16 @@ function lf(n) {
 	if (e < 2) throw r.BuiltIn.Div0;
 	return t / (e - 1);
 }
-function cf(n) {
-	return lf(n);
+function ff(n) {
+	return cf(n);
 }
-var ff = (n) => {
+var mf = (n) => {
 	const r = [];
 	let t = 0;
 	for (const e of n) {
-		const n = ja(e);
+		const n = $a(e);
 		for (const u of e.values({ type: null })) {
-			const e = ns(u, n);
+			const e = rs(u, n);
 			null !== e && (r.push(e), t += e);
 		}
 	}
@@ -6252,17 +6252,17 @@ var ff = (n) => {
 		count: e
 	};
 };
-function mf(n) {
-	const { sigma: t, count: e } = ff(n);
+function gf(n) {
+	const { sigma: t, count: e } = mf(n);
 	if (e < 2) throw r.BuiltIn.Div0;
 	return t / (e - 1);
 }
-function gf(n) {
-	const { sigma: t, count: e } = ff(n);
+function hf(n) {
+	const { sigma: t, count: e } = mf(n);
 	if (0 === e) throw r.BuiltIn.Div0;
 	return t / e;
 }
-function hf(n, t, e, u) {
+function pf(n, t, e, u) {
 	if (n < 0 || t <= 0 || e <= 0) return NaN;
 	if (!u && 0 === n) return 0;
 	const o = Math.pow(n / e, t);
@@ -6273,10 +6273,10 @@ function hf(n, t, e, u) {
 	if (0 === a) throw r.BuiltIn.Div0;
 	return i / a * Math.exp(-o);
 }
-function pf(n, r, t, e) {
-	return hf(n, r, t, e);
+function Nf(n, r, t, e) {
+	return pf(n, r, t, e);
 }
-function Nf(t, e, u) {
+function If(t, e, u) {
 	const o = [];
 	if (void 0 === t) o.push(0);
 	else {
@@ -6296,14 +6296,14 @@ function Nf(t, e, u) {
 		if (0 === n) throw r.BuiltIn.Div0;
 		u = Math.sqrt(n / (i - 1));
 	} else if (!(u > 0)) throw r.BuiltIn.Num;
-	return 1 - bc((a - e) / (u / Math.sqrt(i)), !0);
+	return 1 - Ec((a - e) / (u / Math.sqrt(i)), !0);
 }
-function If(n, r, t) {
-	return Nf(n, r, t);
+function bf(n, r, t) {
+	return If(n, r, t);
 }
-var bf = 2.5066282746310002, Ef = (n) => 1 === n.size && ja(n) ? n.hasError() ? n.firstError() : n.entries({ includeEmpty: !1 }).next().done ? r.BuiltIn.Value : null : null;
-function Af(n, t) {
-	const e = Ef(n) ?? Ef(t);
+var Ef = 2.5066282746310002, Af = (n) => 1 === n.size && $a(n) ? n.hasError() ? n.firstError() : n.entries({ includeEmpty: !1 }).next().done ? r.BuiltIn.Value : null : null;
+function df(n, t) {
+	const e = Af(n) ?? Af(t);
 	if (e) return e;
 	const u = n.getRowCount(), o = n.getColumnCount();
 	if (u * o !== t.getRowCount() * t.getColumnCount()) return null;
@@ -6333,11 +6333,11 @@ function Af(n, t) {
 		ssXY: p
 	};
 }
-var df = c({
-	DELAY: () => Mf,
-	WAIT: () => Cf
+var Mf = c({
+	DELAY: () => Sf,
+	WAIT: () => wf
 });
-async function Mf(n, r, t = "No label") {
+async function Sf(n, r, t = "No label") {
 	return new Promise((t) => {
 		setTimeout(() => {
 			t(r);
@@ -6345,82 +6345,82 @@ async function Mf(n, r, t = "No label") {
 	});
 }
 globalThis.debugEventTarget ??= new EventTarget();
-var Sf = globalThis.debugEventTarget, Rf = /* @__PURE__ */ new Map();
-function Tf(n) {
+var Rf = globalThis.debugEventTarget, Tf = /* @__PURE__ */ new Map();
+function Cf(n) {
 	const { inbox: r, waiters: t } = function(n) {
-		if (Rf.has(n)) return Rf.get(n);
+		if (Tf.has(n)) return Tf.get(n);
 		const r = {
 			inbox: [],
 			waiters: []
 		};
-		return Sf.addEventListener(n, (n) => {
+		return Rf.addEventListener(n, (n) => {
 			r.waiters.length ? r.waiters.shift()(n.detail) : r.inbox.push(n.detail);
-		}), Rf.set(n, r), r;
+		}), Tf.set(n, r), r;
 	}(n);
 	return r.length ? Promise.resolve(r.shift()) : new Promise((n) => t.push(n));
 }
-async function Cf(n, r) {
-	const t = await Tf(n);
+async function wf(n, r) {
+	const t = await Cf(n);
 	let e = r?.getValueAt(0, 0) ?? "", u = `event["${n}"`;
 	return void 0 !== t && (u += `, payload: ${t}`), "" !== e && (u += `, input: ${e}`), u += "]", console.log(u), "" + t + e;
 }
-var wf = c({
-	ARRAYTOTEXT: () => Of,
-	ASC: () => yf,
-	CHAR: () => Df,
-	CLEAN: () => xf,
-	CODE: () => Vf,
-	CONCAT: () => Lf,
-	CONCATENATE: () => Pf,
-	DBCS: () => _f,
-	DETECTLANGUAGE: () => Uf,
-	DOLLAR: () => Gf,
-	EXACT: () => Xf,
-	FIND: () => Hf,
-	FINDB: () => kf,
+var vf = c({
+	ARRAYTOTEXT: () => Df,
+	ASC: () => Of,
+	CHAR: () => xf,
+	CLEAN: () => Vf,
+	CODE: () => Lf,
+	CONCAT: () => Ff,
+	CONCATENATE: () => Uf,
+	DBCS: () => Gf,
+	DETECTLANGUAGE: () => _f,
+	DOLLAR: () => Xf,
+	EXACT: () => Hf,
+	FIND: () => kf,
+	FINDB: () => Wf,
 	FIXED: () => Yf,
-	JOIN: () => Wf,
-	LEFT: () => Kf,
-	LEFTB: () => qf,
-	LEN: () => zf,
-	LENB: () => Qf,
-	LOWER: () => jf,
-	MID: () => $f,
-	MIDB: () => Zf,
-	NUMBERVALUE: () => Jf,
-	PROPER: () => nm,
-	REPLACE: () => rm,
-	REPLACEB: () => tm,
-	REPT: () => em,
-	RIGHT: () => um,
-	RIGHTB: () => om,
-	SEARCH: () => im,
-	SEARCHB: () => am,
-	SPLIT: () => sm,
-	SUBSTITUTE: () => lm,
-	T: () => cm,
-	TEXT: () => mm,
-	TEXTAFTER: () => gm,
-	TEXTBEFORE: () => hm,
-	TEXTJOIN: () => pm,
-	TEXTSPLIT: () => Nm,
-	TRANSLATE: () => Im,
-	TRIM: () => bm,
-	UNICHAR: () => Em,
-	UNICODE: () => Am,
-	UPPER: () => dm,
-	VALUE: () => Mm,
-	VALUETOTEXT: () => Sm
-}), vf = /* @__PURE__ */ new Set([
+	JOIN: () => Kf,
+	LEFT: () => qf,
+	LEFTB: () => zf,
+	LEN: () => Qf,
+	LENB: () => jf,
+	LOWER: () => $f,
+	MID: () => Zf,
+	MIDB: () => Jf,
+	NUMBERVALUE: () => nm,
+	PROPER: () => rm,
+	REPLACE: () => tm,
+	REPLACEB: () => em,
+	REPT: () => um,
+	RIGHT: () => om,
+	RIGHTB: () => im,
+	SEARCH: () => am,
+	SEARCHB: () => sm,
+	SPLIT: () => lm,
+	SUBSTITUTE: () => cm,
+	T: () => fm,
+	TEXT: () => gm,
+	TEXTAFTER: () => hm,
+	TEXTBEFORE: () => pm,
+	TEXTJOIN: () => Nm,
+	TEXTSPLIT: () => Im,
+	TRANSLATE: () => bm,
+	TRIM: () => Em,
+	UNICHAR: () => Am,
+	UNICODE: () => dm,
+	UPPER: () => Mm,
+	VALUE: () => Sm,
+	VALUETOTEXT: () => Rm
+}), Bf = /* @__PURE__ */ new Set([
 	32,
 	9,
 	13,
 	10
-]), Bf = 255;
-function yf(n) {
-	return Rm() ? Bm(n) : n;
+]), yf = 255;
+function Of(n) {
+	return Tm() ? ym(n) : n;
 }
-function Of(n, t = 0) {
+function Df(n, t = 0) {
 	if (0 !== (t = Math.floor(t)) && 1 !== t) throw r.BuiltIn.Value;
 	const e = 1 === t;
 	if (1 === n.size) {
@@ -6432,10 +6432,10 @@ function Of(n, t = 0) {
 	if (!e) {
 		if (1 === n.size) {
 			const r = n.getValueAt(0, 0);
-			return null === r ? null : Sm(r, t);
+			return null === r ? null : Rm(r, t);
 		}
 		const { rows: r, columns: e } = n.getShape(), u = [];
-		for (let o = 0; o < r; o++) for (let r = 0; r < e; r++) u.push(Sm(n.getValueAt(o, r), t));
+		for (let o = 0; o < r; o++) for (let r = 0; r < e; r++) u.push(Rm(n.getValueAt(o, r), t));
 		return u.join(", ");
 	}
 	const o = n.getValues();
@@ -6443,35 +6443,35 @@ function Of(n, t = 0) {
 	const i = o.length;
 	for (let n = 0; n < i; n++) {
 		const r = o[n], e = r.length;
-		for (let n = 0; n < e; n++) u += Sm(r[n], t), n < e - 1 && (u += ",");
+		for (let n = 0; n < e; n++) u += Rm(r[n], t), n < e - 1 && (u += ",");
 		n < i - 1 && (u += ";");
 	}
 	return e && (u += "}"), u;
 }
-function Df(n) {
-	const t = _m(n);
+function xf(n) {
+	const t = Gm(n);
 	if (!(t >= 1 && t <= 255)) throw r.BuiltIn.Value;
 	return String.fromCharCode(t);
 }
-function xf(n) {
+function Vf(n) {
 	return n.replace(/[\x00-\x1F\x80-\x9F]/g, "");
 }
-function Vf(n) {
+function Lf(n) {
 	if (0 === n.length) throw r.BuiltIn.Value;
 	return n.charCodeAt(0);
 }
-function Lf(n) {
+function Ff(n) {
 	let t = "";
 	for (const u of n) for (const n of u.values()) if (t += n, t.length > e.MAX_TEXT_LENGTH) throw r.BuiltIn.Calc;
 	return t;
 }
-var Ff = {
+var Pf = {
 	type: u.String,
 	coerce: [u.Boolean, u.Number],
 	onError: "value",
 	misalignValue: r.BuiltIn.NA
 };
-function Pf(t) {
+function Uf(t) {
 	let u = n.createRange(1, 1, "");
 	for (const o of t) {
 		const t = r.isError(o) ? n.createRange(1, 1, o) : o;
@@ -6483,78 +6483,78 @@ function Pf(t) {
 			let o = e.MAX_TEXT_LENGTH;
 			const i = u.charCodeAt(o - 1), a = u.charCodeAt(o);
 			return i >= 55296 && i <= 56319 && a >= 56320 && a <= 57343 && o--, u.slice(0, o);
-		}, Ff);
+		}, Pf);
 	}
 	return 1 === u.getRowCount() && 1 === u.getColumnCount() ? u.getValueAt(0, 0) ?? "" : u;
 }
-function Uf(n) {
+function _f(n) {
 	return r.BuiltIn.NA;
 }
-function _f(n) {
-	return Rm() ? vm(n) : n;
+function Gf(n) {
+	return Tm() ? Bm(n) : n;
 }
-function Gf(t, e = 2) {
-	if ((e = Math.trunc(e)) > Fm) throw r.BuiltIn.Value;
-	t = Lm(t, e < 0 ? e : Math.min(e, 15)), e < 0 && (e = 0, t = t || 0);
+function Xf(t, e = 2) {
+	if ((e = Math.trunc(e)) > Pm) throw r.BuiltIn.Value;
+	t = Fm(t, e < 0 ? e : Math.min(e, 15)), e < 0 && (e = 0, t = t || 0);
 	const u = n.getRuntime().getLocaleProfile().currencySymbol, o = e > 0 ? `.${"0".repeat(e)}` : "", i = `(${u}#,##0${o})`, a = Object.is(t, -0) ? i : `${u}#,##0${o}_);${i}`;
-	if (Um(t, e, !0, u.length) > Pm) throw r.BuiltIn.Value;
+	if (_m(t, e, !0, u.length) > Um) throw r.BuiltIn.Value;
 	return n.getNumberFormat(a, t).trim();
 }
-function Xf(n, r) {
+function Hf(n, r) {
 	return n === r;
 }
-function Hf(n, t, e = 1) {
-	e = _m(e);
-	const u = Dm(t), o = u ? Qm(t) : t.length;
+function kf(n, t, e = 1) {
+	e = Gm(e);
+	const u = xm(t), o = u ? jm(t) : t.length;
 	if (e < 1 || e > o + 1) throw r.BuiltIn.Value;
-	const i = u ? jm(t, e - 1) : e - 1, a = t.indexOf(n, i);
+	const i = u ? $m(t, e - 1) : e - 1, a = t.indexOf(n, i);
 	if (-1 === a) throw r.BuiltIn.Value;
-	return u ? $m(t, a) + 1 : a + 1;
+	return u ? Zm(t, a) + 1 : a + 1;
 }
-function kf(n, t, e = 1) {
-	if ((e = _m(e)) < 1 || e > t.length + 1) throw r.BuiltIn.Value;
+function Wf(n, t, e = 1) {
+	if ((e = Gm(e)) < 1 || e > t.length + 1) throw r.BuiltIn.Value;
 	const u = t.indexOf(n, e - 1);
 	if (-1 === u) throw r.BuiltIn.Value;
 	return u + 1;
 }
 function Yf(t, e = 2, u = !1) {
-	if ((e = Math.trunc(e)) > Fm) throw r.BuiltIn.Value;
-	t = Lm(t, e < 0 ? e : Math.min(e, 15)), e < 0 && (e = 0);
+	if ((e = Math.trunc(e)) > Pm) throw r.BuiltIn.Value;
+	t = Fm(t, e < 0 ? e : Math.min(e, 15)), e < 0 && (e = 0);
 	const o = `${u ? "" : "#,"}##0${e > 0 ? `.${"0".repeat(e)}` : ""}`;
-	if (Um(t, e, !u, 0) > Pm) throw r.BuiltIn.Value;
+	if (_m(t, e, !u, 0) > Um) throw r.BuiltIn.Value;
 	return n.getNumberFormat(o, t).trim();
 }
-function Wf(n, r) {
-	return pm([n], !0, [r]);
+function Kf(n, r) {
+	return Nm([n], !0, [r]);
 }
-function Kf(n, t = 1) {
+function qf(n, t = 1) {
 	if (t < 0) throw r.BuiltIn.Value;
-	return t = _m(t), Dm(n) ? n.slice(0, jm(n, t)) : t > n.length ? n : n.slice(0, t);
-}
-function qf(n, r = 1) {
-	return Kf(n, r);
+	return t = Gm(t), xm(n) ? n.slice(0, $m(n, t)) : t > n.length ? n : n.slice(0, t);
 }
-function zf(n) {
-	return xm.test(n) ? Qm(n) : n.length;
+function zf(n, r = 1) {
+	return qf(n, r);
 }
 function Qf(n) {
-	return n.length;
+	return Vm.test(n) ? jm(n) : n.length;
 }
 function jf(n) {
-	return zm(n, !1);
+	return n.length;
 }
-function $f(n, t, e) {
-	if (t < 1 || e < 0) return r.BuiltIn.Value;
-	if (t = Math.trunc(t), e = Math.trunc(e), !Dm(n)) return t > n.length ? "" : n.slice(t - 1, t + e - 1);
-	const u = jm(n, t - 1);
-	return u >= n.length ? "" : n.slice(u, jm(n, t - 1 + e));
+function $f(n) {
+	return Qm(n, !1);
 }
 function Zf(n, t, e) {
+	if (t < 1 || e < 0) return r.BuiltIn.Value;
+	if (t = Math.trunc(t), e = Math.trunc(e), !xm(n)) return t > n.length ? "" : n.slice(t - 1, t + e - 1);
+	const u = $m(n, t - 1);
+	return u >= n.length ? "" : n.slice(u, $m(n, t - 1 + e));
+}
+function Jf(n, t, e) {
 	return t < 1 || e < 0 ? r.BuiltIn.Value : (t = Math.trunc(t), e = Math.trunc(e), t > n.length ? "" : n.slice(t - 1, t - 1 + e));
 }
-function Jf(t, e, u) {
+function nm(t, e, u) {
 	if (0 === e?.length || 0 === u?.length) throw r.BuiltIn.Value;
-	if (t.length > Bf) throw r.BuiltIn.Value;
+	if (t.length > yf) throw r.BuiltIn.Value;
 	if (0 === t.length) return 0;
 	const o = n.getRuntime().getLocaleProfile(), i = void 0 !== e ? e[0] : o.decimal;
 	let a = void 0 !== u ? u[0] : o.group;
@@ -6564,7 +6564,7 @@ function Jf(t, e, u) {
 	}
 	const s = [];
 	let l = !1, c = 0;
-	for (; c < t.length;) if (vf.has(t.charCodeAt(c))) c += 1;
+	for (; c < t.length;) if (Bf.has(t.charCodeAt(c))) c += 1;
 	else if (!l && t.startsWith(a, c)) c += a.length;
 	else if (t.startsWith(i, c)) l = !0, s.push(o.decimal), c += i.length;
 	else {
@@ -6578,52 +6578,52 @@ function Jf(t, e, u) {
 	for (let n = 0; n < f; n++) m /= 100;
 	return m;
 }
-function nm(n) {
-	return (n = zm(n, !1)).replace(/(^|\P{L})(\p{L})/gu, (n, r, t) => r + zm(t, !0));
-}
-function rm(n, t, e, u) {
-	return e + Vm < 0 ? r.BuiltIn.Value : (t = _m(t), e = _m(e), t < 1 ? r.BuiltIn.Value : Dm(n) ? n.slice(0, jm(n, t - 1)) + u + n.slice(jm(n, t - 1 + e)) : n.slice(0, t - 1) + u + n.slice(t - 1 + e));
+function rm(n) {
+	return (n = Qm(n, !1)).replace(/(^|\P{L})(\p{L})/gu, (n, r, t) => r + Qm(t, !0));
 }
 function tm(n, t, e, u) {
-	return e + Vm < 0 ? r.BuiltIn.Value : (t = _m(t), e = _m(e), t < 1 ? r.BuiltIn.Value : n.slice(0, t - 1) + u + n.slice(t - 1 + e));
+	return e + Lm < 0 ? r.BuiltIn.Value : (t = Gm(t), e = Gm(e), t < 1 ? r.BuiltIn.Value : xm(n) ? n.slice(0, $m(n, t - 1)) + u + n.slice($m(n, t - 1 + e)) : n.slice(0, t - 1) + u + n.slice(t - 1 + e));
+}
+function em(n, t, e, u) {
+	return e + Lm < 0 ? r.BuiltIn.Value : (t = Gm(t), e = Gm(e), t < 1 ? r.BuiltIn.Value : n.slice(0, t - 1) + u + n.slice(t - 1 + e));
 }
-function em(n, t) {
+function um(n, t) {
 	return (t = Math.floor(t)) < 0 || n.length * t > e.MAX_TEXT_LENGTH ? r.BuiltIn.Value : n.repeat(t);
 }
-function um(n, t = 1) {
+function om(n, t = 1) {
 	if (t < 0) throw r.BuiltIn.Value;
-	if (t = _m(t), !Dm(n)) {
+	if (t = Gm(t), !xm(n)) {
 		const r = n.length;
 		return t > r ? n : n.slice(r - t);
 	}
-	const e = Qm(n);
-	return t >= e ? n : n.slice(jm(n, e - t));
+	const e = jm(n);
+	return t >= e ? n : n.slice($m(n, e - t));
 }
-function om(n, r = 1) {
-	return um(n, r);
+function im(n, r = 1) {
+	return om(n, r);
 }
-function im(n, t, e = 1) {
-	e = _m(e);
-	const u = Dm(t), o = u ? Qm(t) : t.length;
+function am(n, t, e = 1) {
+	e = Gm(e);
+	const u = xm(t), o = u ? jm(t) : t.length;
 	if (e < 1 || e > o) throw r.BuiltIn.Value;
-	const a = i.toRegex(km(n), "i"), s = u ? jm(t, e - 1) : e - 1, l = km(t).slice(s).search(a);
+	const a = i.toRegex(Wm(n), "i"), s = u ? $m(t, e - 1) : e - 1, l = Wm(t).slice(s).search(a);
 	if (-1 === l) throw r.BuiltIn.Value;
-	return u ? $m(t, s + l) + 1 : l + e;
+	return u ? Zm(t, s + l) + 1 : l + e;
 }
-function am(n, t, e = 1) {
-	if ((e = _m(e)) < 1 || e > t.length) throw r.BuiltIn.Value;
-	const u = i.toRegex(km(n), "i"), o = km(t).slice(e - 1).search(u);
+function sm(n, t, e = 1) {
+	if ((e = Gm(e)) < 1 || e > t.length) throw r.BuiltIn.Value;
+	const u = i.toRegex(Wm(n), "i"), o = Wm(t).slice(e - 1).search(u);
 	if (-1 === o) throw r.BuiltIn.Value;
 	return o + e;
 }
-function sm(n, r, t = !0, e = !0) {
-	return Nm(n, t ? r.split("") : [r], void 0, e);
+function lm(n, r, t = !0, e = !0) {
+	return Im(n, t ? r.split("") : [r], void 0, e);
 }
-function lm(t, u, o, i) {
+function cm(t, u, o, i) {
 	let a = -1;
 	if (void 0 !== i) {
 		if (null === i) return r.BuiltIn.Value;
-		if (a = _m(n.parseAsNumber(i)), a <= 0) return r.BuiltIn.Value;
+		if (a = Gm(n.parseAsNumber(i)), a <= 0) return r.BuiltIn.Value;
 	}
 	if (!t || !u) return t;
 	let s = t, l = 0, c = 0;
@@ -6634,12 +6634,12 @@ function lm(t, u, o, i) {
 	} else l += 1;
 	return s;
 }
-function cm(n) {
+function fm(n) {
 	const r = !0 === n?.isIRange ? n : null;
-	return r ? ue(r, fm) : fm(n);
+	return r ? ue(r, mm) : mm(n);
 }
-var fm = (n) => "string" == typeof n ? n : "";
-function mm(t, e) {
+var mm = (n) => "string" == typeof n ? n : "";
+function gm(t, e) {
 	if (null === t && (t = 0), "" === e) return "";
 	if ("string" == typeof t && "" !== t.trim()) try {
 		t = n.parseAsNumber(t.trim());
@@ -6651,13 +6651,13 @@ function mm(t, e) {
 		return r.BuiltIn.Value;
 	}
 }
-function gm(n, r, t, e = 0, u = 0, o) {
-	return Zm(n, r, t ?? 1, void 0 !== t, e, u, o, !0);
-}
 function hm(n, r, t, e = 0, u = 0, o) {
-	return Zm(n, r, t ?? 1, void 0 !== t, e, u, o, !1);
+	return Jm(n, r, t ?? 1, void 0 !== t, e, u, o, !0);
 }
-function pm(n, t, u) {
+function pm(n, r, t, e = 0, u = 0, o) {
+	return Jm(n, r, t ?? 1, void 0 !== t, e, u, o, !1);
+}
+function Nm(n, t, u) {
 	let o = "", i = 0;
 	for (const a of u) for (const u of a.values({ includeEmpty: !t })) if (0 !== u.length || !t) {
 		if (i > 0 && n.length > 0 && (o += n[(i - 1) % n.length]), o += u, o.length > e.MAX_TEXT_LENGTH) return r.BuiltIn.Calc;
@@ -6665,7 +6665,7 @@ function pm(n, t, u) {
 	}
 	return o;
 }
-function Nm(n, t, e, u = !1, o = 0, i = void 0) {
+function Im(n, t, e, u = !1, o = 0, i = void 0) {
 	if (!n) throw r.BuiltIn.Value;
 	if (0 !== (o = Math.trunc(o)) && 1 !== o) throw r.BuiltIn.Value;
 	if (0 === t.length && (!e || 0 === e.length)) throw r.BuiltIn.Value;
@@ -6673,7 +6673,7 @@ function Nm(n, t, e, u = !1, o = 0, i = void 0) {
 		if (0 === n.length) return null;
 		if (n.some((n) => 0 === n.length)) throw r.BuiltIn.Value;
 		const t = [...n].sort((n, r) => r.length - n.length);
-		return new RegExp(t.map((n) => ym(n)).join("|"), 1 === o ? "i" : "");
+		return new RegExp(t.map((n) => Om(n)).join("|"), 1 === o ? "i" : "");
 	}, s = (n, r) => r ? n.split(r) : [n], l = a(t);
 	let c = [n];
 	if (e && (c = s(n, a(e))), u) {
@@ -6707,39 +6707,39 @@ function Nm(n, t, e, u = !1, o = 0, i = void 0) {
 	}
 	return f.length > 0 ? f : [[""]];
 }
-function Im(n, t, e) {
+function bm(n, t, e) {
 	return r.BuiltIn.NA;
 }
-function bm(n) {
+function Em(n) {
 	return n.replace(/ +/g, " ").replace(/^ +| +$/g, "");
 }
-function Em(n) {
+function Am(n) {
 	if (!(n >= 1)) throw r.BuiltIn.Value;
 	const t = Math.trunc(n);
 	if (t > 1114111) throw r.BuiltIn.Value;
 	if (t >= 55296 && t <= 57343 || t >= 64976 && t <= 65007 || (65535 & t) >= 65534) throw r.BuiltIn.NA;
 	return String.fromCodePoint(t);
 }
-function Am(n) {
+function dm(n) {
 	if (0 === n.length) throw r.BuiltIn.Value;
 	const t = n.codePointAt(0);
 	if (t >= 55296 && t <= 56319) throw r.BuiltIn.Value;
 	return t;
 }
-function dm(n) {
-	return zm(n, !0);
+function Mm(n) {
+	return Qm(n, !0);
 }
-function Mm(r) {
+function Sm(r) {
 	return null === r ? 0 : n.parseAsNumber(r);
 }
-function Sm(t, e = 0) {
+function Rm(t, e = 0) {
 	if (0 !== (e = Math.floor(e)) && 1 !== e) throw r.BuiltIn.Value;
 	return "string" == typeof t ? 1 === e ? "\"" + t.replace(/"/g, "\"\"") + "\"" : t : n.toText(t);
 }
-var Rm = () => {
+var Tm = () => {
 	const r = n.getRuntime().getLocale().toLowerCase().split(/[-_]/)[0];
 	return "ja" === r || "zh" === r || "ko" === r;
-}, Tm = {
+}, Cm = {
 	latin: {
 		halfRE: /[!-~]/g,
 		fullRE: /[！-～]/g,
@@ -6765,30 +6765,30 @@ var Rm = () => {
 		half: "¢£¬¯¦¥₩ |←↑→↓■°",
 		full: "￠￡￢￣￤￥￦　￨￩￪￫￬￭￮"
 	}
-}, Cm = (n, r) => n[`${r}RE`] || new RegExp("[" + n[r] + "]", "g"), wm = Object.keys(Tm).map((n) => Tm[n]), vm = (n) => wm.reduce((n, r) => n.replace(Cm(r, "half"), ((n) => (r) => n.delta ? String.fromCharCode(r.charCodeAt(0) + n.delta) : [...n.full][[...n.half].indexOf(r)])(r)), n), Bm = (n) => wm.reduce((n, r) => n.replace(Cm(r, "full"), ((n) => (r) => n.delta ? String.fromCharCode(r.charCodeAt(0) - n.delta) : [...n.half][[...n.full].indexOf(r)])(r)), n);
-function ym(n) {
+}, wm = (n, r) => n[`${r}RE`] || new RegExp("[" + n[r] + "]", "g"), vm = Object.keys(Cm).map((n) => Cm[n]), Bm = (n) => vm.reduce((n, r) => n.replace(wm(r, "half"), ((n) => (r) => n.delta ? String.fromCharCode(r.charCodeAt(0) + n.delta) : [...n.full][[...n.half].indexOf(r)])(r)), n), ym = (n) => vm.reduce((n, r) => n.replace(wm(r, "full"), ((n) => (r) => n.delta ? String.fromCharCode(r.charCodeAt(0) - n.delta) : [...n.half][[...n.full].indexOf(r)])(r)), n);
+function Om(n) {
 	return n.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
 }
-var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF]$/, Vm = Math.pow(2, -22), Lm = (n, r) => {
+var Dm = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, xm = (n) => Dm.test(n), Vm = /[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF]$/, Lm = Math.pow(2, -22), Fm = (n, r) => {
 	if (r < -308) return 0;
 	const t = 10 ** r, e = Number(Math.abs(n).toPrecision(15)), u = Number((e * t).toPrecision(15));
 	return Number.isFinite(u) ? Math.sign(n) * Math.round(u) / t : n;
-}, Fm = 127, Pm = 255, Um = (n, r, t, e) => {
+}, Pm = 127, Um = 255, _m = (n, r, t, e) => {
 	const u = Math.abs(n), o = u < 1 ? 1 : Math.floor(Math.log10(u)) + 1;
 	return o + (t ? Math.floor((o - 1) / 3) : 0) + (r > 0 ? r + 1 : 0) + (n < 0 ? 1 : 0) + e;
-}, _m = (n) => Math.trunc(n + Vm), Gm = new Map([
+}, Gm = (n) => Math.trunc(n + Lm), Xm = new Map([
 	[8490, 75],
 	[8491, 197],
 	[8486, 937],
 	[7838, 223]
-].map(([n, r]) => [String.fromCharCode(n), String.fromCharCode(r)])), Xm = new RegExp(`[${[...Gm.keys()].join("")}]`), Hm = new RegExp(Xm.source, "g"), km = (n) => Xm.test(n) ? n.replace(Hm, (n) => Gm.get(n)) : n, Ym = /* @__PURE__ */ new Set([
+].map(([n, r]) => [String.fromCharCode(n), String.fromCharCode(r)])), Hm = new RegExp(`[${[...Xm.keys()].join("")}]`), km = new RegExp(Hm.source, "g"), Wm = (n) => Hm.test(n) ? n.replace(km, (n) => Xm.get(n)) : n, Ym = /* @__PURE__ */ new Set([
 	181,
 	7838,
 	8486,
 	8490,
 	8491
-]), Wm = /* @__PURE__ */ new Map([[304, "i"]]), Km = String.fromCharCode(962), qm = /^[\x00-\x7F]*$/, zm = (n, r) => {
-	if (qm.test(n)) return r ? n.toUpperCase() : n.toLowerCase();
+]), Km = /* @__PURE__ */ new Map([[304, "i"]]), qm = String.fromCharCode(962), zm = /^[\x00-\x7F]*$/, Qm = (n, r) => {
+	if (zm.test(n)) return r ? n.toUpperCase() : n.toLowerCase();
 	let t = "";
 	for (let e = 0; e < n.length; e++) {
 		const u = n[e], o = n.charCodeAt(e);
@@ -6797,13 +6797,13 @@ var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800
 			continue;
 		}
 		if (!r) {
-			const r = Wm.get(o);
+			const r = Km.get(o);
 			if (void 0 !== r) {
 				t += r;
 				continue;
 			}
 			if (931 === o && e === n.length - 1) {
-				t += Km;
+				t += qm;
 				continue;
 			}
 		}
@@ -6811,7 +6811,7 @@ var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800
 		t += 1 === i.length ? i : u;
 	}
 	return t;
-}, Qm = (n) => {
+}, jm = (n) => {
 	const r = n.length;
 	let t = 0;
 	for (let e = 0; e < r - 1; e++) {
@@ -6822,7 +6822,7 @@ var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800
 	}
 	const e = r > 0 ? n.charCodeAt(r - 1) : 0;
 	return r - t - (e >= 55296 && e <= 56319 ? 1 : 0);
-}, jm = (n, r) => {
+}, $m = (n, r) => {
 	const t = Math.trunc(r), e = n.length;
 	let u = 0;
 	for (let r = 0; r < t && u < e; r++) {
@@ -6830,12 +6830,12 @@ var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800
 		u += r >= 55296 && r <= 56319 && t >= 56320 && t <= 57343 ? 2 : 1;
 	}
 	return Math.min(u, e);
-}, $m = (n, r) => Qm(n.slice(0, r)), Zm = (n, t, e, u, o, i, a, s) => {
+}, Zm = (n, r) => jm(n.slice(0, r)), Jm = (n, t, e, u, o, i, a, s) => {
 	const l = Math.trunc(o);
 	if (0 !== l && 1 !== l) return r.BuiltIn.Value;
 	const c = Math.trunc(i);
 	if (0 !== c && 1 !== c) return r.BuiltIn.Value;
-	const f = Math.floor(e + Vm);
+	const f = Math.floor(e + Lm);
 	if (0 === f) return r.BuiltIn.Value;
 	if (0 === t.length || t.some((n) => 0 === n.length)) return s === f > 0 ? n : "";
 	const m = Math.min(...t.map((n) => n.length));
@@ -6843,7 +6843,7 @@ var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800
 	const g = ((n, r, t) => {
 		const e = [], u = r.filter((n) => n.length > 0);
 		if (0 === u.length) return e;
-		const o = 1 === t ? u.map((n) => new RegExp(ym(n), "gi")) : null;
+		const o = 1 === t ? u.map((n) => new RegExp(Om(n), "gi")) : null;
 		let i = 0;
 		for (; i <= n.length;) {
 			let r = null;
@@ -6864,31 +6864,31 @@ var Om = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Dm = (n) => Om.test(n), xm = /[\uD800
 	1 === c && (f > 0 ? g.push([n.length, n.length]) : g.unshift([0, 0]));
 	const h = f > 0 ? f - 1 : g.length + f;
 	return h < 0 || h >= g.length ? a ?? r.BuiltIn.NA : s ? n.substring(g[h][1]) : n.substring(0, g[h][0]);
-}, Jm = c({ BAHTTEXT: () => ng });
-function ng(n) {
+}, ng = c({ BAHTTEXT: () => rg });
+function rg(n) {
 	try {
 		return s(n);
 	} catch (n) {
 		throw Error(`Error in https://github.com/jojoee/bahttext \n${n.toString()}`);
 	}
 }
-var rg = c({ FILTERXML: () => tg });
-async function tg(n, t) {
-	if (ig) throw r.BuiltIn.Blocked;
-	if (!ug || !og) try {
-		ag ??= eg(), await ag;
+var tg = c({ FILTERXML: () => eg });
+async function eg(n, t) {
+	if (ag) throw r.BuiltIn.Blocked;
+	if (!og || !ig) try {
+		sg ??= ug(), await sg;
 	} catch (n) {
-		throw ig || (ig = !0, console.warn(`FILTERXML is unavailable: XML libraries could not be loaded (${n?.message ?? n}).`)), r.BuiltIn.Blocked;
+		throw ag || (ag = !0, console.warn(`FILTERXML is unavailable: XML libraries could not be loaded (${n?.message ?? n}).`)), r.BuiltIn.Blocked;
 	}
-	if (!ug) throw ig = !0, console.warn("Unable to load XML libraries"), r.BuiltIn.Blocked;
+	if (!og) throw ag = !0, console.warn("Unable to load XML libraries"), r.BuiltIn.Blocked;
 	try {
-		const r = ug.parseFromString(n, "text/xml");
-		return [[og.evaluateXPathToString(t, r, null, {})]];
+		const r = og.parseFromString(n, "text/xml");
+		return [[ig.evaluateXPathToString(t, r, null, {})]];
 	} catch (n) {
 		throw r.BuiltIn.Value;
 	}
 }
-var eg = async () => {
+var ug = async () => {
 	const [n, r] = await Promise.all([import(
 		/* webpackIgnore: true */
 		/* @vite-ignore */
@@ -6898,17 +6898,17 @@ var eg = async () => {
 		/* @vite-ignore */
 		"https://esm.sh/@xmldom/xmldom@0.8.11"
 )]);
-	og = n;
+	ig = n;
 	const t = r.DOMParser;
-	ug = new t();
-}, ug = null, og = null, ig = !1, ag = null, sg = c({
-	ENCODEURL: () => lg,
-	WEBSERVICE: () => cg
+	og = new t();
+}, og = null, ig = null, ag = !1, sg = null, lg = c({
+	ENCODEURL: () => cg,
+	WEBSERVICE: () => fg
 });
-function lg(n) {
+function cg(n) {
 	return encodeURIComponent(n);
 }
-async function cg(n) {
+async function fg(n) {
 	try {
 		const r = await fetch(n, {
 			method: "GET",
@@ -6923,7 +6923,7 @@ async function cg(n) {
 		throw r.BuiltIn.Value;
 	}
 }
-var fg = {
+var mg = {
 	DAVERAGE: {
 		p: [
 			{
@@ -7178,7 +7178,7 @@ var fg = {
 		],
 		r: { s: "*" }
 	}
-}, mg = {
+}, gg = {
 	DATE: {
 		p: [
 			{ n: "year" },
@@ -7433,7 +7433,7 @@ var fg = {
 		p: [{ n: "serialNumber" }],
 		r: { s: "number" }
 	}
-}, gg = {
+}, hg = {
 	Weekend: { m: [
 		["Saturday, Sunday", 1],
 		["Sunday, Monday", 2],
@@ -7474,7 +7474,7 @@ var fg = {
 		["Week begins on Sunday", 17],
 		["Week begins on Monday (ISO 8601)", 21]
 	] }
-}, hg = {
+}, pg = {
 	BESSELI: {
 		p: [{
 			n: "x",
@@ -7539,7 +7539,7 @@ var fg = {
 		}],
 		r: { s: "number" }
 	}
-}, pg = {
+}, Ng = {
 	BIN2DEC: {
 		p: [{
 			n: "number",
@@ -7780,7 +7780,7 @@ var fg = {
 		}],
 		r: { s: "*" }
 	}
-}, Ng = { CONVERT: {
+}, Ig = { CONVERT: {
 	p: [
 		{
 			n: "number",
@@ -7801,7 +7801,7 @@ var fg = {
 		}
 	],
 	r: { s: "number" }
-} }, Ig = {
+} }, bg = {
 	DELTA: {
 		p: [{
 			n: "number1",
@@ -7838,7 +7838,7 @@ var fg = {
 		}],
 		r: { s: "number" }
 	}
-}, bg = {
+}, Eg = {
 	ERF: {
 		p: [{
 			n: "lowerLimit",
@@ -7884,7 +7884,7 @@ var fg = {
 		}],
 		r: { s: "number" }
 	}
-}, Eg = {
+}, Ag = {
 	COMPLEX: {
 		p: [
 			{
@@ -8165,7 +8165,7 @@ var fg = {
 		}],
 		r: { s: "*" }
 	}
-}, Ag = {
+}, dg = {
 	CELL: {
 		p: [{
 			n: "infoType",
@@ -8363,7 +8363,7 @@ var fg = {
 		}],
 		r: { s: "number" }
 	}
-}, dg = {
+}, Mg = {
 	CellInfoType: {
 		s: "string",
 		m: [
@@ -8425,7 +8425,7 @@ var fg = {
 			["User", "user"]
 		]
 	}
-}, Mg = {
+}, Sg = {
 	DATESTRING: {
 		p: [{ n: "number" }],
 		r: { s: "*" }
@@ -8434,13 +8434,13 @@ var fg = {
 		p: [{ n: "number" }, { n: "number2" }],
 		r: { s: "*" }
 	}
-}, Sg = { PHONETIC: {
+}, Rg = { PHONETIC: {
 	p: [{
 		n: "reference",
 		r: "p"
 	}],
 	r: { s: "*" }
-} }, Rg = {
+} }, Tg = {
 	AND: {
 		p: [{
 			n: "logical",
@@ -8751,7 +8751,7 @@ var fg = {
 		}],
 		r: { s: "*" }
 	}
-}, Tg = { GROUPBY: {
+}, Cg = { GROUPBY: {
 	p: [
 		{
 			n: "rowFields",
@@ -8800,7 +8800,7 @@ var fg = {
 		s: "*",
 		r: "m"
 	}
-} }, Cg = { PIVOTBY: {
+} }, wg = { PIVOTBY: {
 	p: [
 		{
 			n: "rowFields",
@@ -8866,7 +8866,7 @@ var fg = {
 		s: "*",
 		r: "m"
 	}
-} }, wg = {
+} }, vg = {
 	ADDRESS: {
 		p: [
 			{ n: "rowNum" },
@@ -9602,7 +9602,7 @@ var fg = {
 		],
 		r: { s: "*" }
 	}
-}, vg = {
+}, Bg = {
 	MatchType: { m: [
 		["Less than", 1],
 		["Exact match", 0],
@@ -9627,7 +9627,7 @@ var fg = {
 		["Binary search (sorted ascending order)", 2],
 		["Binary search (sorted descending order)", -2]
 	] }
-}, Bg = {
+}, yg = {
 	ABS: {
 		p: [{ n: "number" }],
 		r: { s: "number" }
@@ -10235,7 +10235,7 @@ var fg = {
 		}],
 		r: { s: "number" }
 	}
-}, yg = {
+}, Og = {
 	AggregateFunction: { m: [
 		["AVERAGE", 1],
 		["COUNT", 2],
@@ -10291,7 +10291,7 @@ var fg = {
 		["VAR (visible rows)", 110],
 		["VARP (visible rows)", 111]
 	] }
-}, Og = {
+}, Dg = {
 	ACOS: {
 		p: [{ n: "number" }],
 		r: { s: "number" }
@@ -10376,7 +10376,7 @@ var fg = {
 		p: [{ n: "number" }],
 		r: { s: "number" }
 	}
-}, Dg = {
+}, xg = {
 	ADD: {
 		p: [{ n: "value1" }, { n: "value2" }],
 		r: { s: "number" }
@@ -10489,7 +10489,7 @@ var fg = {
 		],
 		r: { s: "boolean" }
 	}
-}, xg = {
+}, Vg = {
 	"BETA.DIST": {
 		fn: "BETA_DIST",
 		p: [
@@ -11741,7 +11741,7 @@ var fg = {
 		],
 		r: { s: "number" }
 	}
-}, Vg = {
+}, Lg = {
 	AVEDEV: {
 		p: [{
 			n: "number",
@@ -12062,7 +12062,7 @@ var fg = {
 		}, { n: "k" }],
 		r: { s: "number" }
 	}
-}, Lg = {
+}, Fg = {
 	DELAY: {
 		p: [
 			{ n: "time" },
@@ -12090,7 +12090,7 @@ var fg = {
 		}],
 		r: { s: "string" }
 	}
-}, Fg = {
+}, Pg = {
 	ASC: {
 		p: [{
 			n: "text",
@@ -12701,10 +12701,10 @@ var fg = {
 		}],
 		r: { s: "string" }
 	}
-}, Pg = { BAHTTEXT: {
+}, Ug = { BAHTTEXT: {
 	p: [{ n: "number" }],
 	r: { s: "string" }
-} }, Ug = { FILTERXML: {
+} }, _g = { FILTERXML: {
 	p: [{
 		n: "xml",
 		s: "string"
@@ -12716,7 +12716,7 @@ var fg = {
 		s: "*",
 		r: "m"
 	}
-} }, _g = {
+} }, Gg = {
 	ENCODEURL: {
 		p: [{
 			n: "text",
@@ -12731,5 +12731,5 @@ var fg = {
 		}],
 		r: { s: "string" }
 	}
-}, Gg = () => import("./5X8bpCTLz5g9VT2o.mjs"), Xg = () => import("./DPbVTkgPOiFKUnlX.mjs"), Hg = () => import("./DzU54uqsXvnhSKrR.mjs"), kg = () => import("./DPOEWf1NF3NI3XZ4.mjs"), Yg = () => import("./1riNkHcbYB6zVyQd.mjs"), Wg = () => import("./D8mtKfymlOxIp6fe.mjs"), Kg = () => import("./CP1nc1n-SQUEvyg-.mjs"), qg = () => import("./Ag3eE6q5ZJM3fVav.mjs"), zg = () => import("./Be2CwRYRoOSahicS.mjs"), Qg = () => import("./CMZlUqf3eqW0b4t2.mjs"), jg = () => import("./BsYQTAuC7Hq--ggs.mjs"), $g = () => import("./Oyz1gF7vrQIcrZTJ.mjs"), Zg = () => import("./DTcWwF0L7wM4TA6R.mjs"), Jg = () => import("./BFNihluoZBNsYXCL.mjs"), nh = () => import("./DK2Jv1ksEXj01Txu.mjs"), rh = () => import("./C2unqUZMcJQswbkM.mjs"), th = () => import("./CfnUiLfVLC77gZtw.mjs"), eh = () => import("./CyH2KnOPfO7f3wqp.mjs"), uh = () => import("./Bm7qgQ2w1girWceN.mjs"), oh = () => import("./CuaSmoQylFRBvp9P.mjs"), ih = () => import("./DSiBIwQ60UGTT4By.mjs"), ah = () => import("./BZhz4wO8xRM_GaZ2.mjs"), sh = () => import("./D-XKQ7s9vsHkQnZN.mjs"), lh = () => import("./ChJD5hRF7wcBxJhZ.mjs"), ch = () => import("./Dv_OzvnifdH_iW01.mjs"), fh = (n, r, t) => (t || (t = /* @__PURE__ */ new Map()), r(t, n, h, fg, Gg, "Database"), r(t, n, x, mg, Xg, "Date & Time", gg), r(t, n, Mn, hg, Hg, "Engineering"), r(t, n, yn, pg, kg, "Engineering"), r(t, n, sr, Ng, Yg, "Engineering"), r(t, n, Ir, Ig, Wg, "Engineering"), r(t, n, kr, bg, Kg, "Engineering"), r(t, n, ot, Eg, qg, "Engineering"), r(t, n, oe, Ag, zg, "Information", dg), r(t, n, Le, Mg, Qg, "Japanese"), r(t, n, Ue, Sg, jg, "Japanese"), r(t, n, ke, Rg, $g, "Logical"), r(t, n, mu, Tg, Zg, "Lookup & Reference"), r(t, n, hu, Cg, Jg, "Lookup & Reference"), r(t, n, Eu, wg, nh, "Lookup & Reference", vg), r(t, n, xo, Bg, rh, "Math & Trig", yg), r(t, n, fa, Og, th, "Math & Trig"), r(t, n, xa, Dg, eh, "Operators"), r(t, n, zs, xg, uh, "Statistical"), r(t, n, rs, Vg, oh, "Statistical"), r(t, n, df, Lg, ih, "Testing"), r(t, n, wf, Fg, ah, "Text"), r(t, n, Jm, Pg, sh, "Thai"), r(t, n, rg, Ug, lh, "Web"), r(t, n, sg, _g, ch, "Web"), t);
-export { fh as default };
+}, Xg = () => import("./uzswdlTjeQbFgnde.mjs"), Hg = () => import("./DYaJkI_YavPwT_S6.mjs"), kg = () => import("./C_LENKlcZy6dmpKB.mjs"), Wg = () => import("./C5Ly9olDuzTLZx_l.mjs"), Yg = () => import("./xemI4bjJgcxzkB5V.mjs"), Kg = () => import("./C7b3_wnn26TX_ZEr.mjs"), qg = () => import("./D8lPnTuEMHIQ9AoP.mjs"), zg = () => import("./BLLz3YCvQgJT0aRv.mjs"), Qg = () => import("./B7ZtJQvr1-wFxfA3.mjs"), jg = () => import("./Cb9HGMA7IymJsx_9.mjs"), $g = () => import("./D9frZSOcS_CPDHrj.mjs"), Zg = () => import("./-w-j4Z_DgV3yfjHG.mjs"), Jg = () => import("./Bu7NHSoEURKHdIIe.mjs"), nh = () => import("./CUXusjsy09z71UiB.mjs"), rh = () => import("./B17BR7eVH64P1cOq.mjs"), th = () => import("./aKLY9VMgbo_M52XJ.mjs"), eh = () => import("./B9MoeTEGdPBylx68.mjs"), uh = () => import("./DWL_JS6oTXWgXlkT.mjs"), oh = () => import("./Cpg3FwTTjP-nIdLb.mjs"), ih = () => import("./CmHtkUoRAN6XB8gC.mjs"), ah = () => import("./oEkB29eUCnpu57iW.mjs"), sh = () => import("./qXMjnsjWogkKRtxi.mjs"), lh = () => import("./CtUGE-h9fRAeovoZ.mjs"), ch = () => import("./gS8oyGeRLWkuChDq.mjs"), fh = () => import("./CtweWm93CSFm1Cys.mjs"), mh = (n, r, t) => (t || (t = /* @__PURE__ */ new Map()), r(t, n, h, mg, Xg, "Database"), r(t, n, x, gg, Hg, "Date & Time", hg), r(t, n, Mn, pg, kg, "Engineering"), r(t, n, yn, Ng, Wg, "Engineering"), r(t, n, sr, Ig, Yg, "Engineering"), r(t, n, Ir, bg, Kg, "Engineering"), r(t, n, kr, Eg, qg, "Engineering"), r(t, n, ot, Ag, zg, "Engineering"), r(t, n, oe, dg, Qg, "Information", Mg), r(t, n, Le, Sg, jg, "Japanese"), r(t, n, Ue, Rg, $g, "Japanese"), r(t, n, ke, Tg, Zg, "Logical"), r(t, n, mu, Cg, Jg, "Lookup & Reference"), r(t, n, hu, wg, nh, "Lookup & Reference"), r(t, n, Eu, vg, rh, "Lookup & Reference", Bg), r(t, n, xo, yg, th, "Math & Trig", Og), r(t, n, ma, Dg, eh, "Math & Trig"), r(t, n, Va, xg, uh, "Operators"), r(t, n, Qs, Vg, oh, "Statistical"), r(t, n, ts, Lg, ih, "Statistical"), r(t, n, Mf, Fg, ah, "Testing"), r(t, n, vf, Pg, sh, "Text"), r(t, n, ng, Ug, lh, "Thai"), r(t, n, tg, _g, ch, "Web"), r(t, n, lg, Gg, fh, "Web"), t);
+export { mh as default };