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

package/node/esm/857CIBgQgGpnqrXk.mjs

@@ -0,0 +1,199 @@
+/**
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
+*
+* (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 n, Ln as t, Mn as r, Un as s, Vn as o, Wn as l, dr as c, er as i, kn as a } from "./OVfaSb506tNSIvbv.mjs";
+var u = Symbol("sheetxl.formulaNode.internal"), f = Symbol("sheetxl.formulaNode.value"), p = Symbol("sheetxl.formulaNode.replaced"), g = { canonical: !0 }, v = (n, t) => {
+	const r = n.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 = ((n, t) => {
+		const r = n.type, s = n.value;
+		if (r === c.Named) {
+			const r = s;
+			let o = r?.nameId, l = r?.scope ?? null;
+			return t && (o = t.resolve(e.NamedFormula, o)?.toString() ?? o, l && (l = t.resolve(e.Sheet, l)?.toString() ?? l)), n.binding?.declaration && n.binding.optional ? {
+				name: o,
+				scope: l,
+				optional: !0
+			} : {
+				name: o,
+				scope: l
+			};
+		}
+		if (r === c.TableReference) {
+			const n = "string" == typeof s ? s : s?.tableId;
+			return n ? t ? t.resolve(e.Table, n)?.toString() ?? n : n : "";
+		}
+		if (!t) return s;
+		switch (r) {
+			case c.Function: return t.resolve(e.Function, s, g)?.toString() ?? s;
+			case c.TableColumn: return t.resolve(e.TableColumn, s)?.toString() ?? s;
+			case c.Cell: {
+				const n = s;
+				if (n?.scope) {
+					const r = t.resolve(e.Sheet, n.scope)?.toString() ?? n.scope;
+					return {
+						...n,
+						scope: r
+					};
+				}
+				return s;
+			}
+			case c.Error: {
+				const n = s;
+				if (n?.scope) {
+					const r = t.resolve(e.Sheet, n.scope)?.toString() ?? n.scope;
+					return {
+						...n,
+						scope: r
+					};
+				}
+				return s;
+			}
+			default: return s;
+		}
+	})(n, t);
+	return {
+		type: n.type,
+		value: o,
+		inputs: s,
+		isReference: n.isReference,
+		[u]: n,
+		[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 = [
+	":",
+	".:.",
+	".:",
+	":.",
+	" "
+], d = (e, a) => {
+	const u = e.type, f = e.value;
+	switch (u) {
+		case c.Function: return n(String(f), a);
+		case c.Infix: return t(f, a[0], a[1], e.isReference ?? y.includes(f));
+		case c.Prefix: return l(f, a?.[0], e.isReference ?? "@" === f);
+		case c.Postfix: return s(f, a?.[0], e.isReference ?? "#" === f);
+		case c.Named: {
+			const e = o("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 c.Cell: return r(f);
+		case c.TableReference: return {
+			type: c.TableReference,
+			value: f,
+			inputs: a ?? null,
+			isReference: !0
+		};
+		case c.TableSpecifier: return {
+			type: c.TableSpecifier,
+			value: f,
+			image: `[${f}]`,
+			inputs: null,
+			isReference: !0
+		};
+		case c.TableColumn: {
+			const e = "string" == typeof f && f.startsWith("[") ? f : `[${i(String(f))}]`;
+			return {
+				type: c.TableColumn,
+				value: f,
+				image: e,
+				inputs: null,
+				isReference: !0
+			};
+		}
+		case c.String:
+		case c.Number:
+		case c.Boolean: return {
+			type: u,
+			value: f,
+			inputs: null,
+			isLiteral: !0
+		};
+		default: return {
+			type: u,
+			value: f,
+			inputs: a ?? null,
+			isReference: e.isReference
+		};
+	}
+}, b = (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 ? b(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 = d(e, r);
+		return S(l, n), l;
+	}
+	const s = d(e, r), o = e[p];
+	return o && S(s, o), s;
+}, S = (e, n) => {
+	a(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 = b(e);
+	return !0 === e.legacyIntersect && (n.legacyIntersect = !0), n;
+}
+export { h as n, R as r, T as t };