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

package/node/esm/CCN5vD410obwdz38.mjs

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

package/node/esm/{Cku7XiUvw1xrRasi.mjs → CDHdgJXH2vS71WMc.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.1
+* @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.