@sheetxl/sdk 0.8.0-beta.10 → 0.8.0-beta.12

package/node/esm/ZXPFcsT2zrALCZux.mjs

@@ -0,0 +1,289 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.12
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { Bi as t, Er as o, Sn as r, Vi as n, n as l, na as e, ra as a, ta as s } from "./Vocy-I9dKzZMr0Ct.mjs";
+import { FormulaError as c, 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,
+		spillRowEnd: -1,
+		spillColEnd: -1,
+		fixedRef: null,
+		demandValue: void 0,
+		cycleGroup: 0,
+		cycleNext: null,
+		shownGroup: 0
+	}), o;
+}, w = (t) => {
+	const o = t.precedents;
+	return null !== o ? o : t.block.getPrecedentsAt(t.rowIndex, t.colIndex);
+}, f = (t) => {
+	const o = t.precedents;
+	return null !== o ? o.length : t.block.paramLength;
+}, S = (o) => {
+	if (o instanceof t) return new a(o);
+	const r = !0 === o.isIRepeatingList ? o : null, n = r ? r.getPeriod() : o.length, l = Array.isArray(o);
+	if (!r && !l && !g(o)) return new a(o);
+	let s = null;
+	for (let t = 0; t < n; t++) if (h(l ? o[t] : o.at(t))) {
+		if (null === s) {
+			s = new Array(n);
+			for (let t = 0; t < n; t++) s[t] = l ? o[t] : o.at(t);
+		}
+		s[t] = c.BuiltIn.Calc;
+	}
+	return new a(null === s ? o : r ? new e(s, o.length) : s);
+}, h = (t) => null !== t && "object" == typeof t && !c.isError(t) && !0 !== t.isIRichData && !o(t), g = (o) => {
+	let r = !1;
+	return a.forEachLeaf(o, (o, n, l, e) => {
+		if (r || o instanceof t) return;
+		let a = n + e - l;
+		!0 === o.isIRepeatingList && (a = Math.min(a, n + o.getPeriod() - 1));
+		for (let t = n; !r && t <= a; t++) r = h(o.at(t));
+	}), r;
+}, I = class extends r {
+	constructor(t, o) {
+		super(), this.nodes = t, this.count = o;
+	}
+}, p = class extends r {
+	constructor(t) {
+		super(), this.node = t;
+	}
+}, m = class extends r {
+	constructor(t) {
+		super(), this.node = t;
+	}
+};
+function x(t, o = 0, r = 0) {
+	const n = (t = t._materializeEmpty())._values, l = t._coords, e = n.getRuns({ bounds: l }), a = n.getAxis() !== u.Axis.Row, c = a ? l.colStart : l.rowStart, d = a ? l.rowStart : l.colStart, i = new s.Builder(null, o, r);
+	let w = e.next();
+	for (; !w.done;) {
+		const t = w.value;
+		i.pushMultipleAt(t[0] - c, t[1] - d, t[2]), w = e.next();
+	}
+	return i.build();
+}
+function E(t) {
+	if (null === t || "object" != typeof t || !0 !== t.isIRange) return t;
+	const o = t, r = o._values, e = new n({
+		axis: r.getAxis(),
+		createRun: S
+	}), a = x(o);
+	return a && e.setValues(a.tuples), new l(o._runtime, e, {
+		colStart: 0,
+		rowStart: 0,
+		colEnd: o.getColumnCount() - 1,
+		rowEnd: o.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 n = t?.isIRange ? t : null, l = n ? n.getRowCount() : 1, e = n ? n.getColumnCount() : 1, a = new Array(o);
+		for (let s = 0; s < o; s++) {
+			const o = new Array(r), u = 1 === l ? 0 : s < l ? s : -1;
+			for (let l = 0; l < r; l++) {
+				const r = 1 === e ? 0 : l < e ? l : -1;
+				o[l] = u < 0 || r < 0 ? c.BuiltIn.NA : n ? n.getValueAt(u, r) : t;
+			}
+			a[s] = o;
+		}
+		return a;
+	}(t, n, l), a = r ? l : n, u = r ? n : l, d = r ? o.colStart : o.rowStart, i = r ? o.rowStart : o.colStart, w = new s.Builder(null);
+	let f = !0;
+	for (let t = 0; t < a; 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);
+		}
+		o && w.pushMultipleAt(d + t, i + n, o);
+	}
+	return f ? null : w.build();
+}
+function C(t, o, r, n, l = null) {
+	const e = t.value, a = e.formulaBlockWidth, s = e.formulaBlockHeight, c = e.formulaEntry.value, u = r - t.colStart, d = o - t.rowStart, i = t.rowEnd - t.rowStart - (s - 1), w = t.colEnd - t.colStart - (a - 1), f = e.$absRowEnd ? 0 : Math.max(0, d - i), S = e.$absRowStart ? s - 1 : Math.min(s - 1, d), h = e.$absColEnd ? 0 : Math.max(0, u - w), g = e.$absColStart ? a - 1 : Math.min(a - 1, u), I = c.ref;
+	null !== l ? l(c, I.rowStart + f, I.rowStart + S, I.colStart + h, I.colStart + g, n) : c.forEachNodeIn(I.rowStart + f, I.rowStart + S, I.colStart + h, I.colStart + g, n);
+}
+function M(t, o, r, n, l, e, a = null) {
+	const s = t.value, c = s.formulaBlockWidth, u = s.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);
+	if (w > f) return;
+	const S = t.rowEnd - t.rowStart - (u - 1), h = t.colEnd - t.colStart - (c - 1), g = s.$absRowEnd ? 0 : Math.max(0, d - t.rowStart - S), I = s.$absRowStart ? u - 1 : Math.min(u - 1, i - t.rowStart), p = s.$absColEnd ? 0 : Math.max(0, w - t.colStart - h), m = s.$absColStart ? c - 1 : Math.min(c - 1, f - t.colStart);
+	if (g > I || p > m) return;
+	let x = 1, E = 0, b = 1, C = 0;
+	if (o >= t.rowStart && o <= t.rowEnd && r >= t.colStart && r <= t.colEnd) {
+		const n = o - t.rowStart, l = r - t.colStart;
+		x = s.$absRowEnd ? 0 : Math.max(0, n - S), E = s.$absRowStart ? u - 1 : Math.min(u - 1, n), b = s.$absColEnd ? 0 : Math.max(0, l - h), C = s.$absColStart ? c - 1 : Math.min(c - 1, l);
+	}
+	const M = s.formulaEntry.value, y = M.ref, R = (t) => {
+		const o = t.rowIndex - y.rowStart, r = t.colIndex - y.colStart;
+		o >= x && o <= E && r >= b && r <= C || e(t);
+	};
+	null !== a ? a(M, y.rowStart + g, y.rowStart + I, y.colStart + p, y.colStart + m, R) : M.forEachNodeIn(y.rowStart + g, y.rowStart + I, y.colStart + p, y.colStart + m, R);
+}
+function y(t) {
+	const { row: o, col: r, rows: n, cols: l, rowInput: e, colInput: a } = t, s = (t, o, r, n) => ({
+		rowStart: t,
+		colStart: o,
+		rowEnd: r,
+		colEnd: n
+	}), c = s(o - 1, r, o - 1, r + l - 1), u = s(o, r - 1, o + n - 1, r - 1);
+	return null !== e && null !== a ? [
+		s(o - 1, r - 1, o - 1, r - 1),
+		c,
+		u
+	] : null !== a ? [c, u] : [u, c];
+}
+var R = (t, o, r) => {
+	const { gridId: n, row: l, col: e } = t;
+	return null !== t.rowInput && null !== t.colInput ? {
+		gridId: n,
+		row: l - 1,
+		col: e - 1
+	} : null !== t.colInput ? {
+		gridId: n,
+		row: l - 1,
+		col: e + r
+	} : {
+		gridId: n,
+		row: l + o,
+		col: e - 1
+	};
+}, A = (t, o) => ({
+	gridId: t.gridId,
+	row: t.row - 1,
+	col: t.col + o
+}), $ = (t, o) => ({
+	gridId: t.gridId,
+	row: t.row + o,
+	col: t.col - 1
+}), v = (t, o) => 32768 * t + o;
+function B(t, o) {
+	const r = t.getPrecedents(), n = t.getDynamics(), l = /* @__PURE__ */ new Map(), e = [];
+	let a = !1;
+	const s = [], u = (t) => {
+		if (t.block.hasDataTable()) return;
+		const o = t.gridId;
+		if (!o) return;
+		let r = l.get(o);
+		r || (r = {
+			byCell: /* @__PURE__ */ new Map(),
+			spills: []
+		}, l.set(o, r));
+		const n = v(t.rowIndex, t.colIndex);
+		r.byCell.has(n) || (r.byCell.set(n, t), t.cachedValue?.isIRange && r.spills.push(t), e.push(t));
+	}, d = (t, o, r, n, l) => {
+		if (t.unanchored) return;
+		const e = t.ref;
+		t.mintNodesIn(e.rowStart + o, e.rowStart + r, e.colStart + n, e.colStart + l, u);
+	}, i = (t, o) => {
+		if (o.unanchored || o.hasDataTable()) return;
+		a = !0;
+		const r = o.ref;
+		o.mintNodesIn(r.rowStart, r.rowEnd, r.colStart, r.colEnd, u);
+	}, f = {
+		colStart: 0,
+		rowStart: 0,
+		colEnd: 0,
+		rowEnd: 0,
+		scope: o.gridId
+	}, S = (t, o, n, l, e) => {
+		f.rowStart = o, f.colStart = n, f.rowEnd = l, f.colEnd = e, f.scope = t, function(t, o, r, n, l) {
+			r.length = 0, t.search(o, !1, !1, r);
+			const e = r.length;
+			if (0 === e) return;
+			const a = o.colStart, s = o.rowStart, c = o.colEnd - a, u = o.rowEnd - s;
+			for (let t = 0; t < e; t++) {
+				const o = r[t], e = o.value, d = e.formulaEntry.value;
+				if (e.index < 0) {
+					l(o, d);
+					continue;
+				}
+				const i = d.ref, w = i.colEnd - i.colStart, f = i.rowEnd - i.rowStart, S = o.colEnd - o.colStart - w, h = o.rowEnd - o.rowStart - f;
+				let g = 0, I = f, p = 0, m = w;
+				const x = s - o.rowStart, E = a - o.colStart;
+				e.$absRowEnd || (g = Math.min(Math.max(x - h, 0), f)), e.$absRowStart || (I = Math.min(x + u, f)), e.$absColEnd || (p = Math.min(Math.max(E - S, 0), w)), e.$absColStart || (m = Math.min(c + E, w)), n(d, g, I, p, m);
+			}
+		}(r, f, s, d, i);
+	}, { rowInput: h, colInput: g } = o;
+	h && S(o.gridId, h.rowIndex, h.colIndex, h.rowIndex, h.colIndex), g && S(o.gridId, g.rowIndex, g.colIndex, g.rowIndex, g.colIndex);
+	for (let t = 0; t < e.length; t++) {
+		const o = e[t], r = o.gridId, l = o.rowIndex, s = o.colIndex, c = o.cachedValue;
+		c?.isIRange ? S(r, l, s, l + c.getRowCount() - 1, s + c.getColumnCount() - 1) : S(r, l, s, l, s), !a && n.has(o.block) && (a = !0);
+	}
+	if (0 === e.length) return e;
+	const I = [], p = (t) => {
+		const o = l.get(t.gridId)?.byCell.get(v(t.row, t.col)) ?? null;
+		null === o || I.includes(o) || I.push(o);
+	};
+	for (let t = 0; t < o.rows; t++) {
+		g && p($(o, t));
+		for (let r = 0; r < o.cols; r++) p(R(o, t, r));
+	}
+	if (h) for (let t = 0; t < o.cols; t++) p(A(o, t));
+	if (0 === I.length) return [];
+	const m = [], x = /* @__PURE__ */ new Set(), E = /* @__PURE__ */ new Set(), b = (t) => {
+		if (x.has(t) || E.has(t)) return;
+		E.add(t);
+		const o = ((t) => {
+			const o = [], r = w(t);
+			for (let n = 0; n < r.length; n++) {
+				const e = r[n];
+				if (c.isError(e)) continue;
+				const a = l.get(e.scope ?? t.gridId);
+				if (!a) continue;
+				const s = e.rowStart, u = e.colStart, d = e.rowEnd, i = e.colEnd;
+				if (s === d && u === i) {
+					const t = a.byCell.get(v(s, u));
+					t && !o.includes(t) && o.push(t);
+				} else for (const t of a.byCell.values()) {
+					const r = t.rowIndex, n = t.colIndex;
+					r >= s && r <= d && n >= u && n <= i && !o.includes(t) && o.push(t);
+				}
+				const w = a.spills;
+				for (let t = 0; t < w.length; t++) {
+					const r = w[t], n = r.cachedValue, l = r.rowIndex, e = r.colIndex;
+					l <= d && l + n.getRowCount() - 1 >= s && e <= i && e + n.getColumnCount() - 1 >= u && !o.includes(r) && o.push(r);
+				}
+			}
+			return o;
+		})(t);
+		for (let t = 0; t < o.length; t++) b(o[t]);
+		E.delete(t), x.add(t), m.push(t);
+	};
+	if (a) for (let t = 0; t < e.length; t++) b(e[t]);
+	else for (let t = 0; t < I.length; t++) b(I[t]);
+	return m;
+}
+function V(t, o, r) {
+	const { rows: n, cols: l, rowInput: e, colInput: a, gridId: s } = o, c = new Array(n);
+	for (let t = 0; t < n; t++) c[t] = new Array(l);
+	const u = (o) => t.layerFor(o.gridId).getValueAt(o.row, o.col) ?? null, d = (o, r) => {
+		t.layerFor(s).set(o.rowIndex, o.colIndex, r);
+	}, i = (o, r) => {
+		const n = t.layerFor(o.gridId), l = o.rowIndex, e = o.colIndex, a = r;
+		if (a?.isIRange) {
+			const t = a.getRowCount(), o = a.getColumnCount();
+			for (let r = 0; r < t; r++) for (let t = 0; t < o; t++) n.set(l + r, e + t, a.getValueAt(r, t) ?? null);
+			return;
+		}
+		n.set(l, e, r);
+	}, w = () => {
+		for (let o = 0; o < r.length; o++) {
+			const n = r[o];
+			i(n, t.evaluate(n));
+		}
+	};
+	for (let t = 0; t < n; t++) {
+		null !== a && (d(a, u($(o, t))), null === e && w());
+		for (let r = 0; r < l; r++) null !== e && (d(e, u(A(o, r))), w()), c[t][r] = u(R(o, t, r));
+	}
+	return c;
+}
+export { m as a, E as c, M as d, S as f, w as h, p as i, x as l, f as m, B as n, I as o, i as p, y as r, b as s, V as t, C as u };

package/node/esm/eimUGjiIP-b8HiM6.mjs

@@ -0,0 +1,199 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.12
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+import { $n as e, At as n, Gn as t, Kn as r, Qn as s, Rn as o, Vn as l, Xn as c, br as i, lr as a } from "./Vocy-I9dKzZMr0Ct.mjs";
+var u = Symbol("sheetxl.formulaNode.internal"), f = Symbol("sheetxl.formulaNode.value"), p = Symbol("sheetxl.formulaNode.replaced"), g = { canonical: !0 }, v = (e, t) => {
+	const r = e.inputs;
+	let s = null;
+	if (r) {
+		const e = r.length;
+		s = new Array(e);
+		for (let n = 0; n < e; n++) {
+			const e = r[n];
+			s[n] = e ? v(e, t) : e;
+		}
+	}
+	const o = ((e, t) => {
+		const r = e.type, s = e.value;
+		if (r === i.Named) {
+			const r = s;
+			let o = r?.nameId, l = r?.scope ?? null;
+			return t && (o = t.resolve(n.NamedFormula, o)?.toString() ?? o, l && (l = t.resolve(n.Sheet, l)?.toString() ?? l)), e.binding?.declaration && e.binding.optional ? {
+				name: o,
+				scope: l,
+				optional: !0
+			} : {
+				name: o,
+				scope: l
+			};
+		}
+		if (r === i.TableReference) {
+			const e = "string" == typeof s ? s : s?.tableId;
+			return e ? t ? t.resolve(n.Table, e)?.toString() ?? e : e : "";
+		}
+		if (!t) return s;
+		switch (r) {
+			case i.Function: return t.resolve(n.Function, s, g)?.toString() ?? s;
+			case i.TableColumn: return t.resolve(n.TableColumn, s)?.toString() ?? s;
+			case i.Cell: {
+				const e = s;
+				if (e?.scope) {
+					const r = t.resolve(n.Sheet, e.scope)?.toString() ?? e.scope;
+					return {
+						...e,
+						scope: r
+					};
+				}
+				return s;
+			}
+			case i.Error: {
+				const e = s;
+				if (e?.scope) {
+					const r = t.resolve(n.Sheet, e.scope)?.toString() ?? e.scope;
+					return {
+						...e,
+						scope: r
+					};
+				}
+				return s;
+			}
+			default: return s;
+		}
+	})(e, t);
+	return {
+		type: e.type,
+		value: o,
+		inputs: s,
+		isReference: e.isReference,
+		[u]: e,
+		[f]: o
+	};
+}, m = (e, n, t) => {
+	const r = e.inputs;
+	let s;
+	if (r) {
+		const n = r.length;
+		for (let o = 0; o < n; o++) {
+			const n = r[o];
+			if (!n) continue;
+			const l = m(n, e, t);
+			l !== n && (s || (s = [...r]), s[o] = l);
+		}
+	}
+	let o = e;
+	s && (o = {
+		...e,
+		inputs: s
+	});
+	const l = t(o, n);
+	return null == l || l === o ? o : (void 0 === l[u] && void 0 !== o[u] && (l[p] = o[u]), l);
+}, y = [
+	":",
+	".:.",
+	".:",
+	":.",
+	" "
+], b = (n, o) => {
+	const u = n.type, f = n.value;
+	switch (u) {
+		case i.Function: return t(String(f), o);
+		case i.Infix: return r(f, o[0], o[1], n.isReference ?? y.includes(f));
+		case i.Prefix: return e(f, o?.[0], n.isReference ?? "@" === f);
+		case i.Postfix: return s(f, o?.[0], n.isReference ?? "#" === f);
+		case i.Named: {
+			const e = c("string" == typeof f ? f : f?.name), n = "object" == typeof f ? f?.scope : null;
+			return n && (e.value = {
+				...e.value,
+				scope: n
+			}), "object" == typeof f && !0 === f?.optional && (e.value = {
+				...e.value,
+				optional: !0
+			}), e;
+		}
+		case i.Cell: return l(f);
+		case i.TableReference: return {
+			type: i.TableReference,
+			value: f,
+			inputs: o ?? null,
+			isReference: !0
+		};
+		case i.TableSpecifier: return {
+			type: i.TableSpecifier,
+			value: f,
+			image: `[${f}]`,
+			inputs: null,
+			isReference: !0
+		};
+		case i.TableColumn: {
+			const e = "string" == typeof f && f.startsWith("[") ? f : `[${a(String(f))}]`;
+			return {
+				type: i.TableColumn,
+				value: f,
+				image: e,
+				inputs: null,
+				isReference: !0
+			};
+		}
+		case i.String:
+		case i.Number:
+		case i.Boolean: return {
+			type: u,
+			value: f,
+			inputs: null,
+			isLiteral: !0
+		};
+		default: return {
+			type: u,
+			value: f,
+			inputs: o ?? null,
+			isReference: n.isReference
+		};
+	}
+}, d = (e) => {
+	const n = e[u], t = e.inputs;
+	let r = null;
+	if (t) {
+		const e = t.length;
+		r = new Array(e);
+		for (let n = 0; n < e; n++) {
+			const e = t[n];
+			r[n] = e ? d(e) : e;
+		}
+	}
+	if (n) {
+		const t = e.value !== e[f];
+		let s = !1;
+		const o = n.inputs;
+		if (r && o && r.length === o.length) {
+			for (let e = 0; e < r.length; e++) if (r[e] !== o[e]) {
+				s = !0;
+				break;
+			}
+		} else s = null === r != (null == o) || (r?.length ?? 0) !== (o?.length ?? 0);
+		if (!t && !s) return n;
+		if (!t) return {
+			...n,
+			inputs: r
+		};
+		const l = b(e, r);
+		return S(l, n), l;
+	}
+	const s = b(e, r), o = e[p];
+	return o && S(s, o), s;
+}, S = (e, n) => {
+	o(e, n), e.type !== n.type && void 0 !== e.image && (e.image = void 0);
+};
+function h(e, n) {
+	return v(e, n);
+}
+function R(e, n) {
+	return e && "function" == typeof n ? m(e, void 0, n) : e;
+}
+function T(e) {
+	const n = d(e);
+	return !0 === e.legacyIntersect && (n.legacyIntersect = !0), n;
+}
+export { h as n, R as r, T as t };

package/node/esm/icn2nX5Z8e_3mNAv.mjs

@@ -0,0 +1,12 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.12
+*
+* (C) 2026-present SheetXL Inc. & Michael T. Ford
+* License: The license can be found at https://www.sheetxl.com/license.
+*/
+function e(e, t) {
+	if (!Number.isFinite(e)) return "0";
+	let i = e.toFixed(t);
+	return i.indexOf(".") >= 0 && (i = i.replace(/\.?0+$/, "")), "-0" === i ? "0" : i;
+}
+export { e as t };