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

package/browser/esm/nvU0ClAbf0g94YBK.mjs

@@ -0,0 +1,1695 @@
+/**
+* @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 { $n as e, An as t, En as n, Gr as r, Ht as i, Nt as a, On as o, Pt as s, Qn as c, St as l, Vn as u, Wn as d, Zr as f, _ as p, ar as m, dr as h, f as g, fn as _, h as v, jt as y, kn as b, lr as x, mi as S, n as ee, ni as C, or as w, p as te, s as T, tr as E, u as D, ur as ne } from "./C16ycKja6zG0crV_.mjs";
+import { Qt as re } from "./CV5EGEjG5_-CPpP0.mjs";
+import { FormulaError as O, Scalar as k, ScalarType as A, ValueKind as j, isLazyValue as ie } from "@sheetxl/primitives";
+import { CommonUtils as M } from "@sheetxl/utils";
+var ae = (e, t) => e + t, oe = (e, t) => e - t, se = (e, t) => l(e + t, e), ce = (e, t) => l(e - t, e), le = (e, t) => g(e * t), ue = (e, t) => t === 0 ? O.BuiltIn.Div0 : g(e / t), de = (e, t) => {
+	if (e === 0) {
+		if (t < 0) return O.BuiltIn.Div0;
+		if (t === 0) return NaN;
+	}
+	if (e < 0) {
+		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return g(e ** t);
+		let n = Number((1 / t).toPrecision(15));
+		return Number.isInteger(n) && Math.abs(n % 2) === 1 ? g(-((-e) ** t)) : NaN;
+	}
+	return g(e ** t);
+}, fe = (e = "", t = "") => {
+	e === null && (e = ""), t === null && (t = "");
+	let n = typeof t;
+	typeof e == "boolean" && (e = S(e)), n === "boolean" && (t = S(t));
+	let r = "" + e + t;
+	return r.length > k.MAX_TEXT_LENGTH ? r.slice(0, k.MAX_TEXT_LENGTH) : r;
+}, pe = (e, t = null, n = null) => e.compare(t, n) === 0, me = (e, t = null, n = null) => e.compare(t, n) !== 0, he = (e, t = null, n = null) => e.compare(t, n) > 0, ge = (e, t = null, n = null) => e.compare(t, n) >= 0, _e = (e, t = null, n = null) => e.compare(t, n) < 0, ve = (e, t = null, n = null) => e.compare(t, n) <= 0, N = {
+	type: A.Number,
+	coerce: [A.Boolean, A.String],
+	onError: "value",
+	misalignValue: O.BuiltIn.NA
+}, ye = {
+	type: A.String,
+	coerce: [A.Boolean, A.Number],
+	onError: "value",
+	misalignValue: O.BuiltIn.NA
+}, be = {
+	onError: "value",
+	misalignValue: O.BuiltIn.NA
+}, P = (e) => typeof e == "object" && e && !0 === e.isIReferenceRange && e.size === 1 ? e.getValueAt(0, 0) ?? null : e, F = (e, t, n, r) => {
+	if (t !== null && t.colStart !== void 0 && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && O.isError(t)) return t;
+	if (n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && O.isError(n)) return n;
+	if (t = P(t), n = P(n), typeof t == "number" && typeof n == "number") return r(t, n);
+	let i, a;
+	if (t?.isIRange ? i = t : n?.isIRange && (a = n), !i && !a) {
+		let i = e.getRuntime();
+		return t = T(i, t, p(t, !0), A.Number, !0), n = T(i, n, p(n, !0), A.Number, !0), t && O.isError(t) ? t : n && O.isError(n) ? n : r(t, n);
+	}
+	let o = !i, s = o ? t : n;
+	return (i ?? a).broadcast(s, (t, n) => t && O.isError(t) ? t : n && O.isError(n) ? n : v(o ? r(n, t) : r(t, n), e), N).fillEmpty(0);
+}, I = (e, t, n, r) => {
+	if (_(t) || _(n) || ie(t) || ie(n)) return O.BuiltIn.Value;
+	if (t !== null && t.colStart !== void 0 && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && O.isError(t)) return t;
+	if (n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && O.isError(n)) return n;
+	let i, a;
+	t = P(t), n = P(n);
+	let o = !1;
+	return t?.isIRange ? (i = t, a = n) : n?.isIRange && (i = n, a = t, o = !0), i ? i.broadcast(a, (t, n) => t && O.isError(t) ? t : n && O.isError(n) ? n : (t = L(t), n = L(n), o ? r(e, n, t) : r(e, t, n)), be) : O.isError(t) ? t : O.isError(n) ? n : r(e, L(t), L(n));
+}, L = (e) => !0 === e?.isIRichData ? e.toPrimitive?.() ?? e : e, R = (e, t, n) => {
+	if (n ??= 0, n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && O.isError(n)) return n;
+	n = P(n);
+	let r, i = 1;
+	if (t === "+") return n;
+	if (t !== "-") throw new O.Value(`Unrecognized prefix: ${t}`);
+	if (i = -i, n?.isIRange && (r = n), !r) {
+		let t = e.getRuntime();
+		return typeof (n = T(t, n, p(n, !0), A.Number, !0)) == "number" ? n * i : O.BuiltIn.Value;
+	}
+	return r.broadcast(i, (e, t) => e && O.isError(e) ? e : t && O.isError(t) ? t : le(e, t), N);
+}, z = (e) => e.getCode() <= O.Code.NA ? e : O.BuiltIn.Value, B = (e, t, n, r, i) => {
+	if (O.isError(t)) return z(t);
+	if (n && O.isError(n)) return z(n);
+	if (!t) return O.BuiltIn.Ref;
+	if (t.isIReferenceRange && n && !n.isIReferenceRange ? n = e.getReference(n) : n && n.isIReferenceRange && t && !t.isIReferenceRange && (t = e.getReference(t)), t.isIReferenceRange && (t = t.getCoords()), t.colStart === void 0 || (n.isIReferenceRange && (n = n.getCoords()), n.colStart === void 0)) return O.BuiltIn.Value;
+	let a = t.scope ? i !== "either" || n.scope ? null : t : n;
+	if (a?.scope) {
+		let t = e.getReference(a);
+		if (O.isError(t)) return t;
+		if (e.getSheetIndex() !== e.getSheetIndex(t)) return O.BuiltIn.Value;
+	}
+	let o = r(t, n);
+	return O.isError(o) ? o : o ? e.getReference(o) : O.BuiltIn.Null;
+}, xe = {
+	"+": (e, t, n) => F(e, t, n, ae),
+	"-": (e, t, n) => F(e, t, n, oe),
+	"*": (e, t, n) => F(e, t, n, le),
+	"/": (e, t, n) => F(e, t, n, ue),
+	"^": (e, t, n) => F(e, t, n, de),
+	" ": (e, t, n, i) => B(e, t, n, r, "either"),
+	":": (e, t, n, r) => B(e, t, n, C, "start"),
+	".:.": (e, t, n, r) => {
+		let i = B(e, t, n, C, "start");
+		return e.getFunction("TRIMRANGE").execute(i, 3, 3);
+	},
+	".:": (e, t, n, r) => {
+		let i = B(e, t, n, C, "start");
+		return e.getFunction("TRIMRANGE").execute(i, 1, 1);
+	},
+	":.": (e, t, n, r) => {
+		let i = B(e, t, n, C, "start");
+		return e.getFunction("TRIMRANGE").execute(i, 2, 2);
+	},
+	"&": (e, t, n) => ((e, t, n, r) => {
+		if (t !== null && t.colStart !== void 0 && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && O.isError(t)) return t;
+		if (n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && O.isError(n)) return n;
+		if (t = P(t), n = P(n), typeof t == "string" && typeof n == "string") return r(t, n);
+		let i, a;
+		if (t?.isIRange ? i = t : n?.isIRange && (a = n), !i && !a) {
+			let i = e.getRuntime();
+			return t = T(i, t, p(t, !0), A.String, !1), n = T(i, n, p(n, !0), A.String, !1), O.isError(t) ? t : O.isError(n) ? n : r(t, n);
+		}
+		let o = !i, s = o ? t : n;
+		return (i ?? a).broadcast(s, (e, t) => e && O.isError(e) ? e : t && O.isError(t) ? t : o ? r(t, e) : r(e, t), ye);
+	})(e, t, n, fe),
+	"=": (e, t, n) => I(e, t, n, pe),
+	"<>": (e, t, n) => I(e, t, n, me),
+	">": (e, t, n) => I(e, t, n, he),
+	"<": (e, t, n) => I(e, t, n, _e),
+	">=": (e, t, n) => I(e, t, n, ge),
+	"<=": (e, t, n) => I(e, t, n, ve)
+}, Se = {
+	"+": (e, t, n) => F(e, t, n, se),
+	"-": (e, t, n) => F(e, t, n, ce)
+}, Ce = {
+	"-": (e, t) => R(e, "-", t),
+	"+": (e, t) => R(e, "+", t),
+	"@": (e, t) => {
+		if (!t || !t.isIRange) return t;
+		let n = t;
+		if (!t.isIReferenceRange) return n.getValueAt(0, 0);
+		let r = t.getCoords(), i = n.getRowCount(), a = n.getColumnCount(), o = e.getRow() - r.rowStart, s = e.getColumn() - r.colStart, c = o >= 0 && o < i, l = s >= 0 && s < a;
+		return c && l ? n.getValueAt(o, s) : c && a === 1 ? n.getValueAt(o, 0) : l && i === 1 ? n.getValueAt(0, s) : i === 1 && a === 1 ? n.getValueAt(0, 0) : O.BuiltIn.Value;
+	}
+}, we = {
+	"%": (e, t) => F(e, t, 100, ue),
+	"#": (e, t) => O.isError(t) ? z(t) : t ? (t.isIReferenceRange && (t = t.getCoords()), t.colStart === void 0 ? O.BuiltIn.Value : t.rowStart !== t.rowEnd || t.colStart !== t.colEnd ? O.BuiltIn.Ref : e.getSpillAt(t.rowStart, t.colStart, t.scope) || O.BuiltIn.Ref) : O.BuiltIn.Ref
+};
+function V(e, t) {
+	for (let n = e.length - 1; n >= 0; n--) if (e[n].type === t) return e[n];
+}
+var Te = class {
+	constructor() {
+		this.referenceIndices = [], this.rootReferences = /* @__PURE__ */ new Set(), this.cells = /* @__PURE__ */ new Map(), this.references = /* @__PURE__ */ new Map(), this.names = /* @__PURE__ */ new Map();
+	}
+	processNode(e, t) {
+		let n = e.type;
+		if (e.isReference) {
+			let t = {
+				node: e,
+				index: this.references.size,
+				op: null,
+				value: null,
+				inputs: null
+			};
+			if (this.references.set(e, t), n === h.Cell) {
+				let n = e.value;
+				n.$colIndex && (t.hasHorizontalAbs = !0), n.$rowIndex && (t.hasVerticalAbs = !0), t.value = this.cells.size, this.cells.set(e, this.cells.size), this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, this.referenceIndices.push(t.index);
+				return;
+			}
+			if (n === h.Infix || n === h.Prefix || n === h.Postfix || n === h.List) {
+				let n = e.inputs || [], r = n.length, i = e.value;
+				t.op = i;
+				let a = D(r);
+				t.inputs = a;
+				for (let e = 0; e < r; e++) {
+					let r = n[e], i = this.references.get(r);
+					i ? (i.hasHorizontalAbs && (t.hasHorizontalAbs = !0), i.hasVerticalAbs && (t.hasVerticalAbs = !0), a[e] = i.index) : a[e] = -1, i && this.rootReferences.delete(i);
+				}
+				if (this.rootReferences.add(t), et.includes(i)) {
+					let r = n[0], i = !!r && r.type === h.Cell, a = n[1], o = !!a && a.type === h.Cell;
+					i && o && a.referenceIndex !== void 0 && r.referenceIndex !== void 0 && (this.referenceIndices.splice(a.referenceIndex, 1), a.referenceIndex = r.referenceIndex, e.referenceIndex = r.referenceIndex, this.referenceIndices[r.referenceIndex] = t.index);
+				} else i === "#" && n[0] && (e.referenceIndex = n[0].referenceIndex);
+				return;
+			}
+			if (n === h.Error || n === h.Named) {
+				let r = n === h.Named ? e.value.nameId : c(e.value), i = this.names.get(r);
+				t.op = n, i === void 0 && (i = this.names.size, this.names.set(r, i)), t.value = i, this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, this.referenceIndices.push(t.index);
+				return;
+			}
+			if (n === h.TableReference) return t.op = n, this.rootReferences.add(t), e.referenceIndex = this.referenceIndices.length, void this.referenceIndices.push(t.index);
+		} else if (t && t.isReference) {
+			let t = {
+				node: e,
+				index: this.references.size,
+				op: h.Function,
+				value: e.value,
+				inputs: null
+			};
+			this.references.set(e, t);
+		}
+	}
+};
+function H(t, r = !1, i = x) {
+	let a = [], s = /* @__PURE__ */ new Set(), c = (t, n, i) => {
+		let o = {
+			type: t.type,
+			value: t.type === h.Error ? e(t.value) : t.value
+		};
+		t.image !== void 0 && (o.text = ((e) => {
+			let t = r ? e.value?.scopeImage : void 0;
+			return typeof t == "string" ? t : "";
+		})(t) + t.image);
+		let c = t.evalIndex ?? i;
+		return c !== void 0 && (o.evalIndex = c), n && (o.context = n), t.referenceIndex !== void 0 && (o.referenceIndex = t.referenceIndex), t.isReference && s.add(o), a.push(o), o;
+	}, l = (e, t, n, r, i) => {
+		if (t == null || a.length > 1 && e === h.Whitespace && a[a.length - 1].type === h.Whitespace) return;
+		let o = {
+			type: e,
+			value: t,
+			text: i ?? t
+		};
+		r !== void 0 && (o.evalIndex = r), n && (o.context = n), a.push(o);
+	};
+	(function e(t, u, d) {
+		let f = t.evalIndex ?? d ?? 0, p = t.type, m = (t, n, r) => {
+			if (!t) return;
+			let a = t.length;
+			for (let o = 0; o < a; o++) e(t[o], n, r), o < a - 1 && l(h.Separator, ",", n, r, i.separatorFunction);
+		};
+		if (t.isLiteral) {
+			if (l(h.Whitespace, t.wsBefore, u, f), p === h.Array) {
+				l(h.Type, "{", u, f);
+				let n = t.value, r = n.length;
+				for (let t = 0; t < r; t++) {
+					let a = n[t], o = a.value, s = o.length;
+					for (let t = 0; t < s; t++) {
+						let n = o[t];
+						l(h.Whitespace, n.wsBefore, u, f), e(n, u, f), l(h.Whitespace, n.wsAfter, u, f), t < s - 1 && l(h.Separator, ",", u, f, i.separatorColumn);
+					}
+					t < r - 1 && (l(h.Whitespace, a.wsBefore, u, f), l(h.Separator, ";", u, f, i.separatorRow), l(h.Whitespace, a.wsAfter, u, f));
+				}
+				t.error || l(h.Type, "}", u, f);
+			} else p === h.String && (t = {
+				type: p,
+				value: "\"" + `${t.value}`.replace(/"/g, "\"\"") + "\"",
+				image: t.image
+			}), c(t, u, f);
+			l(h.Whitespace, t.wsAfter, u, f);
+		} else if (p === h.Infix) e(t.inputs[0], u, f), l(h.Whitespace, t.wsBefore, u, f), c(t, u, f), l(h.Whitespace, t.wsAfter, u, f), e(t.inputs[1], u, f);
+		else if (p === h.Prefix) l(h.Whitespace, t.wsBefore, u, f), c(t, u, f), l(h.Whitespace, t.wsAfter, u, f), t.inputs && e(t.inputs[0], u, f);
+		else if (p === h.Postfix) {
+			t.inputs?.[0] && e(t.inputs[0], u, f), l(h.Whitespace, t.wsBefore, u, f);
+			let n = c(t, u, f), r = a[a.length - 2];
+			t.value === "#" && n.text !== void 0 && !t.wsBefore && s.has(r) && (r.text = (r.text ?? "") + n.text, n.text = ""), l(h.Whitespace, t.wsAfter, u, f);
+		} else {
+			l(h.Whitespace, t.wsBefore, u, f);
+			let d = t.inputs;
+			switch (p) {
+				case h.Function: {
+					let n = String(t.value), r = {
+						type: h.Function,
+						value: n,
+						text: t.image ?? n,
+						evalIndex: t.evalIndex
+					};
+					u && (r.context = u), a.push(r);
+					let o = {
+						name: n,
+						argIndex: -1,
+						type: t.binder?.kind ?? "function"
+					};
+					if (u?.bound && (o.bound = u.bound), l(h.Paren, "(", o, t.evalIndex), d) {
+						let n = d.length, r = t.binder?.kind, a = r === "lambda" ? 1 : r === "let" ? 2 : 0, s = o.bound;
+						for (let t = 0; t < n; t++) {
+							let c = a && t >= a ? d[t - a] : void 0;
+							if (c?.binding?.declaration) {
+								let e = c.value.nameId, n = r === "let" ? bt(d[t - 1]) : void 0;
+								s = yt(s, n ? {
+									name: e,
+									params: n
+								} : { name: e });
+							}
+							let u = {
+								...o,
+								argIndex: t
+							};
+							s && (u.bound = s), e(d[t], u, f), t < n - 1 && l(h.Separator, ",", u, f, i.separatorFunction);
+						}
+					}
+					t.error || l(h.Paren, ")", o, t.evalIndex);
+					break;
+				}
+				case h.Call: {
+					let r = o(t), s = a.length;
+					if (r && e(r, u, f), r?.type === h.Named) for (let e = s; e < a.length; e++) {
+						let n = a[e];
+						n.type !== h.Whitespace && (n.evalIndex = t.evalIndex, n.type === h.Named && (n.type = h.Function, n.value = n.value.name));
+					}
+					let c = {
+						name: r?.type === h.Named ? r.value.nameId : "",
+						argIndex: -1,
+						type: "function"
+					};
+					u?.bound && (c.bound = u.bound), l(h.Paren, "(", c, t.evalIndex);
+					let d = n(t), p = d.length;
+					for (let t = 0; t < p; t++) {
+						let n = {
+							...c,
+							argIndex: t
+						};
+						e(d[t], n, f), t < p - 1 && l(h.Separator, ",", n, f, i.separatorFunction);
+					}
+					t.error || l(h.Paren, ")", c, t.evalIndex);
+					break;
+				}
+				case h.Cell:
+					c(t, u, f);
+					break;
+				case h.Paren:
+					l(p, "(", u, f), m(d, u, f), t.error || l(p, ")", u, f);
+					break;
+				case h.TableReference: {
+					let n = t.value?.tableId ?? "", i = {
+						name: n,
+						argIndex: -1,
+						type: "table"
+					}, o = a.length, c = t.image, p, m = !1;
+					if (n && c) {
+						let e = 0;
+						if (c.charCodeAt(0) === 91) {
+							let t = c.indexOf("]");
+							t !== -1 && c.charCodeAt(t + 1) === 33 && (e = t + 2);
+						}
+						let t = c.indexOf("[", e);
+						if (m = t === 0 && d != null, t > 0) p = c.slice(0, t);
+						else if (!d) {
+							let e = c.lastIndexOf("!");
+							p = r || e === -1 ? c : c.slice(e + 1);
+						}
+					}
+					if (!n || m && r || l(h.TableReference, n, u, f, p), d && l(h.Paren, "[", i, f), d) {
+						let t = d.length;
+						for (let n = 0; n < t; n++) {
+							let r = {
+								...i,
+								argIndex: n
+							};
+							e(d[n], r, f), n < t - 1 && l(h.Separator, ",", r, f);
+						}
+					}
+					d && !t.error && l(h.Paren, "]", i, f);
+					let g = t.referenceIndex;
+					for (let e = o; e < a.length; e++) g !== void 0 && (a[e].referenceIndex = g), s.add(a[e]);
+					break;
+				}
+				case h.TableSpecifier:
+				case h.TableColumn: {
+					let e = t.image, n = e != null && e.startsWith("[") && e.endsWith("]");
+					n && l(h.Paren, "[", u, f);
+					let r = {
+						table: u?.type === "table" ? u.name : "",
+						name: t.value
+					}, i = {
+						type: p,
+						value: r,
+						text: n ? e.slice(1, -1) : e ?? r.name
+					};
+					f !== void 0 && (i.evalIndex = f), u && (i.context = u), a.push(i), n && l(h.Paren, "]", u, f);
+					break;
+				}
+				case h.List:
+					m(d, u, f);
+					break;
+				case h.Named: {
+					let e = c(t, u, f), n = t.value;
+					e.value = n.scope ? {
+						name: n.nameId,
+						scope: n.scope
+					} : { name: n.nameId }, t.binding?.declaration && t.binding.optional && (e.value.optional = !0), t.binding && (e.type = h.Parameter, t.binding.declaration && (e.value.declaration = !0)), delete e.referenceIndex;
+					break;
+				}
+				default: t.value !== void 0 && c(t, u, f), d && d.forEach((t) => e(t, u, f));
+			}
+			l(h.Whitespace, t.wsAfter, u, f);
+		}
+	})(t);
+	let u = /* @__PURE__ */ new Map();
+	for (let e of a) if (e.type === h.Cell && e.referenceIndex !== void 0) {
+		let t = u.get(e.referenceIndex);
+		t ? t.push(e) : u.set(e.referenceIndex, [e]);
+	}
+	for (let e of u.values()) e.length === 1 ? e[0].refSide = "self" : (e[0].refSide = "left", e[e.length - 1].refSide = "right");
+	let d = /* @__PURE__ */ new Map();
+	for (let e of a) if (e.referenceIndex !== void 0 && e.evalIndex !== void 0) {
+		let t = d.get(e.referenceIndex);
+		(t === void 0 || e.evalIndex < t) && d.set(e.referenceIndex, e.evalIndex);
+	}
+	if (d.size > 0) {
+		for (let e of a) if (e.referenceIndex !== void 0) {
+			let t = d.get(e.referenceIndex);
+			t !== void 0 && (e.evalIndex = t);
+		}
+	}
+	return a;
+}
+function Ee(e, t) {
+	let n = "";
+	for (let r = 0; r < e.length; r++) {
+		let a = e[r], o = a.type;
+		if (o === h.Cell || o === h.Named || o === h.Error) {
+			let e = o === h.Cell ? a.value?.scope : (h.Named, a.value?.scope ?? void 0), r = o === h.Error ? a.text !== void 0 && E(a.text) : a.text?.includes("!") ?? !1;
+			if (e && a.text !== void 0 && !r) {
+				let r = t?.resolve(i.Sheet, e)?.toString() ?? e;
+				n += f(r) + "!" + a.text;
+				continue;
+			}
+			if (o === h.Named) {
+				n += a.text ?? a.value?.name ?? "";
+				continue;
+			}
+		}
+		if (o === h.Parameter) {
+			n += a.text ?? a.value?.name ?? "";
+			continue;
+		}
+		let s = a.text ?? a.value;
+		typeof s == "string" && (n += s);
+	}
+	return n;
+}
+function De(e, t) {
+	let n;
+	if (w(e, (e) => {
+		e.evalIndex === t && (n = e);
+	}), !n) return [];
+	let r = H(n);
+	return r.length > 1 && r[0].type === h.Whitespace && r.shift(), r.length > 1 && r[r.length - 1].type === h.Whitespace && r.pop(), r;
+}
+function Oe(e) {
+	return w(e, (e) => {
+		if (e.type !== h.TableReference) return;
+		let t = function(e) {
+			if (e.value !== null && typeof e.value == "object") return e.value;
+			let t = e.value, n = e.inputs, r = !1, i = !1, a = !1, o = !1, s = null, c = null, l = !1, u = (e) => {
+				e?.type === h.TableColumn && (s = e.value, c = e.value);
+			};
+			if (n) for (let e of n) {
+				let t = e.type;
+				if (t === h.TableSpecifier) {
+					let t = e.value.toUpperCase().trim();
+					t === "#ALL" ? i = !0 : t === "#HEADERS" ? a = !0 : t === "#TOTALS" ? o = !0 : t === "#DATA" ? r = !0 : t !== "@" && t !== "#THIS ROW" || (l = !0);
+				} else if (t === h.TableColumn) u(e);
+				else if (t === h.Infix && e.value === ":") {
+					let t = e.inputs?.[0], n = e.inputs?.[1];
+					t?.type === h.TableColumn && (s = t.value), n?.type === h.TableColumn && (c = n.value);
+				} else if (t === h.Prefix && e.value === "@") {
+					l = !0;
+					let t = e.inputs?.[0];
+					t?.type === h.Infix && t.value === ":" ? (t.inputs?.[0]?.type === h.TableColumn && (s = t.inputs[0].value), t.inputs?.[1]?.type === h.TableColumn && (c = t.inputs[1].value)) : u(t);
+				}
+			}
+			return {
+				tableId: t,
+				spec: m(i, a, r, o),
+				columnFromId: s,
+				columnToId: c,
+				isThisRow: l
+			};
+		}(e);
+		return {
+			...e,
+			value: t
+		};
+	});
+}
+function ke(e) {
+	return w(e, (e) => {
+		if (e.type !== h.TableReference) return;
+		let t = e.inputs;
+		if (!t || t.findIndex((e) => e.type === h.TableSpecifier && e.value.toUpperCase().trim() === "#THIS ROW") === -1) return;
+		let n = [], r;
+		for (let e of t) (e.type !== h.TableSpecifier || e.value.toUpperCase().trim() !== "#THIS ROW") && (e.type !== h.TableColumn && (e.type !== h.Infix || e.value !== ":") || r ? n.push(e) : r = e);
+		if (!r) return n.push({
+			type: h.Prefix,
+			value: "@",
+			inputs: null,
+			isReference: !0
+		}), {
+			...e,
+			inputs: n
+		};
+		let i = r.image ?? r.value, a = i.startsWith("[") && i.endsWith("]") ? {
+			...r,
+			image: i.slice(1, -1)
+		} : r;
+		return n.push(d("@", a, !0)), {
+			...e,
+			inputs: n
+		};
+	});
+}
+function Ae(e) {
+	return w(e, (e) => {
+		if (e.type !== h.TableReference || e.inputs?.length !== 0 || e.error) return;
+		let t = e.value;
+		return (typeof t == "string" ? t : t?.tableId) ? {
+			...e,
+			inputs: null
+		} : void 0;
+	});
+}
+function je(e) {
+	return w(e, (e) => {
+		if (e.type !== h.TableReference || !e.inputs) return;
+		let t = e.value, n = typeof t == "string" ? t : t?.tableId, r = e.image;
+		if (!n || r?.charCodeAt(0) !== 91) return;
+		let i = r.indexOf("]");
+		if (i !== -1 && r.charCodeAt(i + 1) === 33) return;
+		let a = { ...e };
+		return delete a.image, a;
+	});
+}
+var Me = (e) => {
+	if (e?.type !== h.TableSpecifier) return 4;
+	switch (e.value.toUpperCase().trim()) {
+		case "#ALL": return 0;
+		case "#HEADERS": return 1;
+		case "#DATA": return 2;
+		case "#TOTALS": return 3;
+		default: return 4;
+	}
+};
+function U(e) {
+	return w(e, (e) => {
+		if (e.type !== h.TableReference) return;
+		let t = e.inputs;
+		if (!t || t.length < 2) return;
+		let n = t.map((e, t) => ({
+			input: e,
+			index: t,
+			rank: Me(e)
+		})).sort((e, t) => e.rank - t.rank || e.index - t.index).map((e) => e.input);
+		return n.every((e, n) => e === t[n]) ? void 0 : {
+			...e,
+			inputs: n
+		};
+	});
+}
+function Ne(e) {
+	if (!e) return M.EmptyArray;
+	let t = M.EmptyArray;
+	return w(e, (e) => {
+		if (e.type !== h.Named || e.binding) return;
+		let n = e.value.nameId;
+		n && (t === M.EmptyArray && (t = []), t.includes(n) || t.push(n));
+	}), t;
+}
+function Pe(e, t) {
+	if (!e) return M.EmptyArray;
+	let n = M.EmptyArray;
+	return w(e, (e, r, i) => {
+		if (!e.isReference || r?.isReference) return;
+		let a = e.type;
+		if (a === h.Named || a === h.Error || a === h.TableReference || V(i, h.TableReference)) return;
+		let o = function(e) {
+			let t = e;
+			for (; t;) {
+				if (t.referenceIndex !== void 0) return t.referenceIndex;
+				if (!t.isReference) return;
+				t = t.inputs?.[0];
+			}
+		}(e);
+		o !== void 0 && function(e, t, n) {
+			let r = e;
+			for (let e = t.length - 1; e >= 0; e--) {
+				let i = t[e];
+				if (i.type === h.Paren || i.isReference) {
+					r = i;
+					continue;
+				}
+				if (i.type !== h.Function) return !0;
+				let a = n?.(String(i.value));
+				if (!a) return !0;
+				let o = i.inputs ? i.inputs.indexOf(r) : -1;
+				return (o >= 0 ? W(a.getDeclaration().getParameters(), o) : null)?.getRangeType() !== "p";
+			}
+			return !0;
+		}(e, i, t) && (n === M.EmptyArray && (n = []), n.includes(o) || n.push(o));
+	}), n.length > 1 && n.sort((e, t) => e - t), n;
+}
+var Fe = /* @__PURE__ */ new Set(["SUBTOTAL", "AGGREGATE"]);
+function Ie(e, t) {
+	if (!e || !t) return !1;
+	let n = !1;
+	return w(e, (e) => {
+		if (n || e.type !== h.Function) return;
+		let r = t(e.value)?.getName();
+		r && Fe.has(r.toUpperCase()) && (n = !0);
+	}), n;
+}
+function Le(e, t) {
+	if (!e || !t) return !1;
+	let n = !1;
+	return w(e, (e) => {
+		n || e.type !== h.Function || !0 === t(e.value)?.getDeclaration().getReturnType()?.isVolatile() && (n = !0);
+	}), n;
+}
+var Re = Object.freeze({
+	value: !1,
+	array: !1
+}), ze = (e, t) => {
+	let n = function(e, t) {
+		if (!e || !t) return Re;
+		let n = !1, r = !1;
+		return w(e, (e) => {
+			if (n) return;
+			let i = e.type;
+			if (i === h.Named) return void (e.binding === void 0 && (n = !0));
+			if (i === h.Prefix) return void (e.value === "@" && (n = !0));
+			if (i === h.Call) return void (n = !0);
+			if (i !== h.Function || e.binder !== void 0) return;
+			let a = t(e.value);
+			if (!a) return void (n = !0);
+			if (r || !0 !== e.implicitIntersect) return;
+			let o = a.getDeclaration().getParameters(), s = e.inputs;
+			if (s) for (let e = 0; e < s.length; e++) {
+				let n = W(o, e);
+				if (n !== null && n.isValueOrRange() && K(s[e], t)) return void (r = !0);
+			}
+		}), {
+			value: !n && !r,
+			array: !n
+		};
+	}(e, t);
+	return {
+		isBlankCacheable: n.value,
+		isBlankCacheableArray: n.array
+	};
+}, Be = (e, t) => {
+	let n = e.length;
+	if (n === 0) return null;
+	if (t < n - 1) return e[t];
+	let r = e[n - 1], i = r.getRepeatingTypes();
+	return i && i.length !== 0 ? i[(t - (n - 1)) % i.length] : t < n ? e[t] : r.isRest() ? r : null;
+};
+function Ve(e) {
+	if (!e) return M.EmptyArray;
+	let t = M.EmptyArray, n = (e) => {
+		e && (t === M.EmptyArray && (t = []), t.includes(e) || t.push(e));
+	}, r = (e) => {
+		typeof e == "string" && n(s(e)?.bookId);
+	};
+	return w(e, (e) => {
+		if (e.type === h.Named) {
+			if (e.binding) return;
+			let t = e.value;
+			n(t.nameId), r(t.scope);
+		} else if (e.type === h.TableReference) {
+			let t = e.value;
+			n(typeof t == "string" ? t : t?.tableId);
+		} else if (e.type === h.Cell) {
+			let t = e.value?.scope;
+			r(t), y(t) && n(t);
+		} else e.type === h.Error && r(e.value?.scope);
+	}), t;
+}
+var He = (e, t) => {
+	if (!0 === e.lazyArg) return !0;
+	if (t?.binder?.kind !== "lambda") return !1;
+	let n = t.inputs;
+	return n[n.length - 1] === e;
+}, Ue = /* @__PURE__ */ new Set([
+	"IF",
+	"IFS",
+	"SWITCH",
+	"CHOOSE",
+	"IFERROR",
+	"IFNA"
+]), W = (e, t) => {
+	let n = e.length;
+	if (n === 0) return null;
+	if (t < n) return e[t];
+	let r = e[n - 1];
+	if (!r.isRest()) return null;
+	let i = r.getRepeatingTypes();
+	return i && i.length !== 0 ? i[(t - (n - 1)) % i.length] : r;
+}, We = (e) => e.getScalarType() !== null && e.getRangeType() === null && e.getLambda() === null && !e.isValueOrRange(), Ge = (e, t, n) => !(e.isRest() || !We(e) || !K(t, n)) && !(e.isNoLift() && G(t, n)), G = (e, t) => {
+	if (!e) return !1;
+	let n = e.inputs;
+	switch (e.type) {
+		case h.Cell:
+		case h.Named:
+		case h.TableReference: return !0;
+		case h.Infix:
+		case h.Prefix:
+		case h.Postfix: return !0 === e.isReference && e.value !== "@";
+		case h.Paren:
+		case h.List: return !!n && n.length === 1 && G(n[0], t);
+		case h.Function: {
+			if (e.binder !== void 0) return !1;
+			let r = String(e.value).toUpperCase();
+			if (Ue.has(r)) {
+				if (!n) return !1;
+				for (let e = 0; e < n.length; e++) if (G(n[e], t)) return !0;
+				return !1;
+			}
+			let i = t?.(e.value);
+			return !!i && i.getDeclaration().getReturnType().getKind() === j.Reference;
+		}
+		default: return !1;
+	}
+}, Ke = (e, t) => {
+	if (!e) return !1;
+	for (let n = 0; n < e.length; n++) if (K(e[n], t)) return !0;
+	return !1;
+};
+function K(e, t) {
+	if (!e) return !1;
+	if (e.arrayValued !== void 0) return e.arrayValued;
+	let n, r = e.type, i = e.inputs;
+	switch (r) {
+		case h.Array:
+			n = !0;
+			break;
+		case h.Cell: {
+			let t = e.value;
+			n = t.rowIndex === -(2 ** 53 - 1) || t.colIndex === -(2 ** 53 - 1);
+			break;
+		}
+		case h.Named:
+		case h.Call:
+		case h.TableReference:
+			n = !0;
+			break;
+		case h.Infix:
+		case h.Prefix:
+		case h.Postfix:
+			n = e.isReference ? e.value !== "@" : Ke(i, t);
+			break;
+		case h.Paren:
+		case h.List:
+			n = !i || i.length !== 1 || K(i[0], t);
+			break;
+		case h.Function: {
+			let r = e.binder;
+			if (r !== void 0) {
+				n = r.kind === "lambda" || !!i && K(i[i.length - 1], t);
+				break;
+			}
+			let a = String(e.value).toUpperCase();
+			if (Ue.has(a)) {
+				n = Ke(i, t);
+				break;
+			}
+			if (a === "INDEX") {
+				if (n = !1, i) for (let e = 1; e < i.length; e++) {
+					let r = i[e];
+					if (!r || r.type === h.Empty || r.isLiteral && r.value === 0 || K(r, t)) {
+						n = !0;
+						break;
+					}
+				}
+				break;
+			}
+			let o = t?.(e.value);
+			if (!o) {
+				n = !0;
+				break;
+			}
+			let s = o.getDeclaration().getReturnType(), c = s.getKind();
+			n = c === j.Array || c === j.Reference || c === null && s.getRangeType() !== null;
+			break;
+		}
+		default: n = !1;
+	}
+	return e.arrayValued = n, n;
+}
+function qe(e, t) {
+	if (e.firstCell !== void 0) return;
+	let n = (e, r) => {
+		if (!e) return;
+		e.firstCell = r;
+		let i = e.inputs;
+		if (!i) return;
+		let a = e.type;
+		if (a === h.Infix || a === h.Prefix || a === h.Postfix) {
+			let t = r && !e.isReference;
+			for (let e = 0; e < i.length; e++) n(i[e], t);
+		} else if (a === h.Paren || a === h.List) {
+			let e = r && i.length === 1;
+			for (let t = 0; t < i.length; t++) n(i[t], e);
+		} else if (a === h.Function) {
+			let a = e.binder;
+			if (a !== void 0) {
+				let e = i.length - 1;
+				for (let t = 0; t < i.length; t++) n(i[t], r && a.kind === "let" && t === e);
+				return;
+			}
+			let o = r ? t?.(e.value)?.getDeclaration().getParameters() : null;
+			for (let e = 0; e < i.length; e++) {
+				let t = o ? W(o, e) : null;
+				n(i[e], t !== null && (We(t) || Ze(t)));
+			}
+		} else for (let e = 0; e < i.length; e++) n(i[e], !1);
+	};
+	n(e, !0);
+}
+var Je = /* @__PURE__ */ new Set([
+	"=",
+	"<>",
+	"<",
+	">",
+	"<=",
+	">="
+]), Ye = /* @__PURE__ */ new Set(["ROW", "COLUMN"]);
+function Xe(e, n) {
+	if (!e || !n) return null;
+	let r = (e) => n(e.value)?.getName().toUpperCase() ?? null, i = !1;
+	if (w(e, (e) => {
+		(e.hasLazyArgs || e.type === h.Call || e.binder !== void 0) && (i = !0);
+	}), i) return null;
+	let a = (e) => e.type === h.Number, o = (e) => e.type === h.Number || e.type === h.String || e.type === h.Boolean, s = (e) => {
+		if (!e) return !1;
+		let t = e.inputs;
+		switch (e.type) {
+			case h.Paren: return t?.length === 1 && s(t[0]);
+			case h.Prefix: return (e.value === "-" || e.value === "+") && s(t?.[0]);
+			case h.Infix: {
+				if (e.value !== "+" && e.value !== "-" && e.value !== "*") return !1;
+				let [n, r] = t ?? [];
+				return !(!n || !r) && (s(n) && (s(r) || a(r)) || a(n) && s(r));
+			}
+			case h.Function: {
+				let n = r(e);
+				if (n !== null && Ye.has(n)) return !t || t.length === 0 || t.length === 1 && t[0]?.type === h.Cell;
+				if (n === "MOD" && t?.length === 2) {
+					let e = t[1];
+					return s(t[0]) && a(e) && e.value !== 0;
+				}
+				return !1;
+			}
+		}
+		return !1;
+	}, c = (e) => {
+		if (!e) return !1;
+		let t = e.inputs;
+		switch (e.type) {
+			case h.Paren: return t?.length === 1 && c(t[0]);
+			case h.Infix: {
+				if (!Je.has(e.value)) return !1;
+				let [n, r] = t ?? [];
+				return !(!n || !r) && (s(n) && (s(r) || o(r)) || o(n) && s(r));
+			}
+			case h.Function: {
+				let n = r(e);
+				if (!t || t.length === 0) return !1;
+				if (n === "ISODD" || n === "ISEVEN") return t.length === 1 && s(t[0]);
+				if (n === "NOT") return t.length === 1 && c(t[0]);
+				if (n === "AND" || n === "OR" || n === "XOR") {
+					let e = !1;
+					for (let n = 0; n < t.length; n++) {
+						let r = t[n];
+						if (!r) return !1;
+						if (r.type !== h.Boolean) {
+							if (!c(r)) return !1;
+							e = !0;
+						}
+					}
+					return e;
+				}
+				return !1;
+			}
+		}
+		return !1;
+	}, l = [], u = (e) => {
+		if (!e) return;
+		if (c(e)) return void l.push(e);
+		let t = e.inputs;
+		if (t) for (let e = 0; e < t.length; e++) u(t[e]);
+	};
+	u(e);
+	let d = l.length;
+	if (d === 0 || d > 4) return null;
+	let f = [];
+	for (let n = 0; n < 1 << d; n++) {
+		let r = (e) => {
+			let i = l.indexOf(e);
+			if (i !== -1) return t(n & 1 << i ? "TRUE" : "FALSE");
+			let a = { ...e };
+			return delete a.evalIndex, delete a.firstCell, delete a.inLazy, delete a.lazyArg, delete a.hasLazyArgs, delete a.deferred, e.inputs && (a.inputs = e.inputs.map((e) => e && r(e))), a;
+		};
+		f.push(r(e));
+	}
+	return f;
+}
+var Ze = (e) => e.getRangeType() === "*" && e.getLambda() === null && e.getArrayDepth() <= +!!e.isRest();
+function Qe(e, t, n, r = !1, i = null, a = null) {
+	let o, s, l = n;
+	l = Oe(l), r || (l = ke(l), l = U(l), l = Ae(l), l = je(l)), [o, s] = function(e) {
+		let t = /* @__PURE__ */ new Map(), n = 0, r = [e];
+		for (; r.length > 0;) {
+			let e = r.shift();
+			if (t.set(e, {
+				...e,
+				evalIndex: n++
+			}), e && e.inputs) for (let t of e.inputs) r.push(t);
+		}
+		return t.forEach((e, n) => {
+			n && n.inputs && (e.inputs = n.inputs.map((e) => t.get(e) ?? e));
+		}), [t.get(e), n];
+	}(l);
+	let u = D(s), d = [], f = [], p = new Te(), m, g = !1;
+	(function(e, t) {
+		if (!e || !t) return;
+		let n = (e) => {
+			if (!e) return;
+			e.inLazy = !0, e.type === h.Named && (e.deferredResolve = !0);
+			let t = e.inputs;
+			if (t) for (let e = 0; e < t.length; e++) n(t[e]);
+		};
+		w(e, (e) => {
+			if (e.type !== h.Function || e.binder !== void 0) return;
+			let r = e.inputs;
+			if (!r || r.length === 0) return;
+			let i = t(e.value)?.getDeclaration().getParameters();
+			if (i) for (let t = 0; t < r.length; t++) {
+				let a = r[t];
+				a && a.type !== h.Empty && Be(i, t)?.isLazy() && (a.lazyArg = !0, e.hasLazyArgs = !0, n(a));
+			}
+		});
+	})(o, a);
+	let _ = (e) => {
+		m === void 0 && (m = /* @__PURE__ */ new Map());
+		let t = m.get(e);
+		return t === void 0 && m.set(e, t = []), t;
+	}, v = (e, t) => {
+		e === void 0 ? d.push(t) : _(e).push(t);
+	}, y = (e) => {
+		e?.type !== h.Infix || e.value !== "+" && e.value !== "-" || (e.snapsCancellation = !0);
+	};
+	o = w(o, (t, n, r) => {
+		let i = t.type, a = t.evalIndex;
+		if (u[a] = null, i === h.TableColumn || i === h.TableSpecifier || t.isReference && V(r, h.TableReference)) return;
+		if (g ||= !Y(t), t.binding?.declaration) return f[t.binding.slot] = -1, void (u[a] = void 0);
+		let o = ((e, t, n) => {
+			if (He(e, t)) return e;
+			for (let e = n.length - 1; e >= 0; e--) if (He(n[e], n[e - 1])) return n[e];
+		})(t, n, r);
+		o === t && _(t), o !== void 0 && i === h.Named && (t.deferredResolve = !0);
+		let s = t.binder;
+		if (s && s.kind === "let") {
+			let e = t.inputs, n = e?.length ?? 0, r = 0;
+			for (let t = 0; t + 1 < n && r < s.slots.length; t += 2) e[t]?.binding?.declaration && (f[s.slots[r++]] = e[t + 1]?.evalIndex ?? -1);
+		}
+		if ((t.isReference || n && n.isReference) && (p.processNode(t, n), t.isReference)) {
+			if (i === h.Named) return void (o !== void 0 && v(o, t));
+			if (i === h.Cell || i === h.TableReference || i === h.Error) return;
+			if (i === h.Infix || i === h.Prefix || i === h.Postfix || i === h.List) return void v(o, t);
+		}
+		if (t.isLiteral) {
+			if (i !== h.Array) u[a] = t.value;
+			else {
+				let n = t.value, r = n.length, i = D(r);
+				for (let e = 0; e < r; e++) {
+					let t = n[e].value, r = t.length, a = D(r);
+					for (let e = 0; e < r; e++) {
+						let n = t[e], r = null;
+						if (n && (r = n.type === h.Error ? c(n.value) : n.value, n.type === h.Prefix)) {
+							let e = n.value;
+							r = n.inputs[0].value, e === "-" && (r = -r);
+						}
+						a[e] = r;
+					}
+					i[e] = a;
+				}
+				let o = te(i);
+				u[a] = new ee(e, o.values, o.coords, void 0, o.isLiteral);
+			}
+		} else {
+			if (i !== h.Empty) return t.binder?.kind === "lambda" && y(t.inputs[t.inputs.length - 1]), v(o, t), t;
+			u[a] = void 0;
+		}
+	}), y(o), m?.forEach((e, t) => {
+		t.deferred = e;
+	});
+	let b = D(p.cells.size);
+	p.cells.forEach((e, t) => {
+		let n = t.value, r = n.colIndex, i = n.rowIndex, a = n.$colIndex, o = n.$rowIndex, s = {
+			colStart: r,
+			rowStart: i,
+			colEnd: r,
+			rowEnd: i,
+			$colStart: a,
+			$rowStart: o,
+			$colEnd: a,
+			$rowEnd: o
+		};
+		r === -(2 ** 53 - 1) && (s.colEnd = 2 ** 53 - 1), i === -(2 ** 53 - 1) && (s.rowEnd = 2 ** 53 - 1), n.scope && (s.scope = n.scope), b[e] = s;
+	});
+	let S = b.length, C = D(S);
+	for (let e = 0; e < S; e++) C[e] = {
+		colStart: 0,
+		rowStart: 0,
+		colEnd: 0,
+		rowEnd: 0,
+		scope: null
+	};
+	let T = D(p.references.size);
+	p.references.forEach((e) => {
+		T[e.index] = e;
+	});
+	let E = [];
+	p.rootReferences.forEach((e) => {
+		E.push(e.index);
+	}), function(e, t, n = !1) {
+		if (n) {
+			let t = (e) => {
+				if (!e) return;
+				let n = e.type;
+				n !== h.Function && n !== h.Call || (e.implicitIntersect = !0);
+				let r = e.inputs;
+				if (r) for (let e = 0; e < r.length; e++) t(r[e]);
+			};
+			t(e);
+			return;
+		}
+		let r = (e) => K(e, t), i = (e, n) => {
+			if (!e) return;
+			let a = e.type;
+			a !== h.Function && a !== h.Call || (e.implicitIntersect = n);
+			let o = e.inputs;
+			if (o) {
+				if (a === h.Infix || a === h.Prefix || a === h.Postfix) {
+					let t = !e.isReference;
+					for (let e = 0; e < o.length; e++) i(o[e], (!t || !r(o[e])) && n);
+					return;
+				}
+				if (a === h.Function) {
+					let r = e.binder;
+					if (r !== void 0) {
+						let e = r.kind !== "lambda" && n;
+						for (let t = 0; t < o.length; t++) i(o[t], e);
+						return;
+					}
+					let a = t?.(e.value)?.getDeclaration().getParameters(), s = !1;
+					if (a) for (let e = 0; e < o.length && !s; e++) {
+						let n = o[e];
+						if (!n) continue;
+						let r = W(a, e);
+						r && Ge(r, n, t) && (s = !0);
+					}
+					s && (e.implicitIntersect = !1);
+					for (let e = 0; e < o.length; e++) i(o[e], !s && n);
+					return;
+				}
+				for (let e = 0; e < o.length; e++) i(o[e], n);
+			}
+		};
+		i(e, !r(e));
+	}(o, a, !0 === n.legacyIntersect);
+	let O = (e) => {
+		let t = e.length;
+		for (let n = 0; n < t; n++) {
+			let t = e[n], r = t.type;
+			if (r === h.Infix) {
+				if (!0 === t.snapsCancellation) {
+					t.fn = Se[t.value];
+					continue;
+				}
+				t.fn = xe[t.value];
+			} else r === h.Prefix ? t.fn = Ce[t.value] : r === h.Postfix && (t.fn = we[t.value]);
+		}
+	}, k;
+	O(d), m?.forEach(O);
+	let A = r ? ne(re(e.getLocale()).decimal) : x, j = {
+		runtime: e,
+		symbols: t,
+		getFunction: a,
+		ast: o,
+		evaluations: u,
+		executions: d,
+		bindings: f,
+		referencesAbsolute: C,
+		referencesExecute: T,
+		referencesRelative: b,
+		referencesRoot: E,
+		referenceIndices: p.referenceIndices,
+		formatReferenceIndices: Pe(o, a),
+		getTokens: () => k ??= H(o, r, A),
+		namedIds: Ne(o),
+		symbolIds: Ve(o),
+		hasTotals: Ie(o, a),
+		hasVolatile: Le(o, a),
+		...ze(o, a),
+		isReferenceOnly: !g,
+		error: i,
+		transform: (n) => {
+			let s = w(o, n);
+			return s === o ? j : Qe(e, t, s, r, i, a);
+		}
+	};
+	return j;
+}
+function $e(e) {
+	let t = -1, n = -1;
+	return Number.isSafeInteger(e.previousToken?.startLine) ? (t = e.previousToken.startLine, n = e.previousToken.endColumn + 1) : Number.isSafeInteger(e.token?.startLine) && (t = e.token.startLine, n = e.token.startColumn), t === -1 ? new O.Parse(e.message, { cause: e }) : (e.errorLocation = {
+		line: t,
+		column: n
+	}, new O.Parse(e.message, {
+		line: t,
+		column: n,
+		cause: e
+	}));
+}
+Object.freeze([
+	[
+		":",
+		".:.",
+		".:",
+		":."
+	],
+	["^"],
+	["*", "/"],
+	["+", "-"],
+	["&"],
+	[
+		"<",
+		">",
+		"=",
+		"<>",
+		"<=",
+		">="
+	]
+]);
+var et = Object.freeze([
+	":",
+	".:.",
+	".:",
+	":."
+]), q = Object.freeze([
+	":",
+	" ",
+	".:.",
+	".:",
+	":."
+]), tt = Object.freeze(["@"]), J = Object.freeze(["#"]), nt = Object.freeze(q.concat(J)), Y = (Object.freeze(q.concat(tt).concat(J)), (e) => {
+	if (!e) return !1;
+	let t = e.type;
+	if (t === h.Cell || t === h.TableReference) return !0;
+	if (t === h.Infix) {
+		if (!q.includes(e.value)) return !1;
+		let t = e.inputs, n = t[0], r = t[1];
+		return Y(n) && Y(r);
+	}
+	return t === h.List && (e.inputs?.every(Y) ?? !1);
+}), rt = (e) => !!e && (!(e.type !== h.Infix || !nt.includes(e.value)) || !(e.type !== h.Postfix || !J.includes(e.value)) || e.type === h.Array || e.type === h.TableReference), it = Object.freeze([
+	"+",
+	"-",
+	"*",
+	"/",
+	"^",
+	"&",
+	"=",
+	"<>",
+	">",
+	"<",
+	">=",
+	"<="
+]), at = Object.freeze(["-", "+"]), X = (e, t) => {
+	if (!e) return !1;
+	let n = e.type;
+	if (e.isLiteral) return n !== h.Error;
+	if (n === h.Paren || n === h.List) {
+		let n = e.inputs;
+		return !(!n || n.length === 0) && n.every((e) => X(e, t));
+	}
+	if (n === h.Infix) return it.includes(e.value);
+	if (n === h.Prefix) return at.includes(e.value);
+	if (n === h.Postfix) return e.value === "%";
+	if (n === h.Function) {
+		if (!t) return !1;
+		let n = t(e.value);
+		if (!n) return !1;
+		let r = n.getDeclaration().getReturnType(), i = r.getRangeType();
+		return i !== "p" && (i !== null || r.getLambda() === null && r.getScalarType() != null);
+	}
+	return !1;
+}, ot = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === h.Infix && e.value === " ") {
+			let r = e.inputs, i = r?.[0], a = r?.[1];
+			if (X(i, t)) return void (n = i);
+			if (X(a, t)) return void (n = a);
+		}
+		let i = e.inputs;
+		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
+	};
+	return r(e), n;
+}, st = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === h.Postfix && e.value === "#") {
+			let r = e.inputs?.[0];
+			if (r && X(r, t)) return void (n = r);
+		}
+		let i = e.inputs;
+		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
+	};
+	return r(e), n;
+}, ct = (e) => {
+	for (let t = 0; t < e.length; t++) if (e[t].getRepeatingTypes()) return t;
+	return -1;
+}, lt = (e, t, n) => {
+	let r = e[t].getRepeatingTypes(), i = r.length, a = t, o = e.length - t - 1, s = o;
+	for (; s > 0 && e[t + s].isOptional();) s--;
+	let c = +!e[t].isOptional(), l = r[i - 1].isOptional();
+	for (let e = s; e <= o; e++) {
+		let t = n - a - e;
+		if (t >= 0 && t % i === 0 && t / i >= c) return {
+			n: t / i,
+			short: !1,
+			variable: t,
+			period: i,
+			prefix: a,
+			suffix: e
+		};
+		if (l && t === i - 1) return {
+			n: 1,
+			short: !0,
+			variable: t,
+			period: i,
+			prefix: a,
+			suffix: e
+		};
+	}
+	return null;
+}, ut = (e) => {
+	if (!e) return null;
+	let t = null, n = (e) => {
+		if (t || !e) return;
+		if (e.type === h.Array && Array.isArray(e.value)) {
+			let n = e.value, r = n[0]?.value?.length ?? 0;
+			for (let e = 1; e < n.length && !t; e++) {
+				let i = n[e]?.value?.length ?? 0;
+				i !== r && (t = `Array rows must all be the same length — row ${e + 1} has ${i} value${i === 1 ? "" : "s"}, but row 1 has ${r}.`);
+			}
+		}
+		let r = e.inputs;
+		if (r) for (let e = 0; e < r.length && !t; e++) n(r[e]);
+	};
+	return n(e), t;
+}, dt = (e, t) => {
+	if (!e || !t) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === h.Function) {
+			let r = e.value, i = t(r);
+			if (i) {
+				let t = i.getDeclaration(), a = t.getParameters(), o = e.inputs?.length ?? 0, s = t.getMaxArguments();
+				if (o > s) return void (n = `Too many arguments for ${r}. The most it accepts is ${s}, but got ${o}.`);
+				let c = a.length > 0 ? ct(a) : -1, l = a.length > 0 && a[a.length - 1].isRest();
+				if (c >= 0) {
+					if (!lt(a, c, o)) {
+						let e = a[c].getRepeatingTypes().length, t = a.length - 1;
+						n = e === 1 ? `Too few arguments for ${r}. Expected at least ${t + 1}, but got ${o}.` : `Wrong number of arguments for ${r}. Expected ${t} plus a multiple of ${e}, but got ${o}.`;
+					}
+				} else if (!l && o > a.length) n = `Too many arguments for ${r}. Expected ${a.length}, but got ${o}.`;
+				else for (let e = o; e < a.length && !n; e++) {
+					let t = a[e];
+					t.isOptional() || t.isRest() || (n = `Parameter ${t.getName()} is missing for ${r}.`);
+				}
+			}
+		}
+		let i = e.inputs;
+		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
+	};
+	return r(e), n;
+}, ft = (e, t) => {
+	if (!e || !t) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === h.Function) {
+			let r = t(e.value);
+			if (r) {
+				let i = r.getDeclaration().getParameters(), a = e.inputs;
+				if (i.length > 0 && a) {
+					let e = ((e, t) => {
+						let n = Array(t), r = e.length, i = r > 0 ? ct(e) : -1;
+						if (i < 0) {
+							let i = r > 0 ? e[r - 1] : null, a = !!i && i.isRest();
+							for (let o = 0; o < t; o++) n[o] = o < r ? e[o] : a ? i : null;
+							return n;
+						}
+						let a = e[i].getRepeatingTypes(), o = a.length, s = i, c = lt(e, i, t), l = c ? c.suffix : r - i - 1, u = Math.max(0, t - s - l);
+						for (let c = 0; c < t; c++) if (c < s) n[c] = e[c];
+						else if (c < s + u) n[c] = a[(c - s) % o];
+						else {
+							let t = i + 1 + (c - s - u);
+							n[c] = t < r ? e[t] : null;
+						}
+						return n;
+					})(i, a.length);
+					for (let r = 0; r < a.length && !n; r++) {
+						let i = e[r];
+						i && i.getRangeType() === "p" && X(a[r], t) && (n = a[r]);
+					}
+				}
+			}
+		}
+		let i = e.inputs;
+		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
+	};
+	return r(e), n;
+}, pt = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === h.Call) {
+			let r = e.inputs?.[0];
+			if (r && X(r, t)) return void (n = "This expression always produces a value, so it cannot be called as a function.");
+		}
+		let i = e.inputs;
+		if (i) for (let e = 0; e < i.length && !n; e++) r(i[e]);
+	};
+	return r(e), n;
+}, Z = (e, t) => {
+	if (e.type !== h.Function) return;
+	let n = e.value;
+	if (typeof n != "string") return;
+	let r = (t?.(n)?.getName() ?? n).toUpperCase();
+	return r === "LET" ? "let" : r === "LAMBDA" ? "lambda" : void 0;
+}, Q = (e) => {
+	if (e?.type !== h.Named) return;
+	let t = e.value;
+	return t?.nameId && !t.scope && !0 !== t.optional ? t.nameId : void 0;
+}, mt = /^[A-Za-z_\\][A-Za-z0-9_\\]*$/, ht = /* @__PURE__ */ new Set(["TRUE", "FALSE"]), gt = (e) => {
+	if (e?.type === h.Named) {
+		let t = e.value;
+		return !0 !== t?.optional || !t.nameId || t.scope ? void 0 : t.nameId;
+	}
+	if (e?.type !== h.TableReference) return;
+	let t = e.value, n;
+	if (t === null || typeof t == "string") {
+		if (t) return;
+		let r = e.inputs;
+		if (!r || r.length !== 1 || r[0]?.type !== h.TableColumn) return;
+		let i = r[0].value;
+		if (typeof i != "string") return;
+		n = i;
+	} else {
+		let e = t;
+		if (!e || e.tableId !== "" || e.spec !== 0 || !0 === e.isThisRow || !e.columnFromId || e.columnFromId !== e.columnToId) return;
+		n = e.columnFromId;
+	}
+	return mt.test(n) && !ht.has(n.toUpperCase()) && e.image === `[${n}]` ? n : void 0;
+}, _t = (e) => {
+	let t = u(e.image ?? e.value);
+	t.image = e.image ?? e.value, t.wsBefore = e.wsBefore;
+	let n = {
+		type: h.Call,
+		value: null,
+		inputs: [t, ...e.inputs ?? []],
+		wsAfter: e.wsAfter
+	};
+	return e.error && (n.error = e.error), n;
+};
+function vt(e, t) {
+	return e && t ? w(e, (e) => {
+		if (e.type === h.Function && typeof e.value == "string" && !t(e.value)) return _t(e);
+	}) : e;
+}
+function yt(e, t) {
+	let n = t.name.toUpperCase(), r = e ? e.filter((e) => e.name.toUpperCase() !== n) : [];
+	return r.push(t), r;
+}
+function bt(e) {
+	if (e?.type !== h.Function || e.binder?.kind !== "lambda") return;
+	let t = e.inputs ?? [], n = [];
+	for (let e = 0; e < t.length - 1; e++) {
+		let r = t[e];
+		if (!r?.binding?.declaration) return;
+		let i = r.value.nameId;
+		n.push(r.binding.optional ? {
+			name: i,
+			optional: !0
+		} : { name: i });
+	}
+	return n;
+}
+var xt = /* @__PURE__ */ new Set([
+	"IF",
+	"IFERROR",
+	"IFNA"
+]);
+function $(e, t) {
+	if (!e || e.type !== h.Function || typeof e.value != "string") return e;
+	let n = (t?.(e.value)?.getName() ?? e.value).toUpperCase();
+	if (!xt.has(n)) return e;
+	let r = e.inputs, i;
+	if (r) for (let e = 0; e < r.length; e++) {
+		let n = $(r[e], t);
+		n !== r[e] && ((i ??= [...r])[e] = n);
+	}
+	return {
+		...e,
+		inputs: i ?? r,
+		passOmitted: !0
+	};
+}
+function St(e, t = null) {
+	if (!e) return e;
+	let n = [], r = 0, i = (e) => {
+		let t = e.inputs;
+		if (!t) return e;
+		let n;
+		for (let e = 0; e < t.length; e++) {
+			let r = t[e];
+			if (!r) continue;
+			let i = a(r);
+			i !== r && (n ||= [...t], n[e] = i);
+		}
+		return n ? {
+			...e,
+			inputs: n
+		} : e;
+	}, a = (e) => {
+		if (!e) return e;
+		let o = Z(e, t);
+		if (o) return ((e, o) => {
+			let s = e.inputs, c = s?.length ?? 0;
+			if (!s || c < 1) return i(e);
+			let l = n.length, u = [], d = [...s], f = (e, t = !1) => {
+				let i = d[e], a = Q(i), o = !1;
+				if (a === void 0 && t) {
+					if (a = gt(i), a === void 0) return;
+					o = !0;
+				} else if (a === void 0) return;
+				let s = r++;
+				n.push({
+					key: a.toUpperCase(),
+					slot: s,
+					name: a
+				}), u.push(s), d[e] = o ? {
+					...i,
+					type: h.Named,
+					value: {
+						nameId: a,
+						scope: null
+					},
+					inputs: null,
+					binding: {
+						slot: s,
+						declaration: !0,
+						optional: !0
+					},
+					isReference: !1
+				} : {
+					...i,
+					binding: {
+						slot: s,
+						declaration: !0
+					},
+					isReference: !1
+				};
+			};
+			if (o === "lambda") {
+				for (let e = 0; e < c - 1; e++) f(e, !0);
+				d[c - 1] && (d[c - 1] = a(d[c - 1]));
+			} else {
+				for (let e = 0; e + 1 < c; e += 2) d[e + 1] && (d[e + 1] = $(a(d[e + 1]), t)), f(e);
+				c % 2 == 1 && d[c - 1] && (d[c - 1] = a(d[c - 1]));
+			}
+			for (; n.length > l;) n.pop();
+			return {
+				...e,
+				inputs: d,
+				binder: {
+					kind: o,
+					slots: u
+				}
+			};
+		})(e, o);
+		if (e.type === h.Function && typeof e.value == "string") {
+			let r = e.value.toUpperCase();
+			if (n.some((e) => e.key === r) && !t?.(e.value)) return i(_t(e));
+		}
+		if (n.length > 0 && e.isReference && e.value === ":" && e.inputs?.length === 2) {
+			let [t, r] = e.inputs;
+			if (Ct(t) && Ct(r)) {
+				let a = t.image.toUpperCase(), o = r.image.toUpperCase();
+				if (n.some((e) => e.key === a || e.key === o)) return i({
+					...e,
+					inputs: [wt(t), wt(r)]
+				});
+			}
+		}
+		if (e.type === h.Named) {
+			let t = Q(e);
+			if (t !== void 0) {
+				let r = t.toUpperCase();
+				for (let i = n.length - 1; i >= 0; i--) {
+					if (n[i].key !== r) continue;
+					let a = {
+						...e,
+						binding: { slot: n[i].slot },
+						isReference: !1
+					};
+					return t !== n[i].name && (a.value = {
+						...e.value,
+						nameId: n[i].name
+					}), a;
+				}
+			}
+			return e;
+		}
+		let s = i(e);
+		if (s.type === h.Function && typeof s.value == "string" && (t?.(s.value)?.getName() ?? s.value).toUpperCase() === "ISOMITTED") {
+			let e = s.inputs;
+			if (e) {
+				let n;
+				for (let r = 0; r < e.length; r++) {
+					let i = e[r];
+					if (i?.binding && !i.binding.declaration && !0 !== i.rawFrameRead) {
+						(n ??= [...e])[r] = {
+							...i,
+							rawFrameRead: !0
+						};
+						continue;
+					}
+					let a = $(i, t);
+					a !== i && ((n ??= [...e])[r] = a);
+				}
+				if (n) return {
+					...s,
+					inputs: n
+				};
+			}
+		}
+		return s;
+	};
+	return a(e);
+}
+var Ct = (e) => {
+	if (e?.type !== h.Cell || e.image === void 0) return !1;
+	let t = e.value;
+	return t.rowIndex === -(2 ** 53 - 1) && !0 !== t.$colIndex && !t.scope;
+}, wt = (e) => {
+	let t = u(e.image);
+	return b(t, e), t;
+}, Tt = (e) => e?.type === h.Cell, Et = (e, t = null) => {
+	if (!e) return e;
+	let n = !1, r = (e) => {
+		if (n || !e) return;
+		let i = Z(e, t), a = e.inputs;
+		if (i && a) {
+			let e = i === "let" ? 2 : 1;
+			for (let t = 0; t < a.length - 1; t += e) if (Tt(a[t])) return void (n = !0);
+		}
+		if (a) for (let e = 0; e < a.length && !n; e++) r(a[e]);
+	};
+	if (r(e), !n) return e;
+	let i = null, a = w(e, (e) => {
+		if (e?.type !== h.Cell) return;
+		let t = e.value, n = e.image;
+		if (!0 === t?.$colIndex || !0 === t?.$rowIndex) return void (i ??= `'${n ?? "a reference"}' cannot be absolute here. A LET/LAMBDA name that is a cell reference makes every reference in the formula a name, and a name cannot contain '$'.`);
+		if (n === void 0) return;
+		let r = u(n);
+		b(r, e);
+		let a = t?.scope;
+		return a && (r.value.scope = a, r.value.scopeImage = t.scopeImage), r;
+	});
+	return i ?? a;
+}, Dt = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		let i = Z(e, t);
+		i && ((e, t) => {
+			let r = t === "let" ? "LET" : "LAMBDA", i = e.inputs, a = i?.length ?? 0;
+			if (!i || a < 2) return;
+			if (t === "let" && a % 2 == 0) return void (n = `Wrong number of arguments for LET. Expected name/value pairs followed by a calculation, but got ${a}.`);
+			if (t === "lambda" && i[a - 1]?.type === h.Empty) return void (n = "LAMBDA has no calculation: the last argument is empty.");
+			let o = /* @__PURE__ */ new Set(), s = t === "let" ? 2 : 1, c = !1;
+			for (let e = 0; e < a - 1; e += s) {
+				let a = Q(i[e]);
+				if (a === void 0 && t === "lambda") a = gt(i[e]), a !== void 0 && (c = !0);
+				else if (a !== void 0 && c) return void (n = `Required name '${a}' cannot follow an optional name in ${r}.`);
+				if (a === void 0) return void (n = `Expected a name in ${r} argument ${e + 1}; a name cannot be the output of a formula.`);
+				if (a.includes(".")) return void (n = `Expected a name in ${r} argument ${e + 1}; a name cannot contain '.'.`);
+				let s = a.toUpperCase();
+				if (o.has(s)) return void (n = `Duplicate name '${a}' in ${r}.`);
+				o.add(s);
+			}
+		})(e, i);
+		let a = e.inputs;
+		if (a) for (let e = 0; e < a.length && !n; e++) r(a[e]);
+	};
+	return r(e), n;
+};
+function Ot(e, t, n, r, o) {
+	let s = r, c, l = () => (c === void 0 && (c = o && n ? t.bind(i.Table, "", { at: {
+		scope: n,
+		rowIndex: o.rowIndex,
+		colIndex: o.colIndex
+	} }) : null), c);
+	return w(e, (e, r, o = []) => {
+		let c, u = e.type;
+		if (u === h.Cell) {
+			let n = e.value;
+			if (n?.scope) {
+				let r = t.bind(i.Sheet, n.scope, s);
+				r !== null && (c ||= { ...e }, c.value = {
+					...n,
+					scope: r
+				});
+			}
+		} else if (u === h.Named) {
+			let r = e.value;
+			if (r && !e.binding) {
+				let o = function(e, t, n, r) {
+					if (t.scope) {
+						let e = n.bind(i.Sheet, t.scope, r);
+						if (e === null || a(e)) return;
+					}
+					let o = n.bind(i.Table, t.nameId, { existing: !0 });
+					if (o === null) return;
+					let s = {
+						type: h.TableReference,
+						value: o,
+						inputs: null,
+						isReference: !0
+					};
+					b(s, e);
+					let c = t.scopeImage;
+					return typeof c == "string" && e.image !== void 0 && (s.image = c + e.image), s;
+				}(e, r, t, s);
+				if (o) return o;
+				let l = r.scope ? t.bind(i.Sheet, r.scope, s) : null, u = (l === null ? r.scope : a(l) ? l : t.resolve(i.Sheet, l)?.toString() ?? r.scope) ?? n, d = t.bind(i.NamedFormula, r.nameId, u ? { scope: u } : void 0);
+				d === null && l === null || (c ||= { ...e }, c.value = {
+					...r,
+					nameId: d ?? r.nameId,
+					...l === null ? void 0 : { scope: l }
+				});
+			}
+		} else if (u === h.Error) {
+			let n = e.value;
+			if (n?.scope) {
+				let r = t.bind(i.Sheet, n.scope, s);
+				r !== null && (c ||= { ...e }, c.value = {
+					...n,
+					scope: r
+				});
+			}
+		} else if (u === h.TableReference) {
+			let n = e.value;
+			if (n) {
+				let r = t.bind(i.Table, n);
+				c ||= { ...e }, r !== null && (c.value = r);
+			} else if (typeof n == "string") {
+				let n = l();
+				if (n !== null && kt(e, t)) return {
+					...e,
+					value: n
+				};
+			}
+		} else if (u === h.TableColumn) {
+			let n = e.value;
+			if (n) {
+				let r = V(o, h.TableReference), a = r?.value || (r ? l() ?? void 0 : void 0), s = t.bind(i.TableColumn, n, a ? { tableName: a } : void 0);
+				c ||= { ...e }, s !== null && (c.value = s);
+			}
+		} else if (u === h.Function) {
+			let n = e.value;
+			if (n) {
+				let r = t.bind(i.Function, n);
+				c ||= { ...e }, r !== null && (c.value = r);
+			}
+		}
+		return c;
+	});
+}
+function kt(e, t) {
+	let n = !0, r = e.inputs;
+	if (!r) return !0;
+	for (let e = 0; e < r.length && n; e++) w(r[e], (e) => {
+		e.type === h.TableColumn && t.resolve(i.TableColumn, e.value) === null && (n = !1);
+	});
+	return n;
+}
+function At(e, t) {
+	let n = null;
+	return w(e, (e) => {
+		if (n || e.type !== h.TableReference) return;
+		if (e.value === "") return void (n = "A structured reference without a table name must be in a table that has its columns.");
+		let r = e.value;
+		if (!t || typeof r != "string") return;
+		let a = t.resolve(i.Table, r)?.toString() ?? r;
+		t.bind(i.Table, a, { existing: !0 }) === null ? n = `There is no table named '${a}'.` : kt(e, t) || (n = "The table has no such column.");
+	}), n;
+}
+export { Ce as A, U as C, Ee as D, vt as E, xe as O, et as S, ke as T, rt as _, Qe as a, Xe as b, pt as c, ot as d, At as f, De as g, H as h, Ae as i, Se as j, we as k, ut as l, $e as m, yt as n, dt as o, ft as p, St as r, Dt as s, qe as t, st as u, Ot as v, Et as w, je as x, Oe as y };