@sheetxl/formulas-extended 0.8.0-beta.15 → 0.8.0-beta.16

package/node/esm/index.mjs

@@ -1,19 +1,19 @@
 /**
-* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.15
+* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { S as t, _ as n, a as e, b as r, c as o, d as i, f as u, g as s, h as a, i as l, l as f, m as c, n as h, o as m, p as N, r as g, s as p, t as d, u as y, v as M, x as I, y as w } from "./BOyLreRKoE7rK6-B.mjs";
-import { FormulaContext as b, FormulaError as B, IRange as x, ScalarType as C, ValueKind as R } from "@sheetxl/primitives";
-var E = Object.defineProperty, A = (t, n) => {
+import { S as t, _ as n, a as e, b as r, c as o, d as i, f as u, g as s, h as a, i as l, l as f, m as c, n as h, o as m, p as N, r as g, s as d, t as y, u as M, v as p, x as I, y as w } from "./XRNK8e2JoP4X70Jk.mjs";
+import { FormulaContext as b, FormulaError as B, IRange as x, ScalarType as R, ValueKind as C } from "@sheetxl/primitives";
+var E = Object.defineProperty, v = (t, n) => {
 	let e = {};
 	for (var r in t) E(e, r, {
 		get: t[r],
 		enumerable: !0
 	});
 	return n || E(e, Symbol.toStringTag, { value: "Module" }), e;
-}, v = A({
+}, A = v({
 	CUBEKPIMEMBER: () => D,
 	CUBEMEMBER: () => F,
 	CUBEMEMBERPROPERTY: () => S,
@@ -43,7 +43,7 @@ function P(t) {
 function O(t, ...n) {
 	throw B.BuiltIn.NA;
 }
-function $(t) {
+function L(t) {
 	if (null === t) return 0;
 	if ("string" == typeof t) try {
 		return b.parseAsNumber(t);
@@ -52,18 +52,18 @@ function $(t) {
 	}
 	return b.parseAsSerialDate(t);
 }
-function k(t) {
+function $(t) {
 	if (void 0 === t) throw B.BuiltIn.NA;
-	return $(t);
+	return L(t);
 }
-function L(t) {
+function k(t) {
 	return null === t ? 0 : b.parseAsNumber(t);
 }
 function q(t) {
 	if (void 0 === t) throw B.BuiltIn.NA;
-	return L(t);
+	return k(t);
 }
-var _ = [
+var j = [
 	31,
 	29,
 	31,
@@ -76,7 +76,7 @@ var _ = [
 	31,
 	30,
 	31
-], j = [
+], U = [
 	31,
 	28,
 	31,
@@ -90,14 +90,14 @@ var _ = [
 	30,
 	31
 ];
-function U(t) {
+function Y(t) {
 	return t % 4 == 0 && t % 100 != 0 || t % 400 == 0;
 }
-function Y(t, n) {
-	return U(t) ? _[n] : j[n];
+function z(t, n) {
+	return Y(t) ? j[n] : U[n];
 }
-var z = (t, n) => Y(t, n - 1), G = (t) => t.d === z(t.y, t.m);
-function X(t) {
+var _ = (t, n) => z(t, n - 1), G = (t) => t.d === _(t.y, t.m);
+function K(t) {
 	const n = b.getDateParts(t);
 	return {
 		y: n.year,
@@ -105,20 +105,20 @@ function X(t) {
 		d: n.day
 	};
 }
-function H(t, n, e) {
+function X(t, n, e) {
 	const r = n <= 2 ? t - 1 : t, o = Math.floor(r / 400), i = r - 400 * o, u = Math.floor((153 * (n + (n > 2 ? -3 : 9)) + 2) / 5) + e - 1, s = 146097 * o + (365 * i + Math.floor(i / 4) - Math.floor(i / 100) + u) - 693900;
 	return s >= 60 ? s + 1 : s;
 }
-function W(t, n) {
+function H(t, n) {
 	let e = t.m - 1 + n;
 	const r = t.y + Math.floor(e / 12);
 	return e = (e % 12 + 12) % 12 + 1, {
 		y: r,
 		m: e,
-		d: Math.min(t.d, z(r, e))
+		d: Math.min(t.d, _(r, e))
 	};
 }
-function K(t) {
+function W(t) {
 	return b.getDateParts(Math.max(0, Math.floor(t)));
 }
 function Z(t, n, e, r, o, i) {
@@ -137,16 +137,16 @@ function Q(t, n, e) {
 				days: 0,
 				yearDays: 365
 			};
-			const e = K(t), r = K(n), o = e.year, i = r.year, u = Math.abs(n - t), s = Math.abs(i - o), a = s + 1, l = i < o ? i : o, f = i < o ? o : i;
+			const e = W(t), r = W(n), o = e.year, i = r.year, u = Math.abs(n - t), s = Math.abs(i - o), a = s + 1, l = i < o ? i : o, f = i < o ? o : i;
 			let c, h = b.getSerialDate(l, 1, 1);
 			1900 === l && (h += 1);
 			if (0 === s) c = b.getSerialDate(l, 12, 31) - h + 1;
 			else if (1 === s) {
-				const e = Math.min(t, n), r = Math.max(t, n), o = K(e), i = K(r), u = i.month - o.month;
+				const e = Math.min(t, n), r = Math.max(t, n), o = W(e), i = W(r), u = i.month - o.month;
 				if (u > 0 || 0 === u && i.day > o.day) c = (b.getSerialDate(f + 1, 1, 1) - h) / a;
 				else {
 					c = 365;
-					for (const t of [l, f]) if (U(t)) {
+					for (const t of [l, f]) if (Y(t)) {
 						const n = b.getSerialDate(t, 2, 29);
 						if (n >= e && n <= r) {
 							c = 366;
@@ -170,7 +170,7 @@ function Q(t, n, e) {
 			yearDays: 365
 		};
 		case 4: return function(t, n) {
-			const e = K(t), r = K(n);
+			const e = W(t), r = W(n);
 			let o = e.day, i = r.day;
 			31 === o && (o = 30);
 			31 === i && (i = 30);
@@ -195,41 +195,41 @@ function tt(t, n, e) {
 	return i / u;
 }
 function nt(t, n, e) {
-	const r = X(t);
-	let o = X(n).y - r.y, i = t;
+	const r = K(t);
+	let o = K(n).y - r.y, i = t;
 	for (; o > 0; o -= 1) {
-		const t = W(r, 12 * o);
-		if (i = H(t.y, t.m, t.d), i <= n) break;
+		const t = H(r, 12 * o);
+		if (i = X(t.y, t.m, t.d), i <= n) break;
 	}
 	if (o <= 0 && (o = 0, i = t), 0 === e || 4 === e) return o + function(t, n, e) {
-		const r = K(t), o = K(n);
+		const r = W(t), o = W(n);
 		let i = r.day, u = o.day;
 		(2 === r.month && 29 === i || 31 === i) && (i = 30);
 		31 === u && (e || i >= 30) && (u = 30);
 		return Z(r.year, r.month, i, o.year, o.month, u);
 	}(i, n, 4 === e) / 360;
 	const u = n - i;
-	return 2 === e ? o + u / 360 : 3 === e ? o + u / 365 : o + u / (U(X(n).y) ? 366 : 365);
+	return 2 === e ? o + u / 360 : 3 === e ? o + u / 365 : o + u / (Y(K(n).y) ? 366 : 365);
 }
 function et(t, n) {
-	const e = K(t), r = K(n), o = e.year, i = e.month;
+	const e = W(t), r = W(n), o = e.year, i = e.month;
 	let u = e.day, s = r.year, a = r.month, l = r.day, f = !1;
-	return 2 === i ? u === (U(o) ? 29 : 28) && (u = 30, f = !0) : 31 === u && (u = 30), f && 2 === a && l === (U(s) ? 29 : 28) && (l = 30), 31 !== l || f || (u < 30 ? (12 === a ? (s += 1, a = 1) : a += 1, l = 1) : l = 30), Z(o, i, u, s, a, l);
+	return 2 === i ? u === (Y(o) ? 29 : 28) && (u = 30, f = !0) : 31 === u && (u = 30), f && 2 === a && l === (Y(s) ? 29 : 28) && (l = 30), 31 !== l || f || (u < 30 ? (12 === a ? (s += 1, a = 1) : a += 1, l = 1) : l = 30), Z(o, i, u, s, a, l);
 }
 function rt(t, n, e) {
 	const r = Math.floor(t), o = Math.floor(n);
 	let i, u;
-	return 0 === e || 4 === e ? (i = Q(r, o, e).days, u = 360) : (i = ot(o) - ot(r), u = 3 !== e && U(K(r).year) ? 366 : 365), {
+	return 0 === e || 4 === e ? (i = Q(r, o, e).days, u = 360) : (i = ot(o) - ot(r), u = 3 !== e && Y(W(r).year) ? 366 : 365), {
 		days: 0 === i ? u : i,
 		yearDays: u
 	};
 }
 function ot(t) {
-	const n = K(t);
-	return 2 === n.month && 29 === n.day && U(n.year) ? t - 1 : t;
+	const n = W(t);
+	return 2 === n.month && 29 === n.day && Y(n.year) ? t - 1 : t;
 }
 function it(t) {
-	const n = void 0 === t ? 0 : L(t), e = Math.trunc(n);
+	const n = void 0 === t ? 0 : k(t), e = Math.trunc(n);
 	if (n < 0 || e > 4) throw B.BuiltIn.Num;
 	return e;
 }
@@ -242,7 +242,7 @@ function ut(t, n) {
 	};
 }
 function st(t, n, e, r, o) {
-	const i = it(o), u = k(t), s = k(n), a = q(e), l = q(r), f = ut(u, s);
+	const i = it(o), u = $(t), s = $(n), a = q(e), l = q(r), f = ut(u, s);
 	if (a <= 0 || l <= 0) throw B.BuiltIn.Num;
 	return {
 		...f,
@@ -252,12 +252,12 @@ function st(t, n, e, r, o) {
 	};
 }
 function at(t, n, e) {
-	const r = k(t), o = k(n), i = q(e), u = ut(r, o);
+	const r = $(t), o = $(n), i = q(e), u = ut(r, o);
 	if (u.maturity > function(t) {
 		const n = b.getDateParts(t);
 		if (n.year >= 9999) throw B.BuiltIn.Num;
 		if (0 === n.day) return b.getSerialDate(n.year + 1, n.month, 1) - 1;
-		const e = Y(n.year + 1, n.month - 1);
+		const e = z(n.year + 1, n.month - 1);
 		return n.day > e ? b.getSerialDate(n.year + 1, n.month + 1, 1) : b.getSerialDate(n.year + 1, n.month, n.day);
 	}(u.settlement) || i <= 0) throw B.BuiltIn.Num;
 	return {
@@ -267,25 +267,25 @@ function at(t, n, e) {
 	};
 }
 function lt(t, n, e, r, o, i) {
-	const u = it(i), s = k(t), a = k(n), l = k(e), f = q(r), c = q(o);
+	const u = it(i), s = $(t), a = $(n), l = $(e), f = q(r), c = q(o);
 	if (!J(s) || !J(a) || !J(l)) throw B.BuiltIn.Num;
 	const h = Math.floor(s), m = Math.floor(a), N = Math.floor(l);
 	if (!(N < h && h < m)) throw B.BuiltIn.Num;
-	const { days: g, yearDays: p } = Q(N, h, u), d = Q(N, m, u).days;
+	const { days: g, yearDays: d } = Q(N, h, u), y = Q(N, m, u).days;
 	return {
 		rate: f,
 		x: c,
-		DIM: d,
-		DSM: d - g,
+		DIM: y,
+		DSM: y - g,
 		A: g,
-		B: p
+		B: d
 	};
 }
 function ft(t, n, e, r, o, i = !1) {
 	let u = i ? 0 : it(o);
-	const s = k(t);
+	const s = $(t);
 	if (!J(s)) throw B.BuiltIn.Num;
-	const a = k(n);
+	const a = $(n);
 	if (!J(a)) throw B.BuiltIn.Num;
 	const l = e.map(q), f = Math.trunc(q(r));
 	if (1 !== f && 2 !== f && 4 !== f) throw B.BuiltIn.Num;
@@ -296,7 +296,7 @@ function ft(t, n, e, r, o, i = !1) {
 		basis: u
 	};
 }
-var ct = (t) => Number.isFinite(t) ? t : 0, ht = A({
+var ct = (t) => Number.isFinite(t) ? t : 0, ht = v({
 	ACCRINT: () => mt,
 	ACCRINTM: () => Nt
 });
@@ -308,63 +308,63 @@ function mt(t, n, e, r, o, i, u = 0, s = !0) {
 		if ("number" == typeof t) return 0 !== t;
 		if (B.isError(t)) throw t;
 		throw B.BuiltIn.Value;
-	}(s), l = k(t);
+	}(s), l = $(t);
 	if (!J(l)) throw B.BuiltIn.Num;
-	const f = k(n);
+	const f = $(n);
 	if (!J(f)) throw B.BuiltIn.Num;
-	const c = k(e);
+	const c = $(e);
 	if (!J(c)) throw B.BuiltIn.Num;
-	const h = q(r), m = void 0 === o ? 1e3 : L(o), N = Math.trunc(q(i));
+	const h = q(r), m = void 0 === o ? 1e3 : k(o), N = Math.trunc(q(i));
 	if (1 !== N && 2 !== N && 4 !== N) throw B.BuiltIn.Num;
-	const g = it(u), p = Math.floor(l), d = Math.floor(c);
-	if (p >= d || h <= 0 || m <= 0) throw B.BuiltIn.Num;
-	const y = function(t, n, e, r, o, i) {
-		const u = 12 / r, s = G(X(n));
+	const g = it(u), d = Math.floor(l), y = Math.floor(c);
+	if (d >= y || h <= 0 || m <= 0) throw B.BuiltIn.Num;
+	const M = function(t, n, e, r, o, i) {
+		const u = 12 / r, s = G(K(n));
 		let a;
 		if (e > n && i) {
 			a = n;
 			for (let t = n; t < e;) a = t, t = wt(t, u, s);
 		} else a = wt(n, -u, s);
 		const l = 3 === o ? 365 / r : 1 === o ? n - wt(n, -u, s) : 360 / r;
-		let f = Mt(Math.max(t, a), e, o) / l;
+		let f = pt(Math.max(t, a), e, o) / l;
 		for (let n = a; n > t;) {
 			const e = wt(n, -u, s);
-			t <= e ? i && (f += 1) : f += Mt(t, n, o) / It(e, n, r, o), n = e;
+			t <= e ? i && (f += 1) : f += pt(t, n, o) / It(e, n, r, o), n = e;
 		}
 		return f;
-	}(p, Math.floor(f), d, N, g, a);
-	return ct(m * (h / N) * y);
+	}(d, Math.floor(f), y, N, g, a);
+	return ct(m * (h / N) * M);
 }
 function Nt(t, n, e, r, o = 0) {
-	const i = k(t);
+	const i = $(t);
 	if (!J(i)) throw B.BuiltIn.Num;
-	const u = k(n);
+	const u = $(n);
 	if (!J(u)) throw B.BuiltIn.Num;
-	const s = q(e), a = void 0 === r ? 1e3 : L(r), l = it(o);
+	const s = q(e), a = void 0 === r ? 1e3 : k(r), l = it(o);
 	if (Math.floor(i) > Math.floor(u) || s <= 0 || a <= 0) throw B.BuiltIn.Num;
 	const f = a * s * tt(i, u, l);
 	return Number.isFinite(f) ? f : 0;
 }
-var gt = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d), pt = (t) => 2 === t.m && t.d === z(t.y, 2);
-function dt(t, n, e) {
-	const r = X(t), o = X(n);
-	return pt(o) && (e || pt(r)) && (o.d = 30), 31 === o.d && (e || r.d >= 30) && (o.d = 30), (31 === r.d || pt(r)) && (r.d = 30), gt(r, o);
+var gt = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d), dt = (t) => 2 === t.m && t.d === _(t.y, 2);
+function yt(t, n, e) {
+	const r = K(t), o = K(n);
+	return dt(o) && (e || dt(r)) && (o.d = 30), 31 === o.d && (e || r.d >= 30) && (o.d = 30), (31 === r.d || dt(r)) && (r.d = 30), gt(r, o);
 }
-function yt(t, n) {
-	const e = X(t), r = X(n);
+function Mt(t, n) {
+	const e = K(t), r = K(n);
 	return 31 === e.d && (e.d = 30), 31 === r.d && (r.d = 30), gt(e, r);
 }
-var Mt = (t, n, e) => 0 === e ? dt(t, n, !1) : 4 === e ? yt(t, n) : n - t, It = (t, n, e, r) => 1 === r ? n - t : 3 === r ? 365 / e : 4 === r ? yt(t, n) : dt(t, n, !0);
+var pt = (t, n, e) => 0 === e ? yt(t, n, !1) : 4 === e ? Mt(t, n) : n - t, It = (t, n, e, r) => 1 === r ? n - t : 3 === r ? 365 / e : 4 === r ? Mt(t, n) : yt(t, n, !0);
 function wt(t, n, e) {
 	if (t < 1) throw B.BuiltIn.Num;
-	const r = W(X(t), n), o = H(r.y, r.m, e ? z(r.y, r.m) : r.d);
+	const r = H(K(t), n), o = X(r.y, r.m, e ? _(r.y, r.m) : r.d);
 	if (o < 1 || o > 2958465) throw B.BuiltIn.Num;
 	return o;
 }
 function bt(t, n, e, r, o, i, u) {
 	const s = q(t), a = Math.floor(q(n)), l = Math.floor(q(e)), f = q(r), c = q(o), h = q(i);
 	if (s <= 0 || f < 0 || f > s || c < 0 || h <= 0 || !b.isValidDate(a) || !b.isValidDate(l) || a > l) return null;
-	const m = Math.floor(L(u ?? 0));
+	const m = Math.floor(k(u ?? 0));
 	return m < 0 || 2 === m || m > 4 ? null : {
 		cost: s,
 		salvage: f,
@@ -391,51 +391,51 @@ var Bt = (t) => {
 	let e = Math.abs(n), r = 1, o = t;
 	for (; e > 0;) e % 2 == 1 && (r *= o), o *= o, e = Math.floor(e / 2);
 	return n < 0 ? 1 / r : r;
-}, Ct = (t) => t >= 2147483648 || t <= -2147483649 || Number.isNaN(t) ? -2147483648 : Math.trunc(t), Rt = (t, n = 0) => {
+}, Rt = (t) => t >= 2147483648 || t <= -2147483649 || Number.isNaN(t) ? -2147483648 : Math.trunc(t), Ct = (t, n = 0) => {
 	const e = 10 ** n, r = Number(Math.abs(t).toPrecision(15));
 	return Math.sign(t) * Math.round(r * e) / e;
-}, Et = A({ AMORDEGRC: () => vt }), At = 1e6;
-function vt(t, n, e, r, o, i, u = 0) {
+}, Et = v({ AMORDEGRC: () => At }), vt = 1e6;
+function At(t, n, e, r, o, i, u = 0) {
 	const s = bt(t, n, e, r, o, i, u);
 	if (!s) return NaN;
 	const { cost: a, salvage: l, periodIndex: f, rate: c, days: h, yearDays: m } = s, N = h / m, g = 1 / c;
 	if (g <= 2) return NaN;
-	const p = c * (g <= 4 ? 1.5 : g <= 6 ? 2 : 2.5), d = Math.ceil(g);
+	const d = c * (g <= 4 ? 1.5 : g <= 6 ? 2 : 2.5), y = Math.ceil(g);
 	if (a - l === 0) return 0;
-	const y = Rt(Math.min(a * p * N, a - l));
-	if (0 === f) return y;
-	let M = a - y;
-	const I = Math.min(f, d - 3);
+	const M = Ct(Math.min(a * d * N, a - l));
+	if (0 === f) return M;
+	let p = a - M;
+	const I = Math.min(f, y - 3);
 	let w = 1;
 	if (I >= 1) {
-		if (I - 1 <= At) for (; w < I; w++) {
-			if (M < l) return 0;
-			M -= M * p;
+		if (I - 1 <= vt) for (; w < I; w++) {
+			if (p < l) return 0;
+			p -= p * d;
 		}
-		else M *= xt(1 - p, I - 1), w = I;
-		if (M < l) return 0;
-		if (f === I) return Rt(M * p);
-		M -= M * p, w++;
+		else p *= xt(1 - d, I - 1), w = I;
+		if (p < l) return 0;
+		if (f === I) return Ct(p * d);
+		p -= p * d, w++;
 	}
 	for (; w <= f; w++) {
-		if (M < l) return 0;
-		const t = d - w;
+		if (p < l) return 0;
+		const t = y - w;
 		if (t < 1) return 0;
-		const n = t <= 2 ? M / t : M * p;
-		if (w === f) return Rt(n);
-		M -= n;
+		const n = t <= 2 ? p / t : p * d;
+		if (w === f) return Ct(n);
+		p -= n;
 	}
 	return 0;
 }
-var Dt = A({
-	CUMIPMT: () => kt,
-	CUMPRINC: () => Lt,
+var Dt = v({
+	CUMIPMT: () => $t,
+	CUMPRINC: () => kt,
 	FV: () => Ft,
 	IPMT: () => Ot,
 	ISPMT: () => qt,
 	NPER: () => Tt,
 	PMT: () => Vt,
-	PPMT: () => $t,
+	PPMT: () => Lt,
 	PV: () => St,
 	RATE: () => Pt
 });
@@ -493,7 +493,7 @@ function Ot(t, n, e, r, o = 0, i = 0) {
 	const u = Math.log1p(t), s = n - 1, a = -t * (r * -Math.expm1((s - e) * u) - o * (s * u < 700 ? Math.exp(-e * u) * Math.expm1(s * u) : Math.exp((s - e) * u) - Math.exp(-e * u))) / -Math.expm1(-e * u);
 	return i ? a / (1 + t) : a;
 }
-function $t(t, n, e, r, o = 0, i = 0) {
+function Lt(t, n, e, r, o = 0, i = 0) {
 	if (b.formatResults(Bt(b.getRuntime())), n < 1 || n - 1 >= e) return NaN;
 	if (0 === t) return -(r + o) / e;
 	if (t <= -1) return NaN;
@@ -502,14 +502,14 @@ function $t(t, n, e, r, o = 0, i = 0) {
 	const a = i ? n - 2 : n - 1;
 	return -(r + o) * (t * Math.exp((a - e) * u)) / s;
 }
-function kt(t, n, e, r, o, i) {
-	const u = jt(..._t(t, n, e, r, o, i));
+function $t(t, n, e, r, o, i) {
+	const u = Ut(...jt(t, n, e, r, o, i));
 	if (!u) return NaN;
 	const s = u.count * u.payment - u.principal;
 	return Number.isFinite(s) ? s : NaN;
 }
-function Lt(t, n, e, r, o, i) {
-	const u = jt(..._t(t, n, e, r, o, i));
+function kt(t, n, e, r, o, i) {
+	const u = Ut(...jt(t, n, e, r, o, i));
 	return u ? u.principal : NaN;
 }
 function qt(t, n, e, r) {
@@ -517,14 +517,14 @@ function qt(t, n, e, r) {
 	const o = r * (n - e) * t / e;
 	return Number.isFinite(o) ? o : NaN;
 }
-var _t = (t, n, e, r, o, i) => [
+var jt = (t, n, e, r, o, i) => [
 	q(t),
 	q(n),
 	q(e),
 	q(r),
 	q(o),
 	q(i)
-], jt = (t, n, e, r, o, i) => {
+], Ut = (t, n, e, r, o, i) => {
 	if (t <= 0 || n <= 0 || e <= 0 || r < 1 || r > o || o > n || 0 !== i && 1 !== i) return null;
 	const u = Vt(t, n, e, 0, i);
 	if (!Number.isFinite(u)) return null;
@@ -550,20 +550,20 @@ var _t = (t, n, e, r, o, i) => [
 		principal: m,
 		count: l
 	};
-}, Ut = (t) => {
+}, Yt = (t) => {
 	const n = b.getArgs().getRawAt(t), e = n;
 	return !0 !== e?.isIRange || 1 === e.size && !0 === n.isIReferenceRange;
 };
-function Yt(t, n, e, r = "xnpv") {
+function zt(t, n, e, r = "xnpv") {
 	const o = "xirr" === r, i = t.flatten({ onError: "value" }), u = n.flatten({ onError: "value" }), s = i.getRowCount();
 	if (s !== u.getRowCount()) throw B.BuiltIn.Num;
-	const a = !Ut(e + 1), l = Ut(e) || o, f = !a || o, c = o ? 0 : 1, h = [], m = [];
+	const a = !Yt(e + 1), l = Yt(e) || o, f = !a || o, c = o ? 0 : 1, h = [], m = [];
 	let N;
 	for (let t = 0; t < s; t++) {
 		const n = i.getValueAt(t, 0) ?? null, e = u.getValueAt(t, 0) ?? null;
 		if (0 === t) {
 			if (B.isError(e)) throw e;
-			if (!o && (N = zt(e, f, o, 0), N < c || N > 2958465)) throw B.BuiltIn.Num;
+			if (!o && (N = _t(e, f, o, 0), N < c || N > 2958465)) throw B.BuiltIn.Num;
 			if (B.isError(n)) throw n;
 		} else {
 			if (B.isError(n)) throw n;
@@ -571,7 +571,7 @@ function Yt(t, n, e, r = "xnpv") {
 		}
 		if (o && null === n) continue;
 		if (o && null === e && a) throw B.BuiltIn.Num;
-		const r = zt(e, f, o, t), s = Gt(n, l, o, t);
+		const r = _t(e, f, o, t), s = Gt(n, l, o, t);
 		if (r > 2958465 || r < c) throw B.BuiltIn.Num;
 		if (!o && r < N) throw B.BuiltIn.Num;
 		void 0 === N && (N = r), h.push(s), m.push(r);
@@ -582,24 +582,24 @@ function Yt(t, n, e, r = "xnpv") {
 		days: m.map((t) => t - g)
 	};
 }
-function zt(t, n, e, r) {
-	const o = n ? $(t) : t;
+function _t(t, n, e, r) {
+	const o = n ? L(t) : t;
 	if ("number" != typeof o || Number.isNaN(o)) throw e || 0 === r ? B.BuiltIn.Value : B.BuiltIn.Num;
 	return Math.trunc(o);
 }
 function Gt(t, n, e, r) {
-	const o = n ? L(t) : t;
+	const o = n ? k(t) : t;
 	if ("number" != typeof o || Number.isNaN(o)) throw e || 0 === r ? B.BuiltIn.Value : B.BuiltIn.Num;
 	return o;
 }
-var Xt = A({
-	IRR: () => Wt,
-	MIRR: () => Kt,
-	NPV: () => Ht,
+var Kt = v({
+	IRR: () => Ht,
+	MIRR: () => Wt,
+	NPV: () => Xt,
 	XIRR: () => Qt,
 	XNPV: () => Zt
 });
-function Ht(t, n) {
+function Xt(t, n) {
 	b.formatResults(Bt(b.getRuntime()));
 	const e = [];
 	for (const t of n) for (const n of t.values()) e.push(n);
@@ -610,8 +610,8 @@ function Ht(t, n) {
 	for (let t = r - 1; t >= 0; t--) i += e[t], i /= o;
 	return i;
 }
-function Wt(t, n = .1) {
-	if (b.formatResults("0%"), b.getArgs().getKindAt(0) === R.Error) throw t[0];
+function Ht(t, n = .1) {
+	if (b.formatResults("0%"), b.getArgs().getKindAt(0) === C.Error) throw t[0];
 	if (n <= -1 || 1 + n === n) throw B.BuiltIn.Value;
 	if (void 0 === t) throw B.BuiltIn.Value;
 	const e = [];
@@ -644,7 +644,7 @@ function Wt(t, n = .1) {
 	}
 	return NaN;
 }
-function Kt(t, n, e) {
+function Wt(t, n, e) {
 	if (b.formatResults("0%"), void 0 === t) throw B.BuiltIn.Value;
 	const r = [];
 	for (const n of t) {
@@ -676,7 +676,7 @@ function Zt(t, n, e) {
 	const r = q(t);
 	if (void 0 === n || void 0 === e) throw B.BuiltIn.NA;
 	if (r <= 0) return NaN;
-	const o = Yt(n, e, 1);
+	const o = zt(n, e, 1);
 	let i = 0;
 	for (let t = 0; t < o.values.length; t++) {
 		const n = xt(1 + r, o.days[t] / 365);
@@ -686,9 +686,9 @@ function Zt(t, n, e) {
 	return Number.isFinite(i) ? i : NaN;
 }
 function Qt(t, n, e = .1) {
-	const r = L(e);
+	const r = k(e);
 	if (void 0 === t || void 0 === n) throw B.BuiltIn.NA;
-	const o = Yt(t, n, 0, "xirr"), i = o.values, u = i.length;
+	const o = zt(t, n, 0, "xirr"), i = o.values, u = i.length;
 	if (1 === u) throw B.BuiltIn.NA;
 	let s = !1, a = !1;
 	for (const t of i) t > 0 ? s = !0 : t < 0 && (a = !0);
@@ -741,30 +741,30 @@ function Qt(t, n, e = .1) {
 		1e300
 	].filter((t) => t < c);
 	r > -1 && r < c && !h.includes(r) && h.push(r), h.sort((t, n) => t - n);
-	let m = NaN, N = NaN, g = Number.POSITIVE_INFINITY, p = h[0], d = f(p);
-	if (0 === d) return p;
+	let m = NaN, N = NaN, g = Number.POSITIVE_INFINITY, d = h[0], y = f(d);
+	if (0 === y) return d;
 	for (let t = 1; t < h.length; t++) {
 		const n = h[t], e = f(n);
 		if (0 === e) return n;
-		if (Number.isFinite(e) && Number.isFinite(d) && e > 0 != d > 0) {
-			const t = Math.min(Math.abs(p - r), Math.abs(n - r));
-			t < g && (g = t, m = p, N = n);
+		if (Number.isFinite(e) && Number.isFinite(y) && e > 0 != y > 0) {
+			const t = Math.min(Math.abs(d - r), Math.abs(n - r));
+			t < g && (g = t, m = d, N = n);
 		}
-		p = n, d = e;
+		d = n, y = e;
 	}
 	if (!Number.isFinite(m)) return NaN;
-	let y = f(m);
+	let M = f(m);
 	for (let t = 0; t < 200; t++) {
 		const t = (m + N) / 2;
 		if (t === m || t === N) break;
 		const n = f(t);
 		if (0 === n) return t;
-		n > 0 == y > 0 ? (m = t, y = n) : N = t;
+		n > 0 == M > 0 ? (m = t, M = n) : N = t;
 	}
-	const M = Math.abs(f(m)) <= Math.abs(f(N)) ? m : N;
-	return Number.isFinite(M) ? M : NaN;
+	const p = Math.abs(f(m)) <= Math.abs(f(N)) ? m : N;
+	return Number.isFinite(p) ? p : NaN;
 }
-var Jt = A({
+var Jt = v({
 	DOLLARDE: () => en,
 	DOLLARFR: () => rn,
 	EFFECT: () => tn,
@@ -806,7 +806,7 @@ var on = (t) => {
 		scale: 10 ** Math.ceil(Math.log10(n))
 	};
 };
-var un = (t, n) => Y(t, n - 1), sn = (t) => t.d === un(t.y, t.m);
+var un = (t, n) => z(t, n - 1), sn = (t) => t.d === un(t.y, t.m);
 function an(t, n = !1) {
 	const e = Math.min(t.d, un(t.y, t.m)), r = t.m <= 2 ? t.y - 1 : t.y, o = Math.floor(r / 400), i = r - 400 * o, u = Math.floor((153 * (t.m + (t.m > 2 ? -3 : 9)) + 2) / 5) + e - 1, s = 146097 * o + (365 * i + Math.floor(i / 4) - Math.floor(i / 100) + u) - 693900;
 	return !n && s >= 60 ? s + 1 : s;
@@ -856,24 +856,24 @@ function Nn(t, n, e) {
 function gn(t, n, e) {
 	return an(mn(t, n, e).ncd);
 }
-function pn(t, n, e) {
+function dn(t, n, e) {
 	const r = mn(t, n, e);
 	return an(r.pcd) <= 0 ? NaN : r.count;
 }
-function dn(t, n, e, r) {
+function yn(t, n, e, r) {
 	return function(t, n, e) {
 		const { days: r } = Q(t, n, e);
 		return t < n ? r : 0;
 	}(Nn(t, n, e), t, r);
 }
-function yn(t, n, e, r) {
+function Mn(t, n, e, r) {
 	const o = mn(t, n, e);
 	if (0 !== r && 4 !== r) return an(o.ncd) - t;
 	const i = fn(t), u = hn(o.maturity, o.count - 1, o.step, !0), s = o.pcd.y === i.y && o.pcd.m === i.m && o.pcd.d === i.d;
 	let a = s ? hn(o.maturity, o.count, o.step, !0).d : i.d, l = u.d;
 	return 4 === r ? (a = Math.min(a, 30), l = Math.min(l, 30)) : ((31 === a || s && 2 === i.m && a >= un(i.y, 2)) && (a = 30), (31 === l || 2 === u.m && l >= un(u.y, 2)) && (l = 30)), 360 * (u.y - i.y) + 30 * (u.m - i.m) + (l - a);
 }
-function Mn(t, n, e, r) {
+function pn(t, n, e, r) {
 	if (3 === r) return 365 / e;
 	if (1 !== r) return 360 / e;
 	const o = 12 / e, i = fn(n), u = [i], s = [i];
@@ -891,11 +891,11 @@ function Mn(t, n, e, r) {
 	return ln(u[h], u[h - 1]);
 }
 function In(t, n, e, r) {
-	const o = k(t), i = k(n), u = Math.floor(o), s = Math.floor(i);
+	const o = $(t), i = $(n), u = Math.floor(o), s = Math.floor(i);
 	if (!J(o) || !J(i) || u >= s) throw B.BuiltIn.Num;
 	const a = Math.trunc(q(e));
 	if (1 !== a && 2 !== a && 4 !== a) throw B.BuiltIn.Num;
-	const l = void 0 === r ? 0 : L(r), f = Math.trunc(l);
+	const l = void 0 === r ? 0 : k(r), f = Math.trunc(l);
 	if (l < 0 || f > 4) throw B.BuiltIn.Num;
 	return {
 		settlement: u,
@@ -905,7 +905,7 @@ function In(t, n, e, r) {
 	};
 }
 function wn(t, n, e, r) {
-	const o = pn(t, n, e), i = dn(t, n, e, r), u = 1 === r ? i + yn(t, n, e, r) : Mn(t, n, e, r);
+	const o = dn(t, n, e), i = yn(t, n, e, r), u = 1 === r ? i + Mn(t, n, e, r) : pn(t, n, e, r);
 	return {
 		N: o,
 		A: i,
@@ -933,44 +933,44 @@ function Bn(t, n, e, r, o, i) {
 		const n = t + f, e = h / c ** n;
 		m += n * e, N += e;
 	}
-	const g = u + f, p = c ** g;
-	if (!Number.isFinite(p)) return NaN;
-	const d = 100 / p;
-	return m += g * d, N += d, m / N / o;
+	const g = u + f, d = c ** g;
+	if (!Number.isFinite(d)) return NaN;
+	const y = 100 / d;
+	return m += g * y, N += y, m / N / o;
 }
-var xn = A({
-	COUPDAYBS: () => Cn,
-	COUPDAYS: () => Rn,
+var xn = v({
+	COUPDAYBS: () => Rn,
+	COUPDAYS: () => Cn,
 	COUPDAYSNC: () => En,
-	COUPNCD: () => An,
+	COUPNCD: () => vn,
 	COUPNUM: () => Dn,
-	COUPPCD: () => vn
+	COUPPCD: () => An
 });
-function Cn(t, n, e, r = 0) {
+function Rn(t, n, e, r = 0) {
 	const o = In(t, n, e, r);
-	return dn(o.settlement, o.maturity, o.frequency, o.basis);
+	return yn(o.settlement, o.maturity, o.frequency, o.basis);
 }
-function Rn(t, n, e, r = 0) {
+function Cn(t, n, e, r = 0) {
 	const o = In(t, n, e, r);
-	return Mn(o.settlement, o.maturity, o.frequency, o.basis);
+	return pn(o.settlement, o.maturity, o.frequency, o.basis);
 }
 function En(t, n, e, r = 0) {
 	const o = In(t, n, e, r);
-	return yn(o.settlement, o.maturity, o.frequency, o.basis);
+	return Mn(o.settlement, o.maturity, o.frequency, o.basis);
 }
-function An(t, n, e, r = 0) {
+function vn(t, n, e, r = 0) {
 	const o = In(t, n, e, r);
 	return gn(o.settlement, o.maturity, o.frequency);
 }
-function vn(t, n, e, r = 0) {
+function An(t, n, e, r = 0) {
 	const o = In(t, n, e, r);
 	return Nn(o.settlement, o.maturity, o.frequency);
 }
 function Dn(t, n, e, r = 0) {
 	const o = In(t, n, e, r);
-	return pn(o.settlement, o.maturity, o.frequency);
+	return dn(o.settlement, o.maturity, o.frequency);
 }
-var Fn = A({
+var Fn = v({
 	DATEDIF: () => Sn,
 	DAYS360: () => Tn,
 	YEARFRAC: () => Vn
@@ -992,47 +992,47 @@ function Sn(t, n, e) {
 	return NaN;
 }
 function Vn(t, n, e = 0) {
-	const r = void 0 === e ? 0 : L(e), o = Math.trunc(r);
+	const r = void 0 === e ? 0 : k(e), o = Math.trunc(r);
 	if (r < 0 || o > 4) return NaN;
-	const i = k(t);
+	const i = $(t);
 	if (!J(i)) return NaN;
-	const u = k(n);
+	const u = $(n);
 	return J(u) ? tt(i, u, o) : NaN;
 }
 function Tn(t, n, e = !1) {
 	if (!J(t) || !J(n)) return NaN;
 	const r = .5 / 86400, o = Math.floor(t + r), i = Math.floor(n + r);
 	return e ? (i >= o ? 1 : -1) * Q(o, i, 4).days : function(t, n) {
-		const e = K(t), r = K(n), o = e.year, i = e.month;
+		const e = W(t), r = W(n), o = e.year, i = e.month;
 		let u = e.day, s = r.year, a = r.month, l = r.day;
-		return 2 === i ? 3 === K(t + 1).month && (u = 30) : 31 === u && (u = 30), 31 === l && (u < 30 ? (12 === a ? (s += 1, a = 1) : a += 1, l = 1) : l = 30), Z(o, i, u, s, a, l);
+		return 2 === i ? 3 === W(t + 1).month && (u = 30) : 31 === u && (u = 30), 31 === l && (u < 30 ? (12 === a ? (s += 1, a = 1) : a += 1, l = 1) : l = 30), Z(o, i, u, s, a, l);
 	}(o, i);
 }
-var Pn = A({
+var Pn = v({
 	AMORLINC: () => qn,
-	DB: () => kn,
-	DDB: () => Ln,
+	DB: () => $n,
+	DDB: () => kn,
 	SLN: () => On,
-	SYD: () => $n
+	SYD: () => Ln
 });
 function On(t, n, e) {
 	if (b.formatResults(Bt(b.getRuntime())), 0 === e) throw B.BuiltIn.Div0;
 	return (t - n) / e;
 }
-function $n(t, n, e, r) {
+function Ln(t, n, e, r) {
 	if (b.formatResults(Bt(b.getRuntime())), n < 0 || e <= 0 || r <= 0 || r > e) return NaN;
 	const o = e * (e + 1) / 2;
 	if (!Number.isFinite(o)) throw B.BuiltIn.Div0;
 	return (t - n) * (e + 1 - r) / o;
 }
-function kn(t, n, e, r, o = 12) {
+function $n(t, n, e, r, o = 12) {
 	if (b.formatResults(Bt(b.getRuntime())), t < 0 || n < 0 || e <= 0 || r <= 0) return NaN;
-	const i = Ct(o);
+	const i = Rt(o);
 	if (i < 1 || i > 12) return NaN;
-	const u = Ct(e), s = Ct(r);
+	const u = Rt(e), s = Rt(r);
 	if (s > u + (i < 12 ? 1 : 0)) return NaN;
 	if (0 === t) return 0;
-	const a = Rt(1 - xt(n / t, 1 / e), 3);
+	const a = Ct(1 - xt(n / t, 1 / e), 3);
 	if (0 === a) return 0;
 	const l = t * a * (i / 12), f = Math.max(s, 1);
 	if (1 === f) return l;
@@ -1040,7 +1040,7 @@ function kn(t, n, e, r, o = 12) {
 	for (let t = 2; t < f; t++) c -= c * a;
 	return f === u + 1 ? c / 12 * a * (12 - i) : c * a;
 }
-function Ln(t, n, e, r, o = 2) {
+function kn(t, n, e, r, o = 2) {
 	if (b.formatResults(Bt(b.getRuntime())), t < 0 || n < 0 || e <= 0 || r <= 0 || r > e || o <= 0) return NaN;
 	const i = o / e, u = Math.max(r, 1) - 1, s = 0 === u ? t : t * xt(1 - i, u);
 	let a = s * i;
@@ -1051,17 +1051,17 @@ function qn(t, n, e, r, o, i, u = 0) {
 	if (!s) return NaN;
 	const { cost: a, salvage: l, periodIndex: f, rate: c, days: h, yearDays: m } = s, N = a * c;
 	if (!Number.isFinite(N)) return 0;
-	const g = a - l, p = Math.min(a * (c * (h / m)), g);
-	if (0 === f) return p;
-	const d = Math.floor((g - p) / N);
-	return f <= d ? N : f === d + 1 ? (g - p) % N : 0;
-}
-var _n = A({
-	FVSCHEDULE: () => jn,
-	PDURATION: () => Yn,
-	RRI: () => Un
+	const g = a - l, d = Math.min(a * (c * (h / m)), g);
+	if (0 === f) return d;
+	const y = Math.floor((g - d) / N);
+	return f <= y ? N : f === y + 1 ? (g - d) % N : 0;
+}
+var jn = v({
+	FVSCHEDULE: () => Un,
+	PDURATION: () => zn,
+	RRI: () => Yn
 });
-function jn(t, n) {
+function Un(t, n) {
 	if (void 0 === t || void 0 === n) throw B.BuiltIn.NA;
 	let e = q(t);
 	const r = b.getArgs().getRawAt(1), o = r, i = !0 === o?.isIRange, u = i && 1 === o.size && !0 === o.isIReferenceRange;
@@ -1073,21 +1073,21 @@ function jn(t, n) {
 	}
 	return Number.isFinite(e) ? e : 0;
 }
-function Un(t, n, e) {
+function Yn(t, n, e) {
 	if (t <= 0 || e < 0 && n > 0 || e > 0 && n < 0) return NaN;
 	if (0 === n) return 0 === e ? 0 : NaN;
 	const r = xt(e / n, 1 / t) - 1;
 	return Number.isFinite(r) ? r : NaN;
 }
-function Yn(t, n, e) {
+function zn(t, n, e) {
 	if (t <= 0 || n <= 0 || e <= 0) return NaN;
 	const r = Math.log(1 + t);
 	if (0 === r) throw B.BuiltIn.Div0;
 	return (Math.log(e) - Math.log(n)) / r;
 }
-function zn(t, n, e, r) {
+function _n(t, n, e, r) {
 	const o = t.map((t) => {
-		const n = k(t);
+		const n = $(t);
 		if (!J(n)) throw B.BuiltIn.Num;
 		return Math.floor(n);
 	}), i = n.map(q), u = Math.trunc(q(e));
@@ -1099,31 +1099,31 @@ function zn(t, n, e, r) {
 		basis: it(r)
 	};
 }
-var Gn = (t) => H(t.y, t.m, t.d);
-function Xn(t, n, e) {
+var Gn = (t) => X(t.y, t.m, t.d);
+function Kn(t, n, e) {
 	const r = G(t);
 	let o = t.m - 1 + n * e;
 	const i = t.y + Math.floor(o / 12);
-	return o = (o % 12 + 12) % 12 + 1, H(i, o, r ? z(i, o) : Math.min(t.d, z(i, o)));
+	return o = (o % 12 + 12) % 12 + 1, X(i, o, r ? _(i, o) : Math.min(t.d, _(i, o)));
 }
-var Hn = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d);
-function Wn(t, n) {
+var Xn = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d);
+function Hn(t, n) {
 	return 0 !== t && 4 !== t ? (t, n) => n - t : (e, r) => {
-		const o = X(e), i = X(r);
-		return 4 === t ? (31 === o.d && (o.d = 30), 31 === i.d && (i.d = 30), Hn(o, i)) : (G(o) && (o.d = 30), n && G(i) && (i.d = 30), Hn(o, i));
+		const o = K(e), i = K(r);
+		return 4 === t ? (31 === o.d && (o.d = 30), 31 === i.d && (i.d = 30), Xn(o, i)) : (G(o) && (o.d = 30), n && G(i) && (i.d = 30), Xn(o, i));
 	};
 }
-function Kn(t, n, e, r, o) {
-	const i = 12 / r, u = X(e), s = Wn(o, !1), a = Wn(o, !0);
-	let l = X(n);
-	for (; Gn(l) > e;) l = W(l, -i);
+function Wn(t, n, e, r, o) {
+	const i = 12 / r, u = K(e), s = Hn(o, !1), a = Hn(o, !0);
+	let l = K(n);
+	for (; Gn(l) > e;) l = H(l, -i);
 	if (Gn(l) < 1) throw B.BuiltIn.Num;
 	let f = 1;
-	for (; Xn(u, f, i) < n;) f++;
-	if (Xn(u, f, i) > 2958465) throw B.BuiltIn.Num;
+	for (; Kn(u, f, i) < n;) f++;
+	if (Kn(u, f, i) > 2958465) throw B.BuiltIn.Num;
 	let c = 0, h = 0, m = 0, N = e, g = u;
 	for (let e = 0; e < f; e++) {
-		g = W(g, i);
+		g = H(g, i);
 		const r = Gn(g), o = a(N, r);
 		t > N && (c += Math.min(s(N, Math.min(r, t)), o) / o), t < r && (m += Math.min(s(Math.max(N, t), Math.min(r, n)), o) / o), h += e + 1 === f ? (o - a(n, r)) / o : 1, N = r;
 	}
@@ -1135,18 +1135,18 @@ function Kn(t, n, e, r, o) {
 }
 function Zn(t, n, e, r, o, i) {
 	if (Nn(r, n, o) !== r) throw B.BuiltIn.Num;
-	const u = 12 / o, s = pn(e, r, o);
+	const u = 12 / o, s = dn(e, r, o);
 	if (Number.isNaN(s)) throw B.BuiltIn.Num;
 	const a = [r];
-	let l = X(r);
-	for (let t = 0; t < s; t++) l = W(l, -u), a.push(Gn(l));
+	let l = K(r);
+	for (let t = 0; t < s; t++) l = H(l, -u), a.push(Gn(l));
 	if (a[a.length - 1] < 1) throw B.BuiltIn.Num;
 	const f = (t, n) => Q(t, n, i).days, c = wn(t, r, o, i);
 	if (Number.isNaN(c.N)) throw B.BuiltIn.Num;
 	const h = c.E, m = f(e, r);
 	if (m === h) throw B.BuiltIn.Num;
 	if (m < h) {
-		const i = pn(t, n, o) - 1;
+		const i = dn(t, n, o) - 1;
 		if (Number.isNaN(i)) throw B.BuiltIn.Num;
 		return {
 			N: i,
@@ -1155,17 +1155,17 @@ function Zn(t, n, e, r, o, i) {
 			u: f(t, r) / h
 		};
 	}
-	const N = pn(r, n, o);
-	let g = 0, p = 0;
+	const N = dn(r, n, o);
+	let g = 0, d = 0;
 	for (let n = 0; n < s; n++) {
 		const r = a[s - n], u = a[s - n - 1], l = 1 === i ? u - r : 3 === i ? 365 / o : 360 / o, c = Math.max(r, e);
-		t > c && u > c && (g += f(c, Math.min(u, t)) / l), p += 0 === n ? u > e ? f(e, u) / l : 0 : 1;
+		t > c && u > c && (g += f(c, Math.min(u, t)) / l), d += 0 === n ? u > e ? f(e, u) / l : 0 : 1;
 	}
-	const d = X(t), y = H(d.y, d.m, z(d.y, d.m)), M = y < r && gn(y - 1, r, o) === y, I = G(X(r)) && t !== y && !M ? 1 : 0;
+	const y = K(t), M = X(y.y, y.m, _(y.y, y.m)), p = M < r && gn(M - 1, r, o) === M, I = G(K(r)) && t !== M && !p ? 1 : 0;
 	return {
 		N,
 		A: g,
-		DC: p,
+		DC: d,
 		u: c.N - 1 + I + (2 === i || 3 === i ? gn(t, r, o) - t : c.DSC) / h
 	};
 }
@@ -1185,7 +1185,7 @@ function te(t, n, e) {
 	}
 	return r;
 }
-var ne = A({
+var ne = v({
 	ODDFPRICE: () => re,
 	ODDFYIELD: () => oe,
 	ODDLPRICE: () => ie,
@@ -1194,14 +1194,14 @@ var ne = A({
 function ee(t, n, e, r, o, i, u, s, a) {
 	const { N: l, A: f, DC: c, u: h } = Zn(t, n, e, r, s, a), m = i / s, N = 100 * o / s, g = xt(1 + m, l + h);
 	if (!Number.isFinite(g)) throw B.BuiltIn.Num;
-	let p = 0;
-	for (let t = 1; t <= l; t++) p += N / xt(1 + m, t + h);
-	const d = u / g + N * c / xt(1 + m, h) + p - N * f;
-	if (!Number.isFinite(d)) throw B.BuiltIn.Num;
-	return d;
+	let d = 0;
+	for (let t = 1; t <= l; t++) d += N / xt(1 + m, t + h);
+	const y = u / g + N * c / xt(1 + m, h) + d - N * f;
+	if (!Number.isFinite(y)) throw B.BuiltIn.Num;
+	return y;
 }
 function re(t, n, e, r, o, i, u, s, a = 0) {
-	const l = zn([
+	const l = _n([
 		t,
 		n,
 		e,
@@ -1210,12 +1210,12 @@ function re(t, n, e, r, o, i, u, s, a = 0) {
 		o,
 		i,
 		u
-	], s, a), [f, c, h, m] = l.dates, [N, g, p] = l.numbers;
-	if (!(h < f && f < m && m < c) || N < 0 || g < 0 || p <= 0) throw B.BuiltIn.Num;
-	return ee(f, c, h, m, N, g, p, l.frequency, l.basis);
+	], s, a), [f, c, h, m] = l.dates, [N, g, d] = l.numbers;
+	if (!(h < f && f < m && m < c) || N < 0 || g < 0 || d <= 0) throw B.BuiltIn.Num;
+	return ee(f, c, h, m, N, g, d, l.frequency, l.basis);
 }
 function oe(t, n, e, r, o, i, u, s, a = 0) {
-	const l = zn([
+	const l = _n([
 		t,
 		n,
 		e,
@@ -1224,12 +1224,12 @@ function oe(t, n, e, r, o, i, u, s, a = 0) {
 		o,
 		i,
 		u
-	], s, a), [f, c, h, m] = l.dates, [N, g, p] = l.numbers;
-	if (!(h < f && f < m && m < c) || N < 0 || g <= 0 || p <= 0) throw B.BuiltIn.Num;
+	], s, a), [f, c, h, m] = l.dates, [N, g, d] = l.numbers;
+	if (!(h < f && f < m && m < c) || N < 0 || g <= 0 || d <= 0) throw B.BuiltIn.Num;
 	Zn(f, c, h, m, l.frequency, l.basis);
-	const d = te(Jn(N, g, nt(f, c, l.basis)), (t) => {
+	const y = te(Jn(N, g, nt(f, c, l.basis)), (t) => {
 		try {
-			return ee(f, c, h, m, N, t, p, l.frequency, l.basis) - g;
+			return ee(f, c, h, m, N, t, d, l.frequency, l.basis) - g;
 		} catch {
 			return NaN;
 		}
@@ -1239,12 +1239,12 @@ function oe(t, n, e, r, o, i, u, s, a = 0) {
 		N += -m * f * c / s / xt(h, c + 1);
 		for (let t = 1; t <= l; t++) N += -m * (t + c) / s / xt(h, t + c + 1);
 		return N;
-	}(f, c, h, m, N, t, p, l.frequency, l.basis));
-	if (!Number.isFinite(d)) throw B.BuiltIn.Num;
-	return d;
+	}(f, c, h, m, N, t, d, l.frequency, l.basis));
+	if (!Number.isFinite(y)) throw B.BuiltIn.Num;
+	return y;
 }
 function ie(t, n, e, r, o, i, u, s = 0) {
-	const a = zn([
+	const a = _n([
 		t,
 		n,
 		e
@@ -1254,11 +1254,11 @@ function ie(t, n, e, r, o, i, u, s = 0) {
 		i
 	], u, s), [l, f, c] = a.dates, [h, m, N] = a.numbers;
 	if (!(c < l && l < f) || h < 0 || m < 0 || N <= 0) throw B.BuiltIn.Num;
-	const { A: g, DC: p, DSC: d } = Kn(l, f, c, a.frequency, a.basis), y = 100 * h / a.frequency;
-	return (N + Qn(y * p)) / (1 + m / a.frequency * d) - Qn(y * g);
+	const { A: g, DC: d, DSC: y } = Wn(l, f, c, a.frequency, a.basis), M = 100 * h / a.frequency;
+	return (N + Qn(M * d)) / (1 + m / a.frequency * y) - Qn(M * g);
 }
 function ue(t, n, e, r, o, i, u, s = 0) {
-	const a = zn([
+	const a = _n([
 		t,
 		n,
 		e
@@ -1268,10 +1268,10 @@ function ue(t, n, e, r, o, i, u, s = 0) {
 		i
 	], u, s), [l, f, c] = a.dates, [h, m, N] = a.numbers;
 	if (!(c < l && l < f) || h < 0 || m <= 0 || N <= 0) throw B.BuiltIn.Num;
-	const { A: g, DC: p, DSC: d } = Kn(l, f, c, a.frequency, a.basis), y = 100 * h / a.frequency, M = N + Qn(y * p), I = m + Qn(y * g);
-	return (M - I) / I * (a.frequency / d);
+	const { A: g, DC: d, DSC: y } = Wn(l, f, c, a.frequency, a.basis), M = 100 * h / a.frequency, p = N + Qn(M * d), I = m + Qn(M * g);
+	return (p - I) / I * (a.frequency / y);
 }
-var se = A({
+var se = v({
 	DURATION: () => le,
 	MDURATION: () => fe,
 	PRICE: () => ae,
@@ -1317,17 +1317,17 @@ function ce(t, n, e, r, o, i, u = 0) {
 		if (Number.isNaN(t)) throw B.BuiltIn.Num;
 		return t;
 	}
-	const p = g.A, d = Q(c, h, N).days, y = 1 === N || 2 === N || 3 === N ? p + d : g.E, M = l / 100 + p / y * (a / m);
-	return ct((f / 100 + a / m - M) / M * m * (y / d));
+	const d = g.A, y = Q(c, h, N).days, M = 1 === N || 2 === N || 3 === N ? d + y : g.E, p = l / 100 + d / M * (a / m);
+	return ct((f / 100 + a / m - p) / p * m * (M / y));
 }
-var he = A({
+var he = v({
 	DISC: () => me,
-	INTRATE: () => pe,
+	INTRATE: () => de,
 	PRICEDISC: () => Ne,
-	PRICEMAT: () => ye,
-	RECEIVED: () => de,
+	PRICEMAT: () => Me,
+	RECEIVED: () => ye,
 	YIELDDISC: () => ge,
-	YIELDMAT: () => Me
+	YIELDMAT: () => pe
 });
 function me(t, n, e, r, o = 0) {
 	const i = st(t, n, e, r, o), u = (1 - i.x / i.y) / tt(i.settlement, i.maturity, i.basis);
@@ -1341,26 +1341,26 @@ function ge(t, n, e, r, o = 0) {
 	const i = st(t, n, e, r, o), u = (i.y - i.x) / i.x / tt(i.settlement, i.maturity, i.basis);
 	return Number.isFinite(u) ? u : NaN;
 }
-function pe(t, n, e, r, o = 0) {
+function de(t, n, e, r, o = 0) {
 	const i = st(t, n, e, r, o), u = (i.y - i.x) / i.x / tt(i.settlement, i.maturity, i.basis);
 	return Number.isFinite(u) ? u : NaN;
 }
-function de(t, n, e, r, o = 0) {
+function ye(t, n, e, r, o = 0) {
 	const i = st(t, n, e, r, o), u = 1 - i.y * tt(i.settlement, i.maturity, i.basis);
 	if (!(u > 0)) throw B.BuiltIn.Num;
 	return i.x / u;
 }
-function ye(t, n, e, r, o, i = 0) {
+function Me(t, n, e, r, o, i = 0) {
 	const u = lt(t, n, e, r, o, i);
 	if (u.rate < 0 || u.x < 0) throw B.BuiltIn.Num;
 	return (100 + ct(u.DIM / u.B * u.rate * 100)) / (1 + u.DSM / u.B * u.x) - ct(u.A / u.B * u.rate * 100);
 }
-function Me(t, n, e, r, o, i = 0) {
+function pe(t, n, e, r, o, i = 0) {
 	const u = lt(t, n, e, r, o, i);
 	if (u.rate < 0 || u.x <= 0) throw B.BuiltIn.Num;
 	return ((1 + u.DIM / u.B * u.rate) / (u.x / 100 + u.A / u.B * u.rate) - 1) / (u.DSM / u.B);
 }
-var Ie = A({
+var Ie = v({
 	TBILLEQ: () => Be,
 	TBILLPRICE: () => we,
 	TBILLYIELD: () => be
@@ -1386,8 +1386,8 @@ function Be(t, n, e) {
 	const u = r.days / (r.days > 365 ? 366 : 365);
 	return (-2 * u + 2 * Math.sqrt(u * u - (2 * u - 1) * (1 - 1 / i))) / (2 * u - 1);
 }
-var xe = A({ VDB: () => Re }), Ce = 1e7;
-function Re(t, n, e, r, o, i = 2, u = !1) {
+var xe = v({ VDB: () => Ce }), Re = 1e7;
+function Ce(t, n, e, r, o, i = 2, u = !1) {
 	if (b.formatResults(Bt(b.getRuntime())), t < 0 || n < 0 || e < 0 || i < 0 || r < 0 || o > e || r > o) return NaN;
 	if (0 === e) throw B.BuiltIn.Div0;
 	if (r === o) return 0;
@@ -1416,7 +1416,7 @@ function Re(t, n, e, r, o, i = 2, u = !1) {
 			}
 			s -= o;
 		}
-		if (i > Ce) return s * xt(1 - r, i);
+		if (i > Re) return s * xt(1 - r, i);
 		for (let t = 1; t <= i; t++) {
 			let o;
 			if (a) o = l;
@@ -1447,21 +1447,21 @@ var Ee = (t, n, e) => {
 	const r = t * n;
 	return Number.isFinite(r) ? t - r < e ? t - e : r : NaN;
 };
-var Ae = () => B.BuiltIn.Value, ve = (t, n) => {
+var ve = () => B.BuiltIn.Value, Ae = (t, n) => {
 	let e, r = !1;
 	if (!0 === t?.isIFunction) e = [t];
 	else {
-		if (!0 !== t?.isIRange) return Ae();
+		if (!0 !== t?.isIRange) return ve();
 		{
 			const n = t, o = n.getRowCount();
-			if (o > 1 && n.getColumnCount() > 1) return Ae();
+			if (o > 1 && n.getColumnCount() > 1) return ve();
 			r = o > 1, e = [];
 			for (const t of n.entries()) {
 				const n = t.value;
-				if (!0 !== n?.isIFunction) return Ae();
+				if (!0 !== n?.isIFunction) return ve();
 				e.push(n);
 			}
-			if (0 === e.length || e.length !== n.size) return Ae();
+			if (0 === e.length || e.length !== n.size) return ve();
 		}
 	}
 	const o = [], i = (t, n) => {
@@ -1500,37 +1500,24 @@ var Ae = () => B.BuiltIn.Value, ve = (t, n) => {
 		measures: o,
 		vertical: r,
 		named: e.length > 1
-	} : Ae();
-}, De = (t, n, e) => {
-	let r;
-	try {
-		r = t.twoArgs ? t.fn.execute(n, e()) : t.fn.execute(n);
-	} catch (t) {
-		if (B.isError(t)) return t;
-		throw t;
-	}
-	if (!0 === r?.isIRange) {
-		const t = r;
-		return !0 === t.isIReferenceRange && 1 === t.size ? t.getValueAt(0, 0) : Ae();
-	}
-	return r ?? null;
-}, Fe = (t, n) => {
+	} : ve();
+}, De = (t, n) => {
 	let e = t;
-	if (void 0 === e) e = Ve(n) ? 1 : 0;
-	else if (!Number.isInteger(e) || e < 0 || e > 3) return Ae();
+	if (void 0 === e) e = Se(n) ? 1 : 0;
+	else if (!Number.isInteger(e) || e < 0 || e > 3) return ve();
 	return {
 		hasHeader: 1 === e || 3 === e,
 		show: 2 === e || 3 === e
 	};
-}, Se = (t) => B.isError(t) ? "error" : typeof t, Ve = (t) => {
+}, Fe = (t) => B.isError(t) ? "error" : typeof t, Se = (t) => {
 	if (t.getRowCount() < 2) return !1;
 	const n = t.getColumnCount();
 	for (let e = 0; e < n; e++) {
 		const n = t.getValueAt(0, e), r = t.getValueAt(1, e);
-		if (null !== n && null !== r && Se(n) !== Se(r)) return !0;
+		if (null !== n && null !== r && Fe(n) !== Fe(r)) return !0;
 	}
 	return !1;
-}, Te = (t, n) => Number.isInteger(t) && Math.abs(t) <= n, Pe = (t, n, e) => {
+}, Ve = (t, n) => Number.isInteger(t) && Math.abs(t) <= n, Te = (t, n, e) => {
 	const r = new Array(n).fill(1);
 	if (!t) return {
 		keyDirections: r,
@@ -1539,11 +1526,11 @@ var Ae = () => B.BuiltIn.Value, ve = (t, n) => {
 	const o = [];
 	for (const r of t.entries()) {
 		const t = r.value;
-		if ("number" != typeof t || !Number.isInteger(t) || 0 === t) return Ae();
-		if (Math.abs(t) > n + e) return Ae();
+		if ("number" != typeof t || !Number.isInteger(t) || 0 === t) return ve();
+		if (Math.abs(t) > n + e) return ve();
 		o.push(t);
 	}
-	if (o.length !== t.size) return Ae();
+	if (o.length !== t.size) return ve();
 	if (1 === o.length && Math.abs(o[0]) > n) return {
 		keyDirections: r,
 		byValue: {
@@ -1551,124 +1538,119 @@ var Ae = () => B.BuiltIn.Value, ve = (t, n) => {
 			direction: Math.sign(o[0])
 		}
 	};
-	if (o.length > n) return Ae();
+	if (o.length > n) return ve();
 	const i = /* @__PURE__ */ new Set();
 	for (const t of o) {
 		const e = Math.abs(t);
-		if (e > n || i.has(e)) return Ae();
+		if (e > n || i.has(e)) return ve();
 		i.add(e), r[e - 1] = Math.sign(t);
 	}
 	return {
 		keyDirections: r,
 		byValue: null
 	};
-}, Oe = (t) => 1 === t.size && !0 === t.isIReferenceRange && null === t.getValueAt(0, 0), $e = (t, n) => {
+}, Pe = (t) => 1 === t.size && !0 === t.isIReferenceRange && null === t.getValueAt(0, 0), Oe = (t, n) => {
 	if (1 !== t.getColumnCount() || t.getRowCount() !== n) return !1;
 	for (const n of t.entries()) {
 		const t = typeof n.value;
 		if ("boolean" !== t && "number" !== t) return !1;
 	}
 	return !0;
-}, ke = class {
-	constructor(t, n) {
-		const e = t.getColumnCount(), r = t.getRowCount(), o = n ? { filter: n } : void 0, i = new Array(e), u = new Array(e);
-		for (let n = 0; n < e; n++) {
-			const s = n === e - 1 ? t : t.slice({
-				rowStart: 0,
-				rowEnd: r - 1,
-				colStart: 0,
-				colEnd: n
-			});
-			u[n] = s, i[n] = b.createGrouping(s, o);
+}, Le = (t, n, e, r, o, i) => {
+	if (!n.twoArgs) {
+		const i = t.getAggregate?.(e, n.fn, r, o);
+		if (null === i) return "";
+		if (void 0 !== i) return i;
+	}
+	const u = t.getMembers(e, r, o);
+	return u ? ((t, n, e) => {
+		let r;
+		try {
+			r = t.twoArgs ? t.fn.execute(n, e()) : t.fn.execute(n);
+		} catch (t) {
+			if (B.isError(t)) return t;
+			throw t;
 		}
-		let s = [];
-		const a = [];
-		for (let t = 0; t < e; t++) {
-			const n = i[t], e = new Array(n.getGroupCount());
-			for (let r = 0; r < e.length; r++) {
-				const o = n.getKeys(r)[t], u = 0 === t ? null : s[i[t - 1].getGroup(n.getFirstRecord(r))], l = {
-					level: t,
-					group: r,
-					keys: u ? [...u.keys, o] : [o],
-					parent: u,
-					children: []
-				};
-				e[r] = l, u ? u.children.push(l) : a.push(l);
-			}
-			s = e;
+		if (!0 === r?.isIRange) {
+			const t = r;
+			return !0 === t.isIReferenceRange && 1 === t.size ? t.getValueAt(0, 0) : ve();
 		}
-		this.fieldCount = e, this.groupings = i, this.prefixes = u, this.roots = a;
-	}
-	getRecordCount() {
-		return this.groupings[this.fieldCount - 1].getRecordCount();
-	}
-	getMembers(t, n) {
-		return null === n ? this.groupings[this.fieldCount - 1].getMembers(t) : this.groupings[n.level].getMembers(t, [n.group]);
+		return r ?? null;
+	})(n, u, i) : "";
+}, $e = class {
+	constructor(t, n) {
+		this.root = t.getRoot(), this.fieldCount = n;
+	}
+	sortTree(t, n) {
+		const e = /* @__PURE__ */ new Map(), r = t.byValue, o = (i) => {
+			const u = [...i.getChildren()];
+			if (0 === u.length) return;
+			const s = u[0].getLevel() - 1;
+			u.sort((n, e) => ke(n.getKeys()[s], e.getKeys()[s], t.keyDirections[s])), r && u.sort((t, e) => qe(n(t), n(e), r.direction)), e.set(i, u);
+			for (const t of u) o(t);
+		};
+		return o(this.root), e;
 	}
-	sort(t, n, e) {
-		const r = (n, e, r) => Le(n.keys[r], e.keys[r], t.keyDirections[r]), o = t.byValue, i = (t, e) => qe(n(t), n(e), o.direction);
-		if (e) {
-			const t = [], n = (e) => {
-				for (const r of e) 0 === r.children.length ? t.push(r) : n(r.children);
-			};
-			return n(this.roots), t.sort((t, n) => {
-				for (let e = 0; e < this.fieldCount; e++) {
-					const o = r(t, n, e);
-					if (0 !== o) return o;
-				}
-				return 0;
-			}), o && t.sort(i), t;
-		}
-		const u = (t) => {
-			if (0 === t.length) return;
-			const n = t[0].level;
-			t.sort((t, e) => r(t, e, n)), o && t.sort(i);
-			for (const n of t) u(n.children);
+	sortLeaves(t, n) {
+		const e = [], r = (t) => {
+			const n = t.getChildren();
+			if (0 === n.length) e.push(t);
+			else for (const t of n) r(t);
 		};
-		return u(this.roots), this.roots;
+		for (const t of this.root.getChildren()) r(t);
+		e.sort((n, e) => {
+			const r = n.getKeys(), o = e.getKeys();
+			for (let n = 0; n < this.fieldCount; n++) {
+				const e = ke(r[n], o[n], t.keyDirections[n]);
+				if (0 !== e) return e;
+			}
+			return 0;
+		});
+		const o = t.byValue;
+		return o && e.sort((t, e) => qe(n(t), n(e), o.direction)), e;
 	}
 	lines(t, n) {
-		const e = [], r = n < 0, o = Math.max(0, Math.abs(n) - 1), i = (t) => {
-			for (const n of t) {
-				if (0 === n.children.length) {
+		const e = [], r = n < 0, o = Math.max(0, Math.abs(n) - 1), i = (n) => {
+			for (const u of t.get(n) ?? n.getChildren()) {
+				if (0 === u.getChildren().length) {
 					e.push({
 						kind: "group",
-						node: n
+						node: u
 					});
 					continue;
 				}
-				const t = n.level < o;
+				const t = u.getLevel() - 1 < o;
 				t && r && e.push({
 					kind: "subtotal",
-					node: n
-				}), i(n.children), t && !r && e.push({
+					node: u
+				}), i(u), t && !r && e.push({
 					kind: "subtotal",
-					node: n
+					node: u
 				});
 			}
 		};
 		return 0 !== n && r && e.push({
 			kind: "total",
-			node: null
-		}), i(t), 0 === n || r || e.push({
+			node: this.root
+		}), i(this.root), 0 === n || r || e.push({
 			kind: "total",
-			node: null
+			node: this.root
 		}), e;
 	}
 	keyCells(t, n) {
 		const e = new Array(this.fieldCount).fill("");
 		if ("total" === t.kind) return e[0] = Math.abs(n) > 1 ? "Grand Total" : "Total", e;
-		const r = t.node.keys;
-		for (let n = 0; n <= t.node.level; n++) {
-			const t = r[n];
-			e[n] = null === t ? 0 : t;
+		const r = t.node.getKeys();
+		for (let t = 0; t < r.length; t++) {
+			const n = r[t];
+			e[t] = null === n ? 0 : n;
 		}
 		return e;
 	}
-}, Le = (t, n, e) => null === t || null === n ? t === n ? 0 : null === t ? 1 : -1 : e * b.compare(t, n), qe = (t, n, e) => {
+}, ke = (t, n, e) => null === t || null === n ? t === n ? 0 : null === t ? 1 : -1 : e * b.compare(t, n), qe = (t, n, e) => {
 	const r = B.isError(t), o = B.isError(n);
 	return r || o ? r && o ? 0 : r ? 1 : -1 : e * b.compare(t, n);
-}, _e = (t) => `Row Field ${t + 1}`, je = (t) => `Column Field ${t + 1}`, Ue = (t) => `Value ${t + 1}`, Ye = (t) => {
+}, je = (t) => `Row Field ${t + 1}`, Ue = (t) => `Column Field ${t + 1}`, Ye = (t) => `Value ${t + 1}`, ze = (t) => {
 	const n = t.getColumnCount();
 	if (1 === n) return [t];
 	const e = t.getRowCount(), r = new Array(n);
@@ -1679,224 +1661,201 @@ var Ae = () => B.BuiltIn.Value, ve = (t, n) => {
 		colEnd: o
 	});
 	return r;
-}, ze = (t) => t.slice({
+}, _e = (t) => t.slice({
 	rowStart: 1,
 	rowEnd: t.getRowCount() - 1,
 	colStart: 0,
 	colEnd: t.getColumnCount() - 1
-}), Ge = A({ GROUPBY: () => Xe });
-function Xe(t, n, e, r, o = 1, i, u, s = 0) {
-	if (t.getRowCount() !== n.getRowCount() || Oe(n)) return B.BuiltIn.Value;
-	const a = ve(e, n.getColumnCount());
+}), Ge = v({ GROUPBY: () => Ke });
+function Ke(t, n, e, r, o = 1, i, u, s = 0) {
+	if (t.getRowCount() !== n.getRowCount() || Pe(n)) return B.BuiltIn.Value;
+	const a = Ae(e, n.getColumnCount());
 	if (B.isError(a)) return a;
-	const l = Fe(r, n);
+	const l = De(r, n);
 	if (B.isError(l)) return l;
 	const f = t.getColumnCount(), c = o;
-	if (!Te(c, f)) return B.BuiltIn.Value;
+	if (!Ve(c, f)) return B.BuiltIn.Value;
 	if (0 !== s && 1 !== s) return B.BuiltIn.Value;
 	const h = 1 === s;
 	if ((h || a.vertical) && Math.abs(c) > 1) return B.BuiltIn.Value;
-	if (u && !$e(u, t.getRowCount())) return B.BuiltIn.Value;
-	const { measures: m, vertical: N } = a, g = n.getColumnCount(), p = Pe(i, f, N ? g : m.length);
-	if (B.isError(p)) return p;
-	let d = t, y = n, M = u, I = null, w = null;
+	if (u && !Oe(u, t.getRowCount())) return B.BuiltIn.Value;
+	const { measures: m, vertical: N } = a, g = n.getColumnCount(), d = Te(i, f, N ? g : m.length);
+	if (B.isError(d)) return d;
+	let y = t, M = n, p = u, I = null, w = null;
 	if (l.hasHeader) {
-		if (d.getRowCount() < 2) return B.BuiltIn.Value;
-		I = He(d), w = He(y), d = ze(d), y = ze(y), M && (M = ze(M));
+		if (y.getRowCount() < 2) return B.BuiltIn.Value;
+		I = Xe(y), w = Xe(M), y = _e(y), M = _e(M), p && (p = _e(p));
 	}
-	const x = new ke(d, M);
+	const x = b.createPivot(y, null, p ? { filter: p } : void 0);
 	if (0 === x.getRecordCount()) return B.BuiltIn.Value;
-	const C = Ye(y), R = new Array(C.length), E = /* @__PURE__ */ new Map(), A = (t) => {
-		let n = E.get(t);
-		return n || (n = m.map((n) => (N ? C.map((t, n) => n) : [n.column]).map((e) => De(n, x.getMembers(C[e], t), ((t) => () => R[t] ??= x.getMembers(C[t], null))(e)))), E.set(t, n), n);
-	}, v = p.byValue, D = x.sort(p, (t) => N ? A(t)[0][v.measure] : A(t)[v.measure][0], h), F = h ? Ke(D, c) : x.lines(D, c), S = [];
+	const R = new $e(x.getRows(), f), C = ze(M), E = new Array(C.length), v = /* @__PURE__ */ new Map(), A = (t) => {
+		let n = v.get(t);
+		return n || (n = m.map((n) => (N ? C.map((t, n) => n) : [n.column]).map((e) => Le(x, n, C[e], t, void 0, ((t) => () => E[t] ??= x.getMembers(C[t]))(e)))), v.set(t, n), n);
+	}, D = d.byValue, F = (t) => N ? A(t)[0][D.measure] : A(t)[D.measure][0], S = h ? We(R.sortLeaves(d, F), R.root, c) : R.lines(R.sortTree(d, F), c), V = [];
 	if (N) {
-		l.show && S.push([
-			...We(I, f),
+		l.show && V.push([
+			...He(I, f),
 			"",
-			...C.map((t, n) => w ? w[n] : Ue(n))
+			...C.map((t, n) => w ? w[n] : Ye(n))
 		]);
-		for (const t of F) {
-			const n = x.keyCells(t, c), e = A(t.node);
-			for (let t = 0; t < m.length; t++) S.push([
+		for (const t of S) {
+			const n = R.keyCells(t, c), e = A(t.node);
+			for (let t = 0; t < m.length; t++) V.push([
 				...n,
 				m[t].label,
 				...e[t]
 			]);
 		}
 	} else {
-		a.named && S.push([...new Array(f).fill(""), ...m.map((t) => t.label)]), l.show && S.push([...We(I, f), ...m.map((t) => w ? w[t.column] : Ue(t.column))]);
-		for (const t of F) {
-			const n = x.keyCells(t, c);
+		a.named && V.push([...new Array(f).fill(""), ...m.map((t) => t.label)]), l.show && V.push([...He(I, f), ...m.map((t) => w ? w[t.column] : Ye(t.column))]);
+		for (const t of S) {
+			const n = R.keyCells(t, c);
 			for (const e of A(t.node)) n.push(e[0]);
-			S.push(n);
+			V.push(n);
 		}
 	}
-	return b.createRange(S.length, S[0].length, S);
+	return b.createRange(V.length, V[0].length, V);
 }
-var He = (t) => {
+var Xe = (t) => {
 	const n = t.getColumnCount(), e = new Array(n);
 	for (let r = 0; r < n; r++) e[r] = t.getValueAt(0, r);
 	return e;
-}, We = (t, n) => {
+}, He = (t, n) => {
 	const e = new Array(n);
-	for (let r = 0; r < n; r++) e[r] = t ? t[r] : _e(r);
+	for (let r = 0; r < n; r++) e[r] = t ? t[r] : je(r);
 	return e;
-}, Ke = (t, n) => {
-	const e = t.map((t) => ({
+}, We = (t, n, e) => {
+	const r = t.map((t) => ({
 		kind: "group",
 		node: t
 	}));
-	return n > 0 ? e.push({
+	return e > 0 ? r.push({
 		kind: "total",
-		node: null
-	}) : n < 0 && e.unshift({
+		node: n
+	}) : e < 0 && r.unshift({
 		kind: "total",
-		node: null
-	}), e;
-}, Ze = A({ PIVOTBY: () => Qe });
+		node: n
+	}), r;
+}, Ze = v({ PIVOTBY: () => Qe });
 function Qe(t, n, e, r, o, i = 1, u, s = 1, a, l, f = 0) {
 	const c = e.getRowCount();
-	if (!t && !n || Oe(e)) return B.BuiltIn.Value;
+	if (!t && !n || Pe(e)) return B.BuiltIn.Value;
 	if (t && t.getRowCount() !== c) return B.BuiltIn.Value;
 	if (n && n.getRowCount() !== c) return B.BuiltIn.Value;
-	const h = ve(r, e.getColumnCount());
+	const h = Ae(r, e.getColumnCount());
 	if (B.isError(h)) return h;
-	const m = Fe(o, e);
+	const m = De(o, e);
 	if (B.isError(m)) return m;
-	const N = t ? t.getColumnCount() : 0, g = n ? n.getColumnCount() : 0, p = t ? i : 0, d = n ? s : 0;
-	if (t && !Te(p, N)) return B.BuiltIn.Value;
-	if (n && !Te(d, g)) return B.BuiltIn.Value;
-	if (h.vertical && Math.abs(p) > 1) return B.BuiltIn.Value;
+	const N = t ? t.getColumnCount() : 0, g = n ? n.getColumnCount() : 0, d = t ? i : 0, y = n ? s : 0;
+	if (t && !Ve(d, N)) return B.BuiltIn.Value;
+	if (n && !Ve(y, g)) return B.BuiltIn.Value;
+	if (h.vertical && Math.abs(d) > 1) return B.BuiltIn.Value;
 	if (!Number.isInteger(f) || f < 0 || f > 4) return B.BuiltIn.Value;
-	if (l && !$e(l, c)) return B.BuiltIn.Value;
-	const { measures: y, vertical: M } = h, I = e.getColumnCount(), w = M ? I : y.length, x = Pe(u, N, w);
+	if (l && !Oe(l, c)) return B.BuiltIn.Value;
+	const { measures: M, vertical: p } = h, I = e.getColumnCount(), w = p ? I : M.length, x = Te(u, N, w);
 	if (B.isError(x)) return x;
-	const C = Pe(a, g, w);
-	if (B.isError(C)) return C;
-	let R = t, E = n, A = e, v = l, D = null, F = null, S = null;
+	const R = Te(a, g, w);
+	if (B.isError(R)) return R;
+	let C = t, E = n, v = e, A = l, D = null, F = null, S = null;
 	if (m.hasHeader) {
 		if (c < 2) return B.BuiltIn.Value;
-		R && (D = Je(R), R = ze(R)), E && (F = Je(E), E = ze(E)), S = Je(A), A = ze(A), v && (v = ze(v));
+		C && (D = Je(C), C = _e(C)), E && (F = Je(E), E = _e(E)), S = Je(v), v = _e(v), A && (A = _e(A));
 	}
-	const V = R ? new ke(R, v) : null, T = E ? new ke(E, v) : null;
-	if (0 === (V ?? T).getRecordCount()) return B.BuiltIn.Value;
-	const O = new tr(V, T, Ye(A), v), $ = (t, n, e, r) => {
-		const o = O.members(t, n, r);
-		return o ? De(e, o, () => {
+	const V = b.createPivot(C ?? null, E ?? null, A ? { filter: A } : void 0);
+	if (0 === V.getRecordCount()) return B.BuiltIn.Value;
+	const T = C ? new $e(V.getRows(), N) : null, P = E ? new $e(V.getColumns(), g) : null, O = ze(v), L = (t, n, e, r) => {
+		const o = O[r];
+		return Le(V, e, o, t, n, () => {
 			switch (f) {
-				case 0: return O.members(null, n, r);
-				case 1: return O.members(t, null, r);
-				case 3: return O.members(t, n?.parent ?? null, r);
-				case 4: return O.members(t?.parent ?? null, n, r);
-				default: return O.members(null, null, r);
+				case 0: return V.getMembers(o, void 0, n);
+				case 1: return V.getMembers(o, t);
+				case 3: return V.getMembers(o, t, n?.getParent() ?? void 0);
+				case 4: return V.getMembers(o, t?.getParent() ?? void 0, n);
+				default: return V.getMembers(o);
 			}
-		}) : "";
-	}, k = (t) => (n, e) => M ? $(n, e, y[0], t.measure) : $(n, e, y[t.measure], y[t.measure].column), L = [{
+		});
+	}, $ = (t) => (n, e) => p ? L(n, e, M[0], t.measure) : L(n, e, M[t.measure], M[t.measure].column), k = T ? T.lines(T.sortTree(x, (t) => $(x.byValue)(t, void 0)), d) : [{
 		kind: "total",
-		node: null
-	}], q = V ? V.lines(V.sort(x, (t) => k(x.byValue)(t, null), !1), p) : L, _ = T ? T.lines(T.sort(C, (t) => k(C.byValue)(null, t), !1), d) : L, j = [];
-	for (const t of _) if (M) for (let n = 0; n < I; n++) j.push({
+		node: V.getRows().getRoot()
+	}], q = P ? P.lines(P.sortTree(R, (t) => $(R.byValue)(void 0, t)), y) : [{
+		kind: "total",
+		node: V.getColumns().getRoot()
+	}], j = [];
+	for (const t of q) if (p) for (let n = 0; n < I; n++) j.push({
 		line: t,
 		measure: -1,
 		column: n
 	});
-	else for (let n = 0; n < y.length; n++) j.push({
+	else for (let n = 0; n < M.length; n++) j.push({
 		line: t,
 		measure: n,
-		column: y[n].column
+		column: M[n].column
 	});
-	const U = !!T && !h.named && I > 1, Y = N + (M ? 1 : 0), z = () => new Array(Y).fill(""), G = [];
-	if (m.show && T) {
+	const U = !!P && !h.named && I > 1, Y = N + (p ? 1 : 0), z = () => new Array(Y).fill(""), _ = [];
+	if (m.show && P) {
 		const t = [];
-		for (let n = 0; n < g; n++) t.push(F ? String(F[n] ?? "") : je(n));
-		G.push([
+		for (let n = 0; n < g; n++) t.push(F ? String(F[n] ?? "") : Ue(n));
+		_.push([
 			...z(),
 			t.join(", "),
 			...new Array(j.length - 1).fill("")
 		]);
 	}
-	if (T) {
-		const t = j.map((t) => T.keyCells(t.line, d));
-		for (let n = 0; n < g; n++) G.push([...z(), ...t.map((t) => t[n])]);
+	if (P) {
+		const t = j.map((t) => P.keyCells(t.line, y));
+		for (let n = 0; n < g; n++) _.push([...z(), ...t.map((t) => t[n])]);
 	}
-	if (h.named && !M && G.push([...z(), ...j.map((t) => y[t.measure].label)]), m.show) {
+	if (h.named && !p && _.push([...z(), ...j.map((t) => M[t.measure].label)]), m.show) {
 		const t = [];
-		for (let n = 0; n < N; n++) t.push(D ? D[n] : _e(n));
-		M && t.push(""), G.push([...t, ...j.map((t) => S ? S[t.column] : Ue(t.column))]);
+		for (let n = 0; n < N; n++) t.push(D ? D[n] : je(n));
+		p && t.push(""), _.push([...t, ...j.map((t) => S ? S[t.column] : Ye(t.column))]);
 	}
-	const X = (t, n) => j.map((e) => U && "group" !== e.line.kind ? "" : $(t, e.line.node, n ?? y[e.measure], e.column));
-	for (const t of q) {
-		const n = V ? V.keyCells(t, p) : [];
-		if (M) for (const e of y) G.push([
+	const G = (t, n) => j.map((e) => U && "group" !== e.line.kind ? "" : L(t, e.line.node, n ?? M[e.measure], e.column));
+	for (const t of k) {
+		const n = T ? T.keyCells(t, d) : [];
+		if (p) for (const e of M) _.push([
 			...n,
 			e.label,
-			...X(t.node, e)
+			...G(t.node, e)
 		]);
-		else G.push([...n, ...X(t.node, null)]);
+		else _.push([...n, ...G(t.node, null)]);
 	}
-	return b.createRange(G.length, G[0].length, G);
+	return b.createRange(_.length, _[0].length, _);
 }
 var Je = (t) => {
 	const n = t.getColumnCount(), e = new Array(n);
 	for (let r = 0; r < n; r++) e[r] = t.getValueAt(0, r);
 	return e;
-}, tr = class {
-	constructor(t, n, e, r) {
-		this._rows = t, this._cols = n, this._columns = e, this._filter = r, this._crossed = /* @__PURE__ */ new Map();
-	}
-	members(t, n, e) {
-		const r = this._columns[e];
-		if (!t && !n) return (this._rows ?? this._cols).getMembers(r, null);
-		if (!t) return this._cols.getMembers(r, n);
-		if (!n) return this._rows.getMembers(r, t);
-		const o = this._cross(t.level, n.level), i = o.groupOf.get(t.group * this._cols.groupings[n.level].getGroupCount() + n.group);
-		return void 0 === i ? null : o.grouping.getMembers(r, [i]);
-	}
-	_cross(t, n) {
-		const e = `${t},${n}`;
-		let r = this._crossed.get(e);
-		if (r) return r;
-		const o = this._rows, i = this._cols, u = o.prefixes[t].concat(i.prefixes[n], x.Axis.Column), s = b.createGrouping(u, this._filter ? { filter: this._filter } : void 0), a = o.groupings[t], l = i.groupings[n], f = l.getGroupCount(), c = /* @__PURE__ */ new Map();
-		for (let t = 0; t < s.getGroupCount(); t++) {
-			const n = s.getFirstRecord(t);
-			c.set(a.getGroup(n) * f + l.getGroup(n), t);
-		}
-		return r = {
-			grouping: s,
-			groupOf: c
-		}, this._crossed.set(e, r), r;
-	}
-}, nr = A({
-	FORECAST_ETS: () => er,
-	FORECAST_ETS_CONFINT: () => rr,
-	FORECAST_ETS_SEASONALITY: () => or,
-	FORECAST_ETS_STAT: () => ir
+}, tr = v({
+	FORECAST_ETS: () => nr,
+	FORECAST_ETS_CONFINT: () => er,
+	FORECAST_ETS_SEASONALITY: () => rr,
+	FORECAST_ETS_STAT: () => or
 });
-function er(t, n, e, r = 1, o = 1, i = 1) {
-	const u = lr(n, e, o, i);
+function nr(t, n, e, r = 1, o = 1, i = 1) {
+	const u = ar(n, e, o, i);
 	if (B.isError(u)) return u;
 	const { values: s, stepSize: a, lastTime: l, firstTime: f } = u;
 	if ((t - f) / a <= -.999) return B.BuiltIn.Num;
 	const c = (t - l) / a;
 	if (c > 2147483647) return B.BuiltIn.Num;
-	const h = hr(s, r);
+	const h = cr(s, r);
 	if (B.isError(h)) return h;
-	const { alpha: m, beta: N, gamma: g, period: p, b0: d } = h, { L: y, T: M, S: I, finalIndex: w } = cr(s, m, N, g, p, d).finalState;
-	let b = y + c * M;
-	return p > 1 && (b += I[((w + Math.round(c)) % p + p) % p]), b;
+	const { alpha: m, beta: N, gamma: g, period: d, b0: y } = h, { L: M, T: p, S: I, finalIndex: w } = fr(s, m, N, g, d, y).finalState;
+	let b = M + c * p;
+	return d > 1 && (b += I[((w + Math.round(c)) % d + d) % d]), b;
 }
-function rr(t, n, e, r = .95, o = 1, i = 1, u = 1) {
+function er(t, n, e, r = .95, o = 1, i = 1, u = 1) {
 	if (r < 0 || r >= 1) return B.BuiltIn.Num;
-	const s = lr(n, e, i, u);
+	const s = ar(n, e, i, u);
 	if (B.isError(s)) return s;
 	const { values: a, stepSize: l, lastTime: f } = s;
 	if (t <= f) return B.BuiltIn.Num;
 	const c = Math.round((t - f) / l);
 	if (c > 2147483647) return B.BuiltIn.Num;
-	const h = hr(a, o);
+	const h = cr(a, o);
 	if (B.isError(h)) return h;
-	const { alpha: m, beta: N, gamma: g, period: p, b0: d } = h, y = function(t, n, e, r, o, i) {
+	const { alpha: m, beta: N, gamma: g, period: d, b0: y } = h, M = function(t, n, e, r, o, i) {
 		const u = t.length;
 		let s, a;
 		const l = new Array(Math.max(1, o)).fill(0);
@@ -1916,7 +1875,7 @@ function rr(t, n, e, r = .95, o = 1, i = 1, u = 1) {
 			o > 1 && (l[u] = r * (t[i] - N) + (1 - r) * c), s = N, a = g;
 		}
 		return Math.sqrt(f / u);
-	}(a, m, N, g, p, d), M = function(t, n, e, r) {
+	}(a, m, N, g, d, y), p = function(t, n, e, r) {
 		const o = Math.abs(r);
 		if (0 === o) return 0;
 		let i = 0, u = 1;
@@ -1925,28 +1884,28 @@ function rr(t, n, e, r = .95, o = 1, i = 1, u = 1) {
 			u = u + t + (e > 1 && r % e === 0 ? n : 0);
 		}
 		return i;
-	}(m, g, p, c);
+	}(m, g, d, c);
 	return function(t) {
 		const n = (1 + t) / 2, e = b.getFunction("NORM.S.INV");
 		if (e) return e.execute(n);
 		const r = Math.sqrt(-2 * Math.log(1 - n));
 		return r - (2.515517 + .802853 * r + .010328 * r * r) / (1 + 1.432788 * r + .189269 * r * r + .001308 * r * r * r);
-	}(r) * y * Math.sqrt(M);
+	}(r) * M * Math.sqrt(p);
 }
-function or(t, n, e = 1, r = 1) {
-	const o = lr(t, n, e, r);
+function rr(t, n, e = 1, r = 1) {
+	const o = ar(t, n, e, r);
 	if (B.isError(o)) return o;
 	const { values: i } = o;
-	return i.length < 4 ? 0 : fr(i);
+	return i.length < 4 ? 0 : lr(i);
 }
-function ir(t, n, e, r = 1, o = 1, i = 1) {
-	const u = sr(e);
+function or(t, n, e, r = 1, o = 1, i = 1) {
+	const u = ur(e);
 	if (null === u || u < 1 || u > 8) return B.BuiltIn.Num;
-	const s = lr(t, n, o, i);
+	const s = ar(t, n, o, i);
 	if (B.isError(s)) return s;
 	const { values: a, stepSize: l } = s;
 	if (8 === u) return l;
-	const f = hr(a, r);
+	const f = cr(a, r);
 	if (B.isError(f)) return f;
 	const { alpha: c, beta: h, gamma: m, period: N, b0: g } = f;
 	switch (u) {
@@ -1970,10 +1929,10 @@ function ir(t, n, e, r = 1, o = 1, i = 1) {
 				for (let n = 1; n < u; n++) m += Math.abs(t[n] - t[n - 1]);
 				const N = m / (u - 1);
 				for (let i = 0; i < u; i++) {
-					const u = t[i], m = o > 1 ? i % o : 0, N = o > 1 ? l[m] : 0, g = s + a + N, p = u - g;
-					f += Math.abs(p), c += p * p, h += Math.abs(p) / ((Math.abs(u) + Math.abs(g)) / 2 || 1);
-					const d = n * (u - N) + (1 - n) * (s + a), y = e * (d - s) + (1 - e) * a;
-					o > 1 && (l[m] = r * (u - d) + (1 - r) * N), s = d, a = y;
+					const u = t[i], m = o > 1 ? i % o : 0, N = o > 1 ? l[m] : 0, g = s + a + N, d = u - g;
+					f += Math.abs(d), c += d * d, h += Math.abs(d) / ((Math.abs(u) + Math.abs(g)) / 2 || 1);
+					const y = n * (u - N) + (1 - n) * (s + a), M = e * (y - s) + (1 - e) * a;
+					o > 1 && (l[m] = r * (u - y) + (1 - r) * N), s = y, a = M;
 				}
 				return {
 					mae: f / u,
@@ -1990,7 +1949,7 @@ function ir(t, n, e, r = 1, o = 1, i = 1) {
 	}
 	return B.BuiltIn.Num;
 }
-function ur(t, n) {
+function ir(t, n) {
 	const e = t.map((t) => t.value);
 	switch (n) {
 		case 1: return e.reduce((t, n) => t + n, 0) / e.length;
@@ -2006,14 +1965,14 @@ function ur(t, n) {
 		default: return e.reduce((t, n) => t + n, 0);
 	}
 }
-function sr(t) {
+function ur(t) {
 	return Number.isInteger(t) ? t : null;
 }
-var ar = 8784;
-function lr(t, n, e, r) {
-	const o = sr(e);
+var sr = 8784;
+function ar(t, n, e, r) {
+	const o = ur(e);
 	if (0 !== o && 1 !== o) return B.BuiltIn.Num;
-	const i = sr(r);
+	const i = ur(r);
 	if (null === i || i < 1 || i > 7) return B.BuiltIn.Num;
 	const u = t.flatten(), s = n.flatten();
 	if (u.getRowCount() !== s.getRowCount()) return B.BuiltIn.NA;
@@ -2032,12 +1991,12 @@ function lr(t, n, e, r) {
 		const n = a[t];
 		n.time === a[t - 1].time ? f.push(n) : (l.push({
 			time: f[0].time,
-			value: ur(f, i)
+			value: ir(f, i)
 		}), f = [n]);
 	}
 	if (l.push({
 		time: f[0].time,
-		value: ur(f, i)
+		value: ir(f, i)
 	}), l.length < 2) return B.BuiltIn.Div0;
 	const c = [];
 	for (let t = 1; t < l.length; t++) c.push(l[t].time - l[t - 1].time);
@@ -2064,7 +2023,7 @@ function lr(t, n, e, r) {
 		firstTime: l[0].time
 	};
 }
-function fr(t) {
+function lr(t) {
 	const n = t.length;
 	if (n < 4) return 0;
 	const e = t.reduce((t, n) => t + n, 0) / n;
@@ -2081,7 +2040,7 @@ function fr(t) {
 	}
 	return i;
 }
-function cr(t, n, e, r, o, i) {
+function fr(t, n, e, r, o, i) {
 	const u = t.length;
 	let s, a;
 	if (o > 1 && u >= 2 * o) {
@@ -2103,8 +2062,8 @@ function cr(t, n, e, r, o, i) {
 	for (let i = 0; i < u; i++) {
 		const u = t[i], h = o > 1 ? i % o : 0, m = o > 1 ? l[h] : 0, N = u - (s + a + m);
 		f += N * N;
-		const g = n * (u - m) + (1 - n) * (s + a), p = e * (g - s) + (1 - e) * a;
-		o > 1 && (l[h] = r * (u - g) + (1 - r) * m), s = g, a = p, c = h;
+		const g = n * (u - m) + (1 - n) * (s + a), d = e * (g - s) + (1 - e) * a;
+		o > 1 && (l[h] = r * (u - g) + (1 - r) * m), s = g, a = d, c = h;
 	}
 	return {
 		mse: f / u,
@@ -2116,16 +2075,16 @@ function cr(t, n, e, r, o, i) {
 		}
 	};
 }
-function hr(t, n) {
-	const e = sr(n);
-	if (null === e || e < 0 || e > ar) return B.BuiltIn.Num;
+function cr(t, n) {
+	const e = ur(n);
+	if (null === e || e < 0 || e > sr) return B.BuiltIn.Num;
 	let r = 1;
-	1 === e ? (r = fr(t), r <= 1 && (r = 1)) : e > 1 && (r = e), r > 1 && t.length < 2 * r && (r = 1);
+	1 === e ? (r = lr(t), r <= 1 && (r = 1)) : e > 1 && (r = e), r > 1 && t.length < 2 * r && (r = 1);
 	const o = t.length;
 	if (1 === r) {
-		const n = Math.max(1, Math.floor(o / 4)), e = Nr((n) => {
+		const n = Math.max(1, Math.floor(o / 4)), e = mr((n) => {
 			const e = Math.max(.001, Math.min(.999, n[0])), r = Math.max(.001, Math.min(.999, n[1])), o = n[2];
-			return cr(t, e, r, 0, 1, o).mse;
+			return fr(t, e, r, 0, 1, o).mse;
 		}, [
 			.9,
 			.1,
@@ -2139,7 +2098,7 @@ function hr(t, n) {
 			b0: e[2]
 		};
 	}
-	const i = Nr((n) => cr(t, Math.max(.001, Math.min(.999, n[0])), Math.max(.001, Math.min(.999, n[1])), Math.max(.001, Math.min(.999, n[2])), r).mse, [
+	const i = mr((n) => fr(t, Math.max(.001, Math.min(.999, n[0])), Math.max(.001, Math.min(.999, n[1])), Math.max(.001, Math.min(.999, n[2])), r).mse, [
 		.9,
 		.1,
 		.1
@@ -2152,10 +2111,10 @@ function hr(t, n) {
 		b0: 0
 	};
 }
-function mr(t, n, e, r, o) {
+function hr(t, n, e, r, o) {
 	for (let i = 0; i < t.length; ++i) t[i] = n * e[i] + r * o[i];
 }
-function Nr(t, n, e) {
+function mr(t, n, e) {
 	const r = (e = e || {}).maxIterations || 200 * n.length, o = e.nonZeroDelta || 1.05, i = e.zeroDelta || .001, u = e.minErrorDelta || 1e-6, s = e.minTolerance || 1e-5, a = void 0 !== e.rho ? e.rho : 1, l = void 0 !== e.chi ? e.chi : 2, f = void 0 !== e.psi ? e.psi : -.5, c = void 0 !== e.sigma ? e.sigma : .5;
 	let h;
 	const m = n.length, N = new Array(m + 1);
@@ -2168,9 +2127,9 @@ function Nr(t, n, e) {
 		for (let n = 0; n < t.length; n++) N[m][n] = t[n];
 		N[m].fx = t.fx;
 	}
-	const p = (t, n) => t.fx - n.fx, d = n.slice(), y = n.slice(), M = n.slice(), I = n.slice();
+	const d = (t, n) => t.fx - n.fx, y = n.slice(), M = n.slice(), p = n.slice(), I = n.slice();
 	for (let n = 0; n < r; ++n) {
-		if (N.sort(p), e.history) {
+		if (N.sort(d), e.history) {
 			const t = N.map((t) => {
 				const n = t.slice();
 				return n.fx = t.fx, n.id = t.id, n;
@@ -2185,34 +2144,34 @@ function Nr(t, n, e) {
 		for (let t = 0; t < m; ++t) h = Math.max(h, Math.abs(N[0][t] - N[1][t]));
 		if (Math.abs(N[0].fx - N[m].fx) < u && h < s) break;
 		for (let t = 0; t < m; ++t) {
-			d[t] = 0;
-			for (let n = 0; n < m; ++n) d[t] += N[n][t];
-			d[t] /= m;
+			y[t] = 0;
+			for (let n = 0; n < m; ++n) y[t] += N[n][t];
+			y[t] /= m;
 		}
 		const n = N[m];
-		if (mr(y, 1 + a, d, -a, n), y.fx = t(y), y.fx < N[0].fx) mr(I, 1 + l, d, -l, n), I.fx = t(I), g(I.fx < y.fx ? I : y);
-		else if (y.fx >= N[m - 1].fx) {
+		if (hr(M, 1 + a, y, -a, n), M.fx = t(M), M.fx < N[0].fx) hr(I, 1 + l, y, -l, n), I.fx = t(I), g(I.fx < M.fx ? I : M);
+		else if (M.fx >= N[m - 1].fx) {
 			let e = !1;
-			if (y.fx > n.fx ? (mr(M, 1 + f, d, -f, n), M.fx = t(M), M.fx < n.fx ? g(M) : e = !0) : (mr(M, 1 - f * a, d, f * a, n), M.fx = t(M), M.fx < y.fx ? g(M) : e = !0), e) {
+			if (M.fx > n.fx ? (hr(p, 1 + f, y, -f, n), p.fx = t(p), p.fx < n.fx ? g(p) : e = !0) : (hr(p, 1 - f * a, y, f * a, n), p.fx = t(p), p.fx < M.fx ? g(p) : e = !0), e) {
 				if (c >= 1) break;
-				for (let n = 1; n < N.length; ++n) mr(N[n], 1 - c, N[0], c, N[n]), N[n].fx = t(N[n]);
+				for (let n = 1; n < N.length; ++n) hr(N[n], 1 - c, N[0], c, N[n]), N[n].fx = t(N[n]);
 			}
-		} else g(y);
+		} else g(M);
 	}
-	return N.sort(p), {
+	return N.sort(d), {
 		fx: N[0].fx,
 		x: N[0]
 	};
 }
-var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis.Column }), Object.freeze({ axis: x.Axis.Row }), Object.freeze({
-	type: C.Number,
+var Nr = Object.freeze({ includeEmpty: !0 }), gr = (Object.freeze({ axis: x.Axis.Column }), Object.freeze({ axis: x.Axis.Row }), Object.freeze({
+	type: R.Number,
 	axis: x.Axis.Row
 })), dr = (t, n, e = !1) => {
 	const r = t.getRowCount(), o = t.getColumnCount(), i = r * o;
 	if (0 === i) throw B.BuiltIn.Value;
 	const u = 1 === r, s = r > 1 && o > 1;
 	if (!n || 0 === n.size) {
-		const n = Br(t, i, e), a = new Array(i);
+		const n = br(t, i, e), a = new Array(i);
 		for (let t = 0; t < i; t++) a[t] = [t + 1];
 		return {
 			ys: n,
@@ -2227,7 +2186,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 	const a = n.getRowCount(), l = n.getColumnCount();
 	if (s) {
 		if (a !== r || l !== o) throw B.BuiltIn.Ref;
-		const f = Br(t, i, e), c = Br(n, i), h = new Array(i);
+		const f = br(t, i, e), c = br(n, i), h = new Array(i);
 		for (let t = 0; t < i; t++) h[t] = [c[t]];
 		return {
 			ys: f,
@@ -2242,8 +2201,8 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 	if ((u ? l : a) !== i) throw B.BuiltIn.Ref;
 	const f = u ? a : l;
 	return {
-		ys: Br(t, i, e),
-		xs: xr(n, i, f, u),
+		ys: br(t, i, e),
+		xs: Br(n, i, f, u),
 		k: f,
 		isRowOriented: u,
 		isRectangularY: s,
@@ -2275,14 +2234,14 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 		throw B.BuiltIn.Value;
 	}
 	throw B.BuiltIn.Value;
-}, Ir = (t, n, e) => {
+}, pr = (t, n, e) => {
 	let r, o, i;
 	if (n && n.size > 0) {
 		const e = ((t, n) => {
 			const e = t.getRowCount(), r = t.getColumnCount(), o = e * r;
 			if (0 === o) throw B.BuiltIn.Ref;
 			if (1 === n.k) {
-				const n = Br(t, o), i = new Array(o);
+				const n = br(t, o), i = new Array(o);
 				for (let t = 0; t < o; t++) i[t] = [n[t]];
 				return {
 					xs: i,
@@ -2293,7 +2252,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 			const i = n.isRowOriented ? r : e;
 			if ((n.isRowOriented ? e : r) !== n.k) throw B.BuiltIn.Ref;
 			return {
-				xs: xr(t, i, n.k, n.isRowOriented),
+				xs: Br(t, i, n.k, n.isRowOriented),
 				rows: n.isRowOriented ? 1 : i,
 				cols: n.isRowOriented ? i : 1
 			};
@@ -2308,7 +2267,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 		u[t] = n;
 	}
 	return u;
-}, wr = (t, n, e) => {
+}, Ir = (t, n, e) => {
 	const r = t.length, o = n.length > 0 ? n[0].length : 0, i = [], u = [];
 	e && (i.push(new Array(r).fill(1)), u.push(o));
 	for (let t = o - 1; t >= 0; t--) {
@@ -2318,20 +2277,20 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 	}
 	const s = [], a = [], l = [];
 	for (let t = 0; t < i.length; t++) {
-		const n = i[t].slice(), e = Math.sqrt(Cr(n, n)), o = new Array(a.length).fill(0);
+		const n = i[t].slice(), e = Math.sqrt(xr(n, n)), o = new Array(a.length).fill(0);
 		for (let t = 0; t < 2; t++) for (let t = 0; t < a.length; t++) {
-			const e = Cr(a[t], n);
+			const e = xr(a[t], n);
 			for (let o = 0; o < r; o++) n[o] -= e * a[t][o];
 			o[t] += e;
 		}
-		const u = Math.sqrt(Cr(n, n));
+		const u = Math.sqrt(xr(n, n));
 		if (!(u <= 1e-10 * (e || 1))) {
 			for (let t = 0; t < r; t++) n[t] /= u;
 			o.push(u), a.push(n), l.push(o), s.push(t);
 		}
 	}
 	const f = s.length, c = new Array(f);
-	for (let n = 0; n < f; n++) c[n] = Cr(a[n], t);
+	for (let n = 0; n < f; n++) c[n] = xr(a[n], t);
 	const h = new Array(f).fill(0);
 	for (let t = f - 1; t >= 0; t--) {
 		let n = c[t];
@@ -2355,25 +2314,25 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 		for (let n = t; n < f; n++) e += m[t][n] * m[t][n];
 		g[n] = e;
 	}
-	const p = (t) => {
+	const d = (t) => {
 		let n = e ? N[o] : 0;
 		for (let e = 0; e < o; e++) n += N[o - 1 - e] * t[e];
 		return n;
 	};
-	let d = 0;
+	let y = 0;
 	for (let e = 0; e < r; e++) {
-		const r = t[e] - p(n[e] ?? []);
-		d += r * r;
+		const r = t[e] - d(n[e] ?? []);
+		y += r * r;
 	}
-	let y = 0;
+	let M = 0;
 	if (e) {
 		let n = 0;
 		for (let e = 0; e < r; e++) n += t[e];
 		n /= r;
-		for (let e = 0; e < r; e++) y += (t[e] - n) * (t[e] - n);
-	} else for (let n = 0; n < r; n++) y += t[n] * t[n];
-	e && 0 === y && (d = 0);
-	const M = y - d, I = e ? f - 1 : f, w = r - I - (e ? 1 : 0), b = w > 0 ? d / w : 0, B = w > 0 ? Math.sqrt(b) : 0, x = new Array(o + 1).fill(0);
+		for (let e = 0; e < r; e++) M += (t[e] - n) * (t[e] - n);
+	} else for (let n = 0; n < r; n++) M += t[n] * t[n];
+	e && 0 === M && (y = 0);
+	const p = M - y, I = e ? f - 1 : f, w = r - I - (e ? 1 : 0), b = w > 0 ? y / w : 0, B = w > 0 ? Math.sqrt(b) : 0, x = new Array(o + 1).fill(0);
 	for (let t = 0; t <= o; t++) x[t] = B * Math.sqrt(Math.max(g[t], 0));
 	return {
 		coefficients: N,
@@ -2381,13 +2340,13 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 		kEffective: I,
 		df: w,
 		sey: B,
-		r2: 0 === y ? 1 : M / y,
-		f: w > 0 && I > 0 && 0 !== b ? M / I / b : null,
-		ssReg: M,
-		ssResid: d,
-		predict: p
+		r2: 0 === M ? 1 : p / M,
+		f: w > 0 && I > 0 && 0 !== b ? p / I / b : null,
+		ssReg: p,
+		ssResid: y,
+		predict: d
 	};
-}, br = (t, n, e) => {
+}, wr = (t, n, e) => {
 	const r = n.length, o = B.BuiltIn.NA, i = (t, n) => {
 		const e = new Array(r).fill(o);
 		return e[0] = t, r > 1 && (e[1] = n), e;
@@ -2399,10 +2358,10 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 		i(t.f ?? B.BuiltIn.Num, t.df),
 		i(t.ssReg, t.ssResid)
 	];
-}, Br = (t, n, e = !1) => {
+}, br = (t, n, e = !1) => {
 	const r = new Array(n);
 	let o = 0;
-	for (const n of t.values(gr)) {
+	for (const n of t.values(Nr)) {
 		if ("number" != typeof n) throw B.BuiltIn.Value;
 		if (e) {
 			if (n <= 0) throw B.BuiltIn.Num;
@@ -2410,77 +2369,77 @@ var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis
 		} else r[o++] = n;
 	}
 	return r;
-}, xr = (t, n, e, r) => {
-	const o = Br(t, n * e), i = new Array(n);
+}, Br = (t, n, e, r) => {
+	const o = br(t, n * e), i = new Array(n);
 	for (let t = 0; t < n; t++) {
 		const u = new Array(e);
 		for (let i = 0; i < e; i++) u[i] = r ? o[i * n + t] : o[t * e + i];
 		i[t] = u;
 	}
 	return i;
-}, Cr = (t, n) => {
+}, xr = (t, n) => {
 	let e = 0;
 	for (let r = 0; r < t.length; r++) e += t[r] * n[r];
 	return e;
-}, Rr = A({
-	GROWTH: () => Fr,
-	LINEST: () => Ar,
+}, Rr = v({
+	GROWTH: () => Dr,
+	LINEST: () => Er,
 	LOGEST: () => vr,
-	TREND: () => Dr
-}), Er = () => {
+	TREND: () => Ar
+}), Cr = () => {
 	if (b.getArgs().getAreaCountAt(1) > 1) throw B.BuiltIn.Ref;
 };
-function Ar(t, n, e, r) {
-	Er();
+function Er(t, n, e, r) {
+	Cr();
 	const o = dr(t, n);
 	return yr(e, !0, (t) => {
-		const n = wr(o.ys, o.xs, t);
-		return yr(r, !1, (e) => e ? br(n, n.coefficients, t) : [n.coefficients.slice()]);
+		const n = Ir(o.ys, o.xs, t);
+		return yr(r, !1, (e) => e ? wr(n, n.coefficients, t) : [n.coefficients.slice()]);
 	});
 }
 function vr(t, n, e, r) {
-	Er();
+	Cr();
 	const o = dr(t, n, !0);
 	return yr(e, !0, (t) => {
-		const n = wr(o.ys, o.xs, t), e = Sr(n);
-		return yr(r, !1, (r) => r ? br(n, e, t) : [e]);
+		const n = Ir(o.ys, o.xs, t), e = Fr(n);
+		return yr(r, !1, (r) => r ? wr(n, e, t) : [e]);
 	});
 }
-function Dr(t, n, e, r) {
-	Er();
+function Ar(t, n, e, r) {
+	Cr();
 	const o = dr(t, n);
 	return yr(r, !0, (t) => {
-		const n = wr(o.ys, o.xs, t);
-		return Ir(o, e, n.predict);
+		const n = Ir(o.ys, o.xs, t);
+		return pr(o, e, n.predict);
 	});
 }
-function Fr(t, n, e, r) {
-	Er();
+function Dr(t, n, e, r) {
+	Cr();
 	const o = dr(t, n, !0);
 	return yr(r, !0, (t) => {
-		const n = wr(o.ys, o.xs, t).coefficients.map(Math.exp), r = o.k;
-		return Ir(o, e, (t) => {
+		const n = Ir(o.ys, o.xs, t).coefficients.map(Math.exp), r = o.k;
+		return pr(o, e, (t) => {
 			let e = n[r];
 			for (let o = 0; o < r; o++) e *= n[r - 1 - o] ** t[o];
 			return Number.isFinite(e) ? e : B.BuiltIn.Num;
 		});
 	});
 }
-var Sr = (t) => t.coefficients.map((t) => {
+var Fr = (t) => t.coefficients.map((t) => {
 	const n = Math.exp(t);
 	return Number.isFinite(n) ? n : B.BuiltIn.Num;
-}), Vr = A({
-	TTEST: () => Pr,
-	T_TEST: () => Or
-}), Tr = (t) => {
+}), Sr = v({
+	TTEST: () => Tr,
+	T_TEST: () => Pr
+}), Vr = (t) => {
 	const n = t.getCode();
 	return n === B.Code.Null || n === B.Code.GettingData ? B.BuiltIn.Num : t;
 };
-function Pr(t, n, e, r) {
-	return Or(t, n, e, r);
+function Tr(t, n, e, r) {
+	return Pr(t, n, e, r);
 }
-function Or(t, n, e, r) {
-	if (e = Math.floor(e + $r), r = Math.floor(r + $r), 1 !== e && 2 !== e || r < 1 || r > 3) return NaN;
+function Pr(t, n, e, r) {
+	if (e = Math.floor(e + Or), r = Math.floor(r + Or), 1 !== e && 2 !== e || r < 1 || r > 3) return NaN;
 	for (const e of [t, n]) if (1 === e.size && e.isIReferenceRange) {
 		if (e.hasError()) throw e.firstError();
 		if (e.entries({ includeEmpty: !1 }).next().done) throw B.BuiltIn.Value;
@@ -2491,14 +2450,14 @@ function Or(t, n, e, r) {
 		if (e.rows * e.columns !== r.rows * r.columns) throw B.BuiltIn.NA;
 		const i = [], u = [];
 		for (const [[e, r]] of t.flatten().alignValues([n.flatten()])) {
-			if (B.isError(e)) throw Tr(e);
-			if (B.isError(r)) throw Tr(r);
+			if (B.isError(e)) throw Vr(e);
+			if (B.isError(r)) throw Vr(r);
 			"number" == typeof e && "number" == typeof r && (i.push(e), u.push(r));
 		}
 		if (i.length < 2) throw B.BuiltIn.Div0;
 		o = function(t, n) {
 			const e = t.length;
-			if (!Number.isFinite(qr(t)) || !Number.isFinite(qr(n))) return { error: B.BuiltIn.Num };
+			if (!Number.isFinite(kr(t)) || !Number.isFinite(kr(n))) return { error: B.BuiltIn.Num };
 			let r = 0;
 			for (let o = 0; o < e; o++) r += t[o] - n[o];
 			const o = r / e;
@@ -2513,9 +2472,9 @@ function Or(t, n, e, r) {
 			};
 		}(i, u);
 	} else {
-		if (t.hasError()) throw Tr(t.firstError());
-		if (n.hasError()) throw Tr(n.firstError());
-		const e = t.getValuesFlat(pr), i = n.getValuesFlat(pr);
+		if (t.hasError()) throw Vr(t.firstError());
+		if (n.hasError()) throw Vr(n.firstError());
+		const e = t.getValuesFlat(gr), i = n.getValuesFlat(gr);
 		if (e.length < 2 || i.length < 2) throw B.BuiltIn.Div0;
 		o = 2 === r ? function(t, n) {
 			const e = t.length, r = n.length;
@@ -2550,14 +2509,14 @@ function Or(t, n, e, r) {
 		const e = .5 * function(t, n, e) {
 			if (e <= 0) return 0;
 			if (e >= 1) return 1;
-			const r = Lr(t) + Lr(n) - Lr(t + n), o = Math.exp(Math.log(e) * t + Math.log(1 - e) * n - r);
-			return e < (t + 1) / (t + n + 2) ? o * kr(t, n, e) / t : 1 - o * kr(n, t, 1 - e) / n;
+			const r = $r(t) + $r(n) - $r(t + n), o = Math.exp(Math.log(e) * t + Math.log(1 - e) * n - r);
+			return e < (t + 1) / (t + n + 2) ? o * Lr(t, n, e) / t : 1 - o * Lr(n, t, 1 - e) / n;
 		}(n / 2, .5, n / (n + t * t));
 		return t >= 0 ? 1 - e : e;
 	}(-o.x, o.df) * e;
 }
-var $r = 2 ** -22;
-function kr(t, n, e) {
+var Or = 2 ** -22;
+function Lr(t, n, e) {
 	const r = 1e-30, o = t + n, i = t + 1, u = t - 1;
 	let s = 1, a = 1 - o * e / i;
 	Math.abs(a) < r && (a = r), a = 1 / a;
@@ -2571,7 +2530,7 @@ function kr(t, n, e) {
 	}
 	return l;
 }
-function Lr(t) {
+function $r(t) {
 	const n = [
 		.9999999999998099,
 		676.5203681218851,
@@ -2583,19 +2542,19 @@ function Lr(t) {
 		9984369578019572e-21,
 		1.5056327351493116e-7
 	];
-	if (t < .5) return Math.log(Math.PI / Math.sin(Math.PI * t)) - Lr(1 - t);
+	if (t < .5) return Math.log(Math.PI / Math.sin(Math.PI * t)) - $r(1 - t);
 	t--;
 	let e = n[0];
 	for (let r = 1; r < 9; r++) e += n[r] / (t + r);
 	const r = t + 7.5;
 	return .5 * Math.log(2 * Math.PI) + (t + .5) * Math.log(r) - r + Math.log(e);
 }
-function qr(t) {
+function kr(t) {
 	let n = 0;
 	for (const e of t) n += e * e;
 	return n;
 }
-var _r = "\\p{L}\\p{N}_", jr = {
+var qr = "\\p{L}\\p{N}_", jr = {
 	alpha: "\\p{L}",
 	digit: "\\p{Nd}",
 	alnum: "\\p{L}\\p{N}",
@@ -2604,7 +2563,7 @@ var _r = "\\p{L}\\p{N}_", jr = {
 	space: "\\s",
 	blank: "\\t\\p{Zs}",
 	punct: "\\p{P}\\p{S}",
-	word: _r,
+	word: qr,
 	cntrl: "\\p{Cc}",
 	xdigit: "0-9A-Fa-f",
 	ascii: "\\x00-\\x7F",
@@ -2619,7 +2578,7 @@ var _r = "\\p{L}\\p{N}_", jr = {
 	cntrl: "\\P{Cc}",
 	print: "\\p{C}",
 	graph: "\\p{C}"
-}, Yr = `(?:(?<=[${_r}])(?![${_r}])|(?<![${_r}])(?=[${_r}]))`, zr = `(?:(?<=[${_r}])(?=[${_r}])|(?<![${_r}])(?![${_r}]))`, Gr = (t, n) => {
+}, Yr = `(?:(?<=[${qr}])(?![${qr}])|(?<![${qr}])(?=[${qr}]))`, zr = `(?:(?<=[${qr}])(?=[${qr}])|(?<![${qr}])(?![${qr}]))`, _r = (t, n) => {
 	if (!t.startsWith("[:", n)) return null;
 	const e = t.indexOf(":]", n + 2);
 	if (-1 === e) return null;
@@ -2631,7 +2590,7 @@ var _r = "\\p{L}\\p{N}_", jr = {
 		emit: i,
 		next: e + 2
 	};
-}, Xr = (t, n) => {
+}, Gr = (t, n) => {
 	if (!t.startsWith("(?", n)) return null;
 	let e = n + 2, r = "", o = "", i = !1;
 	for (; e < t.length;) {
@@ -2652,13 +2611,13 @@ var _r = "\\p{L}\\p{N}_", jr = {
 		group: !0,
 		next: e + 1
 	} : null;
-}, Hr = (t) => t.replace(/[^ims]/g, ""), Wr = (t) => (new RegExp(`${t.source}|`, t.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Kr = (t, n, e = "") => {
+}, Kr = (t) => t.replace(/[^ims]/g, ""), Xr = (t) => (new RegExp(`${t.source}|`, t.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Hr = (t, n, e = "") => {
 	const r = (n ? "i" : "") + e, o = (t, n) => {
 		try {
 			const e = new RegExp(t, n ? `${r}u` : r);
 			return {
 				regex: e,
-				groups: Wr(e)
+				groups: Xr(e)
 			};
 		} catch {
 			return null;
@@ -2684,7 +2643,7 @@ var _r = "\\p{L}\\p{N}_", jr = {
 					if ("C" === o) throw new SyntaxError("the any-byte escape is not supported");
 					if (r) {
 						if ("w" === o) {
-							n += _r, e += 2;
+							n += qr, e += 2;
 							continue;
 						}
 						if ("d" === o) {
@@ -2709,11 +2668,11 @@ var _r = "\\p{L}\\p{N}_", jr = {
 							continue;
 						}
 						if ("w" === o) {
-							n += `[${_r}]`, e += 2;
+							n += `[${qr}]`, e += 2;
 							continue;
 						}
 						if ("W" === o) {
-							n += `[^${_r}]`, e += 2;
+							n += `[^${qr}]`, e += 2;
 							continue;
 						}
 						if ("d" === o) {
@@ -2729,7 +2688,7 @@ var _r = "\\p{L}\\p{N}_", jr = {
 					continue;
 				}
 				if (r) {
-					const o = Gr(t, e);
+					const o = _r(t, e);
 					if (o) {
 						n += o.emit, e = o.next;
 						continue;
@@ -2745,10 +2704,10 @@ var _r = "\\p{L}\\p{N}_", jr = {
 					r = !0, n += u, e += 1, "^" === t[e] && (n += "^", e += 1), "]" === t[e] && (n += "\\]", e += 1);
 					continue;
 				}
-				const s = Xr(t, e);
+				const s = Gr(t, e);
 				if (s) {
 					s.on.includes("U") && (o = !0), s.off.includes("U") && (o = !1);
-					const t = Hr(s.on), r = Hr(s.off);
+					const t = Kr(s.on), r = Kr(s.off);
 					s.group ? n += t || r ? `(?${t}${r ? `-${r}` : ""}:` : "(?:" : (t || r) && (n += `(?${t}${r ? `-${r}` : ""}:`, i.push(")")), e = s.next;
 					continue;
 				}
@@ -2771,21 +2730,21 @@ var _r = "\\p{L}\\p{N}_", jr = {
 	}
 	const u = i.replace(/\\([pP])\{([A-Za-z_]+)\}/g, "\\$1{Script=$2}");
 	return o(i, !0) ?? (u === i ? null : o(u, !0)) ?? o(t, !1) ?? B.BuiltIn.Value;
-}, Zr = (t, n) => {
+}, Wr = (t, n) => {
 	const e = Math.trunc(t);
 	return e >= 0 && e <= n ? e : B.BuiltIn.Value;
-}, Qr = A({
-	REGEXEXTRACT: () => Jr,
-	REGEXMATCH: () => to,
-	REGEXREPLACE: () => no,
-	REGEXTEST: () => eo
+}, Zr = v({
+	REGEXEXTRACT: () => Qr,
+	REGEXMATCH: () => Jr,
+	REGEXREPLACE: () => to,
+	REGEXTEST: () => no
 });
-function Jr(t, n, e = 0, r = 0) {
-	const o = Zr(e, 2);
+function Qr(t, n, e = 0, r = 0) {
+	const o = Wr(e, 2);
 	if (B.isError(o)) return o;
-	const i = Zr(r, 1);
+	const i = Wr(r, 1);
 	if (B.isError(i)) return i;
-	const u = Kr(n, 1 === i);
+	const u = Hr(n, 1 === i);
 	if (B.isError(u)) return u;
 	const { regex: s } = u;
 	if (0 === o) {
@@ -2800,14 +2759,14 @@ function Jr(t, n, e = 0, r = 0) {
 	const a = t.match(s);
 	return a ? b.createRange().replace([a.slice(1).map((t) => t ?? B.BuiltIn.NA)]) : B.BuiltIn.NA;
 }
-function to(t, n, e = !1) {
-	const r = Kr(n, e);
+function Jr(t, n, e = !1) {
+	const r = Hr(n, e);
 	return B.isError(r) ? r : r.regex.test(t);
 }
-function no(t, n, e, r = 0, o = 0) {
-	const i = Zr(o, 1);
+function to(t, n, e, r = 0, o = 0) {
+	const i = Wr(o, 1);
 	if (B.isError(i)) return i;
-	const u = Kr(n, 1 === i);
+	const u = Hr(n, 1 === i);
 	if (B.isError(u)) return u;
 	const { regex: s, groups: a } = u, l = ((t, n) => {
 		let e = "", r = 0;
@@ -2879,11 +2838,11 @@ function no(t, n, e, r = 0, o = 0) {
 	const N = h[m], g = N.index;
 	return t.slice(0, g) + N[0].replace(s, l) + t.slice(g + N[0].length);
 }
-function eo(t, n, e = 0) {
-	const r = Zr(e, 1);
+function no(t, n, e = 0) {
+	const r = Wr(e, 1);
 	if (B.isError(r)) return r;
-	const o = Kr(n, 1 === r);
+	const o = Hr(n, 1 === r);
 	return B.isError(o) ? o : o.regex.test(t);
 }
-var ro = () => import("./CHCYcEKjePbdBT6S.mjs"), oo = () => import("./D4qsZVifvY4HXGV4.mjs"), io = () => import("./fuSCbGKaf-8luGWM.mjs"), uo = () => import("./DQUpOqHLBRcR3jRL.mjs"), so = () => import("./BAOKFei-3NUnKf2b.mjs"), ao = () => import("./WnWno64b5Kwzt5bq.mjs"), lo = () => import("./DzHBzc5ygBHUJz7Z.mjs"), fo = () => import("./DWsUELCL7M8CJRse.mjs"), co = () => import("./Bxs5g9POZ28N8txg.mjs"), ho = () => import("./B81c3QWvxdHun2T7.mjs"), mo = () => import("./BPITz297xS7JQJip.mjs"), No = () => import("./DIJcwREawbt_MeZK.mjs"), go = () => import("./Cg8sxKWlH9hl9cmJ.mjs"), po = () => import("./va7h1_p7n3e5jFud.mjs"), yo = () => import("./5e6JdlNsgYe10haf.mjs"), Mo = () => import("./Dq5qeAevZvlIBl1n.mjs"), Io = () => import("./DcxpVQJ0VRPd3zNH.mjs"), wo = () => import("./Bj-GG15t0G1x9-FU.mjs"), bo = () => import("./Dz8qQyUhCxQuVw4P.mjs"), Bo = () => import("./C4MIOejuBpyFfiBE.mjs"), xo = () => import("./Cz08Pg4FLQyPOKHH.mjs"), Co = (b, B, x) => (x || (x = /* @__PURE__ */ new Map()), B(x, b, v, t, ro, "Cube"), B(x, b, ht, I, oo, "Financial"), B(x, b, Et, r, io, "Financial"), B(x, b, Dt, M, uo, "Financial", w), B(x, b, Xt, n, so, "Financial"), B(x, b, Jt, s, ao, "Financial"), B(x, b, xn, a, lo, "Financial"), B(x, b, Fn, c, fo, "Financial"), B(x, b, Pn, N, co, "Financial"), B(x, b, _n, u, ho, "Financial"), B(x, b, ne, i, mo, "Financial"), B(x, b, se, y, No, "Financial"), B(x, b, he, f, go, "Financial"), B(x, b, Ie, o, po, "Financial"), B(x, b, xe, p, yo, "Financial"), B(x, b, Ge, m, Mo, "Lookup & Reference"), B(x, b, Ze, e, Io, "Lookup & Reference"), B(x, b, nr, l, wo, "Statistical"), B(x, b, Rr, g, bo, "Statistical"), B(x, b, Vr, h, Bo, "Statistical"), B(x, b, Qr, d, xo, "Text"), x);
-export { Co as default };
+var eo = () => import("./_2bUDcLtpT--sYHK.mjs"), ro = () => import("./DM96LY50uWuclm1m.mjs"), oo = () => import("./DeG2p0wft0dxcdAm.mjs"), io = () => import("./DJ9NMU6rZ1D5ebi_.mjs"), uo = () => import("./BnHZ6bpbcca91mUc.mjs"), so = () => import("./BYyJ0pYzV4HBWwtf.mjs"), ao = () => import("./CNT-L1MTjxpZVXu3.mjs"), lo = () => import("./CQuyzp4ribCibfU5.mjs"), fo = () => import("./Dpzo6YZEws6PLDBU.mjs"), co = () => import("./BPqpbST0XAzcTd47.mjs"), ho = () => import("./Bo0a8wLeBNS77kKI.mjs"), mo = () => import("./DWbFa7pPvHt76LBY.mjs"), No = () => import("./Dr61Yvcv07Hahj2a.mjs"), go = () => import("./BzQQHgBArLhC8pMH.mjs"), yo = () => import("./CdXvNLQU3uP4xf8H.mjs"), Mo = () => import("./QXT04Whlz23Oe61A.mjs"), po = () => import("./BJ47kZhvZcY3WJ_x.mjs"), Io = () => import("./D8lI4sL6G_iAKmXn.mjs"), wo = () => import("./DDSz0FRZeWiUv0Qn.mjs"), bo = () => import("./DLRWBCUyz6hWY7gA.mjs"), Bo = () => import("./BvYYJ7tez-T3126d.mjs"), xo = (b, B, x) => (x || (x = /* @__PURE__ */ new Map()), B(x, b, A, t, eo, "Cube"), B(x, b, ht, I, ro, "Financial"), B(x, b, Et, r, oo, "Financial"), B(x, b, Dt, p, io, "Financial", w), B(x, b, Kt, n, uo, "Financial"), B(x, b, Jt, s, so, "Financial"), B(x, b, xn, a, ao, "Financial"), B(x, b, Fn, c, lo, "Financial"), B(x, b, Pn, N, fo, "Financial"), B(x, b, jn, u, co, "Financial"), B(x, b, ne, i, ho, "Financial"), B(x, b, se, M, mo, "Financial"), B(x, b, he, f, No, "Financial"), B(x, b, Ie, o, go, "Financial"), B(x, b, xe, d, yo, "Financial"), B(x, b, Ge, m, Mo, "Lookup & Reference"), B(x, b, Ze, e, po, "Lookup & Reference"), B(x, b, tr, l, Io, "Statistical"), B(x, b, Rr, g, wo, "Statistical"), B(x, b, Sr, h, bo, "Statistical"), B(x, b, Zr, y, Bo, "Text"), x);
+export { xo as default };