@sheetxl/mcp 0.8.0-beta.15 → 0.8.0-beta.17

package/assets/{LEJp05fjmflKgyqF.js → C2ZX6ffXsMaEr2d2.js}

@@ -1,36 +1,36 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - 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 { ht as e } from "./BQMDOjNBMjAx9WiW.js";
-import { a as t } from "./iujMYIEPx_v3sdPf.js";
-import { a as n, c as r, d as i, o as s, p as l } from "./BQbF1RkUH8WyXqSD.js";
-import { Ai as o, B as a, Fi as u, Fr as c, Gr as f, In as p, Mn as d, Mt as g, Pt as v, U as h, Xt as m, Yt as y, _i as I, bi as b, c as x, ea as R, ei as E, f as T, fr as A, gi as S, gr as w, ha as C, ir as N, it as F, mr as P, mt as L, ni as k, ra as $, ta as O, va as B, y as V } from "./Bh0PNKlrR4VAqnP8.js";
-var z = (e, t) => e + t, D = (e, t) => e - t, M = (e, t) => w(e + t, e), W = (e, t) => w(e - t, e), U = (e, t) => A(e * t), _ = (e, t) => 0 === t ? i.BuiltIn.Div0 : A(e / t), j = (e, t) => {
+import { ht as e } from "./CfA8o-FNret9-D6Y.js";
+import { i as t } from "./BJBoygm-gY68bLAP.js";
+import { a as n, c as r, d as i, o as s, p as l } from "./MW2nt7se27FlH9Yb.js";
+import { At as o, Ea as a, Er as u, Fi as c, H as f, Ht as p, Jr as d, Lt as g, Ma as v, R as h, Rn as m, St as y, _a as I, an as b, bt as x, cn as R, d as E, f as T, gn as A, ia as S, jn as w, kn as C, mr as N, or as F, pn as P, t as L, ti as k, u as $, wa as O, yi as B, z as V } from "./D6ON3ZLcTAXV3fO6.js";
+var z = (e, t) => e + t, D = (e, t) => e - t, M = (e, t) => c(e + t, e), W = (e, t) => c(e - t, e), U = (e, t) => B(e * t), _ = (e, t) => 0 === t ? i.BuiltIn.Div0 : B(e / t), j = (e, t) => {
 	if (0 === e) {
 		if (t < 0) return i.BuiltIn.Div0;
 		if (0 === t) return NaN;
 	}
 	if (e < 0) {
-		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return A(e ** t);
+		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return B(e ** t);
 		const n = Number((1 / t).toPrecision(15));
-		return Number.isInteger(n) && 1 === Math.abs(n % 2) ? A(-((-e) ** t)) : NaN;
+		return Number.isInteger(n) && 1 === Math.abs(n % 2) ? B(-((-e) ** t)) : NaN;
 	}
-	return A(e ** t);
+	return B(e ** t);
 }, G = (e = "", t = "") => {
 	null === e && (e = ""), null === t && (t = "");
 	const n = typeof t;
-	"boolean" == typeof e && (e = F(e)), "boolean" === n && (t = F(t));
+	"boolean" == typeof e && (e = f(e)), "boolean" === n && (t = f(t));
 	const r = "" + e + t;
 	return r.length > s.MAX_TEXT_LENGTH ? r.slice(0, s.MAX_TEXT_LENGTH) : r;
-}, H = (e, t = null, n = null) => 0 === e.compare(t, n), X = (e, t = null, n = null) => 0 !== e.compare(t, n), K = (e, t = null, n = null) => e.compare(t, n) > 0, Z = (e, t = null, n = null) => e.compare(t, n) >= 0, q = (e, t = null, n = null) => e.compare(t, n) < 0, Y = (e, t = null, n = null) => e.compare(t, n) <= 0, J = {
+}, H = (e, t = null, n = null) => 0 === e.compare(t, n), X = (e, t = null, n = null) => 0 !== e.compare(t, n), K = (e, t = null, n = null) => e.compare(t, n) > 0, Z = (e, t = null, n = null) => e.compare(t, n) >= 0, q = (e, t = null, n = null) => e.compare(t, n) < 0, J = (e, t = null, n = null) => e.compare(t, n) <= 0, Q = {
 	type: l.Number,
 	coerce: [l.Boolean, l.String],
 	onError: "value",
 	misalignValue: i.BuiltIn.NA
-}, Q = {
+}, Y = {
 	type: l.String,
 	coerce: [l.Boolean, l.Number],
 	onError: "value",
@@ -45,19 +45,19 @@ var z = (e, t) => e + t, D = (e, t) => e - t, M = (e, t) => w(e + t, e), W = (e,
 	let s, o;
 	if (t?.isIRange ? s = t : n?.isIRange && (o = n), !s && !o) {
 		const s = e.getRuntime();
-		return t = f(s, t, b(t, !0), l.Number, !0), n = f(s, n, b(n, !0), l.Number, !0), t && i.isError(t) ? t : n && i.isError(n) ? n : r(t, n);
+		return t = T(s, t, u(t, !0), l.Number, !0), n = T(s, n, u(n, !0), l.Number, !0), t && i.isError(t) ? t : n && i.isError(n) ? n : r(t, n);
 	}
-	const a = !s, u = a ? t : n;
-	return (s ?? o).broadcast(u, (t, n) => t && i.isError(t) ? t : n && i.isError(n) ? n : E(a ? r(n, t) : r(t, n), e), J).fillEmpty(0);
+	const a = !s, c = a ? t : n;
+	return (s ?? o).broadcast(c, (t, n) => t && i.isError(t) ? t : n && i.isError(n) ? n : h(a ? r(n, t) : r(t, n), e), Q).fillEmpty(0);
 }, re = (e, t, r, s) => {
-	if (d(t) || d(r)) return i.BuiltIn.Value;
+	if (a(t) || a(r)) return i.BuiltIn.Value;
 	if (n(t) || n(r)) return i.BuiltIn.Value;
 	if (null !== t && void 0 !== t.colStart && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && i.isError(t)) return t;
 	if (null !== r && void 0 !== r.colStart && (r = e.getValueAt(r.rowStart, r.colStart, r.scope)) && i.isError(r)) return r;
 	let l, o;
 	t = te(t), r = te(r);
-	let a = !1;
-	return t?.isIRange ? (l = t, o = r) : r?.isIRange && (l = r, o = t, a = !0), l ? l.broadcast(o, (t, n) => t && i.isError(t) ? t : n && i.isError(n) ? n : (t = ie(t), n = ie(n), a ? s(e, n, t) : s(e, t, n)), ee) : i.isError(t) ? t : i.isError(r) ? r : s(e, ie(t), ie(r));
+	let u = !1;
+	return t?.isIRange ? (l = t, o = r) : r?.isIRange && (l = r, o = t, u = !0), l ? l.broadcast(o, (t, n) => t && i.isError(t) ? t : n && i.isError(n) ? n : (t = ie(t), n = ie(n), u ? s(e, n, t) : s(e, t, n)), ee) : i.isError(t) ? t : i.isError(r) ? r : s(e, ie(t), ie(r));
 }, ie = (e) => {
 	if (!0 !== e?.isIRichData) return e;
 	const t = e.toPrimitive?.();
@@ -70,9 +70,9 @@ var z = (e, t) => e + t, D = (e, t) => e - t, M = (e, t) => w(e + t, e), W = (e,
 	if ("-" !== t) throw new i.Value(`Unrecognized prefix: ${t}`);
 	if (s = -s, n?.isIRange && (r = n), !r) {
 		const t = e.getRuntime();
-		return "number" != typeof (n = f(t, n, b(n, !0), l.Number, !0)) ? i.BuiltIn.Value : n * s;
+		return "number" != typeof (n = T(t, n, u(n, !0), l.Number, !0)) ? i.BuiltIn.Value : n * s;
 	}
-	return r.broadcast(s, (e, t) => e && i.isError(e) ? e : t && i.isError(t) ? t : U(e, t), J);
+	return r.broadcast(s, (e, t) => e && i.isError(e) ? e : t && i.isError(t) ? t : U(e, t), Q);
 }, le = (e) => e.getCode() <= i.Code.NA ? e : i.BuiltIn.Value, oe = (e, t, n, r, s) => {
 	if (i.isError(t)) return le(t);
 	if (n && i.isError(n)) return le(n);
@@ -93,18 +93,18 @@ var z = (e, t) => e + t, D = (e, t) => e - t, M = (e, t) => w(e + t, e), W = (e,
 	"*": (e, t, n) => ne(e, t, n, U),
 	"/": (e, t, n) => ne(e, t, n, _),
 	"^": (e, t, n) => ne(e, t, n, j),
-	" ": (e, t, n, r) => oe(e, t, n, h, "either"),
-	":": (e, t, n, r) => oe(e, t, n, B, "start"),
+	" ": (e, t, n, r) => oe(e, t, n, m, "either"),
+	":": (e, t, n, r) => oe(e, t, n, S, "start"),
 	".:.": (e, t, n, r) => {
-		const i = oe(e, t, n, B, "start");
+		const i = oe(e, t, n, S, "start");
 		return e.getFunction("TRIMRANGE").execute(i, 3, 3);
 	},
 	".:": (e, t, n, r) => {
-		const i = oe(e, t, n, B, "start");
+		const i = oe(e, t, n, S, "start");
 		return e.getFunction("TRIMRANGE").execute(i, 1, 1);
 	},
 	":.": (e, t, n, r) => {
-		const i = oe(e, t, n, B, "start");
+		const i = oe(e, t, n, S, "start");
 		return e.getFunction("TRIMRANGE").execute(i, 2, 2);
 	},
 	"&": (e, t, n) => ((e, t, n, r) => {
@@ -114,17 +114,17 @@ var z = (e, t) => e + t, D = (e, t) => e - t, M = (e, t) => w(e + t, e), W = (e,
 		let s, o;
 		if (t?.isIRange ? s = t : n?.isIRange && (o = n), !s && !o) {
 			const s = e.getRuntime();
-			return t = f(s, t, b(t, !0), l.String, !1), n = f(s, n, b(n, !0), l.String, !1), i.isError(t) ? t : i.isError(n) ? n : r(t, n);
+			return t = T(s, t, u(t, !0), l.String, !1), n = T(s, n, u(n, !0), l.String, !1), i.isError(t) ? t : i.isError(n) ? n : r(t, n);
 		}
-		const a = !s, u = a ? t : n;
-		return (s ?? o).broadcast(u, (e, t) => e && i.isError(e) ? e : t && i.isError(t) ? t : a ? r(t, e) : r(e, t), Q);
+		const a = !s, c = a ? t : n;
+		return (s ?? o).broadcast(c, (e, t) => e && i.isError(e) ? e : t && i.isError(t) ? t : a ? r(t, e) : r(e, t), Y);
 	})(e, t, n, G),
 	"=": (e, t, n) => re(e, t, n, H),
 	"<>": (e, t, n) => re(e, t, n, X),
 	">": (e, t, n) => re(e, t, n, K),
 	"<": (e, t, n) => re(e, t, n, q),
 	">=": (e, t, n) => re(e, t, n, Z),
-	"<=": (e, t, n) => re(e, t, n, Y)
+	"<=": (e, t, n) => re(e, t, n, J)
 }, ue = {
 	"+": (e, t, n) => ne(e, t, n, M),
 	"-": (e, t, n) => ne(e, t, n, W)
@@ -159,38 +159,38 @@ var de = class {
 				value: null,
 				inputs: null
 			};
-			if (this.references.set(e, t), n === $.Cell) {
+			if (this.references.set(e, t), n === F.Cell) {
 				const n = e.value;
 				n.$colIndex && (t.hasHorizontalAbs = !0), n.$rowIndex && (t.hasVerticalAbs = !0), t.value = this.cells.size, this.cells.set(e, this.cells.size), this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, this.referenceIndices.push(t.index);
 				return;
 			}
-			if (n === $.Infix || n === $.Prefix || n === $.Postfix || n === $.List) {
+			if (n === F.Infix || n === F.Prefix || n === F.Postfix || n === F.List) {
 				const n = e.inputs || [], r = n.length, i = e.value;
 				t.op = i;
-				const s = p(r);
+				const s = o(r);
 				t.inputs = s;
 				for (let e = 0; e < r; e++) {
 					const r = n[e], i = this.references.get(r);
 					i ? (i.hasHorizontalAbs && (t.hasHorizontalAbs = !0), i.hasVerticalAbs && (t.hasVerticalAbs = !0), s[e] = i.index) : s[e] = -1, i && this.rootReferences.delete(i);
 				}
-				if (this.rootReferences.add(t), Ke.includes(i)) {
-					const r = n[0], i = !!r && r.type === $.Cell, s = n[1], l = !!s && s.type === $.Cell;
+				if (this.rootReferences.add(t), qe.includes(i)) {
+					const r = n[0], i = !!r && r.type === F.Cell, s = n[1], l = !!s && s.type === F.Cell;
 					i && l && void 0 !== s.referenceIndex && void 0 !== r.referenceIndex && (this.referenceIndices.splice(s.referenceIndex, 1), s.referenceIndex = r.referenceIndex, e.referenceIndex = r.referenceIndex, this.referenceIndices[r.referenceIndex] = t.index);
 				} else "#" === i && n[0] && (e.referenceIndex = n[0].referenceIndex);
 				return;
 			}
-			if (n === $.Error || n === $.Named) {
-				const r = n === $.Named ? e.value.nameId : x(e.value);
+			if (n === F.Error || n === F.Named) {
+				const r = n === F.Named ? e.value.nameId : N(e.value);
 				let i = this.names.get(r);
 				t.op = n, void 0 === i && (i = this.names.size, this.names.set(r, i)), t.value = i, this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, this.referenceIndices.push(t.index);
 				return;
 			}
-			if (n === $.TableReference) return t.op = n, this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, void this.referenceIndices.push(t.index);
+			if (n === F.TableReference) return t.op = n, this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, void this.referenceIndices.push(t.index);
 		} else if (t && t.isReference) {
 			const t = {
 				node: e,
 				index: this.references.size,
-				op: $.Function,
+				op: F.Function,
 				value: e.value,
 				inputs: null
 			};
@@ -198,11 +198,11 @@ var de = class {
 		}
 	}
 };
-function ge(e, t = !1, n = T) {
+function ge(e, t = !1, n = b) {
 	const r = [], i = /* @__PURE__ */ new Set(), s = (e, n, s) => {
 		const l = {
 			type: e.type,
-			value: e.type === $.Error ? P(e.value) : e.value
+			value: e.type === F.Error ? $(e.value) : e.value
 		};
 		void 0 !== e.image && (l.text = ((e) => {
 			const n = t ? e.value?.scopeImage : void 0;
@@ -212,7 +212,7 @@ function ge(e, t = !1, n = T) {
 		return void 0 !== o && (l.evalIndex = o), n && (l.context = n), void 0 !== e.referenceIndex && (l.referenceIndex = e.referenceIndex), e.isReference && i.add(l), r.push(l), l;
 	}, l = (e, t, n, i, s) => {
 		if (null == t) return;
-		if (r.length > 1 && e === $.Whitespace && r[r.length - 1].type === $.Whitespace) return;
+		if (r.length > 1 && e === F.Whitespace && r[r.length - 1].type === F.Whitespace) return;
 		const l = {
 			type: e,
 			value: t,
@@ -220,62 +220,62 @@ function ge(e, t = !1, n = T) {
 		};
 		void 0 !== i && (l.evalIndex = i), n && (l.context = n), r.push(l);
 	};
-	(function e(o, u, c) {
-		const f = o.evalIndex ?? c ?? 0, p = o.type, d = (t, r, i) => {
+	(function e(o, a, u) {
+		const c = o.evalIndex ?? u ?? 0, f = o.type, p = (t, r, i) => {
 			if (!t) return;
 			const s = t.length;
-			for (let o = 0; o < s; o++) e(t[o], r, i), o < s - 1 && l($.Separator, ",", r, i, n.separatorFunction);
+			for (let o = 0; o < s; o++) e(t[o], r, i), o < s - 1 && l(F.Separator, ",", r, i, n.separatorFunction);
 		};
 		if (o.isLiteral) {
-			if (l($.Whitespace, o.wsBefore, u, f), p === $.Array) {
-				l($.Type, "{", u, f);
+			if (l(F.Whitespace, o.wsBefore, a, c), f === F.Array) {
+				l(F.Type, "{", a, c);
 				const t = o.value, r = t.length;
 				for (let i = 0; i < r; i++) {
-					const s = t[i], o = s.value, a = o.length;
-					for (let t = 0; t < a; t++) {
+					const s = t[i], o = s.value, u = o.length;
+					for (let t = 0; t < u; t++) {
 						const r = o[t];
-						l($.Whitespace, r.wsBefore, u, f), e(r, u, f), l($.Whitespace, r.wsAfter, u, f), t < a - 1 && l($.Separator, ",", u, f, n.separatorColumn);
+						l(F.Whitespace, r.wsBefore, a, c), e(r, a, c), l(F.Whitespace, r.wsAfter, a, c), t < u - 1 && l(F.Separator, ",", a, c, n.separatorColumn);
 					}
-					i < r - 1 && (l($.Whitespace, s.wsBefore, u, f), l($.Separator, ";", u, f, n.separatorRow), l($.Whitespace, s.wsAfter, u, f));
+					i < r - 1 && (l(F.Whitespace, s.wsBefore, a, c), l(F.Separator, ";", a, c, n.separatorRow), l(F.Whitespace, s.wsAfter, a, c));
 				}
-				o.error || l($.Type, "}", u, f);
-			} else p === $.String ? (o = {
-				type: p,
+				o.error || l(F.Type, "}", a, c);
+			} else f === F.String ? (o = {
+				type: f,
 				value: "\"" + `${o.value}`.replace(/"/g, "\"\"") + "\"",
 				image: o.image
-			}, s(o, u, f)) : s(o, u, f);
-			l($.Whitespace, o.wsAfter, u, f);
-		} else if (p === $.Infix) e(o.inputs[0], u, f), l($.Whitespace, o.wsBefore, u, f), s(o, u, f), l($.Whitespace, o.wsAfter, u, f), e(o.inputs[1], u, f);
-		else if (p === $.Prefix) l($.Whitespace, o.wsBefore, u, f), s(o, u, f), l($.Whitespace, o.wsAfter, u, f), o.inputs && e(o.inputs[0], u, f);
-		else if (p === $.Postfix) {
-			o.inputs?.[0] && e(o.inputs[0], u, f), l($.Whitespace, o.wsBefore, u, f);
-			const t = s(o, u, f), n = r[r.length - 2];
-			"#" === o.value && void 0 !== t.text && !o.wsBefore && i.has(n) && (n.text = (n.text ?? "") + t.text, t.text = ""), l($.Whitespace, o.wsAfter, u, f);
+			}, s(o, a, c)) : s(o, a, c);
+			l(F.Whitespace, o.wsAfter, a, c);
+		} else if (f === F.Infix) e(o.inputs[0], a, c), l(F.Whitespace, o.wsBefore, a, c), s(o, a, c), l(F.Whitespace, o.wsAfter, a, c), e(o.inputs[1], a, c);
+		else if (f === F.Prefix) l(F.Whitespace, o.wsBefore, a, c), s(o, a, c), l(F.Whitespace, o.wsAfter, a, c), o.inputs && e(o.inputs[0], a, c);
+		else if (f === F.Postfix) {
+			o.inputs?.[0] && e(o.inputs[0], a, c), l(F.Whitespace, o.wsBefore, a, c);
+			const t = s(o, a, c), n = r[r.length - 2];
+			"#" === o.value && void 0 !== t.text && !o.wsBefore && i.has(n) && (n.text = (n.text ?? "") + t.text, t.text = ""), l(F.Whitespace, o.wsAfter, a, c);
 		} else {
-			l($.Whitespace, o.wsBefore, u, f);
-			const c = o.inputs;
-			switch (p) {
-				case $.Function: {
+			l(F.Whitespace, o.wsBefore, a, c);
+			const u = o.inputs;
+			switch (f) {
+				case F.Function: {
 					const t = String(o.value), i = {
-						type: $.Function,
+						type: F.Function,
 						value: t,
 						text: o.image ?? t,
 						evalIndex: o.evalIndex
 					};
-					u && (i.context = u), r.push(i);
+					a && (i.context = a), r.push(i);
 					const s = {
 						name: t,
 						argIndex: -1,
 						type: o.binder?.kind ?? "function"
 					};
-					if (u?.bound && (s.bound = u.bound), l($.Paren, "(", s, o.evalIndex), c) {
-						const t = c.length, r = o.binder?.kind, i = "lambda" === r ? 1 : "let" === r ? 2 : 0;
+					if (a?.bound && (s.bound = a.bound), l(F.Paren, "(", s, o.evalIndex), u) {
+						const t = u.length, r = o.binder?.kind, i = "lambda" === r ? 1 : "let" === r ? 2 : 0;
 						let a = s.bound;
 						for (let o = 0; o < t; o++) {
-							const u = i && o >= i ? c[o - i] : void 0;
-							if (u?.binding?.declaration) {
-								const e = u.value.nameId, t = "let" === r ? bt(c[o - 1]) : void 0;
-								a = It(a, t ? {
+							const f = i && o >= i ? u[o - i] : void 0;
+							if (f?.binding?.declaration) {
+								const e = f.value.nameId, t = "let" === r ? Rt(u[o - 1]) : void 0;
+								a = xt(a, t ? {
 									name: e,
 									params: t
 								} : { name: e });
@@ -284,47 +284,47 @@ function ge(e, t = !1, n = T) {
 								...s,
 								argIndex: o
 							};
-							a && (p.bound = a), e(c[o], p, f), o < t - 1 && l($.Separator, ",", p, f, n.separatorFunction);
+							a && (p.bound = a), e(u[o], p, c), o < t - 1 && l(F.Separator, ",", p, c, n.separatorFunction);
 						}
 					}
-					o.error || l($.Paren, ")", s, o.evalIndex);
+					o.error || l(F.Paren, ")", s, o.evalIndex);
 					break;
 				}
-				case $.Call: {
-					const t = a(o), i = r.length;
-					if (t && e(t, u, f), t?.type === $.Named) for (let e = i; e < r.length; e++) {
+				case F.Call: {
+					const t = P(o), i = r.length;
+					if (t && e(t, a, c), t?.type === F.Named) for (let e = i; e < r.length; e++) {
 						const t = r[e];
-						t.type !== $.Whitespace && (t.evalIndex = o.evalIndex, t.type === $.Named && (t.type = $.Function, t.value = t.value.name));
+						t.type !== F.Whitespace && (t.evalIndex = o.evalIndex, t.type === F.Named && (t.type = F.Function, t.value = t.value.name));
 					}
 					const s = {
-						name: t?.type === $.Named ? t.value.nameId : "",
+						name: t?.type === F.Named ? t.value.nameId : "",
 						argIndex: -1,
 						type: "function"
 					};
-					u?.bound && (s.bound = u.bound), l($.Paren, "(", s, o.evalIndex);
-					const c = C(o), p = c.length;
-					for (let t = 0; t < p; t++) {
+					a?.bound && (s.bound = a.bound), l(F.Paren, "(", s, o.evalIndex);
+					const u = x(o), f = u.length;
+					for (let t = 0; t < f; t++) {
 						const r = {
 							...s,
 							argIndex: t
 						};
-						e(c[t], r, f), t < p - 1 && l($.Separator, ",", r, f, n.separatorFunction);
+						e(u[t], r, c), t < f - 1 && l(F.Separator, ",", r, c, n.separatorFunction);
 					}
-					o.error || l($.Paren, ")", s, o.evalIndex);
+					o.error || l(F.Paren, ")", s, o.evalIndex);
 					break;
 				}
-				case $.Cell:
-					s(o, u, f);
+				case F.Cell:
+					s(o, a, c);
 					break;
-				case $.Paren:
-					l(p, "(", u, f), d(c, u, f), o.error || l(p, ")", u, f);
+				case F.Paren:
+					l(f, "(", a, c), p(u, a, c), o.error || l(f, ")", a, c);
 					break;
-				case $.TableReference: {
+				case F.TableReference: {
 					const n = o.value?.tableId ?? "", s = {
 						name: n,
 						argIndex: -1,
 						type: "table"
-					}, a = r.length, p = o.image;
+					}, f = r.length, p = o.image;
 					let d, g = !1;
 					if (n && p) {
 						let e = 0;
@@ -333,72 +333,72 @@ function ge(e, t = !1, n = T) {
 							-1 !== t && 33 === p.charCodeAt(t + 1) && (e = t + 2);
 						}
 						const n = p.indexOf("[", e);
-						if (g = 0 === n && null != c, n > 0) d = p.slice(0, n);
-						else if (!c) {
+						if (g = 0 === n && null != u, n > 0) d = p.slice(0, n);
+						else if (!u) {
 							const e = p.lastIndexOf("!");
 							d = t || -1 === e ? p : p.slice(e + 1);
 						}
 					}
-					if (!n || g && t || l($.TableReference, n, u, f, d), c && l($.Paren, "[", s, f), c) {
-						const t = c.length;
+					if (!n || g && t || l(F.TableReference, n, a, c, d), u && l(F.Paren, "[", s, c), u) {
+						const t = u.length;
 						for (let n = 0; n < t; n++) {
 							const r = {
 								...s,
 								argIndex: n
 							};
-							e(c[n], r, f), n < t - 1 && l($.Separator, ",", r, f);
+							e(u[n], r, c), n < t - 1 && l(F.Separator, ",", r, c);
 						}
 					}
-					c && !o.error && l($.Paren, "]", s, f);
+					u && !o.error && l(F.Paren, "]", s, c);
 					const v = o.referenceIndex;
-					for (let e = a; e < r.length; e++) void 0 !== v && (r[e].referenceIndex = v), i.add(r[e]);
+					for (let e = f; e < r.length; e++) void 0 !== v && (r[e].referenceIndex = v), i.add(r[e]);
 					break;
 				}
-				case $.TableSpecifier:
-				case $.TableColumn: {
+				case F.TableSpecifier:
+				case F.TableColumn: {
 					const e = o.image, t = null != e && e.startsWith("[") && e.endsWith("]");
-					t && l($.Paren, "[", u, f);
+					t && l(F.Paren, "[", a, c);
 					const n = {
-						table: "table" === u?.type ? u.name : "",
+						table: "table" === a?.type ? a.name : "",
 						name: o.value
 					}, i = {
-						type: p,
+						type: f,
 						value: n,
 						text: t ? e.slice(1, -1) : e ?? n.name
 					};
-					void 0 !== f && (i.evalIndex = f), u && (i.context = u), r.push(i), t && l($.Paren, "]", u, f);
+					void 0 !== c && (i.evalIndex = c), a && (i.context = a), r.push(i), t && l(F.Paren, "]", a, c);
 					break;
 				}
-				case $.List:
-					d(c, u, f);
+				case F.List:
+					p(u, a, c);
 					break;
-				case $.Named: {
-					const e = s(o, u, f), t = o.value;
+				case F.Named: {
+					const e = s(o, a, c), t = o.value;
 					e.value = t.scope ? {
 						name: t.nameId,
 						scope: t.scope
-					} : { name: t.nameId }, o.binding?.declaration && o.binding.optional && (e.value.optional = !0), o.binding && (e.type = $.Parameter, o.binding.declaration && (e.value.declaration = !0)), delete e.referenceIndex;
+					} : { name: t.nameId }, o.binding?.declaration && o.binding.optional && (e.value.optional = !0), o.binding && (e.type = F.Parameter, o.binding.declaration && (e.value.declaration = !0)), delete e.referenceIndex;
 					break;
 				}
-				default: void 0 !== o.value && s(o, u, f), c && c.forEach((t) => e(t, u, f));
+				default: void 0 !== o.value && s(o, a, c), u && u.forEach((t) => e(t, a, c));
 			}
-			l($.Whitespace, o.wsAfter, u, f);
+			l(F.Whitespace, o.wsAfter, a, c);
 		}
 	})(e);
 	const o = /* @__PURE__ */ new Map();
-	for (const e of r) if (e.type === $.Cell && void 0 !== e.referenceIndex) {
+	for (const e of r) if (e.type === F.Cell && void 0 !== e.referenceIndex) {
 		const t = o.get(e.referenceIndex);
 		t ? t.push(e) : o.set(e.referenceIndex, [e]);
 	}
 	for (const e of o.values()) 1 === e.length ? e[0].refSide = "self" : (e[0].refSide = "left", e[e.length - 1].refSide = "right");
-	const u = /* @__PURE__ */ new Map();
+	const a = /* @__PURE__ */ new Map();
 	for (const e of r) if (void 0 !== e.referenceIndex && void 0 !== e.evalIndex) {
-		const t = u.get(e.referenceIndex);
-		(void 0 === t || e.evalIndex < t) && u.set(e.referenceIndex, e.evalIndex);
+		const t = a.get(e.referenceIndex);
+		(void 0 === t || e.evalIndex < t) && a.set(e.referenceIndex, e.evalIndex);
 	}
-	if (u.size > 0) {
+	if (a.size > 0) {
 		for (const e of r) if (void 0 !== e.referenceIndex) {
-			const t = u.get(e.referenceIndex);
+			const t = a.get(e.referenceIndex);
 			void 0 !== t && (e.evalIndex = t);
 		}
 	}
@@ -408,19 +408,19 @@ function ve(e, t) {
 	let n = "";
 	for (let r = 0; r < e.length; r++) {
 		const i = e[r], s = i.type;
-		if (s === $.Cell || s === $.Named || s === $.Error) {
-			const e = s === $.Cell ? i.value?.scope : ($.Named, i.value?.scope ?? void 0), r = s === $.Error ? void 0 !== i.text && I(i.text) : i.text?.includes("!") ?? !1;
+		if (s === F.Cell || s === F.Named || s === F.Error) {
+			const e = s === F.Cell ? i.value?.scope : (F.Named, i.value?.scope ?? void 0), r = s === F.Error ? void 0 !== i.text && d(i.text) : i.text?.includes("!") ?? !1;
 			if (e && void 0 !== i.text && !r) {
 				const r = t?.resolve(R.Sheet, e)?.toString() ?? e;
-				n += y(r) + "!" + i.text;
+				n += w(r) + "!" + i.text;
 				continue;
 			}
-			if (s === $.Named) {
+			if (s === F.Named) {
 				n += i.text ?? i.value?.name ?? "";
 				continue;
 			}
 		}
-		if (s === $.Parameter) {
+		if (s === F.Parameter) {
 			n += i.text ?? i.value?.name ?? "";
 			continue;
 		}
@@ -431,40 +431,40 @@ function ve(e, t) {
 }
 function he(e, t) {
 	let n;
-	if (O(e, (e) => {
+	if (v(e, (e) => {
 		e.evalIndex === t && (n = e);
 	}), !n) return [];
 	const r = ge(n);
-	return r.length > 1 && r[0].type === $.Whitespace && r.shift(), r.length > 1 && r[r.length - 1].type === $.Whitespace && r.pop(), r;
+	return r.length > 1 && r[0].type === F.Whitespace && r.shift(), r.length > 1 && r[r.length - 1].type === F.Whitespace && r.pop(), r;
 }
 function me(e) {
-	return O(e, (e) => {
-		if (e.type !== $.TableReference) return;
+	return v(e, (e) => {
+		if (e.type !== F.TableReference) return;
 		const t = function(e) {
 			if (null !== e.value && "object" == typeof e.value) return e.value;
 			const t = e.value, n = e.inputs;
 			let r = !1, i = !1, s = !1, l = !1, o = null, a = null, u = !1;
-			const f = (e) => {
-				e?.type === $.TableColumn && (o = e.value, a = e.value);
+			const c = (e) => {
+				e?.type === F.TableColumn && (o = e.value, a = e.value);
 			};
 			if (n) for (const e of n) {
 				const t = e.type;
-				if (t === $.TableSpecifier) {
+				if (t === F.TableSpecifier) {
 					const t = e.value.toUpperCase().trim();
 					"#ALL" === t ? i = !0 : "#HEADERS" === t ? s = !0 : "#TOTALS" === t ? l = !0 : "#DATA" === t ? r = !0 : "@" !== t && "#THIS ROW" !== t || (u = !0);
-				} else if (t === $.TableColumn) f(e);
-				else if (t === $.Infix && ":" === e.value) {
+				} else if (t === F.TableColumn) c(e);
+				else if (t === F.Infix && ":" === e.value) {
 					const t = e.inputs?.[0], n = e.inputs?.[1];
-					t?.type === $.TableColumn && (o = t.value), n?.type === $.TableColumn && (a = n.value);
-				} else if (t === $.Prefix && "@" === e.value) {
+					t?.type === F.TableColumn && (o = t.value), n?.type === F.TableColumn && (a = n.value);
+				} else if (t === F.Prefix && "@" === e.value) {
 					u = !0;
 					const t = e.inputs?.[0];
-					t?.type === $.Infix && ":" === t.value ? (t.inputs?.[0]?.type === $.TableColumn && (o = t.inputs[0].value), t.inputs?.[1]?.type === $.TableColumn && (a = t.inputs[1].value)) : f(t);
+					t?.type === F.Infix && ":" === t.value ? (t.inputs?.[0]?.type === F.TableColumn && (o = t.inputs[0].value), t.inputs?.[1]?.type === F.TableColumn && (a = t.inputs[1].value)) : c(t);
 				}
 			}
 			return {
 				tableId: t,
-				spec: c(i, s, r, l),
+				spec: p(i, s, r, l),
 				columnFromId: o,
 				columnToId: a,
 				isThisRow: u
@@ -477,16 +477,16 @@ function me(e) {
 	});
 }
 function ye(e) {
-	return O(e, (e) => {
-		if (e.type !== $.TableReference) return;
+	return v(e, (e) => {
+		if (e.type !== F.TableReference) return;
 		const t = e.inputs;
 		if (!t) return;
-		if (-1 === t.findIndex((e) => e.type === $.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim())) return;
+		if (-1 === t.findIndex((e) => e.type === F.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim())) return;
 		const n = [];
 		let r;
-		for (const e of t) e.type === $.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim() || (e.type !== $.TableColumn && (e.type !== $.Infix || ":" !== e.value) || r ? n.push(e) : r = e);
+		for (const e of t) e.type === F.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim() || (e.type !== F.TableColumn && (e.type !== F.Infix || ":" !== e.value) || r ? n.push(e) : r = e);
 		if (!r) return n.push({
-			type: $.Prefix,
+			type: F.Prefix,
 			value: "@",
 			inputs: null,
 			isReference: !0
@@ -498,15 +498,15 @@ function ye(e) {
 			...r,
 			image: i.slice(1, -1)
 		} : r;
-		return n.push(o("@", s, !0)), {
+		return n.push(L("@", s, !0)), {
 			...e,
 			inputs: n
 		};
 	});
 }
 function Ie(e) {
-	return O(e, (e) => {
-		if (e.type !== $.TableReference) return;
+	return v(e, (e) => {
+		if (e.type !== F.TableReference) return;
 		if (0 !== e.inputs?.length || e.error) return;
 		const t = e.value;
 		return ("string" == typeof t ? t : t?.tableId) ? {
@@ -516,8 +516,8 @@ function Ie(e) {
 	});
 }
 function be(e) {
-	return O(e, (e) => {
-		if (e.type !== $.TableReference || !e.inputs) return;
+	return v(e, (e) => {
+		if (e.type !== F.TableReference || !e.inputs) return;
 		const t = e.value, n = "string" == typeof t ? t : t?.tableId, r = e.image;
 		if (!n || 91 !== r?.charCodeAt(0)) return;
 		const i = r.indexOf("]");
@@ -527,7 +527,7 @@ function be(e) {
 	});
 }
 var xe = (e) => {
-	if (e?.type !== $.TableSpecifier) return 4;
+	if (e?.type !== F.TableSpecifier) return 4;
 	switch (e.value.toUpperCase().trim()) {
 		case "#ALL": return 0;
 		case "#HEADERS": return 1;
@@ -537,8 +537,8 @@ var xe = (e) => {
 	}
 };
 function Re(e) {
-	return O(e, (e) => {
-		if (e.type !== $.TableReference) return;
+	return v(e, (e) => {
+		if (e.type !== F.TableReference) return;
 		const t = e.inputs;
 		if (!t || t.length < 2) return;
 		const n = t.map((e, t) => ({
@@ -555,8 +555,8 @@ function Re(e) {
 function Ee(t) {
 	if (!t) return e.EmptyArray;
 	let n = e.EmptyArray;
-	return O(t, (t) => {
-		if (t.type !== $.Named || t.binding) return;
+	return v(t, (t) => {
+		if (t.type !== F.Named || t.binding) return;
 		const r = t.value.nameId;
 		r && (n === e.EmptyArray && (n = []), n.includes(r) || n.push(r));
 	}), n;
@@ -564,12 +564,12 @@ function Ee(t) {
 function Te(t, n) {
 	if (!t) return e.EmptyArray;
 	let r = e.EmptyArray;
-	return O(t, (t, i, s) => {
+	return v(t, (t, i, s) => {
 		if (!t.isReference) return;
 		if (i?.isReference) return;
 		const l = t.type;
-		if (l === $.Named || l === $.Error || l === $.TableReference) return;
-		if (pe(s, $.TableReference)) return;
+		if (l === F.Named || l === F.Error || l === F.TableReference) return;
+		if (pe(s, F.TableReference)) return;
 		const o = function(e) {
 			let t = e;
 			for (; t;) {
@@ -582,66 +582,69 @@ function Te(t, n) {
 			let r = e;
 			for (let e = t.length - 1; e >= 0; e--) {
 				const i = t[e];
-				if (i.type === $.Paren || i.isReference) {
+				if (i.type === F.Paren || i.isReference) {
 					r = i;
 					continue;
 				}
-				if (i.type !== $.Function) return !0;
+				if (i.type !== F.Function) return !0;
 				const s = n?.(String(i.value));
 				if (!s) return !0;
 				const l = i.inputs ? i.inputs.indexOf(r) : -1;
-				return "p" !== (l >= 0 ? Oe(s.getDeclaration().getParameters(), l) : null)?.getRangeType();
+				return "p" !== (l >= 0 ? Ve(s.getDeclaration().getParameters(), l) : null)?.getRangeType();
 			}
 			return !0;
 		}(t, s, n) && (r === e.EmptyArray && (r = []), r.includes(o) || r.push(o));
 	}), r.length > 1 && r.sort((e, t) => e - t), r;
 }
-var Ae = /* @__PURE__ */ new Set(["SUBTOTAL", "AGGREGATE"]);
-function Se(e, t) {
+var Ae = /* @__PURE__ */ new Set(["SUBTOTAL", "AGGREGATE"]), Se = /* @__PURE__ */ new Set(["GETPIVOTDATA"]);
+function we(e, t) {
+	return Ce(e, t, Ae);
+}
+function Ce(e, t, n) {
 	if (!e || !t) return !1;
-	let n = !1;
-	return O(e, (e) => {
-		if (n || e.type !== $.Function) return;
-		const r = t(e.value)?.getName();
-		r && Ae.has(r.toUpperCase()) && (n = !0);
-	}), n;
+	let r = !1;
+	return v(e, (e) => {
+		if (r || e.type !== F.Function) return;
+		const i = t(e.value)?.getName();
+		i && n.has(i.toUpperCase()) && (r = !0);
+	}), r;
 }
-function we(e, t) {
+function Ne(e, t) {
 	if (!e || !t) return !1;
 	let n = !1;
-	return O(e, (e) => {
-		n || e.type !== $.Function || "TABLE" === t(e.value)?.getName().toUpperCase() && (n = !0);
+	return v(e, (e) => {
+		n || e.type !== F.Function || "TABLE" === t(e.value)?.getName().toUpperCase() && (n = !0);
 	}), n;
 }
-function Ce(e, t) {
+function Fe(e, t) {
 	if (!e || !t) return !1;
 	let n = !1;
-	return O(e, (e) => {
-		n || e.type !== $.Function || !0 === t(e.value)?.getDeclaration().getReturnType()?.isVolatile() && (n = !0);
+	return v(e, (e) => {
+		n || e.type !== F.Function || !0 === t(e.value)?.getDeclaration().getReturnType()?.isVolatile() && (n = !0);
 	}), n;
 }
-var Ne = Object.freeze({
+var Pe = Object.freeze({
 	value: !1,
 	array: !1
-}), Fe = (e, t) => {
+}), Le = (e, t) => {
 	const n = function(e, t) {
-		if (!e || !t) return Ne;
+		if (!e || !t) return Pe;
 		let n = !1, r = !1;
-		return O(e, (e) => {
+		return v(e, (e) => {
 			if (n) return;
 			const i = e.type;
-			if (i === $.Named) return void (void 0 === e.binding && (n = !0));
-			if (i === $.Prefix) return void ("@" === e.value && (n = !0));
-			if (i === $.Call) return void (n = !0);
-			if (i !== $.Function) return;
+			if (i === F.Named) return void (void 0 === e.binding && (n = !0));
+			if (i === F.Prefix) return void ("@" === e.value && (n = !0));
+			if (i === F.Call) return void (n = !0);
+			if (i !== F.Function) return;
 			if (void 0 !== e.binder) return;
 			const s = t(e.value);
 			if (!s) return void (n = !0);
 			if (r || !0 !== e.implicitIntersect) return;
 			const l = s.getDeclaration().getParameters(), o = e.inputs;
 			if (o) for (let e = 0; e < o.length; e++) {
-				const n = Oe(l, e);
-				if (null !== n && n.isValueOrRange() && Me(o[e], t)) return void (r = !0);
+				const n = Ve(l, e);
+				if (null !== n && n.isValueOrRange() && Ue(o[e], t)) return void (r = !0);
 			}
 		}), {
 			value: !n && !r,
@@ -652,48 +655,48 @@ var Ne = Object.freeze({
 		isBlankCacheable: n.value,
 		isBlankCacheableArray: n.array
 	};
-}, Pe = (e, t) => {
+}, ke = (e, t) => {
 	const n = e.length;
 	if (0 === n) return null;
 	if (t < n - 1) return e[t];
 	const r = e[n - 1], i = r.getRepeatingTypes();
 	return i && 0 !== i.length ? i[(t - (n - 1)) % i.length] : t < n ? e[t] : r.isRest() ? r : null;
 };
-function Le(t) {
+function $e(t) {
 	if (!t) return e.EmptyArray;
 	let n = e.EmptyArray;
 	const r = (t) => {
 		t && (n === e.EmptyArray && (n = []), n.includes(t) || n.push(t));
 	}, i = (e) => {
-		"string" == typeof e && r(g(e)?.bookId);
+		"string" == typeof e && r(y(e)?.bookId);
 	};
-	return O(t, (e) => {
-		if (e.type === $.Named) {
+	return v(t, (e) => {
+		if (e.type === F.Named) {
 			if (e.binding) return;
 			const t = e.value;
 			r(t.nameId), i(t.scope);
-		} else if (e.type === $.TableReference) {
+		} else if (e.type === F.TableReference) {
 			const t = e.value;
 			r("string" == typeof t ? t : t?.tableId);
-		} else if (e.type === $.Cell) {
+		} else if (e.type === F.Cell) {
 			const t = e.value?.scope;
-			i(t), m(t) && r(t);
-		} else e.type === $.Error && i(e.value?.scope);
+			i(t), C(t) && r(t);
+		} else e.type === F.Error && i(e.value?.scope);
 	}), n;
 }
-var ke = (e, t) => {
+var Oe = (e, t) => {
 	if (!0 === e.lazyArg) return !0;
 	if ("lambda" !== t?.binder?.kind) return !1;
 	const n = t.inputs;
 	return n[n.length - 1] === e;
-}, $e = /* @__PURE__ */ new Set([
+}, Be = /* @__PURE__ */ new Set([
 	"IF",
 	"IFS",
 	"SWITCH",
 	"CHOOSE",
 	"IFERROR",
 	"IFNA"
-]), Oe = (e, t) => {
+]), Ve = (e, t) => {
 	const n = e.length;
 	if (0 === n) return null;
 	if (t < n) return e[t];
@@ -701,24 +704,24 @@ var ke = (e, t) => {
 	if (!r.isRest()) return null;
 	const i = r.getRepeatingTypes();
 	return i && 0 !== i.length ? i[(t - (n - 1)) % i.length] : r;
-}, Be = (e) => null !== e.getScalarType() && null === e.getRangeType() && null === e.getLambda() && !e.isValueOrRange(), Ve = (e, t, n) => !(e.isRest() || !Be(e) || !Me(t, n) || e.isNoLift() && ze(t, n)), ze = (e, t) => {
+}, ze = (e) => null !== e.getScalarType() && null === e.getRangeType() && null === e.getLambda() && !e.isValueOrRange(), De = (e, t, n) => !(e.isRest() || !ze(e) || !Ue(t, n) || e.isNoLift() && Me(t, n)), Me = (e, t) => {
 	if (!e) return !1;
 	const n = e.inputs;
 	switch (e.type) {
-		case $.Cell:
-		case $.Named:
-		case $.TableReference: return !0;
-		case $.Infix:
-		case $.Prefix:
-		case $.Postfix: return !0 === e.isReference && "@" !== e.value;
-		case $.Paren:
-		case $.List: return !!n && 1 === n.length && ze(n[0], t);
-		case $.Function: {
+		case F.Cell:
+		case F.Named:
+		case F.TableReference: return !0;
+		case F.Infix:
+		case F.Prefix:
+		case F.Postfix: return !0 === e.isReference && "@" !== e.value;
+		case F.Paren:
+		case F.List: return !!n && 1 === n.length && Me(n[0], t);
+		case F.Function: {
 			if (void 0 !== e.binder) return !1;
 			const i = String(e.value).toUpperCase();
-			if ($e.has(i)) {
+			if (Be.has(i)) {
 				if (!n) return !1;
-				for (let e = 0; e < n.length; e++) if (ze(n[e], t)) return !0;
+				for (let e = 0; e < n.length; e++) if (Me(n[e], t)) return !0;
 				return !1;
 			}
 			const s = t?.(e.value);
@@ -726,54 +729,54 @@ var ke = (e, t) => {
 		}
 		default: return !1;
 	}
-}, De = (e, t) => {
+}, We = (e, t) => {
 	if (!e) return !1;
-	for (let n = 0; n < e.length; n++) if (Me(e[n], t)) return !0;
+	for (let n = 0; n < e.length; n++) if (Ue(e[n], t)) return !0;
 	return !1;
 };
-function Me(e, t) {
+function Ue(e, t) {
 	if (!e) return !1;
 	if (void 0 !== e.arrayValued) return e.arrayValued;
 	let n;
 	const i = e.type, s = e.inputs;
 	switch (i) {
-		case $.Array:
+		case F.Array:
 			n = !0;
 			break;
-		case $.Cell: {
+		case F.Cell: {
 			const t = e.value;
 			n = t.rowIndex === Number.MIN_SAFE_INTEGER || t.colIndex === Number.MIN_SAFE_INTEGER;
 			break;
 		}
-		case $.Named:
-		case $.Call:
-		case $.TableReference:
+		case F.Named:
+		case F.Call:
+		case F.TableReference:
 			n = !0;
 			break;
-		case $.Infix:
-		case $.Prefix:
-		case $.Postfix:
-			n = e.isReference ? "@" !== e.value : De(s, t);
+		case F.Infix:
+		case F.Prefix:
+		case F.Postfix:
+			n = e.isReference ? "@" !== e.value : We(s, t);
 			break;
-		case $.Paren:
-		case $.List:
-			n = !s || 1 !== s.length || Me(s[0], t);
+		case F.Paren:
+		case F.List:
+			n = !s || 1 !== s.length || Ue(s[0], t);
 			break;
-		case $.Function: {
+		case F.Function: {
 			const i = e.binder;
 			if (void 0 !== i) {
-				n = "lambda" === i.kind || !!s && Me(s[s.length - 1], t);
+				n = "lambda" === i.kind || !!s && Ue(s[s.length - 1], t);
 				break;
 			}
 			const l = String(e.value).toUpperCase();
-			if ($e.has(l)) {
-				n = De(s, t);
+			if (Be.has(l)) {
+				n = We(s, t);
 				break;
 			}
 			if ("INDEX" === l) {
 				if (n = !1, s) for (let e = 1; e < s.length; e++) {
 					const r = s[e];
-					if (!r || r.type === $.Empty || r.isLiteral && 0 === r.value || Me(r, t)) {
+					if (!r || r.type === F.Empty || r.isLiteral && 0 === r.value || Ue(r, t)) {
 						n = !0;
 						break;
 					}
@@ -793,7 +796,7 @@ function Me(e, t) {
 	}
 	return e.arrayValued = n, n;
 }
-function We(e, t) {
+function _e(e, t) {
 	if (void 0 !== e.firstCell) return;
 	const n = (e, r) => {
 		if (!e) return;
@@ -801,17 +804,17 @@ function We(e, t) {
 		const i = e.inputs;
 		if (!i) return;
 		const s = e.type;
-		if (s === $.Infix || s === $.Prefix || s === $.Postfix) {
+		if (s === F.Infix || s === F.Prefix || s === F.Postfix) {
 			const t = r && !e.isReference;
 			for (let e = 0; e < i.length; e++) n(i[e], t);
 			return;
 		}
-		if (s === $.Paren || s === $.List) {
+		if (s === F.Paren || s === F.List) {
 			const e = r && 1 === i.length;
 			for (let t = 0; t < i.length; t++) n(i[t], e);
 			return;
 		}
-		if (s === $.Function) {
+		if (s === F.Function) {
 			const s = e.binder;
 			if (void 0 !== s) {
 				const e = i.length - 1;
@@ -820,8 +823,8 @@ function We(e, t) {
 			}
 			const l = r ? t?.(e.value)?.getDeclaration().getParameters() : null;
 			for (let e = 0; e < i.length; e++) {
-				const t = l ? Oe(l, e) : null;
-				n(i[e], null !== t && (Be(t) || Ge(t)));
+				const t = l ? Ve(l, e) : null;
+				n(i[e], null !== t && (ze(t) || Xe(t)));
 			}
 			return;
 		}
@@ -829,35 +832,35 @@ function We(e, t) {
 	};
 	n(e, !0);
 }
-var Ue = /* @__PURE__ */ new Set([
+var je = /* @__PURE__ */ new Set([
 	"=",
 	"<>",
 	"<",
 	">",
 	"<=",
 	">="
-]), _e = /* @__PURE__ */ new Set(["ROW", "COLUMN"]);
-function je(e, t) {
+]), Ge = /* @__PURE__ */ new Set(["ROW", "COLUMN"]);
+function He(e, t) {
 	if (!e || !t) return null;
 	const n = (e) => t(e.value)?.getName().toUpperCase() ?? null;
 	let r = !1;
-	if (O(e, (e) => {
-		(e.hasLazyArgs || e.type === $.Call || void 0 !== e.binder) && (r = !0);
+	if (v(e, (e) => {
+		(e.hasLazyArgs || e.type === F.Call || void 0 !== e.binder) && (r = !0);
 	}), r) return null;
-	const i = (e) => e.type === $.Number, s = (e) => e.type === $.Number || e.type === $.String || e.type === $.Boolean, l = (e) => {
+	const i = (e) => e.type === F.Number, s = (e) => e.type === F.Number || e.type === F.String || e.type === F.Boolean, l = (e) => {
 		if (!e) return !1;
 		const t = e.inputs;
 		switch (e.type) {
-			case $.Paren: return 1 === t?.length && l(t[0]);
-			case $.Prefix: return ("-" === e.value || "+" === e.value) && l(t?.[0]);
-			case $.Infix: {
+			case F.Paren: return 1 === t?.length && l(t[0]);
+			case F.Prefix: return ("-" === e.value || "+" === e.value) && l(t?.[0]);
+			case F.Infix: {
 				if ("+" !== e.value && "-" !== e.value && "*" !== e.value) return !1;
 				const [n, r] = t ?? [];
 				return !(!n || !r) && (l(n) && (l(r) || i(r)) || i(n) && l(r));
 			}
-			case $.Function: {
+			case F.Function: {
 				const r = n(e);
-				if (null !== r && _e.has(r)) return !t || 0 === t.length || 1 === t.length && t[0]?.type === $.Cell;
+				if (null !== r && Ge.has(r)) return !t || 0 === t.length || 1 === t.length && t[0]?.type === F.Cell;
 				if ("MOD" === r && 2 === t?.length) {
 					const e = t[1];
 					return l(t[0]) && i(e) && 0 !== e.value;
@@ -870,13 +873,13 @@ function je(e, t) {
 		if (!e) return !1;
 		const t = e.inputs;
 		switch (e.type) {
-			case $.Paren: return 1 === t?.length && o(t[0]);
-			case $.Infix: {
-				if (!Ue.has(e.value)) return !1;
+			case F.Paren: return 1 === t?.length && o(t[0]);
+			case F.Infix: {
+				if (!je.has(e.value)) return !1;
 				const [n, r] = t ?? [];
 				return !(!n || !r) && (l(n) && (l(r) || s(r)) || s(n) && l(r));
 			}
-			case $.Function: {
+			case F.Function: {
 				const r = n(e);
 				if (!t || 0 === t.length) return !1;
 				if ("ISODD" === r || "ISEVEN" === r) return 1 === t.length && l(t[0]);
@@ -886,7 +889,7 @@ function je(e, t) {
 					for (let n = 0; n < t.length; n++) {
 						const r = t[n];
 						if (!r) return !1;
-						if (r.type !== $.Boolean) {
+						if (r.type !== F.Boolean) {
 							if (!o(r)) return !1;
 							e = !0;
 						}
@@ -910,7 +913,7 @@ function je(e, t) {
 	for (let t = 0; t < 1 << c; t++) {
 		const n = (e) => {
 			const r = a.indexOf(e);
-			if (-1 !== r) return N(t & 1 << r ? "TRUE" : "FALSE");
+			if (-1 !== r) return I(t & 1 << r ? "TRUE" : "FALSE");
 			const i = { ...e };
 			return delete i.evalIndex, delete i.firstCell, delete i.inLazy, delete i.lazyArg, delete i.hasLazyArgs, delete i.deferred, e.inputs && (i.inputs = e.inputs.map((e) => e ? n(e) : e)), i;
 		};
@@ -918,10 +921,10 @@ function je(e, t) {
 	}
 	return f;
 }
-var Ge = (e) => "*" === e.getRangeType() && null === e.getLambda() && e.getArrayDepth() <= (e.isRest() ? 1 : 0);
-function He(e, n, r, i = !1, s = null, l = null) {
-	let o, a, u = r;
-	u = me(u), i || (u = ye(u), u = Re(u), u = Ie(u), u = be(u)), [o, a] = function(e) {
+var Xe = (e) => "*" === e.getRangeType() && null === e.getLambda() && e.getArrayDepth() <= (e.isRest() ? 1 : 0);
+function Ke(e, n, r, i = !1, s = null, l = null) {
+	let a, u, c = r;
+	c = me(c), i || (c = ye(c), c = Re(c), c = Ie(c), c = be(c)), [a, u] = function(e) {
 		const t = /* @__PURE__ */ new Map();
 		let n = 0;
 		const r = [e];
@@ -935,67 +938,67 @@ function He(e, n, r, i = !1, s = null, l = null) {
 		return t.forEach((e, n) => {
 			n && n.inputs && (e.inputs = n.inputs.map((e) => t.get(e) ?? e));
 		}), [t.get(e), n];
-	}(u);
-	const c = p(a), f = [], d = [], g = new de();
-	let h, m = !1;
+	}(c);
+	const f = o(u), p = [], d = [], h = new de();
+	let m, y = !1;
 	(function(e, t) {
 		if (!e || !t) return;
 		const n = (e) => {
 			if (!e) return;
-			e.inLazy = !0, e.type === $.Named && (e.deferredResolve = !0);
+			e.inLazy = !0, e.type === F.Named && (e.deferredResolve = !0);
 			const t = e.inputs;
 			if (t) for (let e = 0; e < t.length; e++) n(t[e]);
 		};
-		O(e, (e) => {
-			if (e.type !== $.Function) return;
+		v(e, (e) => {
+			if (e.type !== F.Function) return;
 			if (void 0 !== e.binder) return;
 			const r = e.inputs;
 			if (!r || 0 === r.length) return;
 			const i = t(e.value)?.getDeclaration().getParameters();
 			if (i) for (let t = 0; t < r.length; t++) {
 				const s = r[t];
-				s && s.type !== $.Empty && Pe(i, t)?.isLazy() && (s.lazyArg = !0, e.hasLazyArgs = !0, n(s));
+				s && s.type !== F.Empty && ke(i, t)?.isLazy() && (s.lazyArg = !0, e.hasLazyArgs = !0, n(s));
 			}
 		});
-	})(o, l);
-	const y = (e) => {
-		void 0 === h && (h = /* @__PURE__ */ new Map());
-		let t = h.get(e);
-		return void 0 === t && h.set(e, t = []), t;
-	}, I = (e, t) => {
-		void 0 === e ? f.push(t) : y(e).push(t);
-	}, b = (e) => {
-		e?.type !== $.Infix || "+" !== e.value && "-" !== e.value || (e.snapsCancellation = !0);
+	})(a, l);
+	const I = (e) => {
+		void 0 === m && (m = /* @__PURE__ */ new Map());
+		let t = m.get(e);
+		return void 0 === t && m.set(e, t = []), t;
+	}, x = (e, t) => {
+		void 0 === e ? p.push(t) : I(e).push(t);
+	}, R = (e) => {
+		e?.type !== F.Infix || "+" !== e.value && "-" !== e.value || (e.snapsCancellation = !0);
 	};
-	o = O(o, (t, n, r) => {
+	a = v(a, (t, n, r) => {
 		const i = t.type, s = t.evalIndex;
-		if (c[s] = null, i === $.TableColumn || i === $.TableSpecifier || t.isReference && pe(r, $.TableReference)) return;
-		if (m = m || !Qe(t), t.binding?.declaration) return d[t.binding.slot] = -1, void (c[s] = void 0);
+		if (f[s] = null, i === F.TableColumn || i === F.TableSpecifier || t.isReference && pe(r, F.TableReference)) return;
+		if (y = y || !tt(t), t.binding?.declaration) return d[t.binding.slot] = -1, void (f[s] = void 0);
 		const l = ((e, t, n) => {
-			if (ke(e, t)) return e;
-			for (let e = n.length - 1; e >= 0; e--) if (ke(n[e], n[e - 1])) return n[e];
+			if (Oe(e, t)) return e;
+			for (let e = n.length - 1; e >= 0; e--) if (Oe(n[e], n[e - 1])) return n[e];
 		})(t, n, r);
-		l === t && y(t), void 0 !== l && i === $.Named && (t.deferredResolve = !0);
-		const o = t.binder;
-		if (o && "let" === o.kind) {
+		l === t && I(t), void 0 !== l && i === F.Named && (t.deferredResolve = !0);
+		const a = t.binder;
+		if (a && "let" === a.kind) {
 			const e = t.inputs, n = e?.length ?? 0;
 			let r = 0;
-			for (let t = 0; t + 1 < n && r < o.slots.length; t += 2) e[t]?.binding?.declaration && (d[o.slots[r++]] = e[t + 1]?.evalIndex ?? -1);
+			for (let t = 0; t + 1 < n && r < a.slots.length; t += 2) e[t]?.binding?.declaration && (d[a.slots[r++]] = e[t + 1]?.evalIndex ?? -1);
 		}
-		if ((t.isReference || n && n.isReference) && (g.processNode(t, n), t.isReference)) {
-			if (i === $.Named) return void (void 0 !== l && I(l, t));
-			if (i === $.Cell || i === $.TableReference || i === $.Error) return;
-			if (i === $.Infix || i === $.Prefix || i === $.Postfix || i === $.List) return void I(l, t);
+		if ((t.isReference || n && n.isReference) && (h.processNode(t, n), t.isReference)) {
+			if (i === F.Named) return void (void 0 !== l && x(l, t));
+			if (i === F.Cell || i === F.TableReference || i === F.Error) return;
+			if (i === F.Infix || i === F.Prefix || i === F.Postfix || i === F.List) return void x(l, t);
 		}
-		if (t.isLiteral) if (i !== $.Array) c[s] = t.value;
+		if (t.isLiteral) if (i !== F.Array) f[s] = t.value;
 		else {
-			const n = t.value, r = n.length, i = p(r);
+			const n = t.value, r = n.length, i = o(r);
 			for (let e = 0; e < r; e++) {
-				const t = n[e].value, r = t.length, s = p(r);
+				const t = n[e].value, r = t.length, s = o(r);
 				for (let e = 0; e < r; e++) {
 					const n = t[e];
 					let r = null;
-					if (n && (r = n.type === $.Error ? x(n.value) : n.value, n.type === $.Prefix)) {
+					if (n && (r = n.type === F.Error ? N(n.value) : n.value, n.type === F.Prefix)) {
 						const e = n.value;
 						r = n.inputs[0].value, "-" === e && (r = -r);
 					}
@@ -1003,18 +1006,18 @@ function He(e, n, r, i = !1, s = null, l = null) {
 				}
 				i[e] = s;
 			}
-			const l = S(i);
-			c[s] = new k(e, l.values, l.coords, void 0, l.isLiteral);
+			const l = g(i);
+			f[s] = new V(e, l.values, l.coords, void 0, l.isLiteral);
 		}
 		else {
-			if (i !== $.Empty) return "lambda" === t.binder?.kind && b(t.inputs[t.inputs.length - 1]), I(l, t), t;
-			c[s] = void 0;
+			if (i !== F.Empty) return "lambda" === t.binder?.kind && R(t.inputs[t.inputs.length - 1]), x(l, t), t;
+			f[s] = void 0;
 		}
-	}), b(o), h?.forEach((e, t) => {
+	}), R(a), m?.forEach((e, t) => {
 		t.deferred = e;
 	});
-	const R = p(g.cells.size);
-	g.cells.forEach((e, t) => {
+	const T = o(h.cells.size);
+	h.cells.forEach((e, t) => {
 		const n = t.value, r = n.colIndex, i = n.rowIndex, s = n.$colIndex, l = n.$rowIndex, o = {
 			colStart: r,
 			rowStart: i,
@@ -1025,47 +1028,47 @@ function He(e, n, r, i = !1, s = null, l = null) {
 			$colEnd: s,
 			$rowEnd: l
 		};
-		r === Number.MIN_SAFE_INTEGER && (o.colEnd = Number.MAX_SAFE_INTEGER), i === Number.MIN_SAFE_INTEGER && (o.rowEnd = Number.MAX_SAFE_INTEGER), n.scope && (o.scope = n.scope), R[e] = o;
+		r === Number.MIN_SAFE_INTEGER && (o.colEnd = Number.MAX_SAFE_INTEGER), i === Number.MIN_SAFE_INTEGER && (o.rowEnd = Number.MAX_SAFE_INTEGER), n.scope && (o.scope = n.scope), T[e] = o;
 	});
-	const E = R.length, A = p(E);
-	for (let e = 0; e < E; e++) A[e] = {
+	const A = T.length, S = o(A);
+	for (let e = 0; e < A; e++) S[e] = {
 		colStart: 0,
 		rowStart: 0,
 		colEnd: 0,
 		rowEnd: 0,
 		scope: null
 	};
-	const w = p(g.references.size);
-	g.references.forEach((e) => {
+	const w = o(h.references.size);
+	h.references.forEach((e) => {
 		w[e.index] = e;
 	});
 	const C = [];
-	g.rootReferences.forEach((e) => {
+	h.rootReferences.forEach((e) => {
 		C.push(e.index);
 	}), function(e, t, n = !1) {
 		if (n) {
 			const t = (e) => {
 				if (!e) return;
 				const n = e.type;
-				n !== $.Function && n !== $.Call || (e.implicitIntersect = !0);
+				n !== F.Function && n !== F.Call || (e.implicitIntersect = !0);
 				const r = e.inputs;
 				if (r) for (let e = 0; e < r.length; e++) t(r[e]);
 			};
 			t(e);
 			return;
 		}
-		const r = (e) => Me(e, t), i = (e, n) => {
+		const r = (e) => Ue(e, t), i = (e, n) => {
 			if (!e) return;
 			const s = e.type;
-			s !== $.Function && s !== $.Call || (e.implicitIntersect = n);
+			s !== F.Function && s !== F.Call || (e.implicitIntersect = n);
 			const l = e.inputs;
 			if (l) {
-				if (s === $.Infix || s === $.Prefix || s === $.Postfix) {
+				if (s === F.Infix || s === F.Prefix || s === F.Postfix) {
 					const t = !e.isReference;
 					for (let e = 0; e < l.length; e++) i(l[e], (!t || !r(l[e])) && n);
 					return;
 				}
-				if (s === $.Function) {
+				if (s === F.Function) {
 					const r = e.binder;
 					if (void 0 !== r) {
 						const e = "lambda" !== r.kind && n;
@@ -1077,8 +1080,8 @@ function He(e, n, r, i = !1, s = null, l = null) {
 					if (s) for (let e = 0; e < l.length && !o; e++) {
 						const n = l[e];
 						if (!n) continue;
-						const r = Oe(s, e);
-						r && Ve(r, n, t) && (o = !0);
+						const r = Ve(s, e);
+						r && De(r, n, t) && (o = !0);
 					}
 					o && (e.implicitIntersect = !1);
 					for (let e = 0; e < l.length; e++) i(l[e], !o && n);
@@ -1088,53 +1091,54 @@ function He(e, n, r, i = !1, s = null, l = null) {
 			}
 		};
 		i(e, !r(e));
-	}(o, l, !0 === r.legacyIntersect);
-	const N = (e) => {
+	}(a, l, !0 === r.legacyIntersect);
+	const P = (e) => {
 		const t = e.length;
 		for (let n = 0; n < t; n++) {
 			const t = e[n], r = t.type;
-			if (r === $.Infix) {
+			if (r === F.Infix) {
 				if (!0 === t.snapsCancellation) {
 					t.fn = ue[t.value];
 					continue;
 				}
 				t.fn = ae[t.value];
-			} else r === $.Prefix ? t.fn = ce[t.value] : r === $.Postfix && (t.fn = fe[t.value]);
+			} else r === F.Prefix ? t.fn = ce[t.value] : r === F.Postfix && (t.fn = fe[t.value]);
 		}
 	};
-	let F;
-	N(f), h?.forEach(N);
-	const P = i ? v(t(e.getLocale()).decimal) : T, L = {
+	let L;
+	P(p), m?.forEach(P);
+	const k = i ? E(t(e.getLocale()).decimal) : b, $ = {
 		runtime: e,
 		symbols: n,
 		getFunction: l,
-		ast: o,
-		evaluations: c,
-		executions: f,
+		ast: a,
+		evaluations: f,
+		executions: p,
 		bindings: d,
-		referencesAbsolute: A,
+		referencesAbsolute: S,
 		referencesExecute: w,
-		referencesRelative: R,
+		referencesRelative: T,
 		referencesRoot: C,
-		referenceIndices: g.referenceIndices,
-		formatReferenceIndices: Te(o, l),
-		getTokens: () => F ??= ge(o, i, P),
-		namedIds: Ee(o),
-		symbolIds: Le(o),
-		hasTotals: Se(o, l),
-		hasDataTable: we(o, l),
-		hasVolatile: Ce(o, l),
-		...Fe(o, l),
-		isReferenceOnly: !m,
+		referenceIndices: h.referenceIndices,
+		formatReferenceIndices: Te(a, l),
+		getTokens: () => L ??= ge(a, i, k),
+		namedIds: Ee(a),
+		symbolIds: $e(a),
+		hasTotals: we(a, l),
+		hasPivotData: Ce(a, l, Se),
+		hasDataTable: Ne(a, l),
+		hasVolatile: Fe(a, l),
+		...Le(a, l),
+		isReferenceOnly: !y,
 		error: s,
 		transform: (t) => {
-			let r = O(o, t);
-			return r === o ? L : He(e, n, r, i, s, l);
+			let r = v(a, t);
+			return r === a ? $ : Ke(e, n, r, i, s, l);
 		}
 	};
-	return L;
+	return $;
 }
-function Xe(e) {
+function Ze(e) {
 	let t = -1, n = -1;
 	return Number.isSafeInteger(e.previousToken?.startLine) ? (t = e.previousToken.startLine, n = e.previousToken.endColumn + 1) : Number.isSafeInteger(e.token?.startLine) && (t = e.token.startLine, n = e.token.startColumn), -1 !== t ? (e.errorLocation = {
 		line: t,
@@ -1165,29 +1169,29 @@ Object.freeze([
 		">="
 	]
 ]);
-var Ke = Object.freeze([
+var qe = Object.freeze([
 	":",
 	".:.",
 	".:",
 	":."
-]), Ze = Object.freeze([
+]), Je = Object.freeze([
 	":",
 	" ",
 	".:.",
 	".:",
 	":."
-]), qe = Object.freeze(["@"]), Ye = Object.freeze(["#"]), Je = Object.freeze(Ze.concat(Ye)), Qe = (Object.freeze(Ze.concat(qe).concat(Ye)), (e) => {
+]), Qe = Object.freeze(["@"]), Ye = Object.freeze(["#"]), et = Object.freeze(Je.concat(Ye)), tt = (Object.freeze(Je.concat(Qe).concat(Ye)), (e) => {
 	if (!e) return !1;
 	const t = e.type;
-	if (t === $.Cell) return !0;
-	if (t === $.TableReference) return !0;
-	if (t === $.Infix) {
-		if (!Ze.includes(e.value)) return !1;
+	if (t === F.Cell) return !0;
+	if (t === F.TableReference) return !0;
+	if (t === F.Infix) {
+		if (!Je.includes(e.value)) return !1;
 		const t = e.inputs, n = t[0], r = t[1];
-		return Qe(n) && Qe(r);
+		return tt(n) && tt(r);
 	}
-	return t === $.List && (e.inputs?.every(Qe) ?? !1);
-}), et = (e) => !!(e && (e.type === $.Infix && Je.includes(e.value) || e.type === $.Postfix && Ye.includes(e.value) || e.type === $.Array || e.type === $.TableReference)), tt = Object.freeze([
+	return t === F.List && (e.inputs?.every(tt) ?? !1);
+}), nt = (e) => !!(e && (e.type === F.Infix && et.includes(e.value) || e.type === F.Postfix && Ye.includes(e.value) || e.type === F.Array || e.type === F.TableReference)), rt = Object.freeze([
 	"+",
 	"-",
 	"*",
@@ -1200,18 +1204,18 @@ var Ke = Object.freeze([
 	"<",
 	">=",
 	"<="
-]), nt = Object.freeze(["-", "+"]), rt = (e, t) => {
+]), it = Object.freeze(["-", "+"]), st = (e, t) => {
 	if (!e) return !1;
 	const n = e.type;
-	if (e.isLiteral) return n !== $.Error;
-	if (n === $.Paren || n === $.List) {
+	if (e.isLiteral) return n !== F.Error;
+	if (n === F.Paren || n === F.List) {
 		const n = e.inputs;
-		return !(!n || 0 === n.length) && n.every((e) => rt(e, t));
+		return !(!n || 0 === n.length) && n.every((e) => st(e, t));
 	}
-	if (n === $.Infix) return tt.includes(e.value);
-	if (n === $.Prefix) return nt.includes(e.value);
-	if (n === $.Postfix) return "%" === e.value;
-	if (n === $.Function) {
+	if (n === F.Infix) return rt.includes(e.value);
+	if (n === F.Prefix) return it.includes(e.value);
+	if (n === F.Postfix) return "%" === e.value;
+	if (n === F.Function) {
 		if (!t) return !1;
 		const n = t(e.value);
 		if (!n) return !1;
@@ -1219,37 +1223,37 @@ var Ke = Object.freeze([
 		return "p" !== i && (null !== i || null === r.getLambda() && null != r.getScalarType());
 	}
 	return !1;
-}, it = (e, t) => {
+}, lt = (e, t) => {
 	if (!e) return null;
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === $.Infix && " " === e.value) {
+		if (e.type === F.Infix && " " === e.value) {
 			const r = e.inputs, i = r?.[0], s = r?.[1];
-			if (rt(i, t)) return void (n = i);
-			if (rt(s, t)) return void (n = s);
+			if (st(i, t)) return void (n = i);
+			if (st(s, t)) return void (n = s);
 		}
 		const i = e.inputs;
 		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
 	};
 	return r(e), n;
-}, st = (e, t) => {
+}, ot = (e, t) => {
 	if (!e) return null;
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === $.Postfix && "#" === e.value) {
+		if (e.type === F.Postfix && "#" === e.value) {
 			const r = e.inputs?.[0];
-			if (r && rt(r, t)) return void (n = r);
+			if (r && st(r, t)) return void (n = r);
 		}
 		const i = e.inputs;
 		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
 	};
 	return r(e), n;
-}, lt = (e) => {
+}, at = (e) => {
 	for (let t = 0; t < e.length; t++) if (e[t].getRepeatingTypes()) return t;
 	return -1;
-}, ot = (e, t, n) => {
+}, ut = (e, t, n) => {
 	const r = e[t].getRepeatingTypes(), i = r.length, s = t, l = e.length - t - 1;
 	let o = l;
 	for (; o > 0 && e[t + o].isOptional();) o--;
@@ -1274,12 +1278,12 @@ var Ke = Object.freeze([
 		};
 	}
 	return null;
-}, at = (e) => {
+}, ct = (e) => {
 	if (!e) return null;
 	let t = null;
 	const n = (e) => {
 		if (t || !e) return;
-		if (e.type === $.Array && Array.isArray(e.value)) {
+		if (e.type === F.Array && Array.isArray(e.value)) {
 			const n = e.value, r = (n[0]?.value)?.length ?? 0;
 			for (let e = 1; e < n.length && !t; e++) {
 				const i = (n[e]?.value)?.length ?? 0;
@@ -1290,19 +1294,19 @@ var Ke = Object.freeze([
 		if (r) for (let e = 0; e < r.length && !t; e++) n(r[e]);
 	};
 	return n(e), t;
-}, ut = (e, t) => {
+}, ft = (e, t) => {
 	if (!e || !t) return null;
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === $.Function) {
+		if (e.type === F.Function) {
 			const r = e.value, i = t(r);
 			if (i) {
 				const t = i.getDeclaration(), s = t.getParameters(), l = e.inputs?.length ?? 0, o = t.getMaxArguments();
 				if (l > o) return void (n = `Too many arguments for ${r}. The most it accepts is ${o}, but got ${l}.`);
-				const a = s.length > 0 ? lt(s) : -1, u = s.length > 0 && s[s.length - 1].isRest();
+				const a = s.length > 0 ? at(s) : -1, u = s.length > 0 && s[s.length - 1].isRest();
 				if (a >= 0) {
-					if (!ot(s, a, l)) {
+					if (!ut(s, a, l)) {
 						const e = s[a].getRepeatingTypes().length, t = s.length - 1;
 						n = 1 === e ? `Too few arguments for ${r}. Expected at least ${t + 1}, but got ${l}.` : `Wrong number of arguments for ${r}. Expected ${t} plus a multiple of ${e}, but got ${l}.`;
 					}
@@ -1317,24 +1321,24 @@ var Ke = Object.freeze([
 		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
 	};
 	return r(e), n;
-}, ct = (e, t) => {
+}, pt = (e, t) => {
 	if (!e || !t) return null;
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === $.Function) {
+		if (e.type === F.Function) {
 			const r = t(e.value);
 			if (r) {
 				const i = r.getDeclaration().getParameters(), s = e.inputs;
 				if (i.length > 0 && s) {
 					const e = ((e, t) => {
-						const n = new Array(t), r = e.length, i = r > 0 ? lt(e) : -1;
+						const n = new Array(t), r = e.length, i = r > 0 ? at(e) : -1;
 						if (i < 0) {
 							const i = r > 0 ? e[r - 1] : null, s = !!i && i.isRest();
 							for (let l = 0; l < t; l++) n[l] = l < r ? e[l] : s ? i : null;
 							return n;
 						}
-						const s = e[i].getRepeatingTypes(), l = s.length, o = i, a = ot(e, i, t), u = a ? a.suffix : r - i - 1, c = Math.max(0, t - o - u);
+						const s = e[i].getRepeatingTypes(), l = s.length, o = i, a = ut(e, i, t), u = a ? a.suffix : r - i - 1, c = Math.max(0, t - o - u);
 						for (let a = 0; a < t; a++) if (a < o) n[a] = e[a];
 						else if (a < o + c) n[a] = s[(a - o) % l];
 						else {
@@ -1345,7 +1349,7 @@ var Ke = Object.freeze([
 					})(i, s.length);
 					for (let r = 0; r < s.length && !n; r++) {
 						const i = e[r];
-						i && "p" === i.getRangeType() && rt(s[r], t) && (n = s[r]);
+						i && "p" === i.getRangeType() && st(s[r], t) && (n = s[r]);
 					}
 				}
 			}
@@ -1354,42 +1358,42 @@ var Ke = Object.freeze([
 		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
 	};
 	return r(e), n;
-}, ft = (e, t) => {
+}, dt = (e, t) => {
 	if (!e) return null;
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === $.Call) {
+		if (e.type === F.Call) {
 			const r = e.inputs?.[0];
-			if (r && rt(r, t)) return void (n = "This expression always produces a value, so it cannot be called as a function.");
+			if (r && st(r, t)) return void (n = "This expression always produces a value, so it cannot be called as a function.");
 		}
 		const i = e.inputs;
 		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
 	};
 	return r(e), n;
-}, pt = (e, t) => {
-	if (e.type !== $.Function) return;
+}, gt = (e, t) => {
+	if (e.type !== F.Function) return;
 	const n = e.value;
 	if ("string" != typeof n) return;
 	const r = (t?.(n)?.getName() ?? n).toUpperCase();
 	return "LET" === r ? "let" : "LAMBDA" === r ? "lambda" : void 0;
-}, dt = (e) => {
-	if (e?.type !== $.Named) return;
+}, vt = (e) => {
+	if (e?.type !== F.Named) return;
 	const t = e.value;
 	return t?.nameId && !t.scope && !0 !== t.optional ? t.nameId : void 0;
-}, gt = /^[A-Za-z_\\][A-Za-z0-9_\\]*$/, vt = /* @__PURE__ */ new Set(["TRUE", "FALSE"]), ht = (e) => {
-	if (e?.type === $.Named) {
+}, ht = /^[A-Za-z_\\][A-Za-z0-9_\\]*$/, mt = /* @__PURE__ */ new Set(["TRUE", "FALSE"]), yt = (e) => {
+	if (e?.type === F.Named) {
 		const t = e.value;
 		if (!0 !== t?.optional || !t.nameId || t.scope) return;
 		return t.nameId;
 	}
-	if (e?.type !== $.TableReference) return;
+	if (e?.type !== F.TableReference) return;
 	const t = e.value;
 	let n;
 	if (null === t || "string" == typeof t) {
 		if (t) return;
 		const r = e.inputs;
-		if (!r || 1 !== r.length || r[0]?.type !== $.TableColumn) return;
+		if (!r || 1 !== r.length || r[0]?.type !== F.TableColumn) return;
 		const i = r[0].value;
 		if ("string" != typeof i) return;
 		n = i;
@@ -1399,29 +1403,29 @@ var Ke = Object.freeze([
 		if (!e.columnFromId || e.columnFromId !== e.columnToId) return;
 		n = e.columnFromId;
 	}
-	return gt.test(n) && !vt.has(n.toUpperCase()) && e.image === `[${n}]` ? n : void 0;
-}, mt = (e) => {
-	const t = u(e.image ?? e.value);
+	return ht.test(n) && !mt.has(n.toUpperCase()) && e.image === `[${n}]` ? n : void 0;
+}, It = (e) => {
+	const t = O(e.image ?? e.value);
 	t.image = e.image ?? e.value, t.wsBefore = e.wsBefore;
 	const n = {
-		type: $.Call,
+		type: F.Call,
 		value: null,
 		inputs: [t, ...e.inputs ?? []],
 		wsAfter: e.wsAfter
 	};
 	return e.error && (n.error = e.error), n;
 };
-function yt(e, t) {
-	return e && t ? O(e, (e) => {
-		if (e.type === $.Function && "string" == typeof e.value && !t(e.value)) return mt(e);
+function bt(e, t) {
+	return e && t ? v(e, (e) => {
+		if (e.type === F.Function && "string" == typeof e.value && !t(e.value)) return It(e);
 	}) : e;
 }
-function It(e, t) {
+function xt(e, t) {
 	const n = t.name.toUpperCase(), r = e ? e.filter((e) => e.name.toUpperCase() !== n) : [];
 	return r.push(t), r;
 }
-function bt(e) {
-	if (e?.type !== $.Function || "lambda" !== e.binder?.kind) return;
+function Rt(e) {
+	if (e?.type !== F.Function || "lambda" !== e.binder?.kind) return;
 	const t = e.inputs ?? [], n = [];
 	for (let e = 0; e < t.length - 1; e++) {
 		const r = t[e];
@@ -1434,19 +1438,19 @@ function bt(e) {
 	}
 	return n;
 }
-var xt = /* @__PURE__ */ new Set([
+var Et = /* @__PURE__ */ new Set([
 	"IF",
 	"IFERROR",
 	"IFNA"
 ]);
-function Rt(e, t) {
-	if (!e || e.type !== $.Function || "string" != typeof e.value) return e;
+function Tt(e, t) {
+	if (!e || e.type !== F.Function || "string" != typeof e.value) return e;
 	const n = (t?.(e.value)?.getName() ?? e.value).toUpperCase();
-	if (!xt.has(n)) return e;
+	if (!Et.has(n)) return e;
 	const r = e.inputs;
 	let i;
 	if (r) for (let e = 0; e < r.length; e++) {
-		const n = Rt(r[e], t);
+		const n = Tt(r[e], t);
 		n !== r[e] && ((i ??= [...r])[e] = n);
 	}
 	return {
@@ -1455,7 +1459,7 @@ function Rt(e, t) {
 		passOmitted: !0
 	};
 }
-function Et(e, t = null) {
+function At(e, t = null) {
 	if (!e) return e;
 	const n = [];
 	let r = 0;
@@ -1475,15 +1479,15 @@ function Et(e, t = null) {
 		} : e;
 	}, s = (e) => {
 		if (!e) return e;
-		const l = pt(e, t);
+		const l = gt(e, t);
 		if (l) return ((e, l) => {
 			const o = e.inputs, a = o?.length ?? 0;
 			if (!o || a < 1) return i(e);
 			const u = n.length, c = [], f = [...o], p = (e, t = !1) => {
 				const i = f[e];
-				let s = dt(i), l = !1;
+				let s = vt(i), l = !1;
 				if (void 0 === s && t) {
-					if (s = ht(i), void 0 === s) return;
+					if (s = yt(i), void 0 === s) return;
 					l = !0;
 				} else if (void 0 === s) return;
 				const o = r++;
@@ -1493,7 +1497,7 @@ function Et(e, t = null) {
 					name: s
 				}), c.push(o), f[e] = l ? {
 					...i,
-					type: $.Named,
+					type: F.Named,
 					value: {
 						nameId: s,
 						scope: null
@@ -1518,7 +1522,7 @@ function Et(e, t = null) {
 				for (let e = 0; e < a - 1; e++) p(e, !0);
 				f[a - 1] && (f[a - 1] = s(f[a - 1]));
 			} else {
-				for (let e = 0; e + 1 < a; e += 2) f[e + 1] && (f[e + 1] = Rt(s(f[e + 1]), t)), p(e);
+				for (let e = 0; e + 1 < a; e += 2) f[e + 1] && (f[e + 1] = Tt(s(f[e + 1]), t)), p(e);
 				a % 2 == 1 && f[a - 1] && (f[a - 1] = s(f[a - 1]));
 			}
 			for (; n.length > u;) n.pop();
@@ -1531,22 +1535,22 @@ function Et(e, t = null) {
 				}
 			};
 		})(e, l);
-		if (e.type === $.Function && "string" == typeof e.value) {
+		if (e.type === F.Function && "string" == typeof e.value) {
 			const r = e.value.toUpperCase();
-			if (n.some((e) => e.key === r) && !t?.(e.value)) return i(mt(e));
+			if (n.some((e) => e.key === r) && !t?.(e.value)) return i(It(e));
 		}
 		if (n.length > 0 && e.isReference && ":" === e.value && 2 === e.inputs?.length) {
 			const [t, r] = e.inputs;
-			if (Tt(t) && Tt(r)) {
+			if (St(t) && St(r)) {
 				const s = t.image.toUpperCase(), l = r.image.toUpperCase();
 				if (n.some((e) => e.key === s || e.key === l)) return i({
 					...e,
-					inputs: [At(t), At(r)]
+					inputs: [wt(t), wt(r)]
 				});
 			}
 		}
-		if (e.type === $.Named) {
-			const t = dt(e);
+		if (e.type === F.Named) {
+			const t = vt(e);
 			if (void 0 !== t) {
 				const r = t.toUpperCase();
 				for (let i = n.length - 1; i >= 0; i--) {
@@ -1565,7 +1569,7 @@ function Et(e, t = null) {
 			return e;
 		}
 		const o = i(e);
-		if (o.type === $.Function && "string" == typeof o.value && "ISOMITTED" === (t?.(o.value)?.getName() ?? o.value).toUpperCase()) {
+		if (o.type === F.Function && "string" == typeof o.value && "ISOMITTED" === (t?.(o.value)?.getName() ?? o.value).toUpperCase()) {
 			const e = o.inputs;
 			if (e) {
 				let n;
@@ -1578,7 +1582,7 @@ function Et(e, t = null) {
 						};
 						continue;
 					}
-					const s = Rt(i, t);
+					const s = Tt(i, t);
 					s !== i && ((n ??= [...e])[r] = s);
 				}
 				if (n) return {
@@ -1591,54 +1595,54 @@ function Et(e, t = null) {
 	};
 	return s(e);
 }
-var Tt = (e) => {
-	if (e?.type !== $.Cell || void 0 === e.image) return !1;
+var St = (e) => {
+	if (e?.type !== F.Cell || void 0 === e.image) return !1;
 	const t = e.value;
 	return t.rowIndex === Number.MIN_SAFE_INTEGER && !0 !== t.$colIndex && !t.scope;
-}, At = (e) => {
-	const t = u(e.image);
-	return V(t, e), t;
-}, St = (e) => e?.type === $.Cell, wt = (e, t = null) => {
+}, wt = (e) => {
+	const t = O(e.image);
+	return k(t, e), t;
+}, Ct = (e) => e?.type === F.Cell, Nt = (e, t = null) => {
 	if (!e) return e;
 	let n = !1;
 	const r = (e) => {
 		if (n || !e) return;
-		const i = pt(e, t), s = e.inputs;
+		const i = gt(e, t), s = e.inputs;
 		if (i && s) {
 			const e = "let" === i ? 2 : 1;
-			for (let t = 0; t < s.length - 1; t += e) if (St(s[t])) return void (n = !0);
+			for (let t = 0; t < s.length - 1; t += e) if (Ct(s[t])) return void (n = !0);
 		}
 		if (s) for (let e = 0; e < s.length && !n; e++) r(s[e]);
 	};
 	if (r(e), !n) return e;
 	let i = null;
-	const s = O(e, (e) => {
-		if (e?.type !== $.Cell) return;
+	const s = v(e, (e) => {
+		if (e?.type !== F.Cell) return;
 		const t = e.value, n = e.image;
 		if (!0 === t?.$colIndex || !0 === t?.$rowIndex) return void (i ??= `'${n ?? "a reference"}' cannot be absolute here. A LET/LAMBDA name that is a cell reference makes every reference in the formula a name, and a name cannot contain '$'.`);
 		if (void 0 === n) return;
-		const r = u(n);
-		V(r, e);
+		const r = O(n);
+		k(r, e);
 		const s = t?.scope;
 		return s && (r.value.scope = s, r.value.scopeImage = t.scopeImage), r;
 	});
 	return i ?? s;
-}, Ct = (e, t) => {
+}, Ft = (e, t) => {
 	if (!e) return null;
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		const i = pt(e, t);
+		const i = gt(e, t);
 		i && ((e, t) => {
 			const r = "let" === t ? "LET" : "LAMBDA", i = e.inputs, s = i?.length ?? 0;
 			if (!i || s < 2) return;
 			if ("let" === t && s % 2 == 0) return void (n = `Wrong number of arguments for LET. Expected name/value pairs followed by a calculation, but got ${s}.`);
-			if ("lambda" === t && i[s - 1]?.type === $.Empty) return void (n = "LAMBDA has no calculation: the last argument is empty.");
+			if ("lambda" === t && i[s - 1]?.type === F.Empty) return void (n = "LAMBDA has no calculation: the last argument is empty.");
 			const l = /* @__PURE__ */ new Set(), o = "let" === t ? 2 : 1;
 			let a = !1;
 			for (let e = 0; e < s - 1; e += o) {
-				let s = dt(i[e]);
-				if (void 0 === s && "lambda" === t) s = ht(i[e]), void 0 !== s && (a = !0);
+				let s = vt(i[e]);
+				if (void 0 === s && "lambda" === t) s = yt(i[e]), void 0 !== s && (a = !0);
 				else if (void 0 !== s && a) return void (n = `Required name '${s}' cannot follow an optional name in ${r}.`);
 				if (void 0 === s) return void (n = `Expected a name in ${r} argument ${e + 1}; a name cannot be the output of a formula.`);
 				if (s.includes(".")) return void (n = `Expected a name in ${r} argument ${e + 1}; a name cannot contain '.'.`);
@@ -1652,7 +1656,7 @@ var Tt = (e) => {
 	};
 	return r(e), n;
 };
-function Nt(e, t, n, r, i) {
+function Pt(e, t, n, r, i) {
 	const s = r;
 	let l;
 	const o = () => (void 0 === l && (l = i && n ? t.bind(R.Table, "", { at: {
@@ -1660,10 +1664,10 @@ function Nt(e, t, n, r, i) {
 		rowIndex: i.rowIndex,
 		colIndex: i.colIndex
 	} }) : null), l);
-	return O(e, (e, r, i = []) => {
+	return v(e, (e, r, i = []) => {
 		let l;
 		const a = e.type;
-		if (a === $.Cell) {
+		if (a === F.Cell) {
 			const n = e.value;
 			if (n?.scope) {
 				const r = t.bind(R.Sheet, n.scope, s);
@@ -1672,35 +1676,35 @@ function Nt(e, t, n, r, i) {
 					scope: r
 				});
 			}
-		} else if (a === $.Named) {
+		} else if (a === F.Named) {
 			const r = e.value;
 			if (r && !e.binding) {
 				const i = function(e, t, n, r) {
 					if (t.scope) {
 						const e = n.bind(R.Sheet, t.scope, r);
-						if (null === e || L(e)) return;
+						if (null === e || A(e)) return;
 					}
 					const i = n.bind(R.Table, t.nameId, { existing: !0 });
 					if (null === i) return;
 					const s = {
-						type: $.TableReference,
+						type: F.TableReference,
 						value: i,
 						inputs: null,
 						isReference: !0
 					};
-					V(s, e);
+					k(s, e);
 					const l = t.scopeImage;
 					return "string" == typeof l && void 0 !== e.image && (s.image = l + e.image), s;
 				}(e, r, t, s);
 				if (i) return i;
-				const o = r.scope ? t.bind(R.Sheet, r.scope, s) : null, a = (null !== o ? L(o) ? o : t.resolve(R.Sheet, o)?.toString() ?? r.scope : r.scope) ?? n, u = t.bind(R.NamedFormula, r.nameId, a ? { scope: a } : void 0);
+				const o = r.scope ? t.bind(R.Sheet, r.scope, s) : null, a = (null !== o ? A(o) ? o : t.resolve(R.Sheet, o)?.toString() ?? r.scope : r.scope) ?? n, u = t.bind(R.NamedFormula, r.nameId, a ? { scope: a } : void 0);
 				null === u && null === o || (l || (l = { ...e }), l.value = {
 					...r,
 					nameId: u ?? r.nameId,
 					...null !== o ? { scope: o } : void 0
 				});
 			}
-		} else if (a === $.Error) {
+		} else if (a === F.Error) {
 			const n = e.value;
 			if (n?.scope) {
 				const r = t.bind(R.Sheet, n.scope, s);
@@ -1709,25 +1713,25 @@ function Nt(e, t, n, r, i) {
 					scope: r
 				});
 			}
-		} else if (a === $.TableReference) {
+		} else if (a === F.TableReference) {
 			const n = e.value;
 			if (n) {
 				const r = t.bind(R.Table, n);
 				l || (l = { ...e }), null !== r && (l.value = r);
 			} else if ("string" == typeof n) {
 				const n = o();
-				if (null !== n && Ft(e, t)) return {
+				if (null !== n && Lt(e, t)) return {
 					...e,
 					value: n
 				};
 			}
-		} else if (a === $.TableColumn) {
+		} else if (a === F.TableColumn) {
 			const n = e.value;
 			if (n) {
-				const r = pe(i, $.TableReference), s = r?.value || (r ? o() ?? void 0 : void 0), a = t.bind(R.TableColumn, n, s ? { tableName: s } : void 0);
+				const r = pe(i, F.TableReference), s = r?.value || (r ? o() ?? void 0 : void 0), a = t.bind(R.TableColumn, n, s ? { tableName: s } : void 0);
 				l || (l = { ...e }), null !== a && (l.value = a);
 			}
-		} else if (a === $.Function) {
+		} else if (a === F.Function) {
 			const n = e.value;
 			if (n) {
 				const r = t.bind(R.Function, n);
@@ -1737,24 +1741,24 @@ function Nt(e, t, n, r, i) {
 		return l;
 	});
 }
-function Ft(e, t) {
+function Lt(e, t) {
 	let n = !0;
 	const r = e.inputs;
 	if (!r) return !0;
-	for (let e = 0; e < r.length && n; e++) O(r[e], (e) => {
-		e.type === $.TableColumn && null === t.resolve(R.TableColumn, e.value) && (n = !1);
+	for (let e = 0; e < r.length && n; e++) v(r[e], (e) => {
+		e.type === F.TableColumn && null === t.resolve(R.TableColumn, e.value) && (n = !1);
 	});
 	return n;
 }
-function Pt(e, t) {
+function kt(e, t) {
 	let n = null;
-	return O(e, (e) => {
-		if (n || e.type !== $.TableReference) return;
+	return v(e, (e) => {
+		if (n || e.type !== F.TableReference) return;
 		if ("" === e.value) return void (n = "A structured reference without a table name must be in a table that has its columns.");
 		const r = e.value;
 		if (!t || "string" != typeof r) return;
 		const i = t.resolve(R.Table, r)?.toString() ?? r;
-		null === t.bind(R.Table, i, { existing: !0 }) ? n = `There is no table named '${i}'.` : Ft(e, t) || (n = "The table has no such column.");
+		null === t.bind(R.Table, i, { existing: !0 }) ? n = `There is no table named '${i}'.` : Lt(e, t) || (n = "The table has no such column.");
 	}), n;
 }
-export { ye as A, je as C, ut as D, ue as E, ve as O, it as S, me as T, et as _, It as a, ge as b, Re as c, Ke as d, ae as f, ct as g, ce as h, Ie as i, yt as j, wt as k, We as l, be as m, Et as n, Nt as o, at as p, He as r, Pt as s, Ct as t, Xe as u, fe as v, st as w, he as x, ft as y };
+export { xt as A, nt as C, lt as D, qe as E, ue as O, me as S, pt as T, fe as _, Ke as a, he as b, Re as c, ae as d, be as f, dt as g, ct as h, Ie as i, ye as j, ve as k, Ze as l, ce as m, Ft as n, Nt as o, bt as p, He as r, Pt as s, At as t, _e as u, ft as v, ot as w, kt as x, ge as y };