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

package/THIRD-PARTY-NOTICES.md

@@ -32,3 +32,175 @@ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 ```
+
+---
+
+## Font measurements
+
+The font tables in `resources/fonts` (`*.metrics.json`, `*.hinted.json`, `*.rows.json`) contain
+character advance widths and vertical metrics measured from the open fonts below, which are
+metric-compatible with the families the tables are named for. No font outlines or font files are
+included. Each table also records its source font's own notice.
+
+| Table family | Measured from | Copyright | License |
+| --- | --- | --- | --- |
+| Calibri | Carlito 1.103 | Copyright (c) 2010-2013 by tyPoland Lukasz Dziedzic (http://www.typoland.com/) with Reserved Font Name "Carlito" | SIL Open Font License 1.1 |
+| Arial | Liberation Sans 2.1.5 | Digitized data copyright (c) 2010 Google Corporation. Copyright (c) 2012 Red Hat, Inc. | SIL Open Font License 1.1 |
+| Times New Roman | Liberation Serif 2.1.5 | Digitized data copyright (c) 2010 Google Corporation. Copyright (c) 2012 Red Hat, Inc. | SIL Open Font License 1.1 |
+| Courier New | Liberation Mono 2.1.5 | Digitized data copyright (c) 2010 Google Corporation. Copyright (c) 2012 Red Hat, Inc. | SIL Open Font License 1.1 |
+| Cambria | Caladea 1.002 | Copyright (c) 2012 Huerta Tipografia | Apache License 2.0 |
+| Aptos, Aptos Narrow, Aptos Display | Intos 1.000 (Intos, Intos Narrow, Intos Display) | Copyright 2013 The Intos Project Authors (https://github.com/muglug/intos) | SIL Open Font License 1.1 |
+
+Calibri, Arial, Times New Roman, Courier New, Cambria and Aptos are trademarks of their respective
+owners and are named only to identify the fonts these measurements are compatible with.
+
+### SIL Open Font License 1.1
+
+``` code
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
+```
+
+### Apache License 2.0
+
+``` code
+Apache License
+
+Version 2.0, January 2004
+
+http://www.apache.org/licenses/ 
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+```

package/browser/esm/{BMyDRQ716j79h_bH.mjs → -GEhXGMfNcWmHPby.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 { n as e } from "./Dlmig06rIo7cInRk.mjs";
-import { ct as t } from "./CV5EGEjG5_-CPpP0.mjs";
+import { n as e } from "./CSJuIjYUOE387FIP.mjs";
+import { ut as t } from "./quEvwgrEuOb0h3q-.mjs";
 var n = e({
 	toConcreteCSS: () => i,
 	toConcreteFill: () => a
 }), r = (e) => Math.round(Math.min(255, Math.max(0, e))).toString(16).padStart(2, "0").toUpperCase();
-function i(e) {
-	let t = e.toRGBA(), n = t.alpha ?? 1;
-	return n >= 1 ? `#${r(t.red)}${r(t.green)}${r(t.blue)}` : `rgba(${Math.round(t.red)},${Math.round(t.green)},${Math.round(t.blue)},${Math.round(1e3 * n) / 1e3})`;
+function i(e, t = !1) {
+	let n = e.toRGBA(t), i = n.alpha ?? 1;
+	return i >= 1 ? `#${r(n.red)}${r(n.green)}${r(n.blue)}` : `rgba(${Math.round(n.red)},${Math.round(n.green)},${Math.round(n.blue)},${Math.round(1e3 * i) / 1e3})`;
 }
 function a(e, n) {
 	if (e === void 0) return;

package/browser/esm/{B7aUIvgUjncMMD_i.mjs → 9WXf_BTKjW1cQisZ.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 "./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 { Sr as e, jt as t, xr as n } from "./Dz86-De57bv2VYIi.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 "./C5j0IdwtYkWlOftv.mjs";
+import { n as y, r as b, t as x } from "./Bax5aOzQkbHKXW_X.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) {
+	compile(t, n, d, b, C, w, E, D, O) {
 		if (b.length === 0) {
-			let t = new S.Parse(x);
-			return this._compileUnparsed(e, C, b, {
+			let e = new S.Parse(x);
+			return this._compileUnparsed(t, C, b, {
 				input: b,
-				cause: t,
-				causes: [t]
+				cause: e,
+				causes: [e]
 			});
 		}
-		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, {
+		if (b.length > e.MAX_EXPRESSION_LENGTH) {
+			let n = new S.Parse(y(b.length, e.MAX_EXPRESSION_LENGTH));
+			return this._compileUnparsed(t, C, b, {
 				input: b,
-				cause: t,
-				causes: [t]
+				cause: n,
+				causes: [n]
 			});
 		}
 		let k, A, j = [];
 		try {
-			let e = this._parser.parse(t, d, b);
+			let e = this._parser.parse(n, 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);
@@ -59,10 +59,10 @@ var w = class {
 			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;
+				let e = this._recoverCompiled(t, n, d, b, C, N, E);
+				if (e) return e;
 			}
-			return this._compileUnparsed(e, C, b, N, this._editing, () => T(C, E, t, d));
+			return this._compileUnparsed(t, C, b, N, this._editing, () => T(C, E, n, d));
 		}
 		if (k = i(k, w ?? null), k = m(k, w ?? null), C) {
 			let e = this._editing ? O : {
@@ -70,12 +70,12 @@ var w = class {
 				...O
 			};
 			k = _(k, C, E, e, {
-				rowIndex: t,
+				rowIndex: n,
 				colIndex: d
 			});
-			let n = c(k, C);
-			if (n) {
-				let e = new S.Parse(n);
+			let t = c(k, C);
+			if (t) {
+				let e = new S.Parse(t);
 				M.push(e), N = {
 					input: b,
 					cause: N?.cause ?? e,
@@ -83,8 +83,8 @@ var w = class {
 				};
 			}
 		}
-		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;
+		let P = a(t, C, k, this._editing, N, w ?? null);
+		return this._editing && N && r(P.getTokens(), C) !== b ? this._recoverCompiled(t, n, d, b, C, N, E) || this._compileUnparsed(t, C, b, N, !0) : P;
 	}
 	autoCorrect(e) {
 		let t = function(e) {
@@ -111,10 +111,10 @@ var w = class {
 		}
 		return i.length === 0 && t === 0 ? null : n + i.reverse().join("");
 	}
-	_compileUnparsed(e, n, r, i, a = !1, o) {
+	_compileUnparsed(e, t, r, i, a = !1, o) {
 		let s = {
 			runtime: e,
-			symbols: n,
+			symbols: t,
 			getFunction: null,
 			ast: null,
 			evaluations: C.EmptyArray,
@@ -129,7 +129,7 @@ var w = class {
 			getTokens: () => {
 				let e = [];
 				return a && k(e, r, void 0, o) ? e : [{
-					type: t.Unparsed,
+					type: n.Unparsed,
 					value: r,
 					text: r
 				}];
@@ -137,6 +137,7 @@ var w = class {
 			namedIds: C.EmptyArray,
 			symbolIds: C.EmptyArray,
 			hasTotals: !1,
+			hasDataTable: !1,
 			hasVolatile: !1,
 			isBlankCacheable: !1,
 			isBlankCacheableArray: !1,
@@ -146,7 +147,7 @@ var w = class {
 		};
 		return s;
 	}
-	_recoverCompiled(e, n, i, o, s, c, l) {
+	_recoverCompiled(e, t, i, o, s, c, l) {
 		let u, d = o.length;
 		try {
 			let e = this._parser.getLexer().tokenize(o, !1);
@@ -162,16 +163,16 @@ var w = class {
 		for (let u of f) {
 			let d = o.slice(0, u), f, p;
 			try {
-				f = this._parser.parse(n, i, d).root;
+				f = this._parser.parse(t, i, d).root;
 			} catch {
 				continue;
 			}
-			if (!f || f.type === t.Unparsed) continue;
+			if (!f || f.type === n.Unparsed) continue;
 			try {
-				let t = m(f, null), r = s ? _(t, s, l, void 0, {
-					rowIndex: n,
+				let n = m(f, null), r = s ? _(n, s, l, void 0, {
+					rowIndex: t,
 					colIndex: i
-				}) : t;
+				}) : n;
 				p = a(e, s, r, !0, c);
 			} catch {
 				continue;
@@ -181,23 +182,23 @@ var w = class {
 			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),
+				getTokens: () => (g || (g = [...p.getTokens()], this._appendUnparsedTail(g, h, () => T(s, l, t, i))), g),
 				transform: () => v
 			};
 			return v;
 		}
 		return null;
 	}
-	_appendUnparsedTail(e, n, r) {
+	_appendUnparsedTail(e, t, 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) {
+		for (let t of e) {
+			if (t.type === n.Whitespace) continue;
+			let e = t.type === n.Paren || t.type === n.Type ? t.text : void 0, r = i.length > 0 ? i[i.length - 1] : void 0;
+			if (t.type === n.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,
+				ctx: t.context,
 				argIndex: 0,
 				declared: [],
 				argTokens: 0,
@@ -212,8 +213,8 @@ var w = class {
 					} : { name: e }),
 					argTokens: t.argTokens
 				});
-			} else if (n.type === t.Parameter && r && n.value?.declaration) {
-				let e = n.value;
+			} else if (t.type === n.Parameter && r && t.value?.declaration) {
+				let e = t.value;
 				r.declared.push(e.optional ? {
 					name: e.name,
 					argIndex: r.argIndex,
@@ -240,32 +241,32 @@ var w = class {
 			}
 			t && (o.bound = t);
 		}
-		let s = (n, r) => {
+		let s = (t, r) => {
 			let i = 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 && (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] : "";
+		if (k(e, t, o, r)) return;
+		let c = /[A-Za-z_][A-Za-z0-9_]*$/.exec(t), l = c ? c.index : -1, u = l > 0 ? t[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);
+		l >= 0 && !/[A-Za-z0-9_.]/.test(u) ? (l > 0 && s(t.slice(0, l)), s(t.slice(l), !0)) : s(t);
 	}
 };
-function T(t, n, r, i) {
-	if (!t || !n) return;
-	let a = t.bind(e.Table, "", { at: {
+function T(e, n, r, i) {
+	if (!e || !n) return;
+	let a = e.bind(t.Table, "", { at: {
 		scope: n,
 		rowIndex: r,
 		colIndex: i
 	} });
-	return a ? t.resolve(e.Table, a)?.toString() : void 0;
+	return a ? e.resolve(t.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) {
@@ -278,21 +279,21 @@ function O(e, t) {
 	}
 	return -1;
 }
-function k(e, n, r, i) {
+function k(e, t, 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--;
+	for (let e = 0; e < t.length; e++) {
+		let n = t[e];
+		a > 0 && n === "'" ? e++ : n === "[" ? (a === 0 && (o = e), a++) : n === "]" && a > 0 && a--;
 	}
 	if (a === 0) return !1;
-	let s = n.slice(0, o);
+	let s = t.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);
+	} else s.length === 0 && c?.text && E.exec(c.text)?.index === 0 && (c.type === n.Named && !c.value?.scope || c.type === n.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;
@@ -308,7 +309,7 @@ function k(e, n, r, i) {
 				type: "table"
 			}
 		});
-	}, h = (e, n, r, i) => {
+	}, h = (e, t, r, i) => {
 		let a = e.startsWith("#"), o = r ? i ? "column" : a ? "specifier" : e ? "column" : "any" : void 0, s = o ? {
 			table: f,
 			name: e,
@@ -318,75 +319,75 @@ function k(e, n, r, i) {
 			name: e
 		};
 		p.push({
-			type: a ? t.TableSpecifier : t.TableColumn,
+			type: a ? n.TableSpecifier : n.TableColumn,
 			value: s,
 			text: e,
 			context: {
 				name: f,
-				argIndex: n,
+				argIndex: t,
 				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);
+	}, g = (e, t, r, i) => {
+		m(n.Paren, "[", r), h(e.slice(1, t ? -1 : void 0), r, !t, i), t && m(n.Paren, "]", r);
 	};
-	m(t.Paren, "[", -1);
-	let _ = n.slice(o + 1);
+	m(n.Paren, "[", -1);
+	let _ = t.slice(o + 1);
 	if (_.startsWith("[")) {
-		let e = 0, n = !1, r = 0;
+		let e = 0, t = !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++;
+				let n = O(_, r);
+				if (n === null) return !1;
+				let i = n !== -1;
+				if (g(_.slice(r, i ? n : _.length), i, e, t), t = !1, !i) break;
+				r = n;
+			} else if (i === ",") m(n.Separator, ",", e++), r++;
+			else if (i === ":") m(n.Infix, ":", e), r++;
+			else if (i === "@") m(n.Prefix, "@", e), t = !0, r++;
 			else {
 				if (i !== " ") return !1;
 				{
-					let n = r;
-					for (; _[n] === " ";) n++;
-					m(t.Whitespace, _.slice(r, n), e), r = n;
+					let t = r;
+					for (; _[t] === " ";) t++;
+					m(n.Whitespace, _.slice(r, t), e), r = t;
 				}
 			}
 		}
 	} else {
-		let e = _, n = e.startsWith("@");
-		if (n && (m(t.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
+		let e = _, t = e.startsWith("@");
+		if (t && (m(n.Prefix, "@", 0), e = e.slice(1)), e.startsWith("[")) {
 			if (O(e, 0) !== -1) return !1;
-			g(e, !1, 0, n);
+			g(e, !1, 0, t);
 		} else {
 			if (/(^|[^'])[[\]]/.test(e) || e.startsWith("#") && e.includes(",")) return !1;
-			h(e, 0, !0, n);
+			h(e, 0, !0, t);
 		}
 	}
 	if (s) {
-		let n = {
-			type: t.Unparsed,
+		let t = {
+			type: n.Unparsed,
 			value: s,
 			text: s
 		};
-		r && (n.context = r), e.push(n);
+		r && (t.context = r), e.push(t);
 	}
 	if (u) {
-		let n = {
+		let t = {
 			...c,
-			type: t.TableReference,
+			type: n.TableReference,
 			value: l,
 			text: l
 		};
-		delete n.referenceIndex, e[e.length - 1] = n;
+		delete t.referenceIndex, e[e.length - 1] = t;
 	} else if (l) {
-		let n = {
-			type: t.TableReference,
+		let t = {
+			type: n.TableReference,
 			value: l,
 			text: l
 		};
-		r && (n.context = r), e.push(n);
+		r && (t.context = r), e.push(t);
 	}
 	for (let t of p) e.push(t);
 	return !0;

package/browser/esm/{PcHFjNzQsE54POri.mjs → B2SgIPPBX0wjzuq8.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/browser/esm/{DEiPS3Dr-s4fPbVZ.mjs → BC2RwlNwCdRywkoD.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/browser/esm/{BpgskG1Er_lGQ_yS.mjs → BEqhm9xAUPiHUCFv.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.