@sheetxl/mcp 0.8.0-beta.15 → 0.8.0-beta.17

package/assets/{DcWTBOi_iBFc6U4J.js → BKRLtOdVOUTrLjQN.js}

@@ -1,11 +1,11 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { d as n, p as r } from "./BQbF1RkUH8WyXqSD.js";
-import { t as e } from "./Bn8D2bebQ2tFfwQt.js";
+import { d as n, p as r } from "./MW2nt7se27FlH9Yb.js";
+import { t as e } from "./CtmrBbpapaNwjwNB.js";
 function s(n, e, s) {
 	const a = (n) => {
 		let e = null;
@@ -2201,7 +2201,6 @@ var a = "SheetXL", u = {
 		r: { s: "string" }
 	},
 	GETPIVOTDATA: {
-		h: 1,
 		p: [
 			{
 				n: "dataField",
@@ -2209,7 +2208,8 @@ var a = "SheetXL", u = {
 			},
 			{
 				n: "pivotTable",
-				s: "string"
+				r: "p",
+				d: 1
 			},
 			{
 				n: "fieldItem",
@@ -2219,12 +2219,12 @@ var a = "SheetXL", u = {
 					s: "string"
 				}, {
 					n: "item",
-					r: "r",
+					s: "*",
 					m: "?"
 				}]
 			}
 		],
-		r: { s: "string" }
+		r: { s: "*" }
 	},
 	HLOOKUP: {
 		p: [

package/assets/{DpdHDTFOeuzDVNEe.js → BKjovBsLpX2Fkhov.js}

@@ -1,90 +1,90 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { ht as e } from "./BQMDOjNBMjAx9WiW.js";
-import { d as t } from "./BQbF1RkUH8WyXqSD.js";
-import { ea as n, q as r, ra as s } from "./Bh0PNKlrR4VAqnP8.js";
-import { D as a, O as o, S as l, a as i, g as c, j as u, k as p, n as d, o as f, p as h, r as g, s as m, t as x, u as y, w as v, y as I } from "./LEJp05fjmflKgyqF.js";
-import { n as _, r as b, t as T } from "./CduNzsdbTigxH-ZK.js";
+import { ht as e } from "./CfA8o-FNret9-D6Y.js";
+import { d as t } from "./MW2nt7se27FlH9Yb.js";
+import { Mi as n, cn as r, or as s } from "./D6ON3ZLcTAXV3fO6.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 "./C2ZX6ffXsMaEr2d2.js";
+import { n as _, r as b, t as T } from "./7TRx0dMYnL2i4tqL.js";
 var P = class {
 	constructor(e) {
 		e = { ...e }, this._editing = "editing" === e.profile, this._parser = new b(e);
 	}
-	compile(e, n, s, i, b, P, k, E, w) {
-		if (0 === i.length) {
+	compile(e, r, s, a, b, P, k, E, w) {
+		if (0 === a.length) {
 			const n = new t.Parse(T);
-			return this._compileUnparsed(e, b, i, {
-				input: i,
+			return this._compileUnparsed(e, b, a, {
+				input: a,
 				cause: n,
 				causes: [n]
 			});
 		}
-		if (i.length > r.MAX_EXPRESSION_LENGTH) {
-			const n = new t.Parse(_(i.length, r.MAX_EXPRESSION_LENGTH));
-			return this._compileUnparsed(e, b, i, {
-				input: i,
-				cause: n,
-				causes: [n]
+		if (a.length > n.MAX_EXPRESSION_LENGTH) {
+			const r = new t.Parse(_(a.length, n.MAX_EXPRESSION_LENGTH));
+			return this._compileUnparsed(e, b, a, {
+				input: a,
+				cause: r,
+				causes: [r]
 			});
 		}
 		let F, C, U = [];
 		try {
-			const e = this._parser.parse(n, s, i);
+			const e = this._parser.parse(r, s, 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(y(e));
+		for (const e of U) R.push(d(e));
 		if (F) {
-			const e = p(F, P ?? null);
-			"string" == typeof e ? R.push(new t.Parse(e)) : F = e, l(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")), c(F, P ?? null) && R.push(new t.Parse("Expected a reference; a value cannot be converted to one."));
-			const n = a(F, P ?? null);
+			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 = x(F, P ?? null);
+			const r = f(F, P ?? null);
 			r && R.push(new t.Parse(r));
-			const s = I(F, P ?? null);
+			const s = c(F, P ?? null);
 			s && R.push(new t.Parse(s));
-			const o = h(F);
-			o && R.push(new t.Parse(o));
+			const a = u(F);
+			a && R.push(new t.Parse(a));
 		}
 		R.length > 0 && !C && (C = R[0]);
-		let S = null;
-		if (C && (S = {
-			input: i,
+		let z = null;
+		if (C && (z = {
+			input: a,
 			cause: C,
 			causes: R.length > 0 ? R : [C]
 		}), !F) {
 			if (this._editing) {
-				const t = this._recoverCompiled(e, n, s, i, b, S, k);
+				const t = this._recoverCompiled(e, r, s, a, b, z, k);
 				if (t) return t;
 			}
-			return this._compileUnparsed(e, b, i, S, this._editing, () => A(b, k, n, s));
+			return this._compileUnparsed(e, b, a, z, this._editing, () => A(b, k, r, s));
 		}
-		if (F = u(F, P ?? null), F = d(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 = f(F, b, k, e, {
-				rowIndex: n,
+			F = m(F, b, k, e, {
+				rowIndex: r,
 				colIndex: s
 			});
-			const r = m(F, b);
-			if (r) {
-				const e = new t.Parse(r);
-				R.push(e), S = {
-					input: i,
-					cause: S?.cause ?? e,
-					causes: S ? [...S.causes, e] : [e]
+			const n = I(F, b);
+			if (n) {
+				const e = new t.Parse(n);
+				R.push(e), z = {
+					input: a,
+					cause: z?.cause ?? e,
+					causes: z ? [...z.causes, e] : [e]
 				};
 			}
 		}
-		const z = g(e, b, F, this._editing, S, P ?? null);
-		return this._editing && S && o(z.getTokens(), b) !== i ? this._recoverCompiled(e, n, s, i, b, S, k) || this._compileUnparsed(e, b, i, 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) {
@@ -138,6 +138,7 @@ var P = class {
 			namedIds: e.EmptyArray,
 			symbolIds: e.EmptyArray,
 			hasTotals: !1,
+			hasPivotData: !1,
 			hasDataTable: !1,
 			hasVolatile: !1,
 			isBlankCacheable: !1,
@@ -148,7 +149,7 @@ var P = class {
 		};
 		return i;
 	}
-	_recoverCompiled(e, t, n, r, a, l, i) {
+	_recoverCompiled(e, t, n, r, a, o, l) {
 		let c, u = r.length;
 		try {
 			const e = this._parser.getLexer().tokenize(r, !1);
@@ -156,36 +157,36 @@ var P = class {
 		} catch {
 			return null;
 		}
-		const p = [];
-		for (let e = c.length - 1; e >= 0 && p.length < 24; e--) {
+		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 && p.push(t);
+			t > 0 && t < r.length && t <= u && d.push(t);
 		}
-		for (const c of p) {
+		for (const c of d) {
 			const u = r.slice(0, c);
-			let p, h;
+			let d, f;
 			try {
-				p = this._parser.parse(t, n, u).root;
+				d = this._parser.parse(t, n, u).root;
 			} catch {
 				continue;
 			}
-			if (!p || p.type === s.Unparsed) continue;
+			if (!d || d.type === s.Unparsed) continue;
 			try {
-				const r = d(p, null), s = a ? f(r, a, i, void 0, {
+				const r = x(d, null), s = a ? m(r, a, l, void 0, {
 					rowIndex: t,
 					colIndex: n
 				}) : r;
-				h = g(e, a, s, !0, l);
+				f = i(e, a, s, !0, o);
 			} catch {
 				continue;
 			}
-			if (o(h.getTokens(), a) !== u) continue;
-			const m = r.slice(c);
-			if (0 === m.length) return h;
-			let x;
+			if (p(f.getTokens(), a) !== u) continue;
+			const h = r.slice(c);
+			if (0 === h.length) return f;
+			let g;
 			const y = {
-				...h,
-				getTokens: () => (x || (x = [...h.getTokens()], this._appendUnparsedTail(x, m, () => A(a, i, t, n))), x),
+				...f,
+				getTokens: () => (g || (g = [...f.getTokens()], this._appendUnparsedTail(g, h, () => A(a, l, t, n))), g),
 				transform: () => y
 			};
 			return y;
@@ -230,24 +231,24 @@ var P = class {
 				});
 			}
 		}
-		const a = r.length > 0 ? r[r.length - 1] : void 0, o = a?.ctx ? {
-			...a.ctx,
-			argIndex: -1 === a.ctx.argIndex ? a.argIndex : a.ctx.argIndex
+		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;
-		if (o && -1 === a.ctx.argIndex && ("let" === o.type || "lambda" === o.type)) {
-			const e = "let" === o.type ? 2 : 1;
-			let t = o.bound;
-			for (const n of a.declared) {
-				if (o.argIndex < n.argIndex + e) continue;
+		if (l && -1 === o.ctx.argIndex && ("let" === l.type || "lambda" === l.type)) {
+			const e = "let" === l.type ? 2 : 1;
+			let t = l.bound;
+			for (const n of o.declared) {
+				if (l.argIndex < n.argIndex + e) continue;
 				const { name: r, params: s } = n;
-				t = i(t, s ? {
+				t = a(t, s ? {
 					name: r,
 					params: s
 				} : { name: r });
 			}
-			t && (o.bound = t);
+			t && (l.bound = t);
 		}
-		const l = (t, n) => {
+		const i = (t, n) => {
 			const r = n ? {
 				type: s.Named,
 				value: { name: t },
@@ -257,23 +258,23 @@ var P = class {
 				value: t,
 				text: t
 			};
-			o && (r.context = o), e.push(r);
+			l && (r.context = l), e.push(r);
 		};
-		if (F(e, t, o, n)) return;
+		if (F(e, t, l, n)) 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 && l(t.slice(0, u)), l(t.slice(u), !0)) : l(t);
+		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 w(e, t) {

package/assets/{BCy1zP97fsiIcvj6.js → BMJhHHX2LWgOJWGz.js}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 import { createRequire as e } from "node:module";
 var t = Object.create, r = Object.defineProperty, o = Object.getOwnPropertyDescriptor, l = Object.getOwnPropertyNames, a = Object.getPrototypeOf, n = Object.prototype.hasOwnProperty, p = (e, t) => () => (t || (e((t = { exports: {} }).exports, t), e = null), t.exports), u = (e, p, u) => (u = null != e ? t(a(e)) : {}, ((e, t, a, p) => {

package/assets/{fDMpDhXp36CatF-G.js → BOx4Ut_Rme7NH34X.js}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var e = { PIVOTBY: {
 	s: "Aggregate values by rows and columns.",

package/assets/{9U9XCqqdn-q3i2fj.js → BQYpVYbvfWuUJgdx.js}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var e = {
 	ADD: {

package/assets/{DJiLWtmPR2OQNjzi.js → BS4ZsfH5D6aemSpO.js}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var e = { VDB: {
 	s: "Returns the depreciation of an asset for any period you specify, including partial periods, using the double-declining balance method or some other method you specify.",

package/assets/{BlPubAFi7DY7VrAo.js → BSAdmOdx3brRE9LW.js}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var e = {
 	TBILLPRICE: {

package/assets/{BtjqpAKczftx91BQ.js → BSY9Tbmz6VEY_F_x.js}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var e = {
 	ACOS: {