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

package/node/esm/{CCN5vD410obwdz38.mjs → D16EdlZG1hX5WUUK.mjs}

@@ -1,38 +1,38 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.13
 *
 * (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 { Sr as e, jt as t, xr as n } from "./BQ2XqExomMceAjfe.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 "./NkPNHsq2T3DXg76x.mjs";
+import { n as v, r as I, t as _ } from "./CzrLqStvrcPE2-hb.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) {
+	compile(t, n, p, I, T, P, k, E, w) {
 		if (0 === I.length) {
-			const t = new b.Parse(_);
-			return this._compileUnparsed(e, T, I, {
+			const e = new b.Parse(_);
+			return this._compileUnparsed(t, T, I, {
 				input: I,
-				cause: t,
-				causes: [t]
+				cause: e,
+				causes: [e]
 			});
 		}
-		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, {
+		if (I.length > e.MAX_EXPRESSION_LENGTH) {
+			const n = new b.Parse(v(I.length, e.MAX_EXPRESSION_LENGTH));
+			return this._compileUnparsed(t, T, I, {
 				input: I,
-				cause: t,
-				causes: [t]
+				cause: n,
+				causes: [n]
 			});
 		}
 		let F, C, U = [];
 		try {
-			const e = this._parser.parse(t, p, I);
+			const e = this._parser.parse(n, 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);
@@ -59,10 +59,10 @@ var P = class {
 			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;
+				const e = this._recoverCompiled(t, n, p, I, T, R, k);
+				if (e) return e;
 			}
-			return this._compileUnparsed(e, T, I, R, this._editing, () => A(T, k, t, p));
+			return this._compileUnparsed(t, T, I, R, this._editing, () => A(T, k, n, p));
 		}
 		if (F = s(F, P ?? null), F = h(F, P ?? null), T) {
 			const e = this._editing ? w : {
@@ -70,12 +70,12 @@ var P = class {
 				...w
 			};
 			F = x(F, T, k, e, {
-				rowIndex: t,
+				rowIndex: n,
 				colIndex: p
 			});
-			const n = i(F, T);
-			if (n) {
-				const e = new b.Parse(n);
+			const t = i(F, T);
+			if (t) {
+				const e = new b.Parse(t);
 				z.push(e), R = {
 					input: I,
 					cause: R?.cause ?? e,
@@ -83,8 +83,8 @@ var P = class {
 				};
 			}
 		}
-		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);
+		const S = a(t, T, F, this._editing, R, P ?? null);
+		if (this._editing && R && r(S.getTokens(), T) !== I) return this._recoverCompiled(t, n, p, I, T, R, k) || this._compileUnparsed(t, T, I, R, !0);
 		return S;
 	}
 	autoCorrect(e) {
@@ -113,10 +113,10 @@ var P = class {
 		}
 		return 0 === s.length && 0 === t ? null : n + s.reverse().join("");
 	}
-	_compileUnparsed(e, n, r, s, a = !1, o) {
+	_compileUnparsed(e, t, r, s, a = !1, o) {
 		const l = {
 			runtime: e,
-			symbols: n,
+			symbols: t,
 			getFunction: null,
 			ast: null,
 			evaluations: T.EmptyArray,
@@ -131,7 +131,7 @@ var P = class {
 			getTokens: () => {
 				const e = [];
 				return a && F(e, r, void 0, o) ? e : [{
-					type: t.Unparsed,
+					type: n.Unparsed,
 					value: r,
 					text: r
 				}];
@@ -139,6 +139,7 @@ var P = class {
 			namedIds: T.EmptyArray,
 			symbolIds: T.EmptyArray,
 			hasTotals: !1,
+			hasDataTable: !1,
 			hasVolatile: !1,
 			isBlankCacheable: !1,
 			isBlankCacheableArray: !1,
@@ -148,7 +149,7 @@ var P = class {
 		};
 		return l;
 	}
-	_recoverCompiled(e, n, s, o, l, i, c) {
+	_recoverCompiled(e, t, s, o, l, i, c) {
 		let u, p = o.length;
 		try {
 			const e = this._parser.getLexer().tokenize(o, !1);
@@ -165,16 +166,16 @@ var P = class {
 			const p = o.slice(0, u);
 			let d, f;
 			try {
-				d = this._parser.parse(n, s, p).root;
+				d = this._parser.parse(t, s, p).root;
 			} catch {
 				continue;
 			}
-			if (!d || d.type === t.Unparsed) continue;
+			if (!d || d.type === n.Unparsed) continue;
 			try {
-				const t = h(d, null), r = l ? x(t, l, c, void 0, {
-					rowIndex: n,
+				const n = h(d, null), r = l ? x(n, l, c, void 0, {
+					rowIndex: t,
 					colIndex: s
-				}) : t;
+				}) : n;
 				f = a(e, l, r, !0, i);
 			} catch {
 				continue;
@@ -185,25 +186,25 @@ var P = class {
 			let m;
 			const y = {
 				...f,
-				getTokens: () => (m || (m = [...f.getTokens()], this._appendUnparsedTail(m, g, () => A(l, c, n, s))), m),
+				getTokens: () => (m || (m = [...f.getTokens()], this._appendUnparsedTail(m, g, () => A(l, c, t, s))), m),
 				transform: () => y
 			};
 			return y;
 		}
 		return null;
 	}
-	_appendUnparsedTail(e, n, r) {
+	_appendUnparsedTail(e, t, 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) {
+		for (const t of e) {
+			if (t.type === n.Whitespace) continue;
+			const e = t.type === n.Paren || t.type === n.Type ? t.text : void 0, r = s.length > 0 ? s[s.length - 1] : void 0;
+			if (t.type === n.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,
+				ctx: t.context,
 				argIndex: 0,
 				declared: [],
 				argTokens: 0,
@@ -218,8 +219,8 @@ var P = class {
 					} : { name: e }),
 					argTokens: t.argTokens
 				});
-			} else if (n.type === t.Parameter && r && n.value?.declaration) {
-				const e = n.value;
+			} else if (t.type === n.Parameter && r && t.value?.declaration) {
+				const e = t.value;
 				r.declared.push(e.optional ? {
 					name: e.name,
 					argIndex: r.argIndex,
@@ -247,33 +248,33 @@ var P = class {
 			}
 			t && (o.bound = t);
 		}
-		const l = (n, r) => {
+		const l = (t, r) => {
 			const s = r ? {
-				type: t.Named,
-				value: { name: n },
-				text: n
+				type: n.Named,
+				value: { name: t },
+				text: t
 			} : {
-				type: t.Unparsed,
-				value: n,
-				text: n
+				type: n.Unparsed,
+				value: t,
+				text: t
 			};
 			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] : "";
+		if (F(e, t, o, r)) return;
+		const i = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), c = i ? i.index : -1;
+		let u = c > 0 ? t[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);
+		c >= 0 && !/[A-Za-z0-9_.]/.test(u) ? (c > 0 && l(t.slice(0, c)), l(t.slice(c), !0)) : l(t);
 	}
 };
-function A(t, n, r, s) {
-	if (!t || !n) return;
-	const a = t.bind(e.Table, "", { at: {
+function A(e, n, r, s) {
+	if (!e || !n) return;
+	const a = e.bind(t.Table, "", { at: {
 		scope: n,
 		rowIndex: r,
 		colIndex: s
 	} });
-	return a ? t.resolve(e.Table, a)?.toString() : void 0;
+	return a ? e.resolve(t.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) {
@@ -286,14 +287,14 @@ function w(e, t) {
 	}
 	return -1;
 }
-function F(e, n, r, s) {
+function F(e, t, 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--;
+	for (let e = 0; e < t.length; e++) {
+		const n = t[e];
+		a > 0 && "'" === n ? e++ : "[" === n ? (0 === a && (o = e), a++) : "]" === n && a > 0 && a--;
 	}
 	if (0 === a) return !1;
-	let l = n.slice(0, o);
+	let l = t.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;
@@ -302,7 +303,7 @@ function F(e, n, r, s) {
 		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);
+	} else 0 === l.length && i?.text && 0 === k.exec(i.text)?.index && (i.type === n.Named && !i.value?.scope || i.type === n.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;
@@ -318,7 +319,7 @@ function F(e, n, r, s) {
 				type: "table"
 			}
 		});
-	}, g = (e, n, r, s) => {
+	}, g = (e, t, r, s) => {
 		const a = e.startsWith("#"), o = r ? s ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, l = o ? {
 			table: d,
 			name: e,
@@ -328,76 +329,76 @@ function F(e, n, r, s) {
 			name: e
 		};
 		f.push({
-			type: a ? t.TableSpecifier : t.TableColumn,
+			type: a ? n.TableSpecifier : n.TableColumn,
 			value: l,
 			text: e,
 			context: {
 				name: d,
-				argIndex: n,
+				argIndex: t,
 				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);
+	}, m = (e, t, r, s) => {
+		h(n.Paren, "[", r), g(e.slice(1, t ? -1 : void 0), r, !t, s), t && h(n.Paren, "]", r);
 	};
-	h(t.Paren, "[", -1);
-	const x = n.slice(o + 1);
+	h(n.Paren, "[", -1);
+	const x = t.slice(o + 1);
 	if (x.startsWith("[")) {
-		let e = 0, n = !1, r = 0;
+		let e = 0, t = !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++;
+				const n = w(x, r);
+				if (null === n) return !1;
+				const s = -1 !== n;
+				if (m(x.slice(r, s ? n : x.length), s, e, t), t = !1, !s) break;
+				r = n;
+			} else if ("," === s) h(n.Separator, ",", e++), r++;
+			else if (":" === s) h(n.Infix, ":", e), r++;
+			else if ("@" === s) h(n.Prefix, "@", e), t = !0, r++;
 			else {
 				if (" " !== s) return !1;
 				{
-					let n = r;
-					for (; " " === x[n];) n++;
-					h(t.Whitespace, x.slice(r, n), e), r = n;
+					let t = r;
+					for (; " " === x[t];) t++;
+					h(n.Whitespace, x.slice(r, t), e), r = t;
 				}
 			}
 		}
 	} else {
 		let e = x;
-		const n = e.startsWith("@");
-		if (n && (h(t.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
+		const t = e.startsWith("@");
+		if (t && (h(n.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
 			if (-1 !== w(e, 0)) return !1;
-			m(e, !1, 0, n);
+			m(e, !1, 0, t);
 		} else {
 			if (/(^|[^'])[[\]]/.test(e) || e.startsWith("#") && e.includes(",")) return !1;
-			g(e, 0, !0, n);
+			g(e, 0, !0, t);
 		}
 	}
 	if (l) {
-		const n = {
-			type: t.Unparsed,
+		const t = {
+			type: n.Unparsed,
 			value: l,
 			text: l
 		};
-		r && (n.context = r), e.push(n);
+		r && (t.context = r), e.push(t);
 	}
 	if (u) {
-		const n = {
+		const t = {
 			...i,
-			type: t.TableReference,
+			type: n.TableReference,
 			value: c,
 			text: c
 		};
-		delete n.referenceIndex, e[e.length - 1] = n;
+		delete t.referenceIndex, e[e.length - 1] = t;
 	} else if (c) {
-		const n = {
-			type: t.TableReference,
+		const t = {
+			type: n.TableReference,
 			value: c,
 			text: c
 		};
-		r && (n.context = r), e.push(n);
+		r && (t.context = r), e.push(t);
 	}
 	for (const t of f) e.push(t);
 	return !0;

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

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.13
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/node/esm/{cGwrLA1RCE-WhJ7w.mjs → D2jtztjE6c23RKvZ.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.13
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/node/esm/{Bbf1Pm9Gk7YpLTvg.mjs → D9nRcWsYk3M82iD8.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.13
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/node/esm/{yavzZOiZW_EjG9lE.mjs → DALYzTxZ9Ur9C69Q.mjs}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.13
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/node/esm/{DkwIPzKc3UwdUIfM.mjs → DF0nL7s01dp7n0Bx.mjs}

@@ -1,18 +1,18 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.13
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { t } from "./yavzZOiZW_EjG9lE.mjs";
-import { ct as n } from "./DNRhGK-8Tr9xcRyc.mjs";
+import { t } from "./DALYzTxZ9Ur9C69Q.mjs";
+import { ut as n } from "./DO5ldLqhTvIfPXLW.mjs";
 var r = t({
 	toConcreteCSS: () => o,
 	toConcreteFill: () => u
 }), e = (t) => Math.round(Math.min(255, Math.max(0, t))).toString(16).padStart(2, "0").toUpperCase();
-function o(t) {
-	const n = t.toRGBA(), r = n.alpha ?? 1;
-	return r >= 1 ? `#${e(n.red)}${e(n.green)}${e(n.blue)}` : `rgba(${Math.round(n.red)},${Math.round(n.green)},${Math.round(n.blue)},${Math.round(1e3 * r) / 1e3})`;
+function o(t, n = !1) {
+	const r = t.toRGBA(n), o = r.alpha ?? 1;
+	return o >= 1 ? `#${e(r.red)}${e(r.green)}${e(r.blue)}` : `rgba(${Math.round(r.red)},${Math.round(r.green)},${Math.round(r.blue)},${Math.round(1e3 * o) / 1e3})`;
 }
 function u(t, r) {
 	if (void 0 === t) return;
@@ -54,8 +54,8 @@ function u(t, r) {
 		default: return null;
 	}
 }
-var s, l = /* @__PURE__ */ new Map(), c = !1;
-function a(t) {
+var s, l = /* @__PURE__ */ new Map(), a = !1;
+function c(t) {
 	for (const n of t.types) l.set(n, t);
 	return () => {
 		for (const n of t.types) l.get(n) === t && l.delete(n);
@@ -69,13 +69,13 @@ function a(t) {
 		return "custom" === t.type ? `custom:${t.custom?.kind ?? ""}` : t.type;
 	}
 	t.register = function(t) {
-		return a(t);
+		return c(t);
 	}, t.get = n, t.has = function(t) {
 		return l.has(t);
 	}, t.getTypes = function() {
 		return [...l.keys()];
 	}, t.registerBuiltIns = function(t) {
-		c || (c = !0, t((t) => a({
+		a || (a = !0, t((t) => c({
 			...t,
 			types: t.types.filter((t) => !l.has(t))
 		})));