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

package/assets/{DevKDvFONeJ9euEq.js → 7vPlH3_rhJxmmBvG.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.24
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{BV49J63s68Mj6lgF.js → 9GnbVPKozgrJpeLW.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.24
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula

package/assets/{VSbzBtGH0cA8VBsM.js → B-5mBXpY9i6-eCrZ.js}

@@ -1,12 +1,12 @@
 /**
-* @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.24
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { ht as t } from "./DHHYGjNwlLvja3dS.js";
-import { p as o, u as r } from "./BUGEQS5WdiLcI_0X.js";
-import { Ct as n, E as l, Rr as e, dt as a, ia as c, mr as s, ua as u, wr as d } from "./C1PTfp7kVu3DqqZh.js";
+import { ht as t } from "./DMDTS0LH9Ke9t-3z.js";
+import { p as o, u as r } from "./DRzZ4bEyLRGVOLzV.js";
+import { Qi as n, Zr as l, _n as e, ja as a, tn as c, ut as s, va as u, xi as d } from "./C9iFJ52KwQTePQ81.js";
 var i = (o) => {
 	let r = o.ext;
 	return null === r && (r = o.ext = {
@@ -28,63 +28,63 @@ var i = (o) => {
 	const o = t.precedents;
 	return null !== o ? o.length : t.block.paramLength;
 }, S = (t) => {
-	if (t instanceof e) return new n(t);
-	const o = !0 === t.isIRepeatingList ? t : null, l = o ? o.getPeriod() : t.length, a = Array.isArray(t);
-	if (!o && !a && !m(t)) return new n(t);
-	let c = null;
-	for (let o = 0; o < l; o++) if (h(a ? t[o] : t.at(o))) {
-		if (null === c) {
-			c = new Array(l);
-			for (let o = 0; o < l; o++) c[o] = a ? t[o] : t.at(o);
+	if (t instanceof e) return new c(t);
+	const o = !0 === t.isIRepeatingList ? t : null, n = o ? o.getPeriod() : t.length, l = Array.isArray(t);
+	if (!o && !l && !m(t)) return new c(t);
+	let a = null;
+	for (let o = 0; o < n; o++) if (h(l ? t[o] : t.at(o))) {
+		if (null === a) {
+			a = new Array(n);
+			for (let o = 0; o < n; o++) a[o] = l ? t[o] : t.at(o);
 		}
-		c[o] = r.BuiltIn.Calc;
+		a[o] = r.BuiltIn.Calc;
 	}
-	return new n(null === c ? t : o ? new u(c, t.length) : c);
-}, h = (t) => null !== t && "object" == typeof t && !r.isError(t) && !0 !== t.isIRichData && !a(t), m = (t) => {
+	return new c(null === a ? t : o ? new u(a, t.length) : a);
+}, h = (t) => null !== t && "object" == typeof t && !r.isError(t) && !0 !== t.isIRichData && !l(t), m = (t) => {
 	let o = !1;
-	return n.forEachLeaf(t, (t, r, n, l) => {
+	return c.forEachLeaf(t, (t, r, n, l) => {
 		if (o || t instanceof e) return;
 		let a = r + l - n;
 		!0 === t.isIRepeatingList && (a = Math.min(a, r + t.getPeriod() - 1));
 		for (let n = r; !o && n <= a; n++) o = h(t.at(n));
 	}), o;
-}, g = class extends d {
+}, g = class extends a {
 	constructor(t, o) {
 		super(), this.nodes = t, this.count = o;
 	}
-}, I = class extends d {
+}, I = class extends a {
 	constructor(t) {
 		super(), this.node = t;
 	}
-}, E = class extends d {
+}, E = class extends a {
 	constructor(t) {
 		super(), this.node = t;
 	}
 };
-function p(t, r = 0, n = 0) {
-	const l = (t = t._materializeEmpty())._values, e = t._coords, a = l.getRuns({ bounds: e }), s = l.getAxis() !== o.Axis.Row, u = s ? e.colStart : e.rowStart, d = s ? e.rowStart : e.colStart, i = new c.Builder(null, r, n);
-	let w = a.next();
+function p(t, r = 0, l = 0) {
+	const e = (t = t._materializeEmpty())._values, a = t._coords, c = e.getRuns({ bounds: a }), s = e.getAxis() !== o.Axis.Row, u = s ? a.colStart : a.rowStart, d = s ? a.rowStart : a.colStart, i = new n.Builder(null, r, l);
+	let w = c.next();
 	for (; !w.done;) {
 		const t = w.value;
-		i.pushMultipleAt(t[0] - u, t[1] - d, t[2]), w = a.next();
+		i.pushMultipleAt(t[0] - u, t[1] - d, t[2]), w = c.next();
 	}
 	return i.build();
 }
 function x(t) {
 	if (null === t || "object" != typeof t || !0 !== t.isIRange) return t;
-	const o = t, r = o._values, n = new l({
+	const o = t, r = o._values, n = new s({
 		axis: r.getAxis(),
 		createRun: S
-	}), e = p(o);
-	return e && n.setValues(e.tuples), new s(o._runtime, n, {
+	}), l = p(o);
+	return l && n.setValues(l.tuples), new d(o._runtime, n, {
 		colStart: 0,
 		rowStart: 0,
 		colEnd: o.getColumnCount() - 1,
 		rowEnd: o.getRowCount() - 1
 	});
 }
-function b(t, o, n) {
-	const l = o.rowEnd - o.rowStart + 1, e = o.colEnd - o.colStart + 1, a = function(t, o, n) {
+function b(t, o, l) {
+	const e = o.rowEnd - o.rowStart + 1, a = o.colEnd - o.colStart + 1, c = function(t, o, n) {
 		const l = t?.isIRange ? t : null, e = l ? l.getRowCount() : 1, a = l ? l.getColumnCount() : 1, c = new Array(o);
 		for (let s = 0; s < o; s++) {
 			const o = new Array(n), u = 1 === e ? 0 : s < e ? s : -1;
@@ -95,13 +95,13 @@ function b(t, o, n) {
 			c[s] = o;
 		}
 		return c;
-	}(t, l, e), s = n ? e : l, u = n ? l : e, d = n ? o.colStart : o.rowStart, i = n ? o.rowStart : o.colStart, w = new c.Builder(null);
+	}(t, e, a), s = l ? a : e, u = l ? e : a, d = l ? o.colStart : o.rowStart, i = l ? o.rowStart : o.colStart, w = new n.Builder(null);
 	let f = !0;
 	for (let t = 0; t < s; t++) {
 		let o = null, r = 0;
-		for (let l = 0; l < u; l++) {
-			const e = n ? a[l][t] : a[t][l];
-			null != e ? (o || (o = [], r = l, f = !1), o.push(e)) : o && (w.pushMultipleAt(d + t, i + r, o), o = null);
+		for (let n = 0; n < u; n++) {
+			const e = l ? c[n][t] : c[t][n];
+			null != e ? (o || (o = [], r = n, f = !1), o.push(e)) : o && (w.pushMultipleAt(d + t, i + r, o), o = null);
 		}
 		o && w.pushMultipleAt(d + t, i + r, o);
 	}
@@ -113,12 +113,12 @@ function C(t) {
 	const r = t.rowEnd - t.rowStart - (o.$absRowEnd ? 0 : o.formulaBlockHeight - 1), n = t.colEnd - t.colStart - (o.$absColEnd ? 0 : o.formulaBlockWidth - 1);
 	return 0 === r && 0 === n;
 }
-function R(t, o, r, n, l = null) {
+function M(t, o, r, n, l = null) {
 	const e = t.value, a = e.formulaBlockWidth, c = e.formulaBlockHeight, s = e.formulaEntry.value, u = r - t.colStart, d = o - t.rowStart, i = t.rowEnd - t.rowStart - (c - 1), w = t.colEnd - t.colStart - (a - 1), f = e.$absRowEnd ? 0 : Math.max(0, d - i), S = e.$absRowStart ? c - 1 : Math.min(c - 1, d), h = e.$absColEnd ? 0 : Math.max(0, u - w), m = e.$absColStart ? a - 1 : Math.min(a - 1, u), g = s.ref;
 	null !== l ? l(s, g.rowStart + f, g.rowStart + S, g.colStart + h, g.colStart + m, n) : s.forEachNodeIn(g.rowStart + f, g.rowStart + S, g.colStart + h, g.colStart + m, n);
 }
-function M(t, o, r, n, l, e) {
-	if (C(t)) return void R(t, o, r, n, l);
+function R(t, o, r, n, l, e) {
+	if (C(t)) return void M(t, o, r, n, l);
 	const a = t.value, c = a.formulaBlockWidth, s = a.formulaBlockHeight, u = a.formulaEntry.value, d = u.ref, i = r - t.colStart, w = o - t.rowStart, f = t.rowEnd - t.rowStart - (s - 1), S = t.colEnd - t.colStart - (c - 1), h = d.rowStart + (a.$absRowEnd ? 0 : Math.max(0, w - f)), m = d.rowStart + (a.$absRowStart ? s - 1 : Math.min(s - 1, w)), g = d.colStart + (a.$absColEnd ? 0 : Math.max(0, i - S)), I = d.colStart + (a.$absColStart ? c - 1 : Math.min(c - 1, i));
 	if (h > m || g > I) return;
 	const E = e.get(a);
@@ -139,14 +139,14 @@ function y(t, o, r, n, l, e, a, c, s = null) {
 	if (S > h) return;
 	const m = t.rowEnd - t.rowStart - (i - 1), g = t.colEnd - t.colStart - (d - 1), I = u.$absRowEnd ? 0 : Math.max(0, w - t.rowStart - m), E = u.$absRowStart ? i - 1 : Math.min(i - 1, f - t.rowStart), p = u.$absColEnd ? 0 : Math.max(0, S - t.colStart - g), x = u.$absColStart ? d - 1 : Math.min(d - 1, h - t.colStart);
 	if (I > E || p > x) return;
-	let b = 1, C = 0, R = 1, M = 0;
+	let b = 1, C = 0, M = 1, R = 0;
 	if (o >= t.rowStart && o <= t.rowEnd && r >= t.colStart && r <= t.colEnd) {
 		const n = o - t.rowStart, l = r - t.colStart;
-		b = u.$absRowEnd ? 0 : Math.max(0, n - m), C = u.$absRowStart ? i - 1 : Math.min(i - 1, n), R = u.$absColEnd ? 0 : Math.max(0, l - g), M = u.$absColStart ? d - 1 : Math.min(d - 1, l);
+		b = u.$absRowEnd ? 0 : Math.max(0, n - m), C = u.$absRowStart ? i - 1 : Math.min(i - 1, n), M = u.$absColEnd ? 0 : Math.max(0, l - g), R = u.$absColStart ? d - 1 : Math.min(d - 1, l);
 	}
 	const y = u.formulaEntry.value, $ = y.ref, F = (t) => {
 		const o = t.rowIndex - $.rowStart, r = t.colIndex - $.colStart;
-		o >= b && o <= C && r >= R && r <= M || c(t);
+		o >= b && o <= C && r >= M && r <= R || c(t);
 	};
 	null !== s ? s(y, $.rowStart + I, $.rowStart + E, $.colStart + p, $.colStart + x, F) : y.forEachNodeIn($.rowStart + I, $.rowStart + E, $.colStart + p, $.colStart + x, F);
 }
@@ -309,4 +309,4 @@ function B(t, o, r) {
 	}
 	return s;
 }
-export { y as _, I as a, S as c, g as d, i as f, x as g, w as h, E as i, b as l, p as m, B as n, R as o, k as p, C as r, M as s, $ as t, f as u };
+export { y as _, I as a, S as c, g as d, i as f, x as g, w as h, E as i, b as l, p as m, B as n, M as o, k as p, C as r, R as s, $ as t, f as u };

package/assets/{4zyHb1mmcFfqwpjO.js → B-t1q2NS61c2B8E4.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.24
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula