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

package/browser/esm/{ClbvFbFzFzXLBKNN.mjs → zZngLMg6mg6nnNGX.mjs}

@@ -1,73 +1,73 @@
 /**
-* @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, In as t, Ln as n, Mn as r, Un as i, Vn as a, Wn as o, dr as s, er as c, kn as l } from "./C16ycKja6zG0crV_.mjs";
-var u = Symbol("sheetxl.formulaNode.internal"), d = Symbol("sheetxl.formulaNode.value"), f = Symbol("sheetxl.formulaNode.replaced"), p = { canonical: !0 }, m = (t, n) => {
-	let r = t.inputs, i = null;
-	if (r) {
-		let e = r.length;
-		i = Array(e);
-		for (let t = 0; t < e; t++) {
-			let e = r[t];
-			i[t] = e && m(e, n);
+import { $n as e, Hn as t, Kn as n, Zn as r, er as i, jt as a, qn as o, ur as s, xr as c, zn as l } from "./Dz86-De57bv2VYIi.mjs";
+var u = Symbol("sheetxl.formulaNode.internal"), d = Symbol("sheetxl.formulaNode.value"), f = Symbol("sheetxl.formulaNode.replaced"), p = { canonical: !0 }, m = (e, t) => {
+	let n = e.inputs, r = null;
+	if (n) {
+		let e = n.length;
+		r = Array(e);
+		for (let i = 0; i < e; i++) {
+			let e = n[i];
+			r[i] = e && m(e, t);
 		}
 	}
-	let a = ((t, n) => {
-		let r = t.type, i = t.value;
-		if (r === s.Named) {
-			let r = i, a = r?.nameId, o = r?.scope ?? null;
-			return n && (a = n.resolve(e.NamedFormula, a)?.toString() ?? a, o &&= n.resolve(e.Sheet, o)?.toString() ?? o), t.binding?.declaration && t.binding.optional ? {
-				name: a,
+	let i = ((e, t) => {
+		let n = e.type, r = e.value;
+		if (n === c.Named) {
+			let n = r, i = n?.nameId, o = n?.scope ?? null;
+			return t && (i = t.resolve(a.NamedFormula, i)?.toString() ?? i, o &&= t.resolve(a.Sheet, o)?.toString() ?? o), e.binding?.declaration && e.binding.optional ? {
+				name: i,
 				scope: o,
 				optional: !0
 			} : {
-				name: a,
+				name: i,
 				scope: o
 			};
 		}
-		if (r === s.TableReference) {
-			let t = typeof i == "string" ? i : i?.tableId;
-			return t ? n ? n.resolve(e.Table, t)?.toString() ?? t : t : "";
+		if (n === c.TableReference) {
+			let e = typeof r == "string" ? r : r?.tableId;
+			return e ? t ? t.resolve(a.Table, e)?.toString() ?? e : e : "";
 		}
-		if (!n) return i;
-		switch (r) {
-			case s.Function: return n.resolve(e.Function, i, p)?.toString() ?? i;
-			case s.TableColumn: return n.resolve(e.TableColumn, i)?.toString() ?? i;
-			case s.Cell: {
-				let t = i;
-				if (t?.scope) {
-					let r = n.resolve(e.Sheet, t.scope)?.toString() ?? t.scope;
+		if (!t) return r;
+		switch (n) {
+			case c.Function: return t.resolve(a.Function, r, p)?.toString() ?? r;
+			case c.TableColumn: return t.resolve(a.TableColumn, r)?.toString() ?? r;
+			case c.Cell: {
+				let e = r;
+				if (e?.scope) {
+					let n = t.resolve(a.Sheet, e.scope)?.toString() ?? e.scope;
 					return {
-						...t,
-						scope: r
+						...e,
+						scope: n
 					};
 				}
-				return i;
+				return r;
 			}
-			case s.Error: {
-				let t = i;
-				if (t?.scope) {
-					let r = n.resolve(e.Sheet, t.scope)?.toString() ?? t.scope;
+			case c.Error: {
+				let e = r;
+				if (e?.scope) {
+					let n = t.resolve(a.Sheet, e.scope)?.toString() ?? e.scope;
 					return {
-						...t,
-						scope: r
+						...e,
+						scope: n
 					};
 				}
-				return i;
+				return r;
 			}
-			default: return i;
+			default: return r;
 		}
-	})(t, n);
+	})(e, t);
 	return {
-		type: t.type,
-		value: a,
-		inputs: i,
-		isReference: t.isReference,
-		[u]: t,
-		[d]: a
+		type: e.type,
+		value: i,
+		inputs: r,
+		isReference: e.isReference,
+		[u]: e,
+		[d]: i
 	};
 }, h = (e, t, n) => {
 	let r = e.inputs, i;
@@ -93,15 +93,15 @@ var u = Symbol("sheetxl.formulaNode.internal"), d = Symbol("sheetxl.formulaNode.
 	".:",
 	":.",
 	" "
-], _ = (e, l) => {
-	let u = e.type, d = e.value;
+], _ = (a, l) => {
+	let u = a.type, d = a.value;
 	switch (u) {
-		case s.Function: return t(String(d), l);
-		case s.Infix: return n(d, l[0], l[1], e.isReference ?? g.includes(d));
-		case s.Prefix: return o(d, l?.[0], e.isReference ?? d === "@");
-		case s.Postfix: return i(d, l?.[0], e.isReference ?? d === "#");
-		case s.Named: {
-			let e = a(typeof d == "string" ? d : d?.name), t = typeof d == "object" ? d?.scope : null;
+		case c.Function: return n(String(d), l);
+		case c.Infix: return o(d, l[0], l[1], a.isReference ?? g.includes(d));
+		case c.Prefix: return i(d, l?.[0], a.isReference ?? d === "@");
+		case c.Postfix: return e(d, l?.[0], a.isReference ?? d === "#");
+		case c.Named: {
+			let e = r(typeof d == "string" ? d : d?.name), t = typeof d == "object" ? d?.scope : null;
 			return t && (e.value = {
 				...e.value,
 				scope: t
@@ -110,33 +110,33 @@ var u = Symbol("sheetxl.formulaNode.internal"), d = Symbol("sheetxl.formulaNode.
 				optional: !0
 			}), e;
 		}
-		case s.Cell: return r(d);
-		case s.TableReference: return {
-			type: s.TableReference,
+		case c.Cell: return t(d);
+		case c.TableReference: return {
+			type: c.TableReference,
 			value: d,
 			inputs: l ?? null,
 			isReference: !0
 		};
-		case s.TableSpecifier: return {
-			type: s.TableSpecifier,
+		case c.TableSpecifier: return {
+			type: c.TableSpecifier,
 			value: d,
 			image: `[${d}]`,
 			inputs: null,
 			isReference: !0
 		};
-		case s.TableColumn: {
-			let e = typeof d == "string" && d.startsWith("[") ? d : `[${c(String(d))}]`;
+		case c.TableColumn: {
+			let e = typeof d == "string" && d.startsWith("[") ? d : `[${s(String(d))}]`;
 			return {
-				type: s.TableColumn,
+				type: c.TableColumn,
 				value: d,
 				image: e,
 				inputs: null,
 				isReference: !0
 			};
 		}
-		case s.String:
-		case s.Number:
-		case s.Boolean: return {
+		case c.String:
+		case c.Number:
+		case c.Boolean: return {
 			type: u,
 			value: d,
 			inputs: null,
@@ -146,7 +146,7 @@ var u = Symbol("sheetxl.formulaNode.internal"), d = Symbol("sheetxl.formulaNode.
 			type: u,
 			value: d,
 			inputs: l ?? null,
-			isReference: e.isReference
+			isReference: a.isReference
 		};
 	}
 }, v = (e) => {

package/licenses/dependencies.txt

@@ -1090,4 +1090,74 @@ No contributor can revoke this license.
 ***As far as the law allows, this software comes as is,
 without any warranty or condition, and no contributor
 will be liable to anyone for any damages related to this
-software or this license, under any kind of legal claim.***
+software or this license, under any kind of legal claim.***
+
+---
+
+Name: @noble/ed25519
+Version: 3.2.0
+License: MIT
+Private: false
+Description: Fastest 5KB JS implementation of ed25519 EDDSA signatures compliant with RFC8032, FIPS 186-5 & ZIP215
+Repository: git+https://github.com/paulmillr/noble-ed25519.git
+Homepage: https://paulmillr.com/noble/
+Author: Paul Miller (https://paulmillr.com)
+License Text:
+===
+
+The MIT License (MIT)
+
+Copyright (c) 2019 Paul Miller (https://paulmillr.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the “Software”), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+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.
+
+---
+
+Name: @noble/hashes
+Version: 2.4.0
+License: MIT
+Private: false
+Description: Audited & minimal 0-dependency JS implementation of SHA, RIPEMD, BLAKE, HMAC, HKDF, PBKDF & Scrypt
+Repository: git+https://github.com/paulmillr/noble-hashes.git
+Homepage: https://paulmillr.com/noble/
+Author: Paul Miller (https://paulmillr.com)
+License Text:
+===
+
+The MIT License (MIT)
+
+Copyright (c) 2022 Paul Miller (https://paulmillr.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the “Software”), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+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.

package/node/esm/{BqiexuA89caYnAPz.mjs → -K4Cek-bTUItkB_8.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/-b8yNV4v9qiq8EMY.mjs

@@ -0,0 +1,117 @@
+/**
+* @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 { r as e } from "./CKCG2peOkTq0gIIW.mjs";
+import { FormulaError as r, ScalarType as t } from "@sheetxl/primitives";
+function n(e, r, n) {
+	const l = (e) => {
+		let r = null;
+		e.s ? r = e.s : e.r || e.g || (r = t.Number);
+		const o = {
+			name: e.n,
+			scalar: r,
+			range: e.r ?? null,
+			arrayDepth: e.d ?? 0,
+			optional: "?" === e.m,
+			rest: "..." === e.m
+		};
+		return void 0 !== e.e && (o.enum = n(e.e)), e.l && (o.lambda = e.l), void 0 !== e.a && (o.lambdaArity = e.a), e.ae && (o.acceptError = !0), void 0 !== e.v && (o.defaultValue = e.v), e.u && (o.omittable = !0), void 0 !== e.w && (o.omittedValue = e.w), e.nl && (o.noLift = !0), e.nf && (o.noFilter = !0), e.lz && (o.lazy = !0), e.rt && (o.reportType = !0), e.vr && (o.valueOrRange = !0), e.g && (o.repeating = e.g.map(l)), delete o.dim, o;
+	}, o = [], u = r.p;
+	if (u) for (let e = 0; e < u.length; e++) o.push(l(u[e]));
+	let a = null;
+	r.r && (a = {}, r.r.s && (a.scalar = r.r.s), r.r.r && (a.range = "p" === r.r.r || "r" === r.r.r || "m" === r.r.r ? r.r.r : null), r.r.d && (a.arrayDepth = r.r.d ?? 0), r.r.l && (a.lambda = r.r.l || null), r.r.k && (a.kind = r.r.k), r.r.vol && (a.volatile = !0));
+	const i = {
+		name: e,
+		parameters: o,
+		returnType: a,
+		context: r.c ? "calculation" : null,
+		maxArguments: r.mx
+	};
+	r.h && (i.hidden = !0);
+	const s = [];
+	for (const e of o) for (const r of [e, ...e.repeating ?? []]) r.enum && !s.includes(r.enum.id) && s.push(r.enum.id);
+	return {
+		decl: i,
+		enumIds: s
+	};
+}
+var l = "SheetXL", o = {
+	declarations: { TABLE: {
+		p: [
+			{
+				n: "rowInput",
+				r: "r",
+				m: "?",
+				u: 1,
+				ae: 1
+			},
+			{
+				n: "columnInput",
+				r: "r",
+				m: "?",
+				u: 1,
+				ae: 1
+			},
+			{ n: "rows" },
+			{ n: "columns" }
+		],
+		r: { r: "r" }
+	} },
+	category: l
+}, u = async () => ({ default: { TABLE: {
+	s: "Returns a what-if data table: a formula on the table's edge evaluated with each axis value put into the input cells.",
+	p: {
+		rowInput: { d: "is the cell the values in the row above the results are put into; omit it for a table with one input down a column." },
+		columnInput: { d: "is the cell the values in the column left of the results are put into; omit it for a table with one input along a row." },
+		rows: { d: "is the number of rows of results." },
+		columns: { d: "is the number of columns of results." }
+	}
+} } }), a = (e, t, n) => {
+	if (null == n) return null;
+	if (r.isError(n)) return r.isError(n, r.Code.Ref) ? "ref" : r.BuiltIn.Value;
+	const l = n;
+	if (!0 !== l.isIReferenceRange) return r.BuiltIn.Value;
+	const o = l.getCoords();
+	return o.rowStart !== o.rowEnd || o.colStart !== o.colEnd || e._gridIdOfReference(o) !== t ? r.BuiltIn.Value : {
+		rowIndex: o.rowStart,
+		colIndex: o.colStart
+	};
+}, i = (e, r) => {
+	if ("number" != typeof e || !Number.isFinite(e)) return null;
+	const t = Math.trunc(e);
+	return t >= 1 && t <= r ? t : null;
+}, s = (t) => ({ TABLE: (n, l, o, u) => ((t, n, l, o, u) => {
+	const s = t(), c = s._gridIdOfReference(null);
+	if (!c) return r.BuiltIn.Value;
+	const f = a(s, c, n);
+	if (r.isError(f)) return f;
+	const d = a(s, c, l);
+	if (r.isError(d)) return d;
+	if (null === f && null === d) return r.BuiltIn.Value;
+	const m = s.getEntireCoords(), p = i(o, m.rowEnd + 1), h = i(u, m.colEnd + 1);
+	if (null === p || null === h) return r.BuiltIn.Value;
+	const g = s.getRow(), w = s.getColumn();
+	if (0 === g || 0 === w) return r.BuiltIn.Ref;
+	if ("ref" === f || "ref" === d) return s.createRange(p, h, r.BuiltIn.Ref);
+	const I = {
+		gridId: c,
+		row: g,
+		col: w,
+		rows: p,
+		cols: h,
+		rowInput: f,
+		colInput: d
+	}, v = e(I);
+	for (let e = 0; e < v.length; e++) {
+		const r = s.getReference(v[e]);
+		if (r?.isFormulaError) return r;
+		const t = r.getRowCount(), n = r.getColumnCount();
+		for (let e = 0; e < t; e++) for (let t = 0; t < n; t++) r.getValueAt(e, t);
+	}
+	const b = s._evaluateWhatIf(I);
+	return null === b ? r.BuiltIn.Value : s.createRange(p, h, b);
+})(t, n, l, o, u) });
+export { n as a, s as i, o as n, u as r, l as t };