@sheetxl/formulas-extended 0.8.0-beta.11 → 0.8.0-beta.13

package/node/esm/index.mjs

@@ -1,69 +1,69 @@
 /**
-* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.11
+* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.13
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { C as t, S as n, _ as e, a as r, b as o, c as i, d as u, f as s, g as a, h as l, i as f, l as c, m as h, n as m, o as N, p as g, r as p, s as d, t as y, u as M, v as I, x as w, y as b } from "./CgY5V9Cmm0UJmyGW.mjs";
-import { FormulaContext as B, FormulaError as x, IRange as R, ScalarType as C, ValueKind as E } from "@sheetxl/primitives";
-var A = Object.defineProperty, v = (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 p, t as d, u as y, v as M, x as I, y as w } from "./BbUWXLsnVo-QSDn_.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) => {
 	let e = {};
-	for (var r in t) A(e, r, {
+	for (var r in t) E(e, r, {
 		get: t[r],
 		enumerable: !0
 	});
-	return n || A(e, Symbol.toStringTag, { value: "Module" }), e;
-}, D = v({
-	CUBEKPIMEMBER: () => F,
-	CUBEMEMBER: () => S,
-	CUBEMEMBERPROPERTY: () => V,
-	CUBERANKEDMEMBER: () => T,
-	CUBESET: () => P,
-	CUBESETCOUNT: () => O,
-	CUBEVALUE: () => $
+	return n || E(e, Symbol.toStringTag, { value: "Module" }), e;
+}, v = A({
+	CUBEKPIMEMBER: () => D,
+	CUBEMEMBER: () => F,
+	CUBEMEMBERPROPERTY: () => S,
+	CUBERANKEDMEMBER: () => V,
+	CUBESET: () => T,
+	CUBESETCOUNT: () => P,
+	CUBEVALUE: () => O
 });
-function F(t, n, e, r) {
-	throw x.BuiltIn.NA;
+function D(t, n, e, r) {
+	throw B.BuiltIn.NA;
 }
-function S(t, n, e) {
-	throw x.BuiltIn.NA;
+function F(t, n, e) {
+	throw B.BuiltIn.NA;
 }
-function V(t, n, e) {
-	throw x.BuiltIn.NA;
+function S(t, n, e) {
+	throw B.BuiltIn.NA;
 }
-function T(t, n, e, r) {
-	throw x.BuiltIn.NA;
+function V(t, n, e, r) {
+	throw B.BuiltIn.NA;
 }
-function P(t, n, e, r, o) {
-	throw x.BuiltIn.NA;
+function T(t, n, e, r, o) {
+	throw B.BuiltIn.NA;
 }
-function O(t) {
-	throw x.BuiltIn.NA;
+function P(t) {
+	throw B.BuiltIn.NA;
 }
-function $(t, ...n) {
-	throw x.BuiltIn.NA;
+function O(t, ...n) {
+	throw B.BuiltIn.NA;
 }
-function k(t) {
+function $(t) {
 	if (null === t) return 0;
 	if ("string" == typeof t) try {
-		return B.parseAsNumber(t);
+		return b.parseAsNumber(t);
 	} catch {
-		return B.parseAsSerialDate(t);
+		return b.parseAsSerialDate(t);
 	}
-	return B.parseAsSerialDate(t);
+	return b.parseAsSerialDate(t);
+}
+function k(t) {
+	if (void 0 === t) throw B.BuiltIn.NA;
+	return $(t);
 }
 function L(t) {
-	if (void 0 === t) throw x.BuiltIn.NA;
-	return k(t);
+	return null === t ? 0 : b.parseAsNumber(t);
 }
 function q(t) {
-	return null === t ? 0 : B.parseAsNumber(t);
+	if (void 0 === t) throw B.BuiltIn.NA;
+	return L(t);
 }
-function _(t) {
-	if (void 0 === t) throw x.BuiltIn.NA;
-	return q(t);
-}
-var j = [
+var _ = [
 	31,
 	29,
 	31,
@@ -76,7 +76,7 @@ var j = [
 	31,
 	30,
 	31
-], U = [
+], j = [
 	31,
 	28,
 	31,
@@ -90,45 +90,45 @@ var j = [
 	30,
 	31
 ];
-function Y(t) {
+function U(t) {
 	return t % 4 == 0 && t % 100 != 0 || t % 400 == 0;
 }
-function z(t, n) {
-	return Y(t) ? j[n] : U[n];
+function Y(t, n) {
+	return U(t) ? _[n] : j[n];
 }
-var G = (t, n) => z(t, n - 1), H = (t) => t.d === G(t.y, t.m);
+var z = (t, n) => Y(t, n - 1), G = (t) => t.d === z(t.y, t.m);
 function X(t) {
-	const n = B.getDateParts(t);
+	const n = b.getDateParts(t);
 	return {
 		y: n.year,
 		m: n.month,
 		d: n.day
 	};
 }
-function W(t, n, e) {
+function H(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 K(t, n) {
+function W(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, G(r, e))
+		d: Math.min(t.d, z(r, e))
 	};
 }
-function Z(t) {
-	return B.getDateParts(Math.max(0, Math.floor(t)));
+function K(t) {
+	return b.getDateParts(Math.max(0, Math.floor(t)));
 }
-function Q(t, n, e, r, o, i) {
+function Z(t, n, e, r, o, i) {
 	return 360 * (r - t) + 30 * (o - n) + (i - e);
 }
-function J(t, n, e) {
+function Q(t, n, e) {
 	switch (e) {
 		case 0: return function(t, n) {
 			return {
-				days: Math.abs(rt(t, n)),
+				days: Math.abs(et(t, n)),
 				yearDays: 360
 			};
 		}(t, n);
@@ -137,24 +137,24 @@ function J(t, n, e) {
 				days: 0,
 				yearDays: 365
 			};
-			const e = Z(t), r = Z(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);
+			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;
+			let c, h = b.getSerialDate(l, 1, 1);
 			1900 === l && (h += 1);
-			if (0 === s) c = B.getSerialDate(l, 12, 31) - 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 = Z(e), i = Z(r), u = i.month - o.month;
-				if (u > 0 || 0 === u && i.day > o.day) c = (B.getSerialDate(f + 1, 1, 1) - h) / a;
+				const e = Math.min(t, n), r = Math.max(t, n), o = K(e), i = K(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 (Y(t)) {
-						const n = B.getSerialDate(t, 2, 29);
+					for (const t of [l, f]) if (U(t)) {
+						const n = b.getSerialDate(t, 2, 29);
 						if (n >= e && n <= r) {
 							c = 366;
 							break;
 						}
 					}
 				}
-			} else c = (B.getSerialDate(f + 1, 1, 1) - h) / a;
+			} else c = (b.getSerialDate(f + 1, 1, 1) - h) / a;
 			return {
 				days: u,
 				yearDays: c
@@ -170,80 +170,80 @@ function J(t, n, e) {
 			yearDays: 365
 		};
 		case 4: return function(t, n) {
-			const e = Z(t), r = Z(n);
+			const e = K(t), r = K(n);
 			let o = e.day, i = r.day;
 			31 === o && (o = 30);
 			31 === i && (i = 30);
 			return {
-				days: Math.abs(Q(e.year, e.month, o, r.year, r.month, i)),
+				days: Math.abs(Z(e.year, e.month, o, r.year, r.month, i)),
 				yearDays: 360
 			};
 		}(t, n);
 	}
 }
-function tt(t) {
+function J(t) {
 	return t >= 0 && Math.floor(t) <= 2958465;
 }
-function nt(t, n, e) {
+function tt(t, n, e) {
 	let r = Math.floor(t), o = Math.floor(n);
 	if (r > o) {
 		const t = r;
 		r = o, o = t;
 	}
-	if (0 === e) return rt(r, o) / 360;
-	const { days: i, yearDays: u } = J(r, o, e);
+	if (0 === e) return et(r, o) / 360;
+	const { days: i, yearDays: u } = Q(r, o, e);
 	return i / u;
 }
-function et(t, n, e) {
+function nt(t, n, e) {
 	const r = X(t);
 	let o = X(n).y - r.y, i = t;
 	for (; o > 0; o -= 1) {
-		const t = K(r, 12 * o);
-		if (i = W(t.y, t.m, t.d), i <= n) break;
+		const t = W(r, 12 * o);
+		if (i = H(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 = Z(t), o = Z(n);
+		const r = K(t), o = K(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 Q(r.year, r.month, i, o.year, o.month, u);
+		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 / (Y(X(n).y) ? 366 : 365);
+	return 2 === e ? o + u / 360 : 3 === e ? o + u / 365 : o + u / (U(X(n).y) ? 366 : 365);
 }
-function rt(t, n) {
-	const e = Z(t), r = Z(n), o = e.year, i = e.month;
+function et(t, n) {
+	const e = K(t), r = K(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 === (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), Q(o, i, u, s, a, l);
+	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);
 }
-function ot(t, n, e) {
+function rt(t, n, e) {
 	const r = Math.floor(t), o = Math.floor(n);
 	let i, u;
-	return 0 === e || 4 === e ? (i = J(r, o, e).days, u = 360) : (i = it(o) - it(r), u = 3 !== e && Y(Z(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 && U(K(r).year) ? 366 : 365), {
 		days: 0 === i ? u : i,
 		yearDays: u
 	};
 }
-function it(t) {
-	const n = Z(t);
-	return 2 === n.month && 29 === n.day && Y(n.year) ? t - 1 : t;
+function ot(t) {
+	const n = K(t);
+	return 2 === n.month && 29 === n.day && U(n.year) ? t - 1 : t;
 }
-function ut(t) {
-	const n = void 0 === t ? 0 : q(t), e = Math.trunc(n);
-	if (n < 0 || e > 4) throw x.BuiltIn.Num;
+function it(t) {
+	const n = void 0 === t ? 0 : L(t), e = Math.trunc(n);
+	if (n < 0 || e > 4) throw B.BuiltIn.Num;
 	return e;
 }
-function st(t, n) {
+function ut(t, n) {
 	const e = Math.floor(t), r = Math.floor(n);
-	if (!tt(t) || !tt(n) || e >= r) throw x.BuiltIn.Num;
+	if (!J(t) || !J(n) || e >= r) throw B.BuiltIn.Num;
 	return {
 		settlement: e,
 		maturity: r
 	};
 }
-function at(t, n, e, r, o) {
-	const i = ut(o), u = L(t), s = L(n), a = _(e), l = _(r), f = st(u, s);
-	if (a <= 0 || l <= 0) throw x.BuiltIn.Num;
+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);
+	if (a <= 0 || l <= 0) throw B.BuiltIn.Num;
 	return {
 		...f,
 		x: a,
@@ -251,27 +251,27 @@ function at(t, n, e, r, o) {
 		basis: i
 	};
 }
-function lt(t, n, e) {
-	const r = L(t), o = L(n), i = _(e), u = st(r, o);
+function at(t, n, e) {
+	const r = k(t), o = k(n), i = q(e), u = ut(r, o);
 	if (u.maturity > function(t) {
-		const n = B.getDateParts(t);
-		if (n.year >= 9999) throw x.BuiltIn.Num;
-		if (0 === n.day) return B.getSerialDate(n.year + 1, n.month, 1) - 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 x.BuiltIn.Num;
+		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);
+		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 {
 		...u,
 		x: i,
 		days: u.maturity - u.settlement
 	};
 }
-function ft(t, n, e, r, o, i) {
-	const u = ut(i), s = L(t), a = L(n), l = L(e), f = _(r), c = _(o);
-	if (!tt(s) || !tt(a) || !tt(l)) throw x.BuiltIn.Num;
+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);
+	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 x.BuiltIn.Num;
-	const { days: g, yearDays: p } = J(N, h, u), d = J(N, m, u).days;
+	if (!(N < h && h < m)) throw B.BuiltIn.Num;
+	const { days: g, yearDays: p } = Q(N, h, u), d = Q(N, m, u).days;
 	return {
 		rate: f,
 		x: c,
@@ -281,104 +281,104 @@ function ft(t, n, e, r, o, i) {
 		B: p
 	};
 }
-function ct(t, n, e, r, o, i = !1) {
-	let u = i ? 0 : ut(o);
-	const s = L(t);
-	if (!tt(s)) throw x.BuiltIn.Num;
-	const a = L(n);
-	if (!tt(a)) throw x.BuiltIn.Num;
-	const l = e.map(_), f = Math.trunc(_(r));
-	if (1 !== f && 2 !== f && 4 !== f) throw x.BuiltIn.Num;
-	return i && (u = ut(o)), {
-		...st(s, a),
+function ft(t, n, e, r, o, i = !1) {
+	let u = i ? 0 : it(o);
+	const s = k(t);
+	if (!J(s)) throw B.BuiltIn.Num;
+	const a = k(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;
+	return i && (u = it(o)), {
+		...ut(s, a),
 		numbers: l,
 		frequency: f,
 		basis: u
 	};
 }
-var ht = (t) => Number.isFinite(t) ? t : 0, mt = v({
-	ACCRINT: () => Nt,
-	ACCRINTM: () => gt
+var ct = (t) => Number.isFinite(t) ? t : 0, ht = A({
+	ACCRINT: () => mt,
+	ACCRINTM: () => Nt
 });
-function Nt(t, n, e, r, o, i, u = 0, s = !0) {
+function mt(t, n, e, r, o, i, u = 0, s = !0) {
 	const a = function(t) {
 		if (void 0 === t) return !0;
 		if (null === t) return !1;
 		if ("boolean" == typeof t) return t;
 		if ("number" == typeof t) return 0 !== t;
-		if (x.isError(t)) throw t;
-		throw x.BuiltIn.Value;
-	}(s), l = L(t);
-	if (!tt(l)) throw x.BuiltIn.Num;
-	const f = L(n);
-	if (!tt(f)) throw x.BuiltIn.Num;
-	const c = L(e);
-	if (!tt(c)) throw x.BuiltIn.Num;
-	const h = _(r), m = void 0 === o ? 1e3 : q(o), N = Math.trunc(_(i));
-	if (1 !== N && 2 !== N && 4 !== N) throw x.BuiltIn.Num;
-	const g = ut(u), p = Math.floor(l), d = Math.floor(c);
-	if (p >= d || h <= 0 || m <= 0) throw x.BuiltIn.Num;
+		if (B.isError(t)) throw t;
+		throw B.BuiltIn.Value;
+	}(s), l = k(t);
+	if (!J(l)) throw B.BuiltIn.Num;
+	const f = k(n);
+	if (!J(f)) throw B.BuiltIn.Num;
+	const c = k(e);
+	if (!J(c)) throw B.BuiltIn.Num;
+	const h = q(r), m = void 0 === o ? 1e3 : L(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 = H(X(n));
+		const u = 12 / r, s = G(X(n));
 		let a;
 		if (e > n && i) {
 			a = n;
-			for (let t = n; t < e;) a = t, t = bt(t, u, s);
-		} else a = bt(n, -u, s);
-		const l = 3 === o ? 365 / r : 1 === o ? n - bt(n, -u, s) : 360 / r;
-		let f = It(Math.max(t, a), e, o) / l;
+			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;
 		for (let n = a; n > t;) {
-			const e = bt(n, -u, s);
-			t <= e ? i && (f += 1) : f += It(t, n, o) / wt(e, n, r, o), n = e;
+			const e = wt(n, -u, s);
+			t <= e ? i && (f += 1) : f += Mt(t, n, o) / It(e, n, r, o), n = e;
 		}
 		return f;
 	}(p, Math.floor(f), d, N, g, a);
-	return ht(m * (h / N) * y);
-}
-function gt(t, n, e, r, o = 0) {
-	const i = L(t);
-	if (!tt(i)) throw x.BuiltIn.Num;
-	const u = L(n);
-	if (!tt(u)) throw x.BuiltIn.Num;
-	const s = _(e), a = void 0 === r ? 1e3 : q(r), l = ut(o);
-	if (Math.floor(i) > Math.floor(u) || s <= 0 || a <= 0) throw x.BuiltIn.Num;
-	const f = a * s * nt(i, u, l);
+	return ct(m * (h / N) * y);
+}
+function Nt(t, n, e, r, o = 0) {
+	const i = k(t);
+	if (!J(i)) throw B.BuiltIn.Num;
+	const u = k(n);
+	if (!J(u)) throw B.BuiltIn.Num;
+	const s = q(e), a = void 0 === r ? 1e3 : L(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 pt = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d), dt = (t) => 2 === t.m && t.d === G(t.y, 2);
-function yt(t, n, e) {
+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 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), pt(r, o);
+	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);
 }
-function Mt(t, n) {
+function yt(t, n) {
 	const e = X(t), r = X(n);
-	return 31 === e.d && (e.d = 30), 31 === r.d && (r.d = 30), pt(e, r);
+	return 31 === e.d && (e.d = 30), 31 === r.d && (r.d = 30), gt(e, r);
 }
-var It = (t, n, e) => 0 === e ? yt(t, n, !1) : 4 === e ? Mt(t, n) : n - t, wt = (t, n, e, r) => 1 === r ? n - t : 3 === r ? 365 / e : 4 === r ? Mt(t, n) : yt(t, n, !0);
-function bt(t, n, e) {
-	if (t < 1) throw x.BuiltIn.Num;
-	const r = K(X(t), n), o = W(r.y, r.m, e ? G(r.y, r.m) : r.d);
-	if (o < 1 || o > 2958465) throw x.BuiltIn.Num;
+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);
+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);
+	if (o < 1 || o > 2958465) throw B.BuiltIn.Num;
 	return o;
 }
-function Bt(t, n, e, r, o, i, u) {
-	const s = _(t), a = Math.floor(_(n)), l = Math.floor(_(e)), f = _(r), c = _(o), h = _(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(q(u ?? 0));
+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));
 	return m < 0 || 2 === m || m > 4 ? null : {
 		cost: s,
 		salvage: f,
 		periodIndex: c > 1 ? Math.floor(c) : Math.ceil(c),
 		rate: h,
-		...ot(a, l, m)
+		...rt(a, l, m)
 	};
 }
-var xt = (t) => {
+var Bt = (t) => {
 	const n = t.getLocaleProfile().currencySymbol;
 	return `${n}#,##0.00_);[Red](${n}#,##0.00)`;
-}, Rt = (t, n) => {
+}, xt = (t, n) => {
 	if (0 === t) {
-		if (n < 0) throw x.BuiltIn.Div0;
+		if (n < 0) throw B.BuiltIn.Div0;
 		if (0 === n) return NaN;
 	}
 	if (!Number.isInteger(n) || Math.abs(n) > 4294967294) {
@@ -391,30 +391,30 @@ var xt = (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), Et = (t, n = 0) => {
+}, Ct = (t) => t >= 2147483648 || t <= -2147483649 || Number.isNaN(t) ? -2147483648 : Math.trunc(t), Rt = (t, n = 0) => {
 	const e = 10 ** n, r = Number(Math.abs(t).toPrecision(15));
 	return Math.sign(t) * Math.round(r * e) / e;
-}, At = v({ AMORDEGRC: () => Dt }), vt = 1e6;
-function Dt(t, n, e, r, o, i, u = 0) {
-	const s = Bt(t, n, e, r, o, i, u);
+}, Et = A({ AMORDEGRC: () => vt }), At = 1e6;
+function vt(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);
 	if (a - l === 0) return 0;
-	const y = Et(Math.min(a * p * N, a - l));
+	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);
 	let w = 1;
 	if (I >= 1) {
-		if (I - 1 <= vt) for (; w < I; w++) {
+		if (I - 1 <= At) for (; w < I; w++) {
 			if (M < l) return 0;
 			M -= M * p;
 		}
-		else M *= Rt(1 - p, I - 1), w = I;
+		else M *= xt(1 - p, I - 1), w = I;
 		if (M < l) return 0;
-		if (f === I) return Et(M * p);
+		if (f === I) return Rt(M * p);
 		M -= M * p, w++;
 	}
 	for (; w <= f; w++) {
@@ -422,56 +422,56 @@ function Dt(t, n, e, r, o, i, u = 0) {
 		const t = d - w;
 		if (t < 1) return 0;
 		const n = t <= 2 ? M / t : M * p;
-		if (w === f) return Et(n);
+		if (w === f) return Rt(n);
 		M -= n;
 	}
 	return 0;
 }
-var Ft = v({
-	CUMIPMT: () => Lt,
-	CUMPRINC: () => qt,
-	FV: () => St,
-	IPMT: () => $t,
-	ISPMT: () => _t,
-	NPER: () => Pt,
-	PMT: () => Tt,
-	PPMT: () => kt,
-	PV: () => Vt,
-	RATE: () => Ot
+var Dt = A({
+	CUMIPMT: () => kt,
+	CUMPRINC: () => Lt,
+	FV: () => Ft,
+	IPMT: () => Ot,
+	ISPMT: () => qt,
+	NPER: () => Tt,
+	PMT: () => Vt,
+	PPMT: () => $t,
+	PV: () => St,
+	RATE: () => Pt
 });
-function St(t, n, e, r = 0, o = 0) {
-	if (B.formatResults(xt(B.getRuntime())), 0 === t) return -(r + e * n);
-	const i = Rt(1 + t, n);
+function Ft(t, n, e, r = 0, o = 0) {
+	if (b.formatResults(Bt(b.getRuntime())), 0 === t) return -(r + e * n);
+	const i = xt(1 + t, n);
 	return -(r * i + (i - 1) / t * (1 + t * (o ? 1 : 0)) * e);
 }
-function Vt(t, n, e, r = 0, o = 0) {
-	if (B.formatResults(xt(B.getRuntime())), 0 === t) return -(r + e * n);
-	const i = Rt(1 + t, n);
-	if (0 === i) throw x.BuiltIn.Div0;
+function St(t, n, e, r = 0, o = 0) {
+	if (b.formatResults(Bt(b.getRuntime())), 0 === t) return -(r + e * n);
+	const i = xt(1 + t, n);
+	if (0 === i) throw B.BuiltIn.Div0;
 	return -(r + (i - 1) / t * (1 + t * (o ? 1 : 0)) * e) / i;
 }
-function Tt(t, n, e, r = 0, o = 0) {
-	if (B.formatResults(xt(B.getRuntime())), 0 === n) return NaN;
+function Vt(t, n, e, r = 0, o = 0) {
+	if (b.formatResults(Bt(b.getRuntime())), 0 === n) return NaN;
 	if (0 === t) return (-e - r) / n;
 	if (t <= -1) return NaN;
 	const i = n * Math.log1p(t), u = (e / -Math.expm1(-i) + r / Math.expm1(i)) * t;
 	return -(o ? u / (1 + t) : u);
 }
-function Pt(t, n, e, r = 0, o = 0) {
+function Tt(t, n, e, r = 0, o = 0) {
 	if (0 === t) {
-		if (0 === n) throw x.BuiltIn.Div0;
+		if (0 === n) throw B.BuiltIn.Div0;
 		return (-e - r) / n;
 	}
 	if (t <= -1) return NaN;
 	const i = Math.log(1 + t);
-	if (0 === i) throw x.BuiltIn.Div0;
+	if (0 === i) throw B.BuiltIn.Div0;
 	return o && (n *= 1 + t), Math.log((n - r * t) / (e * t + n)) / i;
 }
-function Ot(t, n, e, r = 0, o = 0, i = .1) {
-	if (B.formatResults("0%"), i <= -1) throw x.BuiltIn.Value;
+function Pt(t, n, e, r = 0, o = 0, i = .1) {
+	if (b.formatResults("0%"), i <= -1) throw B.BuiltIn.Value;
 	const u = o ? 1 : 0, s = (o) => {
 		if (0 === o) return e + n * t + r;
-		const i = Rt(1 + o, t);
+		const i = xt(1 + o, t);
 		return e * i + (i - 1) / o * (1 + o * u) * n + r;
 	};
 	let a = i, l = s(a), f = l > 0 ? i - .001 : i + .001, c = s(f);
@@ -485,16 +485,16 @@ function Ot(t, n, e, r = 0, o = 0, i = .1) {
 	}
 	return NaN;
 }
-function $t(t, n, e, r, o = 0, i = 0) {
-	if (B.formatResults(xt(B.getRuntime())), n < 1 || n - 1 >= e) return NaN;
+function Ot(t, n, e, r, o = 0, i = 0) {
+	if (b.formatResults(Bt(b.getRuntime())), n < 1 || n - 1 >= e) return NaN;
 	if (1 === n && i) return 0;
 	if (0 === t) return 0;
 	if (t <= -1) return NaN;
 	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 kt(t, n, e, r, o = 0, i = 0) {
-	if (B.formatResults(xt(B.getRuntime())), n < 1 || n - 1 >= e) return NaN;
+function $t(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;
 	const u = Math.log1p(t), s = -Math.expm1(-e * u);
@@ -502,31 +502,31 @@ function kt(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 Lt(t, n, e, r, o, i) {
-	const u = Ut(...jt(t, n, e, r, o, i));
+function kt(t, n, e, r, o, i) {
+	const u = jt(..._t(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 qt(t, n, e, r, o, i) {
-	const u = Ut(...jt(t, n, e, r, o, i));
+function Lt(t, n, e, r, o, i) {
+	const u = jt(..._t(t, n, e, r, o, i));
 	return u ? u.principal : NaN;
 }
-function _t(t, n, e, r) {
-	if (0 === e) throw x.BuiltIn.Div0;
+function qt(t, n, e, r) {
+	if (0 === e) throw B.BuiltIn.Div0;
 	const o = r * (n - e) * t / e;
 	return Number.isFinite(o) ? o : NaN;
 }
-var jt = (t, n, e, r, o, i) => [
-	_(t),
-	_(n),
-	_(e),
-	_(r),
-	_(o),
-	_(i)
-], Ut = (t, n, e, r, o, i) => {
+var _t = (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) => {
 	if (t <= 0 || n <= 0 || e <= 0 || r < 1 || r > o || o > n || 0 !== i && 1 !== i) return null;
-	const u = Tt(t, n, e, 0, i);
+	const u = Vt(t, n, e, 0, i);
 	if (!Number.isFinite(u)) return null;
 	const s = Math.ceil(r), a = Math.floor(o), l = a - s + 1;
 	if (l <= 0) return {
@@ -550,30 +550,30 @@ var jt = (t, n, e, r, o, i) => [
 		principal: m,
 		count: l
 	};
-}, Yt = (t) => {
-	const n = B.getArgs().getRawAt(t), e = n;
+}, Ut = (t) => {
+	const n = b.getArgs().getRawAt(t), e = n;
 	return !0 !== e?.isIRange || 1 === e.size && !0 === n.isIReferenceRange;
 };
-function zt(t, n, e, r = "xnpv") {
+function Yt(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 x.BuiltIn.Num;
-	const a = !Yt(e + 1), l = Yt(e) || o, f = !a || o, c = o ? 0 : 1, h = [], m = [];
+	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 = [];
 	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 (x.isError(e)) throw e;
-			if (!o && (N = Gt(e, f, o, 0), N < c || N > 2958465)) throw x.BuiltIn.Num;
-			if (x.isError(n)) throw n;
+			if (B.isError(e)) throw e;
+			if (!o && (N = zt(e, f, o, 0), N < c || N > 2958465)) throw B.BuiltIn.Num;
+			if (B.isError(n)) throw n;
 		} else {
-			if (x.isError(n)) throw n;
-			if (x.isError(e)) throw e;
+			if (B.isError(n)) throw n;
+			if (B.isError(e)) throw e;
 		}
 		if (o && null === n) continue;
-		if (o && null === e && a) throw x.BuiltIn.Num;
-		const r = Gt(e, f, o, t), s = Ht(n, l, o, t);
-		if (r > 2958465 || r < c) throw x.BuiltIn.Num;
-		if (!o && r < N) throw x.BuiltIn.Num;
+		if (o && null === e && a) throw B.BuiltIn.Num;
+		const r = zt(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);
 	}
 	const g = N ?? 0;
@@ -582,48 +582,48 @@ function zt(t, n, e, r = "xnpv") {
 		days: m.map((t) => t - g)
 	};
 }
-function Gt(t, n, e, r) {
-	const o = n ? k(t) : t;
-	if ("number" != typeof o || Number.isNaN(o)) throw e || 0 === r ? x.BuiltIn.Value : x.BuiltIn.Num;
+function zt(t, n, e, r) {
+	const o = n ? $(t) : t;
+	if ("number" != typeof o || Number.isNaN(o)) throw e || 0 === r ? B.BuiltIn.Value : B.BuiltIn.Num;
 	return Math.trunc(o);
 }
-function Ht(t, n, e, r) {
-	const o = n ? q(t) : t;
-	if ("number" != typeof o || Number.isNaN(o)) throw e || 0 === r ? x.BuiltIn.Value : x.BuiltIn.Num;
+function Gt(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 o;
 }
-var Xt = v({
-	IRR: () => Kt,
-	MIRR: () => Zt,
-	NPV: () => Wt,
-	XIRR: () => Jt,
-	XNPV: () => Qt
+var Xt = A({
+	IRR: () => Wt,
+	MIRR: () => Kt,
+	NPV: () => Ht,
+	XIRR: () => Qt,
+	XNPV: () => Zt
 });
-function Wt(t, n) {
-	B.formatResults(xt(B.getRuntime()));
+function Ht(t, n) {
+	b.formatResults(Bt(b.getRuntime()));
 	const e = [];
 	for (const t of n) for (const n of t.values()) e.push(n);
 	const r = e.length, o = 1 + t;
-	if (0 === o) throw x.BuiltIn.Div0;
-	if (!Number.isFinite(Rt(o, r - 1))) throw x.BuiltIn.Div0;
+	if (0 === o) throw B.BuiltIn.Div0;
+	if (!Number.isFinite(xt(o, r - 1))) throw B.BuiltIn.Div0;
 	let i = 0;
 	for (let t = r - 1; t >= 0; t--) i += e[t], i /= o;
 	return i;
 }
-function Kt(t, n = .1) {
-	if (B.formatResults("0%"), B.getArgs().getKindAt(0) === E.Error) throw t[0];
-	if (n <= -1 || 1 + n === n) throw x.BuiltIn.Value;
-	if (void 0 === t) throw x.BuiltIn.Value;
+function Wt(t, n = .1) {
+	if (b.formatResults("0%"), b.getArgs().getKindAt(0) === R.Error) throw t[0];
+	if (n <= -1 || 1 + n === n) throw B.BuiltIn.Value;
+	if (void 0 === t) throw B.BuiltIn.Value;
 	const e = [];
 	for (const n of t) {
-		if (x.isError(n)) throw x.BuiltIn.Value;
+		if (B.isError(n)) throw B.BuiltIn.Value;
 		"number" == typeof n && e.push(n);
 	}
 	let r = !1, o = !1;
 	for (const t of e) t > 0 ? r = !0 : t < 0 && (o = !0);
 	if (!r || !o) return NaN;
 	const i = (t) => {
-		if (0 === t) throw x.BuiltIn.Div0;
+		if (0 === t) throw B.BuiltIn.Div0;
 		const n = 1 / t;
 		let r = 0, o = 1;
 		for (let t = 0; t < e.length; t++) r += e[t] / o, o *= n;
@@ -644,52 +644,52 @@ function Kt(t, n = .1) {
 	}
 	return NaN;
 }
-function Zt(t, n, e) {
-	if (B.formatResults("0%"), void 0 === t) throw x.BuiltIn.Value;
+function Kt(t, n, e) {
+	if (b.formatResults("0%"), void 0 === t) throw B.BuiltIn.Value;
 	const r = [];
 	for (const n of t) {
-		if (x.isError(n)) throw n;
+		if (B.isError(n)) throw n;
 		"number" == typeof n && r.push(n);
 	}
 	const o = r.length;
-	if (o < 2) throw x.BuiltIn.Div0;
-	if (!Number.isFinite(Rt(1 + e, o - 1))) throw x.BuiltIn.Div0;
-	if (!Number.isFinite(Rt(1 + e, o)) || !Number.isFinite(Rt(1 + n, o))) return NaN;
+	if (o < 2) throw B.BuiltIn.Div0;
+	if (!Number.isFinite(xt(1 + e, o - 1))) throw B.BuiltIn.Div0;
+	if (!Number.isFinite(xt(1 + e, o)) || !Number.isFinite(xt(1 + n, o))) return NaN;
 	let i = 0, u = 0;
 	for (let t = 0; t < o; t++) {
 		const o = r[t];
 		if (o > 0) {
 			const n = Math.pow(1 + e, t);
-			if (0 === n) throw x.BuiltIn.Div0;
+			if (0 === n) throw B.BuiltIn.Div0;
 			i += o / n;
 		} else if (o < 0) {
 			const e = Math.pow(1 + n, t);
-			if (0 === e) throw x.BuiltIn.Div0;
+			if (0 === e) throw B.BuiltIn.Div0;
 			u += o / e;
 		}
 	}
-	if (0 === u) throw x.BuiltIn.Div0;
+	if (0 === u) throw B.BuiltIn.Div0;
 	const s = i * Math.pow(1 + e, o - 1), a = Math.pow(-s / u, 1 / (o - 1)) - 1;
 	return Number.isFinite(a) ? a : NaN;
 }
-function Qt(t, n, e) {
-	const r = _(t);
-	if (void 0 === n || void 0 === e) throw x.BuiltIn.NA;
+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 = zt(n, e, 1);
+	const o = Yt(n, e, 1);
 	let i = 0;
 	for (let t = 0; t < o.values.length; t++) {
-		const n = Rt(1 + r, o.days[t] / 365);
+		const n = xt(1 + r, o.days[t] / 365);
 		if (!Number.isFinite(n)) return NaN;
 		i += o.values[t] / n;
 	}
 	return Number.isFinite(i) ? i : NaN;
 }
-function Jt(t, n, e = .1) {
-	const r = q(e);
-	if (void 0 === t || void 0 === n) throw x.BuiltIn.NA;
-	const o = zt(t, n, 0, "xirr"), i = o.values, u = i.length;
-	if (1 === u) throw x.BuiltIn.NA;
+function Qt(t, n, e = .1) {
+	const r = L(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;
+	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);
 	if (!s || !a) return NaN;
@@ -764,139 +764,139 @@ function Jt(t, n, e = .1) {
 	const M = Math.abs(f(m)) <= Math.abs(f(N)) ? m : N;
 	return Number.isFinite(M) ? M : NaN;
 }
-var tn = v({
-	DOLLARDE: () => rn,
-	DOLLARFR: () => on,
-	EFFECT: () => nn,
-	NOMINAL: () => en
+var Jt = A({
+	DOLLARDE: () => en,
+	DOLLARFR: () => rn,
+	EFFECT: () => tn,
+	NOMINAL: () => nn
 });
-function nn(t, n) {
-	const e = _(t), r = Math.trunc(_(n));
+function tn(t, n) {
+	const e = q(t), r = Math.trunc(q(n));
 	if (e <= 0 || r < 1) return NaN;
-	const o = Rt(1 + e / r, r) - 1;
+	const o = xt(1 + e / r, r) - 1;
 	return Number.isFinite(o) ? o : NaN;
 }
-function en(t, n) {
-	const e = _(t), r = Math.trunc(_(n));
+function nn(t, n) {
+	const e = q(t), r = Math.trunc(q(n));
 	if (e <= 0 || r < 1) return NaN;
-	const o = (Rt(e + 1, 1 / r) - 1) * r;
+	const o = (xt(e + 1, 1 / r) - 1) * r;
 	return Number.isFinite(o) ? o : NaN;
 }
-function rn(t, n) {
-	const e = _(t), { denominator: r, scale: o } = un(_(n));
+function en(t, n) {
+	const e = q(t), { denominator: r, scale: o } = on(q(n));
 	if (Number.isNaN(r)) return NaN;
 	const i = e < 0 ? -1 : 1, u = Math.abs(e), s = Math.trunc(u);
 	return i * (s + (u - s) * o / r);
 }
-function on(t, n) {
-	const e = _(t), { denominator: r, scale: o } = un(_(n));
+function rn(t, n) {
+	const e = q(t), { denominator: r, scale: o } = on(q(n));
 	if (Number.isNaN(r)) return NaN;
 	const i = e < 0 ? -1 : 1, u = Math.abs(e), s = Math.trunc(u);
 	return i * (s + (u - s) * r / o);
 }
-var un = (t) => {
+var on = (t) => {
 	if (t < 0) return {
 		denominator: NaN,
 		scale: 1
 	};
 	const n = Math.trunc(t);
-	if (0 === n) throw x.BuiltIn.Div0;
+	if (0 === n) throw B.BuiltIn.Div0;
 	return {
 		denominator: n,
 		scale: 10 ** Math.ceil(Math.log10(n))
 	};
 };
-var sn = (t, n) => z(t, n - 1), an = (t) => t.d === sn(t.y, t.m);
-function ln(t, n = !1) {
-	const e = Math.min(t.d, sn(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;
+var un = (t, n) => Y(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;
 }
-function fn(t, n) {
-	const e = ln(t) < 1;
-	return ln(n, e) - ln(t, e);
+function ln(t, n) {
+	const e = an(t) < 1;
+	return an(n, e) - an(t, e);
 }
-function cn(t) {
-	const n = B.getDateParts(t);
+function fn(t) {
+	const n = b.getDateParts(t);
 	return {
 		y: n.year,
 		m: n.month,
 		d: n.day
 	};
 }
-function hn(t, n, e, r) {
+function cn(t, n, e, r) {
 	let o = t.m - 1 - n;
 	const i = t.y + Math.floor(o / 12);
 	o = (o % 12 + 12) % 12 + 1;
-	const u = sn(i, o);
+	const u = un(i, o);
 	return {
 		y: i,
 		m: o,
 		d: r ? u : Math.min(e, u)
 	};
 }
-function mn(t, n, e, r = !1) {
-	const o = an(t), i = hn(t, n * e, t.d, o);
-	return r && !o && (i.d = Math.min(t.d, 2 === i.m ? 29 : sn(i.y, i.m))), i;
+function hn(t, n, e, r = !1) {
+	const o = sn(t), i = cn(t, n * e, t.d, o);
+	return r && !o && (i.d = Math.min(t.d, 2 === i.m ? 29 : un(i.y, i.m))), i;
 }
-function Nn(t, n, e) {
-	const r = 12 / e, o = cn(n);
+function mn(t, n, e) {
+	const r = 12 / e, o = fn(n);
 	let i = 0, u = o;
-	for (; (0 === i ? n : ln(u)) > t;) i++, u = mn(o, i, r);
+	for (; (0 === i ? n : an(u)) > t;) i++, u = hn(o, i, r);
 	return {
 		maturity: o,
 		pcd: u,
-		ncd: mn(o, i - 1, r),
+		ncd: hn(o, i - 1, r),
 		count: i,
 		step: r
 	};
 }
+function Nn(t, n, e) {
+	return Math.max(0, an(mn(t, n, e).pcd));
+}
 function gn(t, n, e) {
-	return Math.max(0, ln(Nn(t, n, e).pcd));
+	return an(mn(t, n, e).ncd);
 }
 function pn(t, n, e) {
-	return ln(Nn(t, n, e).ncd);
+	const r = mn(t, n, e);
+	return an(r.pcd) <= 0 ? NaN : r.count;
 }
-function dn(t, n, e) {
-	const r = Nn(t, n, e);
-	return ln(r.pcd) <= 0 ? NaN : r.count;
-}
-function yn(t, n, e, r) {
+function dn(t, n, e, r) {
 	return function(t, n, e) {
-		const { days: r } = J(t, n, e);
+		const { days: r } = Q(t, n, e);
 		return t < n ? r : 0;
-	}(gn(t, n, e), t, r);
+	}(Nn(t, n, e), t, r);
 }
-function Mn(t, n, e, r) {
-	const o = Nn(t, n, e);
-	if (0 !== r && 4 !== r) return ln(o.ncd) - t;
-	const i = cn(t), u = mn(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 ? mn(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 >= sn(i.y, 2)) && (a = 30), (31 === l || 2 === u.m && l >= sn(u.y, 2)) && (l = 30)), 360 * (u.y - i.y) + 30 * (u.m - i.m) + (l - a);
+function yn(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 In(t, n, e, r) {
+function Mn(t, n, e, r) {
 	if (3 === r) return 365 / e;
 	if (1 !== r) return 360 / e;
-	const o = 12 / e, i = cn(n), u = [i], s = [i];
-	let a = an(i), l = i.d;
+	const o = 12 / e, i = fn(n), u = [i], s = [i];
+	let a = sn(i), l = i.d;
 	const f = (t) => t[t.length - 1];
-	for (; ln(f(u)) > t || ln(f(s)) > t;) {
-		const t = hn(f(u), o, f(u).d, a);
-		an(t) && (a = !0), u.push(t);
-		const n = hn(f(s), o, l, !1);
+	for (; an(f(u)) > t || an(f(s)) > t;) {
+		const t = cn(f(u), o, f(u).d, a);
+		sn(t) && (a = !0), u.push(t);
+		const n = cn(f(s), o, l, !1);
 		l = n.d, s.push(n);
 	}
-	const c = s.findIndex((n) => ln(n) <= t);
-	if (ln(s[c - 1]) !== ln(u[c - 1])) return fn(s[c], s[c - 1]);
-	const h = u.findIndex((n) => ln(n) <= t);
-	return fn(u[h], u[h - 1]);
+	const c = s.findIndex((n) => an(n) <= t);
+	if (an(s[c - 1]) !== an(u[c - 1])) return ln(s[c], s[c - 1]);
+	const h = u.findIndex((n) => an(n) <= t);
+	return ln(u[h], u[h - 1]);
 }
-function wn(t, n, e, r) {
-	const o = L(t), i = L(n), u = Math.floor(o), s = Math.floor(i);
-	if (!tt(o) || !tt(i) || u >= s) throw x.BuiltIn.Num;
-	const a = Math.trunc(_(e));
-	if (1 !== a && 2 !== a && 4 !== a) throw x.BuiltIn.Num;
-	const l = void 0 === r ? 0 : q(r), f = Math.trunc(l);
-	if (l < 0 || f > 4) throw x.BuiltIn.Num;
+function In(t, n, e, r) {
+	const o = k(t), i = k(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);
+	if (l < 0 || f > 4) throw B.BuiltIn.Num;
 	return {
 		settlement: u,
 		maturity: s,
@@ -904,8 +904,8 @@ function wn(t, n, e, r) {
 		basis: f
 	};
 }
-function bn(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) : 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);
 	return {
 		N: o,
 		A: i,
@@ -913,8 +913,8 @@ function bn(t, n, e, r) {
 		DSC: u - i
 	};
 }
-function Bn(t, n, e, r, o, i, u) {
-	const { N: s, A: a, E: l, DSC: f } = bn(t, n, i, u);
+function bn(t, n, e, r, o, i, u) {
+	const { N: s, A: a, E: l, DSC: f } = wn(t, n, i, u);
 	if (Number.isNaN(s)) return NaN;
 	const c = 100 * e / i, h = r / i;
 	if (1 === s) return (c + o) / (h * f / l + 1) - c * a / l;
@@ -924,8 +924,8 @@ function Bn(t, n, e, r, o, i, u) {
 	for (let t = 1; t <= s; t++) N += c / (1 + h) ** (t - 1 + f / l);
 	return N + o / m - c * a / l;
 }
-function xn(t, n, e, r, o, i) {
-	const { N: u, A: s, E: a, DSC: l } = bn(t, n, o, i);
+function Bn(t, n, e, r, o, i) {
+	const { N: u, A: s, E: a, DSC: l } = wn(t, n, o, i);
 	if (Number.isNaN(u)) return NaN;
 	const f = l / a - 1, c = 1 + r / o, h = 100 * e / o;
 	let m = 0, N = 0;
@@ -938,101 +938,101 @@ function xn(t, n, e, r, o, i) {
 	const d = 100 / p;
 	return m += g * d, N += d, m / N / o;
 }
-var Rn = v({
+var xn = A({
 	COUPDAYBS: () => Cn,
-	COUPDAYS: () => En,
-	COUPDAYSNC: () => An,
-	COUPNCD: () => vn,
-	COUPNUM: () => Fn,
-	COUPPCD: () => Dn
+	COUPDAYS: () => Rn,
+	COUPDAYSNC: () => En,
+	COUPNCD: () => An,
+	COUPNUM: () => Dn,
+	COUPPCD: () => vn
 });
 function Cn(t, n, e, r = 0) {
-	const o = wn(t, n, e, r);
-	return yn(o.settlement, o.maturity, o.frequency, o.basis);
+	const o = In(t, n, e, r);
+	return dn(o.settlement, o.maturity, o.frequency, o.basis);
+}
+function Rn(t, n, e, r = 0) {
+	const o = In(t, n, e, r);
+	return Mn(o.settlement, o.maturity, o.frequency, o.basis);
 }
 function En(t, n, e, r = 0) {
-	const o = wn(t, n, e, r);
-	return In(o.settlement, o.maturity, o.frequency, o.basis);
+	const o = In(t, n, e, r);
+	return yn(o.settlement, o.maturity, o.frequency, o.basis);
 }
 function An(t, n, e, r = 0) {
-	const o = wn(t, n, e, r);
-	return Mn(o.settlement, o.maturity, o.frequency, o.basis);
+	const o = In(t, n, e, r);
+	return gn(o.settlement, o.maturity, o.frequency);
 }
 function vn(t, n, e, r = 0) {
-	const o = wn(t, n, e, r);
-	return pn(o.settlement, o.maturity, o.frequency);
+	const o = In(t, n, e, r);
+	return Nn(o.settlement, o.maturity, o.frequency);
 }
 function Dn(t, n, e, r = 0) {
-	const o = wn(t, n, e, r);
-	return gn(o.settlement, o.maturity, o.frequency);
-}
-function Fn(t, n, e, r = 0) {
-	const o = wn(t, n, e, r);
-	return dn(o.settlement, o.maturity, o.frequency);
+	const o = In(t, n, e, r);
+	return pn(o.settlement, o.maturity, o.frequency);
 }
-var Sn = v({
-	DATEDIF: () => Vn,
-	DAYS360: () => Pn,
-	YEARFRAC: () => Tn
+var Fn = A({
+	DATEDIF: () => Sn,
+	DAYS360: () => Tn,
+	YEARFRAC: () => Vn
 });
-function Vn(t, n, e) {
+function Sn(t, n, e) {
 	const r = Math.floor(t), o = Math.floor(n);
-	if (!tt(t) || !tt(n) || r > o) return NaN;
-	const i = B.getDateParts(r), u = B.getDateParts(o);
+	if (!J(t) || !J(n) || r > o) return NaN;
+	const i = b.getDateParts(r), u = b.getDateParts(o);
 	e = e.toLowerCase();
-	const s = u.year - i.year, a = u.month - i.month, l = u.day - i.day, f = a < 0 || 0 === a && l < 0, c = l < 0 ? -1 : 0, h = o - B.getSerialDate(u.year, u.month + c, i.day), m = (c + 12 * s + a) % 12;
+	const s = u.year - i.year, a = u.month - i.month, l = u.day - i.day, f = a < 0 || 0 === a && l < 0, c = l < 0 ? -1 : 0, h = o - b.getSerialDate(u.year, u.month + c, i.day), m = (c + 12 * s + a) % 12;
 	switch (e) {
 		case "y": return s - (f ? 1 : 0);
 		case "m": return 12 * s + a + c;
 		case "d": return o - r;
 		case "md": return h;
 		case "ym": return m;
-		case "yd": return B.getSerialDate(i.year, i.month + m, i.day) + h - r;
+		case "yd": return b.getSerialDate(i.year, i.month + m, i.day) + h - r;
 	}
 	return NaN;
 }
-function Tn(t, n, e = 0) {
-	const r = void 0 === e ? 0 : q(e), o = Math.trunc(r);
+function Vn(t, n, e = 0) {
+	const r = void 0 === e ? 0 : L(e), o = Math.trunc(r);
 	if (r < 0 || o > 4) return NaN;
-	const i = L(t);
-	if (!tt(i)) return NaN;
-	const u = L(n);
-	return tt(u) ? nt(i, u, o) : NaN;
-}
-function Pn(t, n, e = !1) {
-	if (!tt(t) || !tt(n)) return NaN;
-	const r = Math.floor(t), o = Math.floor(n);
-	return e ? (o >= r ? 1 : -1) * J(r, o, 4).days : function(t, n) {
-		const e = Z(t), r = Z(n), o = e.year, i = e.month;
+	const i = k(t);
+	if (!J(i)) return NaN;
+	const u = k(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;
 		let u = e.day, s = r.year, a = r.month, l = r.day;
-		return 2 === i ? 3 === Z(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), Q(o, i, u, s, a, l);
-	}(r, o);
-}
-var On = v({
-	AMORLINC: () => _n,
-	DB: () => Ln,
-	DDB: () => qn,
-	SLN: () => $n,
-	SYD: () => kn
+		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);
+	}(o, i);
+}
+var Pn = A({
+	AMORLINC: () => qn,
+	DB: () => kn,
+	DDB: () => Ln,
+	SLN: () => On,
+	SYD: () => $n
 });
-function $n(t, n, e) {
-	if (B.formatResults(xt(B.getRuntime())), 0 === e) throw x.BuiltIn.Div0;
+function On(t, n, e) {
+	if (b.formatResults(Bt(b.getRuntime())), 0 === e) throw B.BuiltIn.Div0;
 	return (t - n) / e;
 }
-function kn(t, n, e, r) {
-	if (B.formatResults(xt(B.getRuntime())), n < 0 || e <= 0 || r <= 0 || r > e) return NaN;
+function $n(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 x.BuiltIn.Div0;
+	if (!Number.isFinite(o)) throw B.BuiltIn.Div0;
 	return (t - n) * (e + 1 - r) / o;
 }
-function Ln(t, n, e, r, o = 12) {
-	if (B.formatResults(xt(B.getRuntime())), t < 0 || n < 0 || e <= 0 || r <= 0) return NaN;
+function kn(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);
 	if (i < 1 || i > 12) return NaN;
 	const u = Ct(e), s = Ct(r);
 	if (s > u + (i < 12 ? 1 : 0)) return NaN;
 	if (0 === t) return 0;
-	const a = Et(1 - Rt(n / t, 1 / e), 3);
+	const a = Rt(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,14 +1040,14 @@ function Ln(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 qn(t, n, e, r, o = 2) {
-	if (B.formatResults(xt(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 * Rt(1 - i, u);
+function Ln(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;
 	return Number.isFinite(a) ? (s - a < n && (a = s - n), Math.max(a, 0)) : NaN;
 }
-function _n(t, n, e, r, o, i, u = 0) {
-	const s = Bt(t, n, e, r, o, i, u);
+function qn(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 = a * c;
 	if (!Number.isFinite(N)) return 0;
@@ -1056,75 +1056,75 @@ function _n(t, n, e, r, o, i, u = 0) {
 	const d = Math.floor((g - p) / N);
 	return f <= d ? N : f === d + 1 ? (g - p) % N : 0;
 }
-var jn = v({
-	FVSCHEDULE: () => Un,
-	PDURATION: () => zn,
-	RRI: () => Yn
+var _n = A({
+	FVSCHEDULE: () => jn,
+	PDURATION: () => Yn,
+	RRI: () => Un
 });
-function Un(t, n) {
-	if (void 0 === t || void 0 === n) throw x.BuiltIn.NA;
-	let e = _(t);
-	const r = B.getArgs().getRawAt(1), o = r, i = !0 === o?.isIRange, u = i && 1 === o.size && !0 === o.isIReferenceRange;
-	if (!i || u) e *= 1 + _(i ? o.getValueAt(0, 0) ?? null : r);
+function jn(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;
+	if (!i || u) e *= 1 + q(i ? o.getValueAt(0, 0) ?? null : r);
 	else for (const t of n.values()) if (null != t) {
-		if (x.isError(t)) throw t;
-		if ("number" != typeof t) throw x.BuiltIn.Value;
+		if (B.isError(t)) throw t;
+		if ("number" != typeof t) throw B.BuiltIn.Value;
 		e *= 1 + t;
 	}
 	return Number.isFinite(e) ? e : 0;
 }
-function Yn(t, n, e) {
+function Un(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 = Rt(e / n, 1 / t) - 1;
+	const r = xt(e / n, 1 / t) - 1;
 	return Number.isFinite(r) ? r : NaN;
 }
-function zn(t, n, e) {
+function Yn(t, n, e) {
 	if (t <= 0 || n <= 0 || e <= 0) return NaN;
 	const r = Math.log(1 + t);
-	if (0 === r) throw x.BuiltIn.Div0;
+	if (0 === r) throw B.BuiltIn.Div0;
 	return (Math.log(e) - Math.log(n)) / r;
 }
-function Gn(t, n, e, r) {
+function zn(t, n, e, r) {
 	const o = t.map((t) => {
-		const n = L(t);
-		if (!tt(n)) throw x.BuiltIn.Num;
+		const n = k(t);
+		if (!J(n)) throw B.BuiltIn.Num;
 		return Math.floor(n);
-	}), i = n.map(_), u = Math.trunc(_(e));
-	if (1 !== u && 2 !== u && 4 !== u) throw x.BuiltIn.Num;
+	}), i = n.map(q), u = Math.trunc(q(e));
+	if (1 !== u && 2 !== u && 4 !== u) throw B.BuiltIn.Num;
 	return {
 		dates: o,
 		numbers: i,
 		frequency: u,
-		basis: ut(r)
+		basis: it(r)
 	};
 }
-var Hn = (t) => W(t.y, t.m, t.d);
+var Gn = (t) => H(t.y, t.m, t.d);
 function Xn(t, n, e) {
-	const r = H(t);
+	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, W(i, o, r ? G(i, o) : Math.min(t.d, G(i, o)));
+	return o = (o % 12 + 12) % 12 + 1, H(i, o, r ? z(i, o) : Math.min(t.d, z(i, o)));
 }
-var Wn = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d);
-function Kn(t, n) {
+var Hn = (t, n) => 360 * (n.y - t.y) + 30 * (n.m - t.m) + (n.d - t.d);
+function Wn(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), Wn(o, i)) : (H(o) && (o.d = 30), n && H(i) && (i.d = 30), Wn(o, i));
+		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));
 	};
 }
-function Zn(t, n, e, r, o) {
-	const i = 12 / r, u = X(e), s = Kn(o, !1), a = Kn(o, !0);
+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 (; Hn(l) > e;) l = K(l, -i);
-	if (Hn(l) < 1) throw x.BuiltIn.Num;
+	for (; Gn(l) > e;) l = W(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 x.BuiltIn.Num;
+	if (Xn(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 = K(g, i);
-		const r = Hn(g), o = a(N, r);
+		g = W(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;
 	}
 	return {
@@ -1133,21 +1133,21 @@ function Zn(t, n, e, r, o) {
 		DSC: m
 	};
 }
-function Qn(t, n, e, r, o, i) {
-	if (gn(r, n, o) !== r) throw x.BuiltIn.Num;
-	const u = 12 / o, s = dn(e, r, o);
-	if (Number.isNaN(s)) throw x.BuiltIn.Num;
+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);
+	if (Number.isNaN(s)) throw B.BuiltIn.Num;
 	const a = [r];
 	let l = X(r);
-	for (let t = 0; t < s; t++) l = K(l, -u), a.push(Hn(l));
-	if (a[a.length - 1] < 1) throw x.BuiltIn.Num;
-	const f = (t, n) => J(t, n, i).days, c = bn(t, r, o, i);
-	if (Number.isNaN(c.N)) throw x.BuiltIn.Num;
+	for (let t = 0; t < s; t++) l = W(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 x.BuiltIn.Num;
+	if (m === h) throw B.BuiltIn.Num;
 	if (m < h) {
-		const i = dn(t, n, o) - 1;
-		if (Number.isNaN(i)) throw x.BuiltIn.Num;
+		const i = pn(t, n, o) - 1;
+		if (Number.isNaN(i)) throw B.BuiltIn.Num;
 		return {
 			N: i,
 			A: f(e, t) / h,
@@ -1155,25 +1155,25 @@ function Qn(t, n, e, r, o, i) {
 			u: f(t, r) / h
 		};
 	}
-	const N = dn(r, n, o);
+	const N = pn(r, n, o);
 	let g = 0, p = 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;
 	}
-	const d = X(t), y = W(d.y, d.m, G(d.y, d.m)), M = y < r && pn(y - 1, r, o) === y, I = H(X(r)) && t !== y && !M ? 1 : 0;
+	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;
 	return {
 		N,
 		A: g,
 		DC: p,
-		u: c.N - 1 + I + (2 === i || 3 === i ? pn(t, r, o) - t : c.DSC) / h
+		u: c.N - 1 + I + (2 === i || 3 === i ? gn(t, r, o) - t : c.DSC) / h
 	};
 }
-var Jn = (t) => Number.isFinite(t) ? t : 0;
-function te(t, n, e) {
+var Qn = (t) => Number.isFinite(t) ? t : 0;
+function Jn(t, n, e) {
 	return (100 * t + (100 - n) / e) / ((100 + n) / 2 - (100 - n) / (4 * e));
 }
-function ne(t, n, e) {
+function te(t, n, e) {
 	let r = t;
 	for (let t = 0; t < 100; t++) {
 		const t = e(r);
@@ -1185,23 +1185,23 @@ function ne(t, n, e) {
 	}
 	return r;
 }
-var ee = v({
-	ODDFPRICE: () => oe,
-	ODDFYIELD: () => ie,
-	ODDLPRICE: () => ue,
-	ODDLYIELD: () => se
+var ne = A({
+	ODDFPRICE: () => re,
+	ODDFYIELD: () => oe,
+	ODDLPRICE: () => ie,
+	ODDLYIELD: () => ue
 });
-function re(t, n, e, r, o, i, u, s, a) {
-	const { N: l, A: f, DC: c, u: h } = Qn(t, n, e, r, s, a), m = i / s, N = 100 * o / s, g = Rt(1 + m, l + h);
-	if (!Number.isFinite(g)) throw x.BuiltIn.Num;
+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 / Rt(1 + m, t + h);
-	const d = u / g + N * c / Rt(1 + m, h) + p - N * f;
-	if (!Number.isFinite(d)) throw x.BuiltIn.Num;
+	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;
 }
-function oe(t, n, e, r, o, i, u, s, a = 0) {
-	const l = Gn([
+function re(t, n, e, r, o, i, u, s, a = 0) {
+	const l = zn([
 		t,
 		n,
 		e,
@@ -1211,11 +1211,11 @@ function oe(t, n, e, r, o, i, u, s, a = 0) {
 		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 x.BuiltIn.Num;
-	return re(f, c, h, m, N, g, p, l.frequency, l.basis);
+	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);
 }
-function ie(t, n, e, r, o, i, u, s, a = 0) {
-	const l = Gn([
+function oe(t, n, e, r, o, i, u, s, a = 0) {
+	const l = zn([
 		t,
 		n,
 		e,
@@ -1225,26 +1225,26 @@ function ie(t, n, e, r, o, i, u, s, a = 0) {
 		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 x.BuiltIn.Num;
-	Qn(f, c, h, m, l.frequency, l.basis);
-	const d = ne(te(N, g, et(f, c, l.basis)), (t) => {
+	if (!(h < f && f < m && m < c) || N < 0 || g <= 0 || p <= 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) => {
 		try {
-			return re(f, c, h, m, N, t, p, l.frequency, l.basis) - g;
+			return ee(f, c, h, m, N, t, p, l.frequency, l.basis) - g;
 		} catch {
 			return NaN;
 		}
 	}, (t) => function(t, n, e, r, o, i, u, s, a) {
-		const { N: l, DC: f, u: c } = Qn(t, n, e, r, s, a), h = 1 + i / s, m = 100 * o / s;
-		let N = -u * (l + c) / s / Rt(h, l + c + 1);
-		N += -m * f * c / s / Rt(h, c + 1);
-		for (let t = 1; t <= l; t++) N += -m * (t + c) / s / Rt(h, t + c + 1);
+		const { N: l, DC: f, u: c } = Zn(t, n, e, r, s, a), h = 1 + i / s, m = 100 * o / s;
+		let N = -u * (l + c) / s / xt(h, l + c + 1);
+		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 x.BuiltIn.Num;
+	if (!Number.isFinite(d)) throw B.BuiltIn.Num;
 	return d;
 }
-function ue(t, n, e, r, o, i, u, s = 0) {
-	const a = Gn([
+function ie(t, n, e, r, o, i, u, s = 0) {
+	const a = zn([
 		t,
 		n,
 		e
@@ -1253,12 +1253,12 @@ function ue(t, n, e, r, o, i, u, s = 0) {
 		o,
 		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 x.BuiltIn.Num;
-	const { A: g, DC: p, DSC: d } = Zn(l, f, c, a.frequency, a.basis), y = 100 * h / a.frequency;
-	return (N + Jn(y * p)) / (1 + m / a.frequency * d) - Jn(y * g);
+	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);
 }
-function se(t, n, e, r, o, i, u, s = 0) {
-	const a = Gn([
+function ue(t, n, e, r, o, i, u, s = 0) {
+	const a = zn([
 		t,
 		n,
 		e
@@ -1267,147 +1267,136 @@ function se(t, n, e, r, o, i, u, s = 0) {
 		o,
 		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 x.BuiltIn.Num;
-	const { A: g, DC: p, DSC: d } = Zn(l, f, c, a.frequency, a.basis), y = 100 * h / a.frequency, M = N + Jn(y * p), I = m + Jn(y * g);
+	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);
 }
-var ae = v({ STOCKHISTORY: () => le });
-function le(t, n, e, r = 0, o = 1, i = [
-	0,
-	1,
-	2,
-	3,
-	4
-]) {
-	const u = e ?? n;
-	if (!B.isValidDate(n) || !B.isValidDate(u)) throw x.BuiltIn.Num;
-}
-var fe = v({
-	DURATION: () => he,
-	MDURATION: () => me,
-	PRICE: () => ce,
-	YIELD: () => Ne
+var se = A({
+	DURATION: () => le,
+	MDURATION: () => fe,
+	PRICE: () => ae,
+	YIELD: () => ce
 });
-function ce(t, n, e, r, o, i, u = 0) {
-	const s = ct(t, n, [
+function ae(t, n, e, r, o, i, u = 0) {
+	const s = ft(t, n, [
 		e,
 		r,
 		o
 	], i, u), [a, l, f] = s.numbers;
-	if (a < 0 || l < 0 || f <= 0) throw x.BuiltIn.Num;
-	return Bn(s.settlement, s.maturity, a, l, f, s.frequency, s.basis);
+	if (a < 0 || l < 0 || f <= 0) throw B.BuiltIn.Num;
+	return bn(s.settlement, s.maturity, a, l, f, s.frequency, s.basis);
 }
-function he(t, n, e, r, o, i = 0) {
-	const u = ct(t, n, [e, r], o, i, !0), [s, a] = u.numbers;
-	if (s < 0 || a < 0) throw x.BuiltIn.Num;
-	return xn(u.settlement, u.maturity, s, a, u.frequency, u.basis);
+function le(t, n, e, r, o, i = 0) {
+	const u = ft(t, n, [e, r], o, i, !0), [s, a] = u.numbers;
+	if (s < 0 || a < 0) throw B.BuiltIn.Num;
+	return Bn(u.settlement, u.maturity, s, a, u.frequency, u.basis);
 }
-function me(t, n, e, r, o, i = 0) {
-	const u = ct(t, n, [e, r], o, i, !0), [s, a] = u.numbers;
-	if (s < 0 || a < 0) throw x.BuiltIn.Num;
-	return xn(u.settlement, u.maturity, s, a, u.frequency, u.basis) / (1 + a / u.frequency);
+function fe(t, n, e, r, o, i = 0) {
+	const u = ft(t, n, [e, r], o, i, !0), [s, a] = u.numbers;
+	if (s < 0 || a < 0) throw B.BuiltIn.Num;
+	return Bn(u.settlement, u.maturity, s, a, u.frequency, u.basis) / (1 + a / u.frequency);
 }
-function Ne(t, n, e, r, o, i, u = 0) {
-	const s = ct(t, n, [
+function ce(t, n, e, r, o, i, u = 0) {
+	const s = ft(t, n, [
 		e,
 		r,
 		o
 	], i, u), [a, l, f] = s.numbers;
-	if (a < 0 || l <= 0 || f <= 0) throw x.BuiltIn.Num;
-	const { settlement: c, maturity: h, frequency: m, basis: N } = s, g = bn(c, h, m, N);
-	if (Number.isNaN(g.N)) throw x.BuiltIn.Num;
+	if (a < 0 || l <= 0 || f <= 0) throw B.BuiltIn.Num;
+	const { settlement: c, maturity: h, frequency: m, basis: N } = s, g = wn(c, h, m, N);
+	if (Number.isNaN(g.N)) throw B.BuiltIn.Num;
 	if (g.N > 1) {
-		const t = ne(te(a, l, et(c, h, N)), (t) => Bn(c, h, a, t, f, m, N) - l, (t) => function(t, n, e, r, o, i, u) {
-			const { N: s, A: a, E: l, DSC: f } = bn(t, n, i, u);
+		const t = te(Jn(a, l, nt(c, h, N)), (t) => bn(c, h, a, t, f, m, N) - l, (t) => function(t, n, e, r, o, i, u) {
+			const { N: s, A: a, E: l, DSC: f } = wn(t, n, i, u);
 			if (Number.isNaN(s)) return NaN;
 			const c = 100 * e / i, h = 1 + r / i;
 			let m = -o * (s - 1 + f / l) / i / h ** (s + f / l);
 			for (let t = 1; t <= s; t++) m += -c * (t - 1 + f / l) / i / h ** (t + f / l);
 			return m;
 		}(c, h, a, t, f, m, N));
-		if (Number.isNaN(t)) throw x.BuiltIn.Num;
+		if (Number.isNaN(t)) throw B.BuiltIn.Num;
 		return t;
 	}
-	const p = g.A, d = J(c, h, N).days, y = 1 === N || 2 === N || 3 === N ? p + d : g.E, M = l / 100 + p / y * (a / m);
-	return ht((f / 100 + a / m - M) / M * m * (y / d));
-}
-var ge = v({
-	DISC: () => pe,
-	INTRATE: () => Me,
-	PRICEDISC: () => de,
-	PRICEMAT: () => we,
-	RECEIVED: () => Ie,
-	YIELDDISC: () => ye,
-	YIELDMAT: () => be
+	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));
+}
+var he = A({
+	DISC: () => me,
+	INTRATE: () => pe,
+	PRICEDISC: () => Ne,
+	PRICEMAT: () => ye,
+	RECEIVED: () => de,
+	YIELDDISC: () => ge,
+	YIELDMAT: () => Me
 });
-function pe(t, n, e, r, o = 0) {
-	const i = at(t, n, e, r, o), u = (1 - i.x / i.y) / nt(i.settlement, i.maturity, i.basis);
+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);
 	return Number.isFinite(u) ? u : NaN;
 }
-function de(t, n, e, r, o = 0) {
-	const i = at(t, n, e, r, o), u = i.y - i.x * i.y * nt(i.settlement, i.maturity, i.basis);
+function Ne(t, n, e, r, o = 0) {
+	const i = st(t, n, e, r, o), u = i.y - i.x * i.y * tt(i.settlement, i.maturity, i.basis);
 	return Number.isFinite(u) ? u : NaN;
 }
-function ye(t, n, e, r, o = 0) {
-	const i = at(t, n, e, r, o), u = (i.y - i.x) / i.x / nt(i.settlement, i.maturity, i.basis);
+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 Me(t, n, e, r, o = 0) {
-	const i = at(t, n, e, r, o), u = (i.y - i.x) / i.x / nt(i.settlement, i.maturity, i.basis);
+function pe(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 Ie(t, n, e, r, o = 0) {
-	const i = at(t, n, e, r, o), u = 1 - i.y * nt(i.settlement, i.maturity, i.basis);
-	if (!(u > 0)) throw x.BuiltIn.Num;
+function de(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 we(t, n, e, r, o, i = 0) {
-	const u = ft(t, n, e, r, o, i);
-	if (u.rate < 0 || u.x < 0) throw x.BuiltIn.Num;
-	return (100 + ht(u.DIM / u.B * u.rate * 100)) / (1 + u.DSM / u.B * u.x) - ht(u.A / u.B * u.rate * 100);
+function ye(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 be(t, n, e, r, o, i = 0) {
-	const u = ft(t, n, e, r, o, i);
-	if (u.rate < 0 || u.x <= 0) throw x.BuiltIn.Num;
+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 ((1 + u.DIM / u.B * u.rate) / (u.x / 100 + u.A / u.B * u.rate) - 1) / (u.DSM / u.B);
 }
-var Be = v({
-	TBILLEQ: () => Ce,
-	TBILLPRICE: () => xe,
-	TBILLYIELD: () => Re
+var Ie = A({
+	TBILLEQ: () => Be,
+	TBILLPRICE: () => we,
+	TBILLYIELD: () => be
 });
-function xe(t, n, e) {
-	const r = lt(t, n, e), o = 100 * (1 - ht(r.x * r.days) / 360);
-	if (o < 0) throw x.BuiltIn.Num;
+function we(t, n, e) {
+	const r = at(t, n, e), o = 100 * (1 - ct(r.x * r.days) / 360);
+	if (o < 0) throw B.BuiltIn.Num;
 	return o;
 }
-function Re(t, n, e) {
-	const r = lt(t, n, e);
+function be(t, n, e) {
+	const r = at(t, n, e);
 	return (100 - r.x) / r.x * 360 / r.days;
 }
-function Ce(t, n, e) {
-	const r = lt(t, n, e), o = ht(r.x * r.days);
+function Be(t, n, e) {
+	const r = at(t, n, e), o = ct(r.x * r.days);
 	if (r.days <= 182) {
 		const t = 360 - o;
-		if (!(t > 0)) throw x.BuiltIn.Num;
-		return ht(365 * r.x) / t;
+		if (!(t > 0)) throw B.BuiltIn.Num;
+		return ct(365 * r.x) / t;
 	}
 	const i = 1 - o / 360;
-	if (!(i > 0)) throw x.BuiltIn.Num;
+	if (!(i > 0)) throw B.BuiltIn.Num;
 	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 Ee = v({ VDB: () => ve }), Ae = 1e7;
-function ve(t, n, e, r, o, i = 2, u = !1) {
-	if (B.formatResults(xt(B.getRuntime())), t < 0 || n < 0 || e < 0 || i < 0 || r < 0 || o > e || r > o) return NaN;
-	if (0 === e) throw x.BuiltIn.Div0;
+var xe = A({ VDB: () => Re }), Ce = 1e7;
+function Re(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;
 	const s = i / e;
 	if (u) return function(t, n, e, r, o, i) {
 		const u = Math.floor(r) + 1, s = Math.ceil(o);
 		let a = 0;
 		for (let e = u; e <= s; e++) {
-			let f = De(1 === e ? t : t * Rt(1 - i, e - 1), i, n);
+			let f = Ee(1 === e ? t : t * xt(1 - i, e - 1), i, n);
 			if (Number.isNaN(f)) return NaN;
 			f = Math.max(f, 0), e === u ? f *= Math.min(o, u) - r : e === s && (f *= o - (s - 1)), a += f;
 		}
@@ -1417,7 +1406,7 @@ function ve(t, n, e, r, o, i = 2, u = !1) {
 		const i = Math.floor(o), u = o - i;
 		let s = t, a = !1, l = 0;
 		if (u > 0) {
-			const t = De(s, r, n);
+			const t = Ee(s, r, n);
 			if (Number.isNaN(t)) return NaN;
 			let o;
 			if (l = (s - n) / e, l > t && l > 0) o = l * u;
@@ -1427,12 +1416,12 @@ function ve(t, n, e, r, o, i = 2, u = !1) {
 			}
 			s -= o;
 		}
-		if (i > Ae) return s * Rt(1 - r, i);
+		if (i > Ce) return s * xt(1 - r, i);
 		for (let t = 1; t <= i; t++) {
 			let o;
 			if (a) o = l;
 			else {
-				if (o = De(s, r, n), Number.isNaN(o)) return NaN;
+				if (o = Ee(s, r, n), Number.isNaN(o)) return NaN;
 				l = (s - n) / (e - (u + t - 1)), l > o && l > 0 && (a = !0, o = l);
 			}
 			s -= o;
@@ -1446,7 +1435,7 @@ function ve(t, n, e, r, o, i = 2, u = !1) {
 			let f;
 			if (s) f = a;
 			else {
-				if (f = De(t, r, n), Number.isNaN(f)) return NaN;
+				if (f = Ee(t, r, n), Number.isNaN(f)) return NaN;
 				a = (t - n) / (e - (l - 1)), a > f && a > 0 && (s = !0, f = a);
 			}
 			u += l === i ? f * (o - (i - 1)) : f, t -= f;
@@ -1454,25 +1443,25 @@ function ve(t, n, e, r, o, i = 2, u = !1) {
 		return u;
 	}(a, n, e - r, s, o - r);
 }
-var De = (t, n, e) => {
+var Ee = (t, n, e) => {
 	const r = t * n;
 	return Number.isFinite(r) ? t - r < e ? t - e : r : NaN;
 };
-var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
+var Ae = () => B.BuiltIn.Value, ve = (t, n) => {
 	let e, r = !1;
 	if (!0 === t?.isIFunction) e = [t];
 	else {
-		if (!0 !== t?.isIRange) return Fe();
+		if (!0 !== t?.isIRange) return Ae();
 		{
 			const n = t, o = n.getRowCount();
-			if (o > 1 && n.getColumnCount() > 1) return Fe();
+			if (o > 1 && n.getColumnCount() > 1) return Ae();
 			r = o > 1, e = [];
 			for (const t of n.entries()) {
 				const n = t.value;
-				if (!0 !== n?.isIFunction) return Fe();
+				if (!0 !== n?.isIFunction) return Ae();
 				e.push(n);
 			}
-			if (0 === e.length || e.length !== n.size) return Fe();
+			if (0 === e.length || e.length !== n.size) return Ae();
 		}
 	}
 	const o = [], i = (t, n) => {
@@ -1511,37 +1500,37 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 		measures: o,
 		vertical: r,
 		named: e.length > 1
-	} : Fe();
-}, Ve = (t, n, e) => {
+	} : Ae();
+}, De = (t, n, e) => {
 	let r;
 	try {
 		r = t.twoArgs ? t.fn.execute(n, e()) : t.fn.execute(n);
 	} catch (t) {
-		if (x.isError(t)) return 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) : Fe();
+		return !0 === t.isIReferenceRange && 1 === t.size ? t.getValueAt(0, 0) : Ae();
 	}
 	return r ?? null;
-}, Te = (t, n) => {
+}, Fe = (t, n) => {
 	let e = t;
-	if (void 0 === e) e = Oe(n) ? 1 : 0;
-	else if (!Number.isInteger(e) || e < 0 || e > 3) return Fe();
+	if (void 0 === e) e = Ve(n) ? 1 : 0;
+	else if (!Number.isInteger(e) || e < 0 || e > 3) return Ae();
 	return {
 		hasHeader: 1 === e || 3 === e,
 		show: 2 === e || 3 === e
 	};
-}, Pe = (t) => x.isError(t) ? "error" : typeof t, Oe = (t) => {
+}, Se = (t) => B.isError(t) ? "error" : typeof t, Ve = (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 && Pe(n) !== Pe(r)) return !0;
+		if (null !== n && null !== r && Se(n) !== Se(r)) return !0;
 	}
 	return !1;
-}, $e = (t, n) => Number.isInteger(t) && Math.abs(t) <= n, ke = (t, n, e) => {
+}, Te = (t, n) => Number.isInteger(t) && Math.abs(t) <= n, Pe = (t, n, e) => {
 	const r = new Array(n).fill(1);
 	if (!t) return {
 		keyDirections: r,
@@ -1550,11 +1539,11 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 	const o = [];
 	for (const r of t.entries()) {
 		const t = r.value;
-		if ("number" != typeof t || !Number.isInteger(t) || 0 === t) return Fe();
-		if (Math.abs(t) > n + e) return Fe();
+		if ("number" != typeof t || !Number.isInteger(t) || 0 === t) return Ae();
+		if (Math.abs(t) > n + e) return Ae();
 		o.push(t);
 	}
-	if (o.length !== t.size) return Fe();
+	if (o.length !== t.size) return Ae();
 	if (1 === o.length && Math.abs(o[0]) > n) return {
 		keyDirections: r,
 		byValue: {
@@ -1562,25 +1551,25 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 			direction: Math.sign(o[0])
 		}
 	};
-	if (o.length > n) return Fe();
+	if (o.length > n) return Ae();
 	const i = /* @__PURE__ */ new Set();
 	for (const t of o) {
 		const e = Math.abs(t);
-		if (e > n || i.has(e)) return Fe();
+		if (e > n || i.has(e)) return Ae();
 		i.add(e), r[e - 1] = Math.sign(t);
 	}
 	return {
 		keyDirections: r,
 		byValue: null
 	};
-}, Le = (t) => 1 === t.size && !0 === t.isIReferenceRange && null === t.getValueAt(0, 0), qe = (t, n) => {
+}, Oe = (t) => 1 === t.size && !0 === t.isIReferenceRange && null === t.getValueAt(0, 0), $e = (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;
-}, _e = class {
+}, 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++) {
@@ -1590,7 +1579,7 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 				colStart: 0,
 				colEnd: n
 			});
-			u[n] = s, i[n] = B.createGrouping(s, o);
+			u[n] = s, i[n] = b.createGrouping(s, o);
 		}
 		let s = [];
 		const a = [];
@@ -1617,7 +1606,7 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 		return null === n ? this.groupings[this.fieldCount - 1].getMembers(t) : this.groupings[n.level].getMembers(t, [n.group]);
 	}
 	sort(t, n, e) {
-		const r = (n, e, r) => je(n.keys[r], e.keys[r], t.keyDirections[r]), o = t.byValue, i = (t, e) => Ue(n(t), n(e), o.direction);
+		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);
@@ -1676,10 +1665,10 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 		}
 		return e;
 	}
-}, je = (t, n, e) => null === t || null === n ? t === n ? 0 : null === t ? 1 : -1 : e * B.compare(t, n), Ue = (t, n, e) => {
-	const r = x.isError(t), o = x.isError(n);
-	return r || o ? r && o ? 0 : r ? 1 : -1 : e * B.compare(t, n);
-}, Ye = (t) => `Row Field ${t + 1}`, ze = (t) => `Column Field ${t + 1}`, Ge = (t) => `Value ${t + 1}`, He = (t) => {
+}, Le = (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) => {
 	const n = t.getColumnCount();
 	if (1 === n) return [t];
 	const e = t.getRowCount(), r = new Array(n);
@@ -1690,45 +1679,45 @@ var Fe = () => x.BuiltIn.Value, Se = (t, n) => {
 		colEnd: o
 	});
 	return r;
-}, Xe = (t) => t.slice({
+}, ze = (t) => t.slice({
 	rowStart: 1,
 	rowEnd: t.getRowCount() - 1,
 	colStart: 0,
 	colEnd: t.getColumnCount() - 1
-}), We = v({ GROUPBY: () => Ke });
-function Ke(t, n, e, r, o = 1, i, u, s = 0) {
-	if (t.getRowCount() !== n.getRowCount() || Le(n)) return x.BuiltIn.Value;
-	const a = Se(e, n.getColumnCount());
-	if (x.isError(a)) return a;
-	const l = Te(r, n);
-	if (x.isError(l)) return l;
+}), 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());
+	if (B.isError(a)) return a;
+	const l = Fe(r, n);
+	if (B.isError(l)) return l;
 	const f = t.getColumnCount(), c = o;
-	if (!$e(c, f)) return x.BuiltIn.Value;
-	if (0 !== s && 1 !== s) return x.BuiltIn.Value;
+	if (!Te(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 x.BuiltIn.Value;
-	if (u && !qe(u, t.getRowCount())) return x.BuiltIn.Value;
-	const { measures: m, vertical: N } = a, g = n.getColumnCount(), p = ke(i, f, N ? g : m.length);
-	if (x.isError(p)) return p;
+	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 (l.hasHeader) {
-		if (d.getRowCount() < 2) return x.BuiltIn.Value;
-		I = Ze(d), w = Ze(y), d = Xe(d), y = Xe(y), M && (M = Xe(M));
+		if (d.getRowCount() < 2) return B.BuiltIn.Value;
+		I = He(d), w = He(y), d = ze(d), y = ze(y), M && (M = ze(M));
 	}
-	const b = new _e(d, M);
-	if (0 === b.getRecordCount()) return x.BuiltIn.Value;
-	const R = He(y), C = new Array(R.length), E = /* @__PURE__ */ new Map(), A = (t) => {
+	const x = new ke(d, M);
+	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 ? R.map((t, n) => n) : [n.column]).map((e) => Ve(n, b.getMembers(R[e], t), ((t) => () => C[t] ??= b.getMembers(R[t], null))(e)))), E.set(t, n), n);
-	}, v = p.byValue, D = b.sort(p, (t) => N ? A(t)[0][v.measure] : A(t)[v.measure][0], h), F = h ? Je(D, c) : b.lines(D, c), S = [];
+		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 = [];
 	if (N) {
 		l.show && S.push([
-			...Qe(I, f),
+			...We(I, f),
 			"",
-			...R.map((t, n) => w ? w[n] : Ge(n))
+			...C.map((t, n) => w ? w[n] : Ue(n))
 		]);
 		for (const t of F) {
-			const n = b.keyCells(t, c), e = A(t.node);
+			const n = x.keyCells(t, c), e = A(t.node);
 			for (let t = 0; t < m.length; t++) S.push([
 				...n,
 				m[t].label,
@@ -1736,24 +1725,24 @@ function Ke(t, n, e, r, o = 1, i, u, s = 0) {
 			]);
 		}
 	} else {
-		a.named && S.push([...new Array(f).fill(""), ...m.map((t) => t.label)]), l.show && S.push([...Qe(I, f), ...m.map((t) => w ? w[t.column] : Ge(t.column))]);
+		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 = b.keyCells(t, c);
+			const n = x.keyCells(t, c);
 			for (const e of A(t.node)) n.push(e[0]);
 			S.push(n);
 		}
 	}
-	return B.createRange(S.length, S[0].length, S);
+	return b.createRange(S.length, S[0].length, S);
 }
-var Ze = (t) => {
+var He = (t) => {
 	const n = t.getColumnCount(), e = new Array(n);
 	for (let r = 0; r < n; r++) e[r] = t.getValueAt(0, r);
 	return e;
-}, Qe = (t, n) => {
+}, We = (t, n) => {
 	const e = new Array(n);
-	for (let r = 0; r < n; r++) e[r] = t ? t[r] : Ye(r);
+	for (let r = 0; r < n; r++) e[r] = t ? t[r] : _e(r);
 	return e;
-}, Je = (t, n) => {
+}, Ke = (t, n) => {
 	const e = t.map((t) => ({
 		kind: "group",
 		node: t
@@ -1765,36 +1754,36 @@ var Ze = (t) => {
 		kind: "total",
 		node: null
 	}), e;
-}, tr = v({ PIVOTBY: () => nr });
-function nr(t, n, e, r, o, i = 1, u, s = 1, a, l, f = 0) {
+}, Ze = A({ 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 || Le(e)) return x.BuiltIn.Value;
-	if (t && t.getRowCount() !== c) return x.BuiltIn.Value;
-	if (n && n.getRowCount() !== c) return x.BuiltIn.Value;
-	const h = Se(r, e.getColumnCount());
-	if (x.isError(h)) return h;
-	const m = Te(o, e);
-	if (x.isError(m)) return m;
+	if (!t && !n || Oe(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());
+	if (B.isError(h)) return h;
+	const m = Fe(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 && !$e(p, N)) return x.BuiltIn.Value;
-	if (n && !$e(d, g)) return x.BuiltIn.Value;
-	if (h.vertical && Math.abs(p) > 1) return x.BuiltIn.Value;
-	if (!Number.isInteger(f) || f < 0 || f > 4) return x.BuiltIn.Value;
-	if (l && !qe(l, c)) return x.BuiltIn.Value;
-	const { measures: y, vertical: M } = h, I = e.getColumnCount(), w = M ? I : y.length, b = ke(u, N, w);
-	if (x.isError(b)) return b;
-	const R = ke(a, g, w);
-	if (x.isError(R)) return R;
-	let C = t, E = n, A = e, v = l, D = null, F = null, S = null;
+	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;
+	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 (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;
 	if (m.hasHeader) {
-		if (c < 2) return x.BuiltIn.Value;
-		C && (D = er(C), C = Xe(C)), E && (F = er(E), E = Xe(E)), S = er(A), A = Xe(A), v && (v = Xe(v));
+		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));
 	}
-	const V = C ? new _e(C, v) : null, T = E ? new _e(E, v) : null;
-	if (0 === (V ?? T).getRecordCount()) return x.BuiltIn.Value;
-	const O = new rr(V, T, He(A), v), $ = (t, n, e, r) => {
+	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 ? Ve(e, o, () => {
+		return o ? De(e, o, () => {
 			switch (f) {
 				case 0: return O.members(null, n, r);
 				case 1: return O.members(t, null, r);
@@ -1806,7 +1795,7 @@ function nr(t, n, e, r, o, i = 1, u, s = 1, a, l, f = 0) {
 	}, k = (t) => (n, e) => M ? $(n, e, y[0], t.measure) : $(n, e, y[t.measure], y[t.measure].column), L = [{
 		kind: "total",
 		node: null
-	}], q = V ? V.lines(V.sort(b, (t) => k(b.byValue)(t, null), !1), p) : L, _ = T ? T.lines(T.sort(R, (t) => k(R.byValue)(null, t), !1), d) : L, j = [];
+	}], 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({
 		line: t,
 		measure: -1,
@@ -1820,7 +1809,7 @@ function nr(t, n, e, r, o, i = 1, u, s = 1, a, l, f = 0) {
 	const U = !!T && !h.named && I > 1, Y = N + (M ? 1 : 0), z = () => new Array(Y).fill(""), G = [];
 	if (m.show && T) {
 		const t = [];
-		for (let n = 0; n < g; n++) t.push(F ? String(F[n] ?? "") : ze(n));
+		for (let n = 0; n < g; n++) t.push(F ? String(F[n] ?? "") : je(n));
 		G.push([
 			...z(),
 			t.join(", "),
@@ -1833,26 +1822,26 @@ function nr(t, n, e, r, o, i = 1, u, s = 1, a, l, f = 0) {
 	}
 	if (h.named && !M && G.push([...z(), ...j.map((t) => y[t.measure].label)]), m.show) {
 		const t = [];
-		for (let n = 0; n < N; n++) t.push(D ? D[n] : Ye(n));
-		M && t.push(""), G.push([...t, ...j.map((t) => S ? S[t.column] : Ge(t.column))]);
+		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))]);
 	}
-	const H = (t, n) => j.map((e) => U && "group" !== e.line.kind ? "" : $(t, e.line.node, n ?? y[e.measure], e.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([
 			...n,
 			e.label,
-			...H(t.node, e)
+			...X(t.node, e)
 		]);
-		else G.push([...n, ...H(t.node, null)]);
+		else G.push([...n, ...X(t.node, null)]);
 	}
-	return B.createRange(G.length, G[0].length, G);
+	return b.createRange(G.length, G[0].length, G);
 }
-var er = (t) => {
+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;
-}, rr = class {
+}, tr = class {
 	constructor(t, n, e, r) {
 		this._rows = t, this._cols = n, this._columns = e, this._filter = r, this._crossed = /* @__PURE__ */ new Map();
 	}
@@ -1868,7 +1857,7 @@ var er = (t) => {
 		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], R.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();
+		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);
@@ -1878,35 +1867,35 @@ var er = (t) => {
 			groupOf: c
 		}, this._crossed.set(e, r), r;
 	}
-}, or = v({
-	FORECAST_ETS: () => ir,
-	FORECAST_ETS_CONFINT: () => ur,
-	FORECAST_ETS_SEASONALITY: () => sr,
-	FORECAST_ETS_STAT: () => ar
+}, nr = A({
+	FORECAST_ETS: () => er,
+	FORECAST_ETS_CONFINT: () => rr,
+	FORECAST_ETS_SEASONALITY: () => or,
+	FORECAST_ETS_STAT: () => ir
 });
-function ir(t, n, e, r = 1, o = 1, i = 1) {
-	const u = hr(n, e, o, i);
-	if (x.isError(u)) return u;
+function er(t, n, e, r = 1, o = 1, i = 1) {
+	const u = lr(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 x.BuiltIn.Num;
+	if ((t - f) / a <= -.999) return B.BuiltIn.Num;
 	const c = (t - l) / a;
-	if (c > 2147483647) return x.BuiltIn.Num;
-	const h = gr(s, r);
-	if (x.isError(h)) return h;
-	const { alpha: m, beta: N, gamma: g, period: p, b0: d } = h, { L: y, T: M, S: I, finalIndex: w } = Nr(s, m, N, g, p, d).finalState;
+	if (c > 2147483647) return B.BuiltIn.Num;
+	const h = hr(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;
 }
-function ur(t, n, e, r = .95, o = 1, i = 1, u = 1) {
-	if (r < 0 || r >= 1) return x.BuiltIn.Num;
-	const s = hr(n, e, i, u);
-	if (x.isError(s)) return s;
+function rr(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);
+	if (B.isError(s)) return s;
 	const { values: a, stepSize: l, lastTime: f } = s;
-	if (t <= f) return x.BuiltIn.Num;
+	if (t <= f) return B.BuiltIn.Num;
 	const c = Math.round((t - f) / l);
-	if (c > 2147483647) return x.BuiltIn.Num;
-	const h = gr(a, o);
-	if (x.isError(h)) return h;
+	if (c > 2147483647) return B.BuiltIn.Num;
+	const h = hr(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 u = t.length;
 		let s, a;
@@ -1938,27 +1927,27 @@ function ur(t, n, e, r = .95, o = 1, i = 1, u = 1) {
 		return i;
 	}(m, g, p, c);
 	return function(t) {
-		const n = (1 + t) / 2, e = B.getFunction("NORM.S.INV");
+		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);
 }
-function sr(t, n, e = 1, r = 1) {
-	const o = hr(t, n, e, r);
-	if (x.isError(o)) return o;
+function or(t, n, e = 1, r = 1) {
+	const o = lr(t, n, e, r);
+	if (B.isError(o)) return o;
 	const { values: i } = o;
-	return i.length < 4 ? 0 : mr(i);
+	return i.length < 4 ? 0 : fr(i);
 }
-function ar(t, n, e, r = 1, o = 1, i = 1) {
-	const u = fr(e);
-	if (null === u || u < 1 || u > 8) return x.BuiltIn.Num;
-	const s = hr(t, n, o, i);
-	if (x.isError(s)) return s;
+function ir(t, n, e, r = 1, o = 1, i = 1) {
+	const u = sr(e);
+	if (null === u || u < 1 || u > 8) return B.BuiltIn.Num;
+	const s = lr(t, n, o, i);
+	if (B.isError(s)) return s;
 	const { values: a, stepSize: l } = s;
 	if (8 === u) return l;
-	const f = gr(a, r);
-	if (x.isError(f)) return f;
+	const f = hr(a, r);
+	if (B.isError(f)) return f;
 	const { alpha: c, beta: h, gamma: m, period: N, b0: g } = f;
 	switch (u) {
 		case 1: return c;
@@ -1999,9 +1988,9 @@ function ar(t, n, e, r = 1, o = 1, i = 1) {
 			if (7 === u) return t.rmse;
 		}
 	}
-	return x.BuiltIn.Num;
+	return B.BuiltIn.Num;
 }
-function lr(t, n) {
+function ur(t, n) {
 	const e = t.map((t) => t.value);
 	switch (n) {
 		case 1: return e.reduce((t, n) => t + n, 0) / e.length;
@@ -2017,44 +2006,44 @@ function lr(t, n) {
 		default: return e.reduce((t, n) => t + n, 0);
 	}
 }
-function fr(t) {
+function sr(t) {
 	return Number.isInteger(t) ? t : null;
 }
-var cr = 8784;
-function hr(t, n, e, r) {
-	const o = fr(e);
-	if (0 !== o && 1 !== o) return x.BuiltIn.Num;
-	const i = fr(r);
-	if (null === i || i < 1 || i > 7) return x.BuiltIn.Num;
+var ar = 8784;
+function lr(t, n, e, r) {
+	const o = sr(e);
+	if (0 !== o && 1 !== o) return B.BuiltIn.Num;
+	const i = sr(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 x.BuiltIn.NA;
+	if (u.getRowCount() !== s.getRowCount()) return B.BuiltIn.NA;
 	if (t.hasError()) return t.firstError();
 	if (n.hasError()) return n.firstError();
-	if (u.getRowCount() < 2) return x.BuiltIn.Div0;
+	if (u.getRowCount() < 2) return B.BuiltIn.Div0;
 	const a = [];
 	for (const [[t, n]] of u.alignValues([s])) "number" == typeof t && "number" == typeof n && a.push({
 		time: n,
 		value: t
 	});
-	if (a.sort((t, n) => t.time - n.time), a.length < 2) return x.BuiltIn.Div0;
+	if (a.sort((t, n) => t.time - n.time), a.length < 2) return B.BuiltIn.Div0;
 	const l = [];
 	let f = [a[0]];
 	for (let t = 1; t < a.length; t++) {
 		const n = a[t];
 		n.time === a[t - 1].time ? f.push(n) : (l.push({
 			time: f[0].time,
-			value: lr(f, i)
+			value: ur(f, i)
 		}), f = [n]);
 	}
 	if (l.push({
 		time: f[0].time,
-		value: lr(f, i)
-	}), l.length < 2) return x.BuiltIn.Div0;
+		value: ur(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);
 	c.sort((t, n) => t - n);
 	const h = Math.floor(c.length / 2), m = c.length % 2 != 0 ? c[h] : (c[h - 1] + c[h]) / 2;
-	if (m <= 0) return x.BuiltIn.Num;
+	if (m <= 0) return B.BuiltIn.Num;
 	const N = [l[0].value];
 	for (let t = 1; t < l.length; t++) {
 		const n = l[t - 1].time, e = l[t].time, r = n + m;
@@ -2065,7 +2054,7 @@ function hr(t, n, e, r) {
 				const e = l[t - 1].value, o = l[t].value;
 				N.push(e + n / (r + 1) * (o - e));
 			}
-		} else if (Math.abs(e - r) > .01 * m) return x.BuiltIn.Num;
+		} else if (Math.abs(e - r) > .01 * m) return B.BuiltIn.Num;
 		N.push(l[t].value);
 	}
 	return {
@@ -2075,7 +2064,7 @@ function hr(t, n, e, r) {
 		firstTime: l[0].time
 	};
 }
-function mr(t) {
+function fr(t) {
 	const n = t.length;
 	if (n < 4) return 0;
 	const e = t.reduce((t, n) => t + n, 0) / n;
@@ -2092,7 +2081,7 @@ function mr(t) {
 	}
 	return i;
 }
-function Nr(t, n, e, r, o, i) {
+function cr(t, n, e, r, o, i) {
 	const u = t.length;
 	let s, a;
 	if (o > 1 && u >= 2 * o) {
@@ -2127,16 +2116,16 @@ function Nr(t, n, e, r, o, i) {
 		}
 	};
 }
-function gr(t, n) {
-	const e = fr(n);
-	if (null === e || e < 0 || e > cr) return x.BuiltIn.Num;
+function hr(t, n) {
+	const e = sr(n);
+	if (null === e || e < 0 || e > ar) return B.BuiltIn.Num;
 	let r = 1;
-	1 === e ? (r = mr(t), r <= 1 && (r = 1)) : e > 1 && (r = e), r > 1 && t.length < 2 * r && (r = 1);
+	1 === e ? (r = fr(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 = dr((n) => {
+		const n = Math.max(1, Math.floor(o / 4)), e = Nr((n) => {
 			const e = Math.max(.001, Math.min(.999, n[0])), r = Math.max(.001, Math.min(.999, n[1])), o = n[2];
-			return Nr(t, e, r, 0, 1, o).mse;
+			return cr(t, e, r, 0, 1, o).mse;
 		}, [
 			.9,
 			.1,
@@ -2150,7 +2139,7 @@ function gr(t, n) {
 			b0: e[2]
 		};
 	}
-	const i = dr((n) => Nr(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 = 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, [
 		.9,
 		.1,
 		.1
@@ -2163,10 +2152,10 @@ function gr(t, n) {
 		b0: 0
 	};
 }
-function pr(t, n, e, r, o) {
+function mr(t, n, e, r, o) {
 	for (let i = 0; i < t.length; ++i) t[i] = n * e[i] + r * o[i];
 }
-function dr(t, n, e) {
+function Nr(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);
@@ -2201,12 +2190,12 @@ function dr(t, n, e) {
 			d[t] /= m;
 		}
 		const n = N[m];
-		if (pr(y, 1 + a, d, -a, n), y.fx = t(y), y.fx < N[0].fx) pr(I, 1 + l, d, -l, n), I.fx = t(I), g(I.fx < y.fx ? I : y);
+		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) {
 			let e = !1;
-			if (y.fx > n.fx ? (pr(M, 1 + f, d, -f, n), M.fx = t(M), M.fx < n.fx ? g(M) : e = !0) : (pr(M, 1 - f * a, d, f * a, n), M.fx = t(M), M.fx < y.fx ? g(M) : e = !0), e) {
+			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 (c >= 1) break;
-				for (let n = 1; n < N.length; ++n) pr(N[n], 1 - c, N[0], c, N[n]), N[n].fx = t(N[n]);
+				for (let n = 1; n < N.length; ++n) mr(N[n], 1 - c, N[0], c, N[n]), N[n].fx = t(N[n]);
 			}
 		} else g(y);
 	}
@@ -2215,15 +2204,15 @@ function dr(t, n, e) {
 		x: N[0]
 	};
 }
-var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis.Column }), Object.freeze({ axis: R.Axis.Row }), Object.freeze({
+var gr = Object.freeze({ includeEmpty: !0 }), pr = (Object.freeze({ axis: x.Axis.Column }), Object.freeze({ axis: x.Axis.Row }), Object.freeze({
 	type: C.Number,
-	axis: R.Axis.Row
-})), Ir = (t, n, e = !1) => {
+	axis: x.Axis.Row
+})), dr = (t, n, e = !1) => {
 	const r = t.getRowCount(), o = t.getColumnCount(), i = r * o;
-	if (0 === i) throw x.BuiltIn.Value;
+	if (0 === i) throw B.BuiltIn.Value;
 	const u = 1 === r, s = r > 1 && o > 1;
 	if (!n || 0 === n.size) {
-		const n = Cr(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,
@@ -2237,8 +2226,8 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 	}
 	const a = n.getRowCount(), l = n.getColumnCount();
 	if (s) {
-		if (a !== r || l !== o) throw x.BuiltIn.Ref;
-		const f = Cr(t, i, e), c = Cr(n, i), h = new Array(i);
+		if (a !== r || l !== o) throw B.BuiltIn.Ref;
+		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,
@@ -2250,32 +2239,32 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 			yCols: o
 		};
 	}
-	if ((u ? l : a) !== i) throw x.BuiltIn.Ref;
+	if ((u ? l : a) !== i) throw B.BuiltIn.Ref;
 	const f = u ? a : l;
 	return {
-		ys: Cr(t, i, e),
-		xs: Er(n, i, f, u),
+		ys: Br(t, i, e),
+		xs: xr(n, i, f, u),
 		k: f,
 		isRowOriented: u,
 		isRectangularY: s,
 		yRows: r,
 		yCols: o
 	};
-}, wr = (t, n, e) => {
+}, yr = (t, n, e) => {
 	if (void 0 === t) return e(n);
 	if (null === t) return e(!1);
 	if ("boolean" == typeof t) return e(t);
-	if (Array.isArray(t)) throw x.BuiltIn.Value;
-	return e(br(((t) => {
+	if (Array.isArray(t)) throw B.BuiltIn.Value;
+	return e(Mr(((t) => {
 		const n = t.getRowCount(), e = t.getColumnCount();
-		if (1 === n && 1 === e || !B.isImplicitIntersect()) return t.getValueAt(0, 0);
-		const r = t.getCoords(), o = B.getRow() - r.rowStart, i = B.getColumn() - r.colStart, u = o >= 0 && o < n, s = i >= 0 && i < e;
+		if (1 === n && 1 === e || !b.isImplicitIntersect()) return t.getValueAt(0, 0);
+		const r = t.getCoords(), o = b.getRow() - r.rowStart, i = b.getColumn() - r.colStart, u = o >= 0 && o < n, s = i >= 0 && i < e;
 		if (u && s) return t.getValueAt(o, i);
 		if (u && 1 === e) return t.getValueAt(o, 0);
 		if (s && 1 === n) return t.getValueAt(0, i);
-		throw x.BuiltIn.Value;
+		throw B.BuiltIn.Value;
 	})(t)));
-}, br = (t) => {
+}, Mr = (t) => {
 	if (null == t) return !1;
 	if ("boolean" == typeof t) return t;
 	if ("number" == typeof t) return !(t > -22250738585072014e-324 && t < 22250738585072014e-324);
@@ -2283,17 +2272,17 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 		const n = t.toUpperCase();
 		if ("TRUE" === n) return !0;
 		if ("FALSE" === n) return !1;
-		throw x.BuiltIn.Value;
+		throw B.BuiltIn.Value;
 	}
-	throw x.BuiltIn.Value;
-}, Br = (t, n, e) => {
+	throw B.BuiltIn.Value;
+}, Ir = (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 x.BuiltIn.Ref;
+			if (0 === o) throw B.BuiltIn.Ref;
 			if (1 === n.k) {
-				const n = Cr(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,
@@ -2302,9 +2291,9 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 				};
 			}
 			const i = n.isRowOriented ? r : e;
-			if ((n.isRowOriented ? e : r) !== n.k) throw x.BuiltIn.Ref;
+			if ((n.isRowOriented ? e : r) !== n.k) throw B.BuiltIn.Ref;
 			return {
-				xs: Er(t, i, n.k, n.isRowOriented),
+				xs: xr(t, i, n.k, n.isRowOriented),
 				rows: n.isRowOriented ? 1 : i,
 				cols: n.isRowOriented ? i : 1
 			};
@@ -2319,7 +2308,7 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 		u[t] = n;
 	}
 	return u;
-}, xr = (t, n, e) => {
+}, wr = (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--) {
@@ -2329,20 +2318,20 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 	}
 	const s = [], a = [], l = [];
 	for (let t = 0; t < i.length; t++) {
-		const n = i[t].slice(), e = Math.sqrt(Ar(n, n)), o = new Array(a.length).fill(0);
+		const n = i[t].slice(), e = Math.sqrt(Cr(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 = Ar(a[t], n);
+			const e = Cr(a[t], n);
 			for (let o = 0; o < r; o++) n[o] -= e * a[t][o];
 			o[t] += e;
 		}
-		const u = Math.sqrt(Ar(n, n));
+		const u = Math.sqrt(Cr(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] = Ar(a[n], t);
+	for (let n = 0; n < f; n++) c[n] = Cr(a[n], t);
 	const h = new Array(f).fill(0);
 	for (let t = f - 1; t >= 0; t--) {
 		let n = c[t];
@@ -2398,8 +2387,8 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 		ssResid: d,
 		predict: p
 	};
-}, Rr = (t, n, e) => {
-	const r = n.length, o = x.BuiltIn.NA, i = (t, n) => {
+}, br = (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;
 	}, u = t.standardErrors.slice();
@@ -2407,106 +2396,109 @@ var yr = Object.freeze({ includeEmpty: !0 }), Mr = (Object.freeze({ axis: R.Axis
 		n.slice(),
 		u,
 		i(t.r2, t.sey),
-		i(t.f ?? x.BuiltIn.Num, t.df),
+		i(t.f ?? B.BuiltIn.Num, t.df),
 		i(t.ssReg, t.ssResid)
 	];
-}, Cr = (t, n, e = !1) => {
+}, Br = (t, n, e = !1) => {
 	const r = new Array(n);
 	let o = 0;
-	for (const n of t.values(yr)) {
-		if ("number" != typeof n) throw x.BuiltIn.Value;
+	for (const n of t.values(gr)) {
+		if ("number" != typeof n) throw B.BuiltIn.Value;
 		if (e) {
-			if (n <= 0) throw x.BuiltIn.Num;
+			if (n <= 0) throw B.BuiltIn.Num;
 			r[o++] = Math.log(n);
 		} else r[o++] = n;
 	}
 	return r;
-}, Er = (t, n, e, r) => {
-	const o = Cr(t, n * e), i = new Array(n);
+}, xr = (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;
-}, Ar = (t, n) => {
+}, Cr = (t, n) => {
 	let e = 0;
 	for (let r = 0; r < t.length; r++) e += t[r] * n[r];
 	return e;
-}, vr = v({
-	GROWTH: () => Tr,
-	LINEST: () => Fr,
-	LOGEST: () => Sr,
-	TREND: () => Vr
-}), Dr = () => {
-	if (B.getArgs().getAreaCountAt(1) > 1) throw x.BuiltIn.Ref;
+}, Rr = A({
+	GROWTH: () => Fr,
+	LINEST: () => Ar,
+	LOGEST: () => vr,
+	TREND: () => Dr
+}), Er = () => {
+	if (b.getArgs().getAreaCountAt(1) > 1) throw B.BuiltIn.Ref;
 };
-function Fr(t, n, e, r) {
-	Dr();
-	const o = Ir(t, n);
-	return wr(e, !0, (t) => {
-		const n = xr(o.ys, o.xs, t);
-		return wr(r, !1, (e) => e ? Rr(n, n.coefficients, t) : [n.coefficients.slice()]);
+function Ar(t, n, e, r) {
+	Er();
+	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()]);
 	});
 }
-function Sr(t, n, e, r) {
-	Dr();
-	const o = Ir(t, n, !0);
-	return wr(e, !0, (t) => {
-		const n = xr(o.ys, o.xs, t), e = Pr(n);
-		return wr(r, !1, (r) => r ? Rr(n, e, t) : [e]);
+function vr(t, n, e, r) {
+	Er();
+	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]);
 	});
 }
-function Vr(t, n, e, r) {
-	Dr();
-	const o = Ir(t, n);
-	return wr(r, !0, (t) => {
-		const n = xr(o.ys, o.xs, t);
-		return Br(o, e, n.predict);
+function Dr(t, n, e, r) {
+	Er();
+	const o = dr(t, n);
+	return yr(r, !0, (t) => {
+		const n = wr(o.ys, o.xs, t);
+		return Ir(o, e, n.predict);
 	});
 }
-function Tr(t, n, e, r) {
-	Dr();
-	const o = Ir(t, n, !0);
-	return wr(r, !0, (t) => {
-		const n = xr(o.ys, o.xs, t).coefficients.map(Math.exp), r = o.k;
-		return Br(o, e, (t) => {
+function Fr(t, n, e, r) {
+	Er();
+	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) => {
 			let e = n[r];
 			for (let o = 0; o < r; o++) e *= n[r - 1 - o] ** t[o];
-			return Number.isFinite(e) ? e : x.BuiltIn.Num;
+			return Number.isFinite(e) ? e : B.BuiltIn.Num;
 		});
 	});
 }
-var Pr = (t) => t.coefficients.map((t) => {
+var Sr = (t) => t.coefficients.map((t) => {
 	const n = Math.exp(t);
-	return Number.isFinite(n) ? n : x.BuiltIn.Num;
-}), Or = v({
-	TTEST: () => $r,
-	T_TEST: () => kr
-});
-function $r(t, n, e, r) {
-	return kr(t, n, e, r);
+	return Number.isFinite(n) ? n : B.BuiltIn.Num;
+}), Vr = A({
+	TTEST: () => Pr,
+	T_TEST: () => Or
+}), Tr = (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 kr(t, n, e, r) {
-	if (e = Math.floor(e + Lr), r = Math.floor(r + Lr), 1 !== e && 2 !== e || r < 1 || r > 3) return NaN;
+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;
 	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 x.BuiltIn.Value;
+		if (e.entries({ includeEmpty: !1 }).next().done) throw B.BuiltIn.Value;
 	}
 	let o;
 	if (1 === r) {
 		const e = t.getShape(), r = n.getShape();
-		if (e.rows * e.columns !== r.rows * r.columns) throw x.BuiltIn.NA;
+		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 (x.isError(e)) throw e;
-			if (x.isError(r)) throw r;
+			if (B.isError(e)) throw Tr(e);
+			if (B.isError(r)) throw Tr(r);
 			"number" == typeof e && "number" == typeof r && (i.push(e), u.push(r));
 		}
-		if (i.length < 2) throw x.BuiltIn.Div0;
+		if (i.length < 2) throw B.BuiltIn.Div0;
 		o = function(t, n) {
 			const e = t.length;
-			if (!Number.isFinite(jr(t)) || !Number.isFinite(jr(n))) return { error: x.BuiltIn.Num };
+			if (!Number.isFinite(qr(t)) || !Number.isFinite(qr(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;
@@ -2515,24 +2507,24 @@ function kr(t, n, e, r) {
 				const e = t[r] - n[r] - o;
 				i += e * e;
 			}
-			return 0 === i ? { error: x.BuiltIn.Div0 } : {
+			return 0 === i ? { error: B.BuiltIn.Div0 } : {
 				x: Math.abs(o) * Math.sqrt(e * (e - 1) / i),
 				df: e - 1
 			};
 		}(i, u);
 	} else {
-		if (t.hasError()) throw t.firstError();
-		if (n.hasError()) throw n.firstError();
-		const e = t.getValuesFlat(Mr), i = n.getValuesFlat(Mr);
-		if (e.length < 2 || i.length < 2) throw x.BuiltIn.Div0;
+		if (t.hasError()) throw Tr(t.firstError());
+		if (n.hasError()) throw Tr(n.firstError());
+		const e = t.getValuesFlat(pr), i = n.getValuesFlat(pr);
+		if (e.length < 2 || i.length < 2) throw B.BuiltIn.Div0;
 		o = 2 === r ? function(t, n) {
 			const e = t.length, r = n.length;
 			let o = 0, i = 0, u = 0, s = 0;
 			for (const n of t) o += n, i += n * n;
 			for (const t of n) u += t, s += t * t;
-			if (!Number.isFinite(i) || !Number.isFinite(s)) return { error: x.BuiltIn.Num };
+			if (!Number.isFinite(i) || !Number.isFinite(s)) return { error: B.BuiltIn.Num };
 			const a = i - o ** 2 / e, l = s - u ** 2 / r, f = Math.sqrt(a + l);
-			if (0 === f) return { error: x.BuiltIn.Div0 };
+			if (0 === f) return { error: B.BuiltIn.Div0 };
 			const c = e + r - 2;
 			return {
 				x: Math.abs(o / e - u / r) / f * Math.sqrt(e * r * c / (e + r)),
@@ -2543,9 +2535,9 @@ function kr(t, n, e, r) {
 			let o = 0, i = 0, u = 0, s = 0;
 			for (const n of t) o += n, i += n * n;
 			for (const t of n) u += t, s += t * t;
-			if (!Number.isFinite(i) || !Number.isFinite(s)) return { error: x.BuiltIn.Num };
+			if (!Number.isFinite(i) || !Number.isFinite(s)) return { error: B.BuiltIn.Num };
 			const a = (i - o ** 2 / e) / (e * (e - 1)), l = (s - u ** 2 / r) / (r * (r - 1));
-			if (a + l === 0) return { error: x.BuiltIn.Div0 };
+			if (a + l === 0) return { error: B.BuiltIn.Div0 };
 			const f = Math.abs(o / e - u / r) / Math.sqrt(a + l), c = a / (a + l);
 			return {
 				x: f,
@@ -2558,14 +2550,14 @@ function kr(t, n, e, r) {
 		const e = .5 * function(t, n, e) {
 			if (e <= 0) return 0;
 			if (e >= 1) return 1;
-			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 * qr(t, n, e) / t : 1 - o * qr(n, t, 1 - e) / n;
+			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;
 		}(n / 2, .5, n / (n + t * t));
 		return t >= 0 ? 1 - e : e;
 	}(-o.x, o.df) * e;
 }
-var Lr = 2 ** -22;
-function qr(t, n, e) {
+var $r = 2 ** -22;
+function kr(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;
@@ -2579,7 +2571,7 @@ function qr(t, n, e) {
 	}
 	return l;
 }
-function _r(t) {
+function Lr(t) {
 	const n = [
 		.9999999999998099,
 		676.5203681218851,
@@ -2591,19 +2583,19 @@ function _r(t) {
 		9984369578019572e-21,
 		1.5056327351493116e-7
 	];
-	if (t < .5) return Math.log(Math.PI / Math.sin(Math.PI * t)) - _r(1 - t);
+	if (t < .5) return Math.log(Math.PI / Math.sin(Math.PI * t)) - Lr(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 jr(t) {
+function qr(t) {
 	let n = 0;
 	for (const e of t) n += e * e;
 	return n;
 }
-var Ur = "\\p{L}\\p{N}_", Yr = {
+var _r = "\\p{L}\\p{N}_", jr = {
 	alpha: "\\p{L}",
 	digit: "\\p{Nd}",
 	alnum: "\\p{L}\\p{N}",
@@ -2612,13 +2604,13 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 	space: "\\s",
 	blank: "\\t\\p{Zs}",
 	punct: "\\p{P}\\p{S}",
-	word: Ur,
+	word: _r,
 	cntrl: "\\p{Cc}",
 	xdigit: "0-9A-Fa-f",
 	ascii: "\\x00-\\x7F",
 	print: "\\P{C}",
 	graph: "\\P{C}"
-}, zr = {
+}, Ur = {
 	alpha: "\\P{L}",
 	digit: "\\P{Nd}",
 	upper: "\\P{Lu}",
@@ -2627,19 +2619,19 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 	cntrl: "\\P{Cc}",
 	print: "\\p{C}",
 	graph: "\\p{C}"
-}, Gr = `(?:(?<=[${Ur}])(?![${Ur}])|(?<![${Ur}])(?=[${Ur}]))`, Hr = `(?:(?<=[${Ur}])(?=[${Ur}])|(?<![${Ur}])(?![${Ur}]))`, Xr = (t, n) => {
+}, Yr = `(?:(?<=[${_r}])(?![${_r}])|(?<![${_r}])(?=[${_r}]))`, zr = `(?:(?<=[${_r}])(?=[${_r}])|(?<![${_r}])(?![${_r}]))`, Gr = (t, n) => {
 	if (!t.startsWith("[:", n)) return null;
 	const e = t.indexOf(":]", n + 2);
 	if (-1 === e) return null;
 	let r = t.slice(n + 2, e);
 	const o = r.startsWith("^");
 	o && (r = r.slice(1));
-	const i = o ? zr[r] : Yr[r];
+	const i = o ? Ur[r] : jr[r];
 	return void 0 === i ? null : {
 		emit: i,
 		next: e + 2
 	};
-}, Wr = (t, n) => {
+}, Xr = (t, n) => {
 	if (!t.startsWith("(?", n)) return null;
 	let e = n + 2, r = "", o = "", i = !1;
 	for (; e < t.length;) {
@@ -2660,13 +2652,13 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 		group: !0,
 		next: e + 1
 	} : null;
-}, Kr = (t) => t.replace(/[^ims]/g, ""), Zr = (t) => (new RegExp(`${t.source}|`, t.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Qr = (t, n, e = "") => {
+}, Hr = (t) => t.replace(/[^ims]/g, ""), Wr = (t) => (new RegExp(`${t.source}|`, t.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Kr = (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: Zr(e)
+				groups: Wr(e)
 			};
 		} catch {
 			return null;
@@ -2692,7 +2684,7 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 					if ("C" === o) throw new SyntaxError("the any-byte escape is not supported");
 					if (r) {
 						if ("w" === o) {
-							n += Ur, e += 2;
+							n += _r, e += 2;
 							continue;
 						}
 						if ("d" === o) {
@@ -2709,19 +2701,19 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 							continue;
 						}
 						if ("b" === o) {
-							n += Gr, e += 2;
+							n += Yr, e += 2;
 							continue;
 						}
 						if ("B" === o) {
-							n += Hr, e += 2;
+							n += zr, e += 2;
 							continue;
 						}
 						if ("w" === o) {
-							n += `[${Ur}]`, e += 2;
+							n += `[${_r}]`, e += 2;
 							continue;
 						}
 						if ("W" === o) {
-							n += `[^${Ur}]`, e += 2;
+							n += `[^${_r}]`, e += 2;
 							continue;
 						}
 						if ("d" === o) {
@@ -2737,7 +2729,7 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 					continue;
 				}
 				if (r) {
-					const o = Xr(t, e);
+					const o = Gr(t, e);
 					if (o) {
 						n += o.emit, e = o.next;
 						continue;
@@ -2753,10 +2745,10 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 					r = !0, n += u, e += 1, "^" === t[e] && (n += "^", e += 1), "]" === t[e] && (n += "\\]", e += 1);
 					continue;
 				}
-				const s = Wr(t, e);
+				const s = Xr(t, e);
 				if (s) {
 					s.on.includes("U") && (o = !0), s.off.includes("U") && (o = !1);
-					const t = Kr(s.on), r = Kr(s.off);
+					const t = Hr(s.on), r = Hr(s.off);
 					s.group ? n += t || r ? `(?${t}${r ? `-${r}` : ""}:` : "(?:" : (t || r) && (n += `(?${t}${r ? `-${r}` : ""}:`, i.push(")")), e = s.next;
 					continue;
 				}
@@ -2775,48 +2767,48 @@ var Ur = "\\p{L}\\p{N}_", Yr = {
 			return n + i.join("");
 		})(t);
 	} catch {
-		return x.BuiltIn.Value;
+		return B.BuiltIn.Value;
 	}
 	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) ?? x.BuiltIn.Value;
-}, Jr = (t, n) => {
+	return o(i, !0) ?? (u === i ? null : o(u, !0)) ?? o(t, !1) ?? B.BuiltIn.Value;
+}, Zr = (t, n) => {
 	const e = Math.trunc(t);
-	return e >= 0 && e <= n ? e : x.BuiltIn.Value;
-}, to = v({
-	REGEXEXTRACT: () => no,
-	REGEXMATCH: () => eo,
-	REGEXREPLACE: () => ro,
-	REGEXTEST: () => oo
+	return e >= 0 && e <= n ? e : B.BuiltIn.Value;
+}, Qr = A({
+	REGEXEXTRACT: () => Jr,
+	REGEXMATCH: () => to,
+	REGEXREPLACE: () => no,
+	REGEXTEST: () => eo
 });
-function no(t, n, e = 0, r = 0) {
-	const o = Jr(e, 2);
-	if (x.isError(o)) return o;
-	const i = Jr(r, 1);
-	if (x.isError(i)) return i;
-	const u = Qr(n, 1 === i);
-	if (x.isError(u)) return u;
+function Jr(t, n, e = 0, r = 0) {
+	const o = Zr(e, 2);
+	if (B.isError(o)) return o;
+	const i = Zr(r, 1);
+	if (B.isError(i)) return i;
+	const u = Kr(n, 1 === i);
+	if (B.isError(u)) return u;
 	const { regex: s } = u;
 	if (0 === o) {
 		const n = t.match(s);
-		return n ? B.createRange().replace([[n[0]]]) : x.BuiltIn.NA;
+		return n ? b.createRange().replace([[n[0]]]) : B.BuiltIn.NA;
 	}
 	if (1 === o) {
 		const n = [...t.matchAll(new RegExp(s.source, `${s.flags}g`))];
-		return 0 === n.length ? x.BuiltIn.NA : B.createRange().replace([n.map((t) => t[0])]);
+		return 0 === n.length ? B.BuiltIn.NA : b.createRange().replace([n.map((t) => t[0])]);
 	}
-	if (0 === u.groups) return x.BuiltIn.Value;
+	if (0 === u.groups) return B.BuiltIn.Value;
 	const a = t.match(s);
-	return a ? B.createRange().replace([a.slice(1).map((t) => t ?? x.BuiltIn.NA)]) : x.BuiltIn.NA;
+	return a ? b.createRange().replace([a.slice(1).map((t) => t ?? B.BuiltIn.NA)]) : B.BuiltIn.NA;
 }
-function eo(t, n, e = !1) {
-	const r = Qr(n, e);
-	return x.isError(r) ? r : r.regex.test(t);
+function to(t, n, e = !1) {
+	const r = Kr(n, e);
+	return B.isError(r) ? r : r.regex.test(t);
 }
-function ro(t, n, e, r = 0, o = 0) {
-	const i = Jr(o, 1);
-	if (x.isError(i)) return i;
-	const u = Qr(n, 1 === i);
-	if (x.isError(u)) return u;
+function no(t, n, e, r = 0, o = 0) {
+	const i = Zr(o, 1);
+	if (B.isError(i)) return i;
+	const u = Kr(n, 1 === i);
+	if (B.isError(u)) return u;
 	const { regex: s, groups: a } = u, l = ((t, n) => {
 		let e = "", r = 0;
 		for (; r < t.length;) {
@@ -2829,7 +2821,7 @@ function ro(t, n, e, r = 0, o = 0) {
 						e += "$&", r += 1 + o.length;
 						continue;
 					}
-					if (i > n) return x.BuiltIn.Value;
+					if (i > n) return B.BuiltIn.Value;
 					e += `$${i}`, r += 1 + o.length;
 					continue;
 				}
@@ -2852,7 +2844,7 @@ function ro(t, n, e, r = 0, o = 0) {
 						e += "$&", r += 1 + o.length;
 						continue;
 					}
-					if (i > n) return x.BuiltIn.Value;
+					if (i > n) return B.BuiltIn.Value;
 					e += `$${i}`, r += 1 + o.length;
 					continue;
 				}
@@ -2866,20 +2858,20 @@ function ro(t, n, e, r = 0, o = 0) {
 								e += "$&", r = o + 1;
 								continue;
 							}
-							if (t > n) return x.BuiltIn.Value;
+							if (t > n) return B.BuiltIn.Value;
 							e += `$${t}`;
 						} else e += `$<${i}>`;
 						r = o + 1;
 						continue;
 					}
 				}
-				return x.BuiltIn.Value;
+				return B.BuiltIn.Value;
 			}
 			e += o + i, r += 2;
 		}
 		return e;
 	})(e, a);
-	if (x.isError(l)) return l;
+	if (B.isError(l)) return l;
 	const f = Math.trunc(r), c = new RegExp(s.source, `${s.flags}g`);
 	if (0 === f) return t.replace(c, l);
 	const h = [...t.matchAll(c)], m = f > 0 ? f - 1 : h.length + f;
@@ -2887,11 +2879,11 @@ function ro(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 oo(t, n, e = 0) {
-	const r = Jr(e, 1);
-	if (x.isError(r)) return r;
-	const o = Qr(n, 1 === r);
-	return x.isError(o) ? o : o.regex.test(t);
+function eo(t, n, e = 0) {
+	const r = Zr(e, 1);
+	if (B.isError(r)) return r;
+	const o = Kr(n, 1 === r);
+	return B.isError(o) ? o : o.regex.test(t);
 }
-var io = () => import("./CNDVQpzD85y-8iJ4.mjs"), uo = () => import("./0yxQHUFt5rjQCIev.mjs"), so = () => import("./DXTaMRX8ten_8WHT.mjs"), ao = () => import("./CjKII1gh4dO5nTCs.mjs"), lo = () => import("./CiTyrOKe-UEYKcPV.mjs"), fo = () => import("./B0dkCLIUbDz5vaVn.mjs"), co = () => import("./qAolCiBy-hQL59hu.mjs"), ho = () => import("./cfrOLasJbMwF7L77.mjs"), mo = () => import("./BfcYyyl5rbLdyDeQ.mjs"), No = () => import("./CZ7GTErfSkfNcFRk.mjs"), go = () => import("./D4ySsDPVL4IH96en.mjs"), po = () => import("./0vsGDvrSkTeFOp0A.mjs"), yo = () => import("./Dt0ErrS3YGvCicxr.mjs"), Mo = () => import("./D25GpXzrju6GyQn2.mjs"), Io = () => import("./BJjZHVPRHerJoONT.mjs"), wo = () => import("./Bf0x5wP966yEyeU1.mjs"), bo = () => import("./D0XFBj8GRIDAu37v.mjs"), Bo = () => import("./o8LeKZ4-9nq29pqg.mjs"), xo = () => import("./D4kfW2yw0rsWNLi0.mjs"), Ro = () => import("./C3Qy2cWt_qACxJiF.mjs"), Co = () => import("./Bnco0vB0yNDiLGre.mjs"), Eo = () => import("./C2ZfbEIW-6-61CUe.mjs"), Ao = (B, x, R) => (R || (R = /* @__PURE__ */ new Map()), x(R, B, D, t, io, "Cube"), x(R, B, mt, n, uo, "Financial"), x(R, B, At, w, so, "Financial"), x(R, B, Ft, b, ao, "Financial", o), x(R, B, Xt, I, lo, "Financial"), x(R, B, tn, e, fo, "Financial"), x(R, B, Rn, a, co, "Financial"), x(R, B, Sn, l, ho, "Financial"), x(R, B, On, h, mo, "Financial"), x(R, B, jn, g, No, "Financial"), x(R, B, ee, s, go, "Financial"), x(R, B, ae, u, po, "Financial"), x(R, B, fe, M, yo, "Financial"), x(R, B, ge, c, Mo, "Financial"), x(R, B, Be, i, Io, "Financial"), x(R, B, Ee, d, wo, "Financial"), x(R, B, We, N, bo, "Lookup & Reference"), x(R, B, tr, r, Bo, "Lookup & Reference"), x(R, B, or, f, xo, "Statistical"), x(R, B, vr, p, Ro, "Statistical"), x(R, B, Or, m, Co, "Statistical"), x(R, B, to, y, Eo, "Text"), R);
-export { Ao as default };
+var ro = () => import("./KELE0bwOYLDc5LU1.mjs"), oo = () => import("./C8cZUVI0utH84RoY.mjs"), io = () => import("./P2KKIUxWzaRqA578.mjs"), uo = () => import("./BuGd_WozQ5GACryc.mjs"), so = () => import("./TsVRWlV0aBAj11q_.mjs"), ao = () => import("./C5QRZhBj0R2s5scX.mjs"), lo = () => import("./CYYsvsWpauQOJMsM.mjs"), fo = () => import("./BzsAYB0O4AGQyHhT.mjs"), co = () => import("./JeU0hWKFq05N2_wk.mjs"), ho = () => import("./N6ZNg1DcQqnCub6Y.mjs"), mo = () => import("./kHBrNyVWu-GLkTFD.mjs"), No = () => import("./NLoLzdQXAOTuwqvv.mjs"), go = () => import("./-gjh-c5r-kqWZw9o.mjs"), po = () => import("./DvQaVDnNxRMcD29t.mjs"), yo = () => import("./BHd0M_vc0wMVhN4M.mjs"), Mo = () => import("./B6ojJF7WA6DiQR2T.mjs"), Io = () => import("./D5YXRS6-9JR6Jnuy.mjs"), wo = () => import("./Bp7v8eImXSaAUiaa.mjs"), bo = () => import("./BVcZk6dCLKI8-HRM.mjs"), Bo = () => import("./FxwjPPWZTalxCLby.mjs"), xo = () => import("./pEF9hsQQaka-GGnX.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 };