@sheetxl/mcp 0.0.0-stage → 0.8.0-beta.15

package/assets/Bn8D2bebQ2tFfwQt.js

@@ -0,0 +1,310 @@
+/**
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { ht as t } from "./BQMDOjNBMjAx9WiW.js";
+import { d as o, m as r } from "./BQbF1RkUH8WyXqSD.js";
+import { N as n, _ as l, en as e, i as a, ni as c, ur as s, vi as u, zn as d } from "./Bh0PNKlrR4VAqnP8.js";
+var i = (o) => {
+	let r = o.ext;
+	return null === r && (r = o.ext = {
+		spillDependents: t.EmptyArray,
+		spillRowEnd: -1,
+		spillColEnd: -1,
+		fixedRef: null,
+		demandValue: void 0,
+		cycleGroup: 0,
+		cycleNext: null,
+		shownGroup: 0
+	}), r;
+}, w = (t) => {
+	const o = t.precedents;
+	return null !== o ? o : t.block.getPrecedentsAt(t.rowIndex, t.colIndex);
+}, f = (t) => {
+	const o = t.precedents;
+	return null !== o ? o.length : t.block.paramLength;
+}, S = (t) => {
+	if (t instanceof e) return new s(t);
+	const r = !0 === t.isIRepeatingList ? t : null, n = r ? r.getPeriod() : t.length, l = Array.isArray(t);
+	if (!r && !l && !m(t)) return new s(t);
+	let a = null;
+	for (let r = 0; r < n; r++) if (h(l ? t[r] : t.at(r))) {
+		if (null === a) {
+			a = new Array(n);
+			for (let o = 0; o < n; o++) a[o] = l ? t[o] : t.at(o);
+		}
+		a[r] = o.BuiltIn.Calc;
+	}
+	return new s(null === a ? t : r ? new d(a, t.length) : a);
+}, h = (t) => null !== t && "object" == typeof t && !o.isError(t) && !0 !== t.isIRichData && !l(t), m = (t) => {
+	let o = !1;
+	return s.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 a {
+	constructor(t, o) {
+		super(), this.nodes = t, this.count = o;
+	}
+}, I = class extends a {
+	constructor(t) {
+		super(), this.node = t;
+	}
+}, E = class extends a {
+	constructor(t) {
+		super(), this.node = t;
+	}
+};
+function p(t, o = 0, n = 0) {
+	const l = (t = t._materializeEmpty())._values, e = t._coords, a = l.getRuns({ bounds: e }), c = l.getAxis() !== r.Axis.Row, s = c ? e.colStart : e.rowStart, d = c ? e.rowStart : e.colStart, i = new u.Builder(null, o, n);
+	let w = a.next();
+	for (; !w.done;) {
+		const t = w.value;
+		i.pushMultipleAt(t[0] - s, t[1] - d, t[2]), w = a.next();
+	}
+	return i.build();
+}
+function x(t) {
+	if (null === t || "object" != typeof t || !0 !== t.isIRange) return t;
+	const o = t, r = o._values, l = new n({
+		axis: r.getAxis(),
+		createRun: S
+	}), e = p(o);
+	return e && l.setValues(e.tuples), new c(o._runtime, l, {
+		colStart: 0,
+		rowStart: 0,
+		colEnd: o.getColumnCount() - 1,
+		rowEnd: o.getRowCount() - 1
+	});
+}
+function b(t, r, n) {
+	const l = r.rowEnd - r.rowStart + 1, e = r.colEnd - r.colStart + 1, a = function(t, r, n) {
+		const l = t?.isIRange ? t : null, e = l ? l.getRowCount() : 1, a = l ? l.getColumnCount() : 1, c = new Array(r);
+		for (let s = 0; s < r; s++) {
+			const r = new Array(n), u = 1 === e ? 0 : s < e ? s : -1;
+			for (let e = 0; e < n; e++) {
+				const n = 1 === a ? 0 : e < a ? e : -1;
+				r[e] = u < 0 || n < 0 ? o.BuiltIn.NA : l ? l.getValueAt(u, n) : t;
+			}
+			c[s] = r;
+		}
+		return c;
+	}(t, l, e), c = n ? e : l, s = n ? l : e, d = n ? r.colStart : r.rowStart, i = n ? r.rowStart : r.colStart, w = new u.Builder(null);
+	let f = !0;
+	for (let t = 0; t < c; t++) {
+		let o = null, r = 0;
+		for (let l = 0; l < s; 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);
+		}
+		o && w.pushMultipleAt(d + t, i + r, o);
+	}
+	return f ? null : w.build();
+}
+function C(t) {
+	const o = t.value;
+	if (o.$absRowStart !== o.$absRowEnd || o.$absColStart !== o.$absColEnd) return !1;
+	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 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 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);
+	if (void 0 === E) return e.set(a, {
+		rowFrom: h,
+		rowTo: m,
+		colFrom: g,
+		colTo: I
+	}), void l(u, h, m, g, I, n);
+	if (h >= E.rowFrom && m <= E.rowTo && g >= E.colFrom && I <= E.colTo) return;
+	const p = h <= d.rowStart && m >= d.rowEnd && g <= d.colStart && I >= d.colEnd;
+	!p && g === E.colFrom && I === E.colTo && h <= E.rowTo + 1 && m >= E.rowFrom - 1 ? (h < E.rowFrom && l(u, h, E.rowFrom - 1, g, I, n), m > E.rowTo && l(u, E.rowTo + 1, m, g, I, n), h < E.rowFrom && (E.rowFrom = h), m > E.rowTo && (E.rowTo = m)) : !p && h === E.rowFrom && m === E.rowTo && g <= E.colTo + 1 && I >= E.colFrom - 1 ? (g < E.colFrom && l(u, h, m, g, E.colFrom - 1, n), I > E.colTo && l(u, h, m, E.colTo + 1, I, n), g < E.colFrom && (E.colFrom = g), I > E.colTo && (E.colTo = I)) : (l(u, h, m, g, I, n), (m - h + 1) * (I - g + 1) > (E.rowTo - E.rowFrom + 1) * (E.colTo - E.colFrom + 1) && (E.rowFrom = h, E.rowTo = m, E.colFrom = g, E.colTo = I));
+}
+function y(t, o, r, n, l, e, a = null) {
+	const c = t.value, s = c.formulaBlockWidth, u = c.formulaBlockHeight, d = Math.max(o, t.rowStart), i = Math.min(n, t.rowEnd);
+	if (d > i) return;
+	const w = Math.max(r, t.colStart), f = Math.min(l, t.colEnd);
+	if (w > f) return;
+	const S = t.rowEnd - t.rowStart - (u - 1), h = t.colEnd - t.colStart - (s - 1), m = c.$absRowEnd ? 0 : Math.max(0, d - t.rowStart - S), g = c.$absRowStart ? u - 1 : Math.min(u - 1, i - t.rowStart), I = c.$absColEnd ? 0 : Math.max(0, w - t.colStart - h), E = c.$absColStart ? s - 1 : Math.min(s - 1, f - t.colStart);
+	if (m > g || I > E) return;
+	let p = 1, x = 0, b = 1, C = 0;
+	if (o >= t.rowStart && o <= t.rowEnd && r >= t.colStart && r <= t.colEnd) {
+		const n = o - t.rowStart, l = r - t.colStart;
+		p = c.$absRowEnd ? 0 : Math.max(0, n - S), x = c.$absRowStart ? u - 1 : Math.min(u - 1, n), b = c.$absColEnd ? 0 : Math.max(0, l - h), C = c.$absColStart ? s - 1 : Math.min(s - 1, l);
+	}
+	const M = c.formulaEntry.value, R = M.ref, y = (t) => {
+		const o = t.rowIndex - R.rowStart, r = t.colIndex - R.colStart;
+		o >= p && o <= x && r >= b && r <= C || e(t);
+	};
+	null !== a ? a(M, R.rowStart + m, R.rowStart + g, R.colStart + I, R.colStart + E, y) : M.forEachNodeIn(R.rowStart + m, R.rowStart + g, R.colStart + I, R.colStart + E, y);
+}
+function $(t) {
+	const { row: o, col: r, rows: n, cols: l, rowInput: e, colInput: a } = t, c = (t, o, r, n) => ({
+		rowStart: t,
+		colStart: o,
+		rowEnd: r,
+		colEnd: n
+	}), s = c(o - 1, r, o - 1, r + l - 1), u = c(o, r - 1, o + n - 1, r - 1);
+	return null !== e && null !== a ? [
+		c(o - 1, r - 1, o - 1, r - 1),
+		s,
+		u
+	] : null !== a ? [s, u] : [u, s];
+}
+var F = (t, o, r) => {
+	const { gridId: n, row: l, col: e } = t;
+	return null !== t.rowInput && null !== t.colInput ? {
+		gridId: n,
+		row: l - 1,
+		col: e - 1
+	} : null !== t.colInput ? {
+		gridId: n,
+		row: l - 1,
+		col: e + r
+	} : {
+		gridId: n,
+		row: l + o,
+		col: e - 1
+	};
+}, T = (t, o) => ({
+	gridId: t.gridId,
+	row: t.row - 1,
+	col: t.col + o
+}), v = (t, o) => ({
+	gridId: t.gridId,
+	row: t.row + o,
+	col: t.col - 1
+}), A = (t, o) => 32768 * t + o;
+function k(t, r) {
+	const n = t.getPrecedents(), l = t.getDynamics(), e = /* @__PURE__ */ new Map(), a = [];
+	let c = !1;
+	const s = [], u = (t) => {
+		if (t.block.hasDataTable()) return;
+		const o = t.gridId;
+		if (!o) return;
+		let r = e.get(o);
+		r || (r = {
+			byCell: /* @__PURE__ */ new Map(),
+			spills: []
+		}, e.set(o, r));
+		const n = A(t.rowIndex, t.colIndex);
+		r.byCell.has(n) || (r.byCell.set(n, t), t.cachedValue?.isIRange && r.spills.push(t), a.push(t));
+	}, d = (t, o, r, n, l) => {
+		if (t.unanchored) return;
+		const e = t.ref;
+		t.mintNodesIn(e.rowStart + o, e.rowStart + r, e.colStart + n, e.colStart + l, u);
+	}, i = (t, o) => {
+		if (o.unanchored || o.hasDataTable()) return;
+		c = !0;
+		const r = o.ref;
+		o.mintNodesIn(r.rowStart, r.rowEnd, r.colStart, r.colEnd, u);
+	}, f = {
+		colStart: 0,
+		rowStart: 0,
+		colEnd: 0,
+		rowEnd: 0,
+		scope: r.gridId
+	}, S = (t, o, r, l, e) => {
+		f.rowStart = o, f.colStart = r, f.rowEnd = l, f.colEnd = e, f.scope = t, function(t, o, r, n, l) {
+			r.length = 0, t.search(o, !1, !1, r);
+			const e = r.length;
+			if (0 === e) return;
+			const a = o.colStart, c = o.rowStart, s = o.colEnd - a, u = o.rowEnd - c;
+			for (let t = 0; t < e; t++) {
+				const o = r[t], e = o.value, d = e.formulaEntry.value;
+				if (e.index < 0) {
+					l(o, d);
+					continue;
+				}
+				const i = d.ref, w = i.colEnd - i.colStart, f = i.rowEnd - i.rowStart, S = o.colEnd - o.colStart - w, h = o.rowEnd - o.rowStart - f;
+				let m = 0, g = f, I = 0, E = w;
+				const p = c - o.rowStart, x = a - o.colStart;
+				e.$absRowEnd || (m = Math.min(Math.max(p - h, 0), f)), e.$absRowStart || (g = Math.min(p + u, f)), e.$absColEnd || (I = Math.min(Math.max(x - S, 0), w)), e.$absColStart || (E = Math.min(s + x, w)), n(d, m, g, I, E);
+			}
+		}(n, f, s, d, i);
+	}, { rowInput: h, colInput: m } = r;
+	h && S(r.gridId, h.rowIndex, h.colIndex, h.rowIndex, h.colIndex), m && S(r.gridId, m.rowIndex, m.colIndex, m.rowIndex, m.colIndex);
+	for (let t = 0; t < a.length; t++) {
+		const o = a[t], r = o.gridId, n = o.rowIndex, e = o.colIndex, s = o.cachedValue;
+		s?.isIRange ? S(r, n, e, n + s.getRowCount() - 1, e + s.getColumnCount() - 1) : S(r, n, e, n, e), !c && l.has(o.block) && (c = !0);
+	}
+	if (0 === a.length) return a;
+	const g = [], I = (t) => {
+		const o = e.get(t.gridId)?.byCell.get(A(t.row, t.col)) ?? null;
+		null === o || g.includes(o) || g.push(o);
+	};
+	for (let t = 0; t < r.rows; t++) {
+		m && I(v(r, t));
+		for (let o = 0; o < r.cols; o++) I(F(r, t, o));
+	}
+	if (h) for (let t = 0; t < r.cols; t++) I(T(r, t));
+	if (0 === g.length) return [];
+	const E = [], p = /* @__PURE__ */ new Set(), x = /* @__PURE__ */ new Set(), b = (t) => {
+		if (p.has(t) || x.has(t)) return;
+		x.add(t);
+		const r = ((t) => {
+			const r = [], n = w(t);
+			for (let l = 0; l < n.length; l++) {
+				const a = n[l];
+				if (o.isError(a)) continue;
+				const c = e.get(a.scope ?? t.gridId);
+				if (!c) continue;
+				const s = a.rowStart, u = a.colStart, d = a.rowEnd, i = a.colEnd;
+				if (s === d && u === i) {
+					const t = c.byCell.get(A(s, u));
+					t && !r.includes(t) && r.push(t);
+				} else for (const t of c.byCell.values()) {
+					const o = t.rowIndex, n = t.colIndex;
+					o >= s && o <= d && n >= u && n <= i && !r.includes(t) && r.push(t);
+				}
+				const w = c.spills;
+				for (let t = 0; t < w.length; t++) {
+					const o = w[t], n = o.cachedValue, l = o.rowIndex, e = o.colIndex;
+					l <= d && l + n.getRowCount() - 1 >= s && e <= i && e + n.getColumnCount() - 1 >= u && !r.includes(o) && r.push(o);
+				}
+			}
+			return r;
+		})(t);
+		for (let t = 0; t < r.length; t++) b(r[t]);
+		x.delete(t), p.add(t), E.push(t);
+	};
+	if (c) for (let t = 0; t < a.length; t++) b(a[t]);
+	else for (let t = 0; t < g.length; t++) b(g[t]);
+	return E;
+}
+function B(t, o, r) {
+	const { rows: n, cols: l, rowInput: e, colInput: a, gridId: c } = o, s = new Array(n);
+	for (let t = 0; t < n; t++) s[t] = new Array(l);
+	const u = (o) => t.layerFor(o.gridId).getValueAt(o.row, o.col) ?? null, d = (o, r) => {
+		t.layerFor(c).set(o.rowIndex, o.colIndex, r);
+	}, i = (o, r) => {
+		const n = t.layerFor(o.gridId), l = o.rowIndex, e = o.colIndex, a = r;
+		if (a?.isIRange) {
+			const t = a.getRowCount(), o = a.getColumnCount();
+			for (let r = 0; r < t; r++) for (let t = 0; t < o; t++) n.set(l + r, e + t, a.getValueAt(r, t) ?? null);
+			return;
+		}
+		n.set(l, e, r);
+	}, w = () => {
+		for (let o = 0; o < r.length; o++) {
+			const n = r[o];
+			i(n, t.evaluate(n));
+		}
+	};
+	for (let t = 0; t < n; t++) {
+		null !== a && (d(a, u(v(o, t))), null === e && w());
+		for (let r = 0; r < l; r++) null !== e && (d(e, u(T(o, r))), w()), s[t][r] = u(F(o, t, 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, M as o, k as p, C as r, R as s, $ as t, f as u };

package/assets/BrcQmHcE7Hcr1erJ.js

@@ -0,0 +1,24 @@
+/**
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.15
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { dirname as t, join as r } from "node:path";
+import { readFileSync as i } from "node:fs";
+async function e() {
+	try {
+		return await import("typescript");
+	} catch (t) {
+		throw console.error("Error initializing Node TypeScript module:", t), t;
+	}
+}
+function o(e, o) {
+	const n = t(e.getDefaultLibFilePath({}));
+	try {
+		return i(r(n, o), "utf8");
+	} catch {
+		return;
+	}
+}
+export { e as initialize, o as readLibFile };