@sheetxl/mcp 1.0.0 → 1.0.2

package/assets/DCWHNfq5qCxvALwe.js

@@ -1,199 +0,0 @@
-/**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v1.0.0
-*
-* (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: SheetXL EULA — https://www.sheetxl.com/eula
-*/
-import { Cn as e, Cr as n, Hi as t, Ii as r, Oa as s, Vr as o, Yi as l, bn as i, do as c, nn as a } from "./Dcw7GSCgw_dgsum7.js";
-var u = Symbol("sheetxl.formulaNode.internal"), f = Symbol("sheetxl.formulaNode.value"), p = Symbol("sheetxl.formulaNode.replaced"), g = { canonical: !0 }, v = (e, t) => {
-	const r = e.inputs;
-	let s = null;
-	if (r) {
-		const e = r.length;
-		s = new Array(e);
-		for (let n = 0; n < e; n++) {
-			const e = r[n];
-			s[n] = e ? v(e, t) : e;
-		}
-	}
-	const o = ((e, t) => {
-		const r = e.type, s = e.value;
-		if (r === n.Named) {
-			const n = s;
-			let r = n?.nameId, o = n?.scope ?? null;
-			return t && (r = t.resolve(a.NamedFormula, r)?.toString() ?? r, o && (o = t.resolve(a.Sheet, o)?.toString() ?? o)), e.binding?.declaration && e.binding.optional ? {
-				name: r,
-				scope: o,
-				optional: !0
-			} : {
-				name: r,
-				scope: o
-			};
-		}
-		if (r === n.TableReference) {
-			const e = "string" == typeof s ? s : s?.tableId;
-			return e ? t ? t.resolve(a.Table, e)?.toString() ?? e : e : "";
-		}
-		if (!t) return s;
-		switch (r) {
-			case n.Function: return t.resolve(a.Function, s, g)?.toString() ?? s;
-			case n.TableColumn: return t.resolve(a.TableColumn, s)?.toString() ?? s;
-			case n.Cell: {
-				const e = s;
-				if (e?.scope) {
-					const n = t.resolve(a.Sheet, e.scope)?.toString() ?? e.scope;
-					return {
-						...e,
-						scope: n
-					};
-				}
-				return s;
-			}
-			case n.Error: {
-				const e = s;
-				if (e?.scope) {
-					const n = t.resolve(a.Sheet, e.scope)?.toString() ?? e.scope;
-					return {
-						...e,
-						scope: n
-					};
-				}
-				return s;
-			}
-			default: return s;
-		}
-	})(e, t);
-	return {
-		type: e.type,
-		value: o,
-		inputs: s,
-		isReference: e.isReference,
-		[u]: e,
-		[f]: o
-	};
-}, m = (e, n, t) => {
-	const r = e.inputs;
-	let s;
-	if (r) {
-		const n = r.length;
-		for (let o = 0; o < n; o++) {
-			const n = r[o];
-			if (!n) continue;
-			const l = m(n, e, t);
-			l !== n && (s || (s = [...r]), s[o] = l);
-		}
-	}
-	let o = e;
-	s && (o = {
-		...e,
-		inputs: s
-	});
-	const l = t(o, n);
-	return null == l || l === o ? o : (void 0 === l[u] && void 0 !== o[u] && (l[p] = o[u]), l);
-}, y = [
-	":",
-	".:.",
-	".:",
-	":.",
-	" "
-], b = (r, a) => {
-	const u = r.type, f = r.value;
-	switch (u) {
-		case n.Function: return e(String(f), a);
-		case n.Infix: return o(f, a[0], a[1], r.isReference ?? y.includes(f));
-		case n.Prefix: return l(f, a?.[0], r.isReference ?? "@" === f);
-		case n.Postfix: return t(f, a?.[0], r.isReference ?? "#" === f);
-		case n.Named: {
-			const e = s("string" == typeof f ? f : f?.name), n = "object" == typeof f ? f?.scope : null;
-			return n && (e.value = {
-				...e.value,
-				scope: n
-			}), "object" == typeof f && !0 === f?.optional && (e.value = {
-				...e.value,
-				optional: !0
-			}), e;
-		}
-		case n.Cell: return i(f);
-		case n.TableReference: return {
-			type: n.TableReference,
-			value: f,
-			inputs: a ?? null,
-			isReference: !0
-		};
-		case n.TableSpecifier: return {
-			type: n.TableSpecifier,
-			value: f,
-			image: `[${f}]`,
-			inputs: null,
-			isReference: !0
-		};
-		case n.TableColumn: {
-			const e = "string" == typeof f && f.startsWith("[") ? f : `[${c(String(f))}]`;
-			return {
-				type: n.TableColumn,
-				value: f,
-				image: e,
-				inputs: null,
-				isReference: !0
-			};
-		}
-		case n.String:
-		case n.Number:
-		case n.Boolean: return {
-			type: u,
-			value: f,
-			inputs: null,
-			isLiteral: !0
-		};
-		default: return {
-			type: u,
-			value: f,
-			inputs: a ?? null,
-			isReference: r.isReference
-		};
-	}
-}, d = (e) => {
-	const n = e[u], t = e.inputs;
-	let r = null;
-	if (t) {
-		const e = t.length;
-		r = new Array(e);
-		for (let n = 0; n < e; n++) {
-			const e = t[n];
-			r[n] = e ? d(e) : e;
-		}
-	}
-	if (n) {
-		const t = e.value !== e[f];
-		let s = !1;
-		const o = n.inputs;
-		if (r && o && r.length === o.length) {
-			for (let e = 0; e < r.length; e++) if (r[e] !== o[e]) {
-				s = !0;
-				break;
-			}
-		} else s = null === r != (null == o) || (r?.length ?? 0) !== (o?.length ?? 0);
-		if (!t && !s) return n;
-		if (!t) return {
-			...n,
-			inputs: r
-		};
-		const l = b(e, r);
-		return S(l, n), l;
-	}
-	const s = b(e, r), o = e[p];
-	return o && S(s, o), s;
-}, S = (e, n) => {
-	r(e, n), e.type !== n.type && void 0 !== e.image && (e.image = void 0);
-};
-function h(e, n) {
-	return v(e, n);
-}
-function R(e, n) {
-	return e && "function" == typeof n ? m(e, void 0, n) : e;
-}
-function T(e) {
-	const n = d(e);
-	return !0 === e.legacyIntersect && (n.legacyIntersect = !0), n;
-}
-export { h as n, T as r, R as t };