@sheetxl/sdk 0.8.0-beta.14 → 0.8.0-beta.16

package/browser/esm/{yuF8SbWfjBfrxcq5.mjs → r-o0UCm7KtluNmyK.mjs}

@@ -1,10 +1,10 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.14
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { n as e } from "./BWoz4kQdA5KKJfl6.mjs";
+import { n as e } from "./Dx9Fya60meMpuHqm.mjs";
 import { instantiateWasmBindgen as t } from "@sheetxl/utils";
 var n = e({
 	FaceInfo: () => r,

package/licenses/dependencies.txt

@@ -1026,74 +1026,6 @@ License Text:
 
 ---
 
-Name: lru-cache
-Version: 11.5.3
-License: BlueOak-1.0.0
-Private: false
-Description: A cache object that deletes the least-recently-used items.
-Repository: git+ssh://git@github.com/isaacs/node-lru-cache.git
-Author: Isaac Z. Schlueter <i@izs.me>
-License Text:
-===
-
-# Blue Oak Model License
-
-Version 1.0.0
-
-## Purpose
-
-This license gives everyone as much permission to work with
-this software as possible, while protecting contributors
-from liability.
-
-## Acceptance
-
-In order to receive this license, you must agree to its
-rules.  The rules of this license are both obligations
-under that agreement and conditions to your license.
-You must not do anything with this software that triggers
-a rule that you cannot or will not follow.
-
-## Copyright
-
-Each contributor licenses you to do everything with this
-software that would otherwise infringe that contributor's
-copyright in it.
-
-## Notices
-
-You must ensure that everyone who gets a copy of
-any part of this software from you, with or without
-changes, also gets the text of this license or a link to
-<https://blueoakcouncil.org/license/1.0.0>.
-
-## Excuse
-
-If anyone notifies you in writing that you have not
-complied with [Notices](#notices), you can keep your
-license by taking all practical steps to comply within 30
-days after the notice.  If you do not do so, your license
-ends immediately.
-
-## Patent
-
-Each contributor licenses you to do everything with this
-software that would otherwise infringe any patent claims
-they can license or become able to license.
-
-## Reliability
-
-No contributor can revoke this license.
-
-## No Liability
-
-***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.***
-
----
-
 Name: @noble/ed25519
 Version: 3.2.0
 License: MIT
@@ -1160,4 +1092,72 @@ 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.
+THE SOFTWARE.
+
+---
+
+Name: lru-cache
+Version: 11.5.3
+License: BlueOak-1.0.0
+Private: false
+Description: A cache object that deletes the least-recently-used items.
+Repository: git+ssh://git@github.com/isaacs/node-lru-cache.git
+Author: Isaac Z. Schlueter <i@izs.me>
+License Text:
+===
+
+# Blue Oak Model License
+
+Version 1.0.0
+
+## Purpose
+
+This license gives everyone as much permission to work with
+this software as possible, while protecting contributors
+from liability.
+
+## Acceptance
+
+In order to receive this license, you must agree to its
+rules.  The rules of this license are both obligations
+under that agreement and conditions to your license.
+You must not do anything with this software that triggers
+a rule that you cannot or will not follow.
+
+## Copyright
+
+Each contributor licenses you to do everything with this
+software that would otherwise infringe that contributor's
+copyright in it.
+
+## Notices
+
+You must ensure that everyone who gets a copy of
+any part of this software from you, with or without
+changes, also gets the text of this license or a link to
+<https://blueoakcouncil.org/license/1.0.0>.
+
+## Excuse
+
+If anyone notifies you in writing that you have not
+complied with [Notices](#notices), you can keep your
+license by taking all practical steps to comply within 30
+days after the notice.  If you do not do so, your license
+ends immediately.
+
+## Patent
+
+Each contributor licenses you to do everything with this
+software that would otherwise infringe any patent claims
+they can license or become able to license.
+
+## Reliability
+
+No contributor can revoke this license.
+
+## No Liability
+
+***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.***

package/node/esm/{BEBt5fo__rvT2q_u.mjs → 446KYBjJQa8g-8Gg.mjs}

@@ -1,16 +1,18 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.14
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { Cn as t, Er as o, Hi as r, Vi as n, ia as l, n as e, na as a, ra as c } from "./DLdXl0O0TXuyqLU4.mjs";
+import { Fa as t, Pa as o, Xa as r, Ya as n, Za as l, dr as e, n as a, vi as c } from "./CVPieTgKCwkL21nD.mjs";
 import { FormulaError as s, IRange as u } from "@sheetxl/primitives";
 import { CommonUtils as d } from "@sheetxl/utils";
 var i = (t) => {
 	let o = t.ext;
 	return null === o && (o = t.ext = {
 		spillDependents: d.EmptyArray,
+		spillRowStart: -1,
+		spillColStart: -1,
 		spillRowEnd: -1,
 		spillColEnd: -1,
 		fixedRef: null,
@@ -26,63 +28,63 @@ var i = (t) => {
 	const o = t.precedents;
 	return null !== o ? o.length : t.block.paramLength;
 }, S = (t) => {
-	if (t instanceof n) return new l(t);
-	const o = !0 === t.isIRepeatingList ? t : null, r = o ? o.getPeriod() : t.length, e = Array.isArray(t);
-	if (!o && !e && !m(t)) return new l(t);
-	let a = null;
-	for (let o = 0; o < r; o++) if (h(e ? t[o] : t.at(o))) {
-		if (null === a) {
-			a = new Array(r);
-			for (let o = 0; o < r; o++) a[o] = e ? t[o] : t.at(o);
+	if (t instanceof o) return new l(t);
+	const n = !0 === t.isIRepeatingList ? t : null, e = n ? n.getPeriod() : t.length, a = Array.isArray(t);
+	if (!n && !a && !m(t)) return new l(t);
+	let c = null;
+	for (let o = 0; o < e; o++) if (h(a ? t[o] : t.at(o))) {
+		if (null === c) {
+			c = new Array(e);
+			for (let o = 0; o < e; o++) c[o] = a ? t[o] : t.at(o);
 		}
-		a[o] = s.BuiltIn.Calc;
+		c[o] = s.BuiltIn.Calc;
 	}
-	return new l(null === a ? t : o ? new c(a, t.length) : a);
-}, h = (t) => null !== t && "object" == typeof t && !s.isError(t) && !0 !== t.isIRichData && !o(t), m = (t) => {
-	let o = !1;
-	return l.forEachLeaf(t, (t, r, l, e) => {
-		if (o || t instanceof n) return;
-		let a = r + e - l;
-		!0 === t.isIRepeatingList && (a = Math.min(a, r + t.getPeriod() - 1));
-		for (let n = r; !o && n <= a; n++) o = h(t.at(n));
-	}), o;
-}, g = class extends t {
+	return new l(null === c ? t : n ? new r(c, t.length) : c);
+}, h = (t) => null !== t && "object" == typeof t && !s.isError(t) && !0 !== t.isIRichData && !c(t), m = (t) => {
+	let r = !1;
+	return l.forEachLeaf(t, (t, n, l, e) => {
+		if (r || t instanceof o) return;
+		let a = n + e - l;
+		!0 === t.isIRepeatingList && (a = Math.min(a, n + t.getPeriod() - 1));
+		for (let o = n; !r && o <= a; o++) r = h(t.at(o));
+	}), r;
+}, g = class extends e {
 	constructor(t, o) {
 		super(), this.nodes = t, this.count = o;
 	}
-}, I = class extends t {
+}, I = class extends e {
 	constructor(t) {
 		super(), this.node = t;
 	}
-}, E = class extends t {
+}, E = class extends e {
 	constructor(t) {
 		super(), this.node = t;
 	}
 };
 function p(t, o = 0, r = 0) {
-	const n = (t = t._materializeEmpty())._values, l = t._coords, e = n.getRuns({ bounds: l }), c = n.getAxis() !== u.Axis.Row, s = c ? l.colStart : l.rowStart, d = c ? l.rowStart : l.colStart, i = new a.Builder(null, o, r);
-	let w = e.next();
+	const l = (t = t._materializeEmpty())._values, e = t._coords, a = l.getRuns({ bounds: e }), c = l.getAxis() !== u.Axis.Row, s = c ? e.colStart : e.rowStart, d = c ? e.rowStart : e.colStart, i = new n.Builder(null, o, r);
+	let w = a.next();
 	for (; !w.done;) {
 		const t = w.value;
-		i.pushMultipleAt(t[0] - s, t[1] - d, t[2]), w = e.next();
+		i.pushMultipleAt(t[0] - s, t[1] - d, t[2]), w = a.next();
 	}
 	return i.build();
 }
-function x(t) {
-	if (null === t || "object" != typeof t || !0 !== t.isIRange) return t;
-	const o = t, n = o._values, l = new r({
+function x(o) {
+	if (null === o || "object" != typeof o || !0 !== o.isIRange) return o;
+	const r = o, n = r._values, l = new t({
 		axis: n.getAxis(),
 		createRun: S
-	}), a = p(o);
-	return a && l.setValues(a.tuples), new e(o._runtime, l, {
+	}), e = p(r);
+	return e && l.setValues(e.tuples), new a(r._runtime, l, {
 		colStart: 0,
 		rowStart: 0,
-		colEnd: o.getColumnCount() - 1,
-		rowEnd: o.getRowCount() - 1
+		colEnd: r.getColumnCount() - 1,
+		rowEnd: r.getRowCount() - 1
 	});
 }
 function b(t, o, r) {
-	const n = o.rowEnd - o.rowStart + 1, l = o.colEnd - o.colStart + 1, e = function(t, o, r) {
+	const l = o.rowEnd - o.rowStart + 1, e = o.colEnd - o.colStart + 1, a = function(t, o, r) {
 		const n = t?.isIRange ? t : null, l = n ? n.getRowCount() : 1, e = n ? n.getColumnCount() : 1, a = new Array(o);
 		for (let c = 0; c < o; c++) {
 			const o = new Array(r), u = 1 === l ? 0 : c < l ? c : -1;
@@ -93,13 +95,13 @@ function b(t, o, r) {
 			a[c] = o;
 		}
 		return a;
-	}(t, n, l), c = r ? l : n, u = r ? n : l, d = r ? o.colStart : o.rowStart, i = r ? o.rowStart : o.colStart, w = new a.Builder(null);
+	}(t, l, e), c = r ? e : l, u = r ? l : e, d = r ? o.colStart : o.rowStart, i = r ? o.rowStart : o.colStart, w = new n.Builder(null);
 	let f = !0;
 	for (let t = 0; t < c; t++) {
 		let o = null, n = 0;
 		for (let l = 0; l < u; l++) {
-			const a = r ? e[l][t] : e[t][l];
-			null != a ? (o || (o = [], n = l, f = !1), o.push(a)) : o && (w.pushMultipleAt(d + t, i + n, o), o = null);
+			const e = r ? a[l][t] : a[t][l];
+			null != e ? (o || (o = [], n = l, f = !1), o.push(e)) : o && (w.pushMultipleAt(d + t, i + n, o), o = null);
 		}
 		o && w.pushMultipleAt(d + t, i + n, o);
 	}
@@ -130,23 +132,23 @@ function R(t, o, r, n, l, e) {
 	const p = h <= d.rowStart && m >= d.rowEnd && g <= d.colStart && I >= d.colEnd;
 	!p && g === E.colFrom && I === E.colTo && h <= E.rowTo + 1 && m >= E.rowFrom - 1 ? (h < E.rowFrom && l(u, h, E.rowFrom - 1, g, I, n), m > E.rowTo && l(u, E.rowTo + 1, m, g, I, n), h < E.rowFrom && (E.rowFrom = h), m > E.rowTo && (E.rowTo = m)) : !p && h === E.rowFrom && m === E.rowTo && g <= E.colTo + 1 && I >= E.colFrom - 1 ? (g < E.colFrom && l(u, h, m, g, E.colFrom - 1, n), I > E.colTo && l(u, h, m, E.colTo + 1, I, n), g < E.colFrom && (E.colFrom = g), I > E.colTo && (E.colTo = I)) : (l(u, h, m, g, I, n), (m - h + 1) * (I - g + 1) > (E.rowTo - E.rowFrom + 1) * (E.colTo - E.colFrom + 1) && (E.rowFrom = h, E.rowTo = m, E.colFrom = g, E.colTo = I));
 }
-function y(t, o, r, n, l, e, a = null) {
-	const c = t.value, s = c.formulaBlockWidth, u = c.formulaBlockHeight, d = Math.max(o, t.rowStart), i = Math.min(n, t.rowEnd);
-	if (d > i) return;
-	const w = Math.max(r, t.colStart), f = Math.min(l, t.colEnd);
+function y(t, o, r, n, l, e, a, c, s = null) {
+	const u = t.value, d = u.formulaBlockWidth, i = u.formulaBlockHeight, w = Math.max(n, t.rowStart), f = Math.min(e, t.rowEnd);
 	if (w > f) return;
-	const S = t.rowEnd - t.rowStart - (u - 1), h = t.colEnd - t.colStart - (s - 1), m = c.$absRowEnd ? 0 : Math.max(0, d - t.rowStart - S), g = c.$absRowStart ? u - 1 : Math.min(u - 1, i - t.rowStart), I = c.$absColEnd ? 0 : Math.max(0, w - t.colStart - h), E = c.$absColStart ? s - 1 : Math.min(s - 1, f - t.colStart);
-	if (m > g || I > E) return;
-	let p = 1, x = 0, b = 1, C = 0;
+	const S = Math.max(l, t.colStart), h = Math.min(a, t.colEnd);
+	if (S > h) return;
+	const m = t.rowEnd - t.rowStart - (i - 1), g = t.colEnd - t.colStart - (d - 1), I = u.$absRowEnd ? 0 : Math.max(0, w - t.rowStart - m), E = u.$absRowStart ? i - 1 : Math.min(i - 1, f - t.rowStart), p = u.$absColEnd ? 0 : Math.max(0, S - t.colStart - g), x = u.$absColStart ? d - 1 : Math.min(d - 1, h - t.colStart);
+	if (I > E || p > x) return;
+	let b = 1, C = 0, M = 1, R = 0;
 	if (o >= t.rowStart && o <= t.rowEnd && r >= t.colStart && r <= t.colEnd) {
 		const n = o - t.rowStart, l = r - t.colStart;
-		p = c.$absRowEnd ? 0 : Math.max(0, n - S), x = c.$absRowStart ? u - 1 : Math.min(u - 1, n), b = c.$absColEnd ? 0 : Math.max(0, l - h), C = c.$absColStart ? s - 1 : Math.min(s - 1, l);
+		b = u.$absRowEnd ? 0 : Math.max(0, n - m), C = u.$absRowStart ? i - 1 : Math.min(i - 1, n), M = u.$absColEnd ? 0 : Math.max(0, l - g), R = u.$absColStart ? d - 1 : Math.min(d - 1, l);
 	}
-	const M = c.formulaEntry.value, R = M.ref, y = (t) => {
-		const o = t.rowIndex - R.rowStart, r = t.colIndex - R.colStart;
-		o >= p && o <= x && r >= b && r <= C || e(t);
+	const y = u.formulaEntry.value, $ = y.ref, v = (t) => {
+		const o = t.rowIndex - $.rowStart, r = t.colIndex - $.colStart;
+		o >= b && o <= C && r >= M && r <= R || c(t);
 	};
-	null !== a ? a(M, R.rowStart + m, R.rowStart + g, R.colStart + I, R.colStart + E, y) : M.forEachNodeIn(R.rowStart + m, R.rowStart + g, R.colStart + I, R.colStart + E, y);
+	null !== s ? s(y, $.rowStart + I, $.rowStart + E, $.colStart + p, $.colStart + x, v) : y.forEachNodeIn($.rowStart + I, $.rowStart + E, $.colStart + p, $.colStart + x, v);
 }
 function $(t) {
 	const { row: o, col: r, rows: n, cols: l, rowInput: e, colInput: a } = t, c = (t, o, r, n) => ({

package/node/esm/{BELc5aQ_pFPgbiso.mjs → 5OfKfTRX2_y2NwpU.mjs}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.14
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 function e(e, t) {
 	if (!Number.isFinite(e)) return "0";

package/node/esm/{C-5JLSNof0FhkuFd.mjs → A3PEHO1HJvkHfb5n.mjs}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.14
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var x = [[
 	"0 r vc",

package/node/esm/{YpOpRyciqQLIY1-G.mjs → B4WUGzJBkQu7BXRm.mjs}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.14
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 var d = [
 	[

package/node/esm/{I-FZojIFWluC6X-j.mjs → BH8J6vKSO5zI_TWo.mjs}

@@ -1,8 +1,8 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.14
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.16
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
-* License: The license can be found at https://www.sheetxl.com/license.
+* License: SheetXL EULA — https://www.sheetxl.com/eula
 */
 import { CommonUtils as t, ProtectedError as e, messageKey as s, t as i } from "@sheetxl/utils";
 var n = (t, e) => {