@sheetxl/formulas-extended 0.7.28-beta.3 → 0.7.28-beta.4

package/node/esm/index.mjs

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.7.28-beta.3
+* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.7.28-beta.4
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
@@ -12,22 +12,22 @@ var a = Object.defineProperty, o = (t, n) => {
 		enumerable: !0
 	});
 	return n || a(e, Symbol.toStringTag, { value: "Module" }), e;
-}, s = o({
-	CUBEKPIMEMBER: () => i,
-	CUBEMEMBER: () => l,
-	CUBEMEMBERPROPERTY: () => u,
+}, i = o({
+	CUBEKPIMEMBER: () => s,
+	CUBEMEMBER: () => u,
+	CUBEMEMBERPROPERTY: () => l,
 	CUBERANKEDMEMBER: () => f,
 	CUBESET: () => c,
 	CUBESETCOUNT: () => m,
 	CUBEVALUE: () => h
 });
-function i(t, e, r, a) {
+function s(t, e, r, a) {
 	throw n.BuiltIn.NA;
 }
-function l(t, e, r) {
+function u(t, e, r) {
 	throw n.BuiltIn.NA;
 }
-function u(t, e, r) {
+function l(t, e, r) {
 	throw n.BuiltIn.NA;
 }
 function f(t, e, r, a) {
@@ -69,30 +69,30 @@ var M = [
 	30,
 	31
 ];
-function D(t) {
+function N(t) {
 	return t % 4 == 0 && t % 100 != 0 || t % 400 == 0;
 }
-function d(t, n) {
-	return D(t) ? M[n] : p[n];
+function D(t, n) {
+	return N(t) ? M[n] : p[n];
 }
-function g(t, n, e) {
-	return d(t, n) === e;
+function d(t, n, e) {
+	return D(t, n) === e;
 }
-function N(t, n) {
+function g(t, n) {
 	return Math.trunc(t) - Math.trunc(n);
 }
 function y(n, e) {
 	const r = t.fromSerialDate(n, !0), a = t.fromSerialDate(e, !0), o = a.getFullYear() - r.getFullYear();
 	if (o > 1) return !0;
 	if (o < 1) return !1;
-	const s = a.getMonth() - r.getMonth();
-	return s > 0 || !(s < 0) && a.getDate() > r.getDate();
+	const i = a.getMonth() - r.getMonth();
+	return i > 0 || !(i < 0) && a.getDate() > r.getDate();
 }
 function b(t, n) {
-	if (g(t.getFullYear(), t.getMonth(), t.getDate())) {
+	if (d(t.getFullYear(), t.getMonth(), t.getDate())) {
 		t.setDate(1), t.setMonth(t.getMonth() + n);
 		const e = t.getFullYear(), r = t.getMonth();
-		t.setDate(d(e, r));
+		t.setDate(D(e, r));
 	} else t.setMonth(t.getMonth() + n);
 	return t;
 }
@@ -109,11 +109,11 @@ function I(n, e, r) {
 	switch (r) {
 		case 0: return function(t, n) {
 			const e = v(t), r = v(n), a = e.year, o = e.month;
-			let s = e.day, i = r.year, l = r.month, u = r.day, f = !1;
-			2 === o ? s === (D(a) ? 29 : 28) && (s = 30, f = !0) : 31 === s && (s = 30);
-			31 !== u || f || (s < 30 ? (12 === l ? (i += 1, l = 1) : l += 1, u = 1) : u = 30);
+			let i = e.day, s = r.year, u = r.month, l = r.day, f = !1;
+			2 === o ? i === (N(a) ? 29 : 28) && (i = 30, f = !0) : 31 === i && (i = 30);
+			31 !== l || f || (i < 30 ? (12 === u ? (s += 1, u = 1) : u += 1, l = 1) : l = 30);
 			return {
-				days: Math.abs(R(a, o, s, i, l, u)),
+				days: Math.abs(R(a, o, i, s, u, l)),
 				yearDays: 360
 			};
 		}(n, e);
@@ -122,16 +122,16 @@ function I(n, e, r) {
 				days: 0,
 				yearDays: 365
 			};
-			const r = v(n), a = v(e), o = r.year, s = a.year, i = Math.abs(e - n), l = Math.abs(s - o), u = l + 1, f = s < o ? s : o, c = s < o ? o : s;
+			const r = v(n), a = v(e), o = r.year, i = a.year, s = Math.abs(e - n), u = Math.abs(i - o), l = u + 1, f = i < o ? i : o, c = i < o ? o : i;
 			let m, h = t.getSerialDate(f, 1, 1);
 			1900 === f && (h += 1);
-			if (0 === l) m = t.getSerialDate(f, 12, 31) - h + 1;
-			else if (1 === l) {
-				const r = Math.min(n, e), a = Math.max(n, e), o = v(r), s = v(a), i = s.month - o.month;
-				if (i > 0 || 0 === i && s.day > o.day) m = (t.getSerialDate(c + 1, 1, 1) - h) / u;
+			if (0 === u) m = t.getSerialDate(f, 12, 31) - h + 1;
+			else if (1 === u) {
+				const r = Math.min(n, e), a = Math.max(n, e), o = v(r), i = v(a), s = i.month - o.month;
+				if (s > 0 || 0 === s && i.day > o.day) m = (t.getSerialDate(c + 1, 1, 1) - h) / l;
 				else {
 					m = 365;
-					for (const n of [f, c]) if (D(n)) {
+					for (const n of [f, c]) if (N(n)) {
 						const e = t.getSerialDate(n, 2, 29);
 						if (e >= r && e <= a) {
 							m = 366;
@@ -139,9 +139,9 @@ function I(n, e, r) {
 						}
 					}
 				}
-			} else m = (t.getSerialDate(c + 1, 1, 1) - h) / u;
+			} else m = (t.getSerialDate(c + 1, 1, 1) - h) / l;
 			return {
-				days: i,
+				days: s,
 				yearDays: m
 			};
 		}(n, e);
@@ -177,139 +177,139 @@ function C(t, n) {
 function T(n, e, r) {
 	const a = t.fromSerialDate(n, !0);
 	let o = t.fromSerialDate(e, !0);
-	const s = 12 / r;
-	for (o = C(o, a.getFullYear()), o > a && (o = C(o, o.getFullYear() - 1)); o <= a;) o = b(o, s);
-	return o = b(o, -s), o;
+	const i = 12 / r;
+	for (o = C(o, a.getFullYear()), o > a && (o = C(o, o.getFullYear() - 1)); o <= a;) o = b(o, i);
+	return o = b(o, -i), o;
 }
-function A(n, e, r) {
+function x(n, e, r) {
 	return t.toSerialDate(T(n, e, r), !0);
 }
-function w(n, e, r) {
+function A(n, e, r) {
 	const a = b(T(n, e, r), 12 / r);
 	return t.toSerialDate(a, !0);
 }
-function x(t, n, e, r) {
-	return S(A(t, n, e), t, r);
+function w(t, n, e, r) {
+	return S(x(t, n, e), t, r);
 }
 function V(n, e, r, a) {
 	if (3 === a) return 365 / r;
 	if (1 !== a) return 360 / r;
-	const o = A(n, e, r), s = b(t.fromSerialDate(o, !0), 12 / r), i = t.toSerialDate(s, !0);
-	return o < 0 && 1 === r ? 365 : i - o;
+	const o = x(n, e, r), i = b(t.fromSerialDate(o, !0), 12 / r), s = t.toSerialDate(i, !0);
+	return o < 0 && 1 === r ? 365 : s - o;
 }
 function B(n, e, r) {
 	const a = t.fromSerialDate(n, !0);
 	let o = t.fromSerialDate(e, !0);
-	const s = 12 / r;
-	let i = 0;
-	for (; o > a;) o = b(o, -s), i++;
-	return i;
+	const i = 12 / r;
+	let s = 0;
+	for (; o > a;) o = b(o, -i), s++;
+	return s;
 }
 function O(n, e, r) {
 	let a = t.fromSerialDate(n, !0);
 	if (a = b(a, e), r) {
 		const t = a.getFullYear(), n = a.getMonth();
-		a.setDate(d(t, n));
+		a.setDate(D(t, n));
 	}
 	return t.toSerialDate(a, !0);
 }
-function P(n, e, r, a, o, s, i, l, u) {
-	const f = S(r, a, u), c = V(n, a, l, u);
-	return f < c ? function(t, n, e, r, a, o, s, i, l, u, f) {
-		const c = B(t, n, i), m = S(t, r, l), h = S(e, t, l), M = o / i, p = 100 * a / i, D = p * u / f;
-		let d = s / (1 + M) ** (c - 1 + m / f);
-		d += D / (1 + M) ** (m / f);
-		for (let t = 2; t <= c; t++) d += p / (1 + M) ** (t - 1 + m / f);
-		return d -= p * h / f, d;
-	}(n, e, r, a, o, s, i, l, u, f, c) : function(n, e, r, a, o, s, i, l, u, f) {
-		const c = B(a, e, l), m = function(n, e, r, a) {
-			const o = t.fromSerialDate(n, !0), s = t.fromSerialDate(e, !0), i = o.getFullYear(), l = o.getMonth(), u = o.getDate(), f = s.getFullYear(), c = s.getMonth(), m = s.getDate(), h = g(i, l, u) || 1 !== l && u > 28 && u < d(i, l) && g(f, c, m), M = O(e, 0, h);
-			let p = (a ? 1 : 0) + (e < M ? 1 : 0), D = O(M, r, h);
-			for (; r > 0 ? D < e : D > e;) D = O(D, r, h), p++;
+function P(n, e, r, a, o, i, s, u, l) {
+	const f = S(r, a, l), c = V(n, a, u, l);
+	return f < c ? function(t, n, e, r, a, o, i, s, u, l, f) {
+		const c = B(t, n, s), m = S(t, r, u), h = S(e, t, u), M = o / s, p = 100 * a / s, N = p * l / f;
+		let D = i / (1 + M) ** (c - 1 + m / f);
+		D += N / (1 + M) ** (m / f);
+		for (let t = 2; t <= c; t++) D += p / (1 + M) ** (t - 1 + m / f);
+		return D -= p * h / f, D;
+	}(n, e, r, a, o, i, s, u, l, f, c) : function(n, e, r, a, o, i, s, u, l, f) {
+		const c = B(a, e, u), m = function(n, e, r, a) {
+			const o = t.fromSerialDate(n, !0), i = t.fromSerialDate(e, !0), s = o.getFullYear(), u = o.getMonth(), l = o.getDate(), f = i.getFullYear(), c = i.getMonth(), m = i.getDate(), h = d(s, u, l) || 1 !== u && l > 28 && l < D(s, u) && d(f, c, m), M = O(e, 0, h);
+			let p = (a ? 1 : 0) + (e < M ? 1 : 0), N = O(M, r, h);
+			for (; r > 0 ? N < e : N > e;) N = O(N, r, h), p++;
 			return p;
-		}(a, n, 12 / l, !0);
+		}(a, n, 12 / u, !0);
 		let h;
-		h = 2 === u || 3 === u ? S(n, w(n, a, l), u) : f - S(A(n, a, l), n, u);
-		const M = s / l, p = 100 * o / l;
-		let D = i / (1 + M) ** (c + m + h / f);
-		const N = B(r, a, l);
+		h = 2 === l || 3 === l ? S(n, A(n, a, u), l) : f - S(x(n, a, u), n, l);
+		const M = i / u, p = 100 * o / u;
+		let N = s / (1 + M) ** (c + m + h / f);
+		const g = B(r, a, u);
 		let y = a, E = 0, v = 0;
-		for (let e = N; e >= 1; e--) {
-			const a = t.fromSerialDate(y, !0), o = t.toSerialDate(b(a, -12 / l), !0), s = 1 === u ? S(o, y, u) : f;
-			E += (e > 1 ? s : S(r, y, u)) / s;
-			const i = Math.max(r, o), c = Math.min(n, y);
-			v += (i < c ? S(i, c, u) : 0) / s, y = o;
+		for (let e = g; e >= 1; e--) {
+			const a = t.fromSerialDate(y, !0), o = t.toSerialDate(b(a, -12 / u), !0), i = 1 === l ? S(o, y, l) : f;
+			E += (e > 1 ? i : S(r, y, l)) / i;
+			const s = Math.max(r, o), c = Math.min(n, y);
+			v += (s < c ? S(s, c, l) : 0) / i, y = o;
 		}
-		D += p * E / (1 + M) ** (m + h / f);
-		for (let t = 1; t <= c; t++) D += p / (1 + M) ** (t + m + h / f);
-		return D -= p * v, D;
-	}(n, e, r, a, o, s, i, l, u, c);
-}
-function F(t, n, e, r, a, o, s) {
-	const i = B(t, n, o), l = V(t, n, o, s), u = x(t, n, o, s), f = l - u, c = 100 * e / o, m = r / o;
-	if (1 === i) return (c + a) / (m * f / l + 1) - c * u / l;
-	let h = a / (1 + m) ** (i - 1 + f / l);
-	for (let t = 1; t <= i; t++) h += c / (1 + m) ** (t - 1 + f / l);
-	return h -= c * u / l, h;
+		N += p * E / (1 + M) ** (m + h / f);
+		for (let t = 1; t <= c; t++) N += p / (1 + M) ** (t + m + h / f);
+		return N -= p * v, N;
+	}(n, e, r, a, o, i, s, u, l, c);
+}
+function F(t, n, e, r, a, o, i) {
+	const s = B(t, n, o), u = V(t, n, o, i), l = w(t, n, o, i), f = u - l, c = 100 * e / o, m = r / o;
+	if (1 === s) return (c + a) / (m * f / u + 1) - c * l / u;
+	let h = a / (1 + m) ** (s - 1 + f / u);
+	for (let t = 1; t <= s; t++) h += c / (1 + m) ** (t - 1 + f / u);
+	return h -= c * l / u, h;
 }
 function Y(t, n, e, r, a, o) {
-	const s = x(t, n, a, o), i = V(t, n, a, o), l = B(t, n, a), u = (i - s) / i - 1, f = 1 + r / a, c = 100 * e / a;
+	const i = w(t, n, a, o), s = V(t, n, a, o), u = B(t, n, a), l = (s - i) / s - 1, f = 1 + r / a, c = 100 * e / a;
 	let m = 0, h = 0;
-	for (let t = 1; t <= l; t++) {
-		const n = t + u, e = c / f ** n;
+	for (let t = 1; t <= u; t++) {
+		const n = t + l, e = c / f ** n;
 		m += n * e, h += e;
 	}
-	const M = l + u, p = 100 / f ** M;
+	const M = u + l, p = 100 / f ** M;
 	return m += M * p, h += p, m / h / a;
 }
 function L(t, n, e, r, a) {
-	const o = Math.min(a / e, 1), s = 1 === o && 1 !== r ? 0 : t * (1 - o) ** (r - 1), i = t * (1 - o) ** r, l = i < n ? s - n : s - i;
-	return Math.max(l, 0);
+	const o = Math.min(a / e, 1), i = 1 === o && 1 !== r ? 0 : t * (1 - o) ** (r - 1), s = t * (1 - o) ** r, u = s < n ? i - n : i - s;
+	return Math.max(u, 0);
 }
 function U(t, n, e) {
-	return A(t, n, e) >= 0;
+	return x(t, n, e) >= 0;
 }
 function k(t) {
 	return !(t < 1 || t > 4 || 3 === t);
 }
 var q = o({ ACCRINT: () => X });
-function X(e, r, a, o, s, i, l = 0, u = !0) {
-	if (e = Math.trunc(e), r = Math.trunc(r), a = Math.trunc(a), i = Math.trunc(i), l = Math.trunc(l), !t.isValidDate(e) || !t.isValidDate(r) || !t.isValidDate(a)) return n.BuiltIn.Value;
-	if (!k(i) || !E(l) || o <= 0 || s <= 0 || e >= a) return NaN;
+function X(e, r, a, o, i, s, u = 0, l = !0) {
+	if (e = Math.trunc(e), r = Math.trunc(r), a = Math.trunc(a), s = Math.trunc(s), u = Math.trunc(u), !t.isValidDate(e) || !t.isValidDate(r) || !t.isValidDate(a)) return n.BuiltIn.Value;
+	if (!k(s) || !E(u) || o <= 0 || i <= 0 || e >= a) return NaN;
 	const f = function(t, n, e, r, a, o = !0) {
-		const s = Math.ceil(r * (Math.abs(n - t) + Math.abs(n - e)) / 365) + 6;
-		let i = 0;
-		for (let e = 1; e <= s; e++) if (j(n, r, -e) <= t) {
-			i = e;
+		const i = Math.ceil(r * (Math.abs(n - t) + Math.abs(n - e)) / 365) + 6;
+		let s = 0;
+		for (let e = 1; e <= i; e++) if (j(n, r, -e) <= t) {
+			s = e;
 			break;
 		}
-		const l = [];
-		for (let t = -i; l.length <= 600; t++) {
+		const u = [];
+		for (let t = -s; u.length <= 600; t++) {
 			const a = j(n, r, t);
-			if (l.push(a), a >= e) break;
+			if (u.push(a), a >= e) break;
 		}
-		let u = null;
+		let l = null;
 		if (1 === a) {
-			const t = l.findIndex((t) => t === n);
-			t > 0 && (u = n - l[t - 1]);
+			const t = u.findIndex((t) => t === n);
+			t > 0 && (l = n - u[t - 1]);
 		}
 		let f = 0;
-		for (let s = 0; s + 1 < l.length; s++) {
-			const i = l[s], c = l[s + 1];
+		for (let i = 0; i + 1 < u.length; i++) {
+			const s = u[i], c = u[i + 1];
 			if (c <= t) continue;
-			if (i >= e) break;
-			const m = Math.max(i, t), h = Math.min(c, e);
-			if (m === i && h === c && (0 === a || 4 === a || o)) {
+			if (s >= e) break;
+			const m = Math.max(s, t), h = Math.min(c, e);
+			if (m === s && h === c && (0 === a || 4 === a || o)) {
 				f += 1;
 				continue;
 			}
 			let M, p;
 			switch (a) {
 				case 0:
-					M = m - i === 1 && c < n ? h - m : I(m, h, 0).days, p = 360 / r;
+					M = m - s === 1 && c < n ? h - m : I(m, h, 0).days, p = 360 / r;
 					break;
 				case 1:
-					M = h - m, p = null !== u ? u : c - i;
+					M = h - m, p = null !== l ? l : c - s;
 					break;
 				case 2:
 					M = h - m, p = 360 / r;
@@ -323,36 +323,36 @@ function X(e, r, a, o, s, i, l = 0, u = !0) {
 			p > 0 && (f += M / p);
 		}
 		return f;
-	}(e, r, a, i, l, u);
-	return s * (o / i) * f;
+	}(e, r, a, s, u, l);
+	return i * (o / s) * f;
 }
 function j(n, e, r) {
 	const a = Math.round(r * (12 / e)), o = t.fromSerialDate(n, !0);
 	return b(o, a), t.toSerialDate(o, !0);
 }
 var _ = o({ AMORDEGRC: () => G });
-function G(n, e, r, a, o, s, i = 0) {
-	if (i = Math.floor(i), !t.isValidDate(e) || !t.isValidDate(r) || n <= 0 || a < 0 || n < a || o < 0 || s <= 0 || 0 !== i && 1 !== i && 3 !== i || Math.floor(e) > Math.floor(r)) return NaN;
-	const l = 1 / s, u = s * ((f = l) < 5 ? 1.5 : f <= 6 ? 2 : 2.5);
+function G(n, e, r, a, o, i, s = 0) {
+	if (s = Math.floor(s), !t.isValidDate(e) || !t.isValidDate(r) || n <= 0 || a < 0 || n < a || o < 0 || i <= 0 || 0 !== s && 1 !== s && 3 !== s || Math.floor(e) > Math.floor(r)) return NaN;
+	const u = 1 / i, l = i * ((f = u) < 5 ? 1.5 : f <= 6 ? 2 : 2.5);
 	var f;
-	const { days: c, yearDays: m } = I(e, r, i), h = c / m;
-	return function(t, n, e, r, a, o, s) {
-		const i = Math.ceil(r), l = Math.floor(t * e * o);
-		if (0 === s) return l;
-		const u = t - Math.floor(t * e * a);
+	const { days: c, yearDays: m } = I(e, r, s), h = c / m;
+	return function(t, n, e, r, a, o, i) {
+		const s = Math.ceil(r), u = Math.floor(t * e * o);
+		if (0 === i) return u;
+		const l = t - Math.floor(t * e * a);
 		if (r < 3) {
-			const t = i - 1;
-			return t <= 0 ? u > n ? u : 0 : s <= t ? Math.ceil(u / t) : 0;
+			const t = s - 1;
+			return t <= 0 ? l > n ? l : 0 : i <= t ? Math.ceil(l / t) : 0;
 		}
-		let f = u;
-		for (let t = 1; t <= s; t++) {
+		let f = l;
+		for (let t = 1; t <= i; t++) {
 			if (f <= n) return 0;
-			const r = f * e, a = i - t, o = a > 0 ? f / a : 0, l = Math.floor(Math.max(r, o));
-			if (t === s) return l;
-			f -= l;
+			const r = f * e, a = s - t, o = a > 0 ? f / a : 0, u = Math.floor(Math.max(r, o));
+			if (t === i) return u;
+			f -= u;
 		}
 		return 0;
-	}(n, a, u, l, h, 1 === i && l >= 3 ? c / 365 : h, o > 1 ? Math.floor(o) : Math.ceil(o));
+	}(n, a, l, u, h, 1 === s && u >= 3 ? c / 365 : h, o > 1 ? Math.floor(o) : Math.ceil(o));
 }
 function z(n) {
 	if (null === n) return 0;
@@ -369,82 +369,91 @@ var H = o({
 	YEARFRAC: () => Q
 });
 function K(n, e, r) {
-	const a = t.getDateParts(n), o = t.getDateParts(e), s = Math.trunc(n), i = Math.trunc(e);
+	const a = t.getDateParts(n), o = t.getDateParts(e), i = Math.trunc(n), s = Math.trunc(e);
 	if (r = r.toLowerCase(), n > e) return NaN;
-	const l = o.year - a.year, u = o.month - a.month, f = o.day - a.day;
+	const u = o.year - a.year, l = o.month - a.month, f = o.day - a.day;
 	let c;
 	switch (r) {
-		case "y": return c = u < 0 || 0 === u && f < 0 ? -1 : 0, c + l;
-		case "m": return c = f < 0 ? -1 : 0, 12 * l + u + c;
-		case "d": return i - s;
-		case "md": return i - t.getSerialDate(o.year, o.month + (f < 0 ? -1 : 0), a.day);
-		case "ym": return c = f < 0 ? -1 : 0, (c + 12 * l + u) % 12;
-		case "yd": return i - t.getSerialDate(o.year - (u < 0 || 0 === u && f < 0 ? 1 : 0), a.month, a.day);
+		case "y": return c = l < 0 || 0 === l && f < 0 ? -1 : 0, c + u;
+		case "m": return c = f < 0 ? -1 : 0, 12 * u + l + c;
+		case "d": return s - i;
+		case "md": return s - t.getSerialDate(o.year, o.month + (f < 0 ? -1 : 0), a.day);
+		case "ym": return c = f < 0 ? -1 : 0, (c + 12 * u + l) % 12;
+		case "yd": return s - t.getSerialDate(o.year - (l < 0 || 0 === l && f < 0 ? 1 : 0), a.month, a.day);
 	}
 	return NaN;
 }
 function Q(n, e, r = 0) {
 	let a = z(n), o = z(e);
-	const s = null === (i = r) ? 0 : t.parseAsNumber(i);
-	var i;
-	if (!t.isValidDate(a) || !t.isValidDate(o) || !E(s)) return NaN;
+	const i = null === (s = r) ? 0 : t.parseAsNumber(s);
+	var s;
+	if (!t.isValidDate(a) || !t.isValidDate(o) || !E(i)) return NaN;
 	if (a > o) {
 		const t = a;
 		a = o, o = t;
 	}
-	const { days: l, yearDays: u } = I(a, o, s);
-	return l / u;
+	const { days: u, yearDays: l } = I(a, o, i);
+	return u / l;
 }
 function W(t, n, e = !1) {
 	return e ? (n >= t ? 1 : -1) * I(t, n, 4).days : function(t, n) {
 		const e = v(t), r = v(n), a = e.year, o = e.month;
-		let s = e.day, i = r.year, l = r.month, u = r.day;
-		if (2 === o ? 3 === v(t + 1).month && (s = 30) : 31 === s && (s = 30), 31 === u) if (s < 30) {
+		let i = e.day, s = r.year, u = r.month, l = r.day;
+		if (2 === o ? 3 === v(t + 1).month && (i = 30) : 31 === i && (i = 30), 31 === l) if (i < 30) {
 			const t = v(n + 1);
-			i = t.year, l = t.month, u = t.day;
-		} else u = 30;
-		return R(a, o, s, i, l, u);
+			s = t.year, u = t.month, l = t.day;
+		} else l = 30;
+		return R(a, o, i, s, u, l);
 	}(t, n);
 }
 var $ = (t) => {
 	const n = t.getLocaleProfile().currencySymbol;
 	return `${n}#,##0.00_);[Red](${n}#,##0.00)`;
-}, Z = o({
-	COUPDAYS: () => J,
-	CUMIPMT: () => tt,
-	CUMPRINC: () => nt,
-	DB: () => et,
-	DDB: () => rt,
-	DISC: () => at,
-	DOLLARDE: () => ot,
-	DOLLARFR: () => st,
-	EFFECT: () => it,
-	FV: () => lt,
-	FVSCHEDULE: () => ut,
-	IPMT: () => ft,
-	IRR: () => ct,
-	ISPMT: () => mt,
-	MIRR: () => ht,
-	NOMINAL: () => Mt,
-	NPER: () => pt,
-	NPV: () => Dt,
-	PDURATION: () => dt,
-	PMT: () => gt,
-	PPMT: () => Nt,
-	PRICEDISC: () => yt,
-	PV: () => bt,
-	RATE: () => Et,
-	RRI: () => vt,
-	SLN: () => Rt,
-	STOCKHISTORY: () => It,
-	SYD: () => St,
-	TBILLEQ: () => Ct,
-	TBILLPRICE: () => Tt,
-	TBILLYIELD: () => At,
-	XIRR: () => wt,
-	XNPV: () => xt
+}, Z = (t, e) => {
+	if (0 === t) {
+		if (e < 0) throw n.BuiltIn.Div0;
+		if (0 === e) return NaN;
+	}
+	if (!Number.isInteger(e) || Math.abs(e) > 4294967294) return Math.exp(e * Math.log(t));
+	let r = Math.abs(e), a = 1, o = t;
+	for (; r > 0;) r % 2 == 1 && (a *= o), o *= o, r = Math.floor(r / 2);
+	return e < 0 ? 1 / a : a;
+}, J = o({
+	COUPDAYS: () => tt,
+	CUMIPMT: () => nt,
+	CUMPRINC: () => rt,
+	DB: () => at,
+	DDB: () => ot,
+	DISC: () => it,
+	DOLLARDE: () => st,
+	DOLLARFR: () => ut,
+	EFFECT: () => lt,
+	FV: () => ft,
+	FVSCHEDULE: () => ct,
+	IPMT: () => mt,
+	IRR: () => ht,
+	ISPMT: () => Mt,
+	MIRR: () => pt,
+	NOMINAL: () => Nt,
+	NPER: () => Dt,
+	NPV: () => dt,
+	PDURATION: () => gt,
+	PMT: () => yt,
+	PPMT: () => bt,
+	PRICEDISC: () => Et,
+	PV: () => vt,
+	RATE: () => Rt,
+	RRI: () => St,
+	SLN: () => Ct,
+	STOCKHISTORY: () => Tt,
+	SYD: () => xt,
+	TBILLEQ: () => At,
+	TBILLPRICE: () => wt,
+	TBILLYIELD: () => Vt,
+	XIRR: () => Bt,
+	XNPV: () => Ot
 });
-function J(n, e, r, a = 0) {
+function tt(n, e, r, a = 0) {
 	if (!t.isValidDate(n) || !t.isValidDate(e) || !k(r) || !E(a) || n >= e) return NaN;
 	if (1 === a) {
 		const a = function(t, n, e) {
@@ -472,103 +481,125 @@ function J(n, e, r, a = 0) {
 	}
 	return o / r;
 }
-function tt(n, e, r, a, o, s) {
-	if (!t.isValidDate(a) || !t.isValidDate(o) || n <= 0 || e <= 0 || r <= 0 || a < 1 || o < 1 || a > o || 0 !== s && 1 !== s) return NaN;
-	const i = gt(n, e, r, 0, s);
-	let l = 0;
-	1 === a && (0 === s && (l = -r), a++);
-	for (let t = a; t <= o; t++) l += 1 === s ? lt(n, t - 2, i, r, 1) - i : lt(n, t - 1, i, r, 0);
-	return l *= n, l;
-}
-function nt(n, e, r, a, o, s) {
-	if (!t.isValidDate(a) || !t.isValidDate(o) || a > o || n <= 0 || e <= 0 || r <= 0 || a < 1 || o < 1 || a > o || 0 !== s && 1 !== s) return NaN;
-	const i = gt(n, e, r, 0, s);
-	let l = 0;
-	1 === a && (l = 0 === s ? i + r * n : i, a++);
-	for (let t = a; t <= o; t++) l += s > 0 ? i - (lt(n, t - 2, i, r, 1) - i) * n : i - lt(n, t - 1, i, r, 0) * n;
-	return l;
+function nt(t, n, e, r, a, o) {
+	const i = et(t, n, e, r, a, o);
+	if (!i) return NaN;
+	const s = i.count * i.payment - i.principal;
+	return Number.isFinite(s) ? s : NaN;
+}
+var et = (t, n, e, r, a, o) => {
+	if (t <= 0 || n <= 0 || e <= 0 || r < 1 || r > a || a > n || 0 !== o && 1 !== o) return null;
+	const i = yt(t, n, e, 0, o);
+	if (!Number.isFinite(i)) return null;
+	const s = Math.ceil(r), u = Math.floor(a), l = u - s + 1;
+	if (l <= 0) return {
+		payment: i,
+		principal: 0,
+		count: 0
+	};
+	const f = Math.log1p(t), c = -Math.expm1(-n * f), m = (t, r) => {
+		const a = -e * (Math.exp((t - n - 1) * f) * Math.expm1((r - t + 1) * f)) / c;
+		return Number.isFinite(a) ? a : -e * (Math.exp((r - n) * f) - Math.exp((t - n - 1) * f)) / c;
+	};
+	if (!o) return {
+		payment: i,
+		principal: m(s, u),
+		count: l
+	};
+	let h = s <= 1 ? i : 0;
+	const M = Math.max(s, 2);
+	return M <= u && (h += m(M, u) / (1 + t)), {
+		payment: i,
+		principal: h,
+		count: l
+	};
+};
+function rt(t, n, e, r, a, o) {
+	const i = et(t, n, e, r, a, o);
+	return i ? i.principal : NaN;
 }
-function et(n, e, r, a, o = 12) {
+function at(n, e, r, a, o = 12) {
 	if (n < 0 || e < 0 || r <= 0 || a < 0) return NaN;
 	if (o < 1 || o > 12) return NaN;
 	if (12 === o && a > r || a > r + 1) return NaN;
 	if (0 === n) return 0;
 	t.formatResults($(t.getRuntime()));
-	const s = Math.round(1e3 * (1 - Math.pow(e / n, 1 / r))) / 1e3, i = n * s * o / 12;
-	if (1 === a) return i;
-	let l = n - i;
-	for (let t = 2; t < a; t++) l -= l * s;
-	return a === r + 1 ? l * s * (12 - o) / 12 : l * s;
+	const i = Math.round(1e3 * (1 - Math.pow(e / n, 1 / r))) / 1e3, s = n * i * o / 12;
+	if (1 === a) return s;
+	let u = n - s;
+	for (let t = 2; t < a; t++) u -= u * i;
+	return a === r + 1 ? u * i * (12 - o) / 12 : u * i;
 }
-function rt(t, n, e, r, a = 2) {
+function ot(t, n, e, r, a = 2) {
 	if (t < 0 || n < 0 || e < 0 || r < 0 || a <= 0) return NaN;
 	if (r > e) return NaN;
 	if (n >= t) return 0;
-	let o = 0, s = 0;
-	for (let i = 1; i <= r; i++) s = Math.min(a / e * (t - o), t - n - o), o += s;
-	return s;
+	let o = 0, i = 0;
+	for (let s = 1; s <= r; s++) i = Math.min(a / e * (t - o), t - n - o), o += i;
+	return i;
 }
-function at(n, e, r, a, o = 0) {
+function it(n, e, r, a, o = 0) {
 	if (!t.isValidDate(n) || !t.isValidDate(e) || !E(o) || r <= 0 || a <= 0 || n >= e) return NaN;
-	let s, i;
+	let i, s;
 	switch (o) {
 		case 0:
-			s = 360, i = W(n, e, !1);
+			i = 360, s = W(n, e, !1);
 			break;
 		case 1:
 		case 3:
-			s = 365, i = K(n, e, "D");
+			i = 365, s = K(n, e, "D");
 			break;
 		case 2:
-			s = 360, i = K(n, e, "D");
+			i = 360, s = K(n, e, "D");
 			break;
 		case 4:
-			s = 360, i = W(n, e, !0);
+			i = 360, s = W(n, e, !0);
 			break;
 		default: return NaN;
 	}
-	return (a - r) / a * s / i;
+	return (a - r) / a * i / s;
 }
-function ot(t, e) {
+function st(t, e) {
 	if ((e = Math.trunc(e)) < 0) return NaN;
 	if (0 === e) throw n.BuiltIn.Div0;
 	if (1 === e) return t;
-	const r = t < 0 ? -1 : 1, a = Math.abs(t), o = Math.trunc(a), s = a - o;
-	return r * (o + Math.round(s * Math.pow(10, Math.ceil(Math.log10(e)))) / e);
+	const r = t < 0 ? -1 : 1, a = Math.abs(t), o = Math.trunc(a), i = a - o;
+	return r * (o + Math.round(i * Math.pow(10, Math.ceil(Math.log10(e)))) / e);
 }
-function st(t, e) {
+function ut(t, e) {
 	if ((e = Math.trunc(e)) < 0) return NaN;
 	if (0 === e) throw n.BuiltIn.Div0;
 	if (1 === e) return t;
-	const r = t < 0 ? -1 : 1, a = Math.abs(t), o = Math.trunc(a), s = a - o, i = Math.ceil(Math.log10(e));
-	return r * (o + s * e / Math.pow(10, i));
+	const r = t < 0 ? -1 : 1, a = Math.abs(t), o = Math.trunc(a), i = a - o, s = Math.ceil(Math.log10(e));
+	return r * (o + i * e / Math.pow(10, s));
 }
-function it(t, n) {
-	return n = Math.trunc(n), t <= 0 || n < 1 ? NaN : Math.pow(1 + t / n, n) - 1;
+function lt(t, n) {
+	if (n = Math.trunc(n), t <= 0 || n < 1) return NaN;
+	const e = Z(1 + t / n, n) - 1;
+	return Number.isFinite(e) ? e : NaN;
 }
-function lt(n, e, r, a = 0, o = 0) {
-	let s;
-	if (0 === n) s = a + r * e;
-	else {
-		const t = Math.pow(1 + n, e);
-		s = 1 === o ? a * t + r * (1 + n) * (t - 1) / n : a * t + r * (t - 1) / n;
-	}
-	return t.formatResults($(t.getRuntime())), -s;
+function ft(n, e, r, a = 0, o = 0) {
+	if (t.formatResults($(t.getRuntime())), 0 === n) return -(a + r * e);
+	const i = Z(1 + n, e);
+	return -(a * i + (i - 1) / n * (1 + n * (o ? 1 : 0)) * r);
 }
-function ut(t, e) {
+function ct(t, e) {
 	let r = t;
-	for (const t of e.values()) {
+	for (const t of e.values()) if (null != t) {
 		if ("number" != typeof t) throw n.BuiltIn.Value;
 		r *= 1 + t;
 	}
-	return r;
+	return Number.isFinite(r) ? r : 0;
 }
-function ft(t, n, e, r, a = 0, o = 0) {
-	if (e <= 0 || n < 1 || n > e) return NaN;
-	const s = gt(t, e, r, a, o);
-	return 1 === n ? t * (o ? 0 : -r) : t * (o ? lt(t, n - 2, s, r, o) - s : lt(t, n - 1, s, r, o));
+function mt(n, e, r, a, o = 0, i = 0) {
+	if (e < 1 || e - 1 >= r) return NaN;
+	if (t.formatResults($(t.getRuntime())), 1 === e && i) return 0;
+	if (0 === n) return 0;
+	if (n <= -1) return NaN;
+	const s = Math.log1p(n), u = e - 1, l = -n * (a * -Math.expm1((u - r) * s) - o * (u * s < 700 ? Math.exp(-r * s) * Math.expm1(u * s) : Math.exp((u - r) * s) - Math.exp(-r * s))) / -Math.expm1(-r * s);
+	return i ? l / (1 + n) : l;
 }
-function ct(t, n = .1) {
+function ht(t, n = .1) {
 	const e = t.some((t) => t > 0), r = t.some((t) => t < 0);
 	if (!e || !r) return NaN;
 	const a = (n) => {
@@ -579,145 +610,162 @@ function ct(t, n = .1) {
 	};
 	let o = n;
 	for (let t = 0; t < 20; t++) {
-		const t = a(o), n = o - t / ((a(o + Vt) - t) / Vt);
-		if (Math.abs(n - o) < Vt) return n;
+		const t = a(o), n = o - t / ((a(o + Pt) - t) / Pt);
+		if (Math.abs(n - o) < Pt) return n;
 		o = n, o <= -1 && (o = -.9999999);
 	}
 	return NaN;
 }
-function mt(t, e, r, a) {
+function Mt(t, e, r, a) {
 	if (0 === r) throw n.BuiltIn.Div0;
-	return a * t * (e / r - 1);
+	const o = a * (e - r) * t / r;
+	return Number.isFinite(o) ? o : NaN;
 }
-function ht(e, r, a) {
+function pt(e, r, a) {
 	const o = e.length;
 	if (!e.some((t) => t < 0)) throw n.BuiltIn.Div0;
-	let s = 0;
+	let i = 0;
 	for (let t = 0; t < o; t++) {
 		const n = e[t];
-		n < 0 && (s += n / Math.pow(1 + r, t));
+		n < 0 && (i += n / Math.pow(1 + r, t));
 	}
-	let i = 0;
+	let s = 0;
 	for (let t = 0; t < o; t++) {
 		const n = e[t];
-		n > 0 && (i += n * Math.pow(1 + a, o - 1 - t));
+		n > 0 && (s += n * Math.pow(1 + a, o - 1 - t));
 	}
-	return t.formatResults("0%"), Math.pow(-i / s, 1 / (o - 1)) - 1;
+	return t.formatResults("0%"), Math.pow(-s / i, 1 / (o - 1)) - 1;
 }
-function Mt(t, n) {
-	return n = Math.trunc(n), t <= 0 || n < 1 ? NaN : (Math.pow(t + 1, 1 / n) - 1) * n;
+function Nt(t, n) {
+	if (n = Math.trunc(n), t <= 0 || n < 1) return NaN;
+	const e = (Z(t + 1, 1 / n) - 1) * n;
+	return Number.isFinite(e) ? e : NaN;
 }
-function pt(t, e, r, a = 0, o = 0) {
+function Dt(t, e, r, a = 0, o = 0) {
 	if (0 === t) {
 		if (0 === e) throw n.BuiltIn.Div0;
 		return (-r - a) / e;
 	}
-	return o && (e *= 1 + t), Math.log((e - a * t) / (r * t + e)) / Math.log(1 + t);
-}
-function Dt(t, e) {
-	if (e.length > 254) throw n.BuiltIn.Value;
-	let r = 0;
-	for (let a = e.length - 1; a >= 0; a--) {
-		if (r += e[a], -1 === t) {
-			if (0 === r) continue;
-			throw n.BuiltIn.Div0;
-		}
-		r /= 1 + t;
-	}
-	return r;
+	if (t <= -1) return NaN;
+	const i = Math.log(1 + t);
+	if (0 === i) throw n.BuiltIn.Div0;
+	return o && (e *= 1 + t), Math.log((e - a * t) / (r * t + e)) / i;
+}
+function dt(t, e) {
+	const r = [];
+	for (const t of e) for (const n of t.values()) r.push(n);
+	const a = r.length, o = 1 + t;
+	if (0 === o) throw n.BuiltIn.Div0;
+	if (!Number.isFinite(Z(o, a - 1))) throw n.BuiltIn.Div0;
+	let i = 0;
+	for (let t = a - 1; t >= 0; t--) i += r[t], i /= o;
+	return i;
 }
-function dt(t, n, e) {
-	return t <= 0 || n <= 0 || e <= 0 ? NaN : (Math.log(e) - Math.log(n)) / Math.log(1 + t);
+function gt(t, e, r) {
+	if (t <= 0 || e <= 0 || r <= 0) return NaN;
+	const a = Math.log(1 + t);
+	if (0 === a) throw n.BuiltIn.Div0;
+	return (Math.log(r) - Math.log(e)) / a;
 }
-function gt(n, e, r, a = 0, o = 0) {
+function yt(n, e, r, a = 0, o = 0) {
 	if (0 === e) return NaN;
-	if (0 === n) return (-r - a) / e;
-	o = o ? 1 : 0;
-	const s = Math.pow(1 + n, e);
-	return t.formatResults($(t.getRuntime())), (a * n + r * n * s) * (o ? 1 / (1 + n) : 1) / (1 - s);
-}
-function Nt(t, n, e, r, a = 0, o = 0) {
-	return e <= 0 || n < 1 || n > e ? NaN : gt(t, e, r, a, o) - ft(t, n, e, r, a, o);
-}
-function yt(n, e, r, a, o = 0) {
+	if (t.formatResults($(t.getRuntime())), 0 === n) return (-r - a) / e;
+	if (n <= -1) return NaN;
+	const i = e * Math.log1p(n), s = (r / -Math.expm1(-i) + a / Math.expm1(i)) * n;
+	return -(o ? s / (1 + n) : s);
+}
+function bt(n, e, r, a, o = 0, i = 0) {
+	if (e < 1 || e - 1 >= r) return NaN;
+	if (t.formatResults($(t.getRuntime())), 0 === n) return -(a + o) / r;
+	if (n <= -1) return NaN;
+	const s = Math.log1p(n), u = -Math.expm1(-r * s);
+	if (i && 1 === e) return -n * (a + o * Math.exp(-r * s)) / (u * (1 + n));
+	const l = i ? e - 2 : e - 1;
+	return -(a + o) * (n * Math.exp((l - r) * s)) / u;
+}
+function Et(n, e, r, a, o = 0) {
 	if (!t.isValidDate(n) || !t.isValidDate(e) || !E(o) || r <= 0 || a <= 0 || n >= e) return NaN;
-	let s, i;
+	let i, s;
 	switch (o) {
 		case 0:
-			s = 360, i = W(n, e, !1);
+			i = 360, s = W(n, e, !1);
 			break;
 		case 1:
 		case 3:
-			s = 365, i = K(n, e, "D");
+			i = 365, s = K(n, e, "D");
 			break;
 		case 2:
-			s = 360, i = K(n, e, "D");
+			i = 360, s = K(n, e, "D");
 			break;
 		case 4:
-			s = 360, i = W(n, e, !0);
+			i = 360, s = W(n, e, !0);
 			break;
 		default: return NaN;
 	}
-	return a - r * a * i / s;
+	return a - r * a * s / i;
 }
-function bt(e, r, a, o = 0, s = 0) {
-	if (s = s ? 1 : 0, -1 === e) {
-		if (0 === r) return NaN;
-		throw n.BuiltIn.Div0;
-	}
-	return t.formatResults($(t.getRuntime())), 0 === e ? -a * r - o : ((1 - Math.pow(1 + e, r)) * a * (1 + e * s) / e - o) / Math.pow(1 + e, r);
+function vt(e, r, a, o = 0, i = 0) {
+	if (t.formatResults($(t.getRuntime())), 0 === e) return -(o + a * r);
+	const s = Z(1 + e, r);
+	if (0 === s) throw n.BuiltIn.Div0;
+	return -(o + (s - 1) / e * (1 + e * (i ? 1 : 0)) * a) / s;
 }
-function Et(t, e, r, a = 0, o = 0, s = .1) {
-	if (s <= -1) throw n.BuiltIn.Value;
-	o = o ? 1 : 0;
-	let i = s;
-	for (let n = 0; n < 100; n++) {
-		if (i <= -1) return NaN;
-		let n, s;
-		if (Math.abs(i) < Vt) n = r * (1 + t * i) + e * (1 + i * o) * t + a, s = r * t + e * o * t;
-		else {
-			const l = Math.pow(1 + i, t), u = t * Math.pow(1 + i, t - 1);
-			n = r * l + e * (1 / i + o) * (l - 1) + a, s = r * u + e * (1 / i + o) * u + e * (-1 / (i * i)) * (l - 1);
-		}
-		if (Math.abs(n) < Vt) return i;
-		i -= n / s;
+function Rt(t, e, r, a = 0, o = 0, i = .1) {
+	if (i <= -1) throw n.BuiltIn.Value;
+	const s = o ? 1 : 0, u = (n) => {
+		if (0 === n) return r + e * t + a;
+		const o = Z(1 + n, t);
+		return r * o + (o - 1) / n * (1 + n * s) * e + a;
+	};
+	let l = i, f = u(l), c = f > 0 ? i - .001 : i + .001, m = u(c);
+	for (let t = 0; t < It; t++) {
+		const t = c - m * (c - l) / (m - f);
+		if (!Number.isFinite(t)) return NaN;
+		const n = u(t);
+		if (!Number.isFinite(n)) return NaN;
+		if (Math.abs(t - c) < 1e-7 && Math.abs(n) < 1e-7) return t <= -1 ? NaN : t;
+		l = c, f = m, c = t, m = n;
 	}
 	return NaN;
 }
-function vt(t, n, e) {
-	return t <= 0 || 0 === n || e < 0 && n > 0 || e > 0 && n < 0 ? NaN : Math.pow(e / n, 1 / t) - 1;
+var It = 200;
+function St(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 = Z(e / n, 1 / t) - 1;
+	return Number.isFinite(r) ? r : NaN;
 }
-function Rt(t, e, r) {
+function Ct(t, e, r) {
 	if (0 === r) throw n.BuiltIn.Div0;
 	return (t - e) / r;
 }
-function It(e, r, a, o = 0, s = 1, i = [
+function Tt(e, r, a, o = 0, i = 1, s = [
 	0,
 	1,
 	2,
 	3,
 	4
 ]) {
-	const l = a ?? r;
-	if (!t.isValidDate(r) || !t.isValidDate(l)) throw n.BuiltIn.Num;
+	const u = a ?? r;
+	if (!t.isValidDate(r) || !t.isValidDate(u)) throw n.BuiltIn.Num;
 }
-function St(t, n, e, r) {
+function xt(t, n, e, r) {
 	return r > e ? NaN : (t - n) * (e - r + 1) * 2 / (e * (e + 1));
 }
-function Ct(n, e, r) {
+function At(n, e, r) {
 	if (n = Math.round(n), e = Math.round(e), !t.isValidDate(n) || !t.isValidDate(e) || n >= e || y(n, e)) return NaN;
 	const a = 360 - r * (e - n);
 	return 0 === a ? 0 : a < 0 ? NaN : 365 * r / a;
 }
-function Tt(n, e, r) {
+function wt(n, e, r) {
 	if (n = Math.round(n), e = Math.round(e), !t.isValidDate(n) || !t.isValidDate(e) || n >= e || y(n, e)) return NaN;
 	const a = 360 - r * (e - n);
 	return 0 === a ? 0 : a < 0 ? NaN : 100 * (1 - r * (e - n) / 360);
 }
-function At(n, e, r) {
+function Vt(n, e, r) {
 	return n = Math.round(n), e = Math.round(e), !t.isValidDate(n) || !t.isValidDate(e) || n >= e || y(n, e) ? NaN : 360 * (100 - r) / (r * (e - n));
 }
-function wt(t, e, r = .1) {
+function Bt(t, e, r = .1) {
 	const a = t.flatten({
 		includeEmpty: !0,
 		onError: "value"
@@ -726,35 +774,35 @@ function wt(t, e, r = .1) {
 		onError: "value"
 	});
 	if (a.length !== o.length) return NaN;
-	const s = [], i = [];
+	const i = [], s = [];
 	for (let t = 0; t < a.length; t++) {
 		const e = a[t], r = o[t];
 		if (null !== e) {
 			if (null === r) return NaN;
 			if (n.isError(e) || n.isError(r)) return n.BuiltIn.Value;
 			if ("number" != typeof r || isNaN(r)) return n.BuiltIn.Value;
-			s.push(e), i.push(r);
+			i.push(e), s.push(r);
 		}
 	}
-	const l = s.some((t) => t > 0), u = s.some((t) => t < 0);
-	if (!l || !u) return NaN;
-	const f = i[0], c = i.map((t) => N(t, f) / 365), m = (t) => {
+	const u = i.some((t) => t > 0), l = i.some((t) => t < 0);
+	if (!u || !l) return NaN;
+	const f = s[0], c = s.map((t) => g(t, f) / 365), m = (t) => {
 		const n = 1 + t;
 		let e = 0;
-		for (let t = 0; t < s.length; t++) e += s[t] / Math.pow(n, c[t]);
+		for (let t = 0; t < i.length; t++) e += i[t] / Math.pow(n, c[t]);
 		return e;
 	};
 	let h = r;
 	for (let t = 0; t < 20; t++) {
-		const t = m(h), n = (m(h + Vt) - t) / Vt;
-		if (Math.abs(n) < Vt) break;
+		const t = m(h), n = (m(h + Pt) - t) / Pt;
+		if (Math.abs(n) < Pt) break;
 		const e = h - t / n;
-		if (Math.abs(e - h) < Vt) return e;
+		if (Math.abs(e - h) < Pt) return e;
 		h = e, h <= -1 && (h = -.9999999);
 	}
 	return NaN;
 }
-function xt(t, e, r) {
+function Ot(t, e, r) {
 	if (t <= 0) return NaN;
 	const a = e.flatten({
 		includeEmpty: !0,
@@ -765,7 +813,7 @@ function xt(t, e, r) {
 	});
 	if (a.length !== o.length) return NaN;
 	if (0 === a.length) return NaN;
-	const s = [], i = [];
+	const i = [], s = [];
 	for (let t = 0; t < a.length; t++) {
 		const e = a[t], r = o[t];
 		if (null !== e || null !== r) {
@@ -773,200 +821,200 @@ function xt(t, e, r) {
 			if (n.isError(e) || n.isError(r)) return n.BuiltIn.Value;
 			if ("number" != typeof e) return NaN;
 			if ("number" != typeof r) return n.BuiltIn.Value;
-			s.push(e), i.push(r);
+			i.push(e), s.push(r);
 		}
 	}
-	for (let t = 1; t < i.length; t++) if (i[t] < i[t - 1]) return NaN;
-	let l = 0;
-	const u = i[0];
-	for (let n = 0; n < s.length; n++) l += s[n] / Math.pow(1 + t, N(i[n], u) / 365);
-	return l;
+	for (let t = 1; t < s.length; t++) if (s[t] < s[t - 1]) return NaN;
+	let u = 0;
+	const l = s[0];
+	for (let n = 0; n < i.length; n++) u += i[n] / Math.pow(1 + t, g(s[n], l) / 365);
+	return u;
 }
-var Vt = 1e-7;
-var Bt = o({
-	ACCRINTM: () => Ot,
-	AMORLINC: () => kt,
-	INTRATE: () => Pt,
-	PRICEMAT: () => Lt,
-	RECEIVED: () => Ft,
-	YIELDDISC: () => Yt,
-	YIELDMAT: () => Ut
+var Pt = 1e-7;
+var Ft = o({
+	ACCRINTM: () => Yt,
+	AMORLINC: () => jt,
+	INTRATE: () => Lt,
+	PRICEMAT: () => qt,
+	RECEIVED: () => Ut,
+	YIELDDISC: () => kt,
+	YIELDMAT: () => Xt
 });
-function Ot(n, e, r, a, o = 0) {
+function Yt(n, e, r, a, o = 0) {
 	if (o = Math.floor(o), !t.isValidDate(n) || !t.isValidDate(e) || !E(o) || r <= 0 || a <= 0) return NaN;
 	if (Math.floor(n) > Math.floor(e)) return NaN;
 	if (Math.floor(n) === Math.floor(e)) return 0;
-	const { days: s, yearDays: i } = I(n, e, o);
-	return a * r * s / i;
+	const { days: i, yearDays: s } = I(n, e, o);
+	return a * r * i / s;
 }
-function Pt(n, e, r, a, o = 0) {
+function Lt(n, e, r, a, o = 0) {
 	if (o = Math.floor(o), !t.isValidDate(n) || !t.isValidDate(e) || !E(o) || r <= 0 || a <= 0 || Math.floor(n) >= Math.floor(e)) return NaN;
-	const { days: s, yearDays: i } = I(n, e, o);
-	return (a - r) / r * (i / s);
+	const { days: i, yearDays: s } = I(n, e, o);
+	return (a - r) / r * (s / i);
 }
-function Ft(n, e, r, a, o = 0) {
+function Ut(n, e, r, a, o = 0) {
 	if (o = Math.floor(o), !t.isValidDate(n) || !t.isValidDate(e) || r <= 0 || a <= 0 || !E(o) || Math.floor(n) >= Math.floor(e)) return NaN;
-	const { days: s, yearDays: i } = I(n, e, o), l = r / (1 - a * s / i);
-	return l < 0 ? NaN : l;
+	const { days: i, yearDays: s } = I(n, e, o), u = r / (1 - a * i / s);
+	return u < 0 ? NaN : u;
 }
-function Yt(n, e, r, a, o = 0) {
+function kt(n, e, r, a, o = 0) {
 	if (o = Math.floor(o), !t.isValidDate(n) || !t.isValidDate(e) || r <= 0 || a <= 0 || !E(o) || Math.floor(n) >= Math.floor(e)) return NaN;
-	const { days: s, yearDays: i } = I(n, e, o);
-	return (a / r - 1) / (s / i);
+	const { days: i, yearDays: s } = I(n, e, o);
+	return (a / r - 1) / (i / s);
 }
-function Lt(n, e, r, a, o, s = 0) {
-	if (s = Math.floor(s), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o < 0 || !E(s) || !qt(r, n, e)) return NaN;
-	const { yearDays: i } = I(r, n, s), { days: l } = I(n, e, s), { days: u } = I(r, e, s), { days: f } = I(r, n, s);
-	return (100 + u / i * a * 100) / (1 + l / i * o) - f / i * a * 100;
+function qt(n, e, r, a, o, i = 0) {
+	if (i = Math.floor(i), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o < 0 || !E(i) || !_t(r, n, e)) return NaN;
+	const { yearDays: s } = I(r, n, i), { days: u } = I(n, e, i), { days: l } = I(r, e, i), { days: f } = I(r, n, i);
+	return (100 + l / s * a * 100) / (1 + u / s * o) - f / s * a * 100;
 }
-function Ut(n, e, r, a, o, s = 0) {
-	if (s = Math.floor(s), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o <= 0 || !E(s) || !qt(r, n, e)) return NaN;
-	const { yearDays: i } = I(r, n, s), { days: l } = I(n, e, s), { days: u } = I(r, e, s), { days: f } = I(r, n, s);
-	return ((1 + u / i * a) / (o / 100 + f / i * a) - 1) / (l / i);
+function Xt(n, e, r, a, o, i = 0) {
+	if (i = Math.floor(i), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o <= 0 || !E(i) || !_t(r, n, e)) return NaN;
+	const { yearDays: s } = I(r, n, i), { days: u } = I(n, e, i), { days: l } = I(r, e, i), { days: f } = I(r, n, i);
+	return ((1 + l / s * a) / (o / 100 + f / s * a) - 1) / (u / s);
 }
-function kt(n, e, r, a, o, s, i = 0) {
-	if (i = Math.floor(i), n <= 0 || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || n < a || o < 0 || s <= 0 || Math.floor(e) > Math.floor(r) || ![
+function jt(n, e, r, a, o, i, s = 0) {
+	if (s = Math.floor(s), n <= 0 || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || n < a || o < 0 || i <= 0 || Math.floor(e) > Math.floor(r) || ![
 		0,
 		1,
 		3,
 		4
-	].includes(i)) return NaN;
+	].includes(s)) return NaN;
 	o = o > 1 ? Math.floor(o) : Math.ceil(o);
-	const l = n - a, u = n * s, { days: f, yearDays: c } = I(e, r, i), m = f / c, h = Math.ceil(l / u - m);
-	return h < 0 ? 0 : 0 === o ? u * m : o === h ? l - u * (m + o - 1) : o > h ? 0 : u;
+	const u = n - a, l = n * i, { days: f, yearDays: c } = I(e, r, s), m = f / c, h = Math.ceil(u / l - m);
+	return h < 0 ? 0 : 0 === o ? l * m : o === h ? u - l * (m + o - 1) : o > h ? 0 : l;
 }
-function qt(t, n, e) {
+function _t(t, n, e) {
 	return Math.floor(e) > Math.floor(n) && Math.floor(n) > Math.floor(t);
 }
-var Xt = o({
-	COUPDAYBS: () => jt,
-	COUPDAYS: () => _t,
-	COUPDAYSNC: () => Gt,
-	COUPNCD: () => zt,
-	COUPNUM: () => Kt,
-	COUPPCD: () => Ht
+var Gt = o({
+	COUPDAYBS: () => zt,
+	COUPDAYS: () => Ht,
+	COUPDAYSNC: () => Kt,
+	COUPNCD: () => Qt,
+	COUPNUM: () => $t,
+	COUPPCD: () => Wt
 });
-function jt(n, e, r, a = 0) {
-	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Qt(n, e, r, a) ? x(n, e, r, a) : NaN;
+function zt(n, e, r, a = 0) {
+	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Zt(n, e, r, a) ? w(n, e, r, a) : NaN;
 }
-function _t(n, e, r, a = 0) {
-	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Qt(n, e, r, a) ? V(n, e, r, a) : NaN;
+function Ht(n, e, r, a = 0) {
+	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Zt(n, e, r, a) ? V(n, e, r, a) : NaN;
 }
-function Gt(n, e, r, a = 0) {
-	if (r = Math.floor(r), a = Math.floor(a), !(t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Qt(n, e, r, a))) return NaN;
-	const { days: o } = I(n, w(n, e, r), a);
+function Kt(n, e, r, a = 0) {
+	if (r = Math.floor(r), a = Math.floor(a), !(t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Zt(n, e, r, a))) return NaN;
+	const { days: o } = I(n, A(n, e, r), a);
 	return o;
 }
-function zt(n, e, r, a = 0) {
-	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && !(n >= e) && Qt(n, e, r, a) ? (t.formatResults("Short Date"), w(n, e, r)) : NaN;
+function Qt(n, e, r, a = 0) {
+	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && !(n >= e) && Zt(n, e, r, a) ? (t.formatResults("Short Date"), A(n, e, r)) : NaN;
 }
-function Ht(n, e, r, a = 0) {
-	if (r = Math.floor(r), a = Math.floor(a), !(t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Qt(n, e, r, a))) return NaN;
+function Wt(n, e, r, a = 0) {
+	if (r = Math.floor(r), a = Math.floor(a), !(t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Zt(n, e, r, a))) return NaN;
 	t.formatResults("d-mmm-yy");
-	const o = A(n, e, r);
+	const o = x(n, e, r);
 	return o < 0 ? 0 : o;
 }
-function Kt(n, e, r, a = 0) {
-	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Qt(n, e, r, a) ? A(n, e, r) < 0 ? NaN : B(n, e, r) : NaN;
+function $t(n, e, r, a = 0) {
+	return r = Math.floor(r), a = Math.floor(a), t.isValidDate(n) && t.isValidDate(e) && k(r) && E(a) && Zt(n, e, r, a) ? x(n, e, r) < 0 ? NaN : B(n, e, r) : NaN;
 }
-function Qt(t, n, e, r) {
+function Zt(t, n, e, r) {
 	return k(e) && E(r) && Math.floor(t) < Math.floor(n);
 }
-function Wt(t, n) {
+function Jt(t, n) {
 	const e = 1e-7;
 	let r = t, a = 1, o = 0;
 	for (; a > e && o < 500;) {
-		const t = (n(r + e) - n(r - e)) / 2e-7, s = r - n(r) / t;
-		a = Math.abs(s - r), r = s, o++;
+		const t = (n(r + e) - n(r - e)) / 2e-7, i = r - n(r) / t;
+		a = Math.abs(i - r), r = i, o++;
 	}
 	return Number.isNaN(r) || !Number.isFinite(r) || 500 === o ? function(t, n) {
-		const e = 1e-7, r = 60, a = 60, o = 1.6, s = -1, i = Number.MAX_VALUE;
-		if (t <= s || t >= i) return NaN;
-		let l, u, f = Math.max(t - .01, -.9999999), c = Math.min(t + .01, i - e), m = !1;
+		const e = 1e-7, r = 60, a = 60, o = 1.6, i = -1, s = Number.MAX_VALUE;
+		if (t <= i || t >= s) return NaN;
+		let u, l, f = Math.max(t - .01, -.9999999), c = Math.min(t + .01, s - e), m = !1;
 		for (let t = 0; t < r; t++) {
-			if (l = n(f), u = n(c), l * u <= 0) {
+			if (u = n(f), l = n(c), u * l <= 0) {
 				m = !0;
 				break;
 			}
-			f = Math.max(f + o * (f - c), -.9999999), c = Math.min(c + o * (c - f), i - e);
+			f = Math.max(f + o * (f - c), -.9999999), c = Math.min(c + o * (c - f), s - e);
 		}
 		if (!m) return NaN;
-		l = n(f);
-		let h = f, M = l, p = 0;
+		u = n(f);
+		let h = f, M = u, p = 0;
 		do
-			h = f + (c - f) / 2, M = n(h), l * M < 0 ? c = h : (f = h, l = M), p++;
+			h = f + (c - f) / 2, M = n(h), u * M < 0 ? c = h : (f = h, u = M), p++;
 		while (Math.abs(M) > e && p < a);
 		return h;
 	}(t, n) : r;
 }
-var $t = o({
-	DURATION: () => Jt,
-	MDURATION: () => tn,
-	PRICE: () => Zt,
-	YIELD: () => nn
+var tn = o({
+	DURATION: () => en,
+	MDURATION: () => rn,
+	PRICE: () => nn,
+	YIELD: () => an
 });
-function Zt(n, e, r, a, o, s, i = 0) {
-	return s = Math.floor(s), i = Math.floor(i), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a < 0 || o <= 0 || !k(s) || !E(i) || Math.floor(n) >= Math.floor(e) || !U(n, e, s) ? NaN : F(n, e, r, a, o, s, i);
+function nn(n, e, r, a, o, i, s = 0) {
+	return i = Math.floor(i), s = Math.floor(s), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a < 0 || o <= 0 || !k(i) || !E(s) || Math.floor(n) >= Math.floor(e) || !U(n, e, i) ? NaN : F(n, e, r, a, o, i, s);
 }
-function Jt(n, e, r, a, o, s = 0) {
-	return o = Math.floor(o), s = Math.floor(s), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a < 0 || !k(o) || !E(s) || Math.floor(n) >= Math.floor(e) || n <= 0 || e <= 366 ? NaN : Y(n, e, r, a, o, s);
+function en(n, e, r, a, o, i = 0) {
+	return o = Math.floor(o), i = Math.floor(i), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a < 0 || !k(o) || !E(i) || Math.floor(n) >= Math.floor(e) || n <= 0 || e <= 366 ? NaN : Y(n, e, r, a, o, i);
 }
-function tn(n, e, r, a, o, s = 0) {
-	return o = Math.floor(o), s = Math.floor(s), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a < 0 || !k(o) || !E(s) || Math.floor(n) >= Math.floor(e) || n <= 0 || e <= 366 ? NaN : Y(n, e, r, a, o, s) / (1 + a / o);
+function rn(n, e, r, a, o, i = 0) {
+	return o = Math.floor(o), i = Math.floor(i), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a < 0 || !k(o) || !E(i) || Math.floor(n) >= Math.floor(e) || n <= 0 || e <= 366 ? NaN : Y(n, e, r, a, o, i) / (1 + a / o);
 }
-function nn(n, e, r, a, o, s, i = 0) {
-	if (s = Math.floor(s), i = Math.floor(i), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a <= 0 || o <= 0 || !k(s) || !E(i) || Math.floor(n) >= Math.floor(e) || !U(n, e, s)) return NaN;
-	if (B(n, e, s) > 1) {
-		const t = Wt(r || .01, (t) => F(n, e, r, t, o, s, i) - a);
+function an(n, e, r, a, o, i, s = 0) {
+	if (i = Math.floor(i), s = Math.floor(s), !t.isValidDate(n) || !t.isValidDate(e) || r < 0 || a <= 0 || o <= 0 || !k(i) || !E(s) || Math.floor(n) >= Math.floor(e) || !U(n, e, i)) return NaN;
+	if (B(n, e, i) > 1) {
+		const t = Jt(r || .01, (t) => F(n, e, r, t, o, i, s) - a);
 		return Number.isNaN(t) ? NaN : t;
 	}
-	const l = x(n, e, s, i), u = V(n, e, s, i), { days: f } = I(n, e, i), c = a / 100 + l / u * (r / s);
-	return (o / 100 + r / s - c) / c * s * (u / f);
+	const u = w(n, e, i, s), l = V(n, e, i, s), { days: f } = I(n, e, s), c = a / 100 + u / l * (r / i);
+	return (o / 100 + r / i - c) / c * i * (l / f);
 }
-var en = o({
-	ODDFPRICE: () => rn,
-	ODDFYIELD: () => an,
-	ODDLPRICE: () => on,
-	ODDLYIELD: () => sn
+var on = o({
+	ODDFPRICE: () => sn,
+	ODDFYIELD: () => un,
+	ODDLPRICE: () => ln,
+	ODDLYIELD: () => fn
 });
-function rn(n, e, r, a, o, s, i, l, u = 0) {
-	return l = Math.floor(l), u = Math.floor(u), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || !t.isValidDate(a) || o < 0 || s < 0 || i <= 0 || !k(l) || !E(u) || !fn(n, e, r, a, l) ? NaN : P(n, e, r, a, o, s, i, l, u);
+function sn(n, e, r, a, o, i, s, u, l = 0) {
+	return u = Math.floor(u), l = Math.floor(l), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || !t.isValidDate(a) || o < 0 || i < 0 || s <= 0 || !k(u) || !E(l) || !hn(n, e, r, a, u) ? NaN : P(n, e, r, a, o, i, s, u, l);
 }
-function an(n, e, r, a, o, s, i, l, u = 0) {
-	if (l = Math.floor(l), u = Math.floor(u), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || !t.isValidDate(a) || o < 0 || s <= 0 || i <= 0 || !k(l) || !E(u) || !fn(n, e, r, a, l)) return NaN;
-	const { days: f } = I(n, e, u), c = Wt((o * f * 100 - (s - 100)) / (.25 * (s - 100) * (1 + 2 * f) + 100 * f), (t) => s - P(n, e, r, a, o, t, i, l, u));
+function un(n, e, r, a, o, i, s, u, l = 0) {
+	if (u = Math.floor(u), l = Math.floor(l), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || !t.isValidDate(a) || o < 0 || i <= 0 || s <= 0 || !k(u) || !E(l) || !hn(n, e, r, a, u)) return NaN;
+	const { days: f } = I(n, e, l), c = Jt((o * f * 100 - (i - 100)) / (.25 * (i - 100) * (1 + 2 * f) + 100 * f), (t) => i - P(n, e, r, a, o, t, s, u, l));
 	return Number.isNaN(c) ? NaN : c;
 }
-function on(n, e, r, a, o, s, i, l = 0) {
-	return i = Math.floor(i), l = Math.floor(l), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o < 0 || s <= 0 || !k(i) || !E(l) || !cn(n, e, r, i) ? NaN : function(t, n, e, r, a, o, s, i) {
-		const { fAi: l, fDCi: u, fDSCi: f } = ln(t, n, e, s, i);
-		return (o * s + 100 * r * (u - l * (1 + a * f / s))) / (a * f + s);
-	}(n, e, r, a, o, s, i, l);
+function ln(n, e, r, a, o, i, s, u = 0) {
+	return s = Math.floor(s), u = Math.floor(u), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o < 0 || i <= 0 || !k(s) || !E(u) || !Mn(n, e, r, s) ? NaN : function(t, n, e, r, a, o, i, s) {
+		const { fAi: u, fDCi: l, fDSCi: f } = cn(t, n, e, i, s);
+		return (o * i + 100 * r * (l - u * (1 + a * f / i))) / (a * f + i);
+	}(n, e, r, a, o, i, s, u);
 }
-function sn(n, e, r, a, o, s, i, l = 0) {
-	if (i = Math.floor(i), l = Math.floor(l), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o <= 0 || s <= 0 || !k(i) || !E(l) || !cn(n, e, r, i)) return NaN;
-	const { fAi: u, fDCi: f, fDSCi: c } = ln(n, e, r, i, l);
-	return (i * (s - o) + 100 * a * (f - u)) / (c * o + 100 * a * u * c / i);
+function fn(n, e, r, a, o, i, s, u = 0) {
+	if (s = Math.floor(s), u = Math.floor(u), !t.isValidDate(n) || !t.isValidDate(e) || !t.isValidDate(r) || a < 0 || o <= 0 || i <= 0 || !k(s) || !E(u) || !Mn(n, e, r, s)) return NaN;
+	const { fAi: l, fDCi: f, fDSCi: c } = cn(n, e, r, s, u);
+	return (s * (i - o) + 100 * a * (f - l)) / (c * o + 100 * a * l * c / s);
 }
-function ln(n, e, r, a, o) {
-	const s = function(n, e, r) {
-		const a = t.fromSerialDate(n, !0), o = t.fromSerialDate(e, !0), s = 12 / r;
+function cn(n, e, r, a, o) {
+	const i = function(n, e, r) {
+		const a = t.fromSerialDate(n, !0), o = t.fromSerialDate(e, !0), i = 12 / r;
 		o.setFullYear(a.getFullYear()), o > a && o.setFullYear(o.getFullYear() - 1);
-		for (; o < a;) o.setMonth(o.getMonth() + s);
+		for (; o < a;) o.setMonth(o.getMonth() + i);
 		return t.toSerialDate(o, !0);
 	}(e, r, a);
 	return {
-		fAi: un(r, n, s, a, o),
-		fDCi: un(r, e, s, a, o),
-		fDSCi: un(n, e, s, a, o)
+		fAi: mn(r, n, i, a, o),
+		fDCi: mn(r, e, i, a, o),
+		fDSCi: mn(n, e, i, a, o)
 	};
 }
-function un(n, e, r, a, o) {
-	const s = t.fromSerialDate(n, !0), i = t.fromSerialDate(e, !0), l = 12 / a, u = t.fromSerialDate(r, !0);
-	for (u.setFullYear(s.getFullYear()), u < s && u.setFullYear(u.getFullYear() + 1); u > s;) u.setMonth(u.getMonth() - l);
-	let f = t.toSerialDate(u, !0);
-	u.setMonth(u.getMonth() + l);
-	let c = t.toSerialDate(u, !0);
+function mn(n, e, r, a, o) {
+	const i = t.fromSerialDate(n, !0), s = t.fromSerialDate(e, !0), u = 12 / a, l = t.fromSerialDate(r, !0);
+	for (l.setFullYear(i.getFullYear()), l < i && l.setFullYear(l.getFullYear() + 1); l > i;) l.setMonth(l.getMonth() - u);
+	let f = t.toSerialDate(l, !0);
+	l.setMonth(l.getMonth() + u);
+	let c = t.toSerialDate(l, !0);
 	const m = (t, n, e) => 1 === o || 3 === o ? e - n : V(n, e, a, t);
 	if (c >= e) {
 		const { days: t } = I(n, e, o);
@@ -974,111 +1022,111 @@ function un(n, e, r, a, o) {
 	}
 	const { days: h } = I(n, c, o);
 	let M = h / m(o, f, c);
-	const p = t.fromSerialDate(c, !0), D = t.fromSerialDate(c, !0);
-	for (D.setMonth(D.getMonth() + l); D < i;) p.setMonth(p.getMonth() + l), D.setMonth(D.getMonth() + l), M += 1;
-	f = t.toSerialDate(p, !0), c = t.toSerialDate(D, !0);
-	const { days: d } = I(f, e, o);
-	return M += d / m(o, f, c), M;
+	const p = t.fromSerialDate(c, !0), N = t.fromSerialDate(c, !0);
+	for (N.setMonth(N.getMonth() + u); N < s;) p.setMonth(p.getMonth() + u), N.setMonth(N.getMonth() + u), M += 1;
+	f = t.toSerialDate(p, !0), c = t.toSerialDate(N, !0);
+	const { days: D } = I(f, e, o);
+	return M += D / m(o, f, c), M;
 }
-function fn(n, e, r, a, o) {
+function hn(n, e, r, a, o) {
 	return Math.floor(e) > Math.floor(a) && Math.floor(a) > Math.floor(n) && Math.floor(n) > Math.floor(r) && function(n, e, r) {
-		const a = t.fromSerialDate(n, !0), o = t.fromSerialDate(e, !0), s = g(a.getFullYear(), a.getMonth(), a.getDate()), i = g(o.getFullYear(), o.getMonth(), o.getDate());
-		return !!(a.getDate() === o.getDate() || s && i) && Math.abs(12 * (o.getFullYear() - a.getFullYear()) + (o.getMonth() - a.getMonth())) % (12 / r) == 0;
+		const a = t.fromSerialDate(n, !0), o = t.fromSerialDate(e, !0), i = d(a.getFullYear(), a.getMonth(), a.getDate()), s = d(o.getFullYear(), o.getMonth(), o.getDate());
+		return !!(a.getDate() === o.getDate() || i && s) && Math.abs(12 * (o.getFullYear() - a.getFullYear()) + (o.getMonth() - a.getMonth())) % (12 / r) == 0;
 	}(e, a, o) && U(r, e, o);
 }
-function cn(t, n, e, r) {
+function Mn(t, n, e, r) {
 	return Math.floor(n) > Math.floor(t) && Math.floor(t) > Math.floor(e) && U(e, n, r);
 }
-var mn = o({ VDB: () => hn });
-function hn(e, r, a, o, s, i = 2, l = !1) {
-	if (!t.isValidDate(o) || !t.isValidDate(s) || e < 0 || r < 0 || a < 0 || o < 0 || s < 0 || s > a || o > s || i < 0) return NaN;
-	if (0 === a && 0 === o && 0 === s) throw n.BuiltIn.Div0;
+var pn = o({ VDB: () => Nn });
+function Nn(e, r, a, o, i, s = 2, u = !1) {
+	if (!t.isValidDate(o) || !t.isValidDate(i) || e < 0 || r < 0 || a < 0 || o < 0 || i < 0 || i > a || o > i || s < 0) return NaN;
+	if (0 === a && 0 === o && 0 === i) throw n.BuiltIn.Div0;
 	if (e < r) {
-		if (o >= 1 || l) return 0;
-		const t = r - e, n = s - o;
+		if (o >= 1 || u) return 0;
+		const t = r - e, n = i - o;
 		return -(n >= 1 ? t : t * n);
 	}
-	return l ? function(t, n, e, r, a, o) {
-		const s = Math.floor(r) + 1, i = Math.ceil(a);
-		let l = 0;
-		for (let u = s; u <= i; u++) {
-			let f = L(t, n, e, u, o);
-			u === s ? f *= Math.min(a, s) - r : u === i && (f *= a - (i - 1)), l += f;
+	return u ? function(t, n, e, r, a, o) {
+		const i = Math.floor(r) + 1, s = Math.ceil(a);
+		let u = 0;
+		for (let l = i; l <= s; l++) {
+			let f = L(t, n, e, l, o);
+			l === i ? f *= Math.min(a, i) - r : l === s && (f *= a - (s - 1)), u += f;
 		}
-		return l;
-	}(e, r, a, o, s, i) : function(t, n, e, r, a, o) {
-		const s = Math.ceil(a);
-		let i = t, l = !1, u = 0, f = 0;
-		for (let c = 1; c <= s && !(i <= n); c++) {
-			let s;
-			if (l) s = u;
+		return u;
+	}(e, r, a, o, i, s) : function(t, n, e, r, a, o) {
+		const i = Math.ceil(a);
+		let s = t, u = !1, l = 0, f = 0;
+		for (let c = 1; c <= i && !(s <= n); c++) {
+			let i;
+			if (u) i = l;
 			else {
-				const r = L(t, n, e, c, o), a = e - (c - 1), f = a > 0 ? (i - n) / a : 0;
-				f > r ? (u = f, l = !0, s = f) : s = r;
+				const r = L(t, n, e, c, o), a = e - (c - 1), f = a > 0 ? (s - n) / a : 0;
+				f > r ? (l = f, u = !0, i = f) : i = r;
 			}
-			s = Math.min(s, i - n);
+			i = Math.min(i, s - n);
 			const m = Math.max(c - 1, r);
-			f += s * Math.max(0, Math.min(c, a) - m), i -= s;
+			f += i * Math.max(0, Math.min(c, a) - m), s -= i;
 		}
 		return f;
-	}(e, r, a, o, s, i);
+	}(e, r, a, o, i, s);
 }
-var Mn = Object.freeze({ includeEmpty: !0 }), pn = (Object.freeze({ axis: e.Axis.Column }), Object.freeze({ axis: e.Axis.Row }), Object.freeze({
+var Dn = Object.freeze({ includeEmpty: !0 }), dn = (Object.freeze({ axis: e.Axis.Column }), Object.freeze({ axis: e.Axis.Row }), Object.freeze({
 	type: r.Number,
 	axis: e.Axis.Column
-})), Dn = o({
-	FORECAST_ETS: () => dn,
-	FORECAST_ETS_CONFINT: () => gn,
-	FORECAST_ETS_SEASONALITY: () => Nn,
-	FORECAST_ETS_STAT: () => yn
+})), gn = o({
+	FORECAST_ETS: () => yn,
+	FORECAST_ETS_CONFINT: () => bn,
+	FORECAST_ETS_SEASONALITY: () => En,
+	FORECAST_ETS_STAT: () => vn
 });
-function dn(t, e, r, a = 1, o = 1, s = 1) {
-	const i = En(e, r, o, s);
-	if (n.isError(i)) return i;
-	const { values: l, stepSize: u, lastTime: f, firstTime: c } = i, m = Math.round((t - f) / u), h = In(l, a);
+function yn(t, e, r, a = 1, o = 1, i = 1) {
+	const s = In(e, r, o, i);
+	if (n.isError(s)) return s;
+	const { values: u, stepSize: l, lastTime: f, firstTime: c } = s, m = Math.round((t - f) / l), h = Tn(u, a);
 	if (n.isError(h)) return h;
-	const { alpha: M, beta: p, gamma: D, period: d, b0: g } = h, { L: N, T: y, S: b, finalIndex: E } = Rn(l, M, p, D, d, g).finalState;
-	let v = N + m * y;
-	return d > 1 && (v += b[(E + m) % d]), v;
+	const { alpha: M, beta: p, gamma: N, period: D, b0: d } = h, { L: g, T: y, S: b, finalIndex: E } = Cn(u, M, p, N, D, d).finalState;
+	let v = g + m * y;
+	return D > 1 && (v += b[(E + m) % D]), v;
 }
-function gn(e, r, a, o = .95, s = 1, i = 1, l = 1) {
+function bn(e, r, a, o = .95, i = 1, s = 1, u = 1) {
 	if (o < 0 || o >= 1) return n.BuiltIn.Num;
-	const u = En(r, a, i, l);
-	if (n.isError(u)) return u;
-	const { values: f, stepSize: c, lastTime: m } = u;
+	const l = In(r, a, s, u);
+	if (n.isError(l)) return l;
+	const { values: f, stepSize: c, lastTime: m } = l;
 	if (f.length < 4) return 0;
-	const h = Math.round((e - m) / c), M = In(f, s);
+	const h = Math.round((e - m) / c), M = Tn(f, i);
 	if (n.isError(M)) return M;
-	const { alpha: p, beta: D, gamma: d, period: g, b0: N } = M, y = function(t, n, e, r, a, o) {
-		const s = t.length;
-		let i, l;
-		const u = new Array(Math.max(1, a)).fill(0);
-		if (a > 1 && s >= 2 * a) {
+	const { alpha: p, beta: N, gamma: D, period: d, b0: g } = M, y = function(t, n, e, r, a, o) {
+		const i = t.length;
+		let s, u;
+		const l = new Array(Math.max(1, a)).fill(0);
+		if (a > 1 && i >= 2 * a) {
 			let n = 0, e = 0;
 			for (let e = 0; e < a; e++) n += t[e];
 			for (let n = a; n < 2 * a; n++) e += t[n];
-			i = n / a, l = (e - n) / (a * a);
+			s = n / a, u = (e - n) / (a * a);
 			const r = n / a;
-			for (let n = 0; n < a; n++) u[n] = t[n] - r;
-		} else i = t[0], l = void 0 !== o ? o : a > 1 && a < s ? (t[a] - t[0]) / a : 0;
+			for (let n = 0; n < a; n++) l[n] = t[n] - r;
+		} else s = t[0], u = void 0 !== o ? o : a > 1 && a < i ? (t[a] - t[0]) / a : 0;
 		let f = 0;
-		for (let o = 0; o < s; o++) {
-			const s = a > 1 ? o % a : 0, c = a > 1 ? u[s] : 0, m = i + l + c, h = t[o] - m;
+		for (let o = 0; o < i; o++) {
+			const i = a > 1 ? o % a : 0, c = a > 1 ? l[i] : 0, m = s + u + c, h = t[o] - m;
 			f += h * h;
-			const M = n * (t[o] - c) + (1 - n) * (i + l), p = e * (M - i) + (1 - e) * l;
-			a > 1 && (u[s] = r * (t[o] - M) + (1 - r) * c), i = M, l = p;
+			const M = n * (t[o] - c) + (1 - n) * (s + u), p = e * (M - s) + (1 - e) * u;
+			a > 1 && (l[i] = r * (t[o] - M) + (1 - r) * c), s = M, u = p;
 		}
-		return Math.sqrt(f / s);
-	}(f, p, D, d, g, N), b = function(t, n, e, r) {
+		return Math.sqrt(f / i);
+	}(f, p, N, D, d, g), b = function(t, n, e, r) {
 		const a = Math.abs(r);
 		if (0 === a) return 0;
-		let o = 0, s = 1;
+		let o = 0, i = 1;
 		for (let r = 1; r <= a; r++) {
-			o += s * s;
-			s = s + t + (e > 1 && r % e === 0 ? n : 0);
+			o += i * i;
+			i = i + t + (e > 1 && r % e === 0 ? n : 0);
 		}
 		return o;
-	}(p, d, g, h);
+	}(p, D, d, h);
 	return function(n) {
 		const e = (1 + n) / 2, r = t.getFunction("NORM.S.INV");
 		if (r) return r.execute(e);
@@ -1086,19 +1134,19 @@ function gn(e, r, a, o = .95, s = 1, i = 1, l = 1) {
 		return a - (2.515517 + .802853 * a + .010328 * a * a) / (1 + 1.432788 * a + .189269 * a * a + .001308 * a * a * a);
 	}(o) * y * Math.sqrt(b);
 }
-function Nn(t, e, r = 1, a = 1) {
-	const o = En(t, e, r, a);
+function En(t, e, r = 1, a = 1) {
+	const o = In(t, e, r, a);
 	if (n.isError(o)) return o === n.BuiltIn.NA ? o : 0;
-	const { values: s } = o;
-	return s.length < 4 ? 0 : vn(s);
+	const { values: i } = o;
+	return i.length < 4 ? 0 : Sn(i);
 }
-function yn(t, e, r, a = 1, o = 1, s = 1) {
+function vn(t, e, r, a = 1, o = 1, i = 1) {
 	if (r < 1 || r > 8) return n.BuiltIn.Num;
-	const i = En(t, e, o, s);
-	if (n.isError(i)) return i;
-	const { values: l, stepSize: u } = i;
-	if (8 === r) return u;
-	const f = In(l, a);
+	const s = In(t, e, o, i);
+	if (n.isError(s)) return s;
+	const { values: u, stepSize: l } = s;
+	if (8 === r) return l;
+	const f = Tn(u, a);
 	if (n.isError(f)) return f;
 	const { alpha: c, beta: m, gamma: h, period: M, b0: p } = f;
 	switch (r) {
@@ -1107,33 +1155,33 @@ function yn(t, e, r, a = 1, o = 1, s = 1) {
 		case 3: return h;
 		default: {
 			const t = function(t, n, e, r, a, o) {
-				const s = t.length;
-				let i, l;
-				const u = new Array(Math.max(1, a)).fill(0);
-				if (a > 1 && s >= 2 * a) {
+				const i = t.length;
+				let s, u;
+				const l = new Array(Math.max(1, a)).fill(0);
+				if (a > 1 && i >= 2 * a) {
 					let n = 0, e = 0;
 					for (let e = 0; e < a; e++) n += t[e];
 					for (let n = a; n < 2 * a; n++) e += t[n];
-					i = n / a, l = (e - n) / (a * a);
+					s = n / a, u = (e - n) / (a * a);
 					const r = n / a;
-					for (let n = 0; n < a; n++) u[n] = t[n] - r;
-				} else i = t[0], l = void 0 !== o ? o : a > 1 && a < s ? (t[a] - t[0]) / a : 0;
+					for (let n = 0; n < a; n++) l[n] = t[n] - r;
+				} else s = t[0], u = void 0 !== o ? o : a > 1 && a < i ? (t[a] - t[0]) / a : 0;
 				let f = 0, c = 0, m = 0, h = 0;
-				for (let n = 1; n < s; n++) h += Math.abs(t[n] - t[n - 1]);
-				const M = h / (s - 1);
-				for (let o = 0; o < s; o++) {
-					const s = t[o], h = a > 1 ? o % a : 0, M = a > 1 ? u[h] : 0, p = i + l + M, D = s - p;
-					f += Math.abs(D), c += D * D, m += Math.abs(D) / ((Math.abs(s) + Math.abs(p)) / 2 || 1);
-					const d = n * (s - M) + (1 - n) * (i + l), g = e * (d - i) + (1 - e) * l;
-					a > 1 && (u[h] = r * (s - d) + (1 - r) * M), i = d, l = g;
+				for (let n = 1; n < i; n++) h += Math.abs(t[n] - t[n - 1]);
+				const M = h / (i - 1);
+				for (let o = 0; o < i; o++) {
+					const i = t[o], h = a > 1 ? o % a : 0, M = a > 1 ? l[h] : 0, p = s + u + M, N = i - p;
+					f += Math.abs(N), c += N * N, m += Math.abs(N) / ((Math.abs(i) + Math.abs(p)) / 2 || 1);
+					const D = n * (i - M) + (1 - n) * (s + u), d = e * (D - s) + (1 - e) * u;
+					a > 1 && (l[h] = r * (i - D) + (1 - r) * M), s = D, u = d;
 				}
 				return {
-					mae: f / s,
-					rmse: Math.sqrt(c / s),
-					smape: m / s,
-					mase: 0 === M ? 0 : f / s / M
+					mae: f / i,
+					rmse: Math.sqrt(c / i),
+					smape: m / i,
+					mase: 0 === M ? 0 : f / i / M
 				};
-			}(l, c, m, h, M, p);
+			}(u, c, m, h, M, p);
 			if (4 === r) return t.mase;
 			if (5 === r) return t.smape;
 			if (6 === r) return t.mae;
@@ -1142,7 +1190,7 @@ function yn(t, e, r, a = 1, o = 1, s = 1) {
 	}
 	return n.BuiltIn.Num;
 }
-function bn(t, e) {
+function Rn(t, e) {
 	if (1 === t.length) return t[0].value;
 	const r = t.map((t) => t.value);
 	switch (e) {
@@ -1159,60 +1207,60 @@ function bn(t, e) {
 		default: return n.BuiltIn.Num;
 	}
 }
-function En(t, e, r, a) {
+function In(t, e, r, a) {
 	if (r < 0 || r > 1) return n.BuiltIn.Num;
-	const o = t.flatten(Mn), s = e.flatten(Mn);
-	if (o.length !== s.length) return n.BuiltIn.NA;
+	const o = t.flatten(Dn), i = e.flatten(Dn);
+	if (o.length !== i.length) return n.BuiltIn.NA;
 	if (o.length < 2) return n.BuiltIn.Num;
-	const i = s.map((t, n) => ({
+	const s = i.map((t, n) => ({
 		time: t,
 		value: o[n]
-	})).sort((t, n) => t.time - n.time), l = [];
-	let u = [i[0]];
-	for (let t = 1; t < i.length; t++) {
-		const e = i[t];
-		if (e.time === i[t - 1].time) u.push(e);
+	})).sort((t, n) => t.time - n.time), u = [];
+	let l = [s[0]];
+	for (let t = 1; t < s.length; t++) {
+		const e = s[t];
+		if (e.time === s[t - 1].time) l.push(e);
 		else {
-			const t = bn(u, a);
+			const t = Rn(l, a);
 			if (n.isError(t)) return t;
-			l.push({
-				time: u[0].time,
+			u.push({
+				time: l[0].time,
 				value: t
-			}), u = [e];
+			}), l = [e];
 		}
 	}
-	const f = bn(u, a);
+	const f = Rn(l, a);
 	if (n.isError(f)) return f;
-	if (l.push({
-		time: u[0].time,
+	if (u.push({
+		time: l[0].time,
 		value: f
-	}), l.length < 2) return n.BuiltIn.Num;
+	}), u.length < 2) return n.BuiltIn.Num;
 	const c = [];
-	for (let t = 1; t < l.length; t++) c.push(l[t].time - l[t - 1].time);
+	for (let t = 1; t < u.length; t++) c.push(u[t].time - u[t - 1].time);
 	c.sort((t, n) => t - n);
 	const m = Math.floor(c.length / 2), h = c.length % 2 != 0 ? c[m] : (c[m - 1] + c[m]) / 2;
 	if (h <= 0) return n.BuiltIn.Num;
-	const M = [l[0].value];
-	for (let t = 1; t < l.length; t++) {
-		const e = l[t - 1].time, a = l[t].time, o = e + h;
+	const M = [u[0].value];
+	for (let t = 1; t < u.length; t++) {
+		const e = u[t - 1].time, a = u[t].time, o = e + h;
 		if (a > o) {
 			const n = Math.round((a - e) / h) - 1;
 			for (let e = 1; e <= n; e++) if (0 === r) M.push(0);
 			else {
-				const r = l[t - 1].value, a = l[t].value;
+				const r = u[t - 1].value, a = u[t].value;
 				M.push(r + e / (n + 1) * (a - r));
 			}
 		} else if (Math.abs(a - o) > .01 * h) return n.BuiltIn.Num;
-		M.push(l[t].value);
+		M.push(u[t].value);
 	}
 	return {
 		values: M,
 		stepSize: h,
-		lastTime: l[l.length - 1].time,
-		firstTime: l[0].time
+		lastTime: u[u.length - 1].time,
+		firstTime: u[0].time
 	};
 }
-function vn(t) {
+function Sn(t) {
 	const n = t.length;
 	if (n < 4) return 0;
 	const e = t.reduce((t, n) => t + n, 0) / n;
@@ -1220,54 +1268,54 @@ function vn(t) {
 	for (let a = 0; a < n; a++) r += Math.pow(t[a] - e, 2);
 	if (0 === r) return 0;
 	let a = -Infinity, o = 0;
-	const s = Math.min(Math.floor(n / 2), 24);
-	for (let i = 2; i <= s; i++) {
-		let s = 0;
-		for (let r = 0; r < n - i; r++) s += (t[r] - e) * (t[r + i] - e);
-		const l = s / r;
-		l > a && l > .3 && (a = l, o = i);
+	const i = Math.min(Math.floor(n / 2), 24);
+	for (let s = 2; s <= i; s++) {
+		let i = 0;
+		for (let r = 0; r < n - s; r++) i += (t[r] - e) * (t[r + s] - e);
+		const u = i / r;
+		u > a && u > .3 && (a = u, o = s);
 	}
 	return o;
 }
-function Rn(t, n, e, r, a, o) {
-	const s = t.length;
-	let i, l;
-	if (a > 1 && s >= 2 * a) {
+function Cn(t, n, e, r, a, o) {
+	const i = t.length;
+	let s, u;
+	if (a > 1 && i >= 2 * a) {
 		let n = 0, e = 0;
 		for (let e = 0; e < a; e++) n += t[e];
 		for (let n = a; n < 2 * a; n++) e += t[n];
-		i = n / a, l = (e - n) / (a * a);
-	} else i = t[0], l = void 0 !== o ? o : a > 1 && a < s ? (t[a] - t[0]) / a : 0;
-	const u = new Array(Math.max(1, a)).fill(0);
-	if (a > 1 && s >= a) {
-		const n = u.length > 0 ? (() => {
+		s = n / a, u = (e - n) / (a * a);
+	} else s = t[0], u = void 0 !== o ? o : a > 1 && a < i ? (t[a] - t[0]) / a : 0;
+	const l = new Array(Math.max(1, a)).fill(0);
+	if (a > 1 && i >= a) {
+		const n = l.length > 0 ? (() => {
 			let n = 0;
 			for (let e = 0; e < a; e++) n += t[e];
 			return n / a;
-		})() : i;
-		for (let e = 0; e < a; e++) u[e] = t[e] - n;
+		})() : s;
+		for (let e = 0; e < a; e++) l[e] = t[e] - n;
 	}
 	let f = 0, c = 0;
-	for (let o = 0; o < s; o++) {
-		const s = t[o], m = a > 1 ? o % a : 0, h = a > 1 ? u[m] : 0, M = s - (i + l + h);
+	for (let o = 0; o < i; o++) {
+		const i = t[o], m = a > 1 ? o % a : 0, h = a > 1 ? l[m] : 0, M = i - (s + u + h);
 		f += M * M;
-		const p = n * (s - h) + (1 - n) * (i + l), D = e * (p - i) + (1 - e) * l;
-		a > 1 && (u[m] = r * (s - p) + (1 - r) * h), i = p, l = D, c = m;
+		const p = n * (i - h) + (1 - n) * (s + u), N = e * (p - s) + (1 - e) * u;
+		a > 1 && (l[m] = r * (i - p) + (1 - r) * h), s = p, u = N, c = m;
 	}
 	return {
-		mse: f / s,
+		mse: f / i,
 		finalState: {
-			L: i,
-			T: l,
-			S: u,
+			L: s,
+			T: u,
+			S: l,
 			finalIndex: c
 		}
 	};
 }
-function In(t, e) {
+function Tn(t, e) {
 	let r = 1;
 	if (0 === e) r = 1;
-	else if (1 === e) r = vn(t), r <= 1 && (r = 1);
+	else if (1 === e) r = Sn(t), r <= 1 && (r = 1);
 	else {
 		if (!(e > 1)) return n.BuiltIn.Num;
 		r = Math.floor(e);
@@ -1275,9 +1323,9 @@ function In(t, e) {
 	if (r > 1 && t.length < 2 * r) return n.BuiltIn.Num;
 	const a = t.length;
 	if (1 === r) {
-		const n = Math.max(1, Math.floor(a / 4)), e = Cn((n) => {
+		const n = Math.max(1, Math.floor(a / 4)), e = An((n) => {
 			const e = Math.max(.001, Math.min(.999, n[0])), r = Math.max(.001, Math.min(.999, n[1])), a = n[2];
-			return Rn(t, e, r, 0, 1, a).mse;
+			return Cn(t, e, r, 0, 1, a).mse;
 		}, [
 			.9,
 			.1,
@@ -1291,7 +1339,7 @@ function In(t, e) {
 			b0: e[2]
 		};
 	}
-	const o = Cn((n) => Rn(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 o = An((n) => Cn(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
@@ -1304,11 +1352,11 @@ function In(t, e) {
 		b0: 0
 	};
 }
-function Sn(t, n, e, r, a) {
+function xn(t, n, e, r, a) {
 	for (let o = 0; o < t.length; ++o) t[o] = n * e[o] + r * a[o];
 }
-function Cn(t, n, e) {
-	const r = (e = e || {}).maxIterations || 200 * n.length, a = e.nonZeroDelta || 1.05, o = e.zeroDelta || .001, s = e.minErrorDelta || 1e-6, i = e.minTolerance || 1e-5, l = void 0 !== e.rho ? e.rho : 1, u = void 0 !== e.chi ? e.chi : 2, f = void 0 !== e.psi ? e.psi : -.5, c = void 0 !== e.sigma ? e.sigma : .5;
+function An(t, n, e) {
+	const r = (e = e || {}).maxIterations || 200 * n.length, a = e.nonZeroDelta || 1.05, o = e.zeroDelta || .001, i = e.minErrorDelta || 1e-6, s = e.minTolerance || 1e-5, u = 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 m;
 	const h = n.length, M = new Array(h + 1);
 	M[0] = n, M[0].fx = t(n), M[0].id = 0;
@@ -1320,9 +1368,9 @@ function Cn(t, n, e) {
 		for (let n = 0; n < t.length; n++) M[h][n] = t[n];
 		M[h].fx = t.fx;
 	}
-	const D = (t, n) => t.fx - n.fx, d = n.slice(), g = n.slice(), N = n.slice(), y = n.slice();
+	const N = (t, n) => t.fx - n.fx, D = n.slice(), d = n.slice(), g = n.slice(), y = n.slice();
 	for (let n = 0; n < r; ++n) {
-		if (M.sort(D), e.history) {
+		if (M.sort(N), e.history) {
 			const t = M.map((t) => {
 				const n = t.slice();
 				return n.fx = t.fx, n.id = t.id, n;
@@ -1335,85 +1383,85 @@ function Cn(t, n, e) {
 		}
 		m = 0;
 		for (let t = 0; t < h; ++t) m = Math.max(m, Math.abs(M[0][t] - M[1][t]));
-		if (Math.abs(M[0].fx - M[h].fx) < s && m < i) break;
+		if (Math.abs(M[0].fx - M[h].fx) < i && m < s) break;
 		for (let t = 0; t < h; ++t) {
-			d[t] = 0;
-			for (let n = 0; n < h; ++n) d[t] += M[n][t];
-			d[t] /= h;
+			D[t] = 0;
+			for (let n = 0; n < h; ++n) D[t] += M[n][t];
+			D[t] /= h;
 		}
 		const n = M[h];
-		if (Sn(g, 1 + l, d, -l, n), g.fx = t(g), g.fx < M[0].fx) Sn(y, 1 + u, d, -u, n), y.fx = t(y), p(y.fx < g.fx ? y : g);
-		else if (g.fx >= M[h - 1].fx) {
+		if (xn(d, 1 + u, D, -u, n), d.fx = t(d), d.fx < M[0].fx) xn(y, 1 + l, D, -l, n), y.fx = t(y), p(y.fx < d.fx ? y : d);
+		else if (d.fx >= M[h - 1].fx) {
 			let e = !1;
-			if (g.fx > n.fx ? (Sn(N, 1 + f, d, -f, n), N.fx = t(N), N.fx < n.fx ? p(N) : e = !0) : (Sn(N, 1 - f * l, d, f * l, n), N.fx = t(N), N.fx < g.fx ? p(N) : e = !0), e) {
+			if (d.fx > n.fx ? (xn(g, 1 + f, D, -f, n), g.fx = t(g), g.fx < n.fx ? p(g) : e = !0) : (xn(g, 1 - f * u, D, f * u, n), g.fx = t(g), g.fx < d.fx ? p(g) : e = !0), e) {
 				if (c >= 1) break;
-				for (let n = 1; n < M.length; ++n) Sn(M[n], 1 - c, M[0], c, M[n]), M[n].fx = t(M[n]);
+				for (let n = 1; n < M.length; ++n) xn(M[n], 1 - c, M[0], c, M[n]), M[n].fx = t(M[n]);
 			}
-		} else p(g);
+		} else p(d);
 	}
-	return M.sort(D), {
+	return M.sort(N), {
 		fx: M[0].fx,
 		x: M[0]
 	};
 }
-var Tn = (t, e) => {
+var wn = (t, e) => {
 	const r = t.getRowCount(), a = t.getColumnCount(), o = r * a;
 	if (0 === o) throw n.BuiltIn.Value;
-	const s = Bn(t, o), i = 1 === r && a > 1, l = r > 1 && a > 1;
+	const i = Fn(t, o), s = 1 === r && a > 1, u = r > 1 && a > 1;
 	if (!e || 0 === e.size) {
 		const t = new Array(o);
 		for (let n = 0; n < o; n++) t[n] = [n + 1];
 		return {
-			ys: s,
+			ys: i,
 			xs: t,
 			k: 1,
-			isRowOriented: i,
-			isRectangularY: l,
+			isRowOriented: s,
+			isRectangularY: u,
 			yRows: r,
 			yCols: a
 		};
 	}
-	const u = e.getRowCount(), f = e.getColumnCount();
-	if (l) {
-		if (u !== r || f !== a) throw n.BuiltIn.Ref;
-		const t = Bn(e, o), c = new Array(o);
+	const l = e.getRowCount(), f = e.getColumnCount();
+	if (u) {
+		if (l !== r || f !== a) throw n.BuiltIn.Ref;
+		const t = Fn(e, o), c = new Array(o);
 		for (let n = 0; n < o; n++) c[n] = [t[n]];
 		return {
-			ys: s,
+			ys: i,
 			xs: c,
 			k: 1,
-			isRowOriented: i,
-			isRectangularY: l,
+			isRowOriented: s,
+			isRectangularY: u,
 			yRows: r,
 			yCols: a
 		};
 	}
-	if ((i ? f : u) !== o) throw n.BuiltIn.Ref;
-	const c = i ? u : f;
+	if ((s ? f : l) !== o) throw n.BuiltIn.Ref;
+	const c = s ? l : f;
 	return {
-		ys: s,
-		xs: On(e, o, c, i),
+		ys: i,
+		xs: Yn(e, o, c, s),
 		k: c,
-		isRowOriented: i,
-		isRectangularY: l,
+		isRowOriented: s,
+		isRectangularY: u,
 		yRows: r,
 		yCols: a
 	};
-}, An = (t) => {
+}, Vn = (t) => {
 	const e = new Array(t.length);
 	for (let r = 0; r < t.length; r++) {
 		if (t[r] <= 0) throw n.BuiltIn.Num;
 		e[r] = Math.log(t[r]);
 	}
 	return e;
-}, wn = (t, e, r) => {
-	let a, o, s;
+}, Bn = (t, e, r) => {
+	let a, o, i;
 	if (e && e.size > 0) {
 		const r = ((t, e) => {
 			const r = t.getRowCount(), a = t.getColumnCount(), o = r * a;
 			if (0 === o) throw n.BuiltIn.Ref;
 			if (1 === e.k) {
-				const n = Bn(t, o), e = new Array(o);
+				const n = Fn(t, o), e = new Array(o);
 				for (let t = 0; t < o; t++) e[t] = [n[t]];
 				return {
 					xs: e,
@@ -1421,89 +1469,89 @@ var Tn = (t, e) => {
 					cols: a
 				};
 			}
-			const s = e.isRowOriented ? a : r;
+			const i = e.isRowOriented ? a : r;
 			if ((e.isRowOriented ? r : a) !== e.k) throw n.BuiltIn.Ref;
 			return {
-				xs: On(t, s, e.k, e.isRowOriented),
-				rows: e.isRowOriented ? 1 : s,
-				cols: e.isRowOriented ? s : 1
+				xs: Yn(t, i, e.k, e.isRowOriented),
+				rows: e.isRowOriented ? 1 : i,
+				cols: e.isRowOriented ? i : 1
 			};
 		})(e, t);
-		a = r.xs, o = r.rows, s = r.cols;
-	} else a = t.xs, o = t.yRows, s = t.yCols;
-	const i = new Array(o);
-	let l = 0;
+		a = r.xs, o = r.rows, i = r.cols;
+	} else a = t.xs, o = t.yRows, i = t.yCols;
+	const s = new Array(o);
+	let u = 0;
 	for (let t = 0; t < o; t++) {
-		const n = new Array(s);
-		for (let t = 0; t < s; t++) n[t] = r(a[l++]);
-		i[t] = n;
+		const n = new Array(i);
+		for (let t = 0; t < i; t++) n[t] = r(a[u++]);
+		s[t] = n;
 	}
-	return i;
-}, xn = (t, n, e) => {
-	const r = t.length, a = n.length > 0 ? n[0].length : 0, o = [], s = [];
-	e && (o.push(new Array(r).fill(1)), s.push(a));
+	return s;
+}, On = (t, n, e) => {
+	const r = t.length, a = n.length > 0 ? n[0].length : 0, o = [], i = [];
+	e && (o.push(new Array(r).fill(1)), i.push(a));
 	for (let t = a - 1; t >= 0; t--) {
 		const e = new Array(r);
 		for (let a = 0; a < r; a++) e[a] = n[a][t];
-		o.push(e), s.push(a - 1 - t);
+		o.push(e), i.push(a - 1 - t);
 	}
-	const i = [], l = [], u = [];
+	const s = [], u = [], l = [];
 	for (let t = 0; t < o.length; t++) {
-		const n = o[t].slice(), e = Math.sqrt(Pn(n, n)), a = new Array(l.length).fill(0);
-		for (let t = 0; t < 2; t++) for (let t = 0; t < l.length; t++) {
-			const e = Pn(l[t], n);
-			for (let a = 0; a < r; a++) n[a] -= e * l[t][a];
+		const n = o[t].slice(), e = Math.sqrt(Ln(n, n)), a = new Array(u.length).fill(0);
+		for (let t = 0; t < 2; t++) for (let t = 0; t < u.length; t++) {
+			const e = Ln(u[t], n);
+			for (let a = 0; a < r; a++) n[a] -= e * u[t][a];
 			a[t] += e;
 		}
-		const s = Math.sqrt(Pn(n, n));
-		if (!(s <= 1e-10 * (e || 1))) {
-			for (let t = 0; t < r; t++) n[t] /= s;
-			a.push(s), l.push(n), u.push(a), i.push(t);
+		const i = Math.sqrt(Ln(n, n));
+		if (!(i <= 1e-10 * (e || 1))) {
+			for (let t = 0; t < r; t++) n[t] /= i;
+			a.push(i), u.push(n), l.push(a), s.push(t);
 		}
 	}
-	const f = i.length, c = new Array(f);
-	for (let n = 0; n < f; n++) c[n] = Pn(l[n], t);
+	const f = s.length, c = new Array(f);
+	for (let n = 0; n < f; n++) c[n] = Ln(u[n], t);
 	const m = new Array(f).fill(0);
 	for (let t = f - 1; t >= 0; t--) {
 		let n = c[t];
-		for (let e = t + 1; e < f; e++) n -= u[e][t] * m[e];
-		m[t] = n / u[t][t];
+		for (let e = t + 1; e < f; e++) n -= l[e][t] * m[e];
+		m[t] = n / l[t][t];
 	}
 	const h = Array.from({ length: f }, () => new Array(f).fill(0));
 	for (let t = f - 1; t >= 0; t--) {
-		h[t][t] = 1 / u[t][t];
+		h[t][t] = 1 / l[t][t];
 		for (let n = t + 1; n < f; n++) {
 			let e = 0;
-			for (let r = t + 1; r <= n; r++) e += u[r][t] * h[r][n];
+			for (let r = t + 1; r <= n; r++) e += l[r][t] * h[r][n];
 			h[t][n] = -e * h[t][t];
 		}
 	}
 	const M = new Array(a + 1).fill(0), p = new Array(a + 1).fill(0);
 	for (let t = 0; t < f; t++) {
-		const n = s[i[t]];
+		const n = i[s[t]];
 		M[n] = m[t];
 		let e = 0;
 		for (let n = t; n < f; n++) e += h[t][n] * h[t][n];
 		p[n] = e;
 	}
-	const D = (t) => {
+	const N = (t) => {
 		let n = e ? M[a] : 0;
 		for (let e = 0; e < a; e++) n += M[a - 1 - e] * t[e];
 		return n;
 	};
-	let d = 0;
+	let D = 0;
 	for (let e = 0; e < r; e++) {
-		const r = t[e] - D(n[e] ?? []);
-		d += r * r;
+		const r = t[e] - N(n[e] ?? []);
+		D += r * r;
 	}
-	let g = 0;
+	let d = 0;
 	if (e) {
 		let n = 0;
 		for (let e = 0; e < r; e++) n += t[e];
 		n /= r;
-		for (let e = 0; e < r; e++) g += (t[e] - n) * (t[e] - n);
-	} else for (let n = 0; n < r; n++) g += t[n] * t[n];
-	const N = g - d, y = e ? f - 1 : f, b = r - y - (e ? 1 : 0), E = b > 0 ? d / b : 0, v = b > 0 ? Math.sqrt(E) : 0, R = new Array(a + 1).fill(0);
+		for (let e = 0; e < r; e++) d += (t[e] - n) * (t[e] - n);
+	} else for (let n = 0; n < r; n++) d += t[n] * t[n];
+	const g = d - D, y = e ? f - 1 : f, b = r - y - (e ? 1 : 0), E = b > 0 ? D / b : 0, v = b > 0 ? Math.sqrt(E) : 0, R = new Array(a + 1).fill(0);
 	for (let t = 0; t <= a; t++) R[t] = v * Math.sqrt(Math.max(p[t], 0));
 	return {
 		coefficients: M,
@@ -1511,145 +1559,145 @@ var Tn = (t, e) => {
 		kEffective: y,
 		df: b,
 		sey: v,
-		r2: 0 === g ? 1 : N / g,
-		f: b > 0 && y > 0 && 0 !== E ? N / y / E : null,
-		ssReg: N,
-		ssResid: d,
-		predict: D
+		r2: 0 === d ? 1 : g / d,
+		f: b > 0 && y > 0 && 0 !== E ? g / y / E : null,
+		ssReg: g,
+		ssResid: D,
+		predict: N
 	};
-}, Vn = (t, e, r) => {
-	const a = e.length, o = n.BuiltIn.NA, s = (t, n) => {
+}, Pn = (t, e, r) => {
+	const a = e.length, o = n.BuiltIn.NA, i = (t, n) => {
 		const e = new Array(a).fill(o);
 		return e[0] = t, a > 1 && (e[1] = n), e;
-	}, i = t.standardErrors.slice();
-	return r || (i[a - 1] = o), [
+	}, s = t.standardErrors.slice();
+	return r || (s[a - 1] = o), [
 		e.slice(),
-		i,
-		s(t.r2, t.sey),
-		s(t.f ?? n.BuiltIn.Num, t.df),
-		s(t.ssReg, t.ssResid)
+		s,
+		i(t.r2, t.sey),
+		i(t.f ?? n.BuiltIn.Num, t.df),
+		i(t.ssReg, t.ssResid)
 	];
-}, Bn = (t, e) => {
+}, Fn = (t, e) => {
 	const r = new Array(e);
 	let a = 0;
-	for (const e of t.values(Mn)) {
+	for (const e of t.values(Dn)) {
 		if ("number" != typeof e) throw n.BuiltIn.Value;
 		r[a++] = e;
 	}
 	return r;
-}, On = (t, n, e, r) => {
-	const a = Bn(t, n * e), o = new Array(n);
+}, Yn = (t, n, e, r) => {
+	const a = Fn(t, n * e), o = new Array(n);
 	for (let t = 0; t < n; t++) {
-		const s = new Array(e);
-		for (let o = 0; o < e; o++) s[o] = r ? a[o * n + t] : a[t * e + o];
-		o[t] = s;
+		const i = new Array(e);
+		for (let o = 0; o < e; o++) i[o] = r ? a[o * n + t] : a[t * e + o];
+		o[t] = i;
 	}
 	return o;
-}, Pn = (t, n) => {
+}, Ln = (t, n) => {
 	let e = 0;
 	for (let r = 0; r < t.length; r++) e += t[r] * n[r];
 	return e;
-}, Fn = o({
-	GROWTH: () => kn,
-	LINEST: () => Yn,
-	LOGEST: () => Ln,
-	TREND: () => Un
+}, Un = o({
+	GROWTH: () => jn,
+	LINEST: () => kn,
+	LOGEST: () => qn,
+	TREND: () => Xn
 });
-function Yn(t, n, e = !0, r = !1) {
-	const a = Tn(t, n), o = xn(a.ys, a.xs, e), s = o.coefficients;
-	return r ? Vn(o, s, e) : [s.slice()];
+function kn(t, n, e = !0, r = !1) {
+	const a = wn(t, n), o = On(a.ys, a.xs, e), i = o.coefficients;
+	return r ? Pn(o, i, e) : [i.slice()];
 }
-function Ln(t, n, e = !0, r = !1) {
-	const a = Tn(t, n), o = xn(An(a.ys), a.xs, e), s = o.coefficients.map(Math.exp);
-	return r ? Vn(o, s, e) : [s];
+function qn(t, n, e = !0, r = !1) {
+	const a = wn(t, n), o = On(Vn(a.ys), a.xs, e), i = o.coefficients.map(Math.exp);
+	return r ? Pn(o, i, e) : [i];
 }
-function Un(t, n, e, r = !0) {
-	const a = Tn(t, n);
-	return wn(a, e, xn(a.ys, a.xs, r).predict);
+function Xn(t, n, e, r = !0) {
+	const a = wn(t, n);
+	return Bn(a, e, On(a.ys, a.xs, r).predict);
 }
-function kn(t, n, e, r = !0) {
-	const a = Tn(t, n);
-	return wn(a, e, xn(An(a.ys), a.xs, r).predict).map((t) => t.map(Math.exp));
+function jn(t, n, e, r = !0) {
+	const a = wn(t, n);
+	return Bn(a, e, On(Vn(a.ys), a.xs, r).predict).map((t) => t.map(Math.exp));
 }
-var qn = o({
-	TTEST: () => Xn,
-	T_TEST: () => jn
+var _n = o({
+	TTEST: () => Gn,
+	T_TEST: () => zn
 });
-function Xn(t, n, e, r) {
-	return jn(t, n, e, r);
+function Gn(t, n, e, r) {
+	return zn(t, n, e, r);
 }
-function jn(t, e, r, a) {
+function zn(t, e, r, a) {
 	if (r = Math.floor(r), a = Math.floor(a), ![1, 2].includes(r) || ![
 		1,
 		2,
 		3
 	].includes(a)) return NaN;
-	const o = t.getShape(), s = e.getShape(), i = o.rows * o.columns, l = s.rows * s.columns;
-	if (1 === a && i !== l) return n.BuiltIn.NA;
-	const u = t.flatten(pn), f = e.flatten(pn);
-	if (null === u || null === f) return n.BuiltIn.Value;
-	if (u.length < 2 || f.length < 2) throw n.BuiltIn.Div0;
-	if (1 === a && u.length !== f.length) return n.BuiltIn.NA;
+	const o = t.getShape(), i = e.getShape(), s = o.rows * o.columns, u = i.rows * i.columns;
+	if (1 === a && s !== u) return n.BuiltIn.NA;
+	const l = t.flatten(dn), f = e.flatten(dn);
+	if (null === l || null === f) return n.BuiltIn.Value;
+	if (l.length < 2 || f.length < 2) throw n.BuiltIn.Div0;
+	if (1 === a && l.length !== f.length) return n.BuiltIn.NA;
 	const c = 1 === a ? function(t, n) {
 		const e = t.length;
 		let r = 0, a = 0, o = 0;
-		for (let s = 0; s < e; s++) r += t[s], a += n[s], o += (t[s] - n[s]) ** 2;
-		const s = r - a, i = e * o - s ** 2;
-		return 0 === i ? { error: !0 } : {
-			x: Math.abs(s) * Math.sqrt((e - 1) / i),
+		for (let i = 0; i < e; i++) r += t[i], a += n[i], o += (t[i] - n[i]) ** 2;
+		const i = r - a, s = e * o - i ** 2;
+		return 0 === s ? { error: !0 } : {
+			x: Math.abs(i) * Math.sqrt((e - 1) / s),
 			df: e - 1
 		};
-	}(u, f) : 2 === a ? function(t, n) {
+	}(l, f) : 2 === a ? function(t, n) {
 		const e = t.length, r = n.length;
-		let a = 0, o = 0, s = 0, i = 0;
+		let a = 0, o = 0, i = 0, s = 0;
 		for (const n of t) a += n, o += n * n;
-		for (const t of n) s += t, i += t * t;
-		const l = o - a ** 2 / e, u = i - s ** 2 / r, f = Math.sqrt(l + u);
+		for (const t of n) i += t, s += t * t;
+		const u = o - a ** 2 / e, l = s - i ** 2 / r, f = Math.sqrt(u + l);
 		if (0 === f) return { error: !0 };
 		const c = e + r - 2;
 		return {
-			x: Math.abs(a / e - s / r) / f * Math.sqrt(e * r * c / (e + r)),
+			x: Math.abs(a / e - i / r) / f * Math.sqrt(e * r * c / (e + r)),
 			df: c
 		};
-	}(u, f) : function(t, n) {
+	}(l, f) : function(t, n) {
 		const e = t.length, r = n.length;
-		let a = 0, o = 0, s = 0, i = 0;
+		let a = 0, o = 0, i = 0, s = 0;
 		for (const n of t) a += n, o += n * n;
-		for (const t of n) s += t, i += t * t;
-		const l = (o - a ** 2 / e) / (e * (e - 1)), u = (i - s ** 2 / r) / (r * (r - 1));
-		if (l + u === 0) return { error: !0 };
-		const f = Math.abs(a / e - s / r) / Math.sqrt(l + u), c = l / (l + u);
+		for (const t of n) i += t, s += t * t;
+		const u = (o - a ** 2 / e) / (e * (e - 1)), l = (s - i ** 2 / r) / (r * (r - 1));
+		if (u + l === 0) return { error: !0 };
+		const f = Math.abs(a / e - i / r) / Math.sqrt(u + l), c = u / (u + l);
 		return {
 			x: f,
 			df: 1 / (c ** 2 / (e - 1) + (1 - c) ** 2 / (r - 1))
 		};
-	}(u, f);
+	}(l, f);
 	if ("error" in c) throw n.BuiltIn.Div0;
 	return function(t, n) {
 		const e = .5 * function(t, n, e) {
 			if (e <= 0) return 0;
 			if (e >= 1) return 1;
-			const r = Gn(t) + Gn(n) - Gn(t + n), a = Math.exp(Math.log(e) * t + Math.log(1 - e) * n - r);
-			return e < (t + 1) / (t + n + 2) ? a * _n(t, n, e) / t : 1 - a * _n(n, t, 1 - e) / n;
+			const r = Kn(t) + Kn(n) - Kn(t + n), a = Math.exp(Math.log(e) * t + Math.log(1 - e) * n - r);
+			return e < (t + 1) / (t + n + 2) ? a * Hn(t, n, e) / t : 1 - a * Hn(n, t, 1 - e) / n;
 		}(n / 2, .5, n / (n + t * t));
 		return t >= 0 ? 1 - e : e;
 	}(-c.x, c.df) * r;
 }
-function _n(t, n, e) {
-	const r = 1e-30, a = t + n, o = t + 1, s = t - 1;
-	let i = 1, l = 1 - a * e / o;
-	Math.abs(l) < r && (l = r), l = 1 / l;
-	let u = l;
+function Hn(t, n, e) {
+	const r = 1e-30, a = t + n, o = t + 1, i = t - 1;
+	let s = 1, u = 1 - a * e / o;
+	Math.abs(u) < r && (u = r), u = 1 / u;
+	let l = u;
 	for (let f = 1; f <= 200; f++) {
 		const c = 2 * f;
-		let m = f * (n - f) * e / ((s + c) * (t + c));
-		l = 1 + m * l, Math.abs(l) < r && (l = r), i = 1 + m / i, Math.abs(i) < r && (i = r), l = 1 / l, u *= l * i, m = -(t + f) * (a + f) * e / ((t + c) * (o + c)), l = 1 + m * l, Math.abs(l) < r && (l = r), i = 1 + m / i, Math.abs(i) < r && (i = r), l = 1 / l;
-		const h = l * i;
-		if (u *= h, Math.abs(h - 1) < 3e-7) break;
+		let m = f * (n - f) * e / ((i + c) * (t + c));
+		u = 1 + m * u, Math.abs(u) < r && (u = r), s = 1 + m / s, Math.abs(s) < r && (s = r), u = 1 / u, l *= u * s, m = -(t + f) * (a + f) * e / ((t + c) * (o + c)), u = 1 + m * u, Math.abs(u) < r && (u = r), s = 1 + m / s, Math.abs(s) < r && (s = r), u = 1 / u;
+		const h = u * s;
+		if (l *= h, Math.abs(h - 1) < 3e-7) break;
 	}
-	return u;
+	return l;
 }
-function Gn(t) {
+function Kn(t) {
 	const n = [
 		.9999999999998099,
 		676.5203681218851,
@@ -1661,34 +1709,34 @@ function Gn(t) {
 		9984369578019572e-21,
 		1.5056327351493116e-7
 	];
-	if (t < .5) return Math.log(Math.PI / Math.sin(Math.PI * t)) - Gn(1 - t);
+	if (t < .5) return Math.log(Math.PI / Math.sin(Math.PI * t)) - Kn(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);
 }
-var zn = o({
-	REGEXEXTRACT: () => Hn,
-	REGEXMATCH: () => Kn,
-	REGEXREPLACE: () => Qn,
-	REGEXTEST: () => Wn
+var Qn = o({
+	REGEXEXTRACT: () => Wn,
+	REGEXMATCH: () => $n,
+	REGEXREPLACE: () => Zn,
+	REGEXTEST: () => Jn
 });
-function Hn(e, r, a = 0, o = !1) {
-	const s = $n(r, o);
-	if (n.isError(s)) return s;
+function Wn(e, r, a = 0, o = !1) {
+	const i = te(r, o);
+	if (n.isError(i)) return i;
 	if (0 === a) {
-		const r = e.match(s);
+		const r = e.match(i);
 		return r ? t.createRange().replace([[r[0]]]) : t.createRange().replace([[n.BuiltIn.NA]]);
 	}
 	if (1 === a) {
-		const r = new RegExp(s.source, s.flags + "g"), a = [...e.matchAll(r)];
+		const r = new RegExp(i.source, i.flags + "g"), a = [...e.matchAll(r)];
 		if (0 === a.length) return t.createRange().replace([[n.BuiltIn.NA]]);
 		const o = a.map((t) => t[0]);
 		return t.createRange().replace([o]);
 	}
 	if (2 === a) {
-		const r = e.match(s);
+		const r = e.match(i);
 		if (!r) return t.createRange().replace([[n.BuiltIn.NA]]);
 		if (1 === r.length) return n.BuiltIn.Value;
 		const a = r.slice(1).map((t) => t ?? n.BuiltIn.NA);
@@ -1696,44 +1744,44 @@ function Hn(e, r, a = 0, o = !1) {
 	}
 	return n.BuiltIn.Value;
 }
-function Kn(t, e, r = !1) {
-	const a = $n(e, r);
+function $n(t, e, r = !1) {
+	const a = te(e, r);
 	return n.isError(a) ? a : a.test(t);
 }
-function Qn(t, e, r, a = 0, o = !1) {
-	const s = $n(e, o);
-	if (n.isError(s)) return s;
+function Zn(t, e, r, a = 0, o = !1) {
+	const i = te(e, o);
+	if (n.isError(i)) return i;
 	if (0 === a) {
-		const n = new RegExp(s.source, s.flags + "g");
+		const n = new RegExp(i.source, i.flags + "g");
 		return t.replace(n, r);
 	}
-	let i = 0, l = t;
-	const u = new RegExp(s.source, s.flags);
+	let s = 0, u = t;
+	const l = new RegExp(i.source, i.flags);
 	let f = 0;
-	for (; f <= l.length;) {
-		const t = l.slice(f).match(u);
+	for (; f <= u.length;) {
+		const t = u.slice(f).match(l);
 		if (!t || void 0 === t.index) break;
-		if (i++, i === a) {
+		if (s++, s === a) {
 			const n = f + t.index;
-			l = l.slice(0, n) + t[0].replace(u, r) + l.slice(n + t[0].length);
+			u = u.slice(0, n) + t[0].replace(l, r) + u.slice(n + t[0].length);
 			break;
 		}
 		f += t.index + Math.max(t[0].length, 1);
 	}
-	return l;
+	return u;
 }
-function Wn(t, e, r = !1) {
-	const a = $n(e, r);
+function Jn(t, e, r = !1) {
+	const a = te(e, r);
 	return n.isError(a) ? a : a.test(t);
 }
-function $n(t, e) {
+function te(t, e) {
 	try {
 		return new RegExp(t, e ? "i" : "");
 	} catch {
 		return n.BuiltIn.Value;
 	}
 }
-var Zn = {
+var ne = {
 	CUBEKPIMEMBER: {
 		p: [
 			{
@@ -1850,7 +1898,7 @@ var Zn = {
 		}],
 		r: { s: "string" }
 	}
-}, Jn = { ACCRINT: {
+}, ee = { ACCRINT: {
 	p: [
 		{ n: "issue" },
 		{ n: "firstInterest" },
@@ -1871,7 +1919,7 @@ var Zn = {
 		}
 	],
 	r: { s: "number" }
-} }, te = { AMORDEGRC: {
+} }, re = { AMORDEGRC: {
 	p: [
 		{ n: "cost" },
 		{ n: "datePurchased" },
@@ -1886,7 +1934,7 @@ var Zn = {
 		}
 	],
 	r: { s: "number" }
-} }, ne = {
+} }, ae = {
 	DATEDIF: {
 		p: [
 			{ n: "startDate" },
@@ -1930,7 +1978,7 @@ var Zn = {
 		],
 		r: { s: "number" }
 	}
-}, ee = {
+}, oe = {
 	COUPDAYS: {
 		p: [
 			{ n: "settlement" },
@@ -2121,7 +2169,11 @@ var Zn = {
 	NPV: {
 		p: [{ n: "rate" }, {
 			n: "value",
-			g: [{ n: "value" }]
+			g: [{
+				n: "value",
+				s: "number",
+				r: "r"
+			}]
 		}],
 		r: { s: "number" }
 	},
@@ -2335,7 +2387,7 @@ var Zn = {
 		],
 		r: { s: "*" }
 	}
-}, re = {
+}, ie = {
 	ACCRINTM: {
 		p: [
 			{ n: "issue" },
@@ -2438,7 +2490,7 @@ var Zn = {
 		],
 		r: { s: "number" }
 	}
-}, ae = {
+}, se = {
 	COUPDAYBS: {
 		p: [
 			{ n: "settlement" },
@@ -2517,7 +2569,7 @@ var Zn = {
 		],
 		r: { s: "number" }
 	}
-}, oe = {
+}, ue = {
 	PRICE: {
 		p: [
 			{ n: "settlement" },
@@ -2580,7 +2632,7 @@ var Zn = {
 		],
 		r: { s: "number" }
 	}
-}, se = {
+}, le = {
 	ODDFPRICE: {
 		p: [
 			{ n: "settlement" },
@@ -2651,7 +2703,7 @@ var Zn = {
 		],
 		r: { s: "number" }
 	}
-}, ie = { VDB: {
+}, fe = { VDB: {
 	p: [
 		{ n: "cost" },
 		{ n: "salvage" },
@@ -2671,7 +2723,7 @@ var Zn = {
 		}
 	],
 	r: { s: "number" }
-} }, le = {
+} }, ce = {
 	"FORECAST.ETS": {
 		fn: "FORECAST_ETS",
 		p: [
@@ -2791,7 +2843,7 @@ var Zn = {
 		],
 		r: { s: "*" }
 	}
-}, ue = {
+}, me = {
 	LINEST: {
 		p: [
 			{
@@ -2916,7 +2968,7 @@ var Zn = {
 			r: "m"
 		}
 	}
-}, fe = {
+}, he = {
 	TTEST: {
 		p: [
 			{
@@ -2952,7 +3004,7 @@ var Zn = {
 		],
 		r: { s: "number" }
 	}
-}, ce = {
+}, Me = {
 	REGEXEXTRACT: {
 		p: [
 			{
@@ -3043,5 +3095,5 @@ var Zn = {
 		],
 		r: { s: "*" }
 	}
-}, me = () => import("./C8ez6oBw4sdDzSct.mjs"), he = () => import("./CLQ1_t-YsFFTRbw1.mjs"), Me = () => import("./v_larpTXJns5MbG8.mjs"), pe = () => import("./Cmx9jVLihcV7UU9j.mjs"), De = () => import("./CYm12WYrfdzPk8cm.mjs"), de = () => import("./BXjhl9UdRwdpTLAB.mjs"), ge = () => import("./CzzpVN7fGDVLTBAQ.mjs"), Ne = () => import("./C1Of99Li1xuXVvHC.mjs"), ye = () => import("./CVd2CtlxuMv1IuIq.mjs"), be = () => import("./DN1_rspUH-tOwmED.mjs"), Ee = () => import("./D-wUpQDKX_k0SiSj.mjs"), ve = () => import("./BfPVZqcuHtLRxqLI.mjs"), Re = () => import("./CVifmXw-tD8LimNW.mjs"), Ie = () => import("./DEQPjlaWWG7gXPtm.mjs"), Se = (t, n, e) => (e || (e = /* @__PURE__ */ new Map()), n(e, t, s, Zn, me, "Cube"), n(e, t, q, Jn, he, "Financial"), n(e, t, _, te, Me, "Financial"), n(e, t, H, ne, pe, "Financial"), n(e, t, Z, ee, De, "Financial"), n(e, t, Bt, re, de, "Financial"), n(e, t, Xt, ae, ge, "Financial"), n(e, t, $t, oe, Ne, "Financial"), n(e, t, en, se, ye, "Financial"), n(e, t, mn, ie, be, "Financial"), n(e, t, Dn, le, Ee, "Statistical"), n(e, t, Fn, ue, ve, "Statistical"), n(e, t, qn, fe, Re, "Statistical"), n(e, t, zn, ce, Ie, "Text"), e);
-export { Se as default };
+}, pe = () => import("./BKnXVC21NesUzU9t.mjs"), Ne = () => import("./CShl-IMQIPnBMVpb.mjs"), De = () => import("./y9VKeU12ARR9HmtI.mjs"), de = () => import("./CN-pAKHIFQkkdFFB.mjs"), ge = () => import("./C2TyRseZg5dWtMq1.mjs"), ye = () => import("./fhXUc-E6MSehd9Ep.mjs"), be = () => import("./XATNfSb9mKkYP5Fr.mjs"), Ee = () => import("./CsrMSYiKGo3-I_Qk.mjs"), ve = () => import("./DsJzZKURvUm7apNu.mjs"), Re = () => import("./ffkoQUSdLhFyILRL.mjs"), Ie = () => import("./DxiRpwBhgWoK5Erd.mjs"), Se = () => import("./v9tvQuvQYcFQ0zOs.mjs"), Ce = () => import("./C21UeAwlG4Qkfu1Z.mjs"), Te = () => import("./DoS1jziW_TXjkH37.mjs"), xe = (t, n, e) => (e || (e = /* @__PURE__ */ new Map()), n(e, t, i, ne, pe, "Cube"), n(e, t, q, ee, Ne, "Financial"), n(e, t, _, re, De, "Financial"), n(e, t, H, ae, de, "Financial"), n(e, t, J, oe, ge, "Financial"), n(e, t, Ft, ie, ye, "Financial"), n(e, t, Gt, se, be, "Financial"), n(e, t, tn, ue, Ee, "Financial"), n(e, t, on, le, ve, "Financial"), n(e, t, pn, fe, Re, "Financial"), n(e, t, gn, ce, Ie, "Statistical"), n(e, t, Un, me, Se, "Statistical"), n(e, t, _n, he, Ce, "Statistical"), n(e, t, Qn, Me, Te, "Text"), e);
+export { xe as default };