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

package/assets/{qc7rA-Z3a4rkVQPx.js → LQNEL4KjDxwZNwWq.js}

@@ -1,11 +1,11 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.24
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.25
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { u as e } from "./DRzZ4bEyLRGVOLzV.js";
-import { At as t, Cn as n, Cr as i, Ea as r, Ha as s, Hi as o, Ht as a, Jt as c, Kr as h, Qa as l, Rt as u, T as d, Xn as p, Yi as f, _r as m, ba as E, dr as T, gt as g, ji as O, lt as A, m as R, ma as I, nr as _, pi as N, s as L, t as S, ta as C, tt as y, ui as k, vi as v } from "./C9iFJ52KwQTePQ81.js";
+import { u as e } from "./CCOaNx5_BfWCc9yz.js";
+import { Bt as t, Dr as n, Ei as i, Ft as r, Gt as s, Li as o, Ma as a, Ot as c, Qr as h, Sn as l, Ta as u, Yi as d, Zn as p, _i as f, ba as m, ca as E, eo as T, et as g, ht as O, ir as A, lt as R, mr as I, p as _, qa as N, s as L, t as S, ta as C, w as y, xi as k, xr as v } from "./ckvxz2tZRlY1UPpg.js";
 function x(e) {
 	console && console.error && console.error(`Error: ${e}`);
 }
@@ -92,7 +92,7 @@ var U = class {
 	constructor(e) {
 		super(e.definition), this.idx = 1, this.ignoreAmbiguities = !1, this.hasPredicates = !1, Object.assign(this, Y(e));
 	}
-}, H = class {
+}, V = class {
 	constructor(e) {
 		this.idx = 1, Object.assign(this, Y(e));
 	}
@@ -100,9 +100,9 @@ var U = class {
 		e.visit(this);
 	}
 };
-function V(e) {
+function H(e) {
 	function t(e) {
-		return e.map(V);
+		return e.map(H);
 	}
 	if (e instanceof w) {
 		const t = {
@@ -129,13 +129,13 @@ function V(e) {
 	if (e instanceof j) return {
 		type: "RepetitionMandatoryWithSeparator",
 		idx: e.idx,
-		separator: V(new H({ terminalType: e.separator })),
+		separator: H(new V({ terminalType: e.separator })),
 		definition: t(e.definition)
 	};
 	if (e instanceof K) return {
 		type: "RepetitionWithSeparator",
 		idx: e.idx,
-		separator: V(new H({ terminalType: e.separator })),
+		separator: H(new V({ terminalType: e.separator })),
 		definition: t(e.definition)
 	};
 	if (e instanceof G) return {
@@ -148,7 +148,7 @@ function V(e) {
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof H) {
+	if (e instanceof V) {
 		const t = {
 			type: "Terminal",
 			name: e.terminalType.name,
@@ -183,7 +183,7 @@ var z = class {
 			case K: return this.visitRepetitionWithSeparator(t);
 			case G: return this.visitRepetition(t);
 			case W: return this.visitAlternation(t);
-			case H: return this.visitTerminal(t);
+			case V: return this.visitTerminal(t);
 			case F: return this.visitRule(t);
 			default: throw Error("non exhaustive match");
 		}
@@ -210,7 +210,7 @@ function q(e) {
 	if (e instanceof j) return "AT_LEAST_ONE_SEP";
 	if (e instanceof K) return "MANY_SEP";
 	if (e instanceof G) return "MANY";
-	if (e instanceof H) return "CONSUME";
+	if (e instanceof V) return "CONSUME";
 	throw Error("non exhaustive match");
 }
 var Q = class {
@@ -218,7 +218,7 @@ var Q = class {
 		e.definition.forEach((n, i) => {
 			const r = e.definition.slice(i + 1);
 			if (n instanceof w) this.walkProdRef(n, r, t);
-			else if (n instanceof H) this.walkTerminal(n, r, t);
+			else if (n instanceof V) this.walkTerminal(n, r, t);
 			else if (n instanceof D) this.walkFlat(n, r, t);
 			else if (n instanceof B) this.walkOption(n, r, t);
 			else if (n instanceof $) this.walkAtLeastOne(n, r, t);
@@ -266,13 +266,13 @@ var Q = class {
 	}
 };
 function Z(e, t, n) {
-	return [new B({ definition: [new H({ terminalType: e.separator })].concat(e.definition) })].concat(t, n);
+	return [new B({ definition: [new V({ terminalType: e.separator })].concat(e.definition) })].concat(t, n);
 }
 function J(e) {
 	if (e instanceof w) return J(e.referencedRule);
-	if (e instanceof H) return [e.terminalType];
+	if (e instanceof V) return [e.terminalType];
 	if (function(e) {
-		return e instanceof D || e instanceof B || e instanceof G || e instanceof $ || e instanceof j || e instanceof K || e instanceof H || e instanceof F;
+		return e instanceof D || e instanceof B || e instanceof G || e instanceof $ || e instanceof j || e instanceof K || e instanceof V || e instanceof F;
 	}(e)) return function(e) {
 		let t = [];
 		const n = e.definition;
@@ -1508,7 +1508,7 @@ function Ke(e, t) {
 function We(e, t) {
 	return e.tokenTypeIdx === t.tokenTypeIdx;
 }
-var He = 1, Ve = {};
+var Ve = 1, He = {};
 function Ye(e) {
 	const t = function(e) {
 		let t = [...e], n = e, i = !0;
@@ -1522,7 +1522,7 @@ function Ye(e) {
 	(function(e) {
 		e.forEach((e) => {
 			var t;
-			Xe(e) || (Ve[He] = e, e.tokenTypeIdx = He++), qe(e) && !Array.isArray(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), qe(e) || (e.CATEGORIES = []), t = e, Object.hasOwn(null != t ? t : {}, "categoryMatches") || (e.categoryMatches = []), function(e) {
+			Xe(e) || (He[Ve] = e, e.tokenTypeIdx = Ve++), qe(e) && !Array.isArray(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), qe(e) || (e.CATEGORIES = []), t = e, Object.hasOwn(null != t ? t : {}, "categoryMatches") || (e.categoryMatches = []), function(e) {
 				return Object.hasOwn(null != e ? e : {}, "categoryMatchesMap");
 			}(e) || (e.categoryMatchesMap = {});
 		});
@@ -1533,7 +1533,7 @@ function Ye(e) {
 	}(t), function(e) {
 		e.forEach((e) => {
 			e.categoryMatches = [], Object.keys(e.categoryMatchesMap).forEach((t) => {
-				e.categoryMatches.push(Ve[t].tokenTypeIdx);
+				e.categoryMatches.push(He[t].tokenTypeIdx);
 			});
 		});
 	}(t), t.forEach((e) => {
@@ -1946,7 +1946,7 @@ var Et = {
 Object.freeze(Et);
 var Tt = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a rule which is not defined: ->" + t.nonTerminalName + "<-\ninside top level rule: ->" + e.name + "<-" }, gt = {
 	buildDuplicateFoundError(e, t) {
-		const n = e.name, i = t[0], r = i.idx, s = q(i), o = (a = i) instanceof H ? a.terminalType.name : a instanceof w ? a.nonTerminalName : "";
+		const n = e.name, i = t[0], r = i.idx, s = q(i), o = (a = i) instanceof V ? a.terminalType.name : a instanceof w ? a.nonTerminalName : "";
 		var a;
 		let c = `->${s}${r > 0 ? r : ""}<- ${o ? `with argument: ->${o}<-` : ""}\n                  appears more than once (${t.length} times) in the top level rule: ->${n}<-.                  \n                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES \n                  `;
 		return c = c.replace(/[ \t]+/g, " "), c = c.replace(/\s\s+/g, "\n"), c;
@@ -2047,28 +2047,28 @@ var Ot, At = class extends z {
 	walkMany(e, t, n) {
 		if (e.idx === this.occurrence) {
 			const e = t.concat(n)[0];
-			this.result.isEndOfRule = void 0 === e, e instanceof H && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = void 0 === e, e instanceof V && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkMany(e, t, n);
 	}
 }, Lt = class extends _t {
 	walkManySep(e, t, n) {
 		if (e.idx === this.occurrence) {
 			const e = t.concat(n)[0];
-			this.result.isEndOfRule = void 0 === e, e instanceof H && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = void 0 === e, e instanceof V && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkManySep(e, t, n);
 	}
 }, St = class extends _t {
 	walkAtLeastOne(e, t, n) {
 		if (e.idx === this.occurrence) {
 			const e = t.concat(n)[0];
-			this.result.isEndOfRule = void 0 === e, e instanceof H && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = void 0 === e, e instanceof V && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkAtLeastOne(e, t, n);
 	}
 }, Ct = class extends _t {
 	walkAtLeastOneSep(e, t, n) {
 		if (e.idx === this.occurrence) {
 			const e = t.concat(n)[0];
-			this.result.isEndOfRule = void 0 === e, e instanceof H && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = void 0 === e, e instanceof V && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkAtLeastOneSep(e, t, n);
 	}
 };
@@ -2086,14 +2086,14 @@ function yt(e, t, n = []) {
 		if (t instanceof B) i = s(t.definition);
 		else {
 			if (t instanceof $) return s(t.definition.concat([new G({ definition: t.definition })]));
-			if (t instanceof j) return s([new D({ definition: t.definition }), new G({ definition: [new H({ terminalType: t.separator })].concat(t.definition) })]);
-			if (t instanceof K) i = s(t.definition.concat([new G({ definition: [new H({ terminalType: t.separator })].concat(t.definition) })]));
+			if (t instanceof j) return s([new D({ definition: t.definition }), new G({ definition: [new V({ terminalType: t.separator })].concat(t.definition) })]);
+			if (t instanceof K) i = s(t.definition.concat([new G({ definition: [new V({ terminalType: t.separator })].concat(t.definition) })]));
 			else if (t instanceof G) i = s(t.definition.concat([new G({ definition: t.definition })]));
 			else {
 				if (t instanceof W) return t.definition.forEach((e) => {
 					0 !== e.definition.length && (i = s(e.definition));
 				}), i;
-				if (!(t instanceof H)) throw Error("non exhaustive match");
+				if (!(t instanceof V)) throw Error("non exhaustive match");
 				n.push(t.terminalType);
 			}
 		}
@@ -2338,7 +2338,7 @@ function Gt(e) {
 }
 function Kt(e, t, n, i) {
 	const r = e.flatMap((e) => function(e, t) {
-		const n = new Vt();
+		const n = new Ht();
 		e.accept(n);
 		const i = n.allProductions, r = Object.groupBy(i, Wt), s = Object.fromEntries(Object.entries(r).filter(([e, t]) => t.length > 1));
 		return Object.values(s).map((n) => {
@@ -2348,7 +2348,7 @@ function Kt(e, t, n, i) {
 				ruleName: e.name,
 				dslName: s,
 				occurrence: i.idx
-			}, a = Ht(i);
+			}, a = Vt(i);
 			return a && (o.parameter = a), o;
 		});
 	}(e, n)), s = function(e, t, n) {
@@ -2393,12 +2393,12 @@ function Kt(e, t, n, i) {
 	return r.concat(s, o, a);
 }
 function Wt(e) {
-	return `${q(e)}_#_${e.idx}_#_${Ht(e)}`;
+	return `${q(e)}_#_${e.idx}_#_${Vt(e)}`;
 }
-function Ht(e) {
-	return e instanceof H ? e.terminalType.name : e instanceof w ? e.nonTerminalName : "";
+function Vt(e) {
+	return e instanceof V ? e.terminalType.name : e instanceof w ? e.nonTerminalName : "";
 }
-var Vt = class extends z {
+var Ht = class extends z {
 	constructor() {
 		super(...arguments), this.allProductions = [];
 	}
@@ -2454,7 +2454,7 @@ function zt(e) {
 	if (n instanceof w) t.push(n.referencedRule);
 	else if (n instanceof D || n instanceof B || n instanceof $ || n instanceof j || n instanceof K || n instanceof G) t = t.concat(zt(n.definition));
 	else if (n instanceof W) t = n.definition.map((e) => zt(e.definition)).flat();
-	else if (!(n instanceof H)) throw Error("non exhaustive match");
+	else if (!(n instanceof V)) throw Error("non exhaustive match");
 	const i = X(n), r = e.length > 1;
 	if (i && r) {
 		const n = e.slice(1);
@@ -2498,7 +2498,7 @@ function qt(e, t) {
 					occurrenceStack: f.slice(0, -1)
 				};
 				u.push(e);
-			} else if (m instanceof H) if (d < c - 1) {
+			} else if (m instanceof V) if (d < c - 1) {
 				const e = d + 1;
 				if (n(t[e], m.terminalType)) {
 					const t = {
@@ -2558,7 +2558,7 @@ function qt(e, t) {
 				u.push(t);
 			} else if (m instanceof j) {
 				const t = new G({
-					definition: [new H({ terminalType: m.separator })].concat(m.definition),
+					definition: [new V({ terminalType: m.separator })].concat(m.definition),
 					idx: m.idx
 				}), n = {
 					idx: d,
@@ -2576,7 +2576,7 @@ function qt(e, t) {
 				};
 				u.push(e), u.push(o);
 				const n = new G({
-					definition: [new H({ terminalType: m.separator })].concat(m.definition),
+					definition: [new V({ terminalType: m.separator })].concat(m.definition),
 					idx: m.idx
 				}), r = {
 					idx: d,
@@ -3990,7 +3990,7 @@ $n.DEFER_DEFINITION_ERRORS_HANDLING = !1, Bn = $n, [
 			return this.gastProductionsCache;
 		}
 		getSerializedGastProductions() {
-			return Object.values(this.gastProductionsCache).map(V);
+			return Object.values(this.gastProductionsCache).map(H);
 		}
 	},
 	class {
@@ -4145,7 +4145,7 @@ $n.DEFER_DEFINITION_ERRORS_HANDLING = !1, Bn = $n, [
 				const n = /* @__PURE__ */ new Error(`<CONSUME${Mn(t)}> argument is invalid expecting a TokenType reference but got: <${JSON.stringify(e)}>\n inside top level rule: <${this.recordingProdStack[0].name}>`);
 				throw n.KNOWN_RECORDER_ERROR = !0, n;
 			}
-			const i = this.recordingProdStack.at(-1), r = new H({
+			const i = this.recordingProdStack.at(-1), r = new V({
 				idx: t,
 				terminalType: e,
 				label: null == n ? void 0 : n.LABEL
@@ -4187,21 +4187,21 @@ var jn = class extends $n {
 	}
 }, Gn = class t {
 	static shared(e) {
-		const n = e?.locale ?? s, i = e?.maxColumn ?? Vn, r = e?.maxRow ?? Yn;
-		let o = Hn.get(n);
-		o || (o = /* @__PURE__ */ new Map(), Hn.set(n, o));
-		const a = `${i}:${r}`;
-		let c = o.get(a);
-		return c || (c = new t({
+		const n = e?.locale ?? N, i = e?.maxColumn ?? Hn, r = e?.maxRow ?? Yn;
+		let s = Vn.get(n);
+		s || (s = /* @__PURE__ */ new Map(), Vn.set(n, s));
+		const o = `${i}:${r}`;
+		let a = s.get(o);
+		return a || (a = new t({
 			locale: n,
 			maxColumn: i,
 			maxRow: r
-		}), o.set(a, c)), c;
+		}), s.set(o, a)), a;
 	}
 	constructor(e) {
-		const t = e?.maxColumn ?? Vn, n = e?.maxRow ?? Yn, i = e?.locale ?? s;
-		this._locale = i, this._maxColumn = t, this._maxRow = n;
-		const { separatorFunction: r, separatorColumn: o, separatorRow: a, separatorDecimal: c } = i.separators;
+		const t = e?.maxColumn ?? Hn, n = e?.maxRow ?? Yn, r = e?.locale ?? N;
+		this._locale = r, this._maxColumn = t, this._maxRow = n;
+		const { separatorFunction: s, separatorColumn: o, separatorRow: a, separatorDecimal: c } = r.separators;
 		if (o === a) throw new Error(`FormulaLexer: separatorColumn and separatorRow must differ (both '${o}')`);
 		const h = pt({
 			name: "WhiteSpace",
@@ -4215,18 +4215,18 @@ var jn = class extends $n {
 			pattern: /[a-zA-Z_\u007F-\uFFFF]+[a-zA-Z0-9_.\u007F-\uFFFF]*(?=\()/
 		}), d = pt({
 			name: "TableReference",
-			pattern: { exec: _ },
+			pattern: { exec: A },
 			line_breaks: !1,
 			start_chars_hint: Wn
 		}), p = pt({
 			name: "BracketedString",
-			pattern: { exec: v },
+			pattern: { exec: i },
 			line_breaks: !1,
 			start_chars_hint: [91],
 			longer_alt: [d, l]
 		}), f = (e) => (e ?? []).map((e) => e?.trim()).filter(Boolean).map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).map((e) => e + "|").join(""), m = (e) => e.replace(/[A-Za-z]/g, (e) => `[${e.toUpperCase()}${e.toLowerCase()}]`), E = pt({
 			name: "LiteralError",
-			pattern: new RegExp(f(i.errorLiterals) + [
+			pattern: new RegExp(f(r.errorLiterals) + [
 				"#PARSE!",
 				"#NULL!",
 				"#DIV\\/0!",
@@ -4246,21 +4246,21 @@ var jn = class extends $n {
 			].map(m).join("|"))
 		}), T = pt({
 			name: "RefError",
-			pattern: new RegExp(f(i.errorRefs) + ["#REF!", "#NAME\\?"].map(m).join("|"))
+			pattern: new RegExp(f(r.errorRefs) + ["#REF!", "#NAME\\?"].map(m).join("|"))
 		}), g = pt({
 			name: "SingleQuotedString",
 			pattern: /'(''|[^'])*'/
 		}), O = pt({
 			name: "SheetQuoted",
 			pattern: /'(?:''|[^'])*?'!/
-		}), A = pt({
+		}), R = pt({
 			name: "Sheet",
 			pattern: /[A-Za-z_.\d\u007F-\uFFFF]*!/
-		}), R = /[a-zA-Z_\\\u007F-\uFFFF][a-zA-Z0-9_.?\\\u007F-\uFFFF]*:?/y, I = pt({
+		}), I = /[a-zA-Z_\\\u007F-\uFFFF][a-zA-Z0-9_.?\\\u007F-\uFFFF]*:?/y, _ = pt({
 			name: "NamedToken",
 			pattern: { exec: (e, t) => {
-				R.lastIndex = t;
-				const n = R.exec(e);
+				I.lastIndex = t;
+				const n = I.exec(e);
 				if (!n) return null;
 				let i = n[0];
 				const r = i.indexOf(".:");
@@ -4268,32 +4268,32 @@ var jn = class extends $n {
 			} },
 			line_breaks: !1,
 			start_chars_hint: Wn
-		}), N = pt({
+		}), L = pt({
 			name: "Cell",
 			pattern: { exec: qn(t, n) },
 			line_breaks: !1,
 			start_chars_hint: [36, ...Kn],
-			longer_alt: I
-		}), L = pt({
+			longer_alt: _
+		}), S = pt({
 			name: "Column",
 			pattern: { exec: Xn(t) },
 			line_breaks: !1,
 			start_chars_hint: [36, ...Kn],
-			longer_alt: I
-		}), S = pt({
+			longer_alt: _
+		}), C = pt({
 			name: "AbsRow",
 			pattern: /[$][0-9]+/
-		}), C = "." === c ? "\\." : c, y = pt({
+		}), y = "." === c ? "\\." : c, k = pt({
 			name: "NumberToken",
-			pattern: new RegExp(`[0-9]+${C}(?!:)[0-9]*([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|${C}[0-9]+([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|[0-9]+[eE][+-]?[0-9]+`)
-		}), k = pt({
+			pattern: new RegExp(`[0-9]+${y}(?!:)[0-9]*([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|${y}[0-9]+([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|[0-9]+[eE][+-]?[0-9]+`)
+		}), v = pt({
 			name: "ScientificDigit",
 			pattern: /[0-9]+\*\*[+-]?[0-9]+/
 		}), x = pt({
 			name: "DigitToken",
 			pattern: /[0-9]+/
 		}), P = ["TRUE", "FALSE"];
-		for (const e of [i.booleanTrue, i.booleanFalse]) {
+		for (const e of [r.booleanTrue, r.booleanFalse]) {
 			const t = e?.trim();
 			t && !P.some((e) => e.toLowerCase() === t.toLowerCase()) && P.push(t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
 		}
@@ -4302,7 +4302,7 @@ var jn = class extends $n {
 			pattern: new RegExp(P.join("|"), "i")
 		}), b = pt({
 			name: "ArgSeparator",
-			pattern: Qn(r)
+			pattern: Qn(s)
 		}), U = pt({
 			name: "ColSeparator",
 			pattern: Qn(o)
@@ -4333,10 +4333,10 @@ var jn = class extends $n {
 		}), W = pt({
 			name: "CloseCurlyParen",
 			pattern: /}/
-		}), H = pt({
+		}), V = pt({
 			name: "QuoteS",
 			pattern: /'/
-		}), V = pt({
+		}), H = pt({
 			name: "MulOp",
 			pattern: /\*(?!\*)/
 		}), Y = pt({
@@ -4378,35 +4378,35 @@ var jn = class extends $n {
 			l,
 			O,
 			g,
-			A,
+			R,
 			u,
 			d,
 			p,
 			E,
 			T,
 			b,
-			...o !== r ? [U] : [],
+			...o !== s ? [U] : [],
 			w,
 			D,
 			B,
 			$,
 			F,
-			N,
-			M,
 			L,
+			M,
 			S,
-			y,
+			C,
 			k,
+			v,
 			x,
 			ee,
 			q,
-			I,
+			_,
 			j,
 			G,
 			K,
 			W,
-			H,
 			V,
+			H,
 			Y,
 			z,
 			X,
@@ -4433,7 +4433,7 @@ var jn = class extends $n {
 		const se = {};
 		re.forEach((e) => {
 			se[e.name] = e;
-		}), o === r && (se.ColSeparator = b), this._vocabulary = se;
+		}), o === s && (se.ColSeparator = b), this._vocabulary = se;
 	}
 	tokenize(t, n = !0) {
 		const i = this._lexer.tokenize(t);
@@ -4477,7 +4477,7 @@ var jn = class extends $n {
 	];
 	for (let t = 127; t <= 65535; t++) e.push(t);
 	return e;
-})(), Hn = /* @__PURE__ */ new WeakMap(), Vn = 16384, Yn = 1048576;
+})(), Vn = /* @__PURE__ */ new WeakMap(), Hn = 16384, Yn = 1048576;
 function zn(e, t, n) {
 	let i = 0;
 	for (let r = t; r < n; r++) {
@@ -4533,9 +4533,9 @@ function Qn(e) {
 	return new RegExp(e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
 }
 var Zn = class {
-	constructor(e = s) {
+	constructor(e = N) {
 		const t = function(e) {
-			const t = [...y];
+			const t = [...g];
 			if (e) for (const n of Object.values(e)) {
 				const e = n?.trim();
 				e && !t.some((t) => t.toLowerCase() === e.toLowerCase()) && t.push(e);
@@ -4570,10 +4570,10 @@ var Zn = class {
 			})
 		];
 		this._lexer = new tt(r, { ensureOptimizations: !0 });
-		const o = {};
+		const s = {};
 		r.forEach((e) => {
-			o[e.name] = e;
-		}), this._vocabulary = o;
+			s[e.name] = e;
+		}), this._vocabulary = s;
 	}
 	getVocabulary() {
 		return this._vocabulary;
@@ -4582,7 +4582,7 @@ var Zn = class {
 		return this._lexer.tokenize(e);
 	}
 }, Jn = class extends jn {
-	constructor(e = s) {
+	constructor(e = N) {
 		const t = new Zn(e), n = t.getVocabulary();
 		super(n, {
 			nodeLocationTracking: "none",
@@ -4590,37 +4590,37 @@ var Zn = class {
 			skipValidations: !0,
 			recoveryEnabled: !1
 		}), this._lexer = t;
-		const { TableSpecifier: i, BracketedColumn: r, BareSpecifier: o, ColumnSep: a, ListSep: h } = n, l = this;
-		l.RULE("ruleContent", () => {
-			const e = [], t = l.SUBRULE(l.ruleItem);
-			return l.ACTION(() => {
+		const { TableSpecifier: i, BracketedColumn: r, BareSpecifier: o, ColumnSep: a, ListSep: c } = n, h = this;
+		h.RULE("ruleContent", () => {
+			const e = [], t = h.SUBRULE(h.ruleItem);
+			return h.ACTION(() => {
 				t && e.push(t);
-			}), l.MANY(() => {
-				l.CONSUME(h), l.OPTION(() => {
-					const t = l.SUBRULE2(l.ruleItem);
-					l.ACTION(() => {
+			}), h.MANY(() => {
+				h.CONSUME(c), h.OPTION(() => {
+					const t = h.SUBRULE2(h.ruleItem);
+					h.ACTION(() => {
 						t && e.push(t);
 					});
 				});
 			}), e;
-		}), l.RULE("ruleItem", () => l.OR([{ ALT: () => l.SUBRULE(l.ruleSpecifier) }, { ALT: () => l.SUBRULE(l.ruleColumnOrRange) }])), l.RULE("ruleSpecifier", () => l.OR([{ ALT: () => {
-			const t = l.CONSUME(i);
-			return l.ACTION(() => {
-				const n = c(t.image, e);
+		}), h.RULE("ruleItem", () => h.OR([{ ALT: () => h.SUBRULE(h.ruleSpecifier) }, { ALT: () => h.SUBRULE(h.ruleColumnOrRange) }])), h.RULE("ruleSpecifier", () => h.OR([{ ALT: () => {
+			const t = h.CONSUME(i);
+			return h.ACTION(() => {
+				const n = s(t.image, e);
 				return n.image = t.image, n;
 			});
 		} }, { ALT: () => {
-			const t = l.CONSUME(o);
-			return l.ACTION(() => {
-				const n = c(t.image, e);
+			const t = h.CONSUME(o);
+			return h.ACTION(() => {
+				const n = s(t.image, e);
 				return n.image = t.image, n;
 			});
-		} }])), l.RULE("ruleColumnOrRange", () => {
-			const e = l.CONSUME(r);
+		} }])), h.RULE("ruleColumnOrRange", () => {
+			const e = h.CONSUME(r);
 			let t, n;
-			return l.OPTION(() => {
-				t = l.CONSUME(a), n = l.CONSUME2(r);
-			}), l.ACTION(() => {
+			return h.OPTION(() => {
+				t = h.CONSUME(a), n = h.CONSUME2(r);
+			}), h.ACTION(() => {
 				const i = p(e.image);
 				if (i.image = e.image, !n) return i;
 				const r = p(n.image);
@@ -4628,7 +4628,7 @@ var Zn = class {
 				const s = S(":", i, r, !0);
 				return s.image = t?.image ?? ":", s;
 			});
-		}), l.performSelfAnalysis();
+		}), h.performSelfAnalysis();
 	}
 	_parseInner(e) {
 		const t = this._lexer.tokenize(e);
@@ -4642,19 +4642,19 @@ var Zn = class {
 		if ("@" === n) {
 			const e = t.slice(1).trim();
 			if (!e) {
-				const e = r("@", null, !0);
+				const e = a("@", null, !0);
 				return e.image = "@", [e];
 			}
 			if ("[" === e.charAt(0)) {
 				const t = this._parseInner(e);
 				if (1 === t.length && "infix" === t[0].type) {
-					const e = r("@", t[0], !0);
+					const e = a("@", t[0], !0);
 					return e.image = "@", [e];
 				}
 			}
 			const n = p(e);
 			n.image = e;
-			const i = r("@", n, !0);
+			const i = a("@", n, !0);
 			return i.image = "@", [i];
 		}
 		if ("[" !== n && "#" !== n) {
@@ -4666,7 +4666,7 @@ var Zn = class {
 	parse(e, t, n) {
 		this.reset();
 		const i = () => ({
-			root: g("", []),
+			root: O("", []),
 			errors: []
 		});
 		if (!n) return i();
@@ -4679,7 +4679,7 @@ var Zn = class {
 		if (-1 === s) return i();
 		const o = n.slice(0, s), a = n.slice(s + 1, -1), c = this._parseContent(a);
 		return {
-			root: g(o, c),
+			root: O(o, c),
 			errors: this.errors.length > 0 ? [...this.errors] : []
 		};
 	}
@@ -4694,7 +4694,7 @@ var Zn = class {
 	":."
 ]), ni = (e) => {
 	if (!e) return null;
-	if (e.type === R.Cell) {
+	if (e.type === _.Cell) {
 		const t = e.value;
 		return t.rowIndex === Number.MIN_SAFE_INTEGER ? "col" : t.colIndex === Number.MIN_SAFE_INTEGER ? "row" : null;
 	}
@@ -4725,8 +4725,8 @@ var ai = {
 	}
 }, ci = class extends jn {
 	constructor(e) {
-		const s = e?.lexer ?? Gn.shared(e?.lexerOptions), c = s.getVocabulary();
-		super(c, {
+		const i = e?.lexer ?? Gn.shared(e?.lexerOptions), s = i.getVocabulary();
+		super(s, {
 			skipValidations: !0,
 			recoveryEnabled: !0,
 			...e,
@@ -4752,17 +4752,17 @@ var ai = {
 				])), f = {
 					value: p,
 					index: this.getLexerPosition(),
-					isRange: m.includes(p)
-				}, E = this.SUBRULE2(this._rulePostfixOp);
+					isRange: v.includes(p)
+				}, m = this.SUBRULE2(this._rulePostfixOp);
 				d.push({
 					op: f,
-					node: E
+					node: m
 				});
 			}), this.ACTION(() => {
 				let e = d.length - 1;
-				const t = C.length;
+				const t = E.length;
 				for (let n = 0; e > 0 && n < t; n++) {
-					const t = C[n];
+					const t = E[n];
 					let i = 1;
 					for (; i < d.length;) {
 						const n = d[i].op;
@@ -4789,8 +4789,8 @@ var ai = {
 			}), this.ACTION(() => {
 				const e = n.length;
 				if (0 !== e) for (let i = 0; i < e; i++) {
-					const e = n[i], r = e[0], s = e[1], o = m.includes(r);
-					t = T(r, t, o), t = this._tag(t, s);
+					const e = n[i], r = e[0], s = e[1], o = v.includes(r);
+					t = I(r, t, o), t = this._tag(t, s);
 				}
 			}), t;
 		}), this._rulePrefixOp = this.RULE("rulePrefixOp", () => {
@@ -4805,14 +4805,14 @@ var ai = {
 					i.push([r, this.getLexerPosition()]);
 				});
 			});
-			let s = this.SUBRULE(this._ruleRangeOp);
+			let r = this.SUBRULE(this._ruleRangeOp);
 			return this.ACTION(() => {
 				const e = i.length;
 				if (0 !== e) for (let t = e - 1; t >= 0; t--) {
-					const e = i[t], n = e[0], o = e[1], a = m.includes(n);
-					s = r(n, s, a), s = this._tag(s, o);
+					const e = i[t], n = e[0], s = e[1], o = v.includes(n);
+					r = a(n, r, o), r = this._tag(r, s);
 				}
-			}), s;
+			}), r;
 		}), this._ruleRangeOp = this.RULE("ruleRangeOp", () => {
 			const { RangeOp: e, RangeTrimFullOp: t, RangeTrimLeadingOp: n, RangeTrimTrailingOp: i, ArrayAnchorOp: r } = this._vocab, s = [];
 			return s.push({ node: this.SUBRULE(this._ruleCallOp) }), this.MANY2(() => {
@@ -4843,7 +4843,7 @@ var ai = {
 				for (let e = 1; e < s.length; e++) {
 					const t = s[e];
 					if (void 0 !== t.anchor) {
-						s[0].node = this._tag(T("#", s[0].node, !0), t.anchor);
+						s[0].node = this._tag(I("#", s[0].node, !0), t.anchor);
 						continue;
 					}
 					const n = t.op;
@@ -4852,8 +4852,8 @@ var ai = {
 				}
 			}), s[0].node;
 		}), this._ruleCallOp = this.RULE("ruleCallOp", () => {
-			const { OpenParen: e, CloseParen: n } = this._vocab;
-			let i = this.SUBRULE(this._ruleFormula);
+			const { OpenParen: e, CloseParen: t } = this._vocab;
+			let n = this.SUBRULE(this._ruleFormula);
 			return this.MANY({
 				GATE: () => {
 					const t = this.LA(0), n = this.LA(1);
@@ -4861,12 +4861,12 @@ var ai = {
 				},
 				DEF: () => {
 					this.CONSUME(e);
-					const r = this.getLexerPosition(), s = this.SUBRULE(this._ruleFunctionArguments), o = i, a = this.ACTION(() => this._tag(t(o, s), r)), c = this.OPTION(() => this.CONSUME(n));
+					const i = this.getLexerPosition(), r = this.SUBRULE(this._ruleFunctionArguments), s = n, o = this.ACTION(() => this._tag(c(s, r), i)), a = this.OPTION(() => this.CONSUME(t));
 					this.ACTION(() => {
-						c || this._reportError(a, "Missing closing parenthesis ')'", r), this._tagClose(a, this.getLexerPosition()), i = a;
+						a || this._reportError(o, "Missing closing parenthesis ')'", i), this._tagClose(o, this.getLexerPosition()), n = o;
 					});
 				}
-			}), i;
+			}), n;
 		}), this._ruleIntersectOp = this.RULE("ruleIntersectOp", () => {
 			const e = [this.SUBRULE(this._ruleInfixOp)];
 			return this.MANY(() => {
@@ -4913,13 +4913,13 @@ var ai = {
 			}), t;
 		}), this._ruleParen = this.RULE("ruleParen", () => {
 			const { OpenParen: e, CloseParen: t } = this._vocab;
-			return this._processParen(R.Paren, e, t);
+			return this._processParen(_.Paren, e, t);
 		}), this._ruleLiteralArray = this.RULE("ruleLiteralArray", () => {
 			const { OpenCurlyParen: e, CloseCurlyParen: t, ColSeparator: n, RowSeparator: i } = this._vocab;
-			let r = N();
+			let r = k();
 			this.CONSUME(e);
 			const s = this.getLexerPosition();
-			let o = this.ACTION(() => this._tag(E(r), s));
+			let o = this.ACTION(() => this._tag(u(r), s));
 			const a = this.SUBRULE(this._ruleLiteralForArray);
 			this.ACTION(() => {
 				r.value.push(a);
@@ -4930,29 +4930,29 @@ var ai = {
 				} }, { ALT: () => this.CONSUME(i) }]);
 				const t = this.SUBRULE2(this._ruleLiteralForArray);
 				this.ACTION(() => {
-					e || (r = N(), o.value.push(r)), r.value.push(t);
+					e || (r = k(), o.value.push(r)), r.value.push(t);
 				});
 			});
 			const c = this.OPTION(() => this.CONSUME(t));
 			return o = this.ACTION(() => (c || this._reportError(o, "Missing closing parenthesis '}'", s), this._tagClose(o, this.getLexerPosition()))), o;
 		}), this._ruleLiteralForArray = this.RULE("ruleLiteralForArray", () => {
-			const { StringToken: e, BooleanToken: t, LiteralError: n, RefError: r } = this._vocab;
+			const { StringToken: e, BooleanToken: t, LiteralError: i, RefError: r } = this._vocab;
 			return this.OR([
 				{ ALT: () => {
-					const e = this.OPTION(() => this.SUBRULE(this._rulePlusMinusOp)), t = this.SUBRULE(this._ruleNumber), n = this.ACTION(() => this._tag(f(t.image, this._locale), this.getLexerPosition()));
+					const e = this.OPTION(() => this.SUBRULE(this._rulePlusMinusOp)), t = this.SUBRULE(this._ruleNumber), n = this.ACTION(() => this._tag(C(t.image, this._locale), this.getLexerPosition()));
 					return this.ACTION(() => e ? h(e.image, n) : n);
 				} },
 				{ ALT: () => {
 					const t = this.CONSUME(e);
-					return this.ACTION(() => this._tag(I(t.image), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(m(t.image), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(t);
-					return this.ACTION(() => this._tag(O(e.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(o(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(n);
-					return this.ACTION(() => this._tag(i(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(i);
+					return this.ACTION(() => this._tag(n(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(r);
@@ -4960,23 +4960,23 @@ var ai = {
 				} }
 			]);
 		}), this._ruleLiteral = this.RULE("ruleLiteral", () => {
-			const { StringToken: e, BooleanToken: t, LiteralError: n, RefError: r } = this._vocab;
+			const { StringToken: e, BooleanToken: t, LiteralError: i, RefError: r } = this._vocab;
 			return this.OR([
 				{ ALT: () => {
 					const e = this.SUBRULE(this._ruleNumber);
-					return this.ACTION(() => this._tag(f(e.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(C(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const t = this.CONSUME(e);
-					return this.ACTION(() => this._tag(I(t.image), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(m(t.image), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(t);
-					return this.ACTION(() => this._tag(O(e.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(o(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(n);
-					return this.ACTION(() => this._tag(i(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(i);
+					return this.ACTION(() => this._tag(n(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(r);
@@ -4984,12 +4984,12 @@ var ai = {
 				} }
 			]);
 		}), this._ruleFunction = this.RULE("ruleFunction", () => {
-			const { FunctionToken: e, OpenParen: t, CloseParen: i } = this._vocab, r = this.CONSUME(e).image, s = this.getLexerPosition();
+			const { FunctionToken: e, OpenParen: t, CloseParen: n } = this._vocab, i = this.CONSUME(e).image, r = this.getLexerPosition();
 			this.CONSUME(t);
-			const o = this.SUBRULE(this._ruleFunctionArguments);
-			let a = this.ACTION(() => this._tag(n(r, o), s));
-			const c = this.OPTION(() => this.CONSUME(i));
-			return a = this.ACTION(() => (c || this._reportError(a, "Missing closing parenthesis ')'", s), this._tagClose(a, this.getLexerPosition()))), a;
+			const s = this.SUBRULE(this._ruleFunctionArguments);
+			let o = this.ACTION(() => this._tag(l(i, s), r));
+			const a = this.OPTION(() => this.CONSUME(n));
+			return o = this.ACTION(() => (a || this._reportError(o, "Missing closing parenthesis ')'", r), this._tagClose(o, this.getLexerPosition()))), o;
 		}), this._ruleFunctionArguments = this.RULE("ruleFunctionArguments", () => {
 			const { ArgSeparator: e, CloseParen: t } = this._vocab, n = [];
 			return this.OPTION({
@@ -4998,11 +4998,11 @@ var ai = {
 					let t;
 					this.OPTION2(() => {
 						t = this.SUBRULE(this._ruleIntersectOp);
-					}), t = this.ACTION(() => t ?? this._tagClose(k(), this.getLexerPosition())), n.push(t), this.MANY(() => {
+					}), t = this.ACTION(() => t ?? this._tagClose(f(), this.getLexerPosition())), n.push(t), this.MANY(() => {
 						let t;
 						this.CONSUME(e), this.OPTION3(() => {
 							t = this.SUBRULE2(this._ruleIntersectOp);
-						}), t = this.ACTION(() => t ?? this._tagClose(k(), this.getLexerPosition())), n.push(t);
+						}), t = this.ACTION(() => t ?? this._tagClose(f(), this.getLexerPosition())), n.push(t);
 					});
 				}
 			}), n;
@@ -5021,14 +5021,14 @@ var ai = {
 				return this._tag(e.root, n);
 			});
 		}), this._ruleReference = this.RULE("ruleReference", () => {
-			const { Sheet: e, SheetQuoted: t, DivOp: n, MulOp: i, PlusOp: r, MinOp: s, ArgSeparator: c, Cell: h, NamedToken: d, SingleQuotedString: p, Column: f, AbsRow: m, DigitToken: E, RefError: T } = this._vocab;
+			const { Sheet: e, SheetQuoted: n, DivOp: i, MulOp: s, PlusOp: o, MinOp: a, ArgSeparator: c, Cell: h, NamedToken: l, SingleQuotedString: u, Column: p, AbsRow: f, DigitToken: m, RefError: E } = this._vocab;
 			let g, O;
 			this.OPTION2({
 				GATE: () => {
-					for (let o = 1; o < 6; o++) {
-						const a = this.LA(o);
-						if (a.tokenType === e || a.tokenType === t) return !0;
-						if ("" === a.image || ")" === a.image || a.tokenType === n || a.tokenType === i || a.tokenType === r || a.tokenType === s || a.tokenType === c) break;
+					for (let t = 1; t < 6; t++) {
+						const r = this.LA(t);
+						if (r.tokenType === e || r.tokenType === n) return !0;
+						if ("" === r.image || ")" === r.image || r.tokenType === i || r.tokenType === s || r.tokenType === o || r.tokenType === a || r.tokenType === c) break;
 					}
 					return !1;
 				},
@@ -5039,28 +5039,28 @@ var ai = {
 			let A = this.OR([
 				{ ALT: () => {
 					const e = this.CONSUME(h), t = this.getLexerPosition();
-					return this.ACTION(() => this._tag(l(e.image, this.rowIndex, this.colIndex), t));
+					return this.ACTION(() => this._tag(T(e.image, this.rowIndex, this.colIndex), t));
 				} },
 				{ ALT: () => {
-					const e = this.OR2([{ ALT: () => this.CONSUME(d) }, { ALT: () => this.CONSUME(p) }]);
-					return this.ACTION(() => this._tag(o(e.image), this.getLexerPosition()));
+					const e = this.OR2([{ ALT: () => this.CONSUME(l) }, { ALT: () => this.CONSUME(u) }]);
+					return this.ACTION(() => this._tag(d(e.image), this.getLexerPosition()));
 				} },
 				{ ALT: () => this.SUBRULE(this._ruleBracketedString) },
 				{ ALT: () => this.SUBRULE(this._ruleFunction) },
+				{ ALT: () => {
+					const e = this.CONSUME(p);
+					return this.ACTION(() => this._tag(t(e.image, this.colIndex), this.getLexerPosition()));
+				} },
 				{ ALT: () => {
 					const e = this.CONSUME(f);
-					return this.ACTION(() => this._tag(a(e.image, this.colIndex), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(r(e.image, this.rowIndex), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(m);
-					return this.ACTION(() => this._tag(u(e.image, this.rowIndex), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(r(e.image, this.rowIndex), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(E);
-					return this.ACTION(() => this._tag(u(e.image, this.rowIndex), this.getLexerPosition()));
-				} },
-				{ ALT: () => {
-					const e = this.CONSUME(T);
 					return this.ACTION(() => this._tag(L(e.image, this._locale), this.getLexerPosition()));
 				} }
 			]);
@@ -5068,7 +5068,7 @@ var ai = {
 				if (g && A) {
 					if ("" === g.name) return void this._reportError(A, `'${g.image}' is not a valid sheet reference — a '!' needs a sheet name before it`);
 					let e = A;
-					if (A.type === R.Postfix && A.inputs?.[0] && (e = A.inputs[0]), e.type === R.Cell || e.type === R.Named || e.type === R.Row || e.type === R.TableColumn || e.type === R.Error) {
+					if (A.type === _.Postfix && A.inputs?.[0] && (e = A.inputs[0]), e.type === _.Cell || e.type === _.Named || e.type === _.Row || e.type === _.TableColumn || e.type === _.Error) {
 						e.value.scope = g.name, e.value.scopeImage = g.image;
 						const t = this._tokenMap.get(e);
 						t && void 0 !== O && (t.tokenIndex = O);
@@ -5114,48 +5114,48 @@ var ai = {
 			return this.MANY(() => {
 				this.CONSUME(e), n.push(this.SUBRULE2(this._ruleIntersectOp));
 			}), this.ACTION(() => 0 === n.length ? t : {
-				type: R.List,
+				type: _.List,
 				value: ",",
 				inputs: [t, ...n],
 				isReference: !0
 			});
-		}), this._lexer = s, this._locale = s.getLocale(), this._vocab = c, this._srParser = e?.srParser ?? new Jn(this._locale), this.performSelfAnalysis();
+		}), this._lexer = i, this._locale = i.getLocale(), this._vocab = s, this._srParser = e?.srParser ?? new Jn(this._locale), this.performSelfAnalysis();
 	}
 	getLexer() {
 		return this._lexer;
 	}
 	parse(t, n, i) {
-		const r = this._lexer.tokenize(i);
-		let s;
-		if (!r) return {
+		const s = this._lexer.tokenize(i);
+		let o;
+		if (!s) return {
 			root: {
-				type: R.Unparsed,
+				type: _.Unparsed,
 				value: i
 			},
 			errors: []
 		};
-		const a = r.tokens;
+		const a = s.tokens;
 		if (0 === a.length) throw new e.Parse(ri);
-		return this.input = a, this._inputText = i, this._inputTextLength = i.length, this.rowIndex = t, this.colIndex = n, this._astErrors = [], this._tokenMap = /* @__PURE__ */ new Map(), this.reset(), s = this._ruleRoot(), s && this._bindAllWhitespace(s), s = d(s, (e, n) => {
-			const i = e.type, r = n?.isReference ? n.value : void 0, s = "string" == typeof r && ei.has(r), a = "string" == typeof r && ti.has(r), c = s ? n.inputs : void 0, h = c ? c[0] === e ? c[1] : c[0] : void 0, l = this._lexer.getMaxRow();
-			if (s && i !== R.Cell && Number.isInteger(e.value)) {
-				const n = u(e.image, t);
-				return A(n, e), "row" !== ni(h) ? this._reportError(n, `'${e.image}' is not a valid reference — a whole row can only pair with another row (as in ${e.image}:${e.image})`) : ii(e.image, l) || this._reportError(n, `'${e.image}' is not a valid row — rows run from 1 to ${l}`), n;
+		return this.input = a, this._inputText = i, this._inputTextLength = i.length, this.rowIndex = t, this.colIndex = n, this._astErrors = [], this._tokenMap = /* @__PURE__ */ new Map(), this.reset(), o = this._ruleRoot(), o && this._bindAllWhitespace(o), o = y(o, (e, n) => {
+			const i = e.type, s = n?.isReference ? n.value : void 0, o = "string" == typeof s && ei.has(s), a = "string" == typeof s && ti.has(s), c = o ? n.inputs : void 0, h = c ? c[0] === e ? c[1] : c[0] : void 0, l = this._lexer.getMaxRow();
+			if (o && i !== _.Cell && Number.isInteger(e.value)) {
+				const n = r(e.image, t);
+				return R(n, e), "row" !== ni(h) ? this._reportError(n, `'${e.image}' is not a valid reference — a whole row can only pair with another row (as in ${e.image}:${e.image})`) : ii(e.image, l) || this._reportError(n, `'${e.image}' is not a valid row — rows run from 1 to ${l}`), n;
 			}
-			if (a && i === R.Named) return this._reportError(e, `'${e.image ?? e.value?.nameId}' is a name — '${r}' needs a cell or range on both sides`), e;
-			if (i === R.Cell) {
+			if (a && i === _.Named) return this._reportError(e, `'${e.image ?? e.value?.nameId}' is a name — '${s}' needs a cell or range on both sides`), e;
+			if (i === _.Cell) {
 				const t = e.value, n = t.colIndex === Number.MIN_SAFE_INTEGER, i = t.rowIndex === Number.MIN_SAFE_INTEGER;
 				if ((n || i) && ni(h) === (n ? "row" : "col")) return n && !ii(e.image, l) && this._reportError(e, `'${e.image}' is not a valid row — rows run from 1 to ${l}`), e;
 				if (n || i || t.colIndex >= 16384) {
-					const s = o(e.image);
-					A(s, e);
-					const c = t.scope;
-					return c && (s.value.scope = c, s.value.scopeImage = t.scopeImage), n ? this._reportError(s, `'${e.image}' is not a valid reference — a row needs a column (use ${e.image}:${e.image} for the whole row)`) : i && e.image.includes("$") ? this._reportError(s, `'${e.image}' is not a valid reference — a whole column can only pair with another column (as in ${e.image}:${e.image})`) : a && this._reportError(s, `'${e.image}' is a name — '${r}' needs a cell or range on both sides`), s;
+					const r = d(e.image);
+					R(r, e);
+					const o = t.scope;
+					return o && (r.value.scope = o, r.value.scopeImage = t.scopeImage), n ? this._reportError(r, `'${e.image}' is not a valid reference — a row needs a column (use ${e.image}:${e.image} for the whole row)`) : i && e.image.includes("$") ? this._reportError(r, `'${e.image}' is not a valid reference — a whole column can only pair with another column (as in ${e.image}:${e.image})`) : a && this._reportError(r, `'${e.image}' is a name — '${s}' needs a cell or range on both sides`), r;
 				}
 			}
 			return e;
 		}), {
-			root: s,
+			root: o,
 			errors: [...this.errors, ...this._astErrors]
 		};
 	}
@@ -5211,7 +5211,7 @@ var ai = {
 	_bindAllWhitespace(e) {
 		if (e) {
 			if (this._bindNodeWhitespace(e), e.inputs) for (const t of e.inputs) t && this._bindAllWhitespace(t);
-			if (e.type === R.Array && Array.isArray(e.value)) {
+			if (e.type === _.Array && Array.isArray(e.value)) {
 				for (const t of e.value) if (t && Array.isArray(t.value)) for (const e of t.value) e && this._bindAllWhitespace(e);
 			}
 		}