@sheetxl/mcp 0.8.0-beta.22 → 0.8.0-beta.24

package/assets/{BPZWfwUvFCLQInXN.js → BrJd9jVVv9SQzZol.js}

@@ -1,36 +1,36 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.24
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { ht as e } from "./DHHYGjNwlLvja3dS.js";
-import { i as t } from "./BSdRn3B8QeJFflY6.js";
-import { a as n, c as r, f as i, o as s, u as l } from "./BUGEQS5WdiLcI_0X.js";
-import { At as o, Bn as a, Bt as u, In as c, J as f, Jr as p, K as d, Kn as g, Si as v, Tr as h, Vr as m, Wn as y, Yn as I, _n as b, a as x, at as R, ba as E, cn as T, g as A, hr as S, ki as w, l as C, mo as N, mr as F, ri as P, s as k, si as L, un as $, vi as B, vr as O, w as V } from "./C1PTfp7kVu3DqqZh.js";
-var z = (e, t) => e + t, D = (e, t) => e - t, W = (e, t) => u(e + t, e), M = (e, t) => u(e - t, e), U = (e, t) => y(e * t), _ = (e, t) => 0 === t ? l.BuiltIn.Div0 : y(e / t), j = (e, t) => {
+import { ht as e } from "./DMDTS0LH9Ke9t-3z.js";
+import { i as t } from "./B16G2473LTkZP6Mq.js";
+import { a as n, c as r, f as i, o as s, u as l } from "./DRzZ4bEyLRGVOLzV.js";
+import { $n as o, Ci as a, Ea as u, Hi as c, Ia as f, Ir as p, Ki as d, Kt as g, Pr as v, T as h, Ta as m, Vn as y, W as I, Xt as b, ar as x, co as R, gr as E, i as T, ii as A, ji as S, kn as w, lt as C, m as N, oo as F, po as P, rn as k, sr as L, un as $, wn as O, wt as B, xi as V } from "./C9iFJ52KwQTePQ81.js";
+var z = (e, t) => e + t, D = (e, t) => e - t, W = (e, t) => O(e + t, e), M = (e, t) => O(e - t, e), U = (e, t) => P(e * t), _ = (e, t) => 0 === t ? l.BuiltIn.Div0 : P(e / t), j = (e, t) => {
 	if (0 === e) {
 		if (t < 0) return l.BuiltIn.Div0;
 		if (0 === t) return NaN;
 	}
 	if (e < 0) {
-		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return y(e ** t);
+		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return P(e ** t);
 		const n = Number((1 / t).toPrecision(15));
-		return Number.isInteger(n) && 1 === Math.abs(n % 2) ? y(-((-e) ** t)) : NaN;
+		return Number.isInteger(n) && 1 === Math.abs(n % 2) ? P(-((-e) ** t)) : NaN;
 	}
-	return y(e ** t);
+	return P(e ** t);
 }, G = (e = "", t = "") => {
 	null === e && (e = ""), null === t && (t = "");
 	const n = typeof t;
-	"boolean" == typeof e && (e = d(e)), "boolean" === n && (t = d(t));
+	"boolean" == typeof e && (e = g(e)), "boolean" === n && (t = g(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, J = (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 = {
+}, 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: i.Number,
 	coerce: [i.Boolean, i.String],
 	onError: "value",
 	misalignValue: l.BuiltIn.NA
-}, Q = {
+}, Y = {
 	type: i.String,
 	coerce: [i.Boolean, i.Number],
 	onError: "value",
@@ -45,12 +45,12 @@ var z = (e, t) => e + t, D = (e, t) => e - t, W = (e, t) => u(e + t, e), M = (e,
 	let s, o;
 	if (t?.isIRange ? s = t : n?.isIRange && (o = n), !s && !o) {
 		const s = e.getRuntime();
-		return t = c(s, t, $(t, !0), i.Number, !0), n = c(s, n, $(n, !0), i.Number, !0), t && l.isError(t) ? t : n && l.isError(n) ? n : r(t, n);
+		return t = b(s, t, R(t, !0), i.Number, !0), n = b(s, n, R(n, !0), i.Number, !0), t && l.isError(t) ? t : n && l.isError(n) ? n : r(t, n);
 	}
-	const a = !s, u = a ? t : n;
-	return (s ?? o).broadcast(u, (t, n) => t && l.isError(t) ? t : n && l.isError(n) ? n : S(a ? r(n, t) : r(t, n), e), Y).fillEmpty(0);
+	const u = !s, c = u ? t : n;
+	return (s ?? o).broadcast(c, (t, n) => t && l.isError(t) ? t : n && l.isError(n) ? n : a(u ? r(n, t) : r(t, n), e), Q).fillEmpty(0);
 }, re = (e, t, r, i) => {
-	if (L(t) || L(r)) return l.BuiltIn.Value;
+	if (d(t) || d(r)) return l.BuiltIn.Value;
 	if (n(t) || n(r)) return l.BuiltIn.Value;
 	if (null !== t && void 0 !== t.colStart && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && l.isError(t)) return t;
 	if (null !== r && void 0 !== r.colStart && (r = e.getValueAt(r.rowStart, r.colStart, r.scope)) && l.isError(r)) return r;
@@ -70,9 +70,9 @@ var z = (e, t) => e + t, D = (e, t) => e - t, W = (e, t) => u(e + t, e), M = (e,
 	if ("-" !== t) throw new l.Value(`Unrecognized prefix: ${t}`);
 	if (s = -s, n?.isIRange && (r = n), !r) {
 		const t = e.getRuntime();
-		return "number" != typeof (n = c(t, n, $(n, !0), i.Number, !0)) ? l.BuiltIn.Value : n * s;
+		return "number" != typeof (n = b(t, n, R(n, !0), i.Number, !0)) ? l.BuiltIn.Value : n * s;
 	}
-	return r.broadcast(s, (e, t) => e && l.isError(e) ? e : t && l.isError(t) ? t : U(e, t), Y);
+	return r.broadcast(s, (e, t) => e && l.isError(e) ? e : t && l.isError(t) ? t : U(e, t), Q);
 }, le = (e) => e.getCode() <= l.Code.NA ? e : l.BuiltIn.Value, oe = (e, t, n, r, i) => {
 	if (l.isError(t)) return le(t);
 	if (n && l.isError(n)) return le(n);
@@ -93,18 +93,18 @@ var z = (e, t) => e + t, D = (e, t) => e - t, W = (e, t) => u(e + t, e), M = (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, E, "either"),
-	":": (e, t, n, r) => oe(e, t, n, I, "start"),
+	" ": (e, t, n, r) => oe(e, t, n, y, "either"),
+	":": (e, t, n, r) => oe(e, t, n, L, "start"),
 	".:.": (e, t, n, r) => {
-		const i = oe(e, t, n, I, "start");
+		const i = oe(e, t, n, L, "start");
 		return e.getFunction("TRIMRANGE").execute(i, 3, 3);
 	},
 	".:": (e, t, n, r) => {
-		const i = oe(e, t, n, I, "start");
+		const i = oe(e, t, n, L, "start");
 		return e.getFunction("TRIMRANGE").execute(i, 1, 1);
 	},
 	":.": (e, t, n, r) => {
-		const i = oe(e, t, n, I, "start");
+		const i = oe(e, t, n, L, "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, W = (e, t) => u(e + t, e), M = (e,
 		let s, o;
 		if (t?.isIRange ? s = t : n?.isIRange && (o = n), !s && !o) {
 			const s = e.getRuntime();
-			return t = c(s, t, $(t, !0), i.String, !1), n = c(s, n, $(n, !0), i.String, !1), l.isError(t) ? t : l.isError(n) ? n : r(t, n);
+			return t = b(s, t, R(t, !0), i.String, !1), n = b(s, n, R(n, !0), i.String, !1), l.isError(t) ? t : l.isError(n) ? n : r(t, n);
 		}
 		const a = !s, u = a ? t : n;
-		return (s ?? o).broadcast(u, (e, t) => e && l.isError(e) ? e : t && l.isError(t) ? t : a ? r(t, e) : r(e, t), Q);
+		return (s ?? o).broadcast(u, (e, t) => e && l.isError(e) ? e : t && l.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, Z),
-	">=": (e, t, n) => re(e, t, n, J),
-	"<=": (e, t, n) => re(e, t, n, q)
+	"<": (e, t, n) => re(e, t, n, q),
+	">=": (e, t, n) => re(e, t, n, Z),
+	"<=": (e, t, n) => re(e, t, n, J)
 }, ue = {
 	"+": (e, t, n) => ne(e, t, n, W),
 	"-": (e, t, n) => ne(e, t, n, M)
@@ -159,38 +159,38 @@ var de = class {
 				value: null,
 				inputs: null
 			};
-			if (this.references.set(e, t), n === b.Cell) {
+			if (this.references.set(e, t), n === N.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 === b.Infix || n === b.Prefix || n === b.Postfix || n === b.List) {
+			if (n === N.Infix || n === N.Prefix || n === N.Postfix || n === N.List) {
 				const n = e.inputs || [], r = n.length, i = e.value;
 				t.op = i;
-				const s = w(r);
+				const s = T(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), Ze.includes(i)) {
-					const r = n[0], i = !!r && r.type === b.Cell, s = n[1], l = !!s && s.type === b.Cell;
+				if (this.rootReferences.add(t), qe.includes(i)) {
+					const r = n[0], i = !!r && r.type === N.Cell, s = n[1], l = !!s && s.type === N.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 === b.Error || n === b.Named) {
-				const r = n === b.Named ? e.value.nameId : C(e.value);
+			if (n === N.Error || n === N.Named) {
+				const r = n === N.Named ? e.value.nameId : p(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 === b.TableReference) return t.op = n, this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, void this.referenceIndices.push(t.index);
+			if (n === N.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: b.Function,
+				op: N.Function,
 				value: e.value,
 				inputs: null
 			};
@@ -198,11 +198,11 @@ var de = class {
 		}
 	}
 };
-function ge(e, t = !1, n = A) {
+function ge(e, t = !1, n = $) {
 	const r = [], i = /* @__PURE__ */ new Set(), s = (e, n, s) => {
 		const l = {
 			type: e.type,
-			value: e.type === b.Error ? m(e.value) : e.value
+			value: e.type === N.Error ? A(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 = A) {
 		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 === b.Whitespace && r[r.length - 1].type === b.Whitespace) return;
+		if (r.length > 1 && e === N.Whitespace && r[r.length - 1].type === N.Whitespace) return;
 		const l = {
 			type: e,
 			value: t,
@@ -220,185 +220,185 @@ function ge(e, t = !1, n = A) {
 		};
 		void 0 !== i && (l.evalIndex = i), n && (l.context = n), r.push(l);
 	};
-	(function e(a, u, c) {
-		const p = a.evalIndex ?? c ?? 0, d = a.type, g = (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(b.Separator, ",", r, i, n.separatorFunction);
+			for (let o = 0; o < s; o++) e(t[o], r, i), o < s - 1 && l(N.Separator, ",", r, i, n.separatorFunction);
 		};
-		if (a.isLiteral) {
-			if (l(b.Whitespace, a.wsBefore, u, p), d === b.Array) {
-				l(b.Type, "{", u, p);
-				const t = a.value, r = t.length;
+		if (o.isLiteral) {
+			if (l(N.Whitespace, o.wsBefore, a, c), f === N.Array) {
+				l(N.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(b.Whitespace, r.wsBefore, u, p), e(r, u, p), l(b.Whitespace, r.wsAfter, u, p), t < a - 1 && l(b.Separator, ",", u, p, n.separatorColumn);
+						l(N.Whitespace, r.wsBefore, a, c), e(r, a, c), l(N.Whitespace, r.wsAfter, a, c), t < u - 1 && l(N.Separator, ",", a, c, n.separatorColumn);
 					}
-					i < r - 1 && (l(b.Whitespace, s.wsBefore, u, p), l(b.Separator, ";", u, p, n.separatorRow), l(b.Whitespace, s.wsAfter, u, p));
+					i < r - 1 && (l(N.Whitespace, s.wsBefore, a, c), l(N.Separator, ";", a, c, n.separatorRow), l(N.Whitespace, s.wsAfter, a, c));
 				}
-				a.error || l(b.Type, "}", u, p);
-			} else d === b.String ? (a = {
-				type: d,
-				value: "\"" + `${a.value}`.replace(/"/g, "\"\"") + "\"",
-				image: a.image
-			}, s(a, u, p)) : s(a, u, p);
-			l(b.Whitespace, a.wsAfter, u, p);
-		} else if (d === b.Infix) e(a.inputs[0], u, p), l(b.Whitespace, a.wsBefore, u, p), s(a, u, p), l(b.Whitespace, a.wsAfter, u, p), e(a.inputs[1], u, p);
-		else if (d === b.Prefix) l(b.Whitespace, a.wsBefore, u, p), s(a, u, p), l(b.Whitespace, a.wsAfter, u, p), a.inputs && e(a.inputs[0], u, p);
-		else if (d === b.Postfix) {
-			a.inputs?.[0] && e(a.inputs[0], u, p), l(b.Whitespace, a.wsBefore, u, p);
-			const t = s(a, u, p), n = r[r.length - 2];
-			"#" === a.value && void 0 !== t.text && !a.wsBefore && i.has(n) && (n.text = (n.text ?? "") + t.text, t.text = ""), l(b.Whitespace, a.wsAfter, u, p);
+				o.error || l(N.Type, "}", a, c);
+			} else f === N.String ? (o = {
+				type: f,
+				value: "\"" + `${o.value}`.replace(/"/g, "\"\"") + "\"",
+				image: o.image
+			}, s(o, a, c)) : s(o, a, c);
+			l(N.Whitespace, o.wsAfter, a, c);
+		} else if (f === N.Infix) e(o.inputs[0], a, c), l(N.Whitespace, o.wsBefore, a, c), s(o, a, c), l(N.Whitespace, o.wsAfter, a, c), e(o.inputs[1], a, c);
+		else if (f === N.Prefix) l(N.Whitespace, o.wsBefore, a, c), s(o, a, c), l(N.Whitespace, o.wsAfter, a, c), o.inputs && e(o.inputs[0], a, c);
+		else if (f === N.Postfix) {
+			o.inputs?.[0] && e(o.inputs[0], a, c), l(N.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(N.Whitespace, o.wsAfter, a, c);
 		} else {
-			l(b.Whitespace, a.wsBefore, u, p);
-			const c = a.inputs;
-			switch (d) {
-				case b.Function: {
-					const t = String(a.value), i = {
-						type: b.Function,
+			l(N.Whitespace, o.wsBefore, a, c);
+			const u = o.inputs;
+			switch (f) {
+				case N.Function: {
+					const t = String(o.value), i = {
+						type: N.Function,
 						value: t,
-						text: a.image ?? t,
-						evalIndex: a.evalIndex
+						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: a.binder?.kind ?? "function"
+						type: o.binder?.kind ?? "function"
 					};
-					if (u?.bound && (s.bound = u.bound), l(b.Paren, "(", s, a.evalIndex), c) {
-						const t = c.length, r = a.binder?.kind, i = "lambda" === r ? 1 : "let" === r ? 2 : 0;
-						let o = s.bound;
-						for (let a = 0; a < t; a++) {
-							const u = i && a >= i ? c[a - i] : void 0;
-							if (u?.binding?.declaration) {
-								const e = u.value.nameId, t = "let" === r ? Rt(c[a - 1]) : void 0;
-								o = xt(o, t ? {
+					if (a?.bound && (s.bound = a.bound), l(N.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 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 });
 							}
-							const f = {
+							const p = {
 								...s,
-								argIndex: a
+								argIndex: o
 							};
-							o && (f.bound = o), e(c[a], f, p), a < t - 1 && l(b.Separator, ",", f, p, n.separatorFunction);
+							a && (p.bound = a), e(u[o], p, c), o < t - 1 && l(N.Separator, ",", p, c, n.separatorFunction);
 						}
 					}
-					a.error || l(b.Paren, ")", s, a.evalIndex);
+					o.error || l(N.Paren, ")", s, o.evalIndex);
 					break;
 				}
-				case b.Call: {
-					const t = o(a), i = r.length;
-					if (t && e(t, u, p), t?.type === b.Named) for (let e = i; e < r.length; e++) {
+				case N.Call: {
+					const t = I(o), i = r.length;
+					if (t && e(t, a, c), t?.type === N.Named) for (let e = i; e < r.length; e++) {
 						const t = r[e];
-						t.type !== b.Whitespace && (t.evalIndex = a.evalIndex, t.type === b.Named && (t.type = b.Function, t.value = t.value.name));
+						t.type !== N.Whitespace && (t.evalIndex = o.evalIndex, t.type === N.Named && (t.type = N.Function, t.value = t.value.name));
 					}
 					const s = {
-						name: t?.type === b.Named ? t.value.nameId : "",
+						name: t?.type === N.Named ? t.value.nameId : "",
 						argIndex: -1,
 						type: "function"
 					};
-					u?.bound && (s.bound = u.bound), l(b.Paren, "(", s, a.evalIndex);
-					const c = f(a), d = c.length;
-					for (let t = 0; t < d; t++) {
+					a?.bound && (s.bound = a.bound), l(N.Paren, "(", s, o.evalIndex);
+					const u = w(o), f = u.length;
+					for (let t = 0; t < f; t++) {
 						const r = {
 							...s,
 							argIndex: t
 						};
-						e(c[t], r, p), t < d - 1 && l(b.Separator, ",", r, p, n.separatorFunction);
+						e(u[t], r, c), t < f - 1 && l(N.Separator, ",", r, c, n.separatorFunction);
 					}
-					a.error || l(b.Paren, ")", s, a.evalIndex);
+					o.error || l(N.Paren, ")", s, o.evalIndex);
 					break;
 				}
-				case b.Cell:
-					s(a, u, p);
+				case N.Cell:
+					s(o, a, c);
 					break;
-				case b.Paren:
-					l(d, "(", u, p), g(c, u, p), a.error || l(d, ")", u, p);
+				case N.Paren:
+					l(f, "(", a, c), p(u, a, c), o.error || l(f, ")", a, c);
 					break;
-				case b.TableReference: {
-					const n = a.value?.tableId ?? "", s = {
+				case N.TableReference: {
+					const n = o.value?.tableId ?? "", s = {
 						name: n,
 						argIndex: -1,
 						type: "table"
-					}, o = r.length, f = a.image;
+					}, f = r.length, p = o.image;
 					let d, g = !1;
-					if (n && f) {
+					if (n && p) {
 						let e = 0;
-						if (91 === f.charCodeAt(0)) {
-							const t = f.indexOf("]");
-							-1 !== t && 33 === f.charCodeAt(t + 1) && (e = t + 2);
+						if (91 === p.charCodeAt(0)) {
+							const t = p.indexOf("]");
+							-1 !== t && 33 === p.charCodeAt(t + 1) && (e = t + 2);
 						}
-						const n = f.indexOf("[", e);
-						if (g = 0 === n && null != c, n > 0) d = f.slice(0, n);
-						else if (!c) {
-							const e = f.lastIndexOf("!");
-							d = t || -1 === e ? f : f.slice(e + 1);
+						const n = p.indexOf("[", e);
+						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(b.TableReference, n, u, p, d), c && l(b.Paren, "[", s, p), c) {
-						const t = c.length;
+					if (!n || g && t || l(N.TableReference, n, a, c, d), u && l(N.Paren, "[", s, c), u) {
+						const t = u.length;
 						for (let n = 0; n < t; n++) {
 							const r = {
 								...s,
 								argIndex: n
 							};
-							e(c[n], r, p), n < t - 1 && l(b.Separator, ",", r, p);
+							e(u[n], r, c), n < t - 1 && l(N.Separator, ",", r, c);
 						}
 					}
-					c && !a.error && l(b.Paren, "]", s, p);
-					const v = a.referenceIndex;
-					for (let e = o; e < r.length; e++) void 0 !== v && (r[e].referenceIndex = v), i.add(r[e]);
+					u && !o.error && l(N.Paren, "]", s, c);
+					const v = o.referenceIndex;
+					for (let e = f; e < r.length; e++) void 0 !== v && (r[e].referenceIndex = v), i.add(r[e]);
 					break;
 				}
-				case b.TableSpecifier:
-				case b.TableColumn: {
-					const e = a.image, t = null != e && e.startsWith("[") && e.endsWith("]");
-					t && l(b.Paren, "[", u, p);
+				case N.TableSpecifier:
+				case N.TableColumn: {
+					const e = o.image, t = null != e && e.startsWith("[") && e.endsWith("]");
+					t && l(N.Paren, "[", a, c);
 					const n = {
-						table: "table" === u?.type ? u.name : "",
-						name: a.value
+						table: "table" === a?.type ? a.name : "",
+						name: o.value
 					}, i = {
-						type: d,
+						type: f,
 						value: n,
 						text: t ? e.slice(1, -1) : e ?? n.name
 					};
-					void 0 !== p && (i.evalIndex = p), u && (i.context = u), r.push(i), t && l(b.Paren, "]", u, p);
+					void 0 !== c && (i.evalIndex = c), a && (i.context = a), r.push(i), t && l(N.Paren, "]", a, c);
 					break;
 				}
-				case b.List:
-					g(c, u, p);
+				case N.List:
+					p(u, a, c);
 					break;
-				case b.Named: {
-					const e = s(a, u, p), t = a.value;
+				case N.Named: {
+					const e = s(o, a, c), t = o.value;
 					e.value = t.scope ? {
 						name: t.nameId,
 						scope: t.scope
-					} : { name: t.nameId }, a.binding?.declaration && a.binding.optional && (e.value.optional = !0), a.binding && (e.type = b.Parameter, a.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 = N.Parameter, o.binding.declaration && (e.value.declaration = !0)), delete e.referenceIndex;
 					break;
 				}
-				default: void 0 !== a.value && s(a, u, p), c && c.forEach((t) => e(t, u, p));
+				default: void 0 !== o.value && s(o, a, c), u && u.forEach((t) => e(t, a, c));
 			}
-			l(b.Whitespace, a.wsAfter, u, p);
+			l(N.Whitespace, o.wsAfter, a, c);
 		}
 	})(e);
-	const a = /* @__PURE__ */ new Map();
-	for (const e of r) if (e.type === b.Cell && void 0 !== e.referenceIndex) {
-		const t = a.get(e.referenceIndex);
-		t ? t.push(e) : a.set(e.referenceIndex, [e]);
+	const o = /* @__PURE__ */ new Map();
+	for (const e of r) if (e.type === N.Cell && void 0 !== e.referenceIndex) {
+		const t = o.get(e.referenceIndex);
+		t ? t.push(e) : o.set(e.referenceIndex, [e]);
 	}
-	for (const e of a.values()) 1 === e.length ? e[0].refSide = "self" : (e[0].refSide = "left", e[e.length - 1].refSide = "right");
-	const u = /* @__PURE__ */ new Map();
+	for (const e of o.values()) 1 === e.length ? e[0].refSide = "self" : (e[0].refSide = "left", e[e.length - 1].refSide = "right");
+	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 === b.Cell || s === b.Named || s === b.Error) {
-			const e = s === b.Cell ? i.value?.scope : (b.Named, i.value?.scope ?? void 0), r = s === b.Error ? void 0 !== i.text && p(i.text) : i.text?.includes("!") ?? !1;
+		if (s === N.Cell || s === N.Named || s === N.Error) {
+			const e = s === N.Cell ? i.value?.scope : (N.Named, i.value?.scope ?? void 0), r = s === N.Error ? void 0 !== i.text && f(i.text) : i.text?.includes("!") ?? !1;
 			if (e && void 0 !== i.text && !r) {
-				const r = t?.resolve(a.Sheet, e)?.toString() ?? e;
-				n += g(r) + "!" + i.text;
+				const r = t?.resolve(B.Sheet, e)?.toString() ?? e;
+				n += x(r) + "!" + i.text;
 				continue;
 			}
-			if (s === b.Named) {
+			if (s === N.Named) {
 				n += i.text ?? i.value?.name ?? "";
 				continue;
 			}
 		}
-		if (s === b.Parameter) {
+		if (s === N.Parameter) {
 			n += i.text ?? i.value?.name ?? "";
 			continue;
 		}
@@ -431,40 +431,40 @@ function ve(e, t) {
 }
 function he(e, t) {
 	let n;
-	if (B(e, (e) => {
+	if (h(e, (e) => {
 		e.evalIndex === t && (n = e);
 	}), !n) return [];
 	const r = ge(n);
-	return r.length > 1 && r[0].type === b.Whitespace && r.shift(), r.length > 1 && r[r.length - 1].type === b.Whitespace && r.pop(), r;
+	return r.length > 1 && r[0].type === N.Whitespace && r.shift(), r.length > 1 && r[r.length - 1].type === N.Whitespace && r.pop(), r;
 }
 function me(e) {
-	return B(e, (e) => {
-		if (e.type !== b.TableReference) return;
+	return h(e, (e) => {
+		if (e.type !== N.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 c = (e) => {
-				e?.type === b.TableColumn && (o = e.value, a = e.value);
+				e?.type === N.TableColumn && (o = e.value, a = e.value);
 			};
 			if (n) for (const e of n) {
 				const t = e.type;
-				if (t === b.TableSpecifier) {
+				if (t === N.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 === b.TableColumn) c(e);
-				else if (t === b.Infix && ":" === e.value) {
+				} else if (t === N.TableColumn) c(e);
+				else if (t === N.Infix && ":" === e.value) {
 					const t = e.inputs?.[0], n = e.inputs?.[1];
-					t?.type === b.TableColumn && (o = t.value), n?.type === b.TableColumn && (a = n.value);
-				} else if (t === b.Prefix && "@" === e.value) {
+					t?.type === N.TableColumn && (o = t.value), n?.type === N.TableColumn && (a = n.value);
+				} else if (t === N.Prefix && "@" === e.value) {
 					u = !0;
 					const t = e.inputs?.[0];
-					t?.type === b.Infix && ":" === t.value ? (t.inputs?.[0]?.type === b.TableColumn && (o = t.inputs[0].value), t.inputs?.[1]?.type === b.TableColumn && (a = t.inputs[1].value)) : c(t);
+					t?.type === N.Infix && ":" === t.value ? (t.inputs?.[0]?.type === N.TableColumn && (o = t.inputs[0].value), t.inputs?.[1]?.type === N.TableColumn && (a = t.inputs[1].value)) : c(t);
 				}
 			}
 			return {
 				tableId: t,
-				spec: R(i, s, r, l),
+				spec: k(i, s, r, l),
 				columnFromId: o,
 				columnToId: a,
 				isThisRow: u
@@ -477,16 +477,16 @@ function me(e) {
 	});
 }
 function ye(e) {
-	return B(e, (e) => {
-		if (e.type !== b.TableReference) return;
+	return h(e, (e) => {
+		if (e.type !== N.TableReference) return;
 		const t = e.inputs;
 		if (!t) return;
-		if (-1 === t.findIndex((e) => e.type === b.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim())) return;
+		if (-1 === t.findIndex((e) => e.type === N.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim())) return;
 		const n = [];
 		let r;
-		for (const e of t) e.type === b.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim() || (e.type !== b.TableColumn && (e.type !== b.Infix || ":" !== e.value) || r ? n.push(e) : r = e);
+		for (const e of t) e.type === N.TableSpecifier && "#THIS ROW" === e.value.toUpperCase().trim() || (e.type !== N.TableColumn && (e.type !== N.Infix || ":" !== e.value) || r ? n.push(e) : r = e);
 		if (!r) return n.push({
-			type: b.Prefix,
+			type: N.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(u("@", s, !0)), {
 			...e,
 			inputs: n
 		};
 	});
 }
 function Ie(e) {
-	return B(e, (e) => {
-		if (e.type !== b.TableReference) return;
+	return h(e, (e) => {
+		if (e.type !== N.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 B(e, (e) => {
-		if (e.type !== b.TableReference || !e.inputs) return;
+	return h(e, (e) => {
+		if (e.type !== N.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 !== b.TableSpecifier) return 4;
+	if (e?.type !== N.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 B(e, (e) => {
-		if (e.type !== b.TableReference) return;
+	return h(e, (e) => {
+		if (e.type !== N.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 B(t, (t) => {
-		if (t.type !== b.Named || t.binding) return;
+	return h(t, (t) => {
+		if (t.type !== N.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 B(t, (t, i, s) => {
+	return h(t, (t, i, s) => {
 		if (!t.isReference) return;
 		if (i?.isReference) return;
 		const l = t.type;
-		if (l === b.Named || l === b.Error || l === b.TableReference) return;
-		if (pe(s, b.TableReference)) return;
+		if (l === N.Named || l === N.Error || l === N.TableReference) return;
+		if (pe(s, N.TableReference)) return;
 		const o = function(e) {
 			let t = e;
 			for (; t;) {
@@ -582,11 +582,11 @@ function Te(t, n) {
 			let r = e;
 			for (let e = t.length - 1; e >= 0; e--) {
 				const i = t[e];
-				if (i.type === b.Paren || i.isReference) {
+				if (i.type === N.Paren || i.isReference) {
 					r = i;
 					continue;
 				}
-				if (i.type !== b.Function) return !0;
+				if (i.type !== N.Function) return !0;
 				const s = n?.(String(i.value));
 				if (!s) return !0;
 				const l = i.inputs ? i.inputs.indexOf(r) : -1;
@@ -603,8 +603,8 @@ function we(e, t) {
 function Ce(e, t, n) {
 	if (!e || !t) return !1;
 	let r = !1;
-	return B(e, (e) => {
-		if (r || e.type !== b.Function) return;
+	return h(e, (e) => {
+		if (r || e.type !== N.Function) return;
 		const i = t(e.value)?.getName();
 		i && n.has(i.toUpperCase()) && (r = !0);
 	}), r;
@@ -612,15 +612,15 @@ function Ce(e, t, n) {
 function Ne(e, t) {
 	if (!e || !t) return !1;
 	let n = !1;
-	return B(e, (e) => {
-		n || e.type !== b.Function || "TABLE" === t(e.value)?.getName().toUpperCase() && (n = !0);
+	return h(e, (e) => {
+		n || e.type !== N.Function || "TABLE" === t(e.value)?.getName().toUpperCase() && (n = !0);
 	}), n;
 }
 function Fe(e, t) {
 	if (!e || !t) return !1;
 	let n = !1;
-	return B(e, (e) => {
-		n || e.type !== b.Function || !0 === t(e.value)?.getDeclaration().getReturnType()?.isVolatile() && (n = !0);
+	return h(e, (e) => {
+		n || e.type !== N.Function || !0 === t(e.value)?.getDeclaration().getReturnType()?.isVolatile() && (n = !0);
 	}), n;
 }
 var Pe = Object.freeze({
@@ -630,13 +630,13 @@ var Pe = Object.freeze({
 	const n = function(e, t) {
 		if (!e || !t) return Pe;
 		let n = !1, r = !1;
-		return B(e, (e) => {
+		return h(e, (e) => {
 			if (n) return;
 			const i = e.type;
-			if (i === b.Named) return void (void 0 === e.binding && (n = !0));
-			if (i === b.Prefix) return void ("@" === e.value && (n = !0));
-			if (i === b.Call) return void (n = !0);
-			if (i !== b.Function) return;
+			if (i === N.Named) return void (void 0 === e.binding && (n = !0));
+			if (i === N.Prefix) return void ("@" === e.value && (n = !0));
+			if (i === N.Call) return void (n = !0);
+			if (i !== N.Function) return;
 			if (void 0 !== e.binder) return;
 			const s = t(e.value);
 			if (!s || !s.isBuiltIn()) return void (n = !0);
@@ -668,28 +668,28 @@ function $e(t) {
 	const r = (t) => {
 		t && (n === e.EmptyArray && (n = []), n.includes(t) || n.push(t));
 	}, i = (e) => {
-		"string" == typeof e && r(h(e)?.bookId);
+		"string" == typeof e && r(m(e)?.bookId);
 	};
-	return B(t, (e) => {
-		if (e.type === b.Named) {
+	return h(t, (e) => {
+		if (e.type === N.Named) {
 			if (e.binding) return;
 			const t = e.value;
 			r(t.nameId), i(t.scope);
-		} else if (e.type === b.TableReference) {
+		} else if (e.type === N.TableReference) {
 			const t = e.value;
 			r("string" == typeof t ? t : t?.tableId);
-		} else if (e.type === b.Cell) {
+		} else if (e.type === N.Cell) {
 			const t = e.value?.scope;
-			i(t), k(t) && r(t);
-		} else e.type === b.Error && i(e.value?.scope);
+			i(t), v(t) && r(t);
+		} else e.type === N.Error && i(e.value?.scope);
 	}), n;
 }
-var Be = (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;
-}, Oe = /* @__PURE__ */ new Set([
+}, Be = /* @__PURE__ */ new Set([
 	"IF",
 	"IFS",
 	"SWITCH",
@@ -708,18 +708,18 @@ var Be = (e, t) => {
 	if (!e) return !1;
 	const n = e.inputs;
 	switch (e.type) {
-		case b.Cell:
-		case b.Named:
-		case b.TableReference: return !0;
-		case b.Infix:
-		case b.Prefix:
-		case b.Postfix: return !0 === e.isReference && "@" !== e.value;
-		case b.Paren:
-		case b.List: return !!n && 1 === n.length && We(n[0], t);
-		case b.Function: {
+		case N.Cell:
+		case N.Named:
+		case N.TableReference: return !0;
+		case N.Infix:
+		case N.Prefix:
+		case N.Postfix: return !0 === e.isReference && "@" !== e.value;
+		case N.Paren:
+		case N.List: return !!n && 1 === n.length && We(n[0], t);
+		case N.Function: {
 			if (void 0 !== e.binder) return !1;
 			const i = String(e.value).toUpperCase();
-			if (Oe.has(i)) {
+			if (Be.has(i)) {
 				if (!n) return !1;
 				for (let e = 0; e < n.length; e++) if (We(n[e], t)) return !0;
 				return !1;
@@ -740,43 +740,43 @@ function Ue(e, t) {
 	let n;
 	const i = e.type, s = e.inputs;
 	switch (i) {
-		case b.Array:
+		case N.Array:
 			n = !0;
 			break;
-		case b.Cell: {
+		case N.Cell: {
 			const t = e.value;
 			n = t.rowIndex === Number.MIN_SAFE_INTEGER || t.colIndex === Number.MIN_SAFE_INTEGER;
 			break;
 		}
-		case b.Named:
-		case b.Call:
-		case b.TableReference:
+		case N.Named:
+		case N.Call:
+		case N.TableReference:
 			n = !0;
 			break;
-		case b.Infix:
-		case b.Prefix:
-		case b.Postfix:
+		case N.Infix:
+		case N.Prefix:
+		case N.Postfix:
 			n = e.isReference ? "@" !== e.value : Me(s, t);
 			break;
-		case b.Paren:
-		case b.List:
+		case N.Paren:
+		case N.List:
 			n = !s || 1 !== s.length || Ue(s[0], t);
 			break;
-		case b.Function: {
+		case N.Function: {
 			const i = e.binder;
 			if (void 0 !== i) {
 				n = "lambda" === i.kind || !!s && Ue(s[s.length - 1], t);
 				break;
 			}
 			const l = String(e.value).toUpperCase();
-			if (Oe.has(l)) {
+			if (Be.has(l)) {
 				n = Me(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 === b.Empty || r.isLiteral && 0 === r.value || Ue(r, t)) {
+					if (!r || r.type === N.Empty || r.isLiteral && 0 === r.value || Ue(r, t)) {
 						n = !0;
 						break;
 					}
@@ -804,17 +804,17 @@ function _e(e, t) {
 		const i = e.inputs;
 		if (!i) return;
 		const s = e.type;
-		if (s === b.Infix || s === b.Prefix || s === b.Postfix) {
+		if (s === N.Infix || s === N.Prefix || s === N.Postfix) {
 			const t = r && !e.isReference;
 			for (let e = 0; e < i.length; e++) n(i[e], t);
 			return;
 		}
-		if (s === b.Paren || s === b.List) {
+		if (s === N.Paren || s === N.List) {
 			const e = r && 1 === i.length;
 			for (let t = 0; t < i.length; t++) n(i[t], e);
 			return;
 		}
-		if (s === b.Function) {
+		if (s === N.Function) {
 			const s = e.binder;
 			if (void 0 !== s) {
 				const e = i.length - 1;
@@ -844,23 +844,23 @@ function He(e, t) {
 	if (!e || !t) return null;
 	const n = (e) => t(e.value)?.getName().toUpperCase() ?? null;
 	let r = !1;
-	if (B(e, (e) => {
-		(e.hasLazyArgs || e.type === b.Call || void 0 !== e.binder) && (r = !0);
+	if (h(e, (e) => {
+		(e.hasLazyArgs || e.type === N.Call || void 0 !== e.binder) && (r = !0);
 	}), r) return null;
-	const i = (e) => e.type === b.Number, s = (e) => e.type === b.Number || e.type === b.String || e.type === b.Boolean, l = (e) => {
+	const i = (e) => e.type === N.Number, s = (e) => e.type === N.Number || e.type === N.String || e.type === N.Boolean, l = (e) => {
 		if (!e) return !1;
 		const t = e.inputs;
 		switch (e.type) {
-			case b.Paren: return 1 === t?.length && l(t[0]);
-			case b.Prefix: return ("-" === e.value || "+" === e.value) && l(t?.[0]);
-			case b.Infix: {
+			case N.Paren: return 1 === t?.length && l(t[0]);
+			case N.Prefix: return ("-" === e.value || "+" === e.value) && l(t?.[0]);
+			case N.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 b.Function: {
+			case N.Function: {
 				const r = n(e);
-				if (null !== r && Ge.has(r)) return !t || 0 === t.length || 1 === t.length && t[0]?.type === b.Cell;
+				if (null !== r && Ge.has(r)) return !t || 0 === t.length || 1 === t.length && t[0]?.type === N.Cell;
 				if ("MOD" === r && 2 === t?.length) {
 					const e = t[1];
 					return l(t[0]) && i(e) && 0 !== e.value;
@@ -873,13 +873,13 @@ function He(e, t) {
 		if (!e) return !1;
 		const t = e.inputs;
 		switch (e.type) {
-			case b.Paren: return 1 === t?.length && o(t[0]);
-			case b.Infix: {
+			case N.Paren: return 1 === t?.length && o(t[0]);
+			case N.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 b.Function: {
+			case N.Function: {
 				const r = n(e);
 				if (!t || 0 === t.length) return !1;
 				if ("ISODD" === r || "ISEVEN" === r) return 1 === t.length && l(t[0]);
@@ -889,7 +889,7 @@ function He(e, t) {
 					for (let n = 0; n < t.length; n++) {
 						const r = t[n];
 						if (!r) return !1;
-						if (r.type !== b.Boolean) {
+						if (r.type !== N.Boolean) {
 							if (!o(r)) return !1;
 							e = !0;
 						}
@@ -913,7 +913,7 @@ function He(e, t) {
 	for (let t = 0; t < 1 << c; t++) {
 		const n = (e) => {
 			const r = a.indexOf(e);
-			if (-1 !== r) return v(t & 1 << r ? "TRUE" : "FALSE");
+			if (-1 !== r) return S(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;
 		};
@@ -923,8 +923,8 @@ function He(e, t) {
 }
 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 o, a, u = r;
-	u = me(u), i || (u = ye(u), u = Re(u), u = Ie(u), u = be(u)), [o, a] = function(e) {
+	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];
@@ -938,67 +938,67 @@ function Ke(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 = w(a), f = [], p = [], d = new de();
-	let g, v = !1;
+	}(c);
+	const f = T(u), d = [], g = [], v = new de();
+	let m, y = !1;
 	(function(e, t) {
 		if (!e || !t) return;
 		const n = (e) => {
 			if (!e) return;
-			e.inLazy = !0, e.type === b.Named && (e.deferredResolve = !0);
+			e.inLazy = !0, e.type === N.Named && (e.deferredResolve = !0);
 			const t = e.inputs;
 			if (t) for (let e = 0; e < t.length; e++) n(t[e]);
 		};
-		B(e, (e) => {
-			if (e.type !== b.Function) return;
+		h(e, (e) => {
+			if (e.type !== N.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 !== b.Empty && Le(i, t)?.isLazy() && (s.lazyArg = !0, e.hasLazyArgs = !0, n(s));
+				s && s.type !== N.Empty && Le(i, t)?.isLazy() && (s.lazyArg = !0, e.hasLazyArgs = !0, n(s));
 			}
 		});
-	})(o, l);
-	const h = (e) => {
-		void 0 === g && (g = /* @__PURE__ */ new Map());
-		let t = g.get(e);
-		return void 0 === t && g.set(e, t = []), t;
-	}, m = (e, t) => {
-		void 0 === e ? f.push(t) : h(e).push(t);
-	}, y = (e) => {
-		e?.type !== b.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;
+	}, b = (e, t) => {
+		void 0 === e ? d.push(t) : I(e).push(t);
+	}, x = (e) => {
+		e?.type !== N.Infix || "+" !== e.value && "-" !== e.value || (e.snapsCancellation = !0);
 	};
-	o = B(o, (t, n, r) => {
+	a = h(a, (t, n, r) => {
 		const i = t.type, s = t.evalIndex;
-		if (c[s] = null, i === b.TableColumn || i === b.TableSpecifier || t.isReference && pe(r, b.TableReference)) return;
-		if (v = v || !tt(t), t.binding?.declaration) return p[t.binding.slot] = -1, void (c[s] = void 0);
+		if (f[s] = null, i === N.TableColumn || i === N.TableSpecifier || t.isReference && pe(r, N.TableReference)) return;
+		if (y = y || !tt(t), t.binding?.declaration) return g[t.binding.slot] = -1, void (f[s] = void 0);
 		const l = ((e, t, n) => {
-			if (Be(e, t)) return e;
-			for (let e = n.length - 1; e >= 0; e--) if (Be(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 && h(t), void 0 !== l && i === b.Named && (t.deferredResolve = !0);
-		const o = t.binder;
-		if (o && "let" === o.kind) {
+		l === t && I(t), void 0 !== l && i === N.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 && (p[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 && (g[a.slots[r++]] = e[t + 1]?.evalIndex ?? -1);
 		}
-		if ((t.isReference || n && n.isReference) && (d.processNode(t, n), t.isReference)) {
-			if (i === b.Named) return void (void 0 !== l && m(l, t));
-			if (i === b.Cell || i === b.TableReference || i === b.Error) return;
-			if (i === b.Infix || i === b.Prefix || i === b.Postfix || i === b.List) return void m(l, t);
+		if ((t.isReference || n && n.isReference) && (v.processNode(t, n), t.isReference)) {
+			if (i === N.Named) return void (void 0 !== l && b(l, t));
+			if (i === N.Cell || i === N.TableReference || i === N.Error) return;
+			if (i === N.Infix || i === N.Prefix || i === N.Postfix || i === N.List) return void b(l, t);
 		}
-		if (t.isLiteral) if (i !== b.Array) c[s] = t.value;
+		if (t.isLiteral) if (i !== N.Array) f[s] = t.value;
 		else {
-			const n = t.value, r = n.length, i = w(r);
+			const n = t.value, r = n.length, i = T(r);
 			for (let e = 0; e < r; e++) {
-				const t = n[e].value, r = t.length, s = w(r);
+				const t = n[e].value, r = t.length, s = T(r);
 				for (let e = 0; e < r; e++) {
 					const n = t[e];
 					let r = null;
-					if (n && (r = n.type === b.Error ? C(n.value) : n.value, n.type === b.Prefix)) {
+					if (n && (r = n.type === N.Error ? p(n.value) : n.value, n.type === N.Prefix)) {
 						const e = n.value;
 						r = n.inputs[0].value, "-" === e && (r = -r);
 					}
@@ -1006,18 +1006,18 @@ function Ke(e, n, r, i = !1, s = null, l = null) {
 				}
 				i[e] = s;
 			}
-			const l = N(i);
-			c[s] = new F(e, l.values, l.coords, void 0, l.isLiteral);
+			const l = o(i);
+			f[s] = new V(e, l.values, l.coords, void 0, l.isLiteral);
 		}
 		else {
-			if (i !== b.Empty) return "lambda" === t.binder?.kind && y(t.inputs[t.inputs.length - 1]), m(l, t), t;
-			c[s] = void 0;
+			if (i !== N.Empty) return "lambda" === t.binder?.kind && x(t.inputs[t.inputs.length - 1]), b(l, t), t;
+			f[s] = void 0;
 		}
-	}), y(o), g?.forEach((e, t) => {
+	}), x(a), m?.forEach((e, t) => {
 		t.deferred = e;
 	});
-	const I = w(d.cells.size);
-	d.cells.forEach((e, t) => {
+	const R = T(v.cells.size);
+	v.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,
@@ -1028,29 +1028,29 @@ function Ke(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), I[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), R[e] = o;
 	});
-	const x = I.length, R = w(x);
-	for (let e = 0; e < x; e++) R[e] = {
+	const E = R.length, A = T(E);
+	for (let e = 0; e < E; e++) A[e] = {
 		colStart: 0,
 		rowStart: 0,
 		colEnd: 0,
 		rowEnd: 0,
 		scope: null
 	};
-	const E = w(d.references.size);
-	d.references.forEach((e) => {
-		E[e.index] = e;
+	const S = T(v.references.size);
+	v.references.forEach((e) => {
+		S[e.index] = e;
 	});
-	const S = [];
-	d.rootReferences.forEach((e) => {
-		S.push(e.index);
+	const w = [];
+	v.rootReferences.forEach((e) => {
+		w.push(e.index);
 	}), function(e, t, n = !1) {
 		if (n) {
 			const t = (e) => {
 				if (!e) return;
 				const n = e.type;
-				n !== b.Function && n !== b.Call || (e.implicitIntersect = !0);
+				n !== N.Function && n !== N.Call || (e.implicitIntersect = !0);
 				const r = e.inputs;
 				if (r) for (let e = 0; e < r.length; e++) t(r[e]);
 			};
@@ -1060,15 +1060,15 @@ function Ke(e, n, r, i = !1, s = null, l = null) {
 		const r = (e) => Ue(e, t), i = (e, n) => {
 			if (!e) return;
 			const s = e.type;
-			s !== b.Function && s !== b.Call || (e.implicitIntersect = n);
+			s !== N.Function && s !== N.Call || (e.implicitIntersect = n);
 			const l = e.inputs;
 			if (l) {
-				if (s === b.Infix || s === b.Prefix || s === b.Postfix) {
+				if (s === N.Infix || s === N.Prefix || s === N.Postfix) {
 					const t = !e.isReference;
 					for (let e = 0; e < l.length; e++) i(l[e], (!t || !r(l[e])) && n);
 					return;
 				}
-				if (s === b.Function) {
+				if (s === N.Function) {
 					const r = e.binder;
 					if (void 0 !== r) {
 						const e = "lambda" !== r.kind && n;
@@ -1091,54 +1091,54 @@ function Ke(e, n, r, i = !1, s = null, l = null) {
 			}
 		};
 		i(e, !r(e));
-	}(o, l, !0 === r.legacyIntersect);
-	const P = (e) => {
+	}(a, l, !0 === r.legacyIntersect);
+	const C = (e) => {
 		const t = e.length;
 		for (let n = 0; n < t; n++) {
 			const t = e[n], r = t.type;
-			if (r === b.Infix) {
+			if (r === N.Infix) {
 				if (!0 === t.snapsCancellation) {
 					t.fn = ue[t.value];
 					continue;
 				}
 				t.fn = ae[t.value];
-			} else r === b.Prefix ? t.fn = ce[t.value] : r === b.Postfix && (t.fn = fe[t.value]);
+			} else r === N.Prefix ? t.fn = ce[t.value] : r === N.Postfix && (t.fn = fe[t.value]);
 		}
 	};
-	let k;
-	P(f), g?.forEach(P);
-	const L = i ? T(t(e.getLocale()).decimal) : A, $ = {
+	let P;
+	C(d), m?.forEach(C);
+	const k = i ? F(t(e.getLocale()).decimal) : $, L = {
 		runtime: e,
 		symbols: n,
 		getFunction: l,
-		ast: o,
-		evaluations: c,
-		executions: f,
-		bindings: p,
-		referencesAbsolute: R,
-		referencesExecute: E,
-		referencesRelative: I,
-		referencesRoot: S,
-		referenceIndices: d.referenceIndices,
-		formatReferenceIndices: Te(o, l),
-		getTokens: () => k ??= ge(o, i, L),
-		namedIds: Ee(o),
-		symbolIds: $e(o),
-		hasTotals: we(o, l),
-		hasPivotData: Ce(o, l, Se),
-		hasDataTable: Ne(o, l),
-		hasVolatile: Fe(o, l),
-		...ke(o, l),
-		isReferenceOnly: !v,
+		ast: a,
+		evaluations: f,
+		executions: d,
+		bindings: g,
+		referencesAbsolute: A,
+		referencesExecute: S,
+		referencesRelative: R,
+		referencesRoot: w,
+		referenceIndices: v.referenceIndices,
+		formatReferenceIndices: Te(a, l),
+		getTokens: () => P ??= 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),
+		...ke(a, l),
+		isReferenceOnly: !y,
 		error: s,
 		transform: (t) => {
-			let r = B(o, t);
-			return r === o ? $ : Ke(e, n, r, i, s, l);
+			let r = h(a, t);
+			return r === a ? L : Ke(e, n, r, i, s, l);
 		}
 	};
-	return $;
+	return L;
 }
-function Je(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,
@@ -1169,29 +1169,29 @@ Object.freeze([
 		">="
 	]
 ]);
-var Ze = Object.freeze([
+var qe = Object.freeze([
 	":",
 	".:.",
 	".:",
 	":."
-]), qe = Object.freeze([
+]), Je = Object.freeze([
 	":",
 	" ",
 	".:.",
 	".:",
 	":."
-]), Ye = Object.freeze(["@"]), Qe = Object.freeze(["#"]), et = Object.freeze(qe.concat(Qe)), tt = (Object.freeze(qe.concat(Ye).concat(Qe)), (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 === b.Cell) return !0;
-	if (t === b.TableReference) return !0;
-	if (t === b.Infix) {
-		if (!qe.includes(e.value)) return !1;
+	if (t === N.Cell) return !0;
+	if (t === N.TableReference) return !0;
+	if (t === N.Infix) {
+		if (!Je.includes(e.value)) return !1;
 		const t = e.inputs, n = t[0], r = t[1];
 		return tt(n) && tt(r);
 	}
-	return t === b.List && (e.inputs?.every(tt) ?? !1);
-}), nt = (e) => !!(e && (e.type === b.Infix && et.includes(e.value) || e.type === b.Postfix && Qe.includes(e.value) || e.type === b.Array || e.type === b.TableReference)), rt = Object.freeze([
+	return t === N.List && (e.inputs?.every(tt) ?? !1);
+}), nt = (e) => !!(e && (e.type === N.Infix && et.includes(e.value) || e.type === N.Postfix && Ye.includes(e.value) || e.type === N.Array || e.type === N.TableReference)), rt = Object.freeze([
 	"+",
 	"-",
 	"*",
@@ -1207,15 +1207,15 @@ var Ze = Object.freeze([
 ]), it = Object.freeze(["-", "+"]), st = (e, t) => {
 	if (!e) return !1;
 	const n = e.type;
-	if (e.isLiteral) return n !== b.Error;
-	if (n === b.Paren || n === b.List) {
+	if (e.isLiteral) return n !== N.Error;
+	if (n === N.Paren || n === N.List) {
 		const n = e.inputs;
 		return !(!n || 0 === n.length) && n.every((e) => st(e, t));
 	}
-	if (n === b.Infix) return rt.includes(e.value);
-	if (n === b.Prefix) return it.includes(e.value);
-	if (n === b.Postfix) return "%" === e.value;
-	if (n === b.Function) {
+	if (n === N.Infix) return rt.includes(e.value);
+	if (n === N.Prefix) return it.includes(e.value);
+	if (n === N.Postfix) return "%" === e.value;
+	if (n === N.Function) {
 		if (!t) return !1;
 		const n = t(e.value);
 		if (!n) return !1;
@@ -1228,7 +1228,7 @@ var Ze = Object.freeze([
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === b.Infix && " " === e.value) {
+		if (e.type === N.Infix && " " === e.value) {
 			const r = e.inputs, i = r?.[0], s = r?.[1];
 			if (st(i, t)) return void (n = i);
 			if (st(s, t)) return void (n = s);
@@ -1242,7 +1242,7 @@ var Ze = Object.freeze([
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === b.Postfix && "#" === e.value) {
+		if (e.type === N.Postfix && "#" === e.value) {
 			const r = e.inputs?.[0];
 			if (r && st(r, t)) return void (n = r);
 		}
@@ -1283,7 +1283,7 @@ var Ze = Object.freeze([
 	let t = null;
 	const n = (e) => {
 		if (t || !e) return;
-		if (e.type === b.Array && Array.isArray(e.value)) {
+		if (e.type === N.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;
@@ -1299,7 +1299,7 @@ var Ze = Object.freeze([
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === b.Function) {
+		if (e.type === N.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();
@@ -1326,7 +1326,7 @@ var Ze = Object.freeze([
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === b.Function) {
+		if (e.type === N.Function) {
 			const r = t(e.value);
 			if (r) {
 				const i = r.getDeclaration().getParameters(), s = e.inputs;
@@ -1363,7 +1363,7 @@ var Ze = Object.freeze([
 	let n = null;
 	const r = (e) => {
 		if (n || !e) return;
-		if (e.type === b.Call) {
+		if (e.type === N.Call) {
 			const r = e.inputs?.[0];
 			if (r && st(r, t)) return void (n = "This expression always produces a value, so it cannot be called as a function.");
 		}
@@ -1372,28 +1372,28 @@ var Ze = Object.freeze([
 	};
 	return r(e), n;
 }, gt = (e, t) => {
-	if (e.type !== b.Function) return;
+	if (e.type !== N.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;
 }, vt = (e) => {
-	if (e?.type !== b.Named) return;
+	if (e?.type !== N.Named) return;
 	const t = e.value;
 	return t?.nameId && !t.scope && !0 !== t.optional ? t.nameId : void 0;
 }, ht = /^[A-Za-z_\\][A-Za-z0-9_\\]*$/, mt = /* @__PURE__ */ new Set(["TRUE", "FALSE"]), yt = (e) => {
-	if (e?.type === b.Named) {
+	if (e?.type === N.Named) {
 		const t = e.value;
 		if (!0 !== t?.optional || !t.nameId || t.scope) return;
 		return t.nameId;
 	}
-	if (e?.type !== b.TableReference) return;
+	if (e?.type !== N.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 !== b.TableColumn) return;
+		if (!r || 1 !== r.length || r[0]?.type !== N.TableColumn) return;
 		const i = r[0].value;
 		if ("string" != typeof i) return;
 		n = i;
@@ -1405,10 +1405,10 @@ var Ze = Object.freeze([
 	}
 	return ht.test(n) && !mt.has(n.toUpperCase()) && e.image === `[${n}]` ? n : void 0;
 }, It = (e) => {
-	const t = P(e.image ?? e.value);
+	const t = c(e.image ?? e.value);
 	t.image = e.image ?? e.value, t.wsBefore = e.wsBefore;
 	const n = {
-		type: b.Call,
+		type: N.Call,
 		value: null,
 		inputs: [t, ...e.inputs ?? []],
 		wsAfter: e.wsAfter
@@ -1416,8 +1416,8 @@ var Ze = Object.freeze([
 	return e.error && (n.error = e.error), n;
 };
 function bt(e, t) {
-	return e && t ? B(e, (e) => {
-		if (e.type === b.Function && "string" == typeof e.value && !t(e.value)) return It(e);
+	return e && t ? h(e, (e) => {
+		if (e.type === N.Function && "string" == typeof e.value && !t(e.value)) return It(e);
 	}) : e;
 }
 function xt(e, t) {
@@ -1425,7 +1425,7 @@ function xt(e, t) {
 	return r.push(t), r;
 }
 function Rt(e) {
-	if (e?.type !== b.Function || "lambda" !== e.binder?.kind) return;
+	if (e?.type !== N.Function || "lambda" !== e.binder?.kind) return;
 	const t = e.inputs ?? [], n = [];
 	for (let e = 0; e < t.length - 1; e++) {
 		const r = t[e];
@@ -1444,7 +1444,7 @@ var Et = /* @__PURE__ */ new Set([
 	"IFNA"
 ]);
 function Tt(e, t) {
-	if (!e || e.type !== b.Function || "string" != typeof e.value) return e;
+	if (!e || e.type !== N.Function || "string" != typeof e.value) return e;
 	const n = (t?.(e.value)?.getName() ?? e.value).toUpperCase();
 	if (!Et.has(n)) return e;
 	const r = e.inputs;
@@ -1497,7 +1497,7 @@ function At(e, t = null) {
 					name: s
 				}), c.push(o), f[e] = l ? {
 					...i,
-					type: b.Named,
+					type: N.Named,
 					value: {
 						nameId: s,
 						scope: null
@@ -1535,7 +1535,7 @@ function At(e, t = null) {
 				}
 			};
 		})(e, l);
-		if (e.type === b.Function && "string" == typeof e.value) {
+		if (e.type === N.Function && "string" == typeof e.value) {
 			const r = e.value.toUpperCase();
 			if (n.some((e) => e.key === r) && !t?.(e.value)) return i(It(e));
 		}
@@ -1549,7 +1549,7 @@ function At(e, t = null) {
 				});
 			}
 		}
-		if (e.type === b.Named) {
+		if (e.type === N.Named) {
 			const t = vt(e);
 			if (void 0 !== t) {
 				const r = t.toUpperCase();
@@ -1569,7 +1569,7 @@ function At(e, t = null) {
 			return e;
 		}
 		const o = i(e);
-		if (o.type === b.Function && "string" == typeof o.value && "ISOMITTED" === (t?.(o.value)?.getName() ?? o.value).toUpperCase()) {
+		if (o.type === N.Function && "string" == typeof o.value && "ISOMITTED" === (t?.(o.value)?.getName() ?? o.value).toUpperCase()) {
 			const e = o.inputs;
 			if (e) {
 				let n;
@@ -1596,13 +1596,13 @@ function At(e, t = null) {
 	return s(e);
 }
 var St = (e) => {
-	if (e?.type !== b.Cell || void 0 === e.image) return !1;
+	if (e?.type !== N.Cell || void 0 === e.image) return !1;
 	const t = e.value;
 	return t.rowIndex === Number.MIN_SAFE_INTEGER && !0 !== t.$colIndex && !t.scope;
 }, wt = (e) => {
-	const t = P(e.image);
-	return V(t, e), t;
-}, Ct = (e) => e?.type === b.Cell, Nt = (e, t = null) => {
+	const t = c(e.image);
+	return C(t, e), t;
+}, Ct = (e) => e?.type === N.Cell, Nt = (e, t = null) => {
 	if (!e) return e;
 	let n = !1;
 	const r = (e) => {
@@ -1616,13 +1616,13 @@ var St = (e) => {
 	};
 	if (r(e), !n) return e;
 	let i = null;
-	const s = B(e, (e) => {
-		if (e?.type !== b.Cell) return;
+	const s = h(e, (e) => {
+		if (e?.type !== N.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 = P(n);
-		V(r, e);
+		const r = c(n);
+		C(r, e);
 		const s = t?.scope;
 		return s && (r.value.scope = s, r.value.scopeImage = t.scopeImage), r;
 	});
@@ -1637,7 +1637,7 @@ var St = (e) => {
 			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 === b.Empty) return void (n = "LAMBDA has no calculation: the last argument is empty.");
+			if ("lambda" === t && i[s - 1]?.type === N.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) {
@@ -1659,64 +1659,64 @@ var St = (e) => {
 function Pt(e, t, n, r, i) {
 	const s = r;
 	let l;
-	const o = () => (void 0 === l && (l = i && n ? t.bind(a.Table, "", { at: {
+	const o = () => (void 0 === l && (l = i && n ? t.bind(B.Table, "", { at: {
 		scope: n,
 		rowIndex: i.rowIndex,
 		colIndex: i.colIndex
 	} }) : null), l);
-	return B(e, (e, r, i = []) => {
+	return h(e, (e, r, i = []) => {
 		let l;
-		const u = e.type;
-		if (u === b.Cell) {
+		const a = e.type;
+		if (a === N.Cell) {
 			const n = e.value;
 			if (n?.scope) {
-				const r = t.bind(a.Sheet, n.scope, s);
+				const r = t.bind(B.Sheet, n.scope, s);
 				null !== r && (l || (l = { ...e }), l.value = {
 					...n,
 					scope: r
 				});
 			}
-		} else if (u === b.Named) {
+		} else if (a === N.Named) {
 			const r = e.value;
 			if (r && !e.binding) {
 				const i = function(e, t, n, r) {
 					if (t.scope) {
-						const e = n.bind(a.Sheet, t.scope, r);
-						if (null === e || x(e)) return;
+						const e = n.bind(B.Sheet, t.scope, r);
+						if (null === e || E(e)) return;
 					}
-					const i = n.bind(a.Table, t.nameId, { existing: !0 });
+					const i = n.bind(B.Table, t.nameId, { existing: !0 });
 					if (null === i) return;
 					const s = {
-						type: b.TableReference,
+						type: N.TableReference,
 						value: i,
 						inputs: null,
 						isReference: !0
 					};
-					V(s, e);
+					C(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(a.Sheet, r.scope, s) : null, u = (null !== o ? x(o) ? o : t.resolve(a.Sheet, o)?.toString() ?? r.scope : r.scope) ?? n, c = t.bind(a.NamedFormula, r.nameId, u ? { scope: u } : void 0);
-				null === c && null === o || (l || (l = { ...e }), l.value = {
+				const o = r.scope ? t.bind(B.Sheet, r.scope, s) : null, a = (null !== o ? E(o) ? o : t.resolve(B.Sheet, o)?.toString() ?? r.scope : r.scope) ?? n, u = t.bind(B.NamedFormula, r.nameId, a ? { scope: a } : void 0);
+				null === u && null === o || (l || (l = { ...e }), l.value = {
 					...r,
-					nameId: c ?? r.nameId,
+					nameId: u ?? r.nameId,
 					...null !== o ? { scope: o } : void 0
 				});
 			}
-		} else if (u === b.Error) {
+		} else if (a === N.Error) {
 			const n = e.value;
 			if (n?.scope) {
-				const r = t.bind(a.Sheet, n.scope, s);
+				const r = t.bind(B.Sheet, n.scope, s);
 				null !== r && (l || (l = { ...e }), l.value = {
 					...n,
 					scope: r
 				});
 			}
-		} else if (u === b.TableReference) {
+		} else if (a === N.TableReference) {
 			const n = e.value;
 			if (n) {
-				const r = t.bind(a.Table, n);
+				const r = t.bind(B.Table, n);
 				l || (l = { ...e }), null !== r && (l.value = r);
 			} else if ("string" == typeof n) {
 				const n = o();
@@ -1725,16 +1725,16 @@ function Pt(e, t, n, r, i) {
 					value: n
 				};
 			}
-		} else if (u === b.TableColumn) {
+		} else if (a === N.TableColumn) {
 			const n = e.value;
 			if (n) {
-				const r = pe(i, b.TableReference), s = r?.value || (r ? o() ?? void 0 : void 0), u = t.bind(a.TableColumn, n, s ? { tableName: s } : void 0);
-				l || (l = { ...e }), null !== u && (l.value = u);
+				const r = pe(i, N.TableReference), s = r?.value || (r ? o() ?? void 0 : void 0), a = t.bind(B.TableColumn, n, s ? { tableName: s } : void 0);
+				l || (l = { ...e }), null !== a && (l.value = a);
 			}
-		} else if (u === b.Function) {
+		} else if (a === N.Function) {
 			const n = e.value;
 			if (n) {
-				const r = t.bind(a.Function, n);
+				const r = t.bind(B.Function, n);
 				l || (l = { ...e }), null !== r && (l.value = r);
 			}
 		}
@@ -1745,20 +1745,20 @@ function kt(e, t) {
 	let n = !0;
 	const r = e.inputs;
 	if (!r) return !0;
-	for (let e = 0; e < r.length && n; e++) B(r[e], (e) => {
-		e.type === b.TableColumn && null === t.resolve(a.TableColumn, e.value) && (n = !1);
+	for (let e = 0; e < r.length && n; e++) h(r[e], (e) => {
+		e.type === N.TableColumn && null === t.resolve(B.TableColumn, e.value) && (n = !1);
 	});
 	return n;
 }
 function Lt(e, t) {
 	let n = null;
-	return B(e, (e) => {
-		if (n || e.type !== b.TableReference) return;
+	return h(e, (e) => {
+		if (n || e.type !== N.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(a.Table, r)?.toString() ?? r;
-		null === t.bind(a.Table, i, { existing: !0 }) ? n = `There is no table named '${i}'.` : kt(e, t) || (n = "The table has no such column.");
+		const i = t.resolve(B.Table, r)?.toString() ?? r;
+		null === t.bind(B.Table, i, { existing: !0 }) ? n = `There is no table named '${i}'.` : kt(e, t) || (n = "The table has no such column.");
 	}), n;
 }
-export { xt as A, nt as C, lt as D, Ze 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, Je 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, Lt as x, ge 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, Lt as x, ge as y };