@sheetxl/mcp 1.0.0 → 1.0.2

package/assets/{g3TrQtFS0qJZeshT.js → EohzUi0uCnSF2q2D.js}

@@ -1,11 +1,11 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v1.0.0
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v1.0.2
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { u as e } from "./8mWHFnE0j-CaNsxr.js";
-import { Cn as t, Cr as n, Ct as i, Dt as r, Fn as s, Fr as o, Hi as a, Hn as c, Ii as h, L as l, Na as u, Oa as d, Vr as p, Yi as f, Zt as m, a as E, aa as T, ao as g, ar as O, eo as A, gr as R, in as I, ji as _, jr as N, mi as L, ot as S, pt as C, qr as y, ti as k, ya as v } from "./Dcw7GSCgw_dgsum7.js";
+import { u as e } from "./3o7I8loKRGynHrNq.js";
+import { $r as t, Cr as n, E as i, Fa as r, Ft as s, J as o, M as a, Qt as c, Sa as h, Si as l, Tn as u, V as d, Wi as p, Wr as f, Wt as m, Xi as E, Zn as T, aa as g, an as O, bn as A, fr as R, jr as I, ka as _, kt as N, so as L, st as S, t as C, u as y, x as k, zi as v } from "./CvqpsTll6ngbdHgx.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,15 +210,15 @@ 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 Z = class {
+var Q = class {
 	walk(e, t = []) {
 		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);
@@ -246,7 +246,7 @@ var Z = class {
 		this.walk(e, i);
 	}
 	walkAtLeastOneSep(e, t, n) {
-		const i = Q(e, t, n);
+		const i = Z(e, t, n);
 		this.walk(e, i);
 	}
 	walkMany(e, t, n) {
@@ -254,7 +254,7 @@ var Z = class {
 		this.walk(e, i);
 	}
 	walkManySep(e, t, n) {
-		const i = Q(e, t, n);
+		const i = Z(e, t, n);
 		this.walk(e, i);
 	}
 	walkOr(e, t, n) {
@@ -265,14 +265,14 @@ var Z = class {
 		});
 	}
 };
-function Q(e, t, n) {
-	return [new B({ definition: [new H({ terminalType: e.separator })].concat(e.definition) })].concat(t, n);
+function Z(e, 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;
@@ -288,7 +288,7 @@ function J(e) {
 	}(e);
 	throw Error("non exhaustive match");
 }
-var ee = "_~IN~_", te = class extends Z {
+var ee = "_~IN~_", te = class extends Q {
 	constructor(e) {
 		super(), this.topProd = e, this.follows = {};
 	}
@@ -1277,7 +1277,7 @@ function ve(e, t) {
 		return {
 			errors: t.map((e) => ({
 				message: "Token Type: ->" + e.name + "<- missing static 'PATTERN' property",
-				type: Qe.MISSING_PATTERN,
+				type: Ze.MISSING_PATTERN,
 				tokenTypes: [e]
 			})),
 			valid: e.filter((e) => !t.includes(e))
@@ -1292,7 +1292,7 @@ function ve(e, t) {
 		return {
 			errors: t.map((e) => ({
 				message: "Token Type: ->" + e.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.",
-				type: Qe.INVALID_PATTERN,
+				type: Ze.INVALID_PATTERN,
 				tokenTypes: [e]
 			})),
 			valid: e.filter((e) => !t.includes(e))
@@ -1320,7 +1320,7 @@ function ve(e, t) {
 				}
 			}).map((e) => ({
 				message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain end of input anchor '$'\n	See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
-				type: Qe.EOI_ANCHOR_FOUND,
+				type: Ze.EOI_ANCHOR_FOUND,
 				tokenTypes: [e]
 			}));
 		}(n)), t = t.concat(function(e) {
@@ -1342,7 +1342,7 @@ function ve(e, t) {
 				}
 			}).map((e) => ({
 				message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain start of input anchor '^'\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
-				type: Qe.SOI_ANCHOR_FOUND,
+				type: Ze.SOI_ANCHOR_FOUND,
 				tokenTypes: [e]
 			}));
 		}(n)), t = t.concat(function(e) {
@@ -1351,7 +1351,7 @@ function ve(e, t) {
 				return t instanceof RegExp && (t.multiline || t.global);
 			}).map((e) => ({
 				message: "Token Type: ->" + e.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
-				type: Qe.UNSUPPORTED_FLAGS_FOUND,
+				type: Ze.UNSUPPORTED_FLAGS_FOUND,
 				tokenTypes: [e]
 			}));
 		}(n)), t = t.concat(function(e) {
@@ -1361,14 +1361,14 @@ function ve(e, t) {
 				const t = e.map((e) => e.name);
 				return {
 					message: `The same RegExp pattern ->${e[0].PATTERN}<-has been used in all of the following Token Types: ${t.join(", ")} <-`,
-					type: Qe.DUPLICATE_PATTERNS_FOUND,
+					type: Ze.DUPLICATE_PATTERNS_FOUND,
 					tokenTypes: e
 				};
 			});
 		}(n)), t = t.concat(function(e) {
 			return e.filter((e) => e.PATTERN.test("")).map((e) => ({
 				message: "Token Type: ->" + e.name + "<- static 'PATTERN' must not match an empty string",
-				type: Qe.EMPTY_MATCH_PATTERN,
+				type: Ze.EMPTY_MATCH_PATTERN,
 				tokenTypes: [e]
 			}));
 		}(n)), t;
@@ -1379,13 +1379,13 @@ function ve(e, t) {
 			return t !== tt.SKIPPED && t !== tt.NA && !("string" == typeof t);
 		}).map((e) => ({
 			message: "Token Type: ->" + e.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
-			type: Qe.INVALID_GROUP_TYPE_FOUND,
+			type: Ze.INVALID_GROUP_TYPE_FOUND,
 			tokenTypes: [e]
 		}));
 	}(s)), n = n.concat(function(e, t) {
 		return e.filter((e) => void 0 !== e.PUSH_MODE && !t.includes(e.PUSH_MODE)).map((e) => ({
 			message: `Token Type: ->${e.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${e.PUSH_MODE}<-which does not exist`,
-			type: Qe.PUSH_MODE_DOES_NOT_EXIST,
+			type: Ze.PUSH_MODE_DOES_NOT_EXIST,
 			tokenTypes: [e]
 		}));
 	}(s, t)), n = n.concat(function(e) {
@@ -1432,7 +1432,7 @@ function ve(e, t) {
 					const n = `Token: ->${s.name}<- can never be matched.\nBecause it appears AFTER the Token Type ->${e.name}<-in the lexer's definition.\nSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
 					t.push({
 						message: n,
-						type: Qe.UNREACHABLE_PATTERN,
+						type: Ze.UNREACHABLE_PATTERN,
 						tokenTypes: [e, s]
 					});
 				}
@@ -1476,19 +1476,19 @@ function Fe(e, t) {
 			Se(t, e.PATTERN);
 		} catch (e) {
 			return {
-				issue: Qe.IDENTIFY_TERMINATOR,
+				issue: Ze.IDENTIFY_TERMINATOR,
 				errMsg: e.message
 			};
 		}
 		return !1;
 	}
 	if ("string" == typeof e.PATTERN) return !1;
-	if (be(e)) return { issue: Qe.CUSTOM_LINE_BREAK };
+	if (be(e)) return { issue: Ze.CUSTOM_LINE_BREAK };
 	throw Error("non exhaustive match");
 }
 function De(e, t) {
-	if (t.issue === Qe.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.\n\tThe problem is in the <${e.name}> Token Type\n\t Root cause: ${t.errMsg}.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
-	if (t.issue === Qe.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.\n\tThe problem is in the <${e.name}> Token Type\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
+	if (t.issue === Ze.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.\n\tThe problem is in the <${e.name}> Token Type\n\t Root cause: ${t.errMsg}.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
+	if (t.issue === Ze.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.\n\tThe problem is in the <${e.name}> Token Type\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
 	throw Error("non exhaustive match");
 }
 function Be(e) {
@@ -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) => {
@@ -1554,16 +1554,16 @@ function Xe(e) {
 function qe(e) {
 	return Object.hasOwn(null != e ? e : {}, "CATEGORIES");
 }
-function Ze(e) {
+function Qe(e) {
 	return Object.hasOwn(null != e ? e : {}, "tokenTypeIdx");
 }
-var Qe, Je = {
+var Ze, Je = {
 	buildUnableToPopLexerModeMessage: (e) => `Unable to pop Lexer Mode after encountering Token ->${e.image}<- The Mode Stack is empty`,
 	buildUnexpectedCharactersMessage: (e, t, n, i, r, s) => `unexpected character: ->${e.charAt(t)}<- at offset: ${t}, skipped ${n} characters.`
 };
 (function(e) {
 	e[e.MISSING_PATTERN = 0] = "MISSING_PATTERN", e[e.INVALID_PATTERN = 1] = "INVALID_PATTERN", e[e.EOI_ANCHOR_FOUND = 2] = "EOI_ANCHOR_FOUND", e[e.UNSUPPORTED_FLAGS_FOUND = 3] = "UNSUPPORTED_FLAGS_FOUND", e[e.DUPLICATE_PATTERNS_FOUND = 4] = "DUPLICATE_PATTERNS_FOUND", e[e.INVALID_GROUP_TYPE_FOUND = 5] = "INVALID_GROUP_TYPE_FOUND", e[e.PUSH_MODE_DOES_NOT_EXIST = 6] = "PUSH_MODE_DOES_NOT_EXIST", e[e.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE = 7] = "MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE", e[e.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY = 8] = "MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY", e[e.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST = 9] = "MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST", e[e.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED = 10] = "LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED", e[e.SOI_ANCHOR_FOUND = 11] = "SOI_ANCHOR_FOUND", e[e.EMPTY_MATCH_PATTERN = 12] = "EMPTY_MATCH_PATTERN", e[e.NO_LINE_BREAKS_FLAGS = 13] = "NO_LINE_BREAKS_FLAGS", e[e.UNREACHABLE_PATTERN = 14] = "UNREACHABLE_PATTERN", e[e.IDENTIFY_TERMINATOR = 15] = "IDENTIFY_TERMINATOR", e[e.CUSTOM_LINE_BREAK = 16] = "CUSTOM_LINE_BREAK", e[e.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE = 17] = "MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE";
-})(Qe || (Qe = {}));
+})(Ze || (Ze = {}));
 var et = {
 	deferDefinitionErrorsHandling: !1,
 	positionTracking: "full",
@@ -1606,23 +1606,23 @@ var tt = class {
 					const t = [];
 					return Object.hasOwn(e, "defaultMode") || t.push({
 						message: "A MultiMode Lexer cannot be initialized without a <defaultMode> property in its definition\n",
-						type: Qe.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
+						type: Ze.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
 					}), Object.hasOwn(e, "modes") || t.push({
 						message: "A MultiMode Lexer cannot be initialized without a <modes> property in its definition\n",
-						type: Qe.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
+						type: Ze.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
 					}), Object.hasOwn(e, "modes") && Object.hasOwn(e, "defaultMode") && !Object.hasOwn(e.modes, e.defaultMode) && t.push({
 						message: `A MultiMode Lexer cannot be initialized with a ${ye}: <${e.defaultMode}>which does not exist\n`,
-						type: Qe.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
+						type: Ze.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
 					}), Object.hasOwn(e, "modes") && Object.keys(e.modes).forEach((n) => {
 						const i = e.modes[n];
 						i.forEach((e, r) => {
 							void 0 === e ? t.push({
 								message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${n}> at index: <${r}>\n`,
-								type: Qe.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
+								type: Ze.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
 							}) : Object.hasOwn(e, "LONGER_ALT") && (Array.isArray(e.LONGER_ALT) ? e.LONGER_ALT : [e.LONGER_ALT]).forEach((r) => {
 								void 0 === r || i.includes(r) || t.push({
 									message: `A MultiMode Lexer cannot be initialized with a longer_alt <${r.name}> on token <${e.name}> outside of mode <${n}>\n`,
-									type: Qe.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
+									type: Ze.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
 								});
 							});
 						});
@@ -1645,7 +1645,7 @@ var tt = class {
 						} else Object.hasOwn(e, "LINE_BREAKS") ? !0 === e.LINE_BREAKS && (r = !0) : Se(o, e.PATTERN) && (r = !0);
 					}), t && !r && i.push({
 						message: "Warning: No LINE_BREAKS Found.\n	This Lexer has been defined to track line and column information,\n	But none of the Token Types can be identified as matching a line terminator.\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \n	for details.",
-						type: Qe.NO_LINE_BREAKS_FLAGS
+						type: Ze.NO_LINE_BREAKS_FLAGS
 					}), i;
 				}(n, this.trackStartLines, this.config.lineTerminatorCharacters));
 			})), n.modes = n.modes ? n.modes : {}, Object.entries(n.modes).forEach(([e, t]) => {
@@ -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;
@@ -2002,7 +2002,7 @@ var Ot, At = class extends z {
 			});
 		}
 	}
-}, Rt = class extends Z {
+}, Rt = class extends Q {
 	constructor(e, t) {
 		super(), this.topProd = e, this.path = t, this.possibleTokTypes = [], this.nextProductionName = "", this.nextProductionOccurrence = 0, this.found = !1, this.isAtEndOfPath = !1;
 	}
@@ -2032,7 +2032,7 @@ var Ot, At = class extends z {
 			this.possibleTokTypes = J(i), this.found = !0;
 		}
 	}
-}, _t = class extends Z {
+}, _t = class extends Q {
 	constructor(e, t) {
 		super(), this.topRule = e, this.occurrence = t, this.result = {
 			token: void 0,
@@ -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);
 			}
 		}
@@ -2191,7 +2191,7 @@ function Pt(e, t, n) {
 (function(e) {
 	e[e.OPTION = 0] = "OPTION", e[e.REPETITION = 1] = "REPETITION", e[e.REPETITION_MANDATORY = 2] = "REPETITION_MANDATORY", e[e.REPETITION_MANDATORY_WITH_SEPARATOR = 3] = "REPETITION_MANDATORY_WITH_SEPARATOR", e[e.REPETITION_WITH_SEPARATOR = 4] = "REPETITION_WITH_SEPARATOR", e[e.ALTERNATION = 5] = "ALTERNATION";
 })(Ot || (Ot = {}));
-var Mt = class extends Z {
+var Mt = class extends Q {
 	constructor(e, t, n) {
 		super(), this.topProd = e, this.targetOccurrence = t, this.targetProdType = n;
 	}
@@ -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,
@@ -2636,7 +2636,7 @@ function qt(e, t) {
 		alternative: r + 1
 	}] : []));
 }
-function Zt(e, t, n) {
+function Qt(e, t, n) {
 	const i = new Xt();
 	e.accept(i);
 	let r = i.alternations;
@@ -2703,7 +2703,7 @@ function Zt(e, t, n) {
 		return a.concat(c);
 	});
 }
-var Qt = class extends z {
+var Zt = class extends z {
 	constructor() {
 		super(...arguments), this.allProductions = [];
 	}
@@ -2801,13 +2801,13 @@ var mn = 1024, En = 1280, Tn = 1536, gn = class {
 		return e.flatMap((e) => qt(e, gt));
 	}
 	validateAmbiguousAlternationAlternatives(e, t) {
-		return e.flatMap((e) => Zt(e, t, gt));
+		return e.flatMap((e) => Qt(e, t, gt));
 	}
 	validateSomeNonEmptyLookaheadPath(e, t) {
 		return function(e, t, n) {
 			const i = [];
 			return e.forEach((e) => {
-				const r = new Qt();
+				const r = new Zt();
 				e.accept(r), r.allProductions.forEach((r) => {
 					const s = vt(r), o = r.maxLookahead || t;
 					if (0 === $t(r.idx, e, s, o)[0].flat().length) {
@@ -3398,7 +3398,7 @@ $n.DEFER_DEFINITION_ERRORS_HANDLING = !1, Bn = $n, [
 				if ("number" == typeof e[0].startOffset) throw Error("The Parser constructor no longer accepts a token vector as the first argument.\n	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0\n	For Further details.");
 			}
 			if (Array.isArray(e)) this.tokensMap = e.reduce((e, t) => (e[t.name] = t, e), {});
-			else if (Object.hasOwn(e, "modes") && Object.values(e.modes).flat().every(Ze)) {
+			else if (Object.hasOwn(e, "modes") && Object.values(e.modes).flat().every(Qe)) {
 				const t = Object.values(e.modes).flat(), n = [...new Set(t)];
 				this.tokensMap = n.reduce((e, t) => (e[t.name] = t, e), {});
 			} else {
@@ -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,22 +4187,22 @@ var jn = class extends $n {
 	}
 }, Gn = class t {
 	static shared(e) {
-		const n = e?.locale ?? g, i = e?.maxColumn ?? Vn, r = e?.maxRow ?? Yn;
-		let s = Hn.get(n);
-		s || (s = /* @__PURE__ */ new Map(), Hn.set(n, s));
-		const o = `${i}:${r}`;
-		let a = s.get(o);
-		return a || (a = new t({
+		const n = e?.locale ?? i, r = e?.maxColumn ?? Hn, s = e?.maxRow ?? Yn;
+		let o = Vn.get(n);
+		o || (o = /* @__PURE__ */ new Map(), Vn.set(n, o));
+		const a = `${r}:${s}`;
+		let c = o.get(a);
+		return c || (c = new t({
 			locale: n,
-			maxColumn: i,
-			maxRow: r
-		}), s.set(o, a)), a;
+			maxColumn: r,
+			maxRow: s
+		}), o.set(a, c)), c;
 	}
 	constructor(e) {
-		const t = e?.maxColumn ?? Vn, n = e?.maxRow ?? Yn, i = e?.locale ?? g;
-		this._locale = i, this._maxColumn = t, this._maxRow = n;
-		const { separatorFunction: r, separatorColumn: s, separatorRow: o, separatorDecimal: a } = i.separators;
-		if (s === o) throw new Error(`FormulaLexer: separatorColumn and separatorRow must differ (both '${s}')`);
+		const t = e?.maxColumn ?? Hn, n = e?.maxRow ?? Yn, r = e?.locale ?? i;
+		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",
 			pattern: /[ \n\v\f\r\u00a0\u1680\u2000-\u200a\u2028\u2029\u202f\u205f\u3000\ufeff]+/,
@@ -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: c },
+			pattern: { exec: L },
 			line_breaks: !1,
 			start_chars_hint: Wn
 		}), p = pt({
 			name: "BracketedString",
-			pattern: { exec: O },
+			pattern: { exec: T },
 			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!",
@@ -4244,23 +4244,23 @@ var jn = class extends $n {
 				"#PYTHON!",
 				"#TIMEOUT!"
 			].map(m).join("|"))
-		}), T = pt({
+		}), g = pt({
 			name: "RefError",
-			pattern: new RegExp(f(i.errorRefs) + ["#REF!", "#NAME\\?"].map(m).join("|"))
-		}), A = pt({
+			pattern: new RegExp(f(r.errorRefs) + ["#REF!", "#NAME\\?"].map(m).join("|"))
+		}), O = pt({
 			name: "SingleQuotedString",
 			pattern: /'(''|[^'])*'/
-		}), R = pt({
+		}), A = pt({
 			name: "SheetQuoted",
 			pattern: /'(?:''|[^'])*?'!/
-		}), I = pt({
+		}), R = pt({
 			name: "Sheet",
 			pattern: /[A-Za-z_.\d\u007F-\uFFFF]*!/
-		}), _ = /[a-zA-Z_\\\u007F-\uFFFF][a-zA-Z0-9_.?\\\u007F-\uFFFF]*:?/y, N = pt({
+		}), I = /[a-zA-Z_\\\u007F-\uFFFF][a-zA-Z0-9_.?\\\u007F-\uFFFF]*:?/y, _ = pt({
 			name: "NamedToken",
 			pattern: { exec: (e, t) => {
-				_.lastIndex = t;
-				const n = _.exec(e);
+				I.lastIndex = t;
+				const n = I.exec(e);
 				if (!n) return null;
 				let i = n[0];
 				const r = i.indexOf(".:");
@@ -4268,22 +4268,22 @@ var jn = class extends $n {
 			} },
 			line_breaks: !1,
 			start_chars_hint: Wn
-		}), L = pt({
+		}), N = pt({
 			name: "Cell",
 			pattern: { exec: qn(t, n) },
 			line_breaks: !1,
 			start_chars_hint: [36, ...Kn],
-			longer_alt: N
+			longer_alt: _
 		}), S = pt({
 			name: "Column",
 			pattern: { exec: Xn(t) },
 			line_breaks: !1,
 			start_chars_hint: [36, ...Kn],
-			longer_alt: N
+			longer_alt: _
 		}), C = pt({
 			name: "AbsRow",
 			pattern: /[$][0-9]+/
-		}), y = "." === a ? "\\." : a, k = pt({
+		}), y = "." === c ? "\\." : c, k = pt({
 			name: "NumberToken",
 			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({
@@ -4293,7 +4293,7 @@ var jn = class extends $n {
 			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,13 +4302,13 @@ var jn = class extends $n {
 			pattern: new RegExp(P.join("|"), "i")
 		}), b = pt({
 			name: "ArgSeparator",
-			pattern: Zn(r)
+			pattern: Qn(s)
 		}), U = pt({
 			name: "ColSeparator",
-			pattern: Zn(s)
+			pattern: Qn(o)
 		}), w = pt({
 			name: "RowSeparator",
-			pattern: Zn(o)
+			pattern: Qn(a)
 		}), F = pt({
 			name: "RangeOp",
 			pattern: /:/
@@ -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({
@@ -4351,10 +4351,10 @@ var jn = class extends $n {
 		}), q = pt({
 			name: "ImplicitIntersectOp",
 			pattern: /@/
-		}), Z = pt({
+		}), Q = pt({
 			name: "ConcatOp",
 			pattern: /&/
-		}), Q = pt({
+		}), Z = pt({
 			name: "ExOp",
 			pattern: /\^/
 		}), J = pt({
@@ -4363,7 +4363,7 @@ var jn = class extends $n {
 		}), ee = pt({
 			name: "ArrayAnchorOp",
 			pattern: /#/,
-			longer_alt: [E, T]
+			longer_alt: [E, g]
 		}), te = pt({
 			name: "GtOp",
 			pattern: />/
@@ -4376,22 +4376,22 @@ var jn = class extends $n {
 		}), re = [
 			h,
 			l,
-			R,
 			A,
-			I,
+			O,
+			R,
 			u,
 			d,
 			p,
 			E,
-			T,
+			g,
 			b,
-			...s !== r ? [U] : [],
+			...o !== s ? [U] : [],
 			w,
 			D,
 			B,
 			$,
 			F,
-			L,
+			N,
 			M,
 			S,
 			C,
@@ -4400,18 +4400,18 @@ var jn = class extends $n {
 			x,
 			ee,
 			q,
-			N,
+			_,
 			j,
 			G,
 			K,
 			W,
-			H,
 			V,
+			H,
 			Y,
 			z,
 			X,
-			Z,
 			Q,
+			Z,
 			J,
 			pt({
 				name: "NeqOp",
@@ -4433,7 +4433,7 @@ var jn = class extends $n {
 		const se = {};
 		re.forEach((e) => {
 			se[e.name] = e;
-		}), s === 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++) {
@@ -4529,13 +4529,13 @@ function qn(e, t) {
 		return a < 1 || a > t ? null : [n.substring(i, r)];
 	};
 }
-function Zn(e) {
+function Qn(e) {
 	return new RegExp(e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
 }
-var Qn = class {
-	constructor(e = g) {
+var Zn = class {
+	constructor(e = i) {
 		const t = function(e) {
-			const t = [...s];
+			const t = [...c];
 			if (e) for (const n of Object.values(e)) {
 				const e = n?.trim();
 				e && !t.some((t) => t.toLowerCase() === e.toLowerCase()) && t.push(e);
@@ -4545,16 +4545,16 @@ var Qn = class {
 			name: "WhiteSpace",
 			pattern: /\s+/,
 			group: tt.SKIPPED
-		}), i = pt({
+		}), r = pt({
 			name: "TableSpecifier",
 			pattern: new RegExp(`\\[#(?:${t})\\]`, "i")
-		}), r = [
+		}), s = [
 			n,
-			i,
+			r,
 			pt({
 				name: "BracketedColumn",
 				pattern: /\[(?:'['#[\]]|'(?!['#[\]])|[^'[\]])*\]/,
-				longer_alt: [i]
+				longer_alt: [r]
 			}),
 			pt({
 				name: "BareSpecifier",
@@ -4569,9 +4569,9 @@ var Qn = class {
 				pattern: new RegExp(e.separators.separatorFunction.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"))
 			})
 		];
-		this._lexer = new tt(r, { ensureOptimizations: !0 });
+		this._lexer = new tt(s, { ensureOptimizations: !0 });
 		const o = {};
-		r.forEach((e) => {
+		s.forEach((e) => {
 			o[e.name] = e;
 		}), this._vocabulary = o;
 	}
@@ -4582,53 +4582,53 @@ var Qn = class {
 		return this._lexer.tokenize(e);
 	}
 }, Jn = class extends jn {
-	constructor(e = g) {
-		const t = new Qn(e), n = t.getVocabulary();
+	constructor(e = i) {
+		const t = new Zn(e), n = t.getVocabulary();
 		super(n, {
 			nodeLocationTracking: "none",
 			maxLookahead: 2,
 			skipValidations: !0,
 			recoveryEnabled: !1
 		}), this._lexer = t;
-		const { TableSpecifier: i, BracketedColumn: r, BareSpecifier: s, ColumnSep: o, ListSep: a } = n, c = this;
-		c.RULE("ruleContent", () => {
-			const e = [], t = c.SUBRULE(c.ruleItem);
-			return c.ACTION(() => {
+		const { TableSpecifier: r, BracketedColumn: s, BareSpecifier: a, ColumnSep: c, ListSep: h } = n, l = this;
+		l.RULE("ruleContent", () => {
+			const e = [], t = l.SUBRULE(l.ruleItem);
+			return l.ACTION(() => {
 				t && e.push(t);
-			}), c.MANY(() => {
-				c.CONSUME(a), c.OPTION(() => {
-					const t = c.SUBRULE2(c.ruleItem);
-					c.ACTION(() => {
+			}), l.MANY(() => {
+				l.CONSUME(h), l.OPTION(() => {
+					const t = l.SUBRULE2(l.ruleItem);
+					l.ACTION(() => {
 						t && e.push(t);
 					});
 				});
 			}), e;
-		}), c.RULE("ruleItem", () => c.OR([{ ALT: () => c.SUBRULE(c.ruleSpecifier) }, { ALT: () => c.SUBRULE(c.ruleColumnOrRange) }])), c.RULE("ruleSpecifier", () => c.OR([{ ALT: () => {
-			const t = c.CONSUME(i);
-			return c.ACTION(() => {
-				const n = C(t.image, 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(r);
+			return l.ACTION(() => {
+				const n = o(t.image, e);
 				return n.image = t.image, n;
 			});
 		} }, { ALT: () => {
-			const t = c.CONSUME(s);
-			return c.ACTION(() => {
-				const n = C(t.image, e);
+			const t = l.CONSUME(a);
+			return l.ACTION(() => {
+				const n = o(t.image, e);
 				return n.image = t.image, n;
 			});
-		} }])), c.RULE("ruleColumnOrRange", () => {
-			const e = c.CONSUME(r);
+		} }])), l.RULE("ruleColumnOrRange", () => {
+			const e = l.CONSUME(s);
 			let t, n;
-			return c.OPTION(() => {
-				t = c.CONSUME(o), n = c.CONSUME2(r);
-			}), c.ACTION(() => {
-				const i = u(e.image);
+			return l.OPTION(() => {
+				t = l.CONSUME(c), n = l.CONSUME2(s);
+			}), l.ACTION(() => {
+				const i = C(e.image);
 				if (i.image = e.image, !n) return i;
-				const r = u(n.image);
+				const r = C(n.image);
 				r.image = n.image;
-				const s = p(":", i, r, !0);
+				const s = R(":", i, r, !0);
 				return s.image = t?.image ?? ":", s;
 			});
-		}), c.performSelfAnalysis();
+		}), l.performSelfAnalysis();
 	}
 	_parseInner(e) {
 		const t = this._lexer.tokenize(e);
@@ -4652,13 +4652,13 @@ var Qn = class {
 					return e.image = "@", [e];
 				}
 			}
-			const n = u(e);
+			const n = C(e);
 			n.image = e;
 			const i = f("@", n, !0);
 			return i.image = "@", [i];
 		}
 		if ("[" !== n && "#" !== n) {
-			const t = u(e);
+			const t = C(e);
 			return t.image = e, [t];
 		}
 		return this._parseInner(t);
@@ -4694,7 +4694,7 @@ var Qn = class {
 	":."
 ]), ni = (e) => {
 	if (!e) return null;
-	if (e.type === n.Cell) {
+	if (e.type === O.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 t = e?.lexer ?? Gn.shared(e?.lexerOptions), i = t.getVocabulary();
+		super(i, {
 			skipValidations: !0,
 			recoveryEnabled: !0,
 			...e,
@@ -4752,7 +4752,7 @@ var ai = {
 				])), f = {
 					value: p,
 					index: this.getLexerPosition(),
-					isRange: I.includes(p)
+					isRange: A.includes(p)
 				}, m = this.SUBRULE2(this._rulePostfixOp);
 				d.push({
 					op: f,
@@ -4760,15 +4760,15 @@ var ai = {
 				});
 			}), this.ACTION(() => {
 				let e = d.length - 1;
-				const t = A.length;
+				const t = p.length;
 				for (let n = 0; e > 0 && n < t; n++) {
-					const t = A[n];
+					const t = p[n];
 					let i = 1;
 					for (; i < d.length;) {
 						const n = d[i].op;
 						if (t.includes(n.value)) {
 							const t = d[i - 1].node, r = d[i].node;
-							let s = p(n.value, t, r, n.isRange);
+							let s = R(n.value, t, r, n.isRange);
 							s = this._tag(s, n.index), d[i - 1].node = s, d.splice(i, 1), e--;
 						} else i++;
 					}
@@ -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 = I.includes(r);
-					t = a(r, t, o), t = this._tag(t, s);
+					const e = n[i], s = e[0], o = e[1], a = A.includes(s);
+					t = r(s, t, a), t = this._tag(t, o);
 				}
 			}), t;
 		}), this._rulePrefixOp = this.RULE("rulePrefixOp", () => {
@@ -4809,16 +4809,16 @@ var ai = {
 			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], s = e[1], o = I.includes(n);
+					const e = i[t], n = e[0], s = e[1], o = A.includes(n);
 					r = f(n, r, o), r = this._tag(r, 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(() => {
-				this.CONSUME(r), s.push({ anchor: this.getLexerPosition() });
+			const { RangeOp: e, RangeTrimFullOp: t, RangeTrimLeadingOp: n, RangeTrimTrailingOp: i, ArrayAnchorOp: s } = this._vocab, o = [];
+			return o.push({ node: this.SUBRULE(this._ruleCallOp) }), this.MANY2(() => {
+				this.CONSUME(s), o.push({ anchor: this.getLexerPosition() });
 			}), this.MANY(() => {
-				const o = {
+				const r = {
 					value: this.OR(this._c2 || (this._c2 = [
 						{ ALT: () => this.CONSUME(e).image },
 						{ ALT: () => this.CONSUME(t).image },
@@ -4827,30 +4827,30 @@ var ai = {
 					])),
 					index: this.getLexerPosition()
 				}, a = this.SUBRULE2(this._ruleCallOp);
-				s.push({
-					op: o,
+				o.push({
+					op: r,
 					node: a
 				}), this.MANY3(() => {
-					this.CONSUME2(r), s.push({ anchor: this.getLexerPosition() });
+					this.CONSUME2(s), o.push({ anchor: this.getLexerPosition() });
 				});
 			}), this.ACTION(() => {
-				for (let e = 1; e + 1 < s.length; e++) {
-					const t = s[e], n = s[e + 1];
+				for (let e = 1; e + 1 < o.length; e++) {
+					const t = o[e], n = o[e + 1];
 					if (":" !== t.op?.value || ":" !== n.op?.value) continue;
 					const i = ni(t.node);
-					i && ni(n.node) === i && ni(s[e - 1].node) !== i && (t.node = this._tag(p(":", t.node, n.node, !0), n.op.index), s.splice(e + 1, 1));
+					i && ni(n.node) === i && ni(o[e - 1].node) !== i && (t.node = this._tag(R(":", t.node, n.node, !0), n.op.index), o.splice(e + 1, 1));
 				}
-				for (let e = 1; e < s.length; e++) {
-					const t = s[e];
+				for (let e = 1; e < o.length; e++) {
+					const t = o[e];
 					if (void 0 !== t.anchor) {
-						s[0].node = this._tag(a("#", s[0].node, !0), t.anchor);
+						o[0].node = this._tag(r("#", o[0].node, !0), t.anchor);
 						continue;
 					}
 					const n = t.op;
-					let i = p(n.value, s[0].node, t.node, !0);
-					i = this._tag(i, n.index), s[0].node = i;
+					let i = R(n.value, o[0].node, t.node, !0);
+					i = this._tag(i, n.index), o[0].node = i;
 				}
-			}), s[0].node;
+			}), o[0].node;
 		}), this._ruleCallOp = this.RULE("ruleCallOp", () => {
 			const { OpenParen: e, CloseParen: t } = this._vocab;
 			let n = this.SUBRULE(this._ruleFormula);
@@ -4861,7 +4861,7 @@ var ai = {
 				},
 				DEF: () => {
 					this.CONSUME(e);
-					const i = this.getLexerPosition(), r = this.SUBRULE(this._ruleFunctionArguments), s = n, o = this.ACTION(() => this._tag(S(s, r), i)), a = this.OPTION(() => this.CONSUME(t));
+					const i = this.getLexerPosition(), r = this.SUBRULE(this._ruleFunctionArguments), s = n, o = this.ACTION(() => this._tag(d(s, r), i)), a = this.OPTION(() => this.CONSUME(t));
 					this.ACTION(() => {
 						a || this._reportError(o, "Missing closing parenthesis ')'", i), this._tagClose(o, this.getLexerPosition()), n = o;
 					});
@@ -4883,7 +4883,7 @@ var ai = {
 				for (; e.length > 1;) {
 					let t = e.length - 1;
 					for (let n = 0; n < t; n++) {
-						const i = e[n], r = e[n + 1], s = p(" ", i, r, !0), o = this._tokenMap.get(i);
+						const i = e[n], r = e[n + 1], s = R(" ", i, r, !0), o = this._tokenMap.get(i);
 						o && delete o.tokenIndexClose;
 						const a = this._tokenMap.get(r), c = a?.tokenIndex;
 						if (void 0 !== c) {
@@ -4913,13 +4913,13 @@ var ai = {
 			}), t;
 		}), this._ruleParen = this.RULE("ruleParen", () => {
 			const { OpenParen: e, CloseParen: t } = this._vocab;
-			return this._processParen(n.Paren, e, t);
+			return this._processParen(O.Paren, e, t);
 		}), this._ruleLiteralArray = this.RULE("ruleLiteralArray", () => {
 			const { OpenCurlyParen: e, CloseCurlyParen: t, ColSeparator: n, RowSeparator: i } = this._vocab;
-			let r = E();
+			let r = v();
 			this.CONSUME(e);
 			const s = this.getLexerPosition();
-			let o = this.ACTION(() => this._tag(R(r), s));
+			let o = this.ACTION(() => this._tag(l(r), s));
 			const a = this.SUBRULE(this._ruleLiteralForArray);
 			this.ACTION(() => {
 				r.value.push(a);
@@ -4930,17 +4930,17 @@ var ai = {
 				} }, { ALT: () => this.CONSUME(i) }]);
 				const t = this.SUBRULE2(this._ruleLiteralForArray);
 				this.ACTION(() => {
-					e || (r = E(), o.value.push(r)), r.value.push(t);
+					e || (r = v(), 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: i } = 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(L(t.image, this._locale), this.getLexerPosition()));
-					return this.ACTION(() => e ? v(e.image, n) : n);
+					const e = this.OPTION(() => this.SUBRULE(this._rulePlusMinusOp)), t = this.SUBRULE(this._ruleNumber), n = this.ACTION(() => this._tag(h(t.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => e ? E(e.image, n) : n);
 				} },
 				{ ALT: () => {
 					const t = this.CONSUME(e);
@@ -4948,23 +4948,23 @@ var ai = {
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(t);
-					return this.ACTION(() => this._tag(N(e.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(n(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(n);
-					return this.ACTION(() => this._tag(k(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(i);
+					return this.ACTION(() => this._tag(y(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(i);
-					return this.ACTION(() => this._tag(o(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(r);
+					return this.ACTION(() => this._tag(I(e.image, this._locale), this.getLexerPosition()));
 				} }
 			]);
 		}), this._ruleLiteral = this.RULE("ruleLiteral", () => {
-			const { StringToken: e, BooleanToken: t, LiteralError: n, RefError: i } = 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(L(e.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(h(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
 					const t = this.CONSUME(e);
@@ -4972,24 +4972,24 @@ var ai = {
 				} },
 				{ ALT: () => {
 					const e = this.CONSUME(t);
-					return this.ACTION(() => this._tag(N(e.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => this._tag(n(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(n);
-					return this.ACTION(() => this._tag(k(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(i);
+					return this.ACTION(() => this._tag(y(e.image, this._locale), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(i);
-					return this.ACTION(() => this._tag(o(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(r);
+					return this.ACTION(() => this._tag(I(e.image, this._locale), this.getLexerPosition()));
 				} }
 			]);
 		}), this._ruleFunction = this.RULE("ruleFunction", () => {
-			const { FunctionToken: e, OpenParen: n, CloseParen: i } = this._vocab, r = this.CONSUME(e).image, s = this.getLexerPosition();
-			this.CONSUME(n);
-			const o = this.SUBRULE(this._ruleFunctionArguments);
-			let a = this.ACTION(() => this._tag(t(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 { FunctionToken: e, OpenParen: t, CloseParen: n } = this._vocab, i = this.CONSUME(e).image, r = this.getLexerPosition();
+			this.CONSUME(t);
+			const s = this.SUBRULE(this._ruleFunctionArguments);
+			let o = this.ACTION(() => this._tag(N(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(y(), this.getLexerPosition())), n.push(t), this.MANY(() => {
+					}), t = this.ACTION(() => t ?? this._tagClose(k(), 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(y(), this.getLexerPosition())), n.push(t);
+						}), t = this.ACTION(() => t ?? this._tagClose(k(), this.getLexerPosition())), n.push(t);
 					});
 				}
 			}), n;
@@ -5021,60 +5021,60 @@ var ai = {
 				return this._tag(e.root, n);
 			});
 		}), this._ruleReference = this.RULE("ruleReference", () => {
-			const { Sheet: e, SheetQuoted: t, DivOp: s, MulOp: a, PlusOp: c, MinOp: h, ArgSeparator: u, Cell: p, NamedToken: f, SingleQuotedString: m, Column: E, AbsRow: T, DigitToken: g, RefError: O } = this._vocab;
-			let A, R;
+			const { Sheet: e, SheetQuoted: t, DivOp: n, MulOp: i, PlusOp: r, MinOp: o, ArgSeparator: c, Cell: h, NamedToken: l, SingleQuotedString: d, Column: p, AbsRow: f, DigitToken: m, RefError: E } = this._vocab;
+			let T, A;
 			this.OPTION2({
 				GATE: () => {
-					for (let n = 1; n < 6; n++) {
-						const i = this.LA(n);
-						if (i.tokenType === e || i.tokenType === t) return !0;
-						if ("" === i.image || ")" === i.image || i.tokenType === s || i.tokenType === a || i.tokenType === c || i.tokenType === h || i.tokenType === u) break;
+					for (let s = 1; s < 6; s++) {
+						const a = this.LA(s);
+						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 === o || a.tokenType === c) break;
 					}
 					return !1;
 				},
 				DEF: () => {
-					R = this.getLexerPosition() + 1, A = this.SUBRULE(this._rulePrefixSheetName);
+					A = this.getLexerPosition() + 1, T = this.SUBRULE(this._rulePrefixSheetName);
 				}
 			});
-			let I = this.OR([
+			let R = this.OR([
 				{ ALT: () => {
-					const e = this.CONSUME(p), t = this.getLexerPosition();
-					return this.ACTION(() => this._tag(r(e.image, this.rowIndex, this.colIndex), t));
+					const e = this.CONSUME(h), t = this.getLexerPosition();
+					return this.ACTION(() => this._tag(a(e.image, this.rowIndex, this.colIndex), t));
 				} },
 				{ ALT: () => {
-					const e = this.OR2([{ ALT: () => this.CONSUME(f) }, { ALT: () => this.CONSUME(m) }]);
-					return this.ACTION(() => this._tag(d(e.image), this.getLexerPosition()));
+					const e = this.OR2([{ ALT: () => this.CONSUME(l) }, { ALT: () => this.CONSUME(d) }]);
+					return this.ACTION(() => this._tag(g(e.image), this.getLexerPosition()));
 				} },
 				{ ALT: () => this.SUBRULE(this._ruleBracketedString) },
 				{ ALT: () => this.SUBRULE(this._ruleFunction) },
 				{ ALT: () => {
-					const e = this.CONSUME(E);
-					return this.ACTION(() => this._tag(i(e.image, this.colIndex), this.getLexerPosition()));
+					const e = this.CONSUME(p);
+					return this.ACTION(() => this._tag(s(e.image, this.colIndex), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(T);
-					return this.ACTION(() => this._tag(l(e.image, this.rowIndex), this.getLexerPosition()));
+					const e = this.CONSUME(f);
+					return this.ACTION(() => this._tag(u(e.image, this.rowIndex), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(g);
-					return this.ACTION(() => this._tag(l(e.image, this.rowIndex), this.getLexerPosition()));
+					const e = this.CONSUME(m);
+					return this.ACTION(() => this._tag(u(e.image, this.rowIndex), this.getLexerPosition()));
 				} },
 				{ ALT: () => {
-					const e = this.CONSUME(O);
-					return this.ACTION(() => this._tag(o(e.image, this._locale), this.getLexerPosition()));
+					const e = this.CONSUME(E);
+					return this.ACTION(() => this._tag(I(e.image, this._locale), this.getLexerPosition()));
 				} }
 			]);
 			return this.ACTION(() => {
-				if (A && I) {
-					if ("" === A.name) return void this._reportError(I, `'${A.image}' is not a valid sheet reference — a '!' needs a sheet name before it`);
-					let e = I;
-					if (I.type === n.Postfix && I.inputs?.[0] && (e = I.inputs[0]), e.type === n.Cell || e.type === n.Named || e.type === n.Row || e.type === n.TableColumn || e.type === n.Error) {
-						e.value.scope = A.name, e.value.scopeImage = A.image;
+				if (T && R) {
+					if ("" === T.name) return void this._reportError(R, `'${T.image}' is not a valid sheet reference — a '!' needs a sheet name before it`);
+					let e = R;
+					if (R.type === O.Postfix && R.inputs?.[0] && (e = R.inputs[0]), e.type === O.Cell || e.type === O.Named || e.type === O.Row || e.type === O.TableColumn || e.type === O.Error) {
+						e.value.scope = T.name, e.value.scopeImage = T.image;
 						const t = this._tokenMap.get(e);
-						t && void 0 !== R && (t.tokenIndex = R);
+						t && void 0 !== A && (t.tokenIndex = A);
 					}
 				}
-			}), I;
+			}), R;
 		}), this._rulePrefixSheetName = this.RULE("rulePrefixSheetName", () => {
 			const { SheetQuoted: e, BracketedString: t, NamedToken: n, Column: i, RangeOp: r, Sheet: s } = this._vocab;
 			return this.OR([{ ALT: () => {
@@ -5110,47 +5110,47 @@ var ai = {
 				{ ALT: () => this.CONSUME(n) }
 			]);
 		}), this._ruleRoot = this.RULE("ruleRoot", () => {
-			const { ArgSeparator: e } = this._vocab, t = this.SUBRULE(this._ruleIntersectOp), i = [];
+			const { ArgSeparator: e } = this._vocab, t = this.SUBRULE(this._ruleIntersectOp), n = [];
 			return this.MANY(() => {
-				this.CONSUME(e), i.push(this.SUBRULE2(this._ruleIntersectOp));
-			}), this.ACTION(() => 0 === i.length ? t : {
-				type: n.List,
+				this.CONSUME(e), n.push(this.SUBRULE2(this._ruleIntersectOp));
+			}), this.ACTION(() => 0 === n.length ? t : {
+				type: O.List,
 				value: ",",
-				inputs: [t, ...i],
+				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 = t, this._locale = t.getLocale(), this._vocab = i, this._srParser = e?.srParser ?? new Jn(this._locale), this.performSelfAnalysis();
 	}
 	getLexer() {
 		return this._lexer;
 	}
-	parse(t, i, r) {
+	parse(n, i, r) {
 		const s = this._lexer.tokenize(r);
 		let o;
 		if (!s) return {
 			root: {
-				type: n.Unparsed,
+				type: O.Unparsed,
 				value: r
 			},
 			errors: []
 		};
 		const a = s.tokens;
 		if (0 === a.length) throw new e.Parse(ri);
-		return this.input = a, this._inputText = r, this._inputTextLength = r.length, this.rowIndex = t, this.colIndex = i, this._astErrors = [], this._tokenMap = /* @__PURE__ */ new Map(), this.reset(), o = this._ruleRoot(), o && this._bindAllWhitespace(o), o = T(o, (e, i) => {
-			const r = e.type, s = i?.isReference ? i.value : void 0, o = "string" == typeof s && ei.has(s), a = "string" == typeof s && ti.has(s), c = o ? i.inputs : void 0, u = c ? c[0] === e ? c[1] : c[0] : void 0, p = this._lexer.getMaxRow();
-			if (o && r !== n.Cell && Number.isInteger(e.value)) {
-				const n = l(e.image, t);
-				return h(n, e), "row" !== ni(u) ? 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, p) || this._reportError(n, `'${e.image}' is not a valid row — rows run from 1 to ${p}`), n;
+		return this.input = a, this._inputText = r, this._inputTextLength = r.length, this.rowIndex = n, this.colIndex = i, this._astErrors = [], this._tokenMap = /* @__PURE__ */ new Map(), this.reset(), o = this._ruleRoot(), o && this._bindAllWhitespace(o), o = S(o, (e, i) => {
+			const r = e.type, s = i?.isReference ? i.value : void 0, o = "string" == typeof s && ei.has(s), a = "string" == typeof s && ti.has(s), c = o ? i.inputs : void 0, h = c ? c[0] === e ? c[1] : c[0] : void 0, l = this._lexer.getMaxRow();
+			if (o && r !== O.Cell && Number.isInteger(e.value)) {
+				const i = u(e.image, n);
+				return t(i, e), "row" !== ni(h) ? this._reportError(i, `'${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(i, `'${e.image}' is not a valid row — rows run from 1 to ${l}`), i;
 			}
-			if (a && r === n.Named) return this._reportError(e, `'${e.image ?? e.value?.nameId}' is a name — '${s}' needs a cell or range on both sides`), e;
-			if (r === n.Cell) {
-				const t = e.value, n = t.colIndex === Number.MIN_SAFE_INTEGER, i = t.rowIndex === Number.MIN_SAFE_INTEGER;
-				if ((n || i) && ni(u) === (n ? "row" : "col")) return n && !ii(e.image, p) && this._reportError(e, `'${e.image}' is not a valid row — rows run from 1 to ${p}`), e;
-				if (n || i || t.colIndex >= 16384) {
-					const r = d(e.image);
-					h(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;
+			if (a && r === O.Named) return this._reportError(e, `'${e.image ?? e.value?.nameId}' is a name — '${s}' needs a cell or range on both sides`), e;
+			if (r === O.Cell) {
+				const n = e.value, i = n.colIndex === Number.MIN_SAFE_INTEGER, r = n.rowIndex === Number.MIN_SAFE_INTEGER;
+				if ((i || r) && ni(h) === (i ? "row" : "col")) return i && !ii(e.image, l) && this._reportError(e, `'${e.image}' is not a valid row — rows run from 1 to ${l}`), e;
+				if (i || r || n.colIndex >= 16384) {
+					const o = g(e.image);
+					t(o, e);
+					const c = n.scope;
+					return c && (o.value.scope = c, o.value.scopeImage = n.scopeImage), i ? this._reportError(o, `'${e.image}' is not a valid reference — a row needs a column (use ${e.image}:${e.image} for the whole row)`) : r && e.image.includes("$") ? this._reportError(o, `'${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(o, `'${e.image}' is a name — '${s}' needs a cell or range on both sides`), o;
 				}
 			}
 			return e;
@@ -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 === n.Array && Array.isArray(e.value)) {
+			if (e.type === O.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);
 			}
 		}