@sheetxl/mcp 0.8.0-beta.18 → 0.8.0-beta.20

package/assets/{BMc-Hsrp_iifxzG_.js → uMoGfJGab8mZX6eN.js}

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

package/assets/{C3PZVWI_SEXYrzVk.js → uoUKT9hTrwZ2INHN.js}

@@ -1,11 +1,11 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.18
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.20
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { t } from "./VL-vwx7Pyw1zqIx9.js";
-import { F as n } from "./CGGpkGg85FZsnYHc.js";
+import { t } from "./Cheq-qaVWm7EaIlQ.js";
+import { F as n } from "./C9aV1SF8uCWIB4zU.js";
 var r, e = t({
 	toConcreteCSS: () => u,
 	toConcreteFill: () => s

package/assets/{CnCtLKkz0bdXIxn2.js → wYvkLI8IeHaWTtAx.js}

@@ -1,14 +1,14 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.18
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.20
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { ht as e } from "./CDqOifqA400y7KQY.js";
-import { d as t } from "./r9WSFw3a-_a5hlPm.js";
-import { R as n, Sn as r, nn as s } from "./DN4zv4AjDxTsLFsA.js";
-import { A as a, D as o, E as l, T as i, _ as c, a as u, c as p, g as d, k as f, m as h, n as g, o as m, s as x, t as y, w as v, y as I } from "./o9G5KuG1VkSazTvI.js";
-import { n as _, r as b, t as T } from "./B7GE-6NROw0onnLD.js";
+import { ht as e } from "./CyOyY32LLW-Pj_L7.js";
+import { u as t } from "./CrRJqUPbvvhnp4p4.js";
+import { Ka as n, Ot as r, u as s } from "./DTXRsv2Ww7WbIwCb.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 "./-qQT-DFFz0CqGx5C.js";
+import { n as _, r as b, t as T } from "./u-pSumbU-rgT6eLF.js";
 var P = class {
 	constructor(e) {
 		e = { ...e }, this._editing = "editing" === e.profile, this._parser = new b(e);
@@ -30,61 +30,61 @@ var P = class {
 				causes: [r]
 			});
 		}
-		let F, C, R = [];
+		let F, C, U = [];
 		try {
 			const e = this._parser.parse(r, s, a);
-			F = e.root, R = e.errors, E && F && 0 === R.length && (F.legacyIntersect = !0);
+			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 U = [];
-		for (const e of R) U.push(u(e));
+		const R = [];
+		for (const e of U) R.push(d(e));
 		if (F) {
-			const e = x(F, P ?? null);
-			"string" == typeof e ? U.push(new t.Parse(e)) : F = e, o(F, P ?? null) && U.push(new t.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), v(F, P ?? null) && U.push(new t.Parse("The spill anchor operator '#' requires a cell or range")), i(F, P ?? null) && U.push(new t.Parse("Expected a reference; a value cannot be converted to one."));
-			const n = I(F, P ?? null);
-			n && U.push(new t.Parse(n));
-			const r = g(F, P ?? null);
-			r && U.push(new t.Parse(r));
+			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(F, P ?? null);
+			r && R.push(new t.Parse(r));
 			const s = c(F, P ?? null);
-			s && U.push(new t.Parse(s));
-			const a = d(F);
-			a && U.push(new t.Parse(a));
+			s && R.push(new t.Parse(s));
+			const a = u(F);
+			a && R.push(new t.Parse(a));
 		}
-		U.length > 0 && !C && (C = U[0]);
-		let S = null;
-		if (C && (S = {
+		R.length > 0 && !C && (C = R[0]);
+		let z = null;
+		if (C && (z = {
 			input: a,
 			cause: C,
-			causes: U.length > 0 ? U : [C]
+			causes: R.length > 0 ? R : [C]
 		}), !F) {
 			if (this._editing) {
-				const t = this._recoverCompiled(e, r, s, a, b, S, k);
+				const t = this._recoverCompiled(e, r, s, a, b, z, k);
 				if (t) return t;
 			}
-			return this._compileUnparsed(e, b, a, S, this._editing, () => A(b, k, r, s));
+			return this._compileUnparsed(e, b, a, z, this._editing, () => A(b, k, r, s));
 		}
-		if (F = h(F, P ?? null), F = y(F, P ?? null), b) {
+		if (F = g(F, P ?? null), F = x(F, P ?? null), b) {
 			const e = this._editing ? w : {
 				mint: !w?.book,
 				...w
 			};
-			F = p(F, b, k, e, {
+			F = m(F, b, k, e, {
 				rowIndex: r,
 				colIndex: s
 			});
-			const n = m(F, b);
+			const n = I(F, b);
 			if (n) {
 				const e = new t.Parse(n);
-				U.push(e), S = {
+				R.push(e), z = {
 					input: a,
-					cause: S?.cause ?? e,
-					causes: S ? [...S.causes, e] : [e]
+					cause: z?.cause ?? e,
+					causes: z ? [...z.causes, e] : [e]
 				};
 			}
 		}
-		const z = l(e, b, F, this._editing, S, P ?? null);
-		return this._editing && S && f(z.getTokens(), b) !== a ? this._recoverCompiled(e, r, s, a, b, S, k) || this._compileUnparsed(e, b, a, S, !0) : z;
+		const S = i(e, b, F, this._editing, z, P ?? null);
+		return this._editing && z && p(S.getTokens(), b) !== a ? this._recoverCompiled(e, r, s, a, b, z, k) || this._compileUnparsed(e, b, a, z, !0) : S;
 	}
 	autoCorrect(e) {
 		const t = function(e) {
@@ -112,7 +112,7 @@ var P = class {
 		}
 		return 0 === s.length && 0 === t ? null : n + s.reverse().join("");
 	}
-	_compileUnparsed(t, n, s, a, o = !1, l) {
+	_compileUnparsed(t, n, r, a, o = !1, l) {
 		const i = {
 			runtime: t,
 			symbols: n,
@@ -129,10 +129,10 @@ var P = class {
 			formatReferenceIndices: e.EmptyArray,
 			getTokens: () => {
 				const e = [];
-				return o && F(e, s, void 0, l) ? e : [{
-					type: r.Unparsed,
-					value: s,
-					text: s
+				return o && F(e, r, void 0, l) ? e : [{
+					type: s.Unparsed,
+					value: r,
+					text: r
 				}];
 			},
 			namedIds: e.EmptyArray,
@@ -149,10 +149,10 @@ var P = class {
 		};
 		return i;
 	}
-	_recoverCompiled(e, t, n, s, a, o, i) {
-		let c, u = s.length;
+	_recoverCompiled(e, t, n, r, a, o, l) {
+		let c, u = r.length;
 		try {
-			const e = this._parser.getLexer().tokenize(s, !1);
+			const e = this._parser.getLexer().tokenize(r, !1);
 			c = e.tokens, e.errors.length > 0 && (u = Math.min(u, e.errors[0].offset));
 		} catch {
 			return null;
@@ -160,50 +160,50 @@ 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 < s.length && t <= u && d.push(t);
+			t > 0 && t < r.length && t <= u && d.push(t);
 		}
 		for (const c of d) {
-			const u = s.slice(0, c);
-			let d, h;
+			const u = r.slice(0, c);
+			let d, f;
 			try {
 				d = this._parser.parse(t, n, u).root;
 			} catch {
 				continue;
 			}
-			if (!d || d.type === r.Unparsed) continue;
+			if (!d || d.type === s.Unparsed) continue;
 			try {
-				const r = y(d, null), s = a ? p(r, a, i, void 0, {
+				const r = x(d, null), s = a ? m(r, a, l, void 0, {
 					rowIndex: t,
 					colIndex: n
 				}) : r;
-				h = l(e, a, s, !0, o);
+				f = i(e, a, s, !0, o);
 			} catch {
 				continue;
 			}
-			if (f(h.getTokens(), a) !== u) continue;
-			const g = s.slice(c);
-			if (0 === g.length) return h;
-			let m;
-			const x = {
-				...h,
-				getTokens: () => (m || (m = [...h.getTokens()], this._appendUnparsedTail(m, g, () => A(a, i, t, n))), m),
-				transform: () => x
+			if (p(f.getTokens(), a) !== u) continue;
+			const h = r.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),
+				transform: () => y
 			};
-			return x;
+			return y;
 		}
 		return null;
 	}
 	_appendUnparsedTail(e, t, n) {
-		const s = [];
+		const r = [];
 		for (const t of e) {
-			if (t.type === r.Whitespace) continue;
-			const e = t.type === r.Paren || t.type === r.Type ? t.text : void 0, n = s.length > 0 ? s[s.length - 1] : void 0;
-			if (t.type === r.Separator && n) {
+			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;
 				continue;
 			}
-			if (n && n.argTokens++, "(" === e || "[" === e || "{" === e) s.push({
+			if (n && n.argTokens++, "(" === e || "[" === e || "{" === e) r.push({
 				ctx: t.context,
 				argIndex: 0,
 				declared: [],
@@ -211,7 +211,7 @@ var P = class {
 				leadsArg: 2 === n?.argTokens
 			});
 			else if (")" === e || "]" === e || "}" === e) {
-				const e = s.pop(), t = s.length > 0 ? s[s.length - 1] : void 0;
+				const e = r.pop(), t = r.length > 0 ? r[r.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,7 +219,7 @@ var P = class {
 					} : { name: e }),
 					argTokens: t.argTokens
 				});
-			} else if (t.type === r.Parameter && n && t.value?.declaration) {
+			} else if (t.type === s.Parameter && n && t.value?.declaration) {
 				const e = t.value;
 				n.declared.push(e.optional ? {
 					name: e.name,
@@ -231,7 +231,7 @@ var P = class {
 				});
 			}
 		}
-		const o = s.length > 0 ? s[s.length - 1] : void 0, l = o?.ctx ? {
+		const o = r.length > 0 ? r[r.length - 1] : void 0, l = o?.ctx ? {
 			...o.ctx,
 			argIndex: -1 === o.ctx.argIndex ? o.argIndex : o.ctx.argIndex
 		} : void 0;
@@ -249,16 +249,16 @@ var P = class {
 			t && (l.bound = t);
 		}
 		const i = (t, n) => {
-			const s = n ? {
-				type: r.Named,
+			const r = n ? {
+				type: s.Named,
 				value: { name: t },
 				text: t
 			} : {
-				type: r.Unparsed,
+				type: s.Unparsed,
 				value: t,
 				text: t
 			};
-			l && (s.context = l), e.push(s);
+			l && (r.context = l), e.push(r);
 		};
 		if (F(e, t, l, n)) return;
 		const c = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), u = c ? c.index : -1;
@@ -267,14 +267,14 @@ var P = class {
 		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, n, r) {
+function A(e, t, n, s) {
 	if (!e || !t) return;
-	const a = e.bind(s.Table, "", { at: {
+	const a = e.bind(r.Table, "", { at: {
 		scope: t,
 		rowIndex: n,
-		colIndex: r
+		colIndex: s
 	} });
-	return a ? e.resolve(s.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 w(e, t) {
@@ -287,7 +287,7 @@ function w(e, t) {
 	}
 	return -1;
 }
-function F(e, t, n, s) {
+function F(e, t, n, r) {
 	let a = 0, o = -1;
 	for (let e = 0; e < t.length; e++) {
 		const n = t[e];
@@ -303,12 +303,12 @@ function F(e, t, n, s) {
 		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 === r.Named && !i.value?.scope || i.type === r.TableReference) && (c = i.text, u = !0);
+	} 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);
 	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 || (s?.() ?? ""), f = [], h = (e, t, n) => {
+	const d = c || (r?.() ?? ""), f = [], h = (e, t, n) => {
 		f.push({
 			type: e,
 			value: t,
@@ -319,8 +319,8 @@ function F(e, t, n, s) {
 				type: "table"
 			}
 		});
-	}, g = (e, t, n, s) => {
-		const a = e.startsWith("#"), o = n ? s ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, l = o ? {
+	}, g = (e, t, n, r) => {
+		const a = e.startsWith("#"), o = n ? r ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, l = o ? {
 			table: d,
 			name: e,
 			partial: o
@@ -329,7 +329,7 @@ function F(e, t, n, s) {
 			name: e
 		};
 		f.push({
-			type: a ? r.TableSpecifier : r.TableColumn,
+			type: a ? s.TableSpecifier : s.TableColumn,
 			value: l,
 			text: e,
 			context: {
@@ -338,37 +338,37 @@ function F(e, t, n, s) {
 				type: "table"
 			}
 		});
-	}, m = (e, t, n, s) => {
-		h(r.Paren, "[", n), g(e.slice(1, t ? -1 : void 0), n, !t, s), t && h(r.Paren, "]", n);
+	}, 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);
 	};
-	h(r.Paren, "[", -1);
+	h(s.Paren, "[", -1);
 	const x = t.slice(o + 1);
 	if (x.startsWith("[")) {
 		let e = 0, t = !1, n = 0;
 		for (; n < x.length;) {
-			const s = x[n];
-			if ("[" === s) {
+			const r = x[n];
+			if ("[" === r) {
 				const r = w(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 ("," === s) h(r.Separator, ",", e++), n++;
-			else if (":" === s) h(r.Infix, ":", e), n++;
-			else if ("@" === s) h(r.Prefix, "@", e), t = !0, n++;
+			} 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++;
 			else {
-				if (" " !== s) return !1;
+				if (" " !== r) return !1;
 				{
 					let t = n;
 					for (; " " === x[t];) t++;
-					h(r.Whitespace, x.slice(n, t), e), n = t;
+					h(s.Whitespace, x.slice(n, t), e), n = t;
 				}
 			}
 		}
 	} else {
 		let e = x;
 		const t = e.startsWith("@");
-		if (t && (h(r.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
+		if (t && (h(s.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
 			if (-1 !== w(e, 0)) return !1;
 			m(e, !1, 0, t);
 		} else {
@@ -378,7 +378,7 @@ function F(e, t, n, s) {
 	}
 	if (l) {
 		const t = {
-			type: r.Unparsed,
+			type: s.Unparsed,
 			value: l,
 			text: l
 		};
@@ -387,14 +387,14 @@ function F(e, t, n, s) {
 	if (u) {
 		const t = {
 			...i,
-			type: r.TableReference,
+			type: s.TableReference,
 			value: c,
 			text: c
 		};
 		delete t.referenceIndex, e[e.length - 1] = t;
 	} else if (c) {
 		const t = {
-			type: r.TableReference,
+			type: s.TableReference,
 			value: c,
 			text: c
 		};

package/assets/{DlWRvc1pLGPCRMwi.js → yDh_W6M1rvuDhFv1.js}

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