@sheetxl/studio-vanilla 0.8.0-beta.2 → 0.8.0-beta.4

package/cdn/assets/{BM343UBJqjbDokO6.js → CsDejQBEe09RdeRI2.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.2
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.4
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/cdn/assets/{BBaNqp1ZjuO25FQg.js → CsG9IQdgctp6tf2X.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.2
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.4
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/cdn/assets/{erwt6xEgCY7lDQWp.js → CweS1pLcEo28_Fd3.js}

@@ -1,11 +1,11 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.2
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.4
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { g as e } from "./DYCh_5thAx4qo1ns2.js";
-import { n as t } from "./CULlzRLL3s2Dikjg.js";
+import { g as e } from "./ZGRko_YhO95NyKLu.js";
+import { n as t } from "./DQXXQ7c_080TSD18.js";
 var n = async (n, r) => {
 	let i = n;
 	(function(e) {

package/{browser/esm/DjNR_ZGCbg-xia152.mjs → cdn/assets/Cz77LBaC6qe0hPm0.js}

@@ -1,5 +1,5 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.2
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.4
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.

package/{browser/esm/BVtQCzVeMOJZq64r2.mjs → cdn/assets/D6FSp0JpvARNns7B.js}

@@ -1,88 +1,88 @@
 /**
-* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.2
+* @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.8.0-beta.4
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { R as e } from "./DuijhgjRhgWB9sCY.mjs";
-import { i as t } from "./B50P0gSziuG68Umu.mjs";
-import { $ as n, At as r, Dt as i, G as a, H as o, I as s, J as c, Lt as l, P as u, T as d, a as f, f as p, ft as m, h, ht as g, k as _, l as v, n as y, st as b, t as x, tn as S, x as C } from "./Bc8-re9biUn57kdl.mjs";
+import { I as e } from "./C62Y8jSQuT2_lqUs2.js";
+import { i as t } from "./DsGBg42mflMr5nWn2.js";
+import { $ as n, At as r, Bt as i, E as a, G as o, L as s, N as c, P as l, Pt as u, Qt as d, Tt as f, U as p, Z as m, f as h, i as g, k as _, mt as v, p as y, t as b, ut as x, v as S, w as C } from "./D6g5-9e1xAhCBLKs2.js";
 var w = class {
 	constructor(e) {
-		e = { ...e }, this._editing = e.profile === "editing", this._parser = new f(e);
+		e = { ...e }, this._editing = e.profile === "editing", this._parser = new r(e);
 	}
-	compile(e, r, f, b, x, w, E, D, O) {
-		if (b.length === 0) {
+	compile(e, r, a, l, b, w, E, D, O) {
+		if (l.length === 0) {
 			let n = new t.Parse(h);
-			return this._compileUnparsed(e, x, b, {
-				input: b,
+			return this._compileUnparsed(e, b, l, {
+				input: l,
 				cause: n,
 				causes: [n]
 			});
 		}
-		if (b.length > u.MAX_EXPRESSION_LENGTH) {
-			let n = new t.Parse(p(b.length, u.MAX_EXPRESSION_LENGTH));
-			return this._compileUnparsed(e, x, b, {
-				input: b,
+		if (l.length > c.MAX_EXPRESSION_LENGTH) {
+			let n = new t.Parse(_(l.length, c.MAX_EXPRESSION_LENGTH));
+			return this._compileUnparsed(e, b, l, {
+				input: l,
 				cause: n,
 				causes: [n]
 			});
 		}
 		let k, A, j = [];
 		try {
-			let e = this._parser.parse(r, f, b);
+			let e = this._parser.parse(r, a, l);
 			k = e.root, j = e.errors, D && k && j.length === 0 && (k.legacyIntersect = !0);
 		} catch (e) {
 			A = t.isError(e, t.Code.Parse) ? e : new t.Parse(e.message, e);
 		}
 		let M = [];
-		for (let e of j) M.push(o(e));
+		for (let e of j) M.push(y(e));
 		if (k) {
-			let e = i(k, w ?? null);
-			typeof e == "string" ? M.push(new t.Parse(e)) : k = e, d(k, w ?? null) && M.push(new t.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), _(k, w ?? null) && M.push(new t.Parse("The spill anchor operator '#' requires a cell or range")), C(k, w ?? null) && M.push(new t.Parse("Expected a reference; a value cannot be converted to one."));
-			let n = c(k, w ?? null);
-			n && M.push(new t.Parse(n));
-			let r = m(k, w ?? null);
+			let e = v(k, w ?? null);
+			typeof e == "string" ? M.push(new t.Parse(e)) : k = e, C(k, w ?? null) && M.push(new t.Parse("The implicit intersection operator ' ' requires a cell or range on both sides")), s(k, w ?? null) && M.push(new t.Parse("The spill anchor operator '#' requires a cell or range")), o(k, w ?? null) && M.push(new t.Parse("Expected a reference; a value cannot be converted to one."));
+			let r = S(k, w ?? null);
 			r && M.push(new t.Parse(r));
-			let o = a(k, w ?? null);
-			o && M.push(new t.Parse(o));
-			let s = v(k);
-			s && M.push(new t.Parse(s));
+			let a = i(k, w ?? null);
+			a && M.push(new t.Parse(a));
+			let c = n(k, w ?? null);
+			c && M.push(new t.Parse(c));
+			let l = m(k);
+			l && M.push(new t.Parse(l));
 		}
 		M.length > 0 && !A && (A = M[0]);
 		let N = null;
 		if (A && (N = {
-			input: b,
+			input: l,
 			cause: A,
 			causes: M.length > 0 ? M : [A]
 		}), !k) {
 			if (this._editing) {
-				let t = this._recoverCompiled(e, r, f, b, x, N, E);
+				let t = this._recoverCompiled(e, r, a, l, b, N, E);
 				if (t) return t;
 			}
-			return this._compileUnparsed(e, x, b, N, this._editing, () => T(x, E, r, f));
+			return this._compileUnparsed(e, b, l, N, this._editing, () => T(b, E, r, a));
 		}
-		if (k = n(k, w ?? null), k = y(k, w ?? null), x) {
+		if (k = x(k, w ?? null), k = f(k, w ?? null), b) {
 			let e = this._editing ? O : {
 				mint: !O?.book,
 				...O
 			};
-			k = l(k, x, E, e, {
+			k = d(k, b, E, e, {
 				rowIndex: r,
-				colIndex: f
+				colIndex: a
 			});
-			let n = g(k, x);
+			let n = u(k, b);
 			if (n) {
 				let e = new t.Parse(n);
 				M.push(e), N = {
-					input: b,
+					input: l,
 					cause: N?.cause ?? e,
 					causes: N ? [...N.causes, e] : [e]
 				};
 			}
 		}
-		let P = S(e, x, k, this._editing, N, w ?? null);
-		return this._editing && N && s(P.getTokens(), x) !== b ? this._recoverCompiled(e, r, f, b, x, N, E) || this._compileUnparsed(e, x, b, N, !0) : P;
+		let P = p(e, b, k, this._editing, N, w ?? null);
+		return this._editing && N && g(P.getTokens(), b) !== l ? this._recoverCompiled(e, r, a, l, b, N, E) || this._compileUnparsed(e, b, l, N, !0) : P;
 	}
 	autoCorrect(e) {
 		let t, n = function(e) {
@@ -127,7 +127,7 @@ var w = class {
 			getTokens: () => {
 				let e = [];
 				return a && k(e, r, void 0, o) ? e : [{
-					type: x.Unparsed,
+					type: b.Unparsed,
 					value: r,
 					text: r
 				}];
@@ -145,53 +145,53 @@ var w = class {
 		return s;
 	}
 	_recoverCompiled(e, t, n, r, i, a, o) {
-		let c, u = r.length;
+		let s, c = r.length;
 		try {
 			let e = this._parser.getLexer().tokenize(r, !1);
-			c = e.tokens, e.errors.length > 0 && (u = Math.min(u, e.errors[0].offset));
+			s = e.tokens, e.errors.length > 0 && (c = Math.min(c, e.errors[0].offset));
 		} catch {
 			return null;
 		}
-		let d = [];
-		for (let e = c.length - 1; e >= 0 && d.length < 24; e--) {
-			let t = (c[e].endOffset ?? -1) + 1;
-			t > 0 && t < r.length && t <= u && d.push(t);
+		let l = [];
+		for (let e = s.length - 1; e >= 0 && l.length < 24; e--) {
+			let t = (s[e].endOffset ?? -1) + 1;
+			t > 0 && t < r.length && t <= c && l.push(t);
 		}
-		for (let c of d) {
-			let u, d, f = r.slice(0, c);
+		for (let s of l) {
+			let c, l, u = r.slice(0, s);
 			try {
-				u = this._parser.parse(t, n, f).root;
+				c = this._parser.parse(t, n, u).root;
 			} catch {
 				continue;
 			}
-			if (!u || u.type === x.Unparsed) continue;
+			if (!c || c.type === b.Unparsed) continue;
 			try {
-				let r = y(u, null);
-				d = S(e, i, i ? l(r, i, o, void 0, {
+				let r = f(c, null);
+				l = p(e, i, i ? d(r, i, o, void 0, {
 					rowIndex: t,
 					colIndex: n
 				}) : r, !0, a);
 			} catch {
 				continue;
 			}
-			if (s(d.getTokens(), i) !== f) continue;
-			let p = r.slice(c);
-			if (p.length === 0) return d;
-			let m, h = {
-				...d,
-				getTokens: () => (m || (m = [...d.getTokens()], this._appendUnparsedTail(m, p, () => T(i, o, t, n))), m),
-				transform: () => h
+			if (g(l.getTokens(), i) !== u) continue;
+			let m = r.slice(s);
+			if (m.length === 0) return l;
+			let h, _ = {
+				...l,
+				getTokens: () => (h || (h = [...l.getTokens()], this._appendUnparsedTail(h, m, () => T(i, o, t, n))), h),
+				transform: () => _
 			};
-			return h;
+			return _;
 		}
 		return null;
 	}
 	_appendUnparsedTail(e, t, n) {
 		let r = [];
 		for (let t of e) {
-			if (t.type === x.Whitespace) continue;
-			let e = t.type === x.Paren || t.type === x.Type ? t.text : void 0, n = r.length > 0 ? r[r.length - 1] : void 0;
-			if (t.type === x.Separator && n) {
+			if (t.type === b.Whitespace) continue;
+			let e = t.type === b.Paren || t.type === b.Type ? t.text : void 0, n = r.length > 0 ? r[r.length - 1] : void 0;
+			if (t.type === b.Separator && n) {
 				let e = n.declared[n.declared.length - 1];
 				n.ctx?.type === "let" && n.ctx.argIndex === -1 && n.lambda?.argTokens === n.argTokens && e?.argIndex === n.argIndex - 1 && (e.params = n.lambda.params), n.argIndex++, n.argTokens = 0, n.lambda = void 0;
 				continue;
@@ -212,7 +212,7 @@ var w = class {
 					} : { name: e }),
 					argTokens: t.argTokens
 				});
-			} else if (t.type === x.Parameter && n && t.value?.declaration) {
+			} else if (t.type === b.Parameter && n && t.value?.declaration) {
 				let e = t.value;
 				n.declared.push(e.optional ? {
 					name: e.name,
@@ -233,7 +233,7 @@ var w = class {
 			for (let n of i.declared) {
 				if (a.argIndex < n.argIndex + e) continue;
 				let { name: r, params: i } = n;
-				t = b(t, i ? {
+				t = l(t, i ? {
 					name: r,
 					params: i
 				} : { name: r });
@@ -242,30 +242,30 @@ var w = class {
 		}
 		let o = (t, n) => {
 			let r = n ? {
-				type: x.Named,
+				type: b.Named,
 				value: { name: t },
 				text: t
 			} : {
-				type: x.Unparsed,
+				type: b.Unparsed,
 				value: t,
 				text: t
 			};
 			a && (r.context = a), e.push(r);
 		};
 		if (k(e, t, a, n)) return;
-		let s = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), c = s ? s.index : -1, l = c > 0 ? t[c - 1] : "";
-		for (let t = e.length - 1; c === 0 && t >= 0 && !l; t--) l = e[t].text?.at(-1) ?? "";
-		c >= 0 && !/[A-Za-z0-9_.]/.test(l) ? (c > 0 && o(t.slice(0, c)), o(t.slice(c), !0)) : o(t);
+		let s = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), c = s ? s.index : -1, u = c > 0 ? t[c - 1] : "";
+		for (let t = e.length - 1; c === 0 && t >= 0 && !u; t--) u = e[t].text?.at(-1) ?? "";
+		c >= 0 && !/[A-Za-z0-9_.]/.test(u) ? (c > 0 && o(t.slice(0, c)), o(t.slice(c), !0)) : o(t);
 	}
 };
-function T(e, t, n, i) {
+function T(e, t, n, r) {
 	if (!e || !t) return;
-	let a = e.bind(r.Table, "", { at: {
+	let i = e.bind(a.Table, "", { at: {
 		scope: t,
 		rowIndex: n,
-		colIndex: i
+		colIndex: r
 	} });
-	return a ? e.resolve(r.Table, a)?.toString() : void 0;
+	return i ? e.resolve(a.Table, i)?.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) {
@@ -292,7 +292,7 @@ function k(e, t, n, r) {
 		let e = u.index > 0 ? o[u.index - 1] : s?.text?.at(-1) ?? "";
 		if (/[A-Za-z0-9_.]/.test(e)) return !1;
 		c = u[0], o = o.slice(0, u.index);
-	} else o.length === 0 && s?.text && E.exec(s.text)?.index === 0 && (s.type === x.Named && !s.value?.scope || s.type === x.TableReference) && (c = s.text, l = !0);
+	} else o.length === 0 && s?.text && E.exec(s.text)?.index === 0 && (s.type === b.Named && !s.value?.scope || s.type === b.TableReference) && (c = s.text, l = !0);
 	if (!l) {
 		let e = o.length > 0 ? o[o.length - 1] : s?.text?.at(-1) ?? "";
 		if (e && D.test(e)) return !1;
@@ -318,7 +318,7 @@ function k(e, t, n, r) {
 			name: e
 		};
 		f.push({
-			type: i ? x.TableSpecifier : x.TableColumn,
+			type: i ? b.TableSpecifier : b.TableColumn,
 			value: o,
 			text: e,
 			context: {
@@ -328,9 +328,9 @@ function k(e, t, n, r) {
 			}
 		});
 	}, h = (e, t, n, r) => {
-		p(x.Paren, "[", n), m(e.slice(1, t ? -1 : void 0), n, !t, r), t && p(x.Paren, "]", n);
+		p(b.Paren, "[", n), m(e.slice(1, t ? -1 : void 0), n, !t, r), t && p(b.Paren, "]", n);
 	};
-	p(x.Paren, "[", -1);
+	p(b.Paren, "[", -1);
 	let g = t.slice(a + 1);
 	if (g.startsWith("[")) {
 		let e = 0, t = !1, n = 0;
@@ -342,21 +342,21 @@ function k(e, t, n, r) {
 				let i = r !== -1;
 				if (h(g.slice(n, i ? r : g.length), i, e, t), t = !1, !i) break;
 				n = r;
-			} else if (r === ",") p(x.Separator, ",", e++), n++;
-			else if (r === ":") p(x.Infix, ":", e), n++;
-			else if (r === "@") p(x.Prefix, "@", e), t = !0, n++;
+			} else if (r === ",") p(b.Separator, ",", e++), n++;
+			else if (r === ":") p(b.Infix, ":", e), n++;
+			else if (r === "@") p(b.Prefix, "@", e), t = !0, n++;
 			else {
 				if (r !== " ") return !1;
 				{
 					let t = n;
 					for (; g[t] === " ";) t++;
-					p(x.Whitespace, g.slice(n, t), e), n = t;
+					p(b.Whitespace, g.slice(n, t), e), n = t;
 				}
 			}
 		}
 	} else {
 		let e = g, t = e.startsWith("@");
-		if (t && (p(x.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
+		if (t && (p(b.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
 			if (O(e, 0) !== -1) return !1;
 			h(e, !1, 0, t);
 		} else {
@@ -366,7 +366,7 @@ function k(e, t, n, r) {
 	}
 	if (o) {
 		let t = {
-			type: x.Unparsed,
+			type: b.Unparsed,
 			value: o,
 			text: o
 		};
@@ -375,14 +375,14 @@ function k(e, t, n, r) {
 	if (l) {
 		let t = {
 			...s,
-			type: x.TableReference,
+			type: b.TableReference,
 			value: c,
 			text: c
 		};
 		delete t.referenceIndex, e[e.length - 1] = t;
 	} else if (c) {
 		let t = {
-			type: x.TableReference,
+			type: b.TableReference,
 			value: c,
 			text: c
 		};