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

package/browser/esm/index.mjs

@@ -1,10 +1,10 @@
 /**
-* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.15
+* @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { S as e, _ as t, a as n, b as r, c as i, d as a, f as o, g as s, h as c, i as l, l as u, m as d, n as f, o as p, p as m, r as h, s as g, t as _, u as v, v as y, x as b, y as x } from "./C1A2QXvN2v2G6tUy.mjs";
+import { S as e, _ as t, a as n, b as r, c as i, d as a, f as o, g as s, h as c, i as l, l as u, m as d, n as f, o as p, p as m, r as h, s as g, t as _, u as v, v as y, x as b, y as x } from "./CBuhj3PrSGO4BQTA.mjs";
 import { FormulaContext as S, FormulaError as C, IRange as w, ScalarType as T, ValueKind as E } from "@sheetxl/primitives";
 var D = Object.defineProperty, O = (e, t) => {
 	let n = {};
@@ -14,27 +14,27 @@ var D = Object.defineProperty, O = (e, t) => {
 	});
 	return t || D(n, Symbol.toStringTag, { value: "Module" }), n;
 }, k = O({
-	CUBEKPIMEMBER: () => ee,
-	CUBEMEMBER: () => te,
-	CUBEMEMBERPROPERTY: () => A,
-	CUBERANKEDMEMBER: () => j,
-	CUBESET: () => M,
+	CUBEKPIMEMBER: () => A,
+	CUBEMEMBER: () => j,
+	CUBEMEMBERPROPERTY: () => ee,
+	CUBERANKEDMEMBER: () => M,
+	CUBESET: () => te,
 	CUBESETCOUNT: () => N,
 	CUBEVALUE: () => ne
 });
-function ee(e, t, n, r) {
+function A(e, t, n, r) {
 	throw C.BuiltIn.NA;
 }
-function te(e, t, n) {
+function j(e, t, n) {
 	throw C.BuiltIn.NA;
 }
-function A(e, t, n) {
+function ee(e, t, n) {
 	throw C.BuiltIn.NA;
 }
-function j(e, t, n, r) {
+function M(e, t, n, r) {
 	throw C.BuiltIn.NA;
 }
-function M(e, t, n, r, i) {
+function te(e, t, n, r, i) {
 	throw C.BuiltIn.NA;
 }
 function N(e) {
@@ -1449,36 +1449,23 @@ var An = (e, t, n) => {
 		vertical: r,
 		named: n.length > 1
 	} : Z();
-}, Mn = (e, t, n) => {
-	let r;
-	try {
-		r = e.twoArgs ? e.fn.execute(t, n()) : e.fn.execute(t);
-	} catch (e) {
-		if (C.isError(e)) return e;
-		throw e;
-	}
-	if (!0 === r?.isIRange) {
-		let e = r;
-		return !0 === e.isIReferenceRange && e.size === 1 ? e.getValueAt(0, 0) : Z();
-	}
-	return r ?? null;
-}, Nn = (e, t) => {
+}, Mn = (e, t) => {
 	let n = e;
-	if (n === void 0) n = +!!Fn(t);
+	if (n === void 0) n = +!!Pn(t);
 	else if (!Number.isInteger(n) || n < 0 || n > 3) return Z();
 	return {
 		hasHeader: n === 1 || n === 3,
 		show: n === 2 || n === 3
 	};
-}, Pn = (e) => C.isError(e) ? "error" : typeof e, Fn = (e) => {
+}, Nn = (e) => C.isError(e) ? "error" : typeof e, Pn = (e) => {
 	if (e.getRowCount() < 2) return !1;
 	let t = e.getColumnCount();
 	for (let n = 0; n < t; n++) {
 		let t = e.getValueAt(0, n), r = e.getValueAt(1, n);
-		if (t !== null && r !== null && Pn(t) !== Pn(r)) return !0;
+		if (t !== null && r !== null && Nn(t) !== Nn(r)) return !0;
 	}
 	return !1;
-}, In = (e, t) => Number.isInteger(e) && Math.abs(e) <= t, Ln = (e, t, n) => {
+}, Fn = (e, t) => Number.isInteger(e) && Math.abs(e) <= t, In = (e, t, n) => {
 	let r = Array(t).fill(1);
 	if (!e) return {
 		keyDirections: r,
@@ -1509,105 +1496,101 @@ var An = (e, t, n) => {
 		keyDirections: r,
 		byValue: null
 	};
-}, Rn = (e) => e.size === 1 && !0 === e.isIReferenceRange && e.getValueAt(0, 0) === null, zn = (e, t) => {
+}, Ln = (e) => e.size === 1 && !0 === e.isIReferenceRange && e.getValueAt(0, 0) === null, Rn = (e, t) => {
 	if (e.getColumnCount() !== 1 || e.getRowCount() !== t) return !1;
 	for (let t of e.entries()) {
 		let e = typeof t.value;
 		if (e !== "boolean" && e !== "number") return !1;
 	}
 	return !0;
-}, Bn = class {
-	constructor(e, t) {
-		let n = e.getColumnCount(), r = e.getRowCount(), i = t ? { filter: t } : void 0, a = Array(n), o = Array(n);
-		for (let t = 0; t < n; t++) {
-			let s = t === n - 1 ? e : e.slice({
-				rowStart: 0,
-				rowEnd: r - 1,
-				colStart: 0,
-				colEnd: t
-			});
-			o[t] = s, a[t] = S.createGrouping(s, i);
+}, zn = (e, t, n, r, i, a) => {
+	if (!t.twoArgs) {
+		let a = e.getAggregate?.(n, t.fn, r, i);
+		if (a === null) return "";
+		if (a !== void 0) return a;
+	}
+	let o = e.getMembers(n, r, i);
+	return o ? ((e, t, n) => {
+		let r;
+		try {
+			r = e.twoArgs ? e.fn.execute(t, n()) : e.fn.execute(t);
+		} catch (e) {
+			if (C.isError(e)) return e;
+			throw e;
 		}
-		let s = [], c = [];
-		for (let e = 0; e < n; e++) {
-			let t = a[e], n = Array(t.getGroupCount());
-			for (let r = 0; r < n.length; r++) {
-				let i = t.getKeys(r)[e], o = e === 0 ? null : s[a[e - 1].getGroup(t.getFirstRecord(r))], l = {
-					level: e,
-					group: r,
-					keys: o ? [...o.keys, i] : [i],
-					parent: o,
-					children: []
-				};
-				n[r] = l, o ? o.children.push(l) : c.push(l);
-			}
-			s = n;
+		if (!0 === r?.isIRange) {
+			let e = r;
+			return !0 === e.isIReferenceRange && e.size === 1 ? e.getValueAt(0, 0) : Z();
 		}
-		this.fieldCount = n, this.groupings = a, this.prefixes = o, this.roots = c;
-	}
-	getRecordCount() {
-		return this.groupings[this.fieldCount - 1].getRecordCount();
-	}
-	getMembers(e, t) {
-		return t === null ? this.groupings[this.fieldCount - 1].getMembers(e) : this.groupings[t.level].getMembers(e, [t.group]);
+		return r ?? null;
+	})(t, o, a) : "";
+}, Bn = class {
+	constructor(e, t) {
+		this.root = e.getRoot(), this.fieldCount = t;
+	}
+	sortTree(e, t) {
+		let n = /* @__PURE__ */ new Map(), r = e.byValue, i = (a) => {
+			let o = [...a.getChildren()];
+			if (o.length === 0) return;
+			let s = o[0].getLevel() - 1;
+			o.sort((t, n) => Vn(t.getKeys()[s], n.getKeys()[s], e.keyDirections[s])), r && o.sort((e, n) => Hn(t(e), t(n), r.direction)), n.set(a, o);
+			for (let e of o) i(e);
+		};
+		return i(this.root), n;
 	}
-	sort(e, t, n) {
-		let r = (t, n, r) => Vn(t.keys[r], n.keys[r], e.keyDirections[r]), i = e.byValue, a = (e, n) => Hn(t(e), t(n), i.direction);
-		if (n) {
-			let e = [], t = (n) => {
-				for (let r of n) r.children.length === 0 ? e.push(r) : t(r.children);
-			};
-			return t(this.roots), e.sort((e, t) => {
-				for (let n = 0; n < this.fieldCount; n++) {
-					let i = r(e, t, n);
-					if (i !== 0) return i;
-				}
-				return 0;
-			}), i && e.sort(a), e;
-		}
-		let o = (e) => {
-			if (e.length === 0) return;
-			let t = e[0].level;
-			e.sort((e, n) => r(e, n, t)), i && e.sort(a);
-			for (let t of e) o(t.children);
+	sortLeaves(e, t) {
+		let n = [], r = (e) => {
+			let t = e.getChildren();
+			if (t.length === 0) n.push(e);
+			else for (let e of t) r(e);
 		};
-		return o(this.roots), this.roots;
+		for (let e of this.root.getChildren()) r(e);
+		n.sort((t, n) => {
+			let r = t.getKeys(), i = n.getKeys();
+			for (let t = 0; t < this.fieldCount; t++) {
+				let n = Vn(r[t], i[t], e.keyDirections[t]);
+				if (n !== 0) return n;
+			}
+			return 0;
+		});
+		let i = e.byValue;
+		return i && n.sort((e, n) => Hn(t(e), t(n), i.direction)), n;
 	}
 	lines(e, t) {
-		let n = [], r = t < 0, i = Math.max(0, Math.abs(t) - 1), a = (e) => {
-			for (let t of e) {
-				if (t.children.length === 0) {
+		let n = [], r = t < 0, i = Math.max(0, Math.abs(t) - 1), a = (t) => {
+			for (let o of e.get(t) ?? t.getChildren()) {
+				if (o.getChildren().length === 0) {
 					n.push({
 						kind: "group",
-						node: t
+						node: o
 					});
 					continue;
 				}
-				let e = t.level < i;
+				let e = o.getLevel() - 1 < i;
 				e && r && n.push({
 					kind: "subtotal",
-					node: t
-				}), a(t.children), e && !r && n.push({
+					node: o
+				}), a(o), e && !r && n.push({
 					kind: "subtotal",
-					node: t
+					node: o
 				});
 			}
 		};
 		return t !== 0 && r && n.push({
 			kind: "total",
-			node: null
-		}), a(e), t === 0 || r || n.push({
+			node: this.root
+		}), a(this.root), t === 0 || r || n.push({
 			kind: "total",
-			node: null
+			node: this.root
 		}), n;
 	}
 	keyCells(e, t) {
 		let n = Array(this.fieldCount).fill("");
 		if (e.kind === "total") return n[0] = Math.abs(t) > 1 ? "Grand Total" : "Total", n;
-		let r = e.node.keys;
-		for (let t = 0; t <= e.node.level; t++) {
-			let e = r[t];
-			n[t] = e === null ? 0 : e;
+		let r = e.node.getKeys();
+		for (let e = 0; e < r.length; e++) {
+			let t = r[e];
+			n[e] = t === null ? 0 : t;
 		}
 		return n;
 	}
@@ -1632,51 +1615,51 @@ var An = (e, t, n) => {
 	colEnd: e.getColumnCount() - 1
 }), qn = O({ GROUPBY: () => Jn });
 function Jn(e, t, n, r, i = 1, a, o, s = 0) {
-	if (e.getRowCount() !== t.getRowCount() || Rn(t)) return C.BuiltIn.Value;
+	if (e.getRowCount() !== t.getRowCount() || Ln(t)) return C.BuiltIn.Value;
 	let c = jn(n, t.getColumnCount());
 	if (C.isError(c)) return c;
-	let l = Nn(r, t);
+	let l = Mn(r, t);
 	if (C.isError(l)) return l;
 	let u = e.getColumnCount(), d = i;
-	if (!In(d, u) || s !== 0 && s !== 1) return C.BuiltIn.Value;
+	if (!Fn(d, u) || s !== 0 && s !== 1) return C.BuiltIn.Value;
 	let f = s === 1;
-	if ((f || c.vertical) && Math.abs(d) > 1 || o && !zn(o, e.getRowCount())) return C.BuiltIn.Value;
-	let { measures: p, vertical: m } = c, h = t.getColumnCount(), g = Ln(a, u, m ? h : p.length);
+	if ((f || c.vertical) && Math.abs(d) > 1 || o && !Rn(o, e.getRowCount())) return C.BuiltIn.Value;
+	let { measures: p, vertical: m } = c, h = t.getColumnCount(), g = In(a, u, m ? h : p.length);
 	if (C.isError(g)) return g;
 	let _ = e, v = t, y = o, b = null, x = null;
 	if (l.hasHeader) {
 		if (_.getRowCount() < 2) return C.BuiltIn.Value;
 		b = Yn(_), x = Yn(v), _ = Q(_), v = Q(v), y &&= Q(y);
 	}
-	let w = new Bn(_, y);
+	let w = S.createPivot(_, null, y ? { filter: y } : void 0);
 	if (w.getRecordCount() === 0) return C.BuiltIn.Value;
-	let T = Kn(v), E = Array(T.length), D = /* @__PURE__ */ new Map(), O = (e) => {
-		let t = D.get(e);
-		return t || (t = p.map((t) => (m ? T.map((e, t) => t) : [t.column]).map((n) => Mn(t, w.getMembers(T[n], e), ((e) => () => E[e] ??= w.getMembers(T[e], null))(n)))), D.set(e, t), t);
-	}, k = g.byValue, ee = w.sort(g, (e) => m ? O(e)[0][k.measure] : O(e)[k.measure][0], f), te = f ? Zn(ee, d) : w.lines(ee, d), A = [];
+	let T = new Bn(w.getRows(), u), E = Kn(v), D = Array(E.length), O = /* @__PURE__ */ new Map(), k = (e) => {
+		let t = O.get(e);
+		return t || (t = p.map((t) => (m ? E.map((e, t) => t) : [t.column]).map((n) => zn(w, t, E[n], e, void 0, ((e) => () => D[e] ??= w.getMembers(E[e]))(n)))), O.set(e, t), t);
+	}, A = g.byValue, j = (e) => m ? k(e)[0][A.measure] : k(e)[A.measure][0], ee = f ? Zn(T.sortLeaves(g, j), T.root, d) : T.lines(T.sortTree(g, j), d), M = [];
 	if (m) {
-		l.show && A.push([
+		l.show && M.push([
 			...Xn(b, u),
 			"",
-			...T.map((e, t) => x ? x[t] : Gn(t))
+			...E.map((e, t) => x ? x[t] : Gn(t))
 		]);
-		for (let e of te) {
-			let t = w.keyCells(e, d), n = O(e.node);
-			for (let e = 0; e < p.length; e++) A.push([
+		for (let e of ee) {
+			let t = T.keyCells(e, d), n = k(e.node);
+			for (let e = 0; e < p.length; e++) M.push([
 				...t,
 				p[e].label,
 				...n[e]
 			]);
 		}
 	} else {
-		c.named && A.push([...Array(u).fill(""), ...p.map((e) => e.label)]), l.show && A.push([...Xn(b, u), ...p.map((e) => x ? x[e.column] : Gn(e.column))]);
-		for (let e of te) {
-			let t = w.keyCells(e, d);
-			for (let n of O(e.node)) t.push(n[0]);
-			A.push(t);
+		c.named && M.push([...Array(u).fill(""), ...p.map((e) => e.label)]), l.show && M.push([...Xn(b, u), ...p.map((e) => x ? x[e.column] : Gn(e.column))]);
+		for (let e of ee) {
+			let t = T.keyCells(e, d);
+			for (let n of k(e.node)) t.push(n[0]);
+			M.push(t);
 		}
 	}
-	return S.createRange(A.length, A[0].length, A);
+	return S.createRange(M.length, M[0].length, M);
 }
 var Yn = (e) => {
 	let t = e.getColumnCount(), n = Array(t);
@@ -1686,54 +1669,57 @@ var Yn = (e) => {
 	let n = Array(t);
 	for (let r = 0; r < t; r++) n[r] = e ? e[r] : Un(r);
 	return n;
-}, Zn = (e, t) => {
-	let n = e.map((e) => ({
+}, Zn = (e, t, n) => {
+	let r = e.map((e) => ({
 		kind: "group",
 		node: e
 	}));
-	return t > 0 ? n.push({
+	return n > 0 ? r.push({
 		kind: "total",
-		node: null
-	}) : t < 0 && n.unshift({
+		node: t
+	}) : n < 0 && r.unshift({
 		kind: "total",
-		node: null
-	}), n;
+		node: t
+	}), r;
 }, Qn = O({ PIVOTBY: () => $n });
 function $n(e, t, n, r, i, a = 1, o, s = 1, c, l, u = 0) {
 	let d = n.getRowCount();
-	if (!e && !t || Rn(n) || e && e.getRowCount() !== d || t && t.getRowCount() !== d) return C.BuiltIn.Value;
+	if (!e && !t || Ln(n) || e && e.getRowCount() !== d || t && t.getRowCount() !== d) return C.BuiltIn.Value;
 	let f = jn(r, n.getColumnCount());
 	if (C.isError(f)) return f;
-	let p = Nn(i, n);
+	let p = Mn(i, n);
 	if (C.isError(p)) return p;
 	let m = e ? e.getColumnCount() : 0, h = t ? t.getColumnCount() : 0, g = e ? a : 0, _ = t ? s : 0;
-	if (e && !In(g, m) || t && !In(_, h) || f.vertical && Math.abs(g) > 1 || !Number.isInteger(u) || u < 0 || u > 4 || l && !zn(l, d)) return C.BuiltIn.Value;
-	let { measures: v, vertical: y } = f, b = n.getColumnCount(), x = y ? b : v.length, w = Ln(o, m, x);
+	if (e && !Fn(g, m) || t && !Fn(_, h) || f.vertical && Math.abs(g) > 1 || !Number.isInteger(u) || u < 0 || u > 4 || l && !Rn(l, d)) return C.BuiltIn.Value;
+	let { measures: v, vertical: y } = f, b = n.getColumnCount(), x = y ? b : v.length, w = In(o, m, x);
 	if (C.isError(w)) return w;
-	let T = Ln(c, h, x);
+	let T = In(c, h, x);
 	if (C.isError(T)) return T;
-	let E = e, D = t, O = n, k = l, ee = null, te = null, A = null;
+	let E = e, D = t, O = n, k = l, A = null, j = null, ee = null;
 	if (p.hasHeader) {
 		if (d < 2) return C.BuiltIn.Value;
-		E &&= (ee = er(E), Q(E)), D &&= (te = er(D), Q(D)), A = er(O), O = Q(O), k &&= Q(k);
+		E &&= (A = er(E), Q(E)), D &&= (j = er(D), Q(D)), ee = er(O), O = Q(O), k &&= Q(k);
 	}
-	let j = E ? new Bn(E, k) : null, M = D ? new Bn(D, k) : null;
-	if ((j ?? M).getRecordCount() === 0) return C.BuiltIn.Value;
-	let N = new tr(j, M, Kn(O), k), ne = (e, t, n, r) => {
-		let i = N.members(e, t, r);
-		return i ? Mn(n, i, () => {
+	let M = S.createPivot(E ?? null, D ?? null, k ? { filter: k } : void 0);
+	if (M.getRecordCount() === 0) return C.BuiltIn.Value;
+	let te = E ? new Bn(M.getRows(), m) : null, N = D ? new Bn(M.getColumns(), h) : null, ne = Kn(O), re = (e, t, n, r) => {
+		let i = ne[r];
+		return zn(M, n, i, e, t, () => {
 			switch (u) {
-				case 0: return N.members(null, t, r);
-				case 1: return N.members(e, null, r);
-				case 3: return N.members(e, t?.parent ?? null, r);
-				case 4: return N.members(e?.parent ?? null, t, r);
-				default: return N.members(null, null, r);
+				case 0: return M.getMembers(i, void 0, t);
+				case 1: return M.getMembers(i, e);
+				case 3: return M.getMembers(i, e, t?.getParent() ?? void 0);
+				case 4: return M.getMembers(i, e?.getParent() ?? void 0, t);
+				default: return M.getMembers(i);
 			}
-		}) : "";
-	}, re = (e) => (t, n) => y ? ne(t, n, v[0], e.measure) : ne(t, n, v[e.measure], v[e.measure].column), P = [{
+		});
+	}, P = (e) => (t, n) => y ? re(t, n, v[0], e.measure) : re(t, n, v[e.measure], v[e.measure].column), F = te ? te.lines(te.sortTree(w, (e) => P(w.byValue)(e, void 0)), g) : [{
 		kind: "total",
-		node: null
-	}], F = j ? j.lines(j.sort(w, (e) => re(w.byValue)(e, null), !1), g) : P, I = M ? M.lines(M.sort(T, (e) => re(T.byValue)(null, e), !1), _) : P, L = [];
+		node: M.getRows().getRoot()
+	}], I = N ? N.lines(N.sortTree(T, (e) => P(T.byValue)(void 0, e)), _) : [{
+		kind: "total",
+		node: M.getColumns().getRoot()
+	}], L = [];
 	for (let e of I) if (y) for (let t = 0; t < b; t++) L.push({
 		line: e,
 		measure: -1,
@@ -1744,28 +1730,28 @@ function $n(e, t, n, r, i, a = 1, o, s = 1, c, l, u = 0) {
 		measure: t,
 		column: v[t].column
 	});
-	let ie = !!M && !f.named && b > 1, R = m + +!!y, ae = () => Array(R).fill(""), z = [];
-	if (p.show && M) {
+	let ie = !!N && !f.named && b > 1, R = m + +!!y, ae = () => Array(R).fill(""), z = [];
+	if (p.show && N) {
 		let e = [];
-		for (let t = 0; t < h; t++) e.push(te ? String(te[t] ?? "") : Wn(t));
+		for (let t = 0; t < h; t++) e.push(j ? String(j[t] ?? "") : Wn(t));
 		z.push([
 			...ae(),
 			e.join(", "),
 			...Array(L.length - 1).fill("")
 		]);
 	}
-	if (M) {
-		let e = L.map((e) => M.keyCells(e.line, _));
+	if (N) {
+		let e = L.map((e) => N.keyCells(e.line, _));
 		for (let t = 0; t < h; t++) z.push([...ae(), ...e.map((e) => e[t])]);
 	}
 	if (f.named && !y && z.push([...ae(), ...L.map((e) => v[e.measure].label)]), p.show) {
 		let e = [];
-		for (let t = 0; t < m; t++) e.push(ee ? ee[t] : Un(t));
-		y && e.push(""), z.push([...e, ...L.map((e) => A ? A[e.column] : Gn(e.column))]);
+		for (let t = 0; t < m; t++) e.push(A ? A[t] : Un(t));
+		y && e.push(""), z.push([...e, ...L.map((e) => ee ? ee[e.column] : Gn(e.column))]);
 	}
-	let B = (e, t) => L.map((n) => ie && n.line.kind !== "group" ? "" : ne(e, n.line.node, t ?? v[n.measure], n.column));
+	let B = (e, t) => L.map((n) => ie && n.line.kind !== "group" ? "" : re(e, n.line.node, t ?? v[n.measure], n.column));
 	for (let e of F) {
-		let t = j ? j.keyCells(e, g) : [];
+		let t = te ? te.keyCells(e, g) : [];
 		if (y) for (let n of v) z.push([
 			...t,
 			n.label,
@@ -1779,58 +1765,33 @@ var er = (e) => {
 	let t = e.getColumnCount(), n = Array(t);
 	for (let r = 0; r < t; r++) n[r] = e.getValueAt(0, r);
 	return n;
-}, tr = class {
-	constructor(e, t, n, r) {
-		this._rows = e, this._cols = t, this._columns = n, this._filter = r, this._crossed = /* @__PURE__ */ new Map();
-	}
-	members(e, t, n) {
-		let r = this._columns[n];
-		if (!e && !t) return (this._rows ?? this._cols).getMembers(r, null);
-		if (!e) return this._cols.getMembers(r, t);
-		if (!t) return this._rows.getMembers(r, e);
-		let i = this._cross(e.level, t.level), a = i.groupOf.get(e.group * this._cols.groupings[t.level].getGroupCount() + t.group);
-		return a === void 0 ? null : i.grouping.getMembers(r, [a]);
-	}
-	_cross(e, t) {
-		let n = `${e},${t}`, r = this._crossed.get(n);
-		if (r) return r;
-		let i = this._rows, a = this._cols, o = i.prefixes[e].concat(a.prefixes[t], w.Axis.Column), s = S.createGrouping(o, this._filter ? { filter: this._filter } : void 0), c = i.groupings[e], l = a.groupings[t], u = l.getGroupCount(), d = /* @__PURE__ */ new Map();
-		for (let e = 0; e < s.getGroupCount(); e++) {
-			let t = s.getFirstRecord(e);
-			d.set(c.getGroup(t) * u + l.getGroup(t), e);
-		}
-		return r = {
-			grouping: s,
-			groupOf: d
-		}, this._crossed.set(n, r), r;
-	}
-}, nr = O({
-	FORECAST_ETS: () => rr,
-	FORECAST_ETS_CONFINT: () => ir,
-	FORECAST_ETS_SEASONALITY: () => ar,
-	FORECAST_ETS_STAT: () => or
+}, tr = O({
+	FORECAST_ETS: () => nr,
+	FORECAST_ETS_CONFINT: () => rr,
+	FORECAST_ETS_SEASONALITY: () => ir,
+	FORECAST_ETS_STAT: () => ar
 });
-function rr(e, t, n, r = 1, i = 1, a = 1) {
-	let o = ur(t, n, i, a);
+function nr(e, t, n, r = 1, i = 1, a = 1) {
+	let o = lr(t, n, i, a);
 	if (C.isError(o)) return o;
 	let { values: s, stepSize: c, lastTime: l, firstTime: u } = o;
 	if ((e - u) / c <= -.999) return C.BuiltIn.Num;
 	let d = (e - l) / c;
 	if (d > 2147483647) return C.BuiltIn.Num;
-	let f = pr(s, r);
+	let f = fr(s, r);
 	if (C.isError(f)) return f;
-	let { alpha: p, beta: m, gamma: h, period: g, b0: _ } = f, { L: v, T: y, S: b, finalIndex: x } = fr(s, p, m, h, g, _).finalState, S = v + d * y;
+	let { alpha: p, beta: m, gamma: h, period: g, b0: _ } = f, { L: v, T: y, S: b, finalIndex: x } = dr(s, p, m, h, g, _).finalState, S = v + d * y;
 	return g > 1 && (S += b[((x + Math.round(d)) % g + g) % g]), S;
 }
-function ir(e, t, n, r = .95, i = 1, a = 1, o = 1) {
+function rr(e, t, n, r = .95, i = 1, a = 1, o = 1) {
 	if (r < 0 || r >= 1) return C.BuiltIn.Num;
-	let s = ur(t, n, a, o);
+	let s = lr(t, n, a, o);
 	if (C.isError(s)) return s;
 	let { values: c, stepSize: l, lastTime: u } = s;
 	if (e <= u) return C.BuiltIn.Num;
 	let d = Math.round((e - u) / l);
 	if (d > 2147483647) return C.BuiltIn.Num;
-	let f = pr(c, i);
+	let f = fr(c, i);
 	if (C.isError(f)) return f;
 	let { alpha: p, beta: m, gamma: h, period: g, b0: _ } = f, v = function(e, t, n, r, i, a) {
 		let o = e.length, s, c, l = Array(Math.max(1, i)).fill(0);
@@ -1864,20 +1825,20 @@ function ir(e, t, n, r = .95, i = 1, a = 1, o = 1) {
 		return r - (2.515517 + .802853 * r + .010328 * r * r) / (1 + 1.432788 * r + .189269 * r * r + .001308 * r * r * r);
 	}(r) * v * Math.sqrt(y);
 }
-function ar(e, t, n = 1, r = 1) {
-	let i = ur(e, t, n, r);
+function ir(e, t, n = 1, r = 1) {
+	let i = lr(e, t, n, r);
 	if (C.isError(i)) return i;
 	let { values: a } = i;
-	return a.length < 4 ? 0 : dr(a);
+	return a.length < 4 ? 0 : ur(a);
 }
-function or(e, t, n, r = 1, i = 1, a = 1) {
-	let o = cr(n);
+function ar(e, t, n, r = 1, i = 1, a = 1) {
+	let o = sr(n);
 	if (o === null || o < 1 || o > 8) return C.BuiltIn.Num;
-	let s = ur(e, t, i, a);
+	let s = lr(e, t, i, a);
 	if (C.isError(s)) return s;
 	let { values: c, stepSize: l } = s;
 	if (o === 8) return l;
-	let u = pr(c, r);
+	let u = fr(c, r);
 	if (C.isError(u)) return u;
 	let { alpha: d, beta: f, gamma: p, period: m, b0: h } = u;
 	switch (o) {
@@ -1919,7 +1880,7 @@ function or(e, t, n, r = 1, i = 1, a = 1) {
 	}
 	return C.BuiltIn.Num;
 }
-function sr(e, t) {
+function or(e, t) {
 	let n = e.map((e) => e.value);
 	switch (t) {
 		case 1: return n.reduce((e, t) => e + t, 0) / n.length;
@@ -1935,14 +1896,14 @@ function sr(e, t) {
 		default: return n.reduce((e, t) => e + t, 0);
 	}
 }
-function cr(e) {
+function sr(e) {
 	return Number.isInteger(e) ? e : null;
 }
-var lr = 8784;
-function ur(e, t, n, r) {
-	let i = cr(n);
+var cr = 8784;
+function lr(e, t, n, r) {
+	let i = sr(n);
 	if (i !== 0 && i !== 1) return C.BuiltIn.Num;
-	let a = cr(r);
+	let a = sr(r);
 	if (a === null || a < 1 || a > 7) return C.BuiltIn.Num;
 	let o = e.flatten(), s = t.flatten();
 	if (o.getRowCount() !== s.getRowCount()) return C.BuiltIn.NA;
@@ -1960,12 +1921,12 @@ function ur(e, t, n, r) {
 		let t = c[e];
 		t.time === c[e - 1].time ? u.push(t) : (l.push({
 			time: u[0].time,
-			value: sr(u, a)
+			value: or(u, a)
 		}), u = [t]);
 	}
 	if (l.push({
 		time: u[0].time,
-		value: sr(u, a)
+		value: or(u, a)
 	}), l.length < 2) return C.BuiltIn.Div0;
 	let d = [];
 	for (let e = 1; e < l.length; e++) d.push(l[e].time - l[e - 1].time);
@@ -1992,7 +1953,7 @@ function ur(e, t, n, r) {
 		firstTime: l[0].time
 	};
 }
-function dr(e) {
+function ur(e) {
 	let t = e.length;
 	if (t < 4) return 0;
 	let n = e.reduce((e, t) => e + t, 0) / t, r = 0;
@@ -2007,7 +1968,7 @@ function dr(e) {
 	}
 	return a;
 }
-function fr(e, t, n, r, i, a) {
+function dr(e, t, n, r, i, a) {
 	let o = e.length, s, c;
 	if (i > 1 && o >= 2 * i) {
 		let t = 0, n = 0;
@@ -2041,16 +2002,16 @@ function fr(e, t, n, r, i, a) {
 		}
 	};
 }
-function pr(e, t) {
-	let n = cr(t);
-	if (n === null || n < 0 || n > lr) return C.BuiltIn.Num;
+function fr(e, t) {
+	let n = sr(t);
+	if (n === null || n < 0 || n > cr) return C.BuiltIn.Num;
 	let r = 1;
-	n === 1 ? (r = dr(e), r <= 1 && (r = 1)) : n > 1 && (r = n), r > 1 && e.length < 2 * r && (r = 1);
+	n === 1 ? (r = ur(e), r <= 1 && (r = 1)) : n > 1 && (r = n), r > 1 && e.length < 2 * r && (r = 1);
 	let i = e.length;
 	if (r === 1) {
-		let t = Math.max(1, Math.floor(i / 4)), n = hr((t) => {
+		let t = Math.max(1, Math.floor(i / 4)), n = mr((t) => {
 			let n = Math.max(.001, Math.min(.999, t[0])), r = Math.max(.001, Math.min(.999, t[1])), i = t[2];
-			return fr(e, n, r, 0, 1, i).mse;
+			return dr(e, n, r, 0, 1, i).mse;
 		}, [
 			.9,
 			.1,
@@ -2064,7 +2025,7 @@ function pr(e, t) {
 			b0: n[2]
 		};
 	}
-	let a = hr((t) => fr(e, Math.max(.001, Math.min(.999, t[0])), Math.max(.001, Math.min(.999, t[1])), Math.max(.001, Math.min(.999, t[2])), r).mse, [
+	let a = mr((t) => dr(e, Math.max(.001, Math.min(.999, t[0])), Math.max(.001, Math.min(.999, t[1])), Math.max(.001, Math.min(.999, t[2])), r).mse, [
 		.9,
 		.1,
 		.1
@@ -2077,10 +2038,10 @@ function pr(e, t) {
 		b0: 0
 	};
 }
-function mr(e, t, n, r, i) {
+function pr(e, t, n, r, i) {
 	for (let a = 0; a < e.length; ++a) e[a] = t * n[a] + r * i[a];
 }
-function hr(e, t, n) {
+function mr(e, t, n) {
 	let r = (n ||= {}).maxIterations || 200 * t.length, i = n.nonZeroDelta || 1.05, a = n.zeroDelta || .001, o = n.minErrorDelta || 1e-6, s = n.minTolerance || 1e-5, c = n.rho === void 0 ? 1 : n.rho, l = n.chi === void 0 ? 2 : n.chi, u = n.psi === void 0 ? -.5 : n.psi, d = n.sigma === void 0 ? .5 : n.sigma, f, p = t.length, m = Array(p + 1);
 	m[0] = t, m[0].fx = e(t), m[0].id = 0;
 	for (let n = 0; n < p; ++n) {
@@ -2113,12 +2074,12 @@ function hr(e, t, n) {
 			_[e] /= p;
 		}
 		let t = m[p];
-		if (mr(v, 1 + c, _, -c, t), v.fx = e(v), v.fx < m[0].fx) mr(b, 1 + l, _, -l, t), b.fx = e(b), h(b.fx < v.fx ? b : v);
+		if (pr(v, 1 + c, _, -c, t), v.fx = e(v), v.fx < m[0].fx) pr(b, 1 + l, _, -l, t), b.fx = e(b), h(b.fx < v.fx ? b : v);
 		else if (v.fx >= m[p - 1].fx) {
 			let n = !1;
-			if (v.fx > t.fx ? (mr(y, 1 + u, _, -u, t), y.fx = e(y), y.fx < t.fx ? h(y) : n = !0) : (mr(y, 1 - u * c, _, u * c, t), y.fx = e(y), y.fx < v.fx ? h(y) : n = !0), n) {
+			if (v.fx > t.fx ? (pr(y, 1 + u, _, -u, t), y.fx = e(y), y.fx < t.fx ? h(y) : n = !0) : (pr(y, 1 - u * c, _, u * c, t), y.fx = e(y), y.fx < v.fx ? h(y) : n = !0), n) {
 				if (d >= 1) break;
-				for (let t = 1; t < m.length; ++t) mr(m[t], 1 - d, m[0], d, m[t]), m[t].fx = e(m[t]);
+				for (let t = 1; t < m.length; ++t) pr(m[t], 1 - d, m[0], d, m[t]), m[t].fx = e(m[t]);
 			}
 		} else h(v);
 	}
@@ -2127,15 +2088,15 @@ function hr(e, t, n) {
 		x: m[0]
 	};
 }
-var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis.Column }), Object.freeze({ axis: w.Axis.Row }), Object.freeze({
+var hr = Object.freeze({ includeEmpty: !0 }), gr = (Object.freeze({ axis: w.Axis.Column }), Object.freeze({ axis: w.Axis.Row }), Object.freeze({
 	type: T.Number,
 	axis: w.Axis.Row
-})), vr = (e, t, n = !1) => {
+})), _r = (e, t, n = !1) => {
 	let r = e.getRowCount(), i = e.getColumnCount(), a = r * i;
 	if (a === 0) throw C.BuiltIn.Value;
 	let o = r === 1, s = r > 1 && i > 1;
 	if (!t || t.size === 0) {
-		let t = wr(e, a, n), c = Array(a);
+		let t = Cr(e, a, n), c = Array(a);
 		for (let e = 0; e < a; e++) c[e] = [e + 1];
 		return {
 			ys: t,
@@ -2150,7 +2111,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 	let c = t.getRowCount(), l = t.getColumnCount();
 	if (s) {
 		if (c !== r || l !== i) throw C.BuiltIn.Ref;
-		let u = wr(e, a, n), d = wr(t, a), f = Array(a);
+		let u = Cr(e, a, n), d = Cr(t, a), f = Array(a);
 		for (let e = 0; e < a; e++) f[e] = [d[e]];
 		return {
 			ys: u,
@@ -2165,20 +2126,20 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 	if ((o ? l : c) !== a) throw C.BuiltIn.Ref;
 	let u = o ? c : l;
 	return {
-		ys: wr(e, a, n),
-		xs: Tr(t, a, u, o),
+		ys: Cr(e, a, n),
+		xs: wr(t, a, u, o),
 		k: u,
 		isRowOriented: o,
 		isRectangularY: s,
 		yRows: r,
 		yCols: i
 	};
-}, yr = (e, t, n) => {
+}, vr = (e, t, n) => {
 	if (e === void 0) return n(t);
 	if (e === null) return n(!1);
 	if (typeof e == "boolean") return n(e);
 	if (Array.isArray(e)) throw C.BuiltIn.Value;
-	return n(br(((e) => {
+	return n(yr(((e) => {
 		let t = e.getRowCount(), n = e.getColumnCount();
 		if (t === 1 && n === 1 || !S.isImplicitIntersect()) return e.getValueAt(0, 0);
 		let r = e.getCoords(), i = S.getRow() - r.rowStart, a = S.getColumn() - r.colStart, o = i >= 0 && i < t, s = a >= 0 && a < n;
@@ -2187,7 +2148,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 		if (s && t === 1) return e.getValueAt(0, a);
 		throw C.BuiltIn.Value;
 	})(e)));
-}, br = (e) => {
+}, yr = (e) => {
 	if (e == null) return !1;
 	if (typeof e == "boolean") return e;
 	if (typeof e == "number") return !(e > -22250738585072014e-324 && e < 22250738585072014e-324);
@@ -2198,14 +2159,14 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 		throw C.BuiltIn.Value;
 	}
 	throw C.BuiltIn.Value;
-}, xr = (e, t, n) => {
+}, br = (e, t, n) => {
 	let r, i, a;
 	if (t && t.size > 0) {
 		let n = ((e, t) => {
 			let n = e.getRowCount(), r = e.getColumnCount(), i = n * r;
 			if (i === 0) throw C.BuiltIn.Ref;
 			if (t.k === 1) {
-				let t = wr(e, i), a = Array(i);
+				let t = Cr(e, i), a = Array(i);
 				for (let e = 0; e < i; e++) a[e] = [t[e]];
 				return {
 					xs: a,
@@ -2216,7 +2177,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 			let a = t.isRowOriented ? r : n;
 			if ((t.isRowOriented ? n : r) !== t.k) throw C.BuiltIn.Ref;
 			return {
-				xs: Tr(e, a, t.k, t.isRowOriented),
+				xs: wr(e, a, t.k, t.isRowOriented),
 				rows: t.isRowOriented ? 1 : a,
 				cols: t.isRowOriented ? a : 1
 			};
@@ -2230,7 +2191,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 		o[e] = t;
 	}
 	return o;
-}, Sr = (e, t, n) => {
+}, xr = (e, t, n) => {
 	let r = e.length, i = t.length > 0 ? t[0].length : 0, a = [], o = [];
 	n && (a.push(Array(r).fill(1)), o.push(i));
 	for (let e = i - 1; e >= 0; e--) {
@@ -2240,20 +2201,20 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 	}
 	let s = [], c = [], l = [];
 	for (let e = 0; e < a.length; e++) {
-		let t = a[e].slice(), n = Math.sqrt(Er(t, t)), i = Array(c.length).fill(0);
+		let t = a[e].slice(), n = Math.sqrt(Tr(t, t)), i = Array(c.length).fill(0);
 		for (let e = 0; e < 2; e++) for (let e = 0; e < c.length; e++) {
-			let n = Er(c[e], t);
+			let n = Tr(c[e], t);
 			for (let i = 0; i < r; i++) t[i] -= n * c[e][i];
 			i[e] += n;
 		}
-		let o = Math.sqrt(Er(t, t));
+		let o = Math.sqrt(Tr(t, t));
 		if (!(o <= 1e-10 * (n || 1))) {
 			for (let e = 0; e < r; e++) t[e] /= o;
 			i.push(o), c.push(t), l.push(i), s.push(e);
 		}
 	}
 	let u = s.length, d = Array(u);
-	for (let t = 0; t < u; t++) d[t] = Er(c[t], e);
+	for (let t = 0; t < u; t++) d[t] = Tr(c[t], e);
 	let f = Array(u).fill(0);
 	for (let e = u - 1; e >= 0; e--) {
 		let t = d[e];
@@ -2308,7 +2269,7 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 		ssResid: _,
 		predict: g
 	};
-}, Cr = (e, t, n) => {
+}, Sr = (e, t, n) => {
 	let r = t.length, i = C.BuiltIn.NA, a = (e, t) => {
 		let n = Array(r).fill(i);
 		return n[0] = e, r > 1 && (n[1] = t), n;
@@ -2320,9 +2281,9 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 		a(e.f ?? C.BuiltIn.Num, e.df),
 		a(e.ssReg, e.ssResid)
 	];
-}, wr = (e, t, n = !1) => {
+}, Cr = (e, t, n = !1) => {
 	let r = Array(t), i = 0;
-	for (let t of e.values(gr)) {
+	for (let t of e.values(hr)) {
 		if (typeof t != "number") throw C.BuiltIn.Value;
 		if (n) {
 			if (t <= 0) throw C.BuiltIn.Num;
@@ -2330,77 +2291,77 @@ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis
 		} else r[i++] = t;
 	}
 	return r;
-}, Tr = (e, t, n, r) => {
-	let i = wr(e, t * n), a = Array(t);
+}, wr = (e, t, n, r) => {
+	let i = Cr(e, t * n), a = Array(t);
 	for (let e = 0; e < t; e++) {
 		let o = Array(n);
 		for (let a = 0; a < n; a++) o[a] = r ? i[a * t + e] : i[e * n + a];
 		a[e] = o;
 	}
 	return a;
-}, Er = (e, t) => {
+}, Tr = (e, t) => {
 	let n = 0;
 	for (let r = 0; r < e.length; r++) n += e[r] * t[r];
 	return n;
-}, Dr = O({
-	GROWTH: () => Mr,
-	LINEST: () => kr,
-	LOGEST: () => Ar,
-	TREND: () => jr
-}), Or = () => {
+}, Er = O({
+	GROWTH: () => jr,
+	LINEST: () => Or,
+	LOGEST: () => kr,
+	TREND: () => Ar
+}), Dr = () => {
 	if (S.getArgs().getAreaCountAt(1) > 1) throw C.BuiltIn.Ref;
 };
+function Or(e, t, n, r) {
+	Dr();
+	let i = _r(e, t);
+	return vr(n, !0, (e) => {
+		let t = xr(i.ys, i.xs, e);
+		return vr(r, !1, (n) => n ? Sr(t, t.coefficients, e) : [t.coefficients.slice()]);
+	});
+}
 function kr(e, t, n, r) {
-	Or();
-	let i = vr(e, t);
-	return yr(n, !0, (e) => {
-		let t = Sr(i.ys, i.xs, e);
-		return yr(r, !1, (n) => n ? Cr(t, t.coefficients, e) : [t.coefficients.slice()]);
+	Dr();
+	let i = _r(e, t, !0);
+	return vr(n, !0, (e) => {
+		let t = xr(i.ys, i.xs, e), n = Mr(t);
+		return vr(r, !1, (r) => r ? Sr(t, n, e) : [n]);
 	});
 }
 function Ar(e, t, n, r) {
-	Or();
-	let i = vr(e, t, !0);
-	return yr(n, !0, (e) => {
-		let t = Sr(i.ys, i.xs, e), n = Nr(t);
-		return yr(r, !1, (r) => r ? Cr(t, n, e) : [n]);
+	Dr();
+	let i = _r(e, t);
+	return vr(r, !0, (e) => {
+		let t = xr(i.ys, i.xs, e);
+		return br(i, n, t.predict);
 	});
 }
 function jr(e, t, n, r) {
-	Or();
-	let i = vr(e, t);
-	return yr(r, !0, (e) => {
-		let t = Sr(i.ys, i.xs, e);
-		return xr(i, n, t.predict);
-	});
-}
-function Mr(e, t, n, r) {
-	Or();
-	let i = vr(e, t, !0);
-	return yr(r, !0, (e) => {
-		let t = Sr(i.ys, i.xs, e).coefficients.map(Math.exp), r = i.k;
-		return xr(i, n, (e) => {
+	Dr();
+	let i = _r(e, t, !0);
+	return vr(r, !0, (e) => {
+		let t = xr(i.ys, i.xs, e).coefficients.map(Math.exp), r = i.k;
+		return br(i, n, (e) => {
 			let n = t[r];
 			for (let i = 0; i < r; i++) n *= t[r - 1 - i] ** e[i];
 			return Number.isFinite(n) ? n : C.BuiltIn.Num;
 		});
 	});
 }
-var Nr = (e) => e.coefficients.map((e) => {
+var Mr = (e) => e.coefficients.map((e) => {
 	let t = Math.exp(e);
 	return Number.isFinite(t) ? t : C.BuiltIn.Num;
-}), Pr = O({
-	TTEST: () => Ir,
-	T_TEST: () => Lr
-}), Fr = (e) => {
+}), Nr = O({
+	TTEST: () => Fr,
+	T_TEST: () => Ir
+}), Pr = (e) => {
 	let t = e.getCode();
 	return t === C.Code.Null || t === C.Code.GettingData ? C.BuiltIn.Num : e;
 };
-function Ir(e, t, n, r) {
-	return Lr(e, t, n, r);
+function Fr(e, t, n, r) {
+	return Ir(e, t, n, r);
 }
-function Lr(e, t, n, r) {
-	if (n = Math.floor(n + Rr), r = Math.floor(r + Rr), n !== 1 && n !== 2 || r < 1 || r > 3) return NaN;
+function Ir(e, t, n, r) {
+	if (n = Math.floor(n + Lr), r = Math.floor(r + Lr), n !== 1 && n !== 2 || r < 1 || r > 3) return NaN;
 	for (let n of [e, t]) if (n.size === 1 && n.isIReferenceRange) {
 		if (n.hasError()) throw n.firstError();
 		if (n.entries({ includeEmpty: !1 }).next().done) throw C.BuiltIn.Value;
@@ -2411,14 +2372,14 @@ function Lr(e, t, n, r) {
 		if (n.rows * n.columns !== r.rows * r.columns) throw C.BuiltIn.NA;
 		let a = [], o = [];
 		for (let [[n, r]] of e.flatten().alignValues([t.flatten()])) {
-			if (C.isError(n)) throw Fr(n);
-			if (C.isError(r)) throw Fr(r);
+			if (C.isError(n)) throw Pr(n);
+			if (C.isError(r)) throw Pr(r);
 			typeof n == "number" && typeof r == "number" && (a.push(n), o.push(r));
 		}
 		if (a.length < 2) throw C.BuiltIn.Div0;
 		i = function(e, t) {
 			let n = e.length;
-			if (!Number.isFinite(Vr(e)) || !Number.isFinite(Vr(t))) return { error: C.BuiltIn.Num };
+			if (!Number.isFinite(Br(e)) || !Number.isFinite(Br(t))) return { error: C.BuiltIn.Num };
 			let r = 0;
 			for (let i = 0; i < n; i++) r += e[i] - t[i];
 			let i = r / n, a = 0;
@@ -2432,9 +2393,9 @@ function Lr(e, t, n, r) {
 			};
 		}(a, o);
 	} else {
-		if (e.hasError()) throw Fr(e.firstError());
-		if (t.hasError()) throw Fr(t.firstError());
-		let n = e.getValuesFlat(_r), a = t.getValuesFlat(_r);
+		if (e.hasError()) throw Pr(e.firstError());
+		if (t.hasError()) throw Pr(t.firstError());
+		let n = e.getValuesFlat(gr), a = t.getValuesFlat(gr);
 		if (n.length < 2 || a.length < 2) throw C.BuiltIn.Div0;
 		i = r === 2 ? function(e, t) {
 			let n = e.length, r = t.length, i = 0, a = 0, o = 0, s = 0;
@@ -2467,14 +2428,14 @@ function Lr(e, t, n, r) {
 		let n = .5 * function(e, t, n) {
 			if (n <= 0) return 0;
 			if (n >= 1) return 1;
-			let r = Br(e) + Br(t) - Br(e + t), i = Math.exp(Math.log(n) * e + Math.log(1 - n) * t - r);
-			return n < (e + 1) / (e + t + 2) ? i * zr(e, t, n) / e : 1 - i * zr(t, e, 1 - n) / t;
+			let r = zr(e) + zr(t) - zr(e + t), i = Math.exp(Math.log(n) * e + Math.log(1 - n) * t - r);
+			return n < (e + 1) / (e + t + 2) ? i * Rr(e, t, n) / e : 1 - i * Rr(t, e, 1 - n) / t;
 		}(t / 2, .5, t / (t + e * e));
 		return e >= 0 ? 1 - n : n;
 	}(-i.x, i.df) * n;
 }
-var Rr = 2 ** -22;
-function zr(e, t, n) {
+var Lr = 2 ** -22;
+function Rr(e, t, n) {
 	let r = 1e-30, i = e + t, a = e + 1, o = e - 1, s = 1, c = 1 - i * n / a;
 	Math.abs(c) < r && (c = r), c = 1 / c;
 	let l = c;
@@ -2486,7 +2447,7 @@ function zr(e, t, n) {
 	}
 	return l;
 }
-function Br(e) {
+function zr(e) {
 	let t = [
 		.9999999999998099,
 		676.5203681218851,
@@ -2498,19 +2459,19 @@ function Br(e) {
 		9984369578019572e-21,
 		1.5056327351493116e-7
 	];
-	if (e < .5) return Math.log(Math.PI / Math.sin(Math.PI * e)) - Br(1 - e);
+	if (e < .5) return Math.log(Math.PI / Math.sin(Math.PI * e)) - zr(1 - e);
 	e--;
 	let n = t[0];
 	for (let r = 1; r < 9; r++) n += t[r] / (e + r);
 	let r = e + 7.5;
 	return .5 * Math.log(2 * Math.PI) + (e + .5) * Math.log(r) - r + Math.log(n);
 }
-function Vr(e) {
+function Br(e) {
 	let t = 0;
 	for (let n of e) t += n * n;
 	return t;
 }
-var $ = "\\p{L}\\p{N}_", Hr = {
+var $ = "\\p{L}\\p{N}_", Vr = {
 	alpha: "\\p{L}",
 	digit: "\\p{Nd}",
 	alnum: "\\p{L}\\p{N}",
@@ -2525,7 +2486,7 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 	ascii: "\\x00-\\x7F",
 	print: "\\P{C}",
 	graph: "\\P{C}"
-}, Ur = {
+}, Hr = {
 	alpha: "\\P{L}",
 	digit: "\\P{Nd}",
 	upper: "\\P{Lu}",
@@ -2534,18 +2495,18 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 	cntrl: "\\P{Cc}",
 	print: "\\p{C}",
 	graph: "\\p{C}"
-}, Wr = `(?:(?<=[${$}])(?![${$}])|(?<![${$}])(?=[${$}]))`, Gr = `(?:(?<=[${$}])(?=[${$}])|(?<![${$}])(?![${$}]))`, Kr = (e, t) => {
+}, Ur = `(?:(?<=[${$}])(?![${$}])|(?<![${$}])(?=[${$}]))`, Wr = `(?:(?<=[${$}])(?=[${$}])|(?<![${$}])(?![${$}]))`, Gr = (e, t) => {
 	if (!e.startsWith("[:", t)) return null;
 	let n = e.indexOf(":]", t + 2);
 	if (n === -1) return null;
 	let r = e.slice(t + 2, n), i = r.startsWith("^");
 	i && (r = r.slice(1));
-	let a = i ? Ur[r] : Hr[r];
+	let a = i ? Hr[r] : Vr[r];
 	return a === void 0 ? null : {
 		emit: a,
 		next: n + 2
 	};
-}, qr = (e, t) => {
+}, Kr = (e, t) => {
 	if (!e.startsWith("(?", t)) return null;
 	let n = t + 2, r = "", i = "", a = !1;
 	for (; n < e.length;) {
@@ -2566,13 +2527,13 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 		group: !0,
 		next: n + 1
 	} : null;
-}, Jr = (e) => e.replace(/[^ims]/g, ""), Yr = (e) => (RegExp(`${e.source}|`, e.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Xr = (e, t, n = "") => {
+}, qr = (e) => e.replace(/[^ims]/g, ""), Jr = (e) => (RegExp(`${e.source}|`, e.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Yr = (e, t, n = "") => {
 	let r = (t ? "i" : "") + n, i = (e, t) => {
 		try {
 			let n = new RegExp(e, t ? `${r}u` : r);
 			return {
 				regex: n,
-				groups: Yr(n)
+				groups: Jr(n)
 			};
 		} catch {
 			return null;
@@ -2613,11 +2574,11 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 							continue;
 						}
 						if (i === "b") {
-							t += Wr, n += 2;
+							t += Ur, n += 2;
 							continue;
 						}
 						if (i === "B") {
-							t += Gr, n += 2;
+							t += Wr, n += 2;
 							continue;
 						}
 						if (i === "w") {
@@ -2641,7 +2602,7 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 					continue;
 				}
 				if (r) {
-					let i = Kr(e, n);
+					let i = Gr(e, n);
 					if (i) {
 						t += i.emit, n = i.next;
 						continue;
@@ -2657,10 +2618,10 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 					r = !0, t += o, n += 1, e[n] === "^" && (t += "^", n += 1), e[n] === "]" && (t += "\\]", n += 1);
 					continue;
 				}
-				let s = qr(e, n);
+				let s = Kr(e, n);
 				if (s) {
 					s.on.includes("U") && (i = !0), s.off.includes("U") && (i = !1);
-					let e = Jr(s.on), r = Jr(s.off);
+					let e = qr(s.on), r = qr(s.off);
 					s.group ? t += e || r ? `(?${e}${r ? `-${r}` : ""}:` : "(?:" : (e || r) && (t += `(?${e}${r ? `-${r}` : ""}:`, a.push(")")), n = s.next;
 				} else if (i && /[*+?]/.test(o)) e[n + 1] === "?" ? (t += o, n += 2) : (t += `${o}?`, n += 1);
 				else {
@@ -2681,21 +2642,21 @@ var $ = "\\p{L}\\p{N}_", Hr = {
 	}
 	let o = a.replace(/\\([pP])\{([A-Za-z_]+)\}/g, "\\$1{Script=$2}");
 	return i(a, !0) ?? (o === a ? null : i(o, !0)) ?? i(e, !1) ?? C.BuiltIn.Value;
-}, Zr = (e, t) => {
+}, Xr = (e, t) => {
 	let n = Math.trunc(e);
 	return n >= 0 && n <= t ? n : C.BuiltIn.Value;
-}, Qr = O({
-	REGEXEXTRACT: () => $r,
-	REGEXMATCH: () => ei,
-	REGEXREPLACE: () => ti,
-	REGEXTEST: () => ni
+}, Zr = O({
+	REGEXEXTRACT: () => Qr,
+	REGEXMATCH: () => $r,
+	REGEXREPLACE: () => ei,
+	REGEXTEST: () => ti
 });
-function $r(e, t, n = 0, r = 0) {
-	let i = Zr(n, 2);
+function Qr(e, t, n = 0, r = 0) {
+	let i = Xr(n, 2);
 	if (C.isError(i)) return i;
-	let a = Zr(r, 1);
+	let a = Xr(r, 1);
 	if (C.isError(a)) return a;
-	let o = Xr(t, a === 1);
+	let o = Yr(t, a === 1);
 	if (C.isError(o)) return o;
 	let { regex: s } = o;
 	if (i === 0) {
@@ -2710,14 +2671,14 @@ function $r(e, t, n = 0, r = 0) {
 	let c = e.match(s);
 	return c ? S.createRange().replace([c.slice(1).map((e) => e ?? C.BuiltIn.NA)]) : C.BuiltIn.NA;
 }
-function ei(e, t, n = !1) {
-	let r = Xr(t, n);
+function $r(e, t, n = !1) {
+	let r = Yr(t, n);
 	return C.isError(r) ? r : r.regex.test(e);
 }
-function ti(e, t, n, r = 0, i = 0) {
-	let a = Zr(i, 1);
+function ei(e, t, n, r = 0, i = 0) {
+	let a = Xr(i, 1);
 	if (C.isError(a)) return a;
-	let o = Xr(t, a === 1);
+	let o = Yr(t, a === 1);
 	if (C.isError(o)) return o;
 	let { regex: s, groups: c } = o, l = ((e, t) => {
 		let n = "", r = 0;
@@ -2789,11 +2750,11 @@ function ti(e, t, n, r = 0, i = 0) {
 	let m = f[p], h = m.index;
 	return e.slice(0, h) + m[0].replace(s, l) + e.slice(h + m[0].length);
 }
-function ni(e, t, n = 0) {
-	let r = Zr(n, 1);
+function ti(e, t, n = 0) {
+	let r = Xr(n, 1);
 	if (C.isError(r)) return r;
-	let i = Xr(t, r === 1);
+	let i = Yr(t, r === 1);
 	return C.isError(i) ? i : i.regex.test(e);
 }
-var ri = () => import("./CHCYcEKjePbdBT6S.mjs"), ii = () => import("./D4qsZVifvY4HXGV4.mjs"), ai = () => import("./fuSCbGKaf-8luGWM.mjs"), oi = () => import("./DQUpOqHLBRcR3jRL.mjs"), si = () => import("./BAOKFei-3NUnKf2b.mjs"), ci = () => import("./WnWno64b5Kwzt5bq.mjs"), li = () => import("./DzHBzc5ygBHUJz7Z.mjs"), ui = () => import("./DWsUELCL7M8CJRse.mjs"), di = () => import("./Bxs5g9POZ28N8txg.mjs"), fi = () => import("./B81c3QWvxdHun2T7.mjs"), pi = () => import("./BPITz297xS7JQJip.mjs"), mi = () => import("./DIJcwREawbt_MeZK.mjs"), hi = () => import("./Cg8sxKWlH9hl9cmJ.mjs"), gi = () => import("./va7h1_p7n3e5jFud.mjs"), _i = () => import("./5e6JdlNsgYe10haf.mjs"), vi = () => import("./Dq5qeAevZvlIBl1n.mjs"), yi = () => import("./DcxpVQJ0VRPd3zNH.mjs"), bi = () => import("./Bj-GG15t0G1x9-FU.mjs"), xi = () => import("./DTTckRRsdT5hn6tw.mjs"), Si = () => import("./vioImwvyYDFqRDUi.mjs"), Ci = () => import("./Cz08Pg4FLQyPOKHH.mjs"), wi = (S, C, w) => (w ||= /* @__PURE__ */ new Map(), C(w, S, k, e, ri, "Cube"), C(w, S, ve, b, ii, "Financial"), C(w, S, je, r, ai, "Financial"), C(w, S, Pe, y, oi, "Financial", x), C(w, S, Ze, t, si, "Financial"), C(w, S, rt, s, ci, "Financial"), C(w, S, Et, c, li, "Financial"), C(w, S, Nt, d, ui, "Financial"), C(w, S, Lt, m, di, "Financial"), C(w, S, Ut, o, fi, "Financial"), C(w, S, rn, a, pi, "Financial"), C(w, S, un, v, mi, "Financial"), C(w, S, hn, u, hi, "Financial"), C(w, S, Cn, i, gi, "Financial"), C(w, S, Dn, g, _i, "Financial"), C(w, S, qn, p, vi, "Lookup & Reference"), C(w, S, Qn, n, yi, "Lookup & Reference"), C(w, S, nr, l, bi, "Statistical"), C(w, S, Dr, h, xi, "Statistical"), C(w, S, Pr, f, Si, "Statistical"), C(w, S, Qr, _, Ci, "Text"), w);
-export { wi as default };
+var ni = () => import("./0T4CVS-eRgxCYtfc.mjs"), ri = () => import("./Bl_XKy6jAuDPfR9q.mjs"), ii = () => import("./wDK0UoVDut_yHFnN.mjs"), ai = () => import("./DXL2nRPu379ZLJW4.mjs"), oi = () => import("./DIHbCSX3oHxaFWRN.mjs"), si = () => import("./COe-XUcPznzLainQ.mjs"), ci = () => import("./BCYJKZ1F4xTomy55.mjs"), li = () => import("./DKZop8VVKKOl-zxC.mjs"), ui = () => import("./XKjpEaAe7snu5CA2.mjs"), di = () => import("./C4RRHqox3t77s061.mjs"), fi = () => import("./D-0RdQDA-k9FyfJp.mjs"), pi = () => import("./CeirmCdzQsLSw3D7.mjs"), mi = () => import("./B6SWueGjJbR9GvFt.mjs"), hi = () => import("./WqqCRFF2pHDYrHIR.mjs"), gi = () => import("./DoI7-GUWqVDLmhja.mjs"), _i = () => import("./DYh11b5QiPmrgbxg.mjs"), vi = () => import("./Dlcgl-1wfKMGrJTS.mjs"), yi = () => import("./Cvnn-NZsNEe7z_gs.mjs"), bi = () => import("./EWxMSgdCKFRMCIGV.mjs"), xi = () => import("./Dzjc2PG0ZpDM5JTu.mjs"), Si = () => import("./b-DmHhG0rwDpMJ6g.mjs"), Ci = (S, C, w) => (w ||= /* @__PURE__ */ new Map(), C(w, S, k, e, ni, "Cube"), C(w, S, ve, b, ri, "Financial"), C(w, S, je, r, ii, "Financial"), C(w, S, Pe, y, ai, "Financial", x), C(w, S, Ze, t, oi, "Financial"), C(w, S, rt, s, si, "Financial"), C(w, S, Et, c, ci, "Financial"), C(w, S, Nt, d, li, "Financial"), C(w, S, Lt, m, ui, "Financial"), C(w, S, Ut, o, di, "Financial"), C(w, S, rn, a, fi, "Financial"), C(w, S, un, v, pi, "Financial"), C(w, S, hn, u, mi, "Financial"), C(w, S, Cn, i, hi, "Financial"), C(w, S, Dn, g, gi, "Financial"), C(w, S, qn, p, _i, "Lookup & Reference"), C(w, S, Qn, n, vi, "Lookup & Reference"), C(w, S, tr, l, yi, "Statistical"), C(w, S, Er, h, bi, "Statistical"), C(w, S, Nr, f, xi, "Statistical"), C(w, S, Zr, _, Si, "Text"), w);
+export { Ci as default };