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

package/browser/esm/w6Jea0TiclPrYZ2M.mjs

@@ -0,0 +1,1703 @@
+/**
+* @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 t, Fn as n, Ii as r, Ln as i, Rn as a, St as o, Xn as s, _ as c, ai as l, br as u, cr as d, di as f, f as p, gi as m, h, hr as g, mr as _, n as ee, p as te, s as v, sr as y, u as b, ur as x, ut as S, vr as ne, xn as C, xt as w, yr as re, yt as T, zn as E } from "./BudSIfXBAsTxvu-K.mjs";
+import { Qt as ie } from "./Bg5Di9GLNAkbqQ1P.mjs";
+import { FormulaError as D, Scalar as O, ScalarType as k, ValueKind as A, isLazyValue as ae } from "@sheetxl/primitives";
+import { CommonUtils as j } from "@sheetxl/utils";
+var oe = (e, t) => e + t, se = (e, t) => e - t, ce = (e, t) => S(e + t, e), le = (e, t) => S(e - t, e), ue = (e, t) => p(e * t), de = (e, t) => t === 0 ? D.BuiltIn.Div0 : p(e / t), fe = (e, t) => {
+	if (e === 0) {
+		if (t < 0) return D.BuiltIn.Div0;
+		if (t === 0) return NaN;
+	}
+	if (e < 0) {
+		if (Number.isInteger(t) && Math.abs(t) <= 4294967294) return p(e ** t);
+		let n = Number((1 / t).toPrecision(15));
+		return Number.isInteger(n) && Math.abs(n % 2) === 1 ? p(-((-e) ** t)) : NaN;
+	}
+	return p(e ** t);
+}, pe = (e = "", t = "") => {
+	e === null && (e = ""), t === null && (t = "");
+	let n = typeof t;
+	typeof e == "boolean" && (e = r(e)), n === "boolean" && (t = r(t));
+	let i = "" + e + t;
+	return i.length > O.MAX_TEXT_LENGTH ? i.slice(0, O.MAX_TEXT_LENGTH) : i;
+}, 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, ye = (e, t = null, n = null) => e.compare(t, n) <= 0, M = {
+	type: k.Number,
+	coerce: [k.Boolean, k.String],
+	onError: "value",
+	misalignValue: D.BuiltIn.NA
+}, be = {
+	type: k.String,
+	coerce: [k.Boolean, k.Number],
+	onError: "value",
+	misalignValue: D.BuiltIn.NA
+}, xe = {
+	onError: "value",
+	misalignValue: D.BuiltIn.NA
+}, N = (e) => typeof e == "object" && e && !0 === e.isIReferenceRange && e.size === 1 ? e.getValueAt(0, 0) ?? null : e, P = (e, t, n, r) => {
+	if (t !== null && t.colStart !== void 0 && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && D.isError(t)) return t;
+	if (n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && D.isError(n)) return n;
+	if (t = N(t), n = N(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 = v(i, t, c(t, !0), k.Number, !0), n = v(i, n, c(n, !0), k.Number, !0), t && D.isError(t) ? t : n && D.isError(n) ? n : r(t, n);
+	}
+	let o = !i, s = o ? t : n;
+	return (i ?? a).broadcast(s, (t, n) => t && D.isError(t) ? t : n && D.isError(n) ? n : h(o ? r(n, t) : r(t, n), e), M).fillEmpty(0);
+}, F = (e, t, n, r) => {
+	if (C(t) || C(n) || ae(t) || ae(n)) return D.BuiltIn.Value;
+	if (t !== null && t.colStart !== void 0 && (t = e.getValueAt(t.rowStart, t.colStart, t.scope)) && D.isError(t)) return t;
+	if (n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && D.isError(n)) return n;
+	let i, a;
+	t = N(t), n = N(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 && D.isError(t) ? t : n && D.isError(n) ? n : (t = I(t), n = I(n), o ? r(e, n, t) : r(e, t, n)), xe) : D.isError(t) ? t : D.isError(n) ? n : r(e, I(t), I(n));
+}, I = (e) => !0 === e?.isIRichData ? e.toPrimitive?.() ?? e : e, L = (e, t, n) => {
+	if (n ??= 0, n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && D.isError(n)) return n;
+	n = N(n);
+	let r, i = 1;
+	if (t === "+") return n;
+	if (t !== "-") throw new D.Value(`Unrecognized prefix: ${t}`);
+	if (i = -i, n?.isIRange && (r = n), !r) {
+		let t = e.getRuntime();
+		return typeof (n = v(t, n, c(n, !0), k.Number, !0)) == "number" ? n * i : D.BuiltIn.Value;
+	}
+	return r.broadcast(i, (e, t) => e && D.isError(e) ? e : t && D.isError(t) ? t : ue(e, t), M);
+}, R = (e) => e.getCode() <= D.Code.NA ? e : D.BuiltIn.Value, z = (e, t, n, r, i) => {
+	if (D.isError(t)) return R(t);
+	if (n && D.isError(n)) return R(n);
+	if (!t) return D.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 D.BuiltIn.Value;
+	let a = t.scope ? i !== "either" || n.scope ? null : t : n;
+	if (a?.scope) {
+		let t = e.getReference(a);
+		if (D.isError(t)) return t;
+		if (e.getSheetIndex() !== e.getSheetIndex(t)) return D.BuiltIn.Value;
+	}
+	let o = r(t, n);
+	return D.isError(o) ? o : o ? e.getReference(o) : D.BuiltIn.Null;
+}, Se = {
+	"+": (e, t, n) => P(e, t, n, oe),
+	"-": (e, t, n) => P(e, t, n, se),
+	"*": (e, t, n) => P(e, t, n, ue),
+	"/": (e, t, n) => P(e, t, n, de),
+	"^": (e, t, n) => P(e, t, n, fe),
+	" ": (e, t, n, r) => z(e, t, n, l, "either"),
+	":": (e, t, n, r) => z(e, t, n, m, "start"),
+	".:.": (e, t, n, r) => {
+		let i = z(e, t, n, m, "start");
+		return e.getFunction("TRIMRANGE").execute(i, 3, 3);
+	},
+	".:": (e, t, n, r) => {
+		let i = z(e, t, n, m, "start");
+		return e.getFunction("TRIMRANGE").execute(i, 1, 1);
+	},
+	":.": (e, t, n, r) => {
+		let i = z(e, t, n, m, "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)) && D.isError(t)) return t;
+		if (n !== null && n.colStart !== void 0 && (n = e.getValueAt(n.rowStart, n.colStart, n.scope)) && D.isError(n)) return n;
+		if (t = N(t), n = N(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 = v(i, t, c(t, !0), k.String, !1), n = v(i, n, c(n, !0), k.String, !1), D.isError(t) ? t : D.isError(n) ? n : r(t, n);
+		}
+		let o = !i, s = o ? t : n;
+		return (i ?? a).broadcast(s, (e, t) => e && D.isError(e) ? e : t && D.isError(t) ? t : o ? r(t, e) : r(e, t), be);
+	})(e, t, n, pe),
+	"=": (e, t, n) => F(e, t, n, me),
+	"<>": (e, t, n) => F(e, t, n, he),
+	">": (e, t, n) => F(e, t, n, ge),
+	"<": (e, t, n) => F(e, t, n, ve),
+	">=": (e, t, n) => F(e, t, n, _e),
+	"<=": (e, t, n) => F(e, t, n, ye)
+}, Ce = {
+	"+": (e, t, n) => P(e, t, n, ce),
+	"-": (e, t, n) => P(e, t, n, le)
+}, we = {
+	"-": (e, t) => L(e, "-", t),
+	"+": (e, t) => L(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) : D.BuiltIn.Value;
+	}
+}, Te = {
+	"%": (e, t) => P(e, t, 100, de),
+	"#": (e, t) => D.isError(t) ? R(t) : t ? (t.isIReferenceRange && (t = t.getCoords()), t.colStart === void 0 ? D.BuiltIn.Value : t.rowStart !== t.rowEnd || t.colStart !== t.colEnd ? D.BuiltIn.Ref : e.getSpillAt(t.rowStart, t.colStart, t.scope) || D.BuiltIn.Ref) : D.BuiltIn.Ref
+};
+function B(e, t) {
+	for (let n = e.length - 1; n >= 0; n--) if (e[n].type === t) return e[n];
+}
+var Ee = 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 === u.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 === u.Infix || n === u.Prefix || n === u.Postfix || n === u.List) {
+				let n = e.inputs || [], r = n.length, i = e.value;
+				t.op = i;
+				let a = b(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), rt.includes(i)) {
+					let r = n[0], i = !!r && r.type === u.Cell, a = n[1], o = !!a && a.type === u.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 === u.Error || n === u.Named) {
+				let r = n === u.Named ? e.value.nameId : y(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 === u.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: u.Function,
+				value: e.value,
+				inputs: null
+			};
+			this.references.set(e, t);
+		}
+	}
+};
+function V(e, t = !1, r = ne) {
+	let a = [], o = /* @__PURE__ */ new Set(), s = (e, n, r) => {
+		let i = {
+			type: e.type,
+			value: e.type === u.Error ? d(e.value) : e.value
+		};
+		e.image !== void 0 && (i.text = ((e) => {
+			let n = t ? e.value?.scopeImage : void 0;
+			return typeof n == "string" ? n : "";
+		})(e) + e.image);
+		let s = e.evalIndex ?? r;
+		return s !== void 0 && (i.evalIndex = s), n && (i.context = n), e.referenceIndex !== void 0 && (i.referenceIndex = e.referenceIndex), e.isReference && o.add(i), a.push(i), i;
+	}, c = (e, t, n, r, i) => {
+		if (t == null || a.length > 1 && e === u.Whitespace && a[a.length - 1].type === u.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(l, d, f) {
+		let p = l.evalIndex ?? f ?? 0, m = l.type, h = (t, n, i) => {
+			if (!t) return;
+			let a = t.length;
+			for (let o = 0; o < a; o++) e(t[o], n, i), o < a - 1 && c(u.Separator, ",", n, i, r.separatorFunction);
+		};
+		if (l.isLiteral) {
+			if (c(u.Whitespace, l.wsBefore, d, p), m === u.Array) {
+				c(u.Type, "{", d, p);
+				let t = l.value, n = t.length;
+				for (let i = 0; i < n; i++) {
+					let a = t[i], o = a.value, s = o.length;
+					for (let t = 0; t < s; t++) {
+						let n = o[t];
+						c(u.Whitespace, n.wsBefore, d, p), e(n, d, p), c(u.Whitespace, n.wsAfter, d, p), t < s - 1 && c(u.Separator, ",", d, p, r.separatorColumn);
+					}
+					i < n - 1 && (c(u.Whitespace, a.wsBefore, d, p), c(u.Separator, ";", d, p, r.separatorRow), c(u.Whitespace, a.wsAfter, d, p));
+				}
+				l.error || c(u.Type, "}", d, p);
+			} else m === u.String && (l = {
+				type: m,
+				value: "\"" + `${l.value}`.replace(/"/g, "\"\"") + "\"",
+				image: l.image
+			}), s(l, d, p);
+			c(u.Whitespace, l.wsAfter, d, p);
+		} else if (m === u.Infix) e(l.inputs[0], d, p), c(u.Whitespace, l.wsBefore, d, p), s(l, d, p), c(u.Whitespace, l.wsAfter, d, p), e(l.inputs[1], d, p);
+		else if (m === u.Prefix) c(u.Whitespace, l.wsBefore, d, p), s(l, d, p), c(u.Whitespace, l.wsAfter, d, p), l.inputs && e(l.inputs[0], d, p);
+		else if (m === u.Postfix) {
+			l.inputs?.[0] && e(l.inputs[0], d, p), c(u.Whitespace, l.wsBefore, d, p);
+			let t = s(l, d, p), n = a[a.length - 2];
+			l.value === "#" && t.text !== void 0 && !l.wsBefore && o.has(n) && (n.text = (n.text ?? "") + t.text, t.text = ""), c(u.Whitespace, l.wsAfter, d, p);
+		} else {
+			c(u.Whitespace, l.wsBefore, d, p);
+			let f = l.inputs;
+			switch (m) {
+				case u.Function: {
+					let t = String(l.value), n = {
+						type: u.Function,
+						value: t,
+						text: l.image ?? t,
+						evalIndex: l.evalIndex
+					};
+					d && (n.context = d), a.push(n);
+					let i = {
+						name: t,
+						argIndex: -1,
+						type: l.binder?.kind ?? "function"
+					};
+					if (d?.bound && (i.bound = d.bound), c(u.Paren, "(", i, l.evalIndex), f) {
+						let t = f.length, n = l.binder?.kind, a = n === "lambda" ? 1 : n === "let" ? 2 : 0, o = i.bound;
+						for (let s = 0; s < t; s++) {
+							let l = a && s >= a ? f[s - a] : void 0;
+							if (l?.binding?.declaration) {
+								let e = l.value.nameId, t = n === "let" ? St(f[s - 1]) : void 0;
+								o = Z(o, t ? {
+									name: e,
+									params: t
+								} : { name: e });
+							}
+							let d = {
+								...i,
+								argIndex: s
+							};
+							o && (d.bound = o), e(f[s], d, p), s < t - 1 && c(u.Separator, ",", d, p, r.separatorFunction);
+						}
+					}
+					l.error || c(u.Paren, ")", i, l.evalIndex);
+					break;
+				}
+				case u.Call: {
+					let t = i(l), o = a.length;
+					if (t && e(t, d, p), t?.type === u.Named) for (let e = o; e < a.length; e++) {
+						let t = a[e];
+						t.type !== u.Whitespace && (t.evalIndex = l.evalIndex, t.type === u.Named && (t.type = u.Function, t.value = t.value.name));
+					}
+					let s = {
+						name: t?.type === u.Named ? t.value.nameId : "",
+						argIndex: -1,
+						type: "function"
+					};
+					d?.bound && (s.bound = d.bound), c(u.Paren, "(", s, l.evalIndex);
+					let f = n(l), m = f.length;
+					for (let t = 0; t < m; t++) {
+						let n = {
+							...s,
+							argIndex: t
+						};
+						e(f[t], n, p), t < m - 1 && c(u.Separator, ",", n, p, r.separatorFunction);
+					}
+					l.error || c(u.Paren, ")", s, l.evalIndex);
+					break;
+				}
+				case u.Cell:
+					s(l, d, p);
+					break;
+				case u.Paren:
+					c(m, "(", d, p), h(f, d, p), l.error || c(m, ")", d, p);
+					break;
+				case u.TableReference: {
+					let n = l.value?.tableId ?? "", r = {
+						name: n,
+						argIndex: -1,
+						type: "table"
+					}, i = a.length, s = l.image, m, h = !1;
+					if (n && s) {
+						let e = 0;
+						if (s.charCodeAt(0) === 91) {
+							let t = s.indexOf("]");
+							t !== -1 && s.charCodeAt(t + 1) === 33 && (e = t + 2);
+						}
+						let n = s.indexOf("[", e);
+						if (h = n === 0 && f != null, n > 0) m = s.slice(0, n);
+						else if (!f) {
+							let e = s.lastIndexOf("!");
+							m = t || e === -1 ? s : s.slice(e + 1);
+						}
+					}
+					if (!n || h && t || c(u.TableReference, n, d, p, m), f && c(u.Paren, "[", r, p), f) {
+						let t = f.length;
+						for (let n = 0; n < t; n++) {
+							let i = {
+								...r,
+								argIndex: n
+							};
+							e(f[n], i, p), n < t - 1 && c(u.Separator, ",", i, p);
+						}
+					}
+					f && !l.error && c(u.Paren, "]", r, p);
+					let g = l.referenceIndex;
+					for (let e = i; e < a.length; e++) g !== void 0 && (a[e].referenceIndex = g), o.add(a[e]);
+					break;
+				}
+				case u.TableSpecifier:
+				case u.TableColumn: {
+					let e = l.image, t = e != null && e.startsWith("[") && e.endsWith("]");
+					t && c(u.Paren, "[", d, p);
+					let n = {
+						table: d?.type === "table" ? d.name : "",
+						name: l.value
+					}, r = {
+						type: m,
+						value: n,
+						text: t ? e.slice(1, -1) : e ?? n.name
+					};
+					p !== void 0 && (r.evalIndex = p), d && (r.context = d), a.push(r), t && c(u.Paren, "]", d, p);
+					break;
+				}
+				case u.List:
+					h(f, d, p);
+					break;
+				case u.Named: {
+					let e = s(l, d, p), t = l.value;
+					e.value = t.scope ? {
+						name: t.nameId,
+						scope: t.scope
+					} : { name: t.nameId }, l.binding?.declaration && l.binding.optional && (e.value.optional = !0), l.binding && (e.type = u.Parameter, l.binding.declaration && (e.value.declaration = !0)), delete e.referenceIndex;
+					break;
+				}
+				default: l.value !== void 0 && s(l, d, p), f && f.forEach((t) => e(t, d, p));
+			}
+			c(u.Whitespace, l.wsAfter, d, p);
+		}
+	})(e);
+	let l = /* @__PURE__ */ new Map();
+	for (let e of a) if (e.type === u.Cell && e.referenceIndex !== void 0) {
+		let t = l.get(e.referenceIndex);
+		t ? t.push(e) : l.set(e.referenceIndex, [e]);
+	}
+	for (let e of l.values()) e.length === 1 ? e[0].refSide = "self" : (e[0].refSide = "left", e[e.length - 1].refSide = "right");
+	let f = /* @__PURE__ */ new Map();
+	for (let e of a) if (e.referenceIndex !== void 0 && e.evalIndex !== void 0) {
+		let t = f.get(e.referenceIndex);
+		(t === void 0 || e.evalIndex < t) && f.set(e.referenceIndex, e.evalIndex);
+	}
+	if (f.size > 0) {
+		for (let e of a) if (e.referenceIndex !== void 0) {
+			let t = f.get(e.referenceIndex);
+			t !== void 0 && (e.evalIndex = t);
+		}
+	}
+	return a;
+}
+function De(e, n) {
+	let r = "";
+	for (let i = 0; i < e.length; i++) {
+		let a = e[i], o = a.type;
+		if (o === u.Cell || o === u.Named || o === u.Error) {
+			let e = o === u.Cell ? a.value?.scope : (u.Named, a.value?.scope ?? void 0), i = o === u.Error ? a.text !== void 0 && x(a.text) : a.text?.includes("!") ?? !1;
+			if (e && a.text !== void 0 && !i) {
+				let i = n?.resolve(t.Sheet, e)?.toString() ?? e;
+				r += f(i) + "!" + a.text;
+				continue;
+			}
+			if (o === u.Named) {
+				r += a.text ?? a.value?.name ?? "";
+				continue;
+			}
+		}
+		if (o === u.Parameter) {
+			r += a.text ?? a.value?.name ?? "";
+			continue;
+		}
+		let s = a.text ?? a.value;
+		typeof s == "string" && (r += s);
+	}
+	return r;
+}
+function Oe(e, t) {
+	let n;
+	if (g(e, (e) => {
+		e.evalIndex === t && (n = e);
+	}), !n) return [];
+	let r = V(n);
+	return r.length > 1 && r[0].type === u.Whitespace && r.shift(), r.length > 1 && r[r.length - 1].type === u.Whitespace && r.pop(), r;
+}
+function ke(e) {
+	return g(e, (e) => {
+		if (e.type !== u.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, d = (e) => {
+				e?.type === u.TableColumn && (s = e.value, c = e.value);
+			};
+			if (n) for (let e of n) {
+				let t = e.type;
+				if (t === u.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 === u.TableColumn) d(e);
+				else if (t === u.Infix && e.value === ":") {
+					let t = e.inputs?.[0], n = e.inputs?.[1];
+					t?.type === u.TableColumn && (s = t.value), n?.type === u.TableColumn && (c = n.value);
+				} else if (t === u.Prefix && e.value === "@") {
+					l = !0;
+					let t = e.inputs?.[0];
+					t?.type === u.Infix && t.value === ":" ? (t.inputs?.[0]?.type === u.TableColumn && (s = t.inputs[0].value), t.inputs?.[1]?.type === u.TableColumn && (c = t.inputs[1].value)) : d(t);
+				}
+			}
+			return {
+				tableId: t,
+				spec: _(i, a, r, o),
+				columnFromId: s,
+				columnToId: c,
+				isThisRow: l
+			};
+		}(e);
+		return {
+			...e,
+			value: t
+		};
+	});
+}
+function Ae(t) {
+	return g(t, (t) => {
+		if (t.type !== u.TableReference) return;
+		let n = t.inputs;
+		if (!n || n.findIndex((e) => e.type === u.TableSpecifier && e.value.toUpperCase().trim() === "#THIS ROW") === -1) return;
+		let r = [], i;
+		for (let e of n) (e.type !== u.TableSpecifier || e.value.toUpperCase().trim() !== "#THIS ROW") && (e.type !== u.TableColumn && (e.type !== u.Infix || e.value !== ":") || i ? r.push(e) : i = e);
+		if (!i) return r.push({
+			type: u.Prefix,
+			value: "@",
+			inputs: null,
+			isReference: !0
+		}), {
+			...t,
+			inputs: r
+		};
+		let a = i.image ?? i.value, o = a.startsWith("[") && a.endsWith("]") ? {
+			...i,
+			image: a.slice(1, -1)
+		} : i;
+		return r.push(e("@", o, !0)), {
+			...t,
+			inputs: r
+		};
+	});
+}
+function je(e) {
+	return g(e, (e) => {
+		if (e.type !== u.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 Me(e) {
+	return g(e, (e) => {
+		if (e.type !== u.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 Ne = (e) => {
+	if (e?.type !== u.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 Pe(e) {
+	return g(e, (e) => {
+		if (e.type !== u.TableReference) return;
+		let t = e.inputs;
+		if (!t || t.length < 2) return;
+		let n = t.map((e, t) => ({
+			input: e,
+			index: t,
+			rank: Ne(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 Fe(e) {
+	if (!e) return j.EmptyArray;
+	let t = j.EmptyArray;
+	return g(e, (e) => {
+		if (e.type !== u.Named || e.binding) return;
+		let n = e.value.nameId;
+		n && (t === j.EmptyArray && (t = []), t.includes(n) || t.push(n));
+	}), t;
+}
+function Ie(e, t) {
+	if (!e) return j.EmptyArray;
+	let n = j.EmptyArray;
+	return g(e, (e, r, i) => {
+		if (!e.isReference || r?.isReference) return;
+		let a = e.type;
+		if (a === u.Named || a === u.Error || a === u.TableReference || B(i, u.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 === u.Paren || i.isReference) {
+					r = i;
+					continue;
+				}
+				if (i.type !== u.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 ? H(a.getDeclaration().getParameters(), o) : null)?.getRangeType() !== "p";
+			}
+			return !0;
+		}(e, i, t) && (n === j.EmptyArray && (n = []), n.includes(o) || n.push(o));
+	}), n.length > 1 && n.sort((e, t) => e - t), n;
+}
+var Le = /* @__PURE__ */ new Set(["SUBTOTAL", "AGGREGATE"]);
+function Re(e, t) {
+	if (!e || !t) return !1;
+	let n = !1;
+	return g(e, (e) => {
+		if (n || e.type !== u.Function) return;
+		let r = t(e.value)?.getName();
+		r && Le.has(r.toUpperCase()) && (n = !0);
+	}), n;
+}
+function ze(e, t) {
+	if (!e || !t) return !1;
+	let n = !1;
+	return g(e, (e) => {
+		n || e.type !== u.Function || t(e.value)?.getName().toUpperCase() === "TABLE" && (n = !0);
+	}), n;
+}
+function Be(e, t) {
+	if (!e || !t) return !1;
+	let n = !1;
+	return g(e, (e) => {
+		n || e.type !== u.Function || !0 === t(e.value)?.getDeclaration().getReturnType()?.isVolatile() && (n = !0);
+	}), n;
+}
+var Ve = Object.freeze({
+	value: !1,
+	array: !1
+}), He = (e, t) => {
+	let n = function(e, t) {
+		if (!e || !t) return Ve;
+		let n = !1, r = !1;
+		return g(e, (e) => {
+			if (n) return;
+			let i = e.type;
+			if (i === u.Named) return void (e.binding === void 0 && (n = !0));
+			if (i === u.Prefix) return void (e.value === "@" && (n = !0));
+			if (i === u.Call) return void (n = !0);
+			if (i !== u.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 = H(o, e);
+				if (n !== null && n.isValueOrRange() && W(s[e], t)) return void (r = !0);
+			}
+		}), {
+			value: !n && !r,
+			array: !n
+		};
+	}(e, t);
+	return {
+		isBlankCacheable: n.value,
+		isBlankCacheableArray: n.array
+	};
+}, Ue = (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 We(e) {
+	if (!e) return j.EmptyArray;
+	let t = j.EmptyArray, n = (e) => {
+		e && (t === j.EmptyArray && (t = []), t.includes(e) || t.push(e));
+	}, r = (e) => {
+		typeof e == "string" && n(o(e)?.bookId);
+	};
+	return g(e, (e) => {
+		if (e.type === u.Named) {
+			if (e.binding) return;
+			let t = e.value;
+			n(t.nameId), r(t.scope);
+		} else if (e.type === u.TableReference) {
+			let t = e.value;
+			n(typeof t == "string" ? t : t?.tableId);
+		} else if (e.type === u.Cell) {
+			let t = e.value?.scope;
+			r(t), T(t) && n(t);
+		} else e.type === u.Error && r(e.value?.scope);
+	}), t;
+}
+var Ge = (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;
+}, Ke = /* @__PURE__ */ new Set([
+	"IF",
+	"IFS",
+	"SWITCH",
+	"CHOOSE",
+	"IFERROR",
+	"IFNA"
+]), H = (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;
+}, qe = (e) => e.getScalarType() !== null && e.getRangeType() === null && e.getLambda() === null && !e.isValueOrRange(), Je = (e, t, n) => !(e.isRest() || !qe(e) || !W(t, n)) && !(e.isNoLift() && U(t, n)), U = (e, t) => {
+	if (!e) return !1;
+	let n = e.inputs;
+	switch (e.type) {
+		case u.Cell:
+		case u.Named:
+		case u.TableReference: return !0;
+		case u.Infix:
+		case u.Prefix:
+		case u.Postfix: return !0 === e.isReference && e.value !== "@";
+		case u.Paren:
+		case u.List: return !!n && n.length === 1 && U(n[0], t);
+		case u.Function: {
+			if (e.binder !== void 0) return !1;
+			let r = String(e.value).toUpperCase();
+			if (Ke.has(r)) {
+				if (!n) return !1;
+				for (let e = 0; e < n.length; e++) if (U(n[e], t)) return !0;
+				return !1;
+			}
+			let i = t?.(e.value);
+			return !!i && i.getDeclaration().getReturnType().getKind() === A.Reference;
+		}
+		default: return !1;
+	}
+}, Ye = (e, t) => {
+	if (!e) return !1;
+	for (let n = 0; n < e.length; n++) if (W(e[n], t)) return !0;
+	return !1;
+};
+function W(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 u.Array:
+			n = !0;
+			break;
+		case u.Cell: {
+			let t = e.value;
+			n = t.rowIndex === -(2 ** 53 - 1) || t.colIndex === -(2 ** 53 - 1);
+			break;
+		}
+		case u.Named:
+		case u.Call:
+		case u.TableReference:
+			n = !0;
+			break;
+		case u.Infix:
+		case u.Prefix:
+		case u.Postfix:
+			n = e.isReference ? e.value !== "@" : Ye(i, t);
+			break;
+		case u.Paren:
+		case u.List:
+			n = !i || i.length !== 1 || W(i[0], t);
+			break;
+		case u.Function: {
+			let r = e.binder;
+			if (r !== void 0) {
+				n = r.kind === "lambda" || !!i && W(i[i.length - 1], t);
+				break;
+			}
+			let a = String(e.value).toUpperCase();
+			if (Ke.has(a)) {
+				n = Ye(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 === u.Empty || r.isLiteral && r.value === 0 || W(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 === A.Array || c === A.Reference || c === null && s.getRangeType() !== null;
+			break;
+		}
+		default: n = !1;
+	}
+	return e.arrayValued = n, n;
+}
+function Xe(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 === u.Infix || a === u.Prefix || a === u.Postfix) {
+			let t = r && !e.isReference;
+			for (let e = 0; e < i.length; e++) n(i[e], t);
+		} else if (a === u.Paren || a === u.List) {
+			let e = r && i.length === 1;
+			for (let t = 0; t < i.length; t++) n(i[t], e);
+		} else if (a === u.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 ? H(o, e) : null;
+				n(i[e], t !== null && (qe(t) || et(t)));
+			}
+		} else for (let e = 0; e < i.length; e++) n(i[e], !1);
+	};
+	n(e, !0);
+}
+var Ze = /* @__PURE__ */ new Set([
+	"=",
+	"<>",
+	"<",
+	">",
+	"<=",
+	">="
+]), Qe = /* @__PURE__ */ new Set(["ROW", "COLUMN"]);
+function $e(e, t) {
+	if (!e || !t) return null;
+	let n = (e) => t(e.value)?.getName().toUpperCase() ?? null, r = !1;
+	if (g(e, (e) => {
+		(e.hasLazyArgs || e.type === u.Call || e.binder !== void 0) && (r = !0);
+	}), r) return null;
+	let i = (e) => e.type === u.Number, a = (e) => e.type === u.Number || e.type === u.String || e.type === u.Boolean, o = (e) => {
+		if (!e) return !1;
+		let t = e.inputs;
+		switch (e.type) {
+			case u.Paren: return t?.length === 1 && o(t[0]);
+			case u.Prefix: return (e.value === "-" || e.value === "+") && o(t?.[0]);
+			case u.Infix: {
+				if (e.value !== "+" && e.value !== "-" && e.value !== "*") return !1;
+				let [n, r] = t ?? [];
+				return !(!n || !r) && (o(n) && (o(r) || i(r)) || i(n) && o(r));
+			}
+			case u.Function: {
+				let r = n(e);
+				if (r !== null && Qe.has(r)) return !t || t.length === 0 || t.length === 1 && t[0]?.type === u.Cell;
+				if (r === "MOD" && t?.length === 2) {
+					let e = t[1];
+					return o(t[0]) && i(e) && e.value !== 0;
+				}
+				return !1;
+			}
+		}
+		return !1;
+	}, s = (e) => {
+		if (!e) return !1;
+		let t = e.inputs;
+		switch (e.type) {
+			case u.Paren: return t?.length === 1 && s(t[0]);
+			case u.Infix: {
+				if (!Ze.has(e.value)) return !1;
+				let [n, r] = t ?? [];
+				return !(!n || !r) && (o(n) && (o(r) || a(r)) || a(n) && o(r));
+			}
+			case u.Function: {
+				let r = n(e);
+				if (!t || t.length === 0) return !1;
+				if (r === "ISODD" || r === "ISEVEN") return t.length === 1 && o(t[0]);
+				if (r === "NOT") return t.length === 1 && s(t[0]);
+				if (r === "AND" || r === "OR" || r === "XOR") {
+					let e = !1;
+					for (let n = 0; n < t.length; n++) {
+						let r = t[n];
+						if (!r) return !1;
+						if (r.type !== u.Boolean) {
+							if (!s(r)) return !1;
+							e = !0;
+						}
+					}
+					return e;
+				}
+				return !1;
+			}
+		}
+		return !1;
+	}, c = [], l = (e) => {
+		if (!e) return;
+		if (s(e)) return void c.push(e);
+		let t = e.inputs;
+		if (t) for (let e = 0; e < t.length; e++) l(t[e]);
+	};
+	l(e);
+	let d = c.length;
+	if (d === 0 || d > 4) return null;
+	let f = [];
+	for (let t = 0; t < 1 << d; t++) {
+		let n = (e) => {
+			let r = c.indexOf(e);
+			if (r !== -1) return E(t & 1 << r ? "TRUE" : "FALSE");
+			let i = { ...e };
+			return delete i.evalIndex, delete i.firstCell, delete i.inLazy, delete i.lazyArg, delete i.hasLazyArgs, delete i.deferred, e.inputs && (i.inputs = e.inputs.map((e) => e && n(e))), i;
+		};
+		f.push(n(e));
+	}
+	return f;
+}
+var et = (e) => e.getRangeType() === "*" && e.getLambda() === null && e.getArrayDepth() <= +!!e.isRest();
+function tt(e, t, n, r = !1, i = null, a = null) {
+	let o, s, c = n;
+	c = ke(c), r || (c = Ae(c), c = Pe(c), c = je(c), c = Me(c)), [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];
+	}(c);
+	let l = b(s), d = [], f = [], p = new Ee(), m, h = !1;
+	(function(e, t) {
+		if (!e || !t) return;
+		let n = (e) => {
+			if (!e) return;
+			e.inLazy = !0, e.type === u.Named && (e.deferredResolve = !0);
+			let t = e.inputs;
+			if (t) for (let e = 0; e < t.length; e++) n(t[e]);
+		};
+		g(e, (e) => {
+			if (e.type !== u.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 !== u.Empty && Ue(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);
+	}, x = (e) => {
+		e?.type !== u.Infix || e.value !== "+" && e.value !== "-" || (e.snapsCancellation = !0);
+	};
+	o = g(o, (t, n, r) => {
+		let i = t.type, a = t.evalIndex;
+		if (l[a] = null, i === u.TableColumn || i === u.TableSpecifier || t.isReference && B(r, u.TableReference)) return;
+		if (h ||= !q(t), t.binding?.declaration) return f[t.binding.slot] = -1, void (l[a] = void 0);
+		let o = ((e, t, n) => {
+			if (Ge(e, t)) return e;
+			for (let e = n.length - 1; e >= 0; e--) if (Ge(n[e], n[e - 1])) return n[e];
+		})(t, n, r);
+		o === t && _(t), o !== void 0 && i === u.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 === u.Named) return void (o !== void 0 && v(o, t));
+			if (i === u.Cell || i === u.TableReference || i === u.Error) return;
+			if (i === u.Infix || i === u.Prefix || i === u.Postfix || i === u.List) return void v(o, t);
+		}
+		if (t.isLiteral) {
+			if (i !== u.Array) l[a] = t.value;
+			else {
+				let n = t.value, r = n.length, i = b(r);
+				for (let e = 0; e < r; e++) {
+					let t = n[e].value, r = t.length, a = b(r);
+					for (let e = 0; e < r; e++) {
+						let n = t[e], r = null;
+						if (n && (r = n.type === u.Error ? y(n.value) : n.value, n.type === u.Prefix)) {
+							let e = n.value;
+							r = n.inputs[0].value, e === "-" && (r = -r);
+						}
+						a[e] = r;
+					}
+					i[e] = a;
+				}
+				let o = te(i);
+				l[a] = new ee(e, o.values, o.coords, void 0, o.isLiteral);
+			}
+		} else {
+			if (i !== u.Empty) return t.binder?.kind === "lambda" && x(t.inputs[t.inputs.length - 1]), v(o, t), t;
+			l[a] = void 0;
+		}
+	}), x(o), m?.forEach((e, t) => {
+		t.deferred = e;
+	});
+	let S = b(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), S[e] = s;
+	});
+	let C = S.length, w = b(C);
+	for (let e = 0; e < C; e++) w[e] = {
+		colStart: 0,
+		rowStart: 0,
+		colEnd: 0,
+		rowEnd: 0,
+		scope: null
+	};
+	let T = b(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 !== u.Function && n !== u.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) => W(e, t), i = (e, n) => {
+			if (!e) return;
+			let a = e.type;
+			a !== u.Function && a !== u.Call || (e.implicitIntersect = n);
+			let o = e.inputs;
+			if (o) {
+				if (a === u.Infix || a === u.Prefix || a === u.Postfix) {
+					let t = !e.isReference;
+					for (let e = 0; e < o.length; e++) i(o[e], (!t || !r(o[e])) && n);
+					return;
+				}
+				if (a === u.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 = H(a, e);
+						r && Je(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 D = (e) => {
+		let t = e.length;
+		for (let n = 0; n < t; n++) {
+			let t = e[n], r = t.type;
+			if (r === u.Infix) {
+				if (!0 === t.snapsCancellation) {
+					t.fn = Ce[t.value];
+					continue;
+				}
+				t.fn = Se[t.value];
+			} else r === u.Prefix ? t.fn = we[t.value] : r === u.Postfix && (t.fn = Te[t.value]);
+		}
+	}, O;
+	D(d), m?.forEach(D);
+	let k = r ? re(ie(e.getLocale()).decimal) : ne, A = {
+		runtime: e,
+		symbols: t,
+		getFunction: a,
+		ast: o,
+		evaluations: l,
+		executions: d,
+		bindings: f,
+		referencesAbsolute: w,
+		referencesExecute: T,
+		referencesRelative: S,
+		referencesRoot: E,
+		referenceIndices: p.referenceIndices,
+		formatReferenceIndices: Ie(o, a),
+		getTokens: () => O ??= V(o, r, k),
+		namedIds: Fe(o),
+		symbolIds: We(o),
+		hasTotals: Re(o, a),
+		hasDataTable: ze(o, a),
+		hasVolatile: Be(o, a),
+		...He(o, a),
+		isReferenceOnly: !h,
+		error: i,
+		transform: (n) => {
+			let s = g(o, n);
+			return s === o ? A : tt(e, t, s, r, i, a);
+		}
+	};
+	return A;
+}
+function nt(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 D.Parse(e.message, { cause: e }) : (e.errorLocation = {
+		line: t,
+		column: n
+	}, new D.Parse(e.message, {
+		line: t,
+		column: n,
+		cause: e
+	}));
+}
+Object.freeze([
+	[
+		":",
+		".:.",
+		".:",
+		":."
+	],
+	["^"],
+	["*", "/"],
+	["+", "-"],
+	["&"],
+	[
+		"<",
+		">",
+		"=",
+		"<>",
+		"<=",
+		">="
+	]
+]);
+var rt = Object.freeze([
+	":",
+	".:.",
+	".:",
+	":."
+]), G = Object.freeze([
+	":",
+	" ",
+	".:.",
+	".:",
+	":."
+]), it = Object.freeze(["@"]), K = Object.freeze(["#"]), at = Object.freeze(G.concat(K)), q = (Object.freeze(G.concat(it).concat(K)), (e) => {
+	if (!e) return !1;
+	let t = e.type;
+	if (t === u.Cell || t === u.TableReference) return !0;
+	if (t === u.Infix) {
+		if (!G.includes(e.value)) return !1;
+		let t = e.inputs, n = t[0], r = t[1];
+		return q(n) && q(r);
+	}
+	return t === u.List && (e.inputs?.every(q) ?? !1);
+}), ot = (e) => !!e && (!(e.type !== u.Infix || !at.includes(e.value)) || !(e.type !== u.Postfix || !K.includes(e.value)) || e.type === u.Array || e.type === u.TableReference), st = Object.freeze([
+	"+",
+	"-",
+	"*",
+	"/",
+	"^",
+	"&",
+	"=",
+	"<>",
+	">",
+	"<",
+	">=",
+	"<="
+]), ct = Object.freeze(["-", "+"]), J = (e, t) => {
+	if (!e) return !1;
+	let n = e.type;
+	if (e.isLiteral) return n !== u.Error;
+	if (n === u.Paren || n === u.List) {
+		let n = e.inputs;
+		return !(!n || n.length === 0) && n.every((e) => J(e, t));
+	}
+	if (n === u.Infix) return st.includes(e.value);
+	if (n === u.Prefix) return ct.includes(e.value);
+	if (n === u.Postfix) return e.value === "%";
+	if (n === u.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;
+}, lt = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === u.Infix && e.value === " ") {
+			let r = e.inputs, i = r?.[0], a = r?.[1];
+			if (J(i, t)) return void (n = i);
+			if (J(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;
+}, ut = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === u.Postfix && e.value === "#") {
+			let r = e.inputs?.[0];
+			if (r && J(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;
+}, dt = (e) => {
+	for (let t = 0; t < e.length; t++) if (e[t].getRepeatingTypes()) return t;
+	return -1;
+}, ft = (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;
+}, pt = (e) => {
+	if (!e) return null;
+	let t = null, n = (e) => {
+		if (t || !e) return;
+		if (e.type === u.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;
+}, mt = (e, t) => {
+	if (!e || !t) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === u.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 ? dt(a) : -1, l = a.length > 0 && a[a.length - 1].isRest();
+				if (c >= 0) {
+					if (!ft(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;
+}, ht = (e, t) => {
+	if (!e || !t) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === u.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 ? dt(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 = ft(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" && J(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;
+}, gt = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		if (e.type === u.Call) {
+			let r = e.inputs?.[0];
+			if (r && J(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;
+}, Y = (e, t) => {
+	if (e.type !== u.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;
+}, X = (e) => {
+	if (e?.type !== u.Named) return;
+	let t = e.value;
+	return t?.nameId && !t.scope && !0 !== t.optional ? t.nameId : void 0;
+}, _t = /^[A-Za-z_\\][A-Za-z0-9_\\]*$/, vt = /* @__PURE__ */ new Set(["TRUE", "FALSE"]), yt = (e) => {
+	if (e?.type === u.Named) {
+		let t = e.value;
+		return !0 !== t?.optional || !t.nameId || t.scope ? void 0 : t.nameId;
+	}
+	if (e?.type !== u.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 !== u.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 _t.test(n) && !vt.has(n.toUpperCase()) && e.image === `[${n}]` ? n : void 0;
+}, bt = (e) => {
+	let t = s(e.image ?? e.value);
+	t.image = e.image ?? e.value, t.wsBefore = e.wsBefore;
+	let n = {
+		type: u.Call,
+		value: null,
+		inputs: [t, ...e.inputs ?? []],
+		wsAfter: e.wsAfter
+	};
+	return e.error && (n.error = e.error), n;
+};
+function xt(e, t) {
+	return e && t ? g(e, (e) => {
+		if (e.type === u.Function && typeof e.value == "string" && !t(e.value)) return bt(e);
+	}) : e;
+}
+function Z(e, t) {
+	let n = t.name.toUpperCase(), r = e ? e.filter((e) => e.name.toUpperCase() !== n) : [];
+	return r.push(t), r;
+}
+function St(e) {
+	if (e?.type !== u.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 Ct = /* @__PURE__ */ new Set([
+	"IF",
+	"IFERROR",
+	"IFNA"
+]);
+function Q(e, t) {
+	if (!e || e.type !== u.Function || typeof e.value != "string") return e;
+	let n = (t?.(e.value)?.getName() ?? e.value).toUpperCase();
+	if (!Ct.has(n)) return e;
+	let r = e.inputs, i;
+	if (r) for (let e = 0; e < r.length; e++) {
+		let n = Q(r[e], t);
+		n !== r[e] && ((i ??= [...r])[e] = n);
+	}
+	return {
+		...e,
+		inputs: i ?? r,
+		passOmitted: !0
+	};
+}
+function wt(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 = Y(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, d = [], f = [...s], p = (e, t = !1) => {
+				let i = f[e], a = X(i), o = !1;
+				if (a === void 0 && t) {
+					if (a = yt(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
+				}), d.push(s), f[e] = o ? {
+					...i,
+					type: u.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++) p(e, !0);
+				f[c - 1] && (f[c - 1] = a(f[c - 1]));
+			} else {
+				for (let e = 0; e + 1 < c; e += 2) f[e + 1] && (f[e + 1] = Q(a(f[e + 1]), t)), p(e);
+				c % 2 == 1 && f[c - 1] && (f[c - 1] = a(f[c - 1]));
+			}
+			for (; n.length > l;) n.pop();
+			return {
+				...e,
+				inputs: f,
+				binder: {
+					kind: o,
+					slots: d
+				}
+			};
+		})(e, o);
+		if (e.type === u.Function && typeof e.value == "string") {
+			let r = e.value.toUpperCase();
+			if (n.some((e) => e.key === r) && !t?.(e.value)) return i(bt(e));
+		}
+		if (n.length > 0 && e.isReference && e.value === ":" && e.inputs?.length === 2) {
+			let [t, r] = e.inputs;
+			if (Tt(t) && Tt(r)) {
+				let a = t.image.toUpperCase(), o = r.image.toUpperCase();
+				if (n.some((e) => e.key === a || e.key === o)) return i({
+					...e,
+					inputs: [Et(t), Et(r)]
+				});
+			}
+		}
+		if (e.type === u.Named) {
+			let t = X(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 === u.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 = Q(i, t);
+					a !== i && ((n ??= [...e])[r] = a);
+				}
+				if (n) return {
+					...s,
+					inputs: n
+				};
+			}
+		}
+		return s;
+	};
+	return a(e);
+}
+var Tt = (e) => {
+	if (e?.type !== u.Cell || e.image === void 0) return !1;
+	let t = e.value;
+	return t.rowIndex === -(2 ** 53 - 1) && !0 !== t.$colIndex && !t.scope;
+}, Et = (e) => {
+	let t = s(e.image);
+	return a(t, e), t;
+}, Dt = (e) => e?.type === u.Cell, Ot = (e, t = null) => {
+	if (!e) return e;
+	let n = !1, r = (e) => {
+		if (n || !e) return;
+		let i = Y(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 (Dt(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, o = g(e, (e) => {
+		if (e?.type !== u.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 = s(n);
+		a(r, e);
+		let o = t?.scope;
+		return o && (r.value.scope = o, r.value.scopeImage = t.scopeImage), r;
+	});
+	return i ?? o;
+}, kt = (e, t) => {
+	if (!e) return null;
+	let n = null, r = (e) => {
+		if (n || !e) return;
+		let i = Y(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 === u.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 = X(i[e]);
+				if (a === void 0 && t === "lambda") a = yt(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 At(e, n, r, i, o) {
+	let s = i, c, l = () => (c === void 0 && (c = o && r ? n.bind(t.Table, "", { at: {
+		scope: r,
+		rowIndex: o.rowIndex,
+		colIndex: o.colIndex
+	} }) : null), c);
+	return g(e, (e, i, o = []) => {
+		let c, d = e.type;
+		if (d === u.Cell) {
+			let r = e.value;
+			if (r?.scope) {
+				let i = n.bind(t.Sheet, r.scope, s);
+				i !== null && (c ||= { ...e }, c.value = {
+					...r,
+					scope: i
+				});
+			}
+		} else if (d === u.Named) {
+			let i = e.value;
+			if (i && !e.binding) {
+				let o = function(e, n, r, i) {
+					if (n.scope) {
+						let e = r.bind(t.Sheet, n.scope, i);
+						if (e === null || w(e)) return;
+					}
+					let o = r.bind(t.Table, n.nameId, { existing: !0 });
+					if (o === null) return;
+					let s = {
+						type: u.TableReference,
+						value: o,
+						inputs: null,
+						isReference: !0
+					};
+					a(s, e);
+					let c = n.scopeImage;
+					return typeof c == "string" && e.image !== void 0 && (s.image = c + e.image), s;
+				}(e, i, n, s);
+				if (o) return o;
+				let l = i.scope ? n.bind(t.Sheet, i.scope, s) : null, d = (l === null ? i.scope : w(l) ? l : n.resolve(t.Sheet, l)?.toString() ?? i.scope) ?? r, f = n.bind(t.NamedFormula, i.nameId, d ? { scope: d } : void 0);
+				f === null && l === null || (c ||= { ...e }, c.value = {
+					...i,
+					nameId: f ?? i.nameId,
+					...l === null ? void 0 : { scope: l }
+				});
+			}
+		} else if (d === u.Error) {
+			let r = e.value;
+			if (r?.scope) {
+				let i = n.bind(t.Sheet, r.scope, s);
+				i !== null && (c ||= { ...e }, c.value = {
+					...r,
+					scope: i
+				});
+			}
+		} else if (d === u.TableReference) {
+			let r = e.value;
+			if (r) {
+				let i = n.bind(t.Table, r);
+				c ||= { ...e }, i !== null && (c.value = i);
+			} else if (typeof r == "string") {
+				let t = l();
+				if (t !== null && $(e, n)) return {
+					...e,
+					value: t
+				};
+			}
+		} else if (d === u.TableColumn) {
+			let r = e.value;
+			if (r) {
+				let i = B(o, u.TableReference), a = i?.value || (i ? l() ?? void 0 : void 0), s = n.bind(t.TableColumn, r, a ? { tableName: a } : void 0);
+				c ||= { ...e }, s !== null && (c.value = s);
+			}
+		} else if (d === u.Function) {
+			let r = e.value;
+			if (r) {
+				let i = n.bind(t.Function, r);
+				c ||= { ...e }, i !== null && (c.value = i);
+			}
+		}
+		return c;
+	});
+}
+function $(e, n) {
+	let r = !0, i = e.inputs;
+	if (!i) return !0;
+	for (let e = 0; e < i.length && r; e++) g(i[e], (e) => {
+		e.type === u.TableColumn && n.resolve(t.TableColumn, e.value) === null && (r = !1);
+	});
+	return r;
+}
+function jt(e, n) {
+	let r = null;
+	return g(e, (e) => {
+		if (r || e.type !== u.TableReference) return;
+		if (e.value === "") return void (r = "A structured reference without a table name must be in a table that has its columns.");
+		let i = e.value;
+		if (!n || typeof i != "string") return;
+		let a = n.resolve(t.Table, i)?.toString() ?? i;
+		n.bind(t.Table, a, { existing: !0 }) === null ? r = `There is no table named '${a}'.` : $(e, n) || (r = "The table has no such column.");
+	}), r;
+}
+export { we as A, Pe as C, De as D, xt as E, Se as O, rt as S, Ae as T, ot as _, tt as a, $e as b, gt as c, lt as d, jt as f, Oe as g, V as h, je as i, Ce as j, Te as k, pt as l, nt as m, Z as n, mt as o, ht as p, wt as r, kt as s, Xe as t, ut as u, At as v, Ot as w, Me as x, ke as y };