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

package/assets/{C7iHn3y3HVBHflpA.js → DS9HD6_BPxzdun0X.js}

@@ -1,12 +1,12 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.19
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { C as t, F as e, U as n } from "./BJBoygm-gY68bLAP.js";
-import { d as r } from "./MW2nt7se27FlH9Yb.js";
-import { Kt as s, U as o, pr as i, xr as a } from "./Bni-y4FJS4rkFYtn.js";
+import { C as t, F as e, U as n } from "./Cgf5GQVN-D8SlQ7A.js";
+import { u as r } from "./bJ-XKvDf7IkAafUI.js";
+import { Dr as s, E as o, I as i, Q as a } from "./exNO4fmccU8Aq8cE.js";
 var l = [
 	"customMenu",
 	"description",
@@ -331,9 +331,9 @@ var l = [
 	toString() {
 		return this._parts.join("");
 	}
-}, J = (t) => t.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/"/g, "&quot;"), K = (t) => "1" === t || "true" === t || "0" !== t && "false" !== t && null, _ = (t) => t ? "1" : "0", X = /^[-+]?(?:\d+\.?\d*|\.\d+)(?:[eE][-+]?\d+)?$/, Y = (t) => {
-	const e = K(t);
-	return null !== e ? _(e) : X.test(t) ? String(Number(t)) : t;
+}, J = (t) => t.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/"/g, "&quot;"), _ = (t) => "1" === t || "true" === t || "0" !== t && "false" !== t && null, K = (t) => t ? "1" : "0", X = /^[-+]?(?:\d+\.?\d*|\.\d+)(?:[eE][-+]?\d+)?$/, Y = (t) => {
+	const e = _(t);
+	return null !== e ? K(e) : X.test(t) ? String(Number(t)) : t;
 }, Q = /* @__PURE__ */ new Set([
 	"date1904",
 	"roundedCorners",
@@ -482,14 +482,14 @@ var l = [
 			return e;
 		})(t);
 		if (void 0 === n) return;
-		if ("bool" === e) return null === n || (K(n) ?? void 0);
+		if ("bool" === e) return null === n || (_(n) ?? void 0);
 		if (null === n) return;
 		if ("str" === e) return n;
 		const r = Number(n);
 		return Number.isFinite(r) && ("int" !== e || Number.isInteger(r)) && Y(String(r)) === Y(n) ? r : void 0;
 	},
 	write: (n, s) => {
-		n.val(st(r, t), "bool" === e ? _(s) : String(s));
+		n.val(st(r, t), "bool" === e ? K(s) : String(s));
 	}
 }), it = (t, e = t, n = "c") => ({
 	tags: [t],
@@ -517,11 +517,11 @@ var l = [
 	key: n,
 	read: (t) => {
 		if ("str" === e) return t;
-		if ("bool" === e) return K(t) ?? void 0;
+		if ("bool" === e) return _(t) ?? void 0;
 		const n = Number(t);
 		return Number.isFinite(n) && ("int" !== e || Number.isInteger(n)) ? 1 === r ? n : n / r : void 0;
 	},
-	write: (t) => "bool" === e ? _(t) : "str" === e ? t : String(1 === r ? t : Math.round(t * r))
+	write: (t) => "bool" === e ? K(t) : "str" === e ? t : String(1 === r ? t : Math.round(t * r))
 }), dt = (t, e, n, r) => ({
 	name: t,
 	key: e,
@@ -735,7 +735,7 @@ var l = [
 				if (!n) return;
 				const r = { type: e.Type.Gradient };
 				if (void 0 !== n.rotWithShape) {
-					const t = K(n.rotWithShape);
+					const t = _(n.rotWithShape);
 					if (null === t) return;
 					r.isRotatedWithShape = t;
 				}
@@ -759,7 +759,7 @@ var l = [
 						r.angle = (Number(t.ang) / 6e4 + 90) % 360;
 					}
 					if (void 0 !== t.scaled) {
-						const e = K(t.scaled);
+						const e = _(t.scaled);
 						if (null === e) return;
 						r.scaled = e;
 					}
@@ -817,7 +817,7 @@ var l = [
 			case e.Type.Gradient:
 				((t, n) => {
 					const r = [];
-					if (void 0 !== n.flip && r.push(["flip", n.flip]), void 0 !== n.isRotatedWithShape && r.push(["rotWithShape", _(n.isRotatedWithShape)]), t.open(ut("gradFill"), r), n.stops) {
+					if (void 0 !== n.flip && r.push(["flip", n.flip]), void 0 !== n.isRotatedWithShape && r.push(["rotWithShape", K(n.isRotatedWithShape)]), t.open(ut("gradFill"), r), n.stops) {
 						t.open(ut("gsLst"));
 						for (const e of n.stops) {
 							const { offset: n, color: r } = "string" == typeof e ? {
@@ -830,7 +830,7 @@ var l = [
 					}
 					if (n.gradientType === e.GradientType.Linear) {
 						const e = [];
-						void 0 !== n.angle && e.push(["ang", String(Math.round((n.angle - 90 + 360) % 360 * 6e4))]), void 0 !== n.scaled && e.push(["scaled", _(n.scaled)]), t.open(ut("lin"), e, !0);
+						void 0 !== n.angle && e.push(["ang", String(Math.round((n.angle - 90 + 360) % 360 * 6e4))]), void 0 !== n.scaled && e.push(["scaled", K(n.scaled)]), t.open(ut("lin"), e, !0);
 					} else if (void 0 !== n.gradientType) {
 						const r = n.gradientType === e.GradientType.Path ? "circle" : n.gradientType;
 						n.focus ? (t.open(ut("path"), [["path", r]]), St(t, "fillToRect", {
@@ -981,13 +981,13 @@ var l = [
 		lt("altLang", "str", "alternateLanguage"),
 		lt("sz", "int", "size", 100),
 		dt("b", "weight", (t) => {
-			const e = K(t);
+			const e = _(t);
 			return null === e ? void 0 : e ? 700 : 400;
-		}, (t) => _(t >= 600)),
+		}, (t) => K(t >= 600)),
 		dt("i", "style", (t) => {
-			const e = K(t);
+			const e = _(t);
 			return null === e ? void 0 : e ? "italic" : "normal";
-		}, (t) => _("italic" === t)),
+		}, (t) => K("italic" === t)),
 		jt("u", "underline", {
 			none: "none",
 			words: "words",
@@ -1137,9 +1137,9 @@ var l = [
 	it("formatCode"),
 	ot("ptCount", "int"),
 	at("pt", zt, "points", { many: !0 })
-] }, Ht = { fields: [ot("ptCount", "int"), at("pt", zt, "points", { many: !0 })] }, Gt = { fields: [ot("ptCount", "int"), at("lvl", { fields: [at("pt", zt, "points", { many: !0 })] }, "levels", { many: !0 })] }, qt = { fields: [it("f"), at("numCache", Vt, "cache")] }, Jt = { fields: [it("f"), at("strCache", Ht, "cache")] }, Kt = { fields: [it("f"), at("multiLvlStrCache", Gt, "cache")] }, _t = at("datalabelsRange", { fields: [it("f", "f", "c15"), at("dlblRangeCache", Ht, "cache", { ns: "c15" })] }, "datalabelsRange", { ns: "c15" }), Xt = {
-	..._t,
-	read: (t, e, n) => e[A.c15] === R ? _t.read(t, e, n) : void 0
+] }, Ht = { fields: [ot("ptCount", "int"), at("pt", zt, "points", { many: !0 })] }, Gt = { fields: [ot("ptCount", "int"), at("lvl", { fields: [at("pt", zt, "points", { many: !0 })] }, "levels", { many: !0 })] }, qt = { fields: [it("f"), at("numCache", Vt, "cache")] }, Jt = { fields: [it("f"), at("strCache", Ht, "cache")] }, _t = { fields: [it("f"), at("multiLvlStrCache", Gt, "cache")] }, Kt = at("datalabelsRange", { fields: [it("f", "f", "c15"), at("dlblRangeCache", Ht, "cache", { ns: "c15" })] }, "datalabelsRange", { ns: "c15" }), Xt = {
+	...Kt,
+	read: (t, e, n) => e[A.c15] === R ? Kt.read(t, e, n) : void 0
 }, Yt = ot("showDataLabelsRange", "bool", "showDataLabelsRange", "c15"), Qt = {
 	...Yt,
 	read: (t, e, n) => e[A.c15] === R ? Yt.read(t, e, n) : void 0
@@ -1148,7 +1148,7 @@ var l = [
 	fields: [Xt, Qt],
 	declares: (t) => void 0 !== t.datalabelsRange || void 0 !== t.showDataLabelsRange ? [[`xmlns:${A.c15}`, R]] : []
 }, "extensions", { many: !0 })] }, te = { fields: [
-	at("multiLvlStrRef", Kt),
+	at("multiLvlStrRef", _t),
 	at("numRef", qt),
 	at("numLit", Vt),
 	at("strRef", Jt),
@@ -1753,12 +1753,12 @@ var l = [
 	ot("plotVisOnly", "bool"),
 	ot("dispBlanksAs", "str"),
 	ot("showDLblsOverMax", "bool")
-] }, Ke = { fields: [it("name"), ot("fmtId", "int")] }, _e = { fields: [
+] }, _e = { fields: [it("name"), ot("fmtId", "int")] }, Ke = { fields: [
 	ot("date1904", "bool"),
 	ot("lang", "str"),
 	ot("roundedCorners", "bool"),
 	ot("style", "int"),
-	at("pivotSource", Ke),
+	at("pivotSource", _e),
 	at("chart", Je),
 	Bt(),
 	Wt()
@@ -1769,7 +1769,7 @@ var l = [
 	if (!E(G(e, n))) return null;
 	const r = new tt(t, n);
 	return {
-		model: nt(e, _e, W, r),
+		model: nt(e, Ke, W, r),
 		kept: r.kept,
 		reordered: r.reordered
 	};
@@ -1789,7 +1789,7 @@ var l = [
 		n(A.c, j), n(A.a, $), n(A.r, O);
 		const r = new q().raw(Ye);
 		return ((t, e) => {
-			rt(t, "c:chartSpace", e, _e);
+			rt(t, "c:chartSpace", e, Ke);
 		})(r, {
 			...t,
 			unknown: {
@@ -2128,7 +2128,7 @@ var l = [
 		delete: !0
 	}))];
 	return n.length > 0 && (e.labels = n), e;
-}, Kn = (t, e) => {
+}, _n = (t, e) => {
 	const n = (t ?? []).map((t) => ({ ...t }));
 	for (const t of [...e ?? []].sort((t, e) => t - e)) {
 		const e = n.find((e) => e.idx === t);
@@ -2138,7 +2138,7 @@ var l = [
 		});
 	}
 	return n.length > 0 ? n : void 0;
-}, _n = (t) => {
+}, Kn = (t) => {
 	if (!t) return;
 	const { subtotals: e, ...n } = t;
 	return Object.keys(n).length > 0 ? n : void 0;
@@ -2164,9 +2164,9 @@ var l = [
 		uniqueId: t.uniqueId,
 		tx: Hn(t.tx),
 		spPr: t.spPr,
-		points: Kn(t.points, t.layoutPr?.subtotals),
+		points: _n(t.points, t.layoutPr?.subtotals),
 		dLbls: Jn(t.dataLabels),
-		layoutPr: _n(t.layoutPr),
+		layoutPr: Kn(t.layoutPr),
 		unknown: t.unknown
 	});
 	for (const t of e?.dimensions ?? []) {
@@ -2180,9 +2180,9 @@ var l = [
 	uniqueId: t.uniqueId,
 	tx: Hn(t.tx),
 	spPr: t.spPr,
-	points: Kn(t.points, t.layoutPr?.subtotals),
+	points: _n(t.points, t.layoutPr?.subtotals),
 	dLbls: Jn(t.dataLabels),
-	layoutPr: _n(t.layoutPr),
+	layoutPr: Kn(t.layoutPr),
 	axIds: t.axisIds,
 	unknown: t.unknown
 }), tr = (t, e) => {

package/assets/{BgldX21zhey2aR9D.js → DSNaHPvgqymqpsko.js}

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

package/assets/{CUbCBf24Ie4A2l4R.js → DT_kCIZ600UsFy4t.js}

@@ -1,7 +1,7 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.19
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-export { r as addSubpathsBounds, n as decorateSubpaths, i as emptyBox, t as subpathsToSVG } from "./CshK6Ew7OQ7mngI3.js";
+export { r as addSubpathsBounds, n as decorateSubpaths, i as emptyBox, t as subpathsToSVG } from "./CqvcgwQ0UcKndrhO.js";

package/assets/{B2BfjRdJGZs6afVL.js → DXORLAVmseFlsxkG.js}

@@ -1,10 +1,10 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.19
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { i as t, n as e, r as n, t as r } from "./CshK6Ew7OQ7mngI3.js";
+import { i as t, n as e, r as n, t as r } from "./CqvcgwQ0UcKndrhO.js";
 var s = 6e4, a = Math.PI / 180 / s, c = 108e5 / Math.PI, o = /^[+-]?\d+$/, u = (t) => o.test(t) ? Number(t) : t, i = /* @__PURE__ */ new WeakMap();
 function h(t) {
 	let e = i.get(t);

package/assets/{CWLleOolFzyT0COW.js → DXe8SG12UJoGbbWR.js}

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

package/assets/{DV6WSFmSEKfb3d2s.js → D_6TeeMN5zmoQPTm.js}

@@ -1,12 +1,12 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.17
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.19
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { ht as e } from "./CfA8o-FNret9-D6Y.js";
-import { c as t, i as n, p as a } from "./MW2nt7se27FlH9Yb.js";
-import { c as r, s as i } from "./0kfwZuOHUkJmVjg6.js";
+import { ht as e } from "./B7vRFm79CUJ1VvFw.js";
+import { c as t, f as n, i as a } from "./bJ-XKvDf7IkAafUI.js";
+import { c as r, s as i } from "./D005GbIBowRGfwed.js";
 var o = /* @__PURE__ */ new Map([["IReferenceRange", "p"], ["IRange", "r"]]), s = new Set(Object.values(t).filter((e) => e !== t.Omitted)), l = /* @__PURE__ */ new Map([
 	["IWorkbook", "workbook"],
 	["IWorksheet", "sheet"],
@@ -20,9 +20,9 @@ var o = /* @__PURE__ */ new Map([["IReferenceRange", "p"], ["IRange", "r"]]), s
 }, m = /* @__PURE__ */ new Map([
 	["Scalar", "*"],
 	["Lambda", "l"],
-	["FormulaError.Known", a.Error],
-	["Date", n.Date],
-	["IRichData", n.RichData]
+	["FormulaError.Known", n.Error],
+	["Date", a.Date],
+	["IRichData", a.RichData]
 ]), c = /* @__PURE__ */ new Map([["Repeating", "repeating"]]), p = /* @__PURE__ */ new Set(["Flatten", "SheetXL.Flatten"]), g = /* @__PURE__ */ new Set(["AcceptError"]), y = /* @__PURE__ */ new Set(["Omittable"]), f = /* @__PURE__ */ new Set(["NoLift"]), h = /* @__PURE__ */ new Set(["NoFilter"]), v = /* @__PURE__ */ new Set(["Lazy"]), $ = /* @__PURE__ */ new Set(["ReportType"]), b = /^[a-zA-Z_-￿][a-zA-Z0-9_.-￿]*$/, T = /^([a-z]{1,3})([0-9]+)$/i, w = /^r[0-9]*c[0-9]*$/i, x = "SheetXL", S = (e) => {
 	const t = e.typeName.getText();
 	return t.startsWith(`${x}.`) ? t.slice(8) : t;
@@ -62,7 +62,7 @@ var k = /* @__PURE__ */ new Map([["Volatile", () => ({ volatile: !0 })], [`${x}.
 	}
 	return t.replace(/\r\n?/g, "\n").split(/\n[^\S\n]*\n\s*/).map((e) => e.split("\n").map((e) => e.trim()).filter(Boolean).join(" ")).filter(Boolean).join("\n").trim();
 };
-function I(t, n, u, I) {
+function I(t, a, u, I) {
 	const E = I?.builtInNames?.length ? new Set(I.builtInNames.map((e) => e.toUpperCase())) : null, F = [], D = /* @__PURE__ */ new Map(), M = [];
 	let C = null;
 	const P = (e, t, n, a) => {
@@ -114,7 +114,7 @@ function I(t, n, u, I) {
 			Q(o[0], e, r, !1, { count: 0 }), s = e.scalar ?? "*";
 		}
 		return a.lambda = s, !0;
-	}, G = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Set(), q = /* @__PURE__ */ new WeakSet(), W = (e) => void 0 !== e && e.getSourceFile() === n, X = (t, n = !1) => t.getJsDocTags(u).find((e) => "name" === e.name)?.text?.map((e) => e.text).join("").trim() || (n ? e.camelToPrettyCase(t.name) : t.name), Z = (e) => {
+	}, G = /* @__PURE__ */ new Map(), B = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Set(), q = /* @__PURE__ */ new WeakSet(), W = (e) => void 0 !== e && e.getSourceFile() === a, X = (t, n = !1) => t.getJsDocTags(u).find((e) => "name" === e.name)?.text?.map((e) => e.text).join("").trim() || (n ? e.camelToPrettyCase(t.name) : t.name), Z = (e) => {
 		const t = e.getJsDocTags(u).find((e) => "deprecated" === e.name);
 		if (t) return t.text?.map((e) => e.text).join("").trim() || !0;
 	}, H = (e, i) => {
@@ -122,11 +122,11 @@ function I(t, n, u, I) {
 		if (o) {
 			if (l && l.flags & t.SymbolFlags.Alias) return void U(e, r.EnumNotLocal, `'${o.getText()}' is imported, so its declaration cannot be read: '${i}'. An enum must be declared in the module that uses it.`);
 			if (!(l && l.flags & t.SymbolFlags.Type)) {
-				const a = o.getText();
-				return (l ? 0 !== (l.flags & t.SymbolFlags.Variable) : n.statements.some((e) => t.isVariableStatement(e) && e.declarationList.declarations.some((e) => t.isIdentifier(e.name) && e.name.text === a))) ? void U(e, r.EnumMissingAlias, `'${a}' is a value, not a type: '${i}'. Pair the object with a same-name type — 'type ${a} = typeof ${a}[keyof typeof ${a}];' — or declare it as 'enum ${a} { … }'.`) : null;
+				const n = o.getText();
+				return (l ? 0 !== (l.flags & t.SymbolFlags.Variable) : a.statements.some((e) => t.isVariableStatement(e) && e.declarationList.declarations.some((e) => t.isIdentifier(e.name) && e.name.text === n))) ? void U(e, r.EnumMissingAlias, `'${n}' is a value, not a type: '${i}'. Pair the object with a same-name type — 'type ${n} = typeof ${n}[keyof typeof ${n}];' — or declare it as 'enum ${n} { … }'.`) : null;
 			}
-			const a = G.get(l);
-			if (void 0 !== a) return a;
+			const n = G.get(l);
+			if (void 0 !== n) return n;
 			if (J.has(l)) return;
 		}
 		const d = [];
@@ -200,7 +200,7 @@ function I(t, n, u, I) {
 		}
 		const y = {
 			id: p,
-			type: c ? a.Number : a.String,
+			type: c ? n.Number : n.String,
 			members: d.map(([e, t, , , n]) => n ? [
 				e,
 				t,
@@ -215,100 +215,100 @@ function I(t, n, u, I) {
 			f && (e.summary = f), Object.keys(h).length > 0 && (e.members = h), _.set(y, e);
 		}
 		return y;
-	}, Q = (e, n, i, s, u, b = !1, T = !1, w = !1) => {
+	}, Q = (e, a, i, s, u, b = !1, T = !1, w = !1) => {
 		if (e) {
-			if (e.kind === t.SyntaxKind.ParenthesizedType) return Q(e.type, n, i, s, u, b, T, w);
+			if (e.kind === t.SyntaxKind.ParenthesizedType) return Q(e.type, a, i, s, u, b, T, w);
 			if (e.kind === t.SyntaxKind.UnionType) {
-				const a = (e) => e.kind === t.SyntaxKind.UndefinedKeyword || e.kind === t.SyntaxKind.VoidKeyword || e.kind === t.SyntaxKind.NullKeyword || e.kind === t.SyntaxKind.LiteralType && e.literal?.kind === t.SyntaxKind.NullKeyword, l = e.types.filter((e) => !a(e));
-				if (1 === l.length) return Q(l[0], n, i, s, u, b, T, w);
-				const d = H(e, n.name ?? z(e));
+				const n = (e) => e.kind === t.SyntaxKind.UndefinedKeyword || e.kind === t.SyntaxKind.VoidKeyword || e.kind === t.SyntaxKind.NullKeyword || e.kind === t.SyntaxKind.LiteralType && e.literal?.kind === t.SyntaxKind.NullKeyword, l = e.types.filter((e) => !n(e));
+				if (1 === l.length) return Q(l[0], a, i, s, u, b, T, w);
+				const d = H(e, a.name ?? z(e));
 				if (void 0 === d) return;
-				if (null !== d) return n.scalar = d.type, void (s && (n.enum = d));
-				if (!s) return void (n.scalar = "*");
+				if (null !== d) return a.scalar = d.type, void (s && (a.enum = d));
+				if (!s) return void (a.scalar = "*");
 				if (2 === l.length) {
-					const e = (e) => e.kind === t.SyntaxKind.TypeReference && t.isTypeReferenceNode(e) && "Lambda" === S(e), a = l.findIndex(e);
-					if (a >= 0 && !e(l[1 - a])) return Q(l[1 - a], n, i, s, u, b, T, w), void V(l[a], S(l[a]), n, i, s);
+					const e = (e) => e.kind === t.SyntaxKind.TypeReference && t.isTypeReferenceNode(e) && "Lambda" === S(e), n = l.findIndex(e);
+					if (n >= 0 && !e(l[1 - n])) return Q(l[1 - n], a, i, s, u, b, T, w), void V(l[n], S(l[n]), a, i, s);
 				}
 				if (s && 2 === l.length) {
 					const e = (e) => {
 						if (e.kind === t.SyntaxKind.TypeReference && !e.typeArguments?.length) return o.get(S(e));
-					}, a = l.findIndex((t) => void 0 !== e(t));
-					if (a >= 0 && void 0 === e(l[1 - a])) {
+					}, n = l.findIndex((t) => void 0 !== e(t));
+					if (n >= 0 && void 0 === e(l[1 - n])) {
 						const t = {}, r = u.count;
-						if (Q(l[1 - a], t, i, s, u, b, !1), t.scalar && !t.range && null == t.lambda && u.count === r) {
-							n.range = e(l[a]), n.scalar = t.scalar, n.valueOrRange = !0;
+						if (Q(l[1 - n], t, i, s, u, b, !1), t.scalar && !t.range && null == t.lambda && u.count === r) {
+							a.range = e(l[n]), a.scalar = t.scalar, a.valueOrRange = !0;
 							const r = t.enum;
-							r && (n.enum = r);
+							r && (a.enum = r);
 							return;
 						}
 					}
 				}
 				if (s && 2 === l.length) {
-					const a = (e) => e.kind === t.SyntaxKind.TypeReference && !e.typeArguments?.length && "Scalar" === S(e), r = l.findIndex(a);
-					if (r >= 0 && !a(l[1 - r])) {
-						const t = H(l[1 - r], n.name ?? z(e));
+					const n = (e) => e.kind === t.SyntaxKind.TypeReference && !e.typeArguments?.length && "Scalar" === S(e), r = l.findIndex(n);
+					if (r >= 0 && !n(l[1 - r])) {
+						const t = H(l[1 - r], a.name ?? z(e));
 						if (void 0 === t) return;
-						if (null !== t) return n.scalar = "*", void (n.enum = t);
+						if (null !== t) return a.scalar = "*", void (a.enum = t);
 					}
 				}
 				U(e, r.InvalidParamType, `Union parameter types are not supported: '${z(e)}'. Use a single type, optionally with '| null' or '| undefined', 'T | Lambda<…>' for a value-or-lambda slot, 'IRange | Scalar' for a value-or-range slot, or 'E | Scalar' for an uncoerced slot whose values an enum documents.`);
 				return;
 			}
-			if (e.kind === t.SyntaxKind.NumberKeyword) n.scalar = a.Number;
-			else if (e.kind === t.SyntaxKind.StringKeyword) n.scalar = a.String;
-			else if (e.kind === t.SyntaxKind.BooleanKeyword) n.scalar = a.Boolean;
+			if (e.kind === t.SyntaxKind.NumberKeyword) a.scalar = n.Number;
+			else if (e.kind === t.SyntaxKind.StringKeyword) a.scalar = n.String;
+			else if (e.kind === t.SyntaxKind.BooleanKeyword) a.scalar = n.Boolean;
 			else if (e.kind === t.SyntaxKind.UndefinedKeyword || e.kind === t.SyntaxKind.NullKeyword || e.kind === t.SyntaxKind.VoidKeyword) {
 				if (s) return void U(e, r.UndefinedInput, `'undefined' is not a valid type for input: '${z(e)}'.`);
-				n.scalar = a.Null;
-			} else if (e.kind === t.SyntaxKind.BigIntKeyword) n.scalar = a.Number;
-			else if (e.kind === t.SyntaxKind.AnyKeyword) s && (n.range = "*");
+				a.scalar = n.Null;
+			} else if (e.kind === t.SyntaxKind.BigIntKeyword) a.scalar = n.Number;
+			else if (e.kind === t.SyntaxKind.AnyKeyword) s && (a.range = "*");
 			else if (e.kind === t.SyntaxKind.ArrayType) {
 				const t = e.elementType;
 				if (!t) return void U(e, r.UntypedArray, `'Array' must be typed: '${z(e)}'.`);
 				if (s && T) {
-					const a = n, r = a.name ?? z(e) ?? "parameter", o = a.acceptError;
-					delete a.acceptError;
+					const n = a, r = n.name ?? z(e) ?? "parameter", o = n.acceptError;
+					delete n.acceptError;
 					const s = { name: r };
-					j(t, s, i, !0), o && !s.acceptError && (s.acceptError = !0), a.repeating = [s];
+					j(t, s, i, !0), o && !s.acceptError && (s.acceptError = !0), n.repeating = [s];
 					return;
 				}
-				u.count++, Q(t, n, i, s, u);
+				u.count++, Q(t, a, i, s, u);
 			} else if (e.kind !== t.SyntaxKind.TupleType) if (e.kind === t.SyntaxKind.TypeReference) {
-				const a = S(e);
-				if (g.has(a)) {
+				const n = S(e);
+				if (g.has(n)) {
 					const t = z(e);
-					if (!s) return void U(e, r.InvalidReturnType, `'${a}' is not a valid return type: '${t}'. It describes how an ARGUMENT is received.`);
-					const o = n;
+					if (!s) return void U(e, r.InvalidReturnType, `'${n}' is not a valid return type: '${t}'. It describes how an ARGUMENT is received.`);
+					const o = a;
 					if (o.acceptError) return void U(e, r.InvalidParamType, `'${t}' declares 'AcceptError' more than once.`);
 					const l = e.typeArguments;
-					return l && 1 === l.length ? (o.acceptError = !0, Q(l[0], n, i, s, u, b, T, w)) : void U(e, r.GenericArity, `'${a}' must be typed with exactly 1 type: '${t}'.`);
+					return l && 1 === l.length ? (o.acceptError = !0, Q(l[0], a, i, s, u, b, T, w)) : void U(e, r.GenericArity, `'${n}' must be typed with exactly 1 type: '${t}'.`);
 				}
-				if ($.has(a)) {
-					const t = n.name ?? z(e);
+				if ($.has(n)) {
+					const t = a.name ?? z(e);
 					if (!s) return void U(e, r.InvalidReturnType, `'ReportType' is not a valid return type: '${t}'. It describes how an ARGUMENT is received.`);
 					const o = e.typeArguments;
-					return o && 1 === o.length ? (n.reportType = !0, Q(o[0], n, i, s, u, b, T, w)) : void U(e, r.GenericArity, `'${a}' must be typed with exactly 1 type: '${t}'.`);
+					return o && 1 === o.length ? (a.reportType = !0, Q(o[0], a, i, s, u, b, T, w)) : void U(e, r.GenericArity, `'${n}' must be typed with exactly 1 type: '${t}'.`);
 				}
-				if (f.has(a)) {
-					const t = n.name ?? z(e);
+				if (f.has(n)) {
+					const t = a.name ?? z(e);
 					if (!s) return void U(e, r.InvalidReturnType, `'NoLift' is not a valid return type: '${t}'. It describes how an ARGUMENT is received.`);
 					const o = e.typeArguments;
-					if (!o || 1 !== o.length) return void U(e, r.GenericArity, `'${a}' must be typed with exactly 1 type: '${t}'.`);
-					const l = n;
+					if (!o || 1 !== o.length) return void U(e, r.GenericArity, `'${n}' must be typed with exactly 1 type: '${t}'.`);
+					const l = a;
 					l.noLift = !0;
 					const d = u.count;
-					Q(o[0], n, i, s, u, b, T, w), (l.range || null != l.lambda || l.repeating || u.count !== d) && U(e, r.InvalidParamType, `'${t}': 'NoLift' applies to a SCALAR parameter only - a range, list, repeating or lambda slot never lifts.`);
+					Q(o[0], a, i, s, u, b, T, w), (l.range || null != l.lambda || l.repeating || u.count !== d) && U(e, r.InvalidParamType, `'${t}': 'NoLift' applies to a SCALAR parameter only - a range, list, repeating or lambda slot never lifts.`);
 					return;
 				}
-				if (h.has(a)) {
-					const t = n.name ?? z(e);
+				if (h.has(n)) {
+					const t = a.name ?? z(e);
 					if (!s) return void U(e, r.InvalidReturnType, `'NoFilter' is not a valid return type: '${t}'. It describes how an ARGUMENT is received.`);
 					const o = e.typeArguments;
-					if (!o || 1 !== o.length) return void U(e, r.GenericArity, `'${a}' must be typed with exactly 1 type: '${t}'.`);
-					const l = n;
+					if (!o || 1 !== o.length) return void U(e, r.GenericArity, `'${n}' must be typed with exactly 1 type: '${t}'.`);
+					const l = a;
 					l.noFilter = !0;
 					const d = u.count;
-					if (Q(o[0], n, i, s, u, b, T, w), l.range || null != l.lambda || u.count !== d) return void U(e, r.InvalidParamType, `'${t}': 'NoFilter' applies to a SCALAR slot only - a range, list or lambda slot has no members to coerce.`);
+					if (Q(o[0], a, i, s, u, b, T, w), l.range || null != l.lambda || u.count !== d) return void U(e, r.InvalidParamType, `'${t}': 'NoFilter' applies to a SCALAR slot only - a range, list or lambda slot has no members to coerce.`);
 					const m = l.repeating;
 					if (m) {
 						if (delete l.noFilter, 1 !== m.length) return void U(e, r.InvalidParamType, `'${t}': 'NoFilter' over a repeating group applies to a period-1 group only - write it on the slot that takes the members.`);
@@ -316,54 +316,54 @@ function I(t, n, u, I) {
 					} else T && U(e, r.InvalidParamType, `'${t}': 'NoFilter' applies to a REPEATING slot only - a single scalar argument has no members to coerce.`);
 					return;
 				}
-				if (y.has(a)) {
-					const o = n.name ?? z(e);
+				if (y.has(n)) {
+					const o = a.name ?? z(e);
 					if (!s) return void U(e, r.InvalidReturnType, `'Omittable' is not a valid return type: '${o}'. It describes how an ARGUMENT is received.`);
 					const l = e.typeArguments;
-					if (!l || l.length < 1 || l.length > 2) return void U(e, r.GenericArity, `'${a}' must be typed with 1 or 2 types: '${o}'.`);
-					const d = n;
+					if (!l || l.length < 1 || l.length > 2) return void U(e, r.GenericArity, `'${n}' must be typed with 1 or 2 types: '${o}'.`);
+					const d = a;
 					if (d.omittable = !0, 2 === l.length) {
-						const n = K(t, l[1]);
-						if (void 0 === n) return void U(e, r.InvalidParamType, `'${o}' declares '${a}' with a second type that is not a literal value. Use a number, string, boolean or null - the engine substitutes it for an omitted argument.`);
-						d.omittedValue = n;
+						const a = K(t, l[1]);
+						if (void 0 === a) return void U(e, r.InvalidParamType, `'${o}' declares '${n}' with a second type that is not a literal value. Use a number, string, boolean or null - the engine substitutes it for an omitted argument.`);
+						d.omittedValue = a;
 					}
-					const m = Q(l[0], n, i, s, u, b, T, w), c = d.omittedValue;
+					const m = Q(l[0], a, i, s, u, b, T, w), c = d.omittedValue;
 					return d.enum && null != c && !d.enum.members.some(([, e]) => e === c) && U(l[1], r.EnumOmittedValue, `'${o}': ${JSON.stringify(c)} is not a member of '${d.enum.id}'. An omitted argument must mean a member (${d.enum.members.map(([, e]) => JSON.stringify(e)).join(", ")}) or null.`), m;
 				}
-				if (v.has(a)) {
-					const o = n.name ?? z(e);
+				if (v.has(n)) {
+					const o = a.name ?? z(e);
 					if (!s) return void U(e, r.InvalidReturnType, `'Lazy' is not a valid return type: '${o}'. It describes how an ARGUMENT is received.`);
-					const l = n;
+					const l = a;
 					if (l.lazy) return void U(e, r.InvalidParamType, `'${o}' declares 'Lazy' more than once.`);
 					const d = e.typeArguments;
-					if (!d || d.length < 1 || d.length > 2) return void U(e, r.GenericArity, `'${a}' must be typed with 1 or 2 types: '${o}'.`);
+					if (!d || d.length < 1 || d.length > 2) return void U(e, r.GenericArity, `'${n}' must be typed with 1 or 2 types: '${o}'.`);
 					if (l.lazy = !0, 2 === d.length) {
-						const n = K(t, d[1]);
-						if (void 0 === n) return void U(e, r.InvalidParamType, `'${o}' declares '${a}' with a second type that is not a literal value. Use a number, string, boolean or null - the engine substitutes it for an absent argument.`);
-						l.optional = !0, l.defaultValue = n;
+						const a = K(t, d[1]);
+						if (void 0 === a) return void U(e, r.InvalidParamType, `'${o}' declares '${n}' with a second type that is not a literal value. Use a number, string, boolean or null - the engine substitutes it for an absent argument.`);
+						l.optional = !0, l.defaultValue = a;
 					}
-					Q(d[0], n, i, s, u, b, T, w), l.enum ? (U(e, r.EnumPosition, `'${o}': 'Lazy' cannot hold the enum '${l.enum.id}'. The argument may never be evaluated, so there is no point at which it could be checked against the members.`), delete l.enum) : null != l.lambda ? U(e, r.InvalidParamType, `'${o}': 'Lazy' cannot be combined with a Lambda parameter - a callable slot is already the body's to call, or not.`) : l.repeating && U(e, r.InvalidParamType, `'${o}': 'Lazy' applies to a VALUE, not to a repeating group - mark the group's slots instead.`);
+					Q(d[0], a, i, s, u, b, T, w), l.enum ? (U(e, r.EnumPosition, `'${o}': 'Lazy' cannot hold the enum '${l.enum.id}'. The argument may never be evaluated, so there is no point at which it could be checked against the members.`), delete l.enum) : null != l.lambda ? U(e, r.InvalidParamType, `'${o}': 'Lazy' cannot be combined with a Lambda parameter - a callable slot is already the body's to call, or not.`) : l.repeating && U(e, r.InvalidParamType, `'${o}': 'Lazy' applies to a VALUE, not to a repeating group - mark the group's slots instead.`);
 					return;
 				}
-				if (p.has(a)) {
-					const t = n.name ?? z(e);
+				if (p.has(n)) {
+					const t = a.name ?? z(e);
 					if (!s) return void U(e, r.InvalidReturnType, `'Flatten' is not a valid return type: '${t}'. It describes how an ARGUMENT is received.`);
 					const o = e.typeArguments;
-					return o && 1 === o.length ? (u.count++, Q(o[0], n, i, s, u, b)) : void U(e, r.GenericArity, `'${a}' must be typed with exactly 1 type: '${t}'.`);
+					return o && 1 === o.length ? (u.count++, Q(o[0], a, i, s, u, b)) : void U(e, r.GenericArity, `'${n}' must be typed with exactly 1 type: '${t}'.`);
 				}
-				if ("repeating" === c.get(a)) {
-					const o = n.name ?? z(e);
+				if ("repeating" === c.get(n)) {
+					const o = a.name ?? z(e);
 					if (!s) return void U(e, r.RepeatingPosition, `'Repeating' is not a valid return type: '${o}'.`);
 					if (0 !== u.count) return void U(e, r.RepeatingPosition, `'Repeating' cannot be nested inside another type: '${o}'.`);
-					const l = n, d = e.typeArguments;
-					if (!d || d.length < 1 || d.length > 2) return void U(e, r.GenericArity, `'${a}' must be typed with 1 type, optionally followed by a maximum argument count: '${o}'.`);
+					const l = a, d = e.typeArguments;
+					if (!d || d.length < 1 || d.length > 2) return void U(e, r.GenericArity, `'${n}' must be typed with 1 type, optionally followed by a maximum argument count: '${o}'.`);
 					let m;
 					if (2 === d.length) {
-						const e = d[1], n = e.kind === t.SyntaxKind.LiteralType ? e.literal : null, s = n && n.kind === t.SyntaxKind.NumericLiteral ? Number(n.text) : NaN;
-						if (!Number.isInteger(s) || s < 1 || s > 255) return void U(e, r.RepeatingMax, `'${o}': '${a}'’s maximum must be a whole number between 1 and 255.`);
+						const e = d[1], a = e.kind === t.SyntaxKind.LiteralType ? e.literal : null, s = a && a.kind === t.SyntaxKind.NumericLiteral ? Number(a.text) : NaN;
+						if (!Number.isInteger(s) || s < 1 || s > 255) return void U(e, r.RepeatingMax, `'${o}': '${n}'’s maximum must be a whole number between 1 and 255.`);
 						m = s, i.maxArguments = s;
 					}
-					if (w) return void 0 === m ? void U(e, r.RepeatingPosition, `'${o}' is a rest parameter and a repeating group. A group already repeats — drop the '...', or give the group a maximum ('Repeating<T, 254>') if the ceiling is all you meant.`) : Q(d[0], n, i, s, u, b, T);
+					if (w) return void 0 === m ? void U(e, r.RepeatingPosition, `'${o}' is a rest parameter and a repeating group. A group already repeats — drop the '...', or give the group a maximum ('Repeating<T, 254>') if the ceiling is all you meant.`) : Q(d[0], a, i, s, u, b, T);
 					const c = l.acceptError;
 					delete l.acceptError;
 					const p = ((e, n, a, i) => {
@@ -387,39 +387,39 @@ function I(t, n, u, I) {
 					p && (l.repeating = p);
 					return;
 				}
-				const R = o.get(a);
+				const R = o.get(n);
 				let L = !1;
-				R && (n.range = R, L = !0);
-				const I = m.get(a);
-				if (I && (n.scalar = I), void 0 !== I && (L = !0), V(e, a, n, i, s)) return;
+				R && (a.range = R, L = !0);
+				const I = m.get(n);
+				if (I && (a.scalar = I), void 0 !== I && (L = !0), V(e, n, a, i, s)) return;
 				if (s) {
-					if ("Volatile" === a || a === `${x}.Volatile`) return void U(e, r.InvalidParamType, `'Volatile' is not a valid parameter type: '${z(e)}'. It describes the function's RESULT, so it belongs on the return type.`);
-					if (N.has(a)) return A;
-					const t = l.get(a);
+					if ("Volatile" === n || n === `${x}.Volatile`) return void U(e, r.InvalidParamType, `'Volatile' is not a valid parameter type: '${z(e)}'. It describes the function's RESULT, so it belongs on the return type.`);
+					if (N.has(n)) return A;
+					const t = l.get(n);
 					if (t) return t;
-				} else if ("Promise" === a) O = e, L = !0;
+				} else if ("Promise" === n) O = e, L = !0;
 				else {
-					const e = k.get(a);
-					e && (Object.assign(n, e()), L = !0);
+					const e = k.get(n);
+					e && (Object.assign(a, e()), L = !0);
 				}
 				if (!L) {
-					const t = H(e, n.name ?? z(e));
+					const t = H(e, a.name ?? z(e));
 					if (void 0 === t) return;
-					if (null !== t) return n.scalar = t.type, void (s && (n.enum = t));
+					if (null !== t) return a.scalar = t.type, void (s && (a.enum = t));
 				}
 				if (!L) {
-					const t = "number, string, boolean, Scalar, Lambda, Date, FormulaError.Known, IRichData, IRange, IReferenceRange (and arrays of these; optionally wrapped in AcceptError<T>, or grouped with Repeating<T>)", n = "number, string, boolean, Scalar, Date, FormulaError.Known, IRichData, IRange, Volatile<T> (and arrays of these)";
+					const t = "number, string, boolean, Scalar, Lambda, Date, FormulaError.Known, IRichData, IRange, IReferenceRange (and arrays of these; optionally wrapped in AcceptError<T>, or grouped with Repeating<T>)", a = "number, string, boolean, Scalar, Date, FormulaError.Known, IRichData, IRange, Volatile<T> (and arrays of these)";
 					let i;
-					i = s ? b ? `'${a}' is not a valid first parameter: '${z(e)}'. The first parameter is EITHER a macro target (making this a macro) OR a calculation input (making this a calculation function). Allowed: ${d.join(", ")} (macro target); ${t} (calculation input).` : `'${a}' is not a valid parameter type: '${z(e)}'. Allowed: ${t}.` : `'${a}' is not a valid return type: '${z(e)}'. Allowed: ${n}.`, U(e, s ? r.InvalidParamType : r.InvalidReturnType, i);
+					i = s ? b ? `'${n}' is not a valid first parameter: '${z(e)}'. The first parameter is EITHER a macro target (making this a macro) OR a calculation input (making this a calculation function). Allowed: ${d.join(", ")} (macro target); ${t} (calculation input).` : `'${n}' is not a valid parameter type: '${z(e)}'. Allowed: ${t}.` : `'${n}' is not a valid return type: '${z(e)}'. Allowed: ${a}.`, U(e, s ? r.InvalidParamType : r.InvalidReturnType, i);
 					return;
 				}
 				const E = e.typeArguments;
 				if (E) {
-					if (1 !== E.length) return void U(e, r.GenericArity, `'${a}' must be typed with exactly 1 type: '${z(e)}'.`);
-					const o = E[0], l = s && t.isTypeReferenceNode(o) && $.has(S(o)), d = n.reportType;
-					l && q.add(n), j(o, n, i, s), l && void 0 === d && delete n.reportType;
-					const u = n.enum;
-					u && !l && (U(E[0], r.EnumPosition, `'${a}' cannot hold the enum '${u.id}': '${z(e)}'. The members of a range reach the body as they are, so nothing checks them against the enum. Take the enum as a value, or type the range by its scalar ('${a}<${u.type}>').`), delete n.enum);
+					if (1 !== E.length) return void U(e, r.GenericArity, `'${n}' must be typed with exactly 1 type: '${z(e)}'.`);
+					const o = E[0], l = s && t.isTypeReferenceNode(o) && $.has(S(o)), d = a.reportType;
+					l && q.add(a), j(o, a, i, s), l && void 0 === d && delete a.reportType;
+					const u = a.enum;
+					u && !l && (U(E[0], r.EnumPosition, `'${n}' cannot hold the enum '${u.id}': '${z(e)}'. The members of a range reach the body as they are, so nothing checks them against the enum. Take the enum as a value, or type the range by its scalar ('${n}<${u.type}>').`), delete a.enum);
 				}
 			} else e.kind === t.SyntaxKind.FunctionType && ((e, n, a, i) => {
 				if (!i) return void U(e, r.FunctionReturn, `Function type is not a valid return type: '${z(e)}'. Declare a 'Lambda' return instead.`);
@@ -428,11 +428,11 @@ function I(t, n, u, I) {
 				o && (o.kind === t.SyntaxKind.AnyKeyword ? l = "raw" : (Q(o, s, a, !1, { count: 0 }), l = s.scalar ?? "*"));
 				const d = e.parameters;
 				d && !d.some((e) => e.dotDotDotToken) && (n.lambdaArity = d.length), n.lambda = l;
-			})(e, n, i, s);
-		} else U(e, r.MissingType, `Type is not defined for '${n?.name ?? "return"}'.`);
+			})(e, a, i, s);
+		} else U(e, r.MissingType, `Type is not defined for '${a?.name ?? "return"}'.`);
 	};
 	try {
-		t.forEachChild(n, (e) => {
+		t.forEachChild(a, (e) => {
 			if (a = e, 0 !== (t.getCombinedModifierFlags(a) & t.ModifierFlags.Export) && t.isFunctionDeclaration(e)) {
 				const a = e?.name?.getText();
 				if (!e.body) return void U(e, r.NoBody, `'${a}': function has no body.`);