@sheetxl/sdk 0.8.0-beta.1 → 0.8.0-beta.11

package/README.md

@@ -34,7 +34,7 @@ import { Workbook } from "@sheetxl/sdk";
 
 // Create a workbook
 const wb = new Workbook();
-const sheet = wb.addSheet("Demo");
+const sheet = wb.addWorksheet("Demo");
 
 // Write values
 sheet.getRange("A1").setValue(42);

package/THIRD-PARTY-NOTICES.md

@@ -11,7 +11,7 @@ licensed — see `LICENSE.md`.
 Portions of the number-format engine are derived from [numfmt](https://github.com/borgar/numfmt)
 3.2.6, with local modifications.
 
-```
+``` code
 Copyright (c) 2020, Borgar Þorsteinsson <borgar@borgar.net>
 
 Permission is hereby granted, free of charge, to any person obtaining a copy

package/browser/esm/B7aUIvgUjncMMD_i.mjs

@@ -0,0 +1,394 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { Ht as e, dr as t, fr as n } from "./C16ycKja6zG0crV_.mjs";
+import { D as r, E as i, a, c as o, d as s, f as c, l, m as u, n as d, o as f, p, r as m, s as h, u as g, v as _, w as v } from "./nvU0ClAbf0g94YBK.mjs";
+import { n as y, r as b, t as x } from "./DvAaxH6z_tGvrRzl.mjs";
+import { FormulaError as S } from "@sheetxl/primitives";
+import { CommonUtils as C } from "@sheetxl/utils";
+var w = class {
+	constructor(e) {
+		e = { ...e }, this._editing = e.profile === "editing", this._parser = new b(e);
+	}
+	compile(e, t, d, b, C, w, E, D, O) {
+		if (b.length === 0) {
+			let t = new S.Parse(x);
+			return this._compileUnparsed(e, C, b, {
+				input: b,
+				cause: t,
+				causes: [t]
+			});
+		}
+		if (b.length > n.MAX_EXPRESSION_LENGTH) {
+			let t = new S.Parse(y(b.length, n.MAX_EXPRESSION_LENGTH));
+			return this._compileUnparsed(e, C, b, {
+				input: b,
+				cause: t,
+				causes: [t]
+			});
+		}
+		let k, A, j = [];
+		try {
+			let e = this._parser.parse(t, d, b);
+			k = e.root, j = e.errors, D && k && j.length === 0 && (k.legacyIntersect = !0);
+		} catch (e) {
+			A = S.isError(e, S.Code.Parse) ? e : new S.Parse(e.message, e);
+		}
+		let M = [];
+		for (let e of j) M.push(u(e));
+		if (k) {
+			let e = v(k, w ?? null);
+			typeof e == "string" ? M.push(new S.Parse(e)) : k = e, s(k, w ?? null) && M.push(new S.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), g(k, w ?? null) && M.push(new S.Parse("The spill anchor operator '#' requires a cell or range")), p(k, w ?? null) && M.push(new S.Parse("Expected a reference; a value cannot be converted to one."));
+			let t = f(k, w ?? null);
+			t && M.push(new S.Parse(t));
+			let n = h(k, w ?? null);
+			n && M.push(new S.Parse(n));
+			let r = o(k, w ?? null);
+			r && M.push(new S.Parse(r));
+			let i = l(k);
+			i && M.push(new S.Parse(i));
+		}
+		M.length > 0 && !A && (A = M[0]);
+		let N = null;
+		if (A && (N = {
+			input: b,
+			cause: A,
+			causes: M.length > 0 ? M : [A]
+		}), !k) {
+			if (this._editing) {
+				let n = this._recoverCompiled(e, t, d, b, C, N, E);
+				if (n) return n;
+			}
+			return this._compileUnparsed(e, C, b, N, this._editing, () => T(C, E, t, d));
+		}
+		if (k = i(k, w ?? null), k = m(k, w ?? null), C) {
+			let e = this._editing ? O : {
+				mint: !O?.book,
+				...O
+			};
+			k = _(k, C, E, e, {
+				rowIndex: t,
+				colIndex: d
+			});
+			let n = c(k, C);
+			if (n) {
+				let e = new S.Parse(n);
+				M.push(e), N = {
+					input: b,
+					cause: N?.cause ?? e,
+					causes: N ? [...N.causes, e] : [e]
+				};
+			}
+		}
+		let P = a(e, C, k, this._editing, N, w ?? null);
+		return this._editing && N && r(P.getTokens(), C) !== b ? this._recoverCompiled(e, t, d, b, C, N, E) || this._compileUnparsed(e, C, b, N, !0) : P;
+	}
+	autoCorrect(e) {
+		let t = function(e) {
+			let t = 0, n = null;
+			for (let r = 0; r < e.length; r++) {
+				let i = e[r];
+				n ? i === n && (n = null) : t > 0 ? i === "'" ? r++ : i === "[" ? t++ : i === "]" && t-- : i === "\"" || i === "'" ? n = i : i === "[" && t++;
+			}
+			return n ? 0 : t;
+		}(e), n = e + "]".repeat(t), r;
+		try {
+			let e = this._parser.getLexer().tokenize(n, !1);
+			if (e.errors.length > 0) return null;
+			r = e.tokens;
+		} catch {
+			return null;
+		}
+		let i = [];
+		for (let e of r) {
+			let t = e.tokenType?.name;
+			if (t === "OpenParen") i.push(")");
+			else if (t === "OpenCurlyParen") i.push("}");
+			else if ((t === "CloseParen" || t === "CloseCurlyParen") && i.pop() !== (t === "CloseParen" ? ")" : "}")) return null;
+		}
+		return i.length === 0 && t === 0 ? null : n + i.reverse().join("");
+	}
+	_compileUnparsed(e, n, r, i, a = !1, o) {
+		let s = {
+			runtime: e,
+			symbols: n,
+			getFunction: null,
+			ast: null,
+			evaluations: C.EmptyArray,
+			executions: C.EmptyArray,
+			bindings: C.EmptyArray,
+			referencesAbsolute: C.EmptyArray,
+			referencesExecute: C.EmptyArray,
+			referencesRelative: C.EmptyArray,
+			referencesRoot: C.EmptyArray,
+			referenceIndices: C.EmptyArray,
+			formatReferenceIndices: C.EmptyArray,
+			getTokens: () => {
+				let e = [];
+				return a && k(e, r, void 0, o) ? e : [{
+					type: t.Unparsed,
+					value: r,
+					text: r
+				}];
+			},
+			namedIds: C.EmptyArray,
+			symbolIds: C.EmptyArray,
+			hasTotals: !1,
+			hasVolatile: !1,
+			isBlankCacheable: !1,
+			isBlankCacheableArray: !1,
+			isReferenceOnly: !1,
+			error: i,
+			transform: () => s
+		};
+		return s;
+	}
+	_recoverCompiled(e, n, i, o, s, c, l) {
+		let u, d = o.length;
+		try {
+			let e = this._parser.getLexer().tokenize(o, !1);
+			u = e.tokens, e.errors.length > 0 && (d = Math.min(d, e.errors[0].offset));
+		} catch {
+			return null;
+		}
+		let f = [];
+		for (let e = u.length - 1; e >= 0 && f.length < 24; e--) {
+			let t = (u[e].endOffset ?? -1) + 1;
+			t > 0 && t < o.length && t <= d && f.push(t);
+		}
+		for (let u of f) {
+			let d = o.slice(0, u), f, p;
+			try {
+				f = this._parser.parse(n, i, d).root;
+			} catch {
+				continue;
+			}
+			if (!f || f.type === t.Unparsed) continue;
+			try {
+				let t = m(f, null), r = s ? _(t, s, l, void 0, {
+					rowIndex: n,
+					colIndex: i
+				}) : t;
+				p = a(e, s, r, !0, c);
+			} catch {
+				continue;
+			}
+			if (r(p.getTokens(), s) !== d) continue;
+			let h = o.slice(u);
+			if (h.length === 0) return p;
+			let g, v = {
+				...p,
+				getTokens: () => (g || (g = [...p.getTokens()], this._appendUnparsedTail(g, h, () => T(s, l, n, i))), g),
+				transform: () => v
+			};
+			return v;
+		}
+		return null;
+	}
+	_appendUnparsedTail(e, n, r) {
+		let i = [];
+		for (let n of e) {
+			if (n.type === t.Whitespace) continue;
+			let e = n.type === t.Paren || n.type === t.Type ? n.text : void 0, r = i.length > 0 ? i[i.length - 1] : void 0;
+			if (n.type === t.Separator && r) {
+				let e = r.declared[r.declared.length - 1];
+				r.ctx?.type === "let" && r.ctx.argIndex === -1 && r.lambda?.argTokens === r.argTokens && e?.argIndex === r.argIndex - 1 && (e.params = r.lambda.params), r.argIndex++, r.argTokens = 0, r.lambda = void 0;
+			} else if (r && r.argTokens++, e === "(" || e === "[" || e === "{") i.push({
+				ctx: n.context,
+				argIndex: 0,
+				declared: [],
+				argTokens: 0,
+				leadsArg: r?.argTokens === 2
+			});
+			else if (e === ")" || e === "]" || e === "}") {
+				let e = i.pop(), t = i.length > 0 ? i[i.length - 1] : void 0;
+				t && e?.leadsArg && e.ctx?.type === "lambda" && e.ctx.argIndex === -1 && (t.lambda = {
+					params: e.declared.map(({ name: e, optional: t }) => t ? {
+						name: e,
+						optional: t
+					} : { name: e }),
+					argTokens: t.argTokens
+				});
+			} else if (n.type === t.Parameter && r && n.value?.declaration) {
+				let e = n.value;
+				r.declared.push(e.optional ? {
+					name: e.name,
+					argIndex: r.argIndex,
+					optional: !0
+				} : {
+					name: e.name,
+					argIndex: r.argIndex
+				});
+			}
+		}
+		let a = i.length > 0 ? i[i.length - 1] : void 0, o = a?.ctx ? {
+			...a.ctx,
+			argIndex: a.ctx.argIndex === -1 ? a.argIndex : a.ctx.argIndex
+		} : void 0;
+		if (o && a.ctx.argIndex === -1 && (o.type === "let" || o.type === "lambda")) {
+			let e = o.type === "let" ? 2 : 1, t = o.bound;
+			for (let n of a.declared) {
+				if (o.argIndex < n.argIndex + e) continue;
+				let { name: r, params: i } = n;
+				t = d(t, i ? {
+					name: r,
+					params: i
+				} : { name: r });
+			}
+			t && (o.bound = t);
+		}
+		let s = (n, r) => {
+			let i = r ? {
+				type: t.Named,
+				value: { name: n },
+				text: n
+			} : {
+				type: t.Unparsed,
+				value: n,
+				text: n
+			};
+			o && (i.context = o), e.push(i);
+		};
+		if (k(e, n, o, r)) return;
+		let c = /[A-Za-z_][A-Za-z0-9_]*$/.exec(n), l = c ? c.index : -1, u = l > 0 ? n[l - 1] : "";
+		for (let t = e.length - 1; l === 0 && t >= 0 && !u; t--) u = e[t].text?.at(-1) ?? "";
+		l >= 0 && !/[A-Za-z0-9_.]/.test(u) ? (l > 0 && s(n.slice(0, l)), s(n.slice(l), !0)) : s(n);
+	}
+};
+function T(t, n, r, i) {
+	if (!t || !n) return;
+	let a = t.bind(e.Table, "", { at: {
+		scope: n,
+		rowIndex: r,
+		colIndex: i
+	} });
+	return a ? t.resolve(e.Table, a)?.toString() : void 0;
+}
+var E = /[A-Za-z_\\\u007F-\uFFFF][A-Za-z0-9_.\u007F-\uFFFF]*$/, D = /[A-Za-z0-9_.)\]}"'!#\u007F-\uFFFF]/;
+function O(e, t) {
+	for (let n = t + 1; n < e.length; n++) {
+		let t = e[n];
+		if (t !== "'") {
+			if (t === "]") return n + 1;
+			if (t === "[") return null;
+		} else n++;
+	}
+	return -1;
+}
+function k(e, n, r, i) {
+	let a = 0, o = -1;
+	for (let e = 0; e < n.length; e++) {
+		let t = n[e];
+		a > 0 && t === "'" ? e++ : t === "[" ? (a === 0 && (o = e), a++) : t === "]" && a > 0 && a--;
+	}
+	if (a === 0) return !1;
+	let s = n.slice(0, o);
+	if ((s.split("\"").length - 1) % 2 == 1) return !1;
+	let c = e.length > 0 ? e[e.length - 1] : void 0, l = "", u = !1, d = E.exec(s);
+	if (d) {
+		let e = d.index > 0 ? s[d.index - 1] : c?.text?.at(-1) ?? "";
+		if (/[A-Za-z0-9_.]/.test(e)) return !1;
+		l = d[0], s = s.slice(0, d.index);
+	} else s.length === 0 && c?.text && E.exec(c.text)?.index === 0 && (c.type === t.Named && !c.value?.scope || c.type === t.TableReference) && (l = c.text, u = !0);
+	if (!u) {
+		let e = s.length > 0 ? s[s.length - 1] : c?.text?.at(-1) ?? "";
+		if (e && D.test(e)) return !1;
+	}
+	let f = l || (i?.() ?? ""), p = [], m = (e, t, n) => {
+		p.push({
+			type: e,
+			value: t,
+			text: t,
+			context: {
+				name: f,
+				argIndex: n,
+				type: "table"
+			}
+		});
+	}, h = (e, n, r, i) => {
+		let a = e.startsWith("#"), o = r ? i ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, s = o ? {
+			table: f,
+			name: e,
+			partial: o
+		} : {
+			table: f,
+			name: e
+		};
+		p.push({
+			type: a ? t.TableSpecifier : t.TableColumn,
+			value: s,
+			text: e,
+			context: {
+				name: f,
+				argIndex: n,
+				type: "table"
+			}
+		});
+	}, g = (e, n, r, i) => {
+		m(t.Paren, "[", r), h(e.slice(1, n ? -1 : void 0), r, !n, i), n && m(t.Paren, "]", r);
+	};
+	m(t.Paren, "[", -1);
+	let _ = n.slice(o + 1);
+	if (_.startsWith("[")) {
+		let e = 0, n = !1, r = 0;
+		for (; r < _.length;) {
+			let i = _[r];
+			if (i === "[") {
+				let t = O(_, r);
+				if (t === null) return !1;
+				let i = t !== -1;
+				if (g(_.slice(r, i ? t : _.length), i, e, n), n = !1, !i) break;
+				r = t;
+			} else if (i === ",") m(t.Separator, ",", e++), r++;
+			else if (i === ":") m(t.Infix, ":", e), r++;
+			else if (i === "@") m(t.Prefix, "@", e), n = !0, r++;
+			else {
+				if (i !== " ") return !1;
+				{
+					let n = r;
+					for (; _[n] === " ";) n++;
+					m(t.Whitespace, _.slice(r, n), e), r = n;
+				}
+			}
+		}
+	} else {
+		let e = _, n = e.startsWith("@");
+		if (n && (m(t.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
+			if (O(e, 0) !== -1) return !1;
+			g(e, !1, 0, n);
+		} else {
+			if (/(^|[^'])[[\]]/.test(e) || e.startsWith("#") && e.includes(",")) return !1;
+			h(e, 0, !0, n);
+		}
+	}
+	if (s) {
+		let n = {
+			type: t.Unparsed,
+			value: s,
+			text: s
+		};
+		r && (n.context = r), e.push(n);
+	}
+	if (u) {
+		let n = {
+			...c,
+			type: t.TableReference,
+			value: l,
+			text: l
+		};
+		delete n.referenceIndex, e[e.length - 1] = n;
+	} else if (l) {
+		let n = {
+			type: t.TableReference,
+			value: l,
+			text: l
+		};
+		r && (n.context = r), e.push(n);
+	}
+	for (let t of p) e.push(t);
+	return !0;
+}
+export { w as FormulaCompiler, k as appendPartialStructuredReference };

package/browser/esm/BFagR2JeWs74iAG3.mjs

@@ -0,0 +1,171 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+var e = [[
+	"0 r vc",
+	"cd4 hc b",
+	"cd2 l vc",
+	"3cd4 hc t"
+], [
+	"3cd4 hc t",
+	"cd2 l vc",
+	"cd4 hc b",
+	"0 r vc"
+]], t = Object.freeze({
+	rect: {
+		cxn: 1,
+		paths: [{ d: "M l t L r t L r b L l b Z" }]
+	},
+	round1Rect: {
+		av: ["adj val 16667"],
+		gd: [
+			"a pin 0 adj 50000",
+			"dx1 */ ss a 100000",
+			"x1 +- r 0 dx1",
+			"idx */ dx1 29289 100000",
+			"ir +- r 0 idx"
+		],
+		ah: ["xy adj _ x1 t 0 50000 _ _"],
+		cxn: 1,
+		rect: "l t ir b",
+		paths: [{ d: "M l t L x1 t A dx1 dx1 3cd4 cd4 L r b L l b Z" }]
+	},
+	round2DiagRect: {
+		av: ["adj1 val 16667", "adj2 val 0"],
+		gd: [
+			"a1 pin 0 adj1 50000",
+			"a2 pin 0 adj2 50000",
+			"x1 */ ss a1 100000",
+			"y1 +- b 0 x1",
+			"a */ ss a2 100000",
+			"x2 +- r 0 a",
+			"y2 +- b 0 a",
+			"dx1 */ x1 29289 100000",
+			"dx2 */ a 29289 100000",
+			"d +- dx1 0 dx2",
+			"dx ?: d dx1 dx2",
+			"ir +- r 0 dx",
+			"ib +- b 0 dx"
+		],
+		ah: ["xy adj1 _ x1 t 0 50000 _ _", "xy adj2 _ x2 t 0 50000 _ _"],
+		cxn: 0,
+		rect: "dx dx ir ib",
+		paths: [{ d: "M x1 t L x2 t A a a 3cd4 cd4 L r y1 A x1 x1 0 cd4 L a b A a a cd4 cd4 L l x1 A x1 x1 cd2 cd4 Z" }]
+	},
+	round2SameRect: {
+		av: ["adj1 val 16667", "adj2 val 0"],
+		gd: [
+			"a1 pin 0 adj1 50000",
+			"a2 pin 0 adj2 50000",
+			"tx1 */ ss a1 100000",
+			"tx2 +- r 0 tx1",
+			"bx1 */ ss a2 100000",
+			"bx2 +- r 0 bx1",
+			"by1 +- b 0 bx1",
+			"d +- tx1 0 bx1",
+			"tdx */ tx1 29289 100000",
+			"bdx */ bx1 29289 100000",
+			"il ?: d tdx bdx",
+			"ir +- r 0 il",
+			"ib +- b 0 bdx"
+		],
+		ah: ["xy adj1 _ tx2 t 0 50000 _ _", "xy adj2 _ bx1 b 0 50000 _ _"],
+		cxn: 0,
+		rect: "il tdx ir ib",
+		paths: [{ d: "M tx1 t L tx2 t A tx1 tx1 3cd4 cd4 L r by1 A bx1 bx1 0 cd4 L bx1 b A bx1 bx1 cd4 cd4 L l tx1 A tx1 tx1 cd2 cd4 Z" }]
+	},
+	roundRect: {
+		av: ["adj val 16667"],
+		gd: [
+			"a pin 0 adj 50000",
+			"x1 */ ss a 100000",
+			"x2 +- r 0 x1",
+			"y2 +- b 0 x1",
+			"il */ x1 29289 100000",
+			"ir +- r 0 il",
+			"ib +- b 0 il"
+		],
+		ah: ["xy adj _ x1 t 0 50000 _ _"],
+		cxn: 1,
+		rect: "il il ir ib",
+		paths: [{ d: "M l x1 A x1 x1 cd2 cd4 L x2 t A x1 x1 3cd4 cd4 L r y2 A x1 x1 0 cd4 L x1 b A x1 x1 cd4 cd4 Z" }]
+	},
+	snip1Rect: {
+		av: ["adj val 16667"],
+		gd: [
+			"a pin 0 adj 50000",
+			"dx1 */ ss a 100000",
+			"x1 +- r 0 dx1",
+			"it */ dx1 1 2",
+			"ir +/ x1 r 2"
+		],
+		ah: ["xy adj _ x1 t 0 50000 _ _"],
+		cxn: 0,
+		rect: "l it ir b",
+		paths: [{ d: "M l t L x1 t L r dx1 L r b L l b Z" }]
+	},
+	snip2DiagRect: {
+		av: ["adj1 val 0", "adj2 val 16667"],
+		gd: [
+			"a1 pin 0 adj1 50000",
+			"a2 pin 0 adj2 50000",
+			"lx1 */ ss a1 100000",
+			"lx2 +- r 0 lx1",
+			"ly1 +- b 0 lx1",
+			"rx1 */ ss a2 100000",
+			"rx2 +- r 0 rx1",
+			"ry1 +- b 0 rx1",
+			"d +- lx1 0 rx1",
+			"dx ?: d lx1 rx1",
+			"il */ dx 1 2",
+			"ir +- r 0 il",
+			"ib +- b 0 il"
+		],
+		ah: ["xy adj1 _ lx1 t 0 50000 _ _", "xy adj2 _ rx2 t 0 50000 _ _"],
+		cxn: 0,
+		rect: "il il ir ib",
+		paths: [{ d: "M lx1 t L rx2 t L r rx1 L r ly1 L lx2 b L rx1 b L l ry1 L l lx1 Z" }]
+	},
+	snip2SameRect: {
+		av: ["adj1 val 16667", "adj2 val 0"],
+		gd: [
+			"a1 pin 0 adj1 50000",
+			"a2 pin 0 adj2 50000",
+			"tx1 */ ss a1 100000",
+			"tx2 +- r 0 tx1",
+			"bx1 */ ss a2 100000",
+			"bx2 +- r 0 bx1",
+			"by1 +- b 0 bx1",
+			"d +- tx1 0 bx1",
+			"dx ?: d tx1 bx1",
+			"il */ dx 1 2",
+			"ir +- r 0 il",
+			"it */ tx1 1 2",
+			"ib +/ by1 b 2"
+		],
+		ah: ["xy adj1 _ tx2 t 0 50000 _ _", "xy adj2 _ bx1 b 0 50000 _ _"],
+		cxn: 0,
+		rect: "il it ir ib",
+		paths: [{ d: "M tx1 t L tx2 t L r tx1 L r by1 L bx2 b L bx1 b L l by1 L l tx1 Z" }]
+	},
+	snipRoundRect: {
+		av: ["adj1 val 16667", "adj2 val 16667"],
+		gd: [
+			"a1 pin 0 adj1 50000",
+			"a2 pin 0 adj2 50000",
+			"x1 */ ss a1 100000",
+			"dx2 */ ss a2 100000",
+			"x2 +- r 0 dx2",
+			"il */ x1 29289 100000",
+			"ir +/ x2 r 2"
+		],
+		ah: ["xy adj1 _ x1 t 0 50000 _ _", "xy adj2 _ x2 t 0 50000 _ _"],
+		cxn: 0,
+		rect: "il il ir b",
+		paths: [{ d: "M x1 t L x2 t L r dx2 L r b L l b L l x1 A x1 x1 cd2 cd4 Z" }]
+	}
+});
+export { t as BUILT_IN, e as CXN_SHARED };

package/browser/esm/BGOFfpxr2jPIdqmV.mjs

@@ -0,0 +1,40 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { ScalarType as e } from "@sheetxl/primitives";
+function t(t, n, r) {
+	let i = (t) => {
+		let n = null;
+		t.s ? n = t.s : t.r || t.g || (n = e.Number);
+		let a = {
+			name: t.n,
+			scalar: n,
+			range: t.r ?? null,
+			arrayDepth: t.d ?? 0,
+			optional: t.m === "?",
+			rest: t.m === "..."
+		};
+		return t.e !== void 0 && (a.enum = r(t.e)), t.l && (a.lambda = t.l), t.a !== void 0 && (a.lambdaArity = t.a), t.ae && (a.acceptError = !0), t.v !== void 0 && (a.defaultValue = t.v), t.u && (a.omittable = !0), t.w !== void 0 && (a.omittedValue = t.w), t.nl && (a.noLift = !0), t.nf && (a.noFilter = !0), t.lz && (a.lazy = !0), t.rt && (a.reportType = !0), t.vr && (a.valueOrRange = !0), t.g && (a.repeating = t.g.map(i)), delete a.dim, a;
+	}, a = [], o = n.p;
+	if (o) for (let e = 0; e < o.length; e++) a.push(i(o[e]));
+	let s = null;
+	n.r && (s = {}, n.r.s && (s.scalar = n.r.s), n.r.r && (s.range = n.r.r === "p" || n.r.r === "r" || n.r.r === "m" ? n.r.r : null), n.r.d && (s.arrayDepth = n.r.d ?? 0), n.r.l && (s.lambda = n.r.l || null), n.r.k && (s.kind = n.r.k), n.r.vol && (s.volatile = !0));
+	let c = {
+		name: t,
+		parameters: a,
+		returnType: s,
+		context: n.c ? "calculation" : null,
+		maxArguments: n.mx
+	};
+	n.h && (c.hidden = !0);
+	let l = [];
+	for (let e of a) for (let t of [e, ...e.repeating ?? []]) t.enum && !l.includes(t.enum.id) && l.push(t.enum.id);
+	return {
+		decl: c,
+		enumIds: l
+	};
+}
+export { t };