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

package/assets/{OfjHqYH31KqC5gVM.js → Dawi8y7JWn6A9gAx.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{CdtVv8YQ8PTmS4dz.js → DbbNJyL67KdOK7nc.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{D9ja7F9irHf9Iovx.js → DcO0gub7cRKVw4xB.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{BI5L_Ysr8s0TQxdg.js → DfBERTJjS9LP0RSp.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{D8dNiNpu9_L0NjGP.js → Dg5QmWm0uBTEjZy4.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{hhpAcu3tINDLk7Ov.js → DgLQfXTWavoBetna.js}

@@ -1,14 +1,14 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { r as e } from "./Dvsld01DkmiNLjfP.js";
-import { p as r } from "./BUGEQS5WdiLcI_0X.js";
-import { P as t } from "./CGB4xgirbgEIN3tg.js";
+import { r as e } from "./gver5Sz7ZO6ZyrOi.js";
+import { p as r } from "./BI8kb-rd9dW85XJs.js";
+import { P as t } from "./ChbkkN_JqbAGrUwB.js";
 var o = async (o, s) => {
-	const { papaParseConfig: a, setValuesOptions: n, createWorkbookOptions: i } = s ?? {}, d = s?.progress, p = d?.onProgress ? d.onProgress.bind(d) : void 0, m = await import("./COVhUB0EotytQDHg.js").then((r) => e(r.default, 1)), g = m.default ?? m, c = new TextDecoder().decode(o);
+	const { papaParseConfig: a, setValuesOptions: n, createWorkbookOptions: i } = s ?? {}, d = s?.progress, p = d?.onProgress ? d.onProgress.bind(d) : void 0, m = await import("./sIWsnPhnHm_MeeM9.js").then((r) => e(r.default, 1)), g = m.default ?? m, c = new TextDecoder().decode(o);
 	let f = -1;
 	const l = new t(i), u = l.getWorksheetAt(0), h = u.getEntireRange().getCoords(), w = h.colEnd, x = h.rowEnd, P = u.getEntireRange().createSparseBuilder({ axis: r.Axis.Row });
 	let j = 0, E = 0;

package/assets/{Bf7Irm8Ua4s1T4xH.js → DiJexWBIzdGj1H0H.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{DrLUi6vduqDLmQjl.js → DoP6myQHGI-X1gNy.js}

@@ -1,54 +1,54 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.22
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.23
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { ht as e } from "./DHHYGjNwlLvja3dS.js";
-import { u as t } from "./BUGEQS5WdiLcI_0X.js";
-import { Bn as n, F as r, _n as s } from "./C1PTfp7kVu3DqqZh.js";
-import { A as a, D as o, T as l, a as i, g as c, h as u, k as p, l as d, n as f, o as h, p as g, s as m, t as x, v as y, w as v, x as I } from "./BPZWfwUvFCLQInXN.js";
-import { n as _, r as b, t as T } from "./BnK6HEqT4rf1RoOG.js";
+import { ht as e } from "./DIAQ_WlBCWhgHt-z.js";
+import { u as t } from "./BI8kb-rd9dW85XJs.js";
+import { Ya as n, bt as r, ra as s } from "./Cl04_aSpBHTwfsQR.js";
+import { A as a, D as o, T as l, a as i, g as c, h as u, k as p, l as d, n as f, o as h, p as g, s as m, t as x, v as y, w as v, x as I } from "./f_dBJuakO_BJ7Tvm.js";
+import { n as b, r as _, t as T } from "./Dol52NFQzLCbObuC.js";
 var P = class {
 	constructor(e) {
-		e = { ...e }, this._editing = "editing" === e.profile, this._parser = new b(e);
+		e = { ...e }, this._editing = "editing" === e.profile, this._parser = new _(e);
 	}
-	compile(e, n, s, a, b, P, k, E, F) {
+	compile(e, n, r, a, _, P, k, E, w) {
 		if (0 === a.length) {
 			const n = new t.Parse(T);
-			return this._compileUnparsed(e, b, a, {
+			return this._compileUnparsed(e, _, a, {
 				input: a,
 				cause: n,
 				causes: [n]
 			});
 		}
-		if (a.length > r.MAX_EXPRESSION_LENGTH) {
-			const n = new t.Parse(_(a.length, r.MAX_EXPRESSION_LENGTH));
-			return this._compileUnparsed(e, b, a, {
+		if (a.length > s.MAX_EXPRESSION_LENGTH) {
+			const n = new t.Parse(b(a.length, s.MAX_EXPRESSION_LENGTH));
+			return this._compileUnparsed(e, _, a, {
 				input: a,
 				cause: n,
 				causes: [n]
 			});
 		}
-		let w, C, U = [];
+		let F, C, U = [];
 		try {
-			const e = this._parser.parse(n, s, a);
-			w = e.root, U = e.errors, E && w && 0 === U.length && (w.legacyIntersect = !0);
+			const e = this._parser.parse(n, r, a);
+			F = e.root, U = e.errors, E && F && 0 === U.length && (F.legacyIntersect = !0);
 		} catch (e) {
 			C = t.isError(e, t.Code.Parse) ? e : new t.Parse(e.message, e);
 		}
 		const R = [];
 		for (const e of U) R.push(d(e));
-		if (w) {
-			const e = h(w, P ?? null);
-			"string" == typeof e ? R.push(new t.Parse(e)) : w = e, o(w, P ?? null) && R.push(new t.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), v(w, P ?? null) && R.push(new t.Parse("The spill anchor operator '#' requires a cell or range")), l(w, P ?? null) && R.push(new t.Parse("Expected a reference; a value cannot be converted to one."));
-			const n = y(w, P ?? null);
+		if (F) {
+			const e = h(F, P ?? null);
+			"string" == typeof e ? R.push(new t.Parse(e)) : F = e, o(F, P ?? null) && R.push(new t.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), v(F, P ?? null) && R.push(new t.Parse("The spill anchor operator '#' requires a cell or range")), l(F, P ?? null) && R.push(new t.Parse("Expected a reference; a value cannot be converted to one."));
+			const n = y(F, P ?? null);
 			n && R.push(new t.Parse(n));
-			const r = f(w, P ?? null);
+			const r = f(F, P ?? null);
 			r && R.push(new t.Parse(r));
-			const s = c(w, P ?? null);
+			const s = c(F, P ?? null);
 			s && R.push(new t.Parse(s));
-			const a = u(w);
+			const a = u(F);
 			a && R.push(new t.Parse(a));
 		}
 		R.length > 0 && !C && (C = R[0]);
@@ -57,25 +57,25 @@ var P = class {
 			input: a,
 			cause: C,
 			causes: R.length > 0 ? R : [C]
-		}), !w) {
+		}), !F) {
 			if (this._editing) {
-				const t = this._recoverCompiled(e, n, s, a, b, z, k);
+				const t = this._recoverCompiled(e, n, r, a, _, z, k);
 				if (t) return t;
 			}
-			return this._compileUnparsed(e, b, a, z, this._editing, () => A(b, k, n, s));
+			return this._compileUnparsed(e, _, a, z, this._editing, () => A(_, k, n, r));
 		}
-		if (w = g(w, P ?? null), w = x(w, P ?? null), b) {
-			const e = this._editing ? F : {
-				mint: !F?.book,
-				...F
+		if (F = g(F, P ?? null), F = x(F, P ?? null), _) {
+			const e = this._editing ? w : {
+				mint: !w?.book,
+				...w
 			};
-			w = m(w, b, k, e, {
+			F = m(F, _, k, e, {
 				rowIndex: n,
-				colIndex: s
+				colIndex: r
 			});
-			const r = I(w, b);
-			if (r) {
-				const e = new t.Parse(r);
+			const s = I(F, _);
+			if (s) {
+				const e = new t.Parse(s);
 				R.push(e), z = {
 					input: a,
 					cause: z?.cause ?? e,
@@ -83,8 +83,8 @@ var P = class {
 				};
 			}
 		}
-		const S = i(e, b, w, this._editing, z, P ?? null);
-		return this._editing && z && p(S.getTokens(), b) !== a ? this._recoverCompiled(e, n, s, a, b, z, k) || this._compileUnparsed(e, b, a, z, !0) : S;
+		const S = i(e, _, F, this._editing, z, P ?? null);
+		return this._editing && z && p(S.getTokens(), _) !== a ? this._recoverCompiled(e, n, r, a, _, z, k) || this._compileUnparsed(e, _, a, z, !0) : S;
 	}
 	autoCorrect(e) {
 		const t = function(e) {
@@ -112,10 +112,10 @@ var P = class {
 		}
 		return 0 === s.length && 0 === t ? null : n + s.reverse().join("");
 	}
-	_compileUnparsed(t, n, r, a, o = !1, l) {
+	_compileUnparsed(t, r, s, a, o = !1, l) {
 		const i = {
 			runtime: t,
-			symbols: n,
+			symbols: r,
 			getFunction: null,
 			ast: null,
 			evaluations: e.EmptyArray,
@@ -129,10 +129,10 @@ var P = class {
 			formatReferenceIndices: e.EmptyArray,
 			getTokens: () => {
 				const e = [];
-				return o && w(e, r, void 0, l) ? e : [{
-					type: s.Unparsed,
-					value: r,
-					text: r
+				return o && F(e, s, void 0, l) ? e : [{
+					type: n.Unparsed,
+					value: s,
+					text: s
 				}];
 			},
 			namedIds: e.EmptyArray,
@@ -149,10 +149,10 @@ var P = class {
 		};
 		return i;
 	}
-	_recoverCompiled(e, t, n, r, a, o, l) {
-		let c, u = r.length;
+	_recoverCompiled(e, t, r, s, a, o, l) {
+		let c, u = s.length;
 		try {
-			const e = this._parser.getLexer().tokenize(r, !1);
+			const e = this._parser.getLexer().tokenize(s, !1);
 			c = e.tokens, e.errors.length > 0 && (u = Math.min(u, e.errors[0].offset));
 		} catch {
 			return null;
@@ -160,58 +160,58 @@ var P = class {
 		const d = [];
 		for (let e = c.length - 1; e >= 0 && d.length < 24; e--) {
 			const t = (c[e].endOffset ?? -1) + 1;
-			t > 0 && t < r.length && t <= u && d.push(t);
+			t > 0 && t < s.length && t <= u && d.push(t);
 		}
 		for (const c of d) {
-			const u = r.slice(0, c);
+			const u = s.slice(0, c);
 			let d, f;
 			try {
-				d = this._parser.parse(t, n, u).root;
+				d = this._parser.parse(t, r, u).root;
 			} catch {
 				continue;
 			}
-			if (!d || d.type === s.Unparsed) continue;
+			if (!d || d.type === n.Unparsed) continue;
 			try {
-				const r = x(d, null), s = a ? m(r, a, l, void 0, {
+				const n = x(d, null), s = a ? m(n, a, l, void 0, {
 					rowIndex: t,
-					colIndex: n
-				}) : r;
+					colIndex: r
+				}) : n;
 				f = i(e, a, s, !0, o);
 			} catch {
 				continue;
 			}
 			if (p(f.getTokens(), a) !== u) continue;
-			const h = r.slice(c);
+			const h = s.slice(c);
 			if (0 === h.length) return f;
 			let g;
 			const y = {
 				...f,
-				getTokens: () => (g || (g = [...f.getTokens()], this._appendUnparsedTail(g, h, () => A(a, l, t, n))), g),
+				getTokens: () => (g || (g = [...f.getTokens()], this._appendUnparsedTail(g, h, () => A(a, l, t, r))), g),
 				transform: () => y
 			};
 			return y;
 		}
 		return null;
 	}
-	_appendUnparsedTail(e, t, n) {
-		const r = [];
+	_appendUnparsedTail(e, t, r) {
+		const s = [];
 		for (const t of e) {
-			if (t.type === s.Whitespace) continue;
-			const e = t.type === s.Paren || t.type === s.Type ? t.text : void 0, n = r.length > 0 ? r[r.length - 1] : void 0;
-			if (t.type === s.Separator && n) {
-				const e = n.declared[n.declared.length - 1];
-				"let" === n.ctx?.type && -1 === n.ctx.argIndex && n.lambda?.argTokens === n.argTokens && e?.argIndex === n.argIndex - 1 && (e.params = n.lambda.params), n.argIndex++, n.argTokens = 0, n.lambda = void 0;
+			if (t.type === n.Whitespace) continue;
+			const e = t.type === n.Paren || t.type === n.Type ? t.text : void 0, r = s.length > 0 ? s[s.length - 1] : void 0;
+			if (t.type === n.Separator && r) {
+				const e = r.declared[r.declared.length - 1];
+				"let" === r.ctx?.type && -1 === r.ctx.argIndex && r.lambda?.argTokens === r.argTokens && e?.argIndex === r.argIndex - 1 && (e.params = r.lambda.params), r.argIndex++, r.argTokens = 0, r.lambda = void 0;
 				continue;
 			}
-			if (n && n.argTokens++, "(" === e || "[" === e || "{" === e) r.push({
+			if (r && r.argTokens++, "(" === e || "[" === e || "{" === e) s.push({
 				ctx: t.context,
 				argIndex: 0,
 				declared: [],
 				argTokens: 0,
-				leadsArg: 2 === n?.argTokens
+				leadsArg: 2 === r?.argTokens
 			});
 			else if (")" === e || "]" === e || "}" === e) {
-				const e = r.pop(), t = r.length > 0 ? r[r.length - 1] : void 0;
+				const e = s.pop(), t = s.length > 0 ? s[s.length - 1] : void 0;
 				t && e?.leadsArg && "lambda" === e.ctx?.type && -1 === e.ctx.argIndex && (t.lambda = {
 					params: e.declared.map(({ name: e, optional: t }) => t ? {
 						name: e,
@@ -219,19 +219,19 @@ var P = class {
 					} : { name: e }),
 					argTokens: t.argTokens
 				});
-			} else if (t.type === s.Parameter && n && t.value?.declaration) {
+			} else if (t.type === n.Parameter && r && t.value?.declaration) {
 				const e = t.value;
-				n.declared.push(e.optional ? {
+				r.declared.push(e.optional ? {
 					name: e.name,
-					argIndex: n.argIndex,
+					argIndex: r.argIndex,
 					optional: !0
 				} : {
 					name: e.name,
-					argIndex: n.argIndex
+					argIndex: r.argIndex
 				});
 			}
 		}
-		const o = r.length > 0 ? r[r.length - 1] : void 0, l = o?.ctx ? {
+		const o = s.length > 0 ? s[s.length - 1] : void 0, l = o?.ctx ? {
 			...o.ctx,
 			argIndex: -1 === o.ctx.argIndex ? o.argIndex : o.ctx.argIndex
 		} : void 0;
@@ -248,36 +248,36 @@ var P = class {
 			}
 			t && (l.bound = t);
 		}
-		const i = (t, n) => {
-			const r = n ? {
-				type: s.Named,
+		const i = (t, r) => {
+			const s = r ? {
+				type: n.Named,
 				value: { name: t },
 				text: t
 			} : {
-				type: s.Unparsed,
+				type: n.Unparsed,
 				value: t,
 				text: t
 			};
-			l && (r.context = l), e.push(r);
+			l && (s.context = l), e.push(s);
 		};
-		if (w(e, t, l, n)) return;
+		if (F(e, t, l, r)) return;
 		const c = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), u = c ? c.index : -1;
 		let p = u > 0 ? t[u - 1] : "";
 		for (let t = e.length - 1; 0 === u && t >= 0 && !p; t--) p = e[t].text?.at(-1) ?? "";
 		u >= 0 && !/[A-Za-z0-9_.]/.test(p) ? (u > 0 && i(t.slice(0, u)), i(t.slice(u), !0)) : i(t);
 	}
 };
-function A(e, t, r, s) {
+function A(e, t, n, s) {
 	if (!e || !t) return;
-	const a = e.bind(n.Table, "", { at: {
+	const a = e.bind(r.Table, "", { at: {
 		scope: t,
-		rowIndex: r,
+		rowIndex: n,
 		colIndex: s
 	} });
-	return a ? e.resolve(n.Table, a)?.toString() : void 0;
+	return a ? e.resolve(r.Table, a)?.toString() : void 0;
 }
 var k = /[A-Za-z_\\\u007F-\uFFFF][A-Za-z0-9_.\u007F-\uFFFF]*$/, E = /[A-Za-z0-9_.)\]}"'!#\u007F-\uFFFF]/;
-function F(e, t) {
+function w(e, t) {
 	for (let n = t + 1; n < e.length; n++) {
 		const t = e[n];
 		if ("'" !== t) {
@@ -287,7 +287,7 @@ function F(e, t) {
 	}
 	return -1;
 }
-function w(e, t, n, r) {
+function F(e, t, r, s) {
 	let a = 0, o = -1;
 	for (let e = 0; e < t.length; e++) {
 		const n = t[e];
@@ -303,12 +303,12 @@ function w(e, t, n, r) {
 		const e = p.index > 0 ? l[p.index - 1] : i?.text?.at(-1) ?? "";
 		if (/[A-Za-z0-9_.]/.test(e)) return !1;
 		c = p[0], l = l.slice(0, p.index);
-	} else 0 === l.length && i?.text && 0 === k.exec(i.text)?.index && (i.type === s.Named && !i.value?.scope || i.type === s.TableReference) && (c = i.text, u = !0);
+	} else 0 === l.length && i?.text && 0 === k.exec(i.text)?.index && (i.type === n.Named && !i.value?.scope || i.type === n.TableReference) && (c = i.text, u = !0);
 	if (!u) {
 		const e = l.length > 0 ? l[l.length - 1] : i?.text?.at(-1) ?? "";
 		if (e && E.test(e)) return !1;
 	}
-	const d = c || (r?.() ?? ""), f = [], h = (e, t, n) => {
+	const d = c || (s?.() ?? ""), f = [], h = (e, t, n) => {
 		f.push({
 			type: e,
 			value: t,
@@ -319,8 +319,8 @@ function w(e, t, n, r) {
 				type: "table"
 			}
 		});
-	}, g = (e, t, n, r) => {
-		const a = e.startsWith("#"), o = n ? r ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, l = o ? {
+	}, g = (e, t, r, s) => {
+		const a = e.startsWith("#"), o = r ? s ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, l = o ? {
 			table: d,
 			name: e,
 			partial: o
@@ -329,7 +329,7 @@ function w(e, t, n, r) {
 			name: e
 		};
 		f.push({
-			type: a ? s.TableSpecifier : s.TableColumn,
+			type: a ? n.TableSpecifier : n.TableColumn,
 			value: l,
 			text: e,
 			context: {
@@ -338,38 +338,38 @@ function w(e, t, n, r) {
 				type: "table"
 			}
 		});
-	}, m = (e, t, n, r) => {
-		h(s.Paren, "[", n), g(e.slice(1, t ? -1 : void 0), n, !t, r), t && h(s.Paren, "]", n);
+	}, m = (e, t, r, s) => {
+		h(n.Paren, "[", r), g(e.slice(1, t ? -1 : void 0), r, !t, s), t && h(n.Paren, "]", r);
 	};
-	h(s.Paren, "[", -1);
+	h(n.Paren, "[", -1);
 	const x = t.slice(o + 1);
 	if (x.startsWith("[")) {
-		let e = 0, t = !1, n = 0;
-		for (; n < x.length;) {
-			const r = x[n];
-			if ("[" === r) {
-				const r = F(x, n);
-				if (null === r) return !1;
-				const s = -1 !== r;
-				if (m(x.slice(n, s ? r : x.length), s, e, t), t = !1, !s) break;
-				n = r;
-			} else if ("," === r) h(s.Separator, ",", e++), n++;
-			else if (":" === r) h(s.Infix, ":", e), n++;
-			else if ("@" === r) h(s.Prefix, "@", e), t = !0, n++;
+		let e = 0, t = !1, r = 0;
+		for (; r < x.length;) {
+			const s = x[r];
+			if ("[" === s) {
+				const n = w(x, r);
+				if (null === n) return !1;
+				const s = -1 !== n;
+				if (m(x.slice(r, s ? n : x.length), s, e, t), t = !1, !s) break;
+				r = n;
+			} else if ("," === s) h(n.Separator, ",", e++), r++;
+			else if (":" === s) h(n.Infix, ":", e), r++;
+			else if ("@" === s) h(n.Prefix, "@", e), t = !0, r++;
 			else {
-				if (" " !== r) return !1;
+				if (" " !== s) return !1;
 				{
-					let t = n;
+					let t = r;
 					for (; " " === x[t];) t++;
-					h(s.Whitespace, x.slice(n, t), e), n = t;
+					h(n.Whitespace, x.slice(r, t), e), r = t;
 				}
 			}
 		}
 	} else {
 		let e = x;
 		const t = e.startsWith("@");
-		if (t && (h(s.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
-			if (-1 !== F(e, 0)) return !1;
+		if (t && (h(n.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
+			if (-1 !== w(e, 0)) return !1;
 			m(e, !1, 0, t);
 		} else {
 			if (/(^|[^'])[[\]]/.test(e) || e.startsWith("#") && e.includes(",")) return !1;
@@ -378,29 +378,29 @@ function w(e, t, n, r) {
 	}
 	if (l) {
 		const t = {
-			type: s.Unparsed,
+			type: n.Unparsed,
 			value: l,
 			text: l
 		};
-		n && (t.context = n), e.push(t);
+		r && (t.context = r), e.push(t);
 	}
 	if (u) {
 		const t = {
 			...i,
-			type: s.TableReference,
+			type: n.TableReference,
 			value: c,
 			text: c
 		};
 		delete t.referenceIndex, e[e.length - 1] = t;
 	} else if (c) {
 		const t = {
-			type: s.TableReference,
+			type: n.TableReference,
 			value: c,
 			text: c
 		};
-		n && (t.context = n), e.push(t);
+		r && (t.context = r), e.push(t);
 	}
 	for (const t of f) e.push(t);
 	return !0;
 }
-export { P as FormulaCompiler, w as appendPartialStructuredReference };
+export { P as FormulaCompiler, F as appendPartialStructuredReference };