@sheetxl/mcp 0.8.0-beta.18 → 0.8.0-beta.19

package/assets/{CzoexWLhnn08u05j.js → CBSSZrizrucIG_9i.js}

@@ -1,18 +1,18 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.18
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.19
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: SheetXL EULA — https://www.sheetxl.com/eula
 */
-import { Q as t, St as e, Z as n, ht as r, ot as o, r as s, u as l } from "./CDqOifqA400y7KQY.js";
-import { a as i, r as a } from "./CkO0JR629W2kcDMd.js";
-import { B as c, M as d, _ as h, f as u, ht as _, sn as f, st as g } from "./CGGpkGg85FZsnYHc.js";
-import { a as p, d as m, l as S, m as w, p as E, u as I } from "./r9WSFw3a-_a5hlPm.js";
-import { Aa as y, Ai as v, An as x, At as C, Bt as b, C as A, D as R, Dr as k, E as N, Ea as M, Ei as F, F as D, G as T, Ha as G, Hr as B, Ht as V, Ii as O, In as P, It as z, Ji as L, Jr as $, Jt as H, Ka as j, Ki as K, Kt as q, La as U, Lt as W, M as X, Ma as J, Mi as Q, Mt as Y, N as Z, Nn as tt, Oi as et, Ot as nt, Pn as rt, Pr as ot, Pt as st, Qa as lt, Qn as it, Qr as at, Qt as ct, R as dt, Si as ht, Sn as ut, Ti as _t, Ua as ft, V as gt, Va as pt, Vn as mt, Vr as St, Vt as wt, Xa as Et, Xn as It, Y as yt, Ya as vt, Yn as xt, Yr as Ct, Z as bt, Zr as At, _t as Rt, a as kt, aa as Nt, ai as Mt, an as Ft, b as Dt, bn as Tt, br as Gt, c as Bt, ca as Vt, ci as Ot, dt as Pt, er as zt, et as Lt, fa as $t, fo as Ht, fr as jt, g as Kt, ga as qt, gn as Ut, hr as Wt, ht as Xt, i as Jt, ii as Qt, ir as Yt, it as Zt, ja as te, kr as ee, la as ne, li as re, ln as oe, lo as se, lr as le, lt as ie, m as ae, mo as ce, mr as de, na as he, nn as ue, no as _e, nt as fe, oi as ge, oo as pe, or as me, qi as Se, r as we, si as Ee, so as Ie, sr as ye, ta as ve, to as xe, tr as Ce, ui as be, ur as Ae, ut as Re, va as ke, vi as Ne, wt as Me, x as Fe, xi as De, xr as Te, yi as Ge, yr as Be, zi as Ve } from "./DN4zv4AjDxTsLFsA.js";
-import { C as Oe, E as Pe, O as ze, d as Le, f as $e, h as He, r as je, u as Ke, v as qe, x as Ue } from "./o9G5KuG1VkSazTvI.js";
-import { r as We } from "./Del35nO_1HyjItI0.js";
-import { _ as Xe, a as Je, c as Qe, d as Ye, f as Ze, g as tn, h as en, i as nn, l as rn, m as on, n as sn, o as ln, p as an, r as cn, s as dn, u as hn } from "./gAg9rL3U8fWUDeEb.js";
-import { c as un, i as _n, n as fn, o as gn, s as pn, t as mn } from "./B2C5njsdPylyQOCM.js";
+import { Q as t, St as e, Z as n, ht as r, ot as o, r as s, u as l } from "./B7vRFm79CUJ1VvFw.js";
+import { a as i, r as a } from "./BPctZbHQFoqJNYzC.js";
+import { B as c, M as d, _ as h, f as u, ht as _, sn as f, st as g } from "./Cgf5GQVN-D8SlQ7A.js";
+import { a as p, f as m, l as S, m as w, p as E, u as I } from "./bJ-XKvDf7IkAafUI.js";
+import { $n as y, $r as v, Aa as x, Ai as C, At as b, Bt as R, C as A, Cn as k, D as N, Dr as M, E as F, Ea as D, Ei as T, F as G, Fn as B, G as V, Ha as O, Hn as P, Hr as z, Ht as L, Ii as $, It as H, Ji as j, Jt as K, Ka as q, Ki as U, Kt as X, La as W, Ln as J, Lt as Q, M as Y, Ma as Z, Mi as tt, Mt as et, N as nt, Oi as rt, Ot as ot, Pn as st, Pr as lt, Pt as it, Qa as at, Qr as ct, Qt as dt, R as ht, Si as ut, Ti as _t, Ua as ft, Ur as gt, V as pt, Va as mt, Vr as St, Vt as wt, Xa as Et, Xn as It, Xr as yt, Y as vt, Ya as xt, Yr as Ct, Z as bt, Zn as Rt, _n as At, _t as kt, a as Nt, aa as Mt, ai as Ft, an as Dt, ar as Tt, b as Gt, br as Bt, c as Vt, ca as Ot, ci as Pt, dt as zt, et as Lt, fa as $t, fo as Ht, fr as jt, g as Kt, ga as qt, hr as Ut, ht as Xt, i as Wt, it as Jt, ja as Qt, jn as Yt, kr as Zt, la as te, li as ee, ln as ne, lo as re, lr as oe, lt as se, m as le, mo as ie, mr as ae, na as ce, nn as de, no as he, nr as ue, nt as _e, oi as fe, oo as ge, or as pe, qi as me, r as Se, si as we, so as Ee, sr as Ie, ta as ye, to as ve, tr as xe, ui as Ce, ur as be, ut as Re, va as Ae, vi as ke, wt as Ne, x as Me, xi as Fe, xn as De, xr as Te, yi as Ge, yr as Be, zi as Ve } from "./BkhdNc3LdmcyAjwk.js";
+import { c as Oe, i as Pe, n as ze, o as Le, s as $e, t as He } from "./CjrzyKFdie6KYfsG.js";
+import { C as je, E as Ke, O as qe, d as Ue, f as Xe, h as We, r as Je, u as Qe, v as Ye, x as Ze } from "./BzkTa7l_e7R--ejo.js";
+import { r as tn } from "./CNPUPTd9h7hwijpZ.js";
+import { _ as en, a as nn, c as rn, d as on, f as sn, g as ln, h as an, i as cn, l as dn, m as hn, n as un, o as _n, p as fn, r as gn, s as pn, u as mn } from "./Se9JmvmEtu4MfXJh.js";
 var Sn = class e {
 	constructor(e, n) {
 		this._grid = null, this._value = e, this._axis = n?.axis ?? t.Row, this._maxCoords = n?.maxCoords;
@@ -20,7 +20,7 @@ var Sn = class e {
 	_materialize() {
 		let t = this._grid;
 		if (!t) {
-			t = new N({
+			t = new F({
 				axis: this._axis,
 				maxCoords: this._maxCoords
 			});
@@ -76,18 +76,18 @@ var Sn = class e {
 		if (n) return n.entries(e);
 		if (e?.processRowSkip || e?.processColumnSkip) return this._materialize().entries(e);
 		const r = this._value;
-		if (null == r) return mt;
+		if (null == r) return P;
 		const o = e?.bounds;
-		if (o && ((o.colStart ?? 0) > 0 || (o.rowStart ?? 0) > 0 || (o.colEnd ?? 0) < 0 || (o.rowEnd ?? 0) < 0)) return mt;
+		if (o && ((o.colStart ?? 0) > 0 || (o.rowStart ?? 0) > 0 || (o.colEnd ?? 0) < 0 || (o.rowEnd ?? 0) < 0)) return P;
 		const s = e?.axis ? e.axis === t.Column : this._axis === t.Column, l = e ? Be(e.reuseResult) : void 0, i = this;
 		let a = !1, c = null;
 		return {
-			next: (t) => c ? c.next(t) : t ? (c = i._materialize().entries(e), c.next(t)) : a ? Zt : (a = !0, Jt(0, 0, r, s, l)),
+			next: (t) => c ? c.next(t) : t ? (c = i._materialize().entries(e), c.next(t)) : a ? Jt : (a = !0, Wt(0, 0, r, s, l)),
 			[Symbol.iterator]() {
 				return this;
 			},
-			return: (t) => Zt,
-			throw: (t) => Zt
+			return: (t) => Jt,
+			throw: (t) => Jt
 		};
 	}
 	keys(t) {
@@ -243,7 +243,7 @@ var Sn = class e {
 	_getOrCreate2D(t) {
 		if (!t) throw new Error(In);
 		let e = this._mapScopeTo2Ds.get(t);
-		return e || (e = new et(this._options2D), this._mapScopeTo2Ds.set(t, e), this._last2DKey = t, this._last2DMap = e), e;
+		return e || (e = new rt(this._options2D), this._mapScopeTo2Ds.set(t, e), this._last2DKey = t, this._last2DMap = e), e;
 	}
 	_cleanupEmpty2D(t, e) {
 		e?.isEmpty() && (this._mapScopeTo2Ds.delete(t), this._last2DKey === t && (this._last2DKey = void 0, this._last2DMap = void 0));
@@ -263,7 +263,7 @@ var Sn = class e {
 		return n.isLambdaCallable = !0, n.checkArity = (n) => n >= e && n <= t.length, n.paramCount = t.length, n;
 	}
 	_function() {
-		return this._asFunction ??= J(this);
+		return this._asFunction ??= Z(this);
 	}
 	execute(...t) {
 		return this._function().execute(...t);
@@ -301,8 +301,8 @@ var Sn = class e {
 			try {
 				return t.execute(...e);
 			} catch (t) {
-				if (U(t)) throw t;
-				return m.isError(t) ? t : new m.Value(t?.message, { cause: t });
+				if (W(t)) throw t;
+				return I.isError(t) ? t : new I.Value(t?.message, { cause: t });
 			}
 		};
 		return e.isLambdaCallable = !0, e.checkArity = () => !0, e.paramCount = -1, e;
@@ -341,18 +341,18 @@ var Sn = class e {
 	getTextAt(t, e, n = !1, r, o) {
 		const s = "display" === o, l = this._compiled;
 		if (l.error && !l.ast) return l.error.input;
-		let i = void 0 !== r ? Ue(l.ast, r) : l.getTokens();
-		i = Nt(i, l.symbols, !s, s, s ? {
+		let i = void 0 !== r ? Ze(l.ast, r) : l.getTokens();
+		i = Mt(i, l.symbols, !s, s, s ? {
 			scope: this._gridId,
 			rowIndex: t,
 			colIndex: e
 		} : null);
-		const a = s ? this._displayLocale() : Tt;
+		const a = s ? this._displayLocale() : De;
 		return n ? Et(i, this._getEntireCoords?.(), a) : Te(i, this._getEntireCoords?.(), t, e, a);
 	}
 	_displayLocale() {
 		const t = this._context.getRuntime().getLocaleProfile();
-		return j(Ut(t.decimal));
+		return q(At(t.decimal));
 	}
 	getRecord() {
 		const t = this._record;
@@ -365,7 +365,7 @@ var Sn = class e {
 				input: n.input,
 				message: String(t?.message ?? ""),
 				unparsed: !e.ast,
-				details: t instanceof m.Parse ? t.getDetails() : void 0
+				details: t instanceof I.Parse ? t.getDetails() : void 0
 			};
 		}
 		const o = {
@@ -396,19 +396,19 @@ var Sn = class e {
 					$rowEnd: e.$rowEnd,
 					scope: t.scope
 				};
-			} else n.node.type === ut.Cell ? i = { ...o[n.value] } : n.op === ut.Named ? i = { nameId: n.node.value.nameId } : n.op === ut.TableReference && (i = { table: { ...n.node.value } });
+			} else n.node.type === k.Cell ? i = { ...o[n.value] } : n.op === k.Named ? i = { nameId: n.node.value.nameId } : n.op === k.TableReference && (i = { table: { ...n.node.value } });
 			s[t] = i;
 		}
 		return s;
 	}
 	getNode() {
 		const t = this._compiled;
-		return t.ast ? We(t.ast, t.symbols) : null;
+		return t.ast ? tn(t.ast, t.symbols) : null;
 	}
 	getTokensAt(t, e, n) {
 		const r = this._compiled;
-		let o = void 0 !== n ? Ue(r.ast, n) : r.getTokens();
-		return o = Nt(o, r.symbols, !1, !0), ae(o, t, e);
+		let o = void 0 !== n ? Ze(r.ast, n) : r.getTokens();
+		return o = Mt(o, r.symbols, !1, !0), le(o, t, e);
 	}
 	getError() {
 		return this._compiled.error ?? null;
@@ -437,17 +437,17 @@ var Sn = class e {
 	}
 	demandFirstCell() {
 		const t = this._compiled;
-		t?.ast && Le(t.ast, t.getFunction);
+		t?.ast && Ue(t.ast, t.getFunction);
 	}
 	getPositionVariants() {
 		let e = this._positionVariants;
 		if (void 0 !== e) return e;
 		e = null;
-		const n = this._compiled, r = n && !n.error && n.ast ? je(n.ast, n.getFunction) : null;
+		const n = this._compiled, r = n && !n.error && n.ast ? Je(n.ast, n.getFunction) : null;
 		if (r) {
 			const o = void 0 !== n.ast.firstCell;
 			e = r.map((e) => {
-				const r = new t(Pe(n.runtime, n.symbols, e, !1, null, n.getFunction), this._context, this._calcScope, this._gridId, this._getEntireCoords, this._resolvers);
+				const r = new t(Ke(n.runtime, n.symbols, e, !1, null, n.getFunction), this._context, this._calcScope, this._gridId, this._getEntireCoords, this._resolvers);
 				return o && r.demandFirstCell(), r;
 			});
 		}
@@ -467,7 +467,7 @@ var Sn = class e {
 	getReferences(t, e) {
 		const n = this._compiled, o = n.referenceIndices, s = o.length;
 		if (0 === s) return r.EmptyArray;
-		const l = n.referencesExecute, i = n.referencesRelative, a = st(s);
+		const l = n.referencesExecute, i = n.referencesRelative, a = it(s);
 		for (let n = 0; n < s; n++) {
 			const r = l[o[n]], s = r.inputs;
 			if (s && 2 === s.length) {
@@ -483,26 +483,26 @@ var Sn = class e {
 					$rowEnd: e.$rowEnd,
 					scope: t.scope
 				};
-			} else if (r.node.type === ut.Cell) {
+			} else if (r.node.type === k.Cell) {
 				const t = i[r.value];
 				a[n] = { ...t };
-			} else if (r.op === ut.Named) {
-				const t = r.node.value.nameId, e = this._compiled.symbols?.resolve(ue.NamedFormula, t)?.toString() ?? t;
+			} else if (r.op === k.Named) {
+				const t = r.node.value.nameId, e = this._compiled.symbols?.resolve(de.NamedFormula, t)?.toString() ?? t;
 				a[n] = { nameId: e };
-			} else if (r.op === ut.TableReference) {
+			} else if (r.op === k.TableReference) {
 				const o = r.node.value;
 				let s = this._resolveStructuredRef(o, t, e);
-				!s || m.isError(s) ? a[n] = null : a[n] = {
+				!s || I.isError(s) ? a[n] = null : a[n] = {
 					...s,
 					tableId: o.tableId
 				};
-			} else r.op === ut.Error && (a[n] = null);
+			} else r.op === k.Error && (a[n] = null);
 		}
 		return a;
 	}
 	getReferencesAt(t, e) {
 		const n = this.getReferences(t, e);
-		return 0 === n.length ? r.EmptyArray : at(n, t, e);
+		return 0 === n.length ? r.EmptyArray : v(n, t, e);
 	}
 	getFormatReferences() {
 		const t = this._formatReferences;
@@ -532,37 +532,37 @@ var Sn = class e {
 		e < 0 && (e = i.length + e);
 		const c = i[e];
 		if (void 0 === c) throw new Error(`Invalid reference index: ${e}`);
-		const d = a[c], h = d.node, u = h.inputs ?? r.EmptyArray, _ = d.op === ut.Named, f = 2 === u.length;
-		let g, p, S = !1;
-		n && m.isError(n) && (n = null), n && "nameId" in n && !_ && (n = null);
-		const w = n && "nameId" in n ? null : n, E = !!w && void 0 !== w.colIndex;
-		if (w) if (E) {
-			const t = w;
+		const d = a[c], h = d.node, u = h.inputs ?? r.EmptyArray, _ = d.op === k.Named, f = 2 === u.length;
+		let g, p, m = !1;
+		n && I.isError(n) && (n = null), n && "nameId" in n && !_ && (n = null);
+		const S = n && "nameId" in n ? null : n, w = !!S && void 0 !== S.colIndex;
+		if (S) if (w) {
+			const t = S;
 			g = {
 				colIndex: t.colIndex,
 				rowIndex: t.rowIndex,
 				$colIndex: t.$colIndex ?? !1,
 				$rowIndex: t.$rowIndex ?? !1
-			}, t.scope && (g.scope = t.scope), S = !1;
+			}, t.scope && (g.scope = t.scope), m = !1;
 		} else {
-			const t = w;
+			const t = S;
 			g = {
 				colIndex: t.colStart,
 				rowIndex: t.rowStart,
 				$colIndex: t.$colStart ?? !1,
 				$rowIndex: t.$rowStart ?? !1
-			}, t.scope && (g.scope = t.scope), S = f || !o.isSingleCell(t), S && (p = {
+			}, t.scope && (g.scope = t.scope), m = f || !o.isSingleCell(t), m && (p = {
 				colIndex: t.colEnd,
 				rowIndex: t.rowEnd,
 				$colIndex: t.$colEnd ?? !1,
 				$rowIndex: t.$rowEnd ?? !1
 			}, t.colEnd === Number.MAX_SAFE_INTEGER && (p.colIndex = Number.MIN_SAFE_INTEGER), t.rowEnd === Number.MAX_SAFE_INTEGER && (p.rowIndex = Number.MIN_SAFE_INTEGER));
 		}
-		const I = E && f;
+		const E = w && f;
 		let y = -1, v = -1, x = -1, C = -1;
 		if (f) y = u[0].evalIndex, v = u[1].evalIndex;
 		else if ("cell" === h.type) y = h.evalIndex;
-		else if (d.op === ut.TableReference) x = h.evalIndex;
+		else if (d.op === k.TableReference) x = h.evalIndex;
 		else {
 			if (!_) throw new Error(`Invalidate reference index: ${e}`);
 			C = h.evalIndex;
@@ -572,55 +572,55 @@ var Sn = class e {
 			const e = this._compiled.symbols;
 			for (let n = 0; n < t.length; n++) {
 				const r = (t[n]?.value)?.scope;
-				if (r) return e && !e.resolve(ue.Sheet, r) ? null : r;
+				if (r) return e && !e.resolve(de.Sheet, r) ? null : r;
 			}
 			return null;
-		}, A = h, R = this._compiled.ast, k = Ee(R, (t) => {
+		}, R = h, A = this._compiled.ast, N = we(A, (t) => {
 			if (!t || !t.isReference) return;
-			if (I && t === A) return xe(g);
+			if (E && t === R) return ve(g);
 			const e = t.type;
-			if (-1 !== C && t.evalIndex === C && e === ut.Named) {
-				if (!n) return ee();
+			if (-1 !== C && t.evalIndex === C && e === k.Named) {
+				if (!n) return Zt();
 				if (n && "nameId" in n) {
-					const e = n, r = this._compiled.symbols?.bind(ue.NamedFormula, e.nameId) ?? e.nameId, o = { ...t };
+					const e = n, r = this._compiled.symbols?.bind(de.NamedFormula, e.nameId) ?? e.nameId, o = { ...t };
 					return o.value = {
 						...t.value,
 						...e,
 						nameId: r
 					}, o;
 				}
-				return S ? me(":", xe(g), xe(p), !0) : xe(g);
+				return m ? pe(":", ve(g), ve(p), !0) : ve(g);
 			}
-			if (-1 !== x && t.evalIndex === x && e === ut.TableReference) return n ? S ? me(":", xe(g), xe(p), !0) : xe(g) : ee();
-			if (!n && Ke.includes(t.value)) {
+			if (-1 !== x && t.evalIndex === x && e === k.TableReference) return n ? m ? pe(":", ve(g), ve(p), !0) : ve(g) : Zt();
+			if (!n && Qe.includes(t.value)) {
 				const e = t.inputs ?? r.EmptyArray, n = e[0], o = e[1];
 				let s = n.evalIndex === y, l = o.evalIndex === v;
 				if (s || l) {
-					const e = ee(void 0, void 0, b(n, o));
+					const e = Zt(void 0, void 0, b(n, o));
 					return e.evalIndex = t.evalIndex, e;
 				}
 			}
 			if ("cell" !== e && "error" !== e) return;
 			const o = t.evalIndex;
 			let s, l = o === y;
-			if ((l || o === v) && !I) {
-				if (n) if (f === S) {
+			if ((l || o === v) && !E) {
+				if (n) if (f === m) {
 					let e = l ? g : p;
 					s = { ...t }, s.value = e, s.image = null;
-				} else s = me(":", xe(g), xe(p), !0);
-				else s = ee(void 0, void 0, b(t)), s.evalIndex = t.evalIndex;
+				} else s = pe(":", ve(g), ve(p), !0);
+				else s = Zt(void 0, void 0, b(t)), s.evalIndex = t.evalIndex;
 				return s;
 			}
 		});
-		if (k === R) return this;
-		const N = Pe(l.runtime, l.symbols, k, !1, l.error, l.getFunction);
-		return new t(N, this._context, this._calcScope, this._gridId, this._getEntireCoords, this._resolvers);
+		if (N === A) return this;
+		const M = Ke(l.runtime, l.symbols, N, !1, l.error, l.getFunction);
+		return new t(M, this._context, this._calcScope, this._gridId, this._getEntireCoords, this._resolvers);
 	}
 	reanchorReferences(e, n) {
-		const r = this._compiled, o = this._gridId, s = this._compiled.symbols.bind(ue.Sheet, e), l = r.transform((t, e) => {
+		const r = this._compiled, o = this._gridId, s = this._compiled.symbols.bind(de.Sheet, e), l = r.transform((t, e) => {
 			if (!t || !t.isReference) return;
-			if (t.type !== ut.Cell) return;
-			if (Oe(e) && e.inputs?.[0] !== t) return;
+			if (t.type !== k.Cell) return;
+			if (je(e) && e.inputs?.[0] !== t) return;
 			let r;
 			const l = t.value.scope;
 			return (!l || n && l === o) && (r = { ...t }, r.value = { ...r.value }, r.value.scope = s), r;
@@ -631,8 +631,8 @@ var Sn = class e {
 		if (e === n) return this;
 		const r = this._compiled, o = r.transform((t, r) => {
 			if (!t || !t.isReference) return;
-			if (t.type !== ut.Cell) return;
-			if (Oe(r) && r.inputs?.[0] !== t) return;
+			if (t.type !== k.Cell) return;
+			if (je(r) && r.inputs?.[0] !== t) return;
 			if (t.value.scope !== e) return;
 			const o = { ...t };
 			return o.value = { ...o.value }, o.value.scope = n, o;
@@ -641,7 +641,7 @@ var Sn = class e {
 	}
 	replaceTableReferences(e, n) {
 		const r = this._compiled, o = r.transform((t) => {
-			if (t?.type !== ut.TableReference) return;
+			if (t?.type !== k.TableReference) return;
 			const r = t.value;
 			if ("object" != typeof r || r?.tableId !== e) return;
 			const o = n(r);
@@ -651,11 +651,11 @@ var Sn = class e {
 	}
 	_evaluateNamed(t, e, n) {
 		const r = t.nameId, o = this._calcScope;
-		if (o.activeNames.has(r)) return m.BuiltIn.Ref;
+		if (o.activeNames.has(r)) return I.BuiltIn.Ref;
 		const s = this._resolvers?.getNamedFormulaBlock?.(r);
 		if (!s) {
-			const t = this._compiled, e = t.symbols?.resolve(ue.NamedFormula, r), n = e ? e.toString() : r, o = t.getFunction?.(n) ?? null;
-			return o ? new vn(o) : m.BuiltIn.Name;
+			const t = this._compiled, e = t.symbols?.resolve(de.NamedFormula, r), n = e ? e.toString() : r, o = t.getFunction?.(n) ?? null;
+			return o ? new vn(o) : I.BuiltIn.Name;
 		}
 		const l = o.gridId, i = o.rowIndex, a = o.colIndex;
 		o.activeNames.add(r), o.depth++;
@@ -669,7 +669,7 @@ var Sn = class e {
 		const o = t.nameId, s = this._calcScope;
 		if (s.activeNames.has(o)) return r.EmptyArray;
 		const l = this._resolvers?.getNamedFormulaBlock?.(o);
-		if (!l) return m.BuiltIn.Name;
+		if (!l) return I.BuiltIn.Name;
 		s.activeNames.add(o);
 		try {
 			return l.resolvedPrecedentsAt(e, n);
@@ -679,7 +679,7 @@ var Sn = class e {
 	}
 	_resolveStructuredRef(t, e, n, r) {
 		const o = this._resolvers?.getStructureReferenceCoords;
-		return o ? o(t, e, n, this._gridId) : m.BuiltIn.Name;
+		return o ? o(t, e, n, this._gridId) : I.BuiltIn.Name;
 	}
 	resolvedPrecedentsAt(t, e, n = !1, o, s) {
 		const l = this._compiled, i = l.referencesRoot, a = i.length;
@@ -694,53 +694,53 @@ var Sn = class e {
 				f[r.index] = t;
 				continue;
 			}
-			if (o === ut.Named) {
+			if (o === k.Named) {
 				f[r.index] = this._resolveNamedPrecedents(r.node.value, t, e);
 				continue;
 			}
-			if (o === ut.Error) {
-				f[r.index] = Bt(r.node.value);
+			if (o === k.Error) {
+				f[r.index] = Vt(r.node.value);
 				continue;
 			}
-			if (o === ut.TableReference) {
+			if (o === k.TableReference) {
 				const n = r.node.value;
 				let o;
-				n && (o = this._resolveStructuredRef(n, t, e)), o || (o = m.BuiltIn.Ref), f[r.index] = o;
+				n && (o = this._resolveStructuredRef(n, t, e)), o || (o = I.BuiltIn.Ref), f[r.index] = o;
 				continue;
 			}
 			if ("@" === o || "#" === o) {
 				const t = f[r.inputs[0]];
-				f[r.index] = void 0 === t ? m.BuiltIn.Value : t;
+				f[r.index] = void 0 === t ? I.BuiltIn.Value : t;
 				continue;
 			}
 			const s = r.inputs;
 			if (!s) continue;
 			let l = f[s[0]];
 			if (void 0 === l) {
-				f[r.index] = m.BuiltIn.Value;
+				f[r.index] = I.BuiltIn.Value;
 				continue;
 			}
-			if (m.isError(l)) {
+			if (I.isError(l)) {
 				f[r.index] = l;
 				continue;
 			}
 			let i, a = f[s[1]];
-			if (void 0 !== a) if (m.isError(a)) f[r.index] = a;
+			if (void 0 !== a) if (I.isError(a)) f[r.index] = a;
 			else {
 				if (" " === o) {
 					const t = l.scope ? a.scope ? null : l.scope : a.scope;
-					i = t && this._gridId && t !== this._gridId ? m.BuiltIn.Value : qt(l, a);
-				} else if (":" === o || ".:." === o || ":." === o || ".:" === o) i = xt(l, a);
+					i = t && this._gridId && t !== this._gridId ? I.BuiltIn.Value : qt(l, a);
+				} else if (":" === o || ".:." === o || ":." === o || ".:" === o) i = It(l, a);
 				else if ("," === o) {
 					const t = s.length;
 					for (let e = 0; e < t; e++) {
 						const t = f[s[e]];
-						void 0 === t || Array.isArray(t) || m.isError(t) || (i = i ? xt(i, t) : t);
+						void 0 === t || Array.isArray(t) || I.isError(t) || (i = i ? It(i, t) : t);
 					}
 				}
-				f[r.index] = i ?? m.BuiltIn.Null;
+				f[r.index] = i ?? I.BuiltIn.Null;
 			}
-			else f[r.index] = m.BuiltIn.Value;
+			else f[r.index] = I.BuiltIn.Value;
 		}
 		const g = [];
 		let p = 0;
@@ -762,7 +762,7 @@ var Sn = class e {
 			const s = e.op;
 			let h, u = null;
 			if (s) {
-				if (s === ut.Error) h = Bt(e.node.value);
+				if (s === k.Error) h = Vt(e.node.value);
 				else if (":" === s || ".:." === s || ":." === s || ".:" === s) {
 					const t = e.inputs;
 					if (t && 2 === t.length) {
@@ -791,7 +791,7 @@ var Sn = class e {
 		let s = this._compiled;
 		if (void 0 !== n) {
 			let r;
-			if (Ee(s.ast, (t) => {
+			if (we(s.ast, (t) => {
 				t.evalIndex === n && (r = t);
 			}), !r) throw new Error(`Invalid evalIndex: ${n}`);
 			if (s.bindings.length > 0 && !s.error) {
@@ -799,25 +799,25 @@ var Sn = class e {
 				const o = s.evaluations;
 				return (() => o[n] ?? (!0 === r.inLazy ? this._valueOfLazy(r, o, null, t, e) : void 0))();
 			}
-			s = Pe(o.getRuntime(), s.symbols, Tn(r), !1);
+			s = Ke(o.getRuntime(), s.symbols, Tn(r), !1);
 		}
 		if (s.error) return s.error.cause;
-		s.hasVolatile && r.node && o.markVolatile();
+		s.hasVolatile && r.node && o._markVolatile();
 		const l = s.evaluations, i = s.executions;
 		s.bindings;
 		const a = s.referencesExecute, c = s.referencesRelative, d = s.referencesAbsolute, h = a.length;
 		for (let n = 0; n < h; n++) {
 			const r = a[n], s = r.op, i = r.node;
-			if (s) if (s === ut.Named) if (r.node.deferredResolve) l[r.node.evalIndex] = null;
+			if (s) if (s === k.Named) if (r.node.deferredResolve) l[r.node.evalIndex] = null;
 			else {
 				const n = r.node.value;
 				l[r.node.evalIndex] = this._evaluateNamed(n, t, e);
 			}
-			else if (s === ut.Error) l[i.evalIndex] = Bt(r.node.value);
-			else if (s === ut.TableReference) {
+			else if (s === k.Error) l[i.evalIndex] = Vt(r.node.value);
+			else if (s === k.TableReference) {
 				const n = r.node.value;
 				let s;
-				s = n ? this._resolveStructuredRef(n, t, e) : m.BuiltIn.Ref, m.isError(s) || void 0 === s?.colStart ? l[i.evalIndex] = s ?? m.BuiltIn.Ref : l[i.evalIndex] = o.getReference(s);
+				s = n ? this._resolveStructuredRef(n, t, e) : I.BuiltIn.Ref, I.isError(s) || void 0 === s?.colStart ? l[i.evalIndex] = s ?? I.BuiltIn.Ref : l[i.evalIndex] = o.getReference(s);
 			} else "structured" === s && (l[i.evalIndex] = null);
 			else {
 				const n = kn(c[r.value], t, e, d[r.value]);
@@ -830,41 +830,41 @@ var Sn = class e {
 		const o = this._compiled, s = o.ast;
 		if (!s || !s.isReference) return this;
 		if ("cell" === s.type) return this;
-		if (s.type === ut.Error) return this;
+		if (s.type === k.Error) return this;
 		if ("@" === s.value) return this;
 		if (!r) return this;
-		const l = Ie(n) + _t(e);
+		const l = Ee(n) + _t(e);
 		if (r.has(l)) return this;
-		const i = Wt("@", s, !0), a = Pe(o.runtime, o.symbols, i, !1, o.error, o.getFunction);
+		const i = Ut("@", s, !0), a = Ke(o.runtime, o.symbols, i, !1, o.error, o.getFunction);
 		return new t(a, this._context, this._calcScope, this._gridId, this._getEntireCoords, this._resolvers);
 	}
 	_executeNode(t, e, n, r, o = null) {
 		const s = this._context, l = t.inputs, i = l ? l.length : 0, a = t.type;
 		let c;
 		switch (a) {
-			case ut.Infix: {
+			case k.Infix: {
 				const n = t.value;
 				let r = e[l[0].evalIndex], o = e[l[1].evalIndex];
-				if (!0 === t.firstCell && !t.isReference && this._demandsFirstCell() && (r = Rn(r), o = Rn(o)), ("+" === n || "-" === n) && (r = An(s, r), "number" == typeof r && (o = An(s, o), "number" == typeof o))) {
+				if (!0 === t.firstCell && !t.isReference && this._demandsFirstCell() && (r = An(r), o = An(o)), ("+" === n || "-" === n) && (r = Rn(s, r), "number" == typeof r && (o = Rn(s, o), "number" == typeof o))) {
 					const e = "+" === n ? r + o : r - o;
-					return Pt(!0 === t.snapsCancellation ? X(e, r) : e, null);
+					return zt(!0 === t.snapsCancellation ? Y(e, r) : e, null);
 				}
 				if (!t.isReference) {
-					if (r && m.isError(r)) return r;
-					if (o && m.isError(o)) return o;
+					if (r && I.isError(r)) return r;
+					if (o && I.isError(o)) return o;
 				}
-				const i = t.fn ?? (t.fn = !0 === t.snapsCancellation ? ze[t.value] : $e[t.value]);
-				return c = i ? i(s, r, o) : m.BuiltIn.Value, c = Pt(c, null), c;
+				const i = t.fn ?? (t.fn = !0 === t.snapsCancellation ? qe[t.value] : Xe[t.value]);
+				return c = i ? i(s, r, o) : I.BuiltIn.Value, c = zt(c, null), c;
 			}
-			case ut.Function: {
+			case k.Function: {
 				const s = t.binder;
 				if (void 0 !== s) return "let" === s.kind ? e[l[i - 1].evalIndex] : this._createLambdaValue(t, e, o, n, r);
 				if (!0 === t.hasLazyArgs) {
-					const s = Se.enter();
+					const s = me.enter();
 					try {
-						this._fillLazyArgs(l, i, e, o, n, r, s), !0 === t.passOmitted && Dn(l, i), c = this._callFunction(t, Fn, i), c instanceof Se && (c = c._force());
+						this._fillLazyArgs(l, i, e, o, n, r, s), !0 === t.passOmitted && Dn(l, i), c = this._callFunction(t, Fn, i), c instanceof me && (c = c._force());
 					} finally {
-						Se.leave(s);
+						me.leave(s);
 					}
 				} else {
 					for (let t = 0; t < i; t++) Fn[t] = e[l[t].evalIndex];
@@ -872,22 +872,22 @@ var Sn = class e {
 				}
 				return c;
 			}
-			case ut.Prefix:
-			case ut.Postfix: {
+			case k.Prefix:
+			case k.Postfix: {
 				let n = e[l[0].evalIndex];
-				if (!0 === t.firstCell && !t.isReference && "@" !== t.value && this._demandsFirstCell() && (n = Rn(n)), n && m.isError(n)) return n;
-				const r = t.fn ?? (t.fn = a === ut.Prefix ? He[t.value] : qe[t.value]);
-				return c = r ? r(s, n) : m.BuiltIn.Value, c;
+				if (!0 === t.firstCell && !t.isReference && "@" !== t.value && this._demandsFirstCell() && (n = An(n)), n && I.isError(n)) return n;
+				const r = t.fn ?? (t.fn = a === k.Prefix ? We[t.value] : Ye[t.value]);
+				return c = r ? r(s, n) : I.BuiltIn.Value, c;
 			}
-			case ut.List:
-			case ut.Paren: {
+			case k.List:
+			case k.Paren: {
 				if (1 === i) return e[l[0].evalIndex];
 				for (let t = 0; t < i; t++) {
 					const n = e[l[t].evalIndex];
-					if (null !== n && "object" == typeof n && Q(n.scope)) return m.BuiltIn.Name;
+					if (null !== n && "object" == typeof n && tt(n.scope)) return I.BuiltIn.Name;
 				}
 				let t = !1;
-				for (let n = 0; n < i; n++) if (q(e[l[n].evalIndex])) {
+				for (let n = 0; n < i; n++) if (X(e[l[n].evalIndex])) {
 					t = !0;
 					break;
 				}
@@ -895,17 +895,17 @@ var Sn = class e {
 					const t = [];
 					for (let n = 0; n < i; n++) {
 						const r = e[l[n].evalIndex];
-						q(r) ? t.push(...r) : t.push(r);
+						X(r) ? t.push(...r) : t.push(r);
 					}
-					const n = st(t.length);
+					const n = it(t.length);
 					for (let e = 0; e < t.length; e++) n[e] = t[e];
 					return n;
 				}
-				const n = st(i);
+				const n = it(i);
 				for (let t = 0; t < i; t++) n[t] = e[l[t].evalIndex];
 				return n;
 			}
-			case ut.Named: {
+			case k.Named: {
 				const s = t.binding;
 				if (void 0 !== s) {
 					const n = this._compiled.bindings[s.slot];
@@ -917,16 +917,16 @@ var Sn = class e {
 						const e = o.get(s.slot);
 						return !0 === t.rawFrameRead ? e : (d = e) === xn ? null : d;
 					}
-					return m.BuiltIn.Calc;
+					return I.BuiltIn.Calc;
 				}
 				return !0 === t.deferredResolve ? this._evaluateNamed(t.value, n, r) : e[t.evalIndex] ?? null;
 			}
-			case ut.TableReference: return e[t.evalIndex] ?? null;
-			case ut.Call: {
+			case k.TableReference: return e[t.evalIndex] ?? null;
+			case k.Call: {
 				const n = e[l[0].evalIndex];
-				return n && m.isError(n) ? n : (c = this._applyCallee(n, t, e), c);
+				return n && I.isError(n) ? n : (c = this._applyCallee(n, t, e), c);
 			}
-			case ut.Empty: return;
+			case k.Empty: return;
 		}
 		var d;
 	}
@@ -936,7 +936,7 @@ var Sn = class e {
 			const e = t[r];
 			if (!0 === e?.lazyArg) continue;
 			const o = n[e.evalIndex];
-			!a && (!0 === o?.isIRange ? o.size > 1 : q(o)) && (a = !0);
+			!a && (!0 === o?.isIRange ? o.size > 1 : X(o)) && (a = !0);
 		}
 		if (a) {
 			i = [];
@@ -947,7 +947,7 @@ var Sn = class e {
 		}
 		for (let a = 0; a < e; a++) {
 			const e = t[a];
-			Fn[a] = !0 === e?.lazyArg ? i ? i[a] : Se.deferred(l, a, this, e, n, r, o, s) : n[e.evalIndex];
+			Fn[a] = !0 === e?.lazyArg ? i ? i[a] : me.deferred(l, a, this, e, n, r, o, s) : n[e.evalIndex];
 		}
 	}
 	_createLambdaValue(t, e, n, r, o) {
@@ -963,43 +963,43 @@ var Sn = class e {
 		return new yn(l, s[s.length - 1], this, this._compiled, e.slice(), n, r, o);
 	}
 	_applyCallee(t, e, n) {
-		if (t?.isIRange && !t.isIReferenceRange && 1 === t.size && (t = t.getValueAt(0, 0)) && m.isError(t)) return t;
+		if (t?.isIRange && !t.isIReferenceRange && 1 === t.size && (t = t.getValueAt(0, 0)) && I.isError(t)) return t;
 		const r = e.inputs, o = r.length - 1;
 		if (t instanceof yn) {
 			const e = t.params;
 			let s = e.length;
 			for (; s > 0 && e[s - 1].optional;) s--;
-			if (o > e.length || o < s) return m.BuiltIn.Value;
+			if (o > e.length || o < s) return I.BuiltIn.Value;
 			const l = new Map(t.frame ?? void 0);
 			for (let t = 0; t < e.length; t++) {
-				const s = e[t], i = t >= o || r[t + 1]?.type === ut.Empty;
+				const s = e[t], i = t >= o || r[t + 1]?.type === k.Empty;
 				l.set(s.slot, i ? xn : n[r[t + 1].evalIndex]);
 			}
 			return t.owner._evaluateBody(t, l);
 		}
 		if (t instanceof vn) {
 			const e = [];
-			for (let t = 1; t < r.length; t++) e.push(r[t]?.type === ut.Empty ? void 0 : n[r[t].evalIndex]);
+			for (let t = 1; t < r.length; t++) e.push(r[t]?.type === k.Empty ? void 0 : n[r[t].evalIndex]);
 			return this._dispatchFunction(t.fn, e, e.length);
 		}
-		return t && (t.isIRange || void 0 !== t.colStart) ? m.BuiltIn.Ref : m.BuiltIn.Value;
+		return t && (t.isIRange || void 0 !== t.colStart) ? I.BuiltIn.Ref : I.BuiltIn.Value;
 	}
 	_applyValues(t, e) {
 		const n = t.params;
 		let r = n.length;
 		for (; r > 0 && n[r - 1].optional;) r--;
-		if (e.length > n.length || e.length < r) return m.BuiltIn.Value;
+		if (e.length > n.length || e.length < r) return I.BuiltIn.Value;
 		const o = new Map(t.frame ?? void 0);
 		for (let t = 0; t < n.length; t++) {
 			const r = t < e.length ? e[t] : void 0;
 			o.set(n[t].slot, void 0 === r ? xn : r);
 		}
 		const s = this._evaluateBody(t, o);
-		return Pt(s, this._context);
+		return zt(s, this._context);
 	}
 	_evaluateBody(t, e) {
 		const n = this._calcScope;
-		if (n.depth >= 512) return m.BuiltIn.Num;
+		if (n.depth >= 512) return I.BuiltIn.Num;
 		n.depth++;
 		const r = 0 === t.active ? t.regs : t.regs.slice();
 		t.active++;
@@ -1018,9 +1018,9 @@ var Sn = class e {
 			const s = t.deferred ?? this._listWithin(t);
 			return this._runList(s, e, r, o, n), e[t.evalIndex];
 		} catch (t) {
-			if (m.isError(t)) return t;
-			if (U(t)) throw t;
-			return t instanceof RangeError ? m.BuiltIn.Num : new m.Value(t?.message, { cause: t });
+			if (I.isError(t)) return t;
+			if (W(t)) throw t;
+			return t instanceof RangeError ? I.BuiltIn.Num : new I.Value(t?.message, { cause: t });
 		}
 	}
 	_runList(t, e, n, r, o) {
@@ -1032,7 +1032,7 @@ var Sn = class e {
 	}
 	_listWithin(t) {
 		let e;
-		Ee(this._compiled.ast, (n, r, o) => {
+		we(this._compiled.ast, (n, r, o) => {
 			if (n === t) {
 				for (let t = o.length - 1; t >= 0; t--) if (void 0 !== o[t].deferred) {
 					e = o[t];
@@ -1041,7 +1041,7 @@ var Sn = class e {
 			}
 		});
 		const n = /* @__PURE__ */ new Set();
-		Ee(t, (t) => {
+		we(t, (t) => {
 			n.add(t);
 		});
 		const r = e?.deferred?.filter((t) => n.has(t)) ?? [];
@@ -1059,7 +1059,7 @@ var Sn = class e {
 			t.cacheFnStamp !== e && (o = null);
 		}
 		if (!o) {
-			if (o = r.getFunction(t.value), !o) return m.BuiltIn.Name;
+			if (o = r.getFunction(t.value), !o) return I.BuiltIn.Name;
 			t.cacheFn = o, t.cacheFnStamp = o.isBuiltIn() ? void 0 : r._getFunctionStamp();
 		}
 		const s = this._calcScope, l = s.implicitIntersect, i = s.firstCell;
@@ -1081,7 +1081,7 @@ var Sn = class e {
 			try {
 				r = t.execute();
 			} catch (t) {
-				if (U(t)) throw t;
+				if (W(t)) throw t;
 				r = Gn(t);
 			}
 			s.argsValues = null, s.argsLength = 0;
@@ -1111,7 +1111,7 @@ var Sn = class e {
 					r = t.execute(...o);
 			}
 		} catch (t) {
-			if (U(t)) throw t;
+			if (W(t)) throw t;
 			r = Gn(t);
 		}
 		const l = this._calcScope;
@@ -1119,26 +1119,26 @@ var Sn = class e {
 			const t = l.deferServed;
 			return l.deferServed = null, null !== t && void 0 !== t.latest && l.deferCount === o + 1 ? t.latest : void 0 === r ? null : r;
 		}
-		return void 0 === r ? new m.Parse() : r;
+		return void 0 === r ? new I.Parse() : r;
 	}
 	finalizeValue(t) {
 		const e = this._context;
-		if (Ct(t)) return m.BuiltIn.Calc;
-		if (p(t)) return m.BuiltIn.Calc;
+		if (yt(t)) return I.BuiltIn.Calc;
+		if (p(t)) return I.BuiltIn.Calc;
 		if (t && void 0 !== t.colStart) try {
 			if (t.scope) {
 				const n = e.getReference(t);
-				if (m.isError(n)) return n;
+				if (I.isError(n)) return n;
 			}
 			t = e.getValueAt(t.rowStart, t.colStart, t.scope);
 		} catch (t) {
-			if (U(t)) throw t;
-			return m.isError(t) ? t : new m.Value(t?.message, { cause: t });
+			if (W(t)) throw t;
+			return I.isError(t) ? t : new I.Value(t?.message, { cause: t });
 		}
-		if (Array.isArray(t) && t.isSheetSpan) return m.BuiltIn.Ref;
+		if (Array.isArray(t) && t.isSheetSpan) return I.BuiltIn.Ref;
 		if (Array.isArray(t)) {
-			if (q(t)) {
-				const e = st(t.length);
+			if (X(t)) {
+				const e = it(t.length);
 				for (let n = 0; n < t.length; n++) e[n] = this.finalizeValue(t[n]);
 				return e;
 			}
@@ -1146,15 +1146,15 @@ var Sn = class e {
 			else try {
 				t = e.getRange(t);
 			} catch (e) {
-				t = m.BuiltIn.Value;
+				t = I.BuiltIn.Value;
 			}
 		}
 		var n;
-		return t?.isIRange ? t.size <= 1 ? (t = 0 === t.size ? null : t.getValueAt(0, 0, Mn), null === (t = Pt(t, e)) && (t = 0)) : (n = t, Cn.has(n) || (t = t.fillEmpty(0))) : null === (t = Pt(t, e)) && (t = 0), t;
+		return t?.isIRange ? t.size <= 1 ? (t = 0 === t.size ? null : t.getValueAt(0, 0, Mn), null === (t = zt(t, e)) && (t = 0)) : (n = t, Cn.has(n) || (t = t.fillEmpty(0))) : null === (t = zt(t, e)) && (t = 0), t;
 	}
 	finalizeValueForCell(t) {
 		const e = this.finalizeValue(t);
-		return Array.isArray(e) ? m.BuiltIn.Value : e;
+		return Array.isArray(e) ? I.BuiltIn.Value : e;
 	}
 	toString() {
 		const t = this._compiled;
@@ -1165,7 +1165,7 @@ var Sn = class e {
 	get [Symbol.toStringTag]() {
 		return "[FormulaBlock]";
 	}
-}, An = (t, e) => null !== e && "object" == typeof e && void 0 !== e.colStart && e.rowStart === e.rowEnd && e.colStart === e.colEnd ? t.getValueAt(e.rowStart, e.colStart, e.scope) : e, Rn = (t) => null !== t && "object" == typeof t && !0 === t.isIRange ? t.getValueAt(0, 0) ?? null : t;
+}, Rn = (t, e) => null !== e && "object" == typeof e && void 0 !== e.colStart && e.rowStart === e.rowEnd && e.colStart === e.colEnd ? t.getValueAt(e.rowStart, e.colStart, e.scope) : e, An = (t) => null !== t && "object" == typeof t && !0 === t.isIRange ? t.getValueAt(0, 0) ?? null : t;
 function kn(t, e, n, r) {
 	let o = t.colStart, s = t.rowStart, l = t.colEnd, i = t.rowEnd;
 	const a = t.$colStart ?? !1, c = t.$rowStart ?? !1, d = t.$colEnd ?? !1, h = t.$rowEnd ?? !1;
@@ -1187,7 +1187,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 		for (let i = 0; i < t; i++) o = Nn(a[i], e, n, r, o, s, l);
 		return o;
 	}
-	const c = void 0 === i ? m.BuiltIn.Value : n[t] ?? m.BuiltIn.Value;
+	const c = void 0 === i ? I.BuiltIn.Value : n[t] ?? I.BuiltIn.Value;
 	if (Array.isArray(c)) {
 		const t = c.length;
 		for (let e = 0; e < t; e++) {
@@ -1203,15 +1203,15 @@ var Nn = (t, e, n, r, o, s, l) => {
 	} else r[o] = c;
 	return s && (s[o] = d), l && (l[o] = h), o + 1;
 }, Mn = Object.freeze({ type: null }), Fn = new Array(255), Dn = (t, e) => {
-	for (let n = 0; n < e; n++) t[n]?.type === ut.Empty && (Fn[n] = xn);
+	for (let n = 0; n < e; n++) t[n]?.type === k.Empty && (Fn[n] = xn);
 }, Tn = (t) => {
 	const e = { ...t };
 	return delete e.inLazy, delete e.lazyArg, delete e.hasLazyArgs, delete e.deferred, t.inputs && (e.inputs = t.inputs.map((t) => t ? Tn(t) : t)), e;
-}, Gn = (t) => m.isError(t) ? t : t instanceof RangeError ? m.BuiltIn.Num : new m.Value(t?.message, { cause: t }), Bn = Ce(4096), Vn = 0, On = () => Bn, Pn = (t, e) => {
+}, Gn = (t) => I.isError(t) ? t : t instanceof RangeError ? I.BuiltIn.Num : new I.Value(t?.message, { cause: t }), Bn = ue(4096), Vn = 0, On = () => Bn, Pn = (t, e) => {
 	if (0 === e) return void (t.inputsAt = -1);
 	const n = Vn, r = n + e;
 	if (r > Bn.length) {
-		const t = Ce(Math.max(r, 2 * Bn.length));
+		const t = ue(Math.max(r, 2 * Bn.length));
 		for (let e = 0; e < n; e++) t[e] = Bn[e];
 		Bn = t;
 	}
@@ -1226,7 +1226,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 	if (n < 0) return;
 	const r = Bn;
 	for (let t = 0; t < e; t++) r[n + t] = void 0;
-}, $n = 32, Hn = 64, jn = 128, Kn = 768, qn = 3072, Un = 12288, Wn = 16384, Xn = 32768, Jn = 65536, Qn = 1 << 17, Yn = 1 << 18, Zn = 1 << 19, tr = 1 << 20, er = 1 << 21, nr = 1 << 22, rr = 495520, or = 256, sr = 512, lr = 1024, ir = 2048, ar = (t, e, n) => {
+}, $n = 32, Hn = 64, jn = 128, Kn = 768, qn = 3072, Un = 12288, Xn = 16384, Wn = 32768, Jn = 65536, Qn = 1 << 17, Yn = 1 << 18, Zn = 1 << 19, tr = 1 << 20, er = 1 << 21, nr = 1 << 22, rr = 495520, or = 256, sr = 512, lr = 1024, ir = 2048, ar = (t, e, n) => {
 	if (void 0 === e) return () => !1;
 	const r = dr(e);
 	return (o) => r(o) && n(t.compare(o, e));
@@ -1241,7 +1241,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 		case "string": return (t) => "string" == typeof t;
 		case "number": return (t) => "number" == typeof t;
 		case "boolean": return (t) => "boolean" == typeof t;
-		default: return (t) => m.isError(t);
+		default: return (t) => I.isError(t);
 	}
 }, hr = (t, e, n = !1) => {
 	const r = typeof e;
@@ -1265,9 +1265,9 @@ var Nn = (t, e, n, r, o, s, l) => {
 			if (void 0 === r) {
 				const o = t.parseAsLiteral(n);
 				if (void 0 !== o) r = o;
-				else if (r = n, ("=" === e || "<>" === e) && I.isWildCard(r)) return {
+				else if (r = n, ("=" === e || "<>" === e) && S.isWildCard(r)) return {
 					op: "wc",
-					value: I.toRegex(r, "i", !0),
+					value: S.toRegex(r, "i", !0),
 					match: "=" === e
 				};
 			}
@@ -1283,16 +1283,16 @@ var Nn = (t, e, n, r, o, s, l) => {
 				value: e
 			};
 		} catch (t) {}
-		return I.isWildCard(r) ? {
+		return S.isWildCard(r) ? {
 			op: "wc",
-			value: I.toRegex(r, "i", !n || "start"),
+			value: S.toRegex(r, "i", !n || "start"),
 			match: !0
 		} : {
 			op: n ? "prefix" : "=",
 			value: e
 		};
 	}
-	return "boolean" === r || "number" === r || m.isError(e) ? {
+	return "boolean" === r || "number" === r || I.isError(e) ? {
 		op: "=",
 		value: e
 	} : null == e ? {
@@ -1300,7 +1300,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 		value: 0
 	} : {
 		op: "err",
-		value: new m.Value(`Criteria.parse: type ${typeof e} not support`)
+		value: new I.Value(`Criteria.parse: type ${typeof e} not support`)
 	};
 }, ur = class {
 	constructor(t, e, n, r, o) {
@@ -1375,10 +1375,10 @@ var Nn = (t, e, n, r, o, s, l) => {
 	return new ur(t, r, o, s, l);
 }, pr = class t {
 	static create(e, n, r, o) {
-		const s = fe.peek();
+		const s = _e.peek();
 		if (!s) throw new Error("The sdk WebAssembly is not loaded.");
 		const l = (e ?? n)?.getRowCount() ?? 0;
-		if ((e?.getColumnCount() ?? 0) > 32 || (n?.getColumnCount() ?? 0) > 32) throw m.BuiltIn.Value;
+		if ((e?.getColumnCount() ?? 0) > 32 || (n?.getColumnCount() ?? 0) > 32) throw I.BuiltIn.Value;
 		const i = new s.PivotRequest(l), a = t._addFields(i, e, !0), c = t._addFields(i, n, !1), d = o?.filter ? i.add_filter() : -1, h = s.wasm_memory().buffer;
 		if (t._fillFields(h, e, a, l), t._fillFields(h, n, c, l), -1 !== d) {
 			const t = new Uint32Array(h, d, 2 * Math.ceil(l / 64));
@@ -1391,7 +1391,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 		try {
 			u = i.compute(0, !1);
 		} catch {
-			throw i.free(), m.BuiltIn.Value;
+			throw i.free(), I.BuiltIn.Value;
 		}
 		return new t(s, i, u, l, e, n, r);
 	}
@@ -1406,11 +1406,11 @@ var Nn = (t, e, n, r, o, s, l) => {
 				colStart: o,
 				colEnd: o
 			});
-			new gn().fill(s, new Uint32Array(t, n[o], r));
+			new Le().fill(s, new Uint32Array(t, n[o], r));
 		}
 	}
 	constructor(t, e, n, r, o, s, l) {
-		this._cellsByColumn = /* @__PURE__ */ new Map(), this._errors = new fn(), this._values = /* @__PURE__ */ new Map(), this._leafCount = 0, this._withRecords = null, this._wasm = t, this._request = e, this._result = n, this._n = r, this._createColumn = l;
+		this._cellsByColumn = /* @__PURE__ */ new Map(), this._errors = new ze(), this._values = /* @__PURE__ */ new Map(), this._leafCount = 0, this._withRecords = null, this._wasm = t, this._request = e, this._result = n, this._n = r, this._createColumn = l;
 		const i = n.row_nodes();
 		this._rows = gr(o, i), this._columns = gr(s, n.column_nodes()), this._recordCount = i.length > 0 ? i[4] : 0;
 	}
@@ -1437,7 +1437,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 	}
 	getAggregate(t, e, n, r) {
 		if (!e.isBuiltIn()) return;
-		const o = pn[e.getName().toUpperCase()];
+		const o = $e[e.getName().toUpperCase()];
 		if (void 0 === o) return;
 		let s = this._values.get(t);
 		if (void 0 === s && (s = this._addValues(t), this._values.set(t, s)), null === s || o >= 7 && !s.numeric) return;
@@ -1458,7 +1458,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 			doubles: new Float64Array(o, n, e),
 			ints: new Int32Array(o, n, 2 * e),
 			types: new Uint8Array(o, n + 8 * e, e)
-		}, { ok: l, numeric: i } = un(t, s, this._errors);
+		}, { ok: l, numeric: i } = Oe(t, s, this._errors);
 		return l ? {
 			leaf: r,
 			numeric: i,
@@ -1468,7 +1468,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 	_run(t, e) {
 		const n = this._request;
 		n.clear_measures(), n.add_measure(t, e);
-		const r = n.compute(0, !1), o = r.values(0), s = _n(this._buffer(), o, this._errors), l = r.cell_count(), i = new Array(l);
+		const r = n.compute(0, !1), o = r.values(0), s = Pe(this._buffer(), o, this._errors), l = r.cell_count(), i = new Array(l);
 		for (let t = 0; t < l; t++) i[t] = s(t);
 		return o.free(), r.free(), i;
 	}
@@ -1492,7 +1492,7 @@ var Nn = (t, e, n, r, o, s, l) => {
 	rowStart: 0,
 	colEnd: 0,
 	rowEnd: 0
-}, vr = [], xr = [], Cr = [], br = [], Ar = [], Rr = [], kr = (t, e) => !0 === e || t === Number.MIN_SAFE_INTEGER, Nr = (t, e) => !0 === e || t === Number.MAX_SAFE_INTEGER, Mr = (t, e, n, r, o, s, l) => {
+}, vr = [], xr = [], Cr = [], br = [], Rr = [], Ar = [], kr = (t, e) => !0 === e || t === Number.MIN_SAFE_INTEGER, Nr = (t, e) => !0 === e || t === Number.MAX_SAFE_INTEGER, Mr = (t, e, n, r, o, s, l) => {
 	if (n === o) {
 		if (e > r) {
 			const t = e;
@@ -1521,7 +1521,7 @@ function Vr(t, e, n) {
 	const o = mr, s = Sr, l = t.relative, i = t.second, a = l.length;
 	for (let t = 0; t < a; t++) {
 		const r = l[t];
-		if (m.isError(r)) continue;
+		if (I.isError(r)) continue;
 		const a = i[t], c = a ?? r, d = r.scope ?? null, h = null !== a ? a.scope ?? null : null;
 		if (null !== d && null !== h && d !== h) return Br(e);
 		const u = d ?? h;
@@ -1537,18 +1537,18 @@ function Vr(t, e, n) {
 			const n = g[t];
 			Tr(Math.max(n.colStart, f.colStart), Math.max(n.rowStart, f.rowStart), Math.min(n.colEnd, f.colEnd), Math.min(n.rowEnd, f.rowEnd), e);
 		}
-		const S = _.values, E = S.getCoords();
-		if (!E) continue;
-		if (!Fr(o, E.rowStart, E.rowEnd, e.rowStart, e.rowEnd)) continue;
-		const I = wr, y = Er;
-		if (!Fr(s, E.colStart, E.colEnd, e.colStart, e.colEnd)) continue;
+		const m = _.values, S = m.getCoords();
+		if (!S) continue;
+		if (!Fr(o, S.rowStart, S.rowEnd, e.rowStart, e.rowEnd)) continue;
+		const w = wr, y = Er;
+		if (!Fr(s, S.colStart, S.colEnd, e.colStart, e.colEnd)) continue;
 		const v = wr, x = Er, C = yr;
-		if (Dr(o, I, y), C.rowStart = Math.max(wr, E.rowStart), C.rowEnd = Math.min(Er, E.rowEnd), Dr(s, v, x), C.colStart = Math.max(wr, E.colStart), C.colEnd = Math.min(Er, E.colEnd), C.colStart > C.colEnd || C.rowStart > C.rowEnd) continue;
-		const b = (S.getAxis?.() ?? w.Axis.Row) === w.Axis.Column, A = S.getRuns({ bounds: C });
-		let R = A.next();
-		for (; !R.done;) {
-			const [t, n, r] = R.value;
-			R = A.next();
+		if (Dr(o, w, y), C.rowStart = Math.max(wr, S.rowStart), C.rowEnd = Math.min(Er, S.rowEnd), Dr(s, v, x), C.colStart = Math.max(wr, S.colStart), C.colEnd = Math.min(Er, S.colEnd), C.colStart > C.colEnd || C.rowStart > C.rowEnd) continue;
+		const b = (m.getAxis?.() ?? E.Axis.Row) === E.Axis.Column, R = m.getRuns({ bounds: C });
+		let A = R.next();
+		for (; !A.done;) {
+			const [t, n, r] = A.value;
+			A = R.next();
 			const o = n + r.length - 1;
 			b ? Tr(t, n, t, o, e) : Tr(n, t, o, t, e);
 		}
@@ -1572,7 +1572,7 @@ function Vr(t, e, n) {
 		o.length = s;
 		const l = [], i = [], a = br;
 		a.length = 0;
-		let c = 0, d = Ar, h = Rr, u = !1, _ = 0, f = 0;
+		let c = 0, d = Rr, h = Ar, u = !1, _ = 0, f = 0;
 		const g = s - 1;
 		for (let s = 0; s < g; s++) {
 			const g = o[s], p = o[s + 1] - 1;
@@ -1614,7 +1614,7 @@ function Vr(t, e, n) {
 			const w = h;
 			h = d, d = w, u = !0;
 		}
-		return Ar = d, Rr = h, {
+		return Rr = d, Ar = h, {
 			touched: l,
 			blank: i
 		};
@@ -1674,7 +1674,7 @@ function jr(t, e, n = 0, r = 0) {
 		const i = t.rowIndex + r, a = t.colIndex + n;
 		if (i < o.rowStart || i > o.rowEnd || a < o.colStart || a > o.colEnd) return;
 		const c = e.nodeAt(i, a);
-		Ze(c).fixedRef = 0 === n && 0 === r ? l : {
+		sn(c).fixedRef = 0 === n && 0 === r ? l : {
 			colStart: l.colStart + n,
 			rowStart: l.rowStart + r,
 			colEnd: l.colEnd + n,
@@ -1696,7 +1696,7 @@ var Kr = {
 }, Ur = {
 	bounds: qr,
 	reuseResult: !0
-}, Wr = (t, e) => t.colIndex === e.colIndex ? t.rowIndex - e.rowIndex : t.colIndex - e.colIndex, Xr = (t, e, n) => null === t || 0 === e && 0 === n ? t : {
+}, Xr = (t, e) => t.colIndex === e.colIndex ? t.rowIndex - e.rowIndex : t.colIndex - e.colIndex, Wr = (t, e, n) => null === t || 0 === e && 0 === n ? t : {
 	colStart: t.colStart + n,
 	rowStart: t.rowStart + e,
 	colEnd: t.colEnd + n,
@@ -1784,7 +1784,7 @@ var Kr = {
 		return void 0 === o && (o = this._newNode(t, e, this.gridId, null), r.setValueAt(t, e, o)), o;
 	}
 	_newSparseStore() {
-		const t = new N({ axis: w.Axis.Column }), e = this._anchor;
+		const t = new F({ axis: E.Axis.Column }), e = this._anchor;
 		return null !== e && t.setValueAt(e.rowIndex, e.colIndex, e), this._nodes = t, t;
 	}
 	_mintDense() {
@@ -1846,7 +1846,7 @@ var Kr = {
 			if (l > i || a > c) return;
 			const d = this.gridId;
 			let h = null;
-			for (let t = a; t <= c; t++) for (let e = l; e <= i; e++) void 0 === o.getValueAt(e, t) && (null === h && (h = new L.Builder()), h.pushAt(t, e, this._newNode(e, t, d, null)));
+			for (let t = a; t <= c; t++) for (let e = l; e <= i; e++) void 0 === o.getValueAt(e, t) && (null === h && (h = new j.Builder()), h.pushAt(t, e, this._newNode(e, t, d, null)));
 			if (null !== h) {
 				const t = h.build();
 				t && o.setValues(t.tuples);
@@ -1879,7 +1879,7 @@ var Kr = {
 		const s = n.relative, l = n.second, i = s.length;
 		for (let n = 0; n < i; n++) {
 			const i = s[n];
-			if (m.isError(i)) {
+			if (I.isError(i)) {
 				o[n] = i;
 				continue;
 			}
@@ -1889,8 +1889,8 @@ var Kr = {
 				continue;
 			}
 			kn(i, t, e, Kr), kn(c, t, e, Jr);
-			const d = xt(Kr, Jr, a);
-			o[n] = d ?? m.BuiltIn.Null;
+			const d = It(Kr, Jr, a);
+			o[n] = d ?? I.BuiltIn.Null;
 		}
 		return this._scratchRow = t, this._scratchCol = e, o;
 	}
@@ -1980,8 +1980,8 @@ var Kr = {
 	densify() {
 		if (!this._sparse) return;
 		if (this._sparse = !1, null === this._nodes) return;
-		const t = this.ref, e = t.rowStart, n = t.colStart, r = t.rowEnd - e + 1, o = t.colEnd - n + 1, s = st(r);
-		for (let t = 0; t < r; t++) s[t] = st(o);
+		const t = this.ref, e = t.rowStart, n = t.colStart, r = t.rowEnd - e + 1, o = t.colEnd - n + 1, s = it(r);
+		for (let t = 0; t < r; t++) s[t] = it(o);
 		this.forEachNode((t) => {
 			s[t.rowIndex - e][t.colIndex - n] = t;
 		});
@@ -1997,9 +1997,9 @@ var Kr = {
 		if (!t) return [[this._newNode(s, o, e, r.EmptyArray)]];
 		const l = this._template, i = null !== l, a = i ? null : t.resolvedPrecedentsAt(s, o), c = i ? l.relative.length : a?.length ?? 0;
 		this.paramLength = c;
-		const d = st(n.rowEnd - s + 1), h = n.colEnd - o + 1, u = d.length;
+		const d = it(n.rowEnd - s + 1), h = n.colEnd - o + 1, u = d.length;
 		for (let n = 0; n < u; n++) {
-			const l = st(h), u = l.length;
+			const l = it(h), u = l.length;
 			for (let d = 0; d < u; d++) {
 				const h = n + s, u = d + o, _ = i ? null : 0 === c ? r.EmptyArray : 0 === n && 0 === d ? a : t.resolvedPrecedentsAt(h, u);
 				l[d] = this._newNode(h, u, e, _);
@@ -2050,7 +2050,7 @@ var Kr = {
 	}
 	_adoptNode(t, e, n, o) {
 		const s = t.ext;
-		return null !== s && (s.spillDependents = r.EmptyArray, s.spillRowEnd = -1, s.spillColEnd = -1, s.fixedRef = Xr(s.fixedRef, e - t.rowIndex, n - t.colIndex)), t.block = this, t.gridId = this.gridId, t.rowIndex = e, t.colIndex = n, t.inputsAt = -1, t.precedents = o, t.orderIndex = -1, t.planId = 0, t.planEpoch = 0, t.dependentsEpoch = 0, t.dependents = r.EmptyArray, t;
+		return null !== s && (s.spillDependents = r.EmptyArray, s.spillRowEnd = -1, s.spillColEnd = -1, s.fixedRef = Wr(s.fixedRef, e - t.rowIndex, n - t.colIndex)), t.block = this, t.gridId = this.gridId, t.rowIndex = e, t.colIndex = n, t.inputsAt = -1, t.precedents = o, t.orderIndex = -1, t.planId = 0, t.planEpoch = 0, t.dependentsEpoch = 0, t.dependents = r.EmptyArray, t;
 	}
 	_copyNode(t, e, n) {
 		const o = { ...t };
@@ -2062,7 +2062,7 @@ var Kr = {
 			spillColStart: -1,
 			spillRowEnd: -1,
 			spillColEnd: -1,
-			fixedRef: Xr(s.fixedRef, e - t.rowIndex, n - t.colIndex),
+			fixedRef: Wr(s.fixedRef, e - t.rowIndex, n - t.colIndex),
 			demandValue: s.demandValue,
 			cycleGroup: s.cycleGroup,
 			cycleNext: s.cycleNext,
@@ -2087,7 +2087,7 @@ var Kr = {
 				const t = e.originRow, o = e.originCol;
 				if (0 === o && n.colEnd - n.colStart + 1 === a) c = 0 === t && r.length === i ? r : r.slice(t, t + i);
 				else {
-					c = st(i);
+					c = it(i);
 					for (let e = 0; e < i; e++) c[e] = r[e + t].slice(o, o + a);
 				}
 			}
@@ -2102,9 +2102,9 @@ var Kr = {
 			}
 			return c;
 		}
-		const d = this.gridId, h = st(i);
+		const d = this.gridId, h = it(i);
 		for (let e = 0; e < i; e++) {
-			const n = st(a);
+			const n = it(a);
 			h[e] = n;
 			const s = e + r;
 			for (let r = 0; r < a; r++) {
@@ -2121,7 +2121,7 @@ var Kr = {
 			if (null !== a && 0 === l.originRow && 0 === l.originCol && i.rowStart === n && i.colStart === r && i.rowEnd === e.rowEnd && i.colEnd === e.colEnd) return t._nodes = null, this._nodes = a, void this.forEachNode((t) => {
 				this._adoptNode(t, t.rowIndex, t.colIndex, null);
 			});
-			const c = i.rowStart + l.originRow, d = i.colStart + l.originCol, h = n - c, u = r - d, _ = new L.Builder();
+			const c = i.rowStart + l.originRow, d = i.colStart + l.originCol, h = n - c, u = r - d, _ = new j.Builder();
 			t.forEachNodeIn(c, c + o - 1, d, d + s - 1, (t) => {
 				const e = t.rowIndex + h, n = t.colIndex + u;
 				this._adoptNode(t, e, n, null), _.pushAt(n, e, t);
@@ -2139,8 +2139,8 @@ var Kr = {
 			});
 		}
 		if (0 === i.length) return;
-		i.sort(Wr);
-		const a = new L.Builder();
+		i.sort(Xr);
+		const a = new j.Builder();
 		for (let t = 0; t < i.length; t++) {
 			const e = i[t];
 			t > 0 && i[t - 1].rowIndex === e.rowIndex && i[t - 1].colIndex === e.colIndex || a.pushAt(e.colIndex, e.rowIndex, e);
@@ -2150,31 +2150,31 @@ var Kr = {
 	}
 	toJSON(t = !1, e = this.ref) {
 		const n = e;
-		return [ce(n), this.formula.getTextAt(n.rowStart, n.colStart, t)];
+		return [ie(n), this.formula.getTextAt(n.rowStart, n.colStart, t)];
 	}
 	getCoords() {
 		return this.ref;
 	}
 	getShifted(e) {
 		if (!e.after) return null;
-		const n = o.sanitizeRange(e.after), r = e.axis !== w.Axis.Row, s = e.amount, l = e.intersect, i = l.colStart, a = l.rowStart, c = l.colEnd, d = l.rowEnd, h = r ? s : 0, u = r ? 0 : s, _ = this.ref, f = n, g = this._container.getGrid(this.gridId)?.getEntireCoords();
+		const n = o.sanitizeRange(e.after), r = e.axis !== E.Axis.Row, s = e.amount, l = e.intersect, i = l.colStart, a = l.rowStart, c = l.colEnd, d = l.rowEnd, h = r ? s : 0, u = r ? 0 : s, _ = this.ref, f = n, g = this._container.getGrid(this.gridId)?.getEntireCoords();
 		let p = this.formula;
-		const S = p.getReferences(_.rowStart, _.colStart);
-		for (let t = 0; t < S.length; t++) {
-			const e = S[t];
+		const m = p.getReferences(_.rowStart, _.colStart);
+		for (let t = 0; t < m.length; t++) {
+			const e = m[t];
 			if (null === e) continue;
 			if ("nameId" in e) continue;
 			if ("tableId" in e) continue;
-			if (m.isError(e)) continue;
-			const n = e, o = null != n.scope && n.scope !== this.gridId, l = n.colStart === Number.MIN_SAFE_INTEGER, w = n.rowStart === Number.MIN_SAFE_INTEGER;
-			let E = n, I = n.$colStart ? n.colStart : _.colStart + n.colStart, y = n.$rowStart ? n.rowStart : _.rowStart + n.rowStart;
-			if (!o && I > c && !n.$colStart && !n.$colEnd) continue;
+			if (I.isError(e)) continue;
+			const n = e, o = null != n.scope && n.scope !== this.gridId, l = n.colStart === Number.MIN_SAFE_INTEGER, S = n.rowStart === Number.MIN_SAFE_INTEGER;
+			let w = n, E = n.$colStart ? n.colStart : _.colStart + n.colStart, y = n.$rowStart ? n.rowStart : _.rowStart + n.rowStart;
+			if (!o && E > c && !n.$colStart && !n.$colEnd) continue;
 			let v = n.$colEnd ? n.colEnd : _.colStart + n.colEnd, x = n.$rowEnd ? n.rowEnd : _.rowStart + n.rowEnd;
-			if (o) 0 === h || l || (n.$colStart || (E = { ...n }, E.colStart = I - f.colStart), n.$colEnd || (E = E === n ? { ...n } : E, E.colEnd = v - f.colStart)), 0 === u || w || (n.$rowStart || (E = E === n ? { ...n } : E, E.rowStart = y - f.rowStart), n.$rowEnd || (E = E === n ? { ...n } : E, E.rowEnd = x - f.rowStart)), E !== n && (p = p.setReferenceAt(t, E));
+			if (o) 0 === h || l || (n.$colStart || (w = { ...n }, w.colStart = E - f.colStart), n.$colEnd || (w = w === n ? { ...n } : w, w.colEnd = v - f.colStart)), 0 === u || S || (n.$rowStart || (w = w === n ? { ...n } : w, w.rowStart = y - f.rowStart), n.$rowEnd || (w = w === n ? { ...n } : w, w.rowEnd = x - f.rowStart)), w !== n && (p = p.setReferenceAt(t, w));
 			else {
 				if (s < 0) {
 					if (r) {
-						if (I >= i && v <= c) {
+						if (E >= i && v <= c) {
 							p = p.setReferenceAt(t, null);
 							continue;
 						}
@@ -2183,13 +2183,13 @@ var Kr = {
 						continue;
 					}
 				}
-				0 === h || l || (n.$colStart ? I >= i && (E = E === n ? { ...n } : E, E.colStart += h, I = E.colStart) : I < i ? (E = E === n ? { ...n } : E, E.colStart = I - f.colStart, I = f.colStart + E.colStart) : h < 0 && I <= c && (E = E === n ? { ...n } : E, I = Math.max(i, I + h), E.colStart = I - f.colStart, I = f.colStart + E.colStart), n.$colEnd ? v >= i && (E = E === n ? { ...n } : E, E.colEnd += h, v = E.colEnd) : v < i ? (E = E === n ? { ...n } : E, E.colEnd = v - f.colStart, v = f.colStart + E.colEnd) : h < 0 && v <= c && (E = E === n ? { ...n } : E, v = Math.max(i - 1, v + h), E.colEnd = v - f.colStart, v = f.colStart + E.colEnd)), 0 === u || w || (n.$rowStart ? y >= a && (E = E === n ? { ...n } : E, E.rowStart += u, y = E.rowStart) : y < a ? (E = E === n ? { ...n } : E, E.rowStart = y - f.rowStart, y = f.rowStart + E.rowStart) : u < 0 && y <= d && (E = E === n ? { ...n } : E, y = Math.max(a, y + u), E.rowStart = y - f.rowStart, y = f.rowStart + E.rowStart), n.$rowEnd ? x >= a && (E = E === n ? { ...n } : E, E.rowEnd += u, x = E.rowEnd) : x < a ? (E = E === n ? { ...n } : E, E.rowEnd = x - f.rowStart, x = f.rowStart + E.rowEnd) : u < 0 && x <= d && (E = E === n ? { ...n } : E, x = Math.max(a - 1, x + u), E.rowEnd = x - f.rowStart, x = f.rowStart + E.rowEnd)), E !== n && ((v < I || x < y || g && (!l && (I < g.colStart || v > g.colEnd) || !w && (y < g.rowStart || x > g.rowEnd))) && (E = m.BuiltIn.Ref), p = p.setReferenceAt(t, E));
+				0 === h || l || (n.$colStart ? E >= i && (w = w === n ? { ...n } : w, w.colStart += h, E = w.colStart) : E < i ? (w = w === n ? { ...n } : w, w.colStart = E - f.colStart, E = f.colStart + w.colStart) : h < 0 && E <= c && (w = w === n ? { ...n } : w, E = Math.max(i, E + h), w.colStart = E - f.colStart, E = f.colStart + w.colStart), n.$colEnd ? v >= i && (w = w === n ? { ...n } : w, w.colEnd += h, v = w.colEnd) : v < i ? (w = w === n ? { ...n } : w, w.colEnd = v - f.colStart, v = f.colStart + w.colEnd) : h < 0 && v <= c && (w = w === n ? { ...n } : w, v = Math.max(i - 1, v + h), w.colEnd = v - f.colStart, v = f.colStart + w.colEnd)), 0 === u || S || (n.$rowStart ? y >= a && (w = w === n ? { ...n } : w, w.rowStart += u, y = w.rowStart) : y < a ? (w = w === n ? { ...n } : w, w.rowStart = y - f.rowStart, y = f.rowStart + w.rowStart) : u < 0 && y <= d && (w = w === n ? { ...n } : w, y = Math.max(a, y + u), w.rowStart = y - f.rowStart, y = f.rowStart + w.rowStart), n.$rowEnd ? x >= a && (w = w === n ? { ...n } : w, w.rowEnd += u, x = w.rowEnd) : x < a ? (w = w === n ? { ...n } : w, w.rowEnd = x - f.rowStart, x = f.rowStart + w.rowEnd) : u < 0 && x <= d && (w = w === n ? { ...n } : w, x = Math.max(a - 1, x + u), w.rowEnd = x - f.rowStart, x = f.rowStart + w.rowEnd)), w !== n && ((v < E || x < y || g && (!l && (E < g.colStart || v > g.colEnd) || !S && (y < g.rowStart || x > g.rowEnd))) && (w = I.BuiltIn.Ref), p = p.setReferenceAt(t, w));
 			}
 		}
-		const E = new t(n, this.gridId, p, this._container, this.unanchored, this.getNodeSource());
+		const S = new t(n, this.gridId, p, this._container, this.unanchored, this.getNodeSource());
 		return {
 			...e.after,
-			value: E
+			value: S
 		};
 	}
 	getMerged(e, n, r) {
@@ -2199,7 +2199,7 @@ var Kr = {
 			block: this,
 			originRow: 0,
 			originCol: 0
-		}, r === w.Axis.Row ? {
+		}, r === E.Axis.Row ? {
 			block: e,
 			originRow: -(l.rowEnd - l.rowStart + 1),
 			originCol: 0
@@ -2211,7 +2211,7 @@ var Kr = {
 		return new t(n, this.gridId, o, this._container, this.unanchored, i);
 	}
 	getSplit(e, n, r) {
-		const o = this.formula, s = n === w.Axis.Column, l = new t(e[0], this.gridId, o, this._container, this.unanchored), i = new t(e[1], this.gridId, o, this._container, this.unanchored);
+		const o = this.formula, s = n === E.Axis.Column, l = new t(e[0], this.gridId, o, this._container, this.unanchored), i = new t(e[1], this.gridId, o, this._container, this.unanchored);
 		return l._adopt([{
 			block: this,
 			originRow: 0,
@@ -2230,7 +2230,7 @@ var Kr = {
 			for (let e = 0; e < l.length; e++) {
 				const i = l ? l[e] : null;
 				if (!i || "nameId" in i) continue;
-				if (m.isError(i)) continue;
+				if (I.isError(i)) continue;
 				const a = i;
 				let c;
 				const d = a.$colStart ? a.colStart : t.colStart + a.colStart, h = a.$rowStart ? a.rowStart : t.rowStart + a.rowStart, u = a.$colEnd ? a.colEnd : t.colEnd + a.colEnd, _ = a.$rowEnd ? a.rowEnd : t.rowEnd + a.rowEnd, f = null != a.scope && a.scope !== this.gridId, g = !f && h >= o.rowStart && _ <= o.rowEnd, p = !f && d >= o.colStart && u <= o.colEnd;
@@ -2254,7 +2254,7 @@ var Kr = {
 		t.value.release();
 	}
 	evaluateAt(t, e, n) {
-		return this.formula?.evaluateAt(t, e, n) ?? m.BuiltIn.NA;
+		return this.formula?.evaluateAt(t, e, n) ?? I.BuiltIn.NA;
 	}
 	finalizeValue(t) {
 		return this.formula?.finalizeValue(t) ?? t;
@@ -2291,7 +2291,7 @@ var Kr = {
 	}
 	setReferenceAt(e, n, r) {
 		const o = this.ref;
-		if (n && !m.isError(n) && !("nameId" in n)) {
+		if (n && !I.isError(n) && !("nameId" in n)) {
 			const t = n, e = o.colStart, r = o.rowStart, s = t.$colStart ? t.colStart : e + t.colStart, l = t.$rowStart ? t.rowStart : r + t.rowStart, i = t.$colEnd ? t.colEnd : e + t.colEnd, a = t.$rowEnd ? t.rowEnd : r + t.rowEnd;
 			if (i < s || a < l) n = null;
 			else {
@@ -2415,7 +2415,7 @@ var Kr = {
 	}
 	_openSweep(t, e, n) {
 		const r = this._resolveBounds(t);
-		return null === r ? null : this._onRead(this._gridId, r.rowStart, r.colStart, r.rowEnd, r.colEnd, !0) ? new ro(this._onRead, this._gridId, r.rowStart, r.colStart, r.rowEnd, r.colEnd, (e ?? this._inner.getAxis?.()) === w.Axis.Column, !0 === n) : null;
+		return null === r ? null : this._onRead(this._gridId, r.rowStart, r.colStart, r.rowEnd, r.colEnd, !0) ? new ro(this._onRead, this._gridId, r.rowStart, r.colStart, r.rowEnd, r.colEnd, (e ?? this._inner.getAxis?.()) === E.Axis.Column, !0 === n) : null;
 	}
 	getValueAt(t, e) {
 		return this._onRead(this._gridId, t, e, t, e), this._inner.getValueAt(t, e);
@@ -2423,7 +2423,7 @@ var Kr = {
 	getRuns(t) {
 		const e = this._openSweep(t?.bounds, void 0, !1), n = this._inner.getRuns(t);
 		if (null === e) return n;
-		const r = this._inner.getAxis?.() === w.Axis.Column, o = {
+		const r = this._inner.getAxis?.() === E.Axis.Column, o = {
 			[Symbol.iterator]: () => o,
 			next: () => {
 				const t = n.next();
@@ -2539,13 +2539,13 @@ var Kr = {
 		return "[ReadObservedGrid]";
 	}
 }, so = Math.pow(2, 53), lo = (t, e) => !0 === t?.isPendingOverlay || !0 === t?.isWhatIfLayer ? t : e ?? null, io = class t {
-	constructor(t, e = w.Axis.Column, n) {
+	constructor(t, e = E.Axis.Column, n) {
 		this._passSeed = 0, this._passCycleId = -1, this._gridKey = 0, this._gridKeyId = null, this._onRead = null, this._dynamicRead = null, this._createSparseColumn = (t, e, n, r) => {
 			if (0 === t) return this.createRange();
 			const o = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), s = o && t > o.rowEnd + 1 ? {
 				...o,
 				rowEnd: t - 1
-			} : o, l = new N({
+			} : o, l = new F({
 				axis: this._axis,
 				maxCoords: s
 			});
@@ -2583,15 +2583,15 @@ var Kr = {
 		return this._calcScope.node ? this._container.evaluateWhatIf(t) : null;
 	}
 	async _initialize(t) {
-		const e = await Qt.assertUsable("calcs", 0), n = this._container, r = n.getRuntime();
-		this._runtime = new ne("Calculation Runtime", {
+		const e = await gt.assertUsable("calcs", 0), n = this._container, r = n.getRuntime();
+		this._runtime = new te("Calculation Runtime", {
 			isDate1904: () => r.isDate1904(),
 			isR1C1: () => r.isR1C1(),
 			getNow: () => n.getNow(),
 			getRandom: () => r.getRandom(),
 			getLocale: () => r.getLocale()
-		}, e), this._calcScope = n.getScope(), this._coerceToNumber = pe(this._runtime, E.Number, Ge);
-		const { initializeFunctions: o } = await import("./Rpi4k7hMH8wPAIcB.js"), s = this, l = Object.freeze(o(() => s, this._functionProviders)), a = new ge({
+		}, e), this._calcScope = n.getScope(), this._coerceToNumber = ge(this._runtime, m.Number, Ge);
+		const { initializeFunctions: o } = await import("./BSNegq0YcivZJmkf.js"), s = this, l = Object.freeze(o(() => s, this._functionProviders)), a = new fe({
 			transactions: t ?? new i({ transient: !0 }),
 			context: this,
 			readonlyFunctions: l,
@@ -2600,7 +2600,7 @@ var Kr = {
 		return this._functions = a, { functions: a };
 	}
 	_createScoped(e) {
-		const n = this._container, r = n.getSymbols().bind(ue.Sheet, e);
+		const n = this._container, r = n.getSymbols().bind(de.Sheet, e);
 		if (!r || !n.getGrid(r)) return null;
 		const o = new t(n, this._axis, this._functionProviders);
 		return o._runtime = this._runtime, o._functions = this._functions, o._coerceToNumber = this._coerceToNumber, o._instanceScope = this._instanceScope, o._calcScope = {
@@ -2642,7 +2642,7 @@ var Kr = {
 		}, t;
 	}
 	getFunction(t) {
-		const e = Fe(t);
+		const e = Me(t);
 		if (void 0 !== e) {
 			const t = this._functions.getByName(e);
 			if (t && !t.isLambda()) return t;
@@ -2665,42 +2665,42 @@ var Kr = {
 	getFormulaAt(t, e, n) {
 		const r = this._container;
 		let o;
-		if (this._calcScope.perCellRead = !0, o = n ? r.getSymbols().bind(ue.Sheet, n) : this._calcScope.gridId, !o) return null;
+		if (this._calcScope.perCellRead = !0, o = n ? r.getSymbols().bind(de.Sheet, n) : this._calcScope.gridId, !o) return null;
 		const s = r.getFormulas();
 		if (!s) return null;
 		ho.colStart = e, ho.rowStart = t, ho.colEnd = e, ho.rowEnd = t, ho.scope = o;
 		const l = s.search(ho);
 		return 0 === l.length ? null : l[0].value.formula.getTextAt(t, e, !1, void 0, void 0, "display") ?? null;
 	}
-	markVolatile() {
+	_markVolatile() {
 		const t = this._container.getVolatiles();
 		if (!t) return;
 		const e = this._calcScope.node;
 		t.add(e), e.state |= Hn;
 	}
 	defer(t, e) {
-		if ("function" != typeof t) throw new m.Value("defer needs an executor function");
+		if ("function" != typeof t) throw new I.Value("defer needs an executor function");
 		const n = this._container.getDeferred?.();
-		if (n) return R(n.defer(t, e, ft(), be())), n.previous;
-		R(null);
+		if (n) return N(n.defer(t, e, ft(), Ce())), n.previous;
+		N(null);
 	}
 	formatResults(t) {
 		const e = this._calcScope.node;
 		e && (e.numFmt = t);
 	}
 	filterHidden(t, e) {
-		if (!(t?.isIReferenceRange && t instanceof pt)) return t;
+		if (!(t?.isIReferenceRange && t instanceof mt)) return t;
 		const n = t.getCoords(), r = this._gridIdOf(n), o = r ? this._container.getGrid(r) : null;
 		if (!o) return t;
 		if (e?.onlyWhileFiltered && !o.isFiltered()) return t;
-		const s = e?.axes, l = s !== w.AxisSelection.Column ? o.getHiddenSkip(w.Axis.Row, n.rowStart, n.rowEnd) : null, i = s === w.AxisSelection.Column || s === w.AxisSelection.Both ? o.getHiddenSkip(w.Axis.Column, n.colStart, n.colEnd) : null;
+		const s = e?.axes, l = s !== E.AxisSelection.Column ? o.getHiddenSkip(E.Axis.Row, n.rowStart, n.rowEnd) : null, i = s === E.AxisSelection.Column || s === E.AxisSelection.Both ? o.getHiddenSkip(E.Axis.Column, n.colStart, n.colEnd) : null;
 		return l || i ? t.clone({
 			processRowSkip: l ?? void 0,
 			processColumnSkip: i ?? void 0
 		}) : t;
 	}
 	_gridIdOf(t) {
-		return t.scope ? this._container.getSymbols().bind(ue.Sheet, t.scope) : this._calcScope.gridId;
+		return t.scope ? this._container.getSymbols().bind(de.Sheet, t.scope) : this._calcScope.gridId;
 	}
 	filterTotals(t) {
 		const e = t;
@@ -2744,7 +2744,7 @@ var Kr = {
 			const n = t?.getCoords()?.scope;
 			if (n) e = n;
 			else {
-				const t = this._container.getSymbols().resolve(ue.Sheet, this._calcScope.gridId);
+				const t = this._container.getSymbols().resolve(de.Sheet, this._calcScope.gridId);
 				e = t ? t.getName ? t.getName() ?? void 0 : t.toString() : void 0;
 			}
 		}
@@ -2765,7 +2765,7 @@ var Kr = {
 	}
 	getDateParts(t, e) {
 		const n = u(t, this.getRuntime().isDate1904(), e);
-		if (null === n) throw m.BuiltIn.Num;
+		if (null === n) throw I.BuiltIn.Num;
 		return n;
 	}
 	getSerialDate(t, e, n, r = 0, o = 0, s = 0, l = 0) {
@@ -2794,18 +2794,18 @@ var Kr = {
 			const r = t.gridId;
 			if (r !== this._gridKeyId) {
 				this._gridKeyId = r;
-				const t = null === r ? null : this._container.getSymbols().resolve(ue.Sheet, r), n = t?.getName ? t.getName() : null;
+				const t = null === r ? null : this._container.getSymbols().resolve(de.Sheet, r), n = t?.getName ? t.getName() : null;
 				this._gridKey = n ? e(n) : 0;
 			}
 		}
 		return s(this._passSeed, this._gridKey, t.rowIndex, t.colIndex, n);
 	}
 	compare(t, e, n) {
-		return kt.compare(t, e, this.getRuntime().getLocaleProfile(), n);
+		return Nt.compare(t, e, this.getRuntime().getLocaleProfile(), n);
 	}
 	_fromTuples(t, e = null, n = !1, r = !1) {
 		if (!t) return null;
-		const o = le(t.bounds, !0), s = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), l = new N({
+		const o = oe(t.bounds, !0), s = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), l = new F({
 			axis: this._axis,
 			maxCoords: s
 		});
@@ -2817,14 +2817,14 @@ var Kr = {
 		const s = this._container, l = this._calcScope;
 		let i, a;
 		if (n) {
-			if (i = s.getSymbols().bind(ue.Sheet, n), Q(i)) return m.BuiltIn.Ref;
+			if (i = s.getSymbols().bind(de.Sheet, n), tt(i)) return I.BuiltIn.Ref;
 		} else i = l.gridId;
-		if (!i) return m.BuiltIn.Ref;
-		const c = l.node, d = c ? en(c) : r.EmptyArray, h = d.length;
+		if (!i) return I.BuiltIn.Ref;
+		const c = l.node, d = c ? an(c) : r.EmptyArray, h = d.length;
 		for (let n = 0; n < h; n++) {
 			const r = d[n];
 			if (!r) continue;
-			if (m.isError(r)) continue;
+			if (I.isError(r)) continue;
 			const s = r;
 			if (t < s.rowStart || t > s.rowEnd) continue;
 			if (e < s.colStart || e > s.colEnd) continue;
@@ -2836,12 +2836,12 @@ var Kr = {
 			} else a = l;
 			break;
 		}
-		return void 0 === a && (this._onRead?.(i, t, e, t, e), a = s.getGridValues(i)?.getValueAt(t, e) ?? null, s.getDeferred?.()?.hasHolders() && (a = At(a))), o && o.type, a;
+		return void 0 === a && (this._onRead?.(i, t, e, t, e), a = s.getGridValues(i)?.getValueAt(t, e) ?? null, s.getDeferred?.()?.hasHolders() && (a = ct(a))), o && o.type, a;
 	}
 	getSpillAt(t, e, n) {
 		const r = this._container, o = this._calcScope;
 		let s;
-		s = n ? r.getSymbols().bind(ue.Sheet, n) : o.gridId;
+		s = n ? r.getSymbols().bind(de.Sheet, n) : o.gridId;
 		const l = s === o.gridId ? null : s, i = r.getIncrementalUpdates(s)?.spillSpatial ?? r.getGrid(s)?.getSpills();
 		if (i) {
 			uo.rowStart = t, uo.colStart = e, uo.rowEnd = t, uo.colEnd = e, uo.scope = s;
@@ -2871,7 +2871,7 @@ var Kr = {
 			...r,
 			rowEnd: Math.max(r.rowEnd, t - 1),
 			colEnd: Math.max(r.colEnd, e - 1)
-		} : r, s = new N({
+		} : r, s = new F({
 			axis: this._axis,
 			maxCoords: o
 		});
@@ -2917,12 +2917,12 @@ var Kr = {
 		}
 		if (Array.isArray(t[0])) r = t;
 		else {
-			if (t[0]?.isIRange) throw m.BuiltIn.Value;
+			if (t[0]?.isIRange) throw I.BuiltIn.Value;
 			r = [t];
 		}
-		const l = this._axis, i = l === w.Axis.Column, a = this._fromTuples(O(r, i, De(0, 0, void 0, void 0, i), !0), e, n, !s);
+		const l = this._axis, i = l === E.Axis.Column, a = this._fromTuples($(r, i, Fe(0, 0, void 0, void 0, i), !0), e, n, !s);
 		if (a) return a;
-		const c = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), d = new N({
+		const c = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), d = new F({
 			axis: l,
 			maxCoords: c
 		}), h = e ? { type: e } : void 0;
@@ -2945,7 +2945,7 @@ var Kr = {
 		return t.firstCell = !1, e;
 	}
 	getReference(t, e) {
-		if (!t) throw m.BuiltIn.Ref;
+		if (!t) throw I.BuiltIn.Ref;
 		const n = this._calcScope, r = this._container;
 		let o = n.gridId, s = r.getGrid(o);
 		const l = s?.getShadowOf();
@@ -2958,13 +2958,13 @@ var Kr = {
 			const r = i?.();
 			let o;
 			try {
-				let n = Ot(t, r, y, () => {
-					throw m.BuiltIn.Ref;
+				let n = Pt(t, r, x, () => {
+					throw I.BuiltIn.Ref;
 				}, e);
-				if (n.length > 1) throw m.BuiltIn.Ref;
+				if (n.length > 1) throw I.BuiltIn.Ref;
 				o = n[0];
 			} catch (t) {
-				throw m.BuiltIn.Ref;
+				throw I.BuiltIn.Ref;
 			}
 			if (e) {
 				const t = n.rowIndex, e = n.colIndex;
@@ -2974,7 +2974,7 @@ var Kr = {
 					colStart: o.$colStart ? o.colStart : o.colStart + e,
 					colEnd: o.$colEnd ? o.colEnd : o.colEnd + e,
 					scope: o.scope
-				}, o.rowStart < 0 || o.colStart < 0 || o.rowEnd < 0 || o.colEnd < 0 || r && (o.rowEnd > r.rowEnd || o.colEnd > r.colEnd)) throw m.BuiltIn.Ref;
+				}, o.rowStart < 0 || o.colStart < 0 || o.rowEnd < 0 || o.colEnd < 0 || r && (o.rowEnd > r.rowEnd || o.colEnd > r.colEnd)) throw I.BuiltIn.Ref;
 			}
 			o.rowStart > o.rowEnd && (o = {
 				...o,
@@ -2991,13 +2991,13 @@ var Kr = {
 			colEnd: n.colIndex,
 			rowEnd: n.rowIndex
 		});
-		if (!t) throw m.BuiltIn.Ref;
+		if (!t) throw I.BuiltIn.Ref;
 		let a = t.scope;
 		if (a) {
-			if (a = r.getSymbols().bind(ue.Sheet, t.scope), !a) return m.BuiltIn.Ref;
+			if (a = r.getSymbols().bind(de.Sheet, t.scope), !a) return I.BuiltIn.Ref;
 			const e = r.getSheetSpanIds?.(a) ?? null;
 			if (e) {
-				if (r.isGridless?.(e[0]) || r.isGridless?.(e[e.length - 1])) return m.BuiltIn.Name;
+				if (r.isGridless?.(e[0]) || r.isGridless?.(e[e.length - 1])) return I.BuiltIn.Name;
 				const n = [];
 				for (let r = 0; r < e.length; r++) n.push(this.getReference(ao(t, e[r])));
 				return n.isSheetSpan = !0, n;
@@ -3011,13 +3011,13 @@ var Kr = {
 					scope: a
 				};
 				if (r.isGridless?.(a)) {
-					const t = new N({ axis: this._axis });
+					const t = new F({ axis: this._axis });
 					return this._toReference(t, e, void 0, a, !1, null);
 				}
 				t = e;
 			}
 			if (a !== o) {
-				if (o = a, s = r.getGrid(o), !s) return m.BuiltIn.Ref;
+				if (o = a, s = r.getGrid(o), !s) return I.BuiltIn.Ref;
 				i = s?.getEntireCoords.bind(s);
 			}
 		}
@@ -3025,19 +3025,19 @@ var Kr = {
 		let d;
 		const h = n.node;
 		let u = -1;
-		if (h && (u = co(en(h), t)), -1 !== u) {
+		if (h && (u = co(an(h), t)), -1 !== u) {
 			const e = zn(h, u);
 			if (null != e && e.isIReferenceRange) d = e;
 			else if (void 0 === e || c.isPendingOverlay) d = this._toReference(c, t, i, o, !1, lo(c, s));
 			else {
 				let n = e;
 				null !== n && n.isIRange && (n = n.getValueAt(0, 0));
-				const r = new N({
+				const r = new F({
 					axis: this._axis,
 					maxCoords: i?.()
 				});
 				if (null !== n) {
-					const e = this._axis === w.Axis.Column, o = e ? t.colStart : t.rowStart, s = e ? t.rowStart : t.colStart;
+					const e = this._axis === E.Axis.Column, o = e ? t.colStart : t.rowStart, s = e ? t.rowStart : t.colStart;
 					r.setValues([[o, [[s, [n]]]]]);
 				}
 				d = this._toReference(r, t, i, o, !1, null);
@@ -3054,7 +3054,7 @@ var Kr = {
 	_expandSheetSpan(t) {
 		if (null === t || "object" != typeof t || !0 === t.isIRange) return null;
 		const e = t;
-		if (void 0 === e.colStart || !Q(e.scope)) return null;
+		if (void 0 === e.colStart || !tt(e.scope)) return null;
 		const n = this._container, r = n.getSheetSpanIds?.(e.scope) ?? null;
 		if (!r) return null;
 		if (n.isGridless?.(r[0]) || n.isGridless?.(r[r.length - 1])) return null;
@@ -3076,43 +3076,43 @@ var Kr = {
 		const i = this._onRead ?? (s ? this._dynamicRead : null);
 		i && (t = new oo(t, o, i));
 		try {
-			const n = new pt(this._runtime, t, e, void 0, r, this._container.resolveScope);
+			const n = new mt(this._runtime, t, e, void 0, r, this._container.resolveScope);
 			return n._setCoordsReadHook(this._positionRead), null !== l && n._setErrorIndex(null === i ? l : { hasErrorIn: (t) => (i(o, t.rowStart, t.colStart, t.rowEnd, t.colEnd), l.hasErrorIn(t)) }), n;
 		} catch (t) {
-			if (t instanceof n) throw m.BuiltIn.Ref;
+			if (t instanceof n) throw I.BuiltIn.Ref;
 			throw t;
 		}
 	}
 	getAddress(t, e = !1) {
 		t || (this._calcScope.positionRead = !0, _o.rowIndex = this._calcScope.rowIndex, _o.colIndex = this._calcScope.colIndex, _o.scope = null, t = _o);
 		const n = this.getEntireCoords().scope;
-		return void 0 !== t.colIndex ? we(t, n, e) : ye(t, n, e);
+		return void 0 !== t.colIndex ? Se(t, n, e) : Ie(t, n, e);
 	}
 	parseAsSerialDate(t, e) {
 		if (void 0 === t) return;
 		if ("number" == typeof t) return t;
-		if (m.isError(t)) throw t;
-		if ("string" != typeof t) throw m.BuiltIn.Value;
+		if (I.isError(t)) throw t;
+		if ("string" != typeof t) throw I.BuiltIn.Value;
 		const n = g(this._runtime, t, e);
-		if (null === n) throw m.BuiltIn.Value;
+		if (null === n) throw I.BuiltIn.Value;
 		return n;
 	}
 	parseAsDate(t, e) {
 		if (void 0 !== t) {
-			if (m.isError(t)) throw t;
+			if (I.isError(t)) throw t;
 			if ("number" == typeof t) return this.fromSerialDate(t);
 			if ("string" == typeof t) return this.fromSerialDate(this.parseAsSerialDate(t, e));
 			if (t instanceof Date) return t;
-			throw m.BuiltIn.Value;
+			throw I.BuiltIn.Value;
 		}
 	}
 	parseAsNumber(t, e) {
 		if (void 0 === t) return;
 		if ("number" == typeof t) return t;
-		if (m.isError(t)) throw t;
-		if ("string" != typeof t) throw m.BuiltIn.Value;
-		const n = this._coerceToNumber(t, E.String, e);
-		if ("number" != typeof n) throw m.BuiltIn.Value;
+		if (I.isError(t)) throw t;
+		if ("string" != typeof t) throw I.BuiltIn.Value;
+		const n = this._coerceToNumber(t, m.String, e);
+		if ("number" != typeof n) throw I.BuiltIn.Value;
 		return n;
 	}
 	createCriteria(t, e) {
@@ -3129,8 +3129,8 @@ var Kr = {
 					const t = o, e = r.match;
 					return (n) => "string" == typeof n ? e === t.test(n) : !e;
 				}
-				case "=": return void 0 === o ? (t) => null == t : "" === o ? (t) => null == t || "" === t : "string" == typeof o ? (e) => "string" == typeof e && 0 === t.compare(e, o) : m.isError(o) ? (t) => !!m.isError(t) && t.equals(o) : "number" == typeof o ? (e) => "number" == typeof e ? 0 === t.compare(e, o) : "string" == typeof e && cr(t, e, o) : (t) => t === o;
-				case "<>": return void 0 === o ? (t) => null != t : "string" == typeof o ? (e) => "string" != typeof e || 0 !== t.compare(e, o) : m.isError(o) ? (t) => !m.isError(t) || !t.equals(o) : "number" == typeof o ? (e) => !("number" == typeof e && 0 === t.compare(e, o)) : (t) => t !== o;
+				case "=": return void 0 === o ? (t) => null == t : "" === o ? (t) => null == t || "" === t : "string" == typeof o ? (e) => "string" == typeof e && 0 === t.compare(e, o) : I.isError(o) ? (t) => !!I.isError(t) && t.equals(o) : "number" == typeof o ? (e) => "number" == typeof e ? 0 === t.compare(e, o) : "string" == typeof e && cr(t, e, o) : (t) => t === o;
+				case "<>": return void 0 === o ? (t) => null != t : "string" == typeof o ? (e) => "string" != typeof e || 0 !== t.compare(e, o) : I.isError(o) ? (t) => !I.isError(t) || !t.equals(o) : "number" == typeof o ? (e) => !("number" == typeof e && 0 === t.compare(e, o)) : (t) => t !== o;
 				case ">": return ar(t, o, (t) => t > 0);
 				case ">=": return ar(t, o, (t) => t >= 0);
 				case "<": return ar(t, o, (t) => t < 0);
@@ -3143,36 +3143,36 @@ var Kr = {
 		return pr.create(t, e, this._createSparseColumn, n);
 	}
 	getPivotAt(t) {
-		if (!(t instanceof pt)) return null;
+		if (!(t instanceof mt)) return null;
 		const e = t.getCoords(), n = this._gridIdOf(e), r = (n ? this._container.getGrid(n) : null)?.getPivots();
 		if (!r) return null;
 		for (let t = 0; t < r.length; t++) {
 			const n = r[t], o = n.range;
 			if (e.rowStart > o.rowEnd || e.rowEnd < o.rowStart || e.colStart > o.colEnd || e.colEnd < o.colStart) continue;
 			const s = n.block?.anchor;
-			if (!s || !n.block.blocked) return mn(n);
+			if (!s || !n.block.blocked) return He(n);
 			const l = e.rowStart <= s.row && e.rowEnd >= s.row && e.colStart <= s.column && e.colEnd >= s.column;
-			return mn(n, l ? "blocked" : "wanted");
+			return He(n, l ? "blocked" : "wanted");
 		}
 		return null;
 	}
 	parseAsLiteral(t) {
-		return H(t) ?? tt(t);
+		return K(t) ?? st(t);
 	}
 	toText(t) {
-		return Z(t, this._runtime);
+		return nt(t, this._runtime);
 	}
 	getRuntime() {
 		return this._runtime;
 	}
 	createRichData(t, e) {
-		return P.fromJSON({
+		return J.fromJSON({
 			type: t,
 			data: e
 		}, this._container.getRichDataContext?.());
 	}
 	getArgs() {
-		return S.getArgs();
+		return w.getArgs();
 	}
 	get [Symbol.toStringTag]() {
 		return "[CalculationContext]";
@@ -3194,7 +3194,7 @@ var Kr = {
 	const r = e.colStart, o = e.rowStart, s = e.colEnd, l = e.rowEnd, i = e.scope;
 	for (let e = 0; e < n; e++) {
 		const n = t[e];
-		if (null != n && !(m.isError(n) || n.colStart !== r || n.rowStart !== o || n.colEnd !== s || n.rowEnd !== l || i && n.scope !== i)) return e;
+		if (null != n && !(I.isError(n) || n.colStart !== r || n.rowStart !== o || n.colEnd !== s || n.rowEnd !== l || i && n.scope !== i)) return e;
 	}
 	return -1;
 }, ho = {
@@ -3255,9 +3255,6 @@ var Kr = {
 	formatResults(t) {
 		throw this._noCell("formatResults");
 	}
-	markVolatile() {
-		throw this._noCell("markVolatile");
-	}
 	getRandom() {
 		throw this._noCell("getRandom");
 	}
@@ -3283,7 +3280,7 @@ function mo(t, e, n, r, o, s, l, i) {
 }
 function So(t, e, n) {
 	const r = t.ref, o = t.formula, s = o ? o.getReferences(r.rowStart, r.colStart)[e] : null;
-	if (!s || "nameId" in s || "tableId" in s || m.isError(s)) return r;
+	if (!s || "nameId" in s || "tableId" in s || I.isError(s)) return r;
 	const l = s, i = mo(r.rowStart, r.rowEnd, l.rowStart, l.rowEnd, !0 === l.$rowStart, !0 === l.$rowEnd, n.rowStart, n.rowEnd);
 	if (null === i) return null;
 	const a = mo(r.colStart, r.colEnd, l.colStart, l.colEnd, !0 === l.$colStart, !0 === l.$colEnd, n.colStart, n.colEnd);
@@ -3294,7 +3291,7 @@ function So(t, e, n) {
 		colEnd: a[1]
 	};
 }
-var wo = class extends ct {
+var wo = class extends dt {
 	constructor(t) {
 		const e = (t = { ...t }).container;
 		super({
@@ -3306,11 +3303,11 @@ var wo = class extends ct {
 		if (this._getEntireCoords = o, this._unanchored = !0 === t.unanchored, this._shadowOf = t.shadowOf ?? null, this._arrayFirstCell = !0 === t.arrayFirstCell, this._paged = !0 === t.paged, !this._context || !this._container) throw new Error("Invalid Options");
 		const s = t?.onCalculated;
 		this._onCalculated = s ? (t) => {
-			s(_e(Lt.results(t, "onCalculated"), this._container.getImager(this._gridId)));
-		} : () => {}, this._values = new N({
-			axis: w.Axis.Column,
-			createRun: Qe
-		}), this._iterationId = 0, this._contentfulSpatial = new et({ updateEntryOptions: {
+			s(he(Lt.results(t, "onCalculated"), this._container.getImager(this._gridId)));
+		} : () => {}, this._values = new F({
+			axis: E.Axis.Column,
+			createRun: rn
+		}), this._iterationId = 0, this._contentfulSpatial = new rt({ updateEntryOptions: {
 			isSplitOnExpand: !0,
 			isMergeOnShift: !0
 		} });
@@ -3318,7 +3315,7 @@ var wo = class extends ct {
 			isSplitOnExpand: !0,
 			isMergeOnShift: !1
 		} };
-		this._spillSpatial = new et(l), this._errorSpatial = new et(l), this._calcStatusSpatial = new et(l), this._circularSpatial = new et(l), this._notifyValues = new et(), this._notifyBlank = null, this._notifySpillsInsert = [], this._notifySpillsRemove = [], this._notifyFormats = new et(), this._notifyCalcStatus = new et(), this._notifyCircular = new et(), this._touchedFormulas = [], this._container.registerGrid(this), this._publishMaps();
+		this._spillSpatial = new rt(l), this._errorSpatial = new rt(l), this._calcStatusSpatial = new rt(l), this._circularSpatial = new rt(l), this._notifyValues = new rt(), this._notifyBlank = null, this._notifySpillsInsert = [], this._notifySpillsRemove = [], this._notifyFormats = new rt(), this._notifyCalcStatus = new rt(), this._notifyCircular = new rt(), this._touchedFormulas = [], this._container.registerGrid(this), this._publishMaps();
 	}
 	_land(t, e) {
 		return this._container.landRequest(t, () => (void 0 !== t && this._versionMaps(t), e()));
@@ -3444,7 +3441,7 @@ var wo = class extends ct {
 					cycleId: this._container.getCycleId(),
 					commitId: t.commitId
 				};
-				const r = k(t.destination, t.coords, t.fitDestination, t.transpose);
+				const r = M(t.destination, t.coords, t.fitDestination, t.transpose);
 				return r.scope = this._gridId, this._land(e, () => {
 					t.isCut ? this._moveTo(n, t.coords, r) : this._copyTo(n, t.coords, r);
 					const e = this._mutationResults(t.commitId);
@@ -3483,7 +3480,7 @@ var wo = class extends ct {
 				const o = this._container.getHeldCloneKey?.() ?? t.options?.cloneKey ?? null;
 				return this._land(e, () => this._setPivotsNow(r, o)), this._notifyCalculated(this._container.getCycleId(), !1, n ? null : t.options?.commitId);
 			}
-			case "setReference": return this._setReferenceNow(t.row, t.column, t.index, "#REF!" === t.precedent ? m.BuiltIn.Ref : t.precedent);
+			case "setReference": return this._setReferenceNow(t.row, t.column, t.index, "#REF!" === t.precedent ? I.BuiltIn.Ref : t.precedent);
 			case "setReferenceMode": return this._setReferenceModeNow(t.row, t.column, t.index, t.side, t.mode);
 			case "toJSON": return {
 				cycleId: this._container.getCycleId(),
@@ -3569,8 +3566,8 @@ var wo = class extends ct {
 	_shiftNow(t) {
 		const e = this, n = this.getId(), r = { ...t };
 		r.range = { ...r.range }, r.range.scope = n, delete r.onShift;
-		const o = e._values, s = r.range, l = r.direction, i = l === w.Direction.Left || l === w.Direction.Right, a = l === w.Direction.Down || l === w.Direction.Right, c = a ? 1 : -1, d = e._spillSpatial, h = e._contentfulSpatial;
-		lt(d, s, i, a);
+		const o = e._values, s = r.range, l = r.direction, i = l === E.Direction.Left || l === E.Direction.Right, a = l === E.Direction.Down || l === E.Direction.Right, c = a ? 1 : -1, d = e._spillSpatial, h = e._contentfulSpatial;
+		at(d, s, i, a);
 		const u = [], _ = this._container.getPrecedents().search(s), f = Kt(s, d, o, h, void 0, !1, !1, void 0, (t, e, r, o) => {
 			u.push({
 				colStart: t,
@@ -3583,13 +3580,13 @@ var wo = class extends ct {
 		o.shift(r.range, r.direction), r.onUpdates = (t, n) => {
 			e._notifySpillsRemove.push(...n), e._notifySpillsInsert.push(...t);
 		}, e._spillSpatial = d.shift(r), delete r.onUpdates, e._contentfulSpatial = h.shift(r), e._errorSpatial = e._errorSpatial.shift(r), e._calcStatusSpatial = e._calcStatusSpatial.shift(r);
-		const g = e._container, p = g.getFormulas().clone(), m = g.getPrecedents().clone(), S = this.getEntireCoords(), E = {
+		const g = e._container, p = g.getFormulas().clone(), m = g.getPrecedents().clone(), S = this.getEntireCoords(), w = {
 			colStart: s.colStart,
 			rowStart: s.rowStart,
 			colEnd: i && 1 === c ? S.colEnd : s.colEnd,
 			rowEnd: i || 1 !== c ? s.rowEnd : S.rowEnd,
 			scope: n
-		}, I = a ? St(m, E) : G(m, s);
+		}, I = a ? St(m, w) : O(m, s);
 		I && (Po(p, m, I.formulas.inserts, I.formulas.removes), e._touchFormulas(I.formulas.removes), e._touchFormulas(I.formulas.inserts));
 		const y = i ? s.colEnd - s.colStart + 1 : s.rowEnd - s.rowStart + 1, v = y * c, x = {
 			colStart: s.colStart,
@@ -3599,7 +3596,7 @@ var wo = class extends ct {
 			scope: n
 		};
 		let C;
-		const b = Vt(() => m, () => {
+		const b = Ot(() => m, () => {
 			const t = g.getDynamics();
 			return C = new Map(t), C;
 		}, x, {
@@ -3607,10 +3604,10 @@ var wo = class extends ct {
 			rowIndex: i ? 0 : v,
 			scope: n
 		}, a ? void 0 : s);
-		let A, R;
+		let R, A;
 		b && (Po(p, m, b.formulas.inserts, b.formulas.removes), e._touchFormulas(b.formulas.removes), e._touchFormulas(b.formulas.inserts)), r.onUpdates = (t, e) => {
-			A = t, R = e;
-		}, p.shift(r), (A || R) && (Lo(m, A, R), e._touchFormulas(R), e._touchFormulas(A)), g.setFormulas(p), g.setPrecedents(m), C && g.setDynamics(C), g.bumpCalcEpochs(!0), f?.(a, i ? 0 : v, i ? v : 0);
+			R = t, A = e;
+		}, p.shift(r), (R || A) && (Lo(m, R, A), e._touchFormulas(A), e._touchFormulas(R)), g.setFormulas(p), g.setPrecedents(m), C && g.setDynamics(C), g.bumpCalcEpochs(!0), f?.(a, i ? 0 : v, i ? v : 0);
 		const k = i ? s.colStart : s.rowStart, N = i ? s.colEnd : s.rowEnd, M = (t, e = t.ref) => {
 			const r = t.gridId;
 			r && g.getGrid(r) && (t.unanchored ? g.invalidateNamed(r) : ((t, e) => {
@@ -3645,8 +3642,8 @@ var wo = class extends ct {
 			const e = D[t];
 			e.scope !== n && M(e.value);
 		}
-		for (let t = 0; t < (A?.length ?? 0); t++) {
-			const e = A[t];
+		for (let t = 0; t < (R?.length ?? 0); t++) {
+			const e = R[t];
 			e.value.positionRead && u.push({
 				colStart: e.colStart,
 				rowStart: e.rowStart,
@@ -3691,9 +3688,9 @@ var wo = class extends ct {
 			let h = c;
 			for (let r = 0; r < d.length; r++) {
 				const o = d[r];
-				if (!ke(o)) continue;
+				if (!Ae(o)) continue;
 				let s = l.get(o);
-				void 0 === s && (s = M(o, t, e, n) ?? null, l.set(o, s)), null !== s && (h = h.replaceScopeIds(o, s));
+				void 0 === s && (s = D(o, t, e, n) ?? null, l.set(o, s)), null !== s && (h = h.replaceScopeIds(o, s));
 			}
 			h !== c && (i.push(o), a.push({
 				...o,
@@ -3788,7 +3785,7 @@ var wo = class extends ct {
 		this._container.markDirty(n);
 	}
 	getHiddenRuns(t) {
-		return t === w.Axis.Column ? this._hiddenColumns : this._hiddenRows;
+		return t === E.Axis.Column ? this._hiddenColumns : this._hiddenRows;
 	}
 	isFiltered() {
 		return this._filtered;
@@ -3809,14 +3806,14 @@ var wo = class extends ct {
 		l || (l = /* @__PURE__ */ new Map(), Eo.set(r, l));
 		let i = l.get(e);
 		if (!i) {
-			const t = rt(r);
+			const t = B(r);
 			i = 0 === e ? t : (n, r) => t(n + e, r) - e, l.set(e, i);
 		}
 		return i;
 	}
 	_setHiddenNow(t, e) {
 		const n = e.length > 0 ? e : null;
-		t === w.Axis.Column ? this._hiddenColumns = n : this._hiddenRows = n, this._publishMaps(), this._markTotals();
+		t === E.Axis.Column ? this._hiddenColumns = n : this._hiddenRows = n, this._publishMaps(), this._markTotals();
 	}
 	_setFilteredNow(t) {
 		this._filtered = t, this._publishMaps(), this._markTotals();
@@ -3840,7 +3837,7 @@ var wo = class extends ct {
 				columns: e.anchor.column - n.colStart
 			}, i = {
 				...n,
-				value: new x(n, l, "pivot", s)
+				value: new Yt(n, l, "pivot", s)
 			};
 			o.insert(i), this._notifySpillsInsert.push(i);
 		}
@@ -3965,7 +3962,7 @@ var wo = class extends ct {
 			}
 			this._pushWithSpills(h, w);
 		}
-		return h = oe(h, 2, t.Row), h.sort(o.rowFirstRangeComparator), h;
+		return h = ne(h, 2, t.Row), h.sort(o.rowFirstRangeComparator), h;
 	}
 	_pushWithSpills(t, e) {
 		t.push(e);
@@ -4022,7 +4019,7 @@ var wo = class extends ct {
 			for (let t = 0; t < a.length; t++) {
 				const e = a[t];
 				if (void 0 === e?.colStart) continue;
-				const n = e.scope, o = _(n), s = vt(e, r.rowStart + I, r.colStart + y), l = vt(e, r.rowStart + v, r.colStart + x), i = {
+				const n = e.scope, o = _(n), s = xt(e, r.rowStart + I, r.colStart + y), l = xt(e, r.rowStart + v, r.colStart + x), i = {
 					colStart: Math.max(Math.min(s.colStart, l.colStart), o.colStart),
 					rowStart: Math.max(Math.min(s.rowStart, l.rowStart), o.rowStart),
 					colEnd: Math.min(Math.max(s.colEnd, l.colEnd), o.colEnd),
@@ -4033,7 +4030,7 @@ var wo = class extends ct {
 			}
 			f.push(...C);
 		}
-		return f = oe(f, 2, t.Row), f.sort(o.rowFirstRangeComparator), f;
+		return f = ne(f, 2, t.Row), f.sort(o.rowFirstRangeComparator), f;
 	}
 	_directAcrossGrids(t, e) {
 		const n = this._gridId, o = t.scope, s = o && o !== n ? this._container.getGrid(o) ?? null : this;
@@ -4054,11 +4051,11 @@ var wo = class extends ct {
 		return i;
 	}
 	getDependentsAt(t) {
-		const e = It(t, (t) => this._directAcrossGrids(t, !0));
+		const e = Rt(t, (t) => this._directAcrossGrids(t, !0));
 		return e.sort(o.rowFirstRangeComparator), e;
 	}
 	getPrecedentsAt(t) {
-		const e = It(t, (t) => this._directAcrossGrids(t, !1));
+		const e = Rt(t, (t) => this._directAcrossGrids(t, !1));
 		return e.sort(o.rowFirstRangeComparator), e;
 	}
 	_graphNeighborsNow(t, e, n) {
@@ -4169,16 +4166,16 @@ var wo = class extends ct {
 		if ("scalar" === o) {
 			let o = t.evaluateAt(e, n, r);
 			if (o && void 0 !== o.colStart) o = t.finalizeValue(o);
-			else if (q(o)) return t.finalizeValue(o);
-			const s = Pt(o, this._context);
+			else if (X(o)) return t.finalizeValue(o);
+			const s = zt(o, this._context);
 			return null === s ? 0 : s;
 		}
-		return tn(t.finalizeValue(t.evaluateAt(e, n, r)));
+		return ln(t.finalizeValue(t.evaluateAt(e, n, r)));
 	}
 	_setReferenceNow(t, e, n, r) {
 		const o = this._formulaAt(t, e);
 		let s = r;
-		r && void 0 !== r.colStart ? s = D(s, t, e) : r && void 0 !== r.colIndex && (s = F(s, t, e));
+		r && void 0 !== r.colStart ? s = G(s, t, e) : r && void 0 !== r.colIndex && (s = T(s, t, e));
 		const l = o.value.formula.setReferenceAt(n, s).getTextAt(t, e);
 		return this._land(void 0, () => {
 			l ? this._setInputsNow(null, [{
@@ -4210,8 +4207,8 @@ var wo = class extends ct {
 		return null !== o && 0 !== (o.state & Hn);
 	}
 	_formulaAt(t, e) {
-		Ro.colStart = e, Ro.rowStart = t, Ro.colEnd = e, Ro.rowEnd = t, Ro.scope = this._gridId, Fo.length = 0;
-		const n = this._container.getFormulas().search(Ro, !1, !1, Fo);
+		Ao.colStart = e, Ao.rowStart = t, Ao.colEnd = e, Ao.rowEnd = t, Ao.scope = this._gridId, Fo.length = 0;
+		const n = this._container.getFormulas().search(Ao, !1, !1, Fo);
 		return 0 === n.length ? null : n[0];
 	}
 	_createCopySpillEntries(t, e, n, r, o) {
@@ -4234,7 +4231,7 @@ var wo = class extends ct {
 				rowStart: u,
 				colEnd: o,
 				rowEnd: f,
-				value: new x(g, 0, e.value.getKind())
+				value: new Yt(g, 0, e.value.getKind())
 			});
 		}
 		return {
@@ -4247,7 +4244,7 @@ var wo = class extends ct {
 		if (0 === o) return;
 		const s = this._container, l = n ?? this._gridId, i = null != n ? l : e ?? l, a = s.getScope();
 		a.gridId = i;
-		const c = e ? s.getSymbols().resolve(ue.Sheet, e)?.toString() : void 0, d = this._context;
+		const c = e ? s.getSymbols().resolve(de.Sheet, e)?.toString() : void 0, d = this._context;
 		for (let n = 0; n < o; n++) {
 			const o = t[n], h = o.value, u = h.ref, _ = h.formula.getTextAt(u.rowStart, u.colStart);
 			a.colIndex = u.colStart, a.rowIndex = u.rowStart;
@@ -4307,7 +4304,7 @@ var wo = class extends ct {
 		this._removeNow(n);
 		const a = this._container, c = a.getPrecedents().clone(), d = a.getFormulas().clone();
 		a.setPrecedents(c), a.setFormulas(d);
-		const h = re(c, e, n);
+		const h = ee(c, e, n);
 		h && (Po(d, c, h.formulas.inserts, h.formulas.removes), this._touchFormulas(h.formulas.removes), this._touchFormulas(h.formulas.inserts));
 		const u = { cutFrom: e }, _ = i.createCopiedEntries(e, n, u).inserts, f = _.length, g = this._gridId;
 		if (g !== l) {
@@ -4318,7 +4315,7 @@ var wo = class extends ct {
 				const f = h ? h.length : 0;
 				for (let n = 0; n < f; n++) {
 					const s = h[n];
-					if (m.isError(s)) {
+					if (I.isError(s)) {
 						u = !1;
 						break;
 					}
@@ -4355,13 +4352,13 @@ var wo = class extends ct {
 		}
 		let p;
 		Po(d, c, _), this._touchFormulas(_);
-		const S = Ve(c, () => {
+		const m = Ve(c, () => {
 			const t = a.getDynamics();
 			return p = new Map(t), p;
 		}, e, n);
-		if (p && a.setDynamics(p), S) {
-			const t = S.edged ?? r.EmptyArray, o = t.length > 0 ? S.formulas.inserts.filter((e) => !t.includes(e)) : S.formulas.inserts;
-			if (e.scope !== n.scope && o.length > 0 && this._reanchorFormulas(o, n.scope, e.scope, !0), Po(d, c, S.formulas.inserts, S.formulas.removes), this._touchFormulas(S.formulas.removes), this._touchFormulas(S.formulas.inserts), t.length > 0) {
+		if (p && a.setDynamics(p), m) {
+			const t = m.edged ?? r.EmptyArray, o = t.length > 0 ? m.formulas.inserts.filter((e) => !t.includes(e)) : m.formulas.inserts;
+			if (e.scope !== n.scope && o.length > 0 && this._reanchorFormulas(o, n.scope, e.scope, !0), Po(d, c, m.formulas.inserts, m.formulas.removes), this._touchFormulas(m.formulas.removes), this._touchFormulas(m.formulas.inserts), t.length > 0) {
 				const e = [];
 				for (let n = 0; n < t.length; n++) {
 					const r = t[n].value;
@@ -4373,16 +4370,16 @@ var wo = class extends ct {
 				a.markDirty(e);
 			}
 		}
-		const E = this._values;
-		t.values.copyTo(E, {
+		const S = this._values;
+		t.values.copyTo(S, {
 			colIndex: n.colStart,
 			rowIndex: n.rowStart
-		}, e), Ae(this._errorSpatial, E, n);
-		const I = t.spillSpatial;
+		}, e), be(this._errorSpatial, S, n);
+		const w = t.spillSpatial;
 		let y = [], v = [];
 		for (let t = 0; t < f; t++) {
 			const n = _[t];
-			this._createCopySpillEntries(I, e, n, y, v);
+			this._createCopySpillEntries(w, e, n, y, v);
 		}
 		const x = [];
 		if (y.length > 0) {
@@ -4390,7 +4387,7 @@ var wo = class extends ct {
 			const t = (t, e) => {
 				t && this._notifySpillsInsert.push(t), e && this._notifySpillsRemove.push(e);
 			};
-			$(a.getCycleId(), v, r.EmptyArray, s._contentfulSpatial, s._spillSpatial, s._values, (t, e, n, r) => {
+			Ct(a.getCycleId(), v, r.EmptyArray, s._contentfulSpatial, s._spillSpatial, s._values, (t, e, n, r) => {
 				x.push({
 					colStart: t,
 					rowStart: e,
@@ -4398,7 +4395,7 @@ var wo = class extends ct {
 					rowEnd: r,
 					scope: g
 				});
-			}, s._notifyValues, t, s._notifyCalcStatus, s._errorSpatial, s._values.getAxis() !== w.Axis.Row, !1, s._circularSpatial);
+			}, s._notifyValues, t, s._notifyCalcStatus, s._errorSpatial, s._values.getAxis() !== E.Axis.Row, !1, s._circularSpatial);
 		}
 		const C = this.getEntireCoords();
 		a.markDirty([{
@@ -4436,9 +4433,9 @@ var wo = class extends ct {
 				}
 			}
 			e && (t = i.concat(e)), t.sort(o.columnFirstRangeComparator);
-			const n = new L.Builder((t, e) => new V.ArrayList(t.slice(0, e)));
+			const n = new j.Builder((t, e) => new L.ArrayList(t.slice(0, e)));
 			let r;
-			const s = !0 === this._container.getDeferred?.()?.hasHolders(), a = this._values, c = a.getAxis() === w.Axis.Column, d = t.length;
+			const s = !0 === this._container.getDeferred?.()?.hasHolders(), a = this._values, c = a.getAxis() === E.Axis.Column, d = t.length;
 			for (let e = 0; e < d; e++) {
 				const l = t[e];
 				f = o.unionRanges(f, l, xo);
@@ -4523,19 +4520,19 @@ var wo = class extends ct {
 			}
 			p && (_.spillRemoves = p, f = o.unionRangesArrays(p, f ?? void 0, xo));
 		}
-		const E = d.length;
-		if (E > 0) {
+		const w = d.length;
+		if (w > 0) {
 			const e = this._spillSpatial;
 			let n;
-			for (let r = E - 1; r >= 0; r--) {
+			for (let r = w - 1; r >= 0; r--) {
 				const o = d[r], l = o.value;
 				if (!s && l.getCycleId() !== t) continue;
 				const i = e.search(o), a = i.length;
 				for (let e = 0; e < a; e++) {
 					let r = i[e];
-					if (Y(o.rowStart, o.colStart, r) && (s || r.value.getCycleId() === t)) {
+					if (et(o.rowStart, o.colStart, r) && (s || r.value.getCycleId() === t)) {
 						m || (m = [], n = /* @__PURE__ */ new Set());
-						const t = Ie(r.colStart) + _t(r.rowStart);
+						const t = Ee(r.colStart) + _t(r.rowStart);
 						if (n.has(t)) continue;
 						n.add(t);
 						const e = r.value.getBlockedCoords() ?? o;
@@ -4565,19 +4562,19 @@ var wo = class extends ct {
 	_setInputsNow(t, e, n, s) {
 		const l = this._gridId, i = this._container, a = this._context, c = i.getFormulas(), d = c.getSpatialAt(l);
 		let h = !!d && !d.isEmpty();
-		const u = e ? e.length : 0, _ = this._values, f = _.getAxis() !== w.Axis.Row, g = this._spillSpatial, p = this._errorSpatial, m = this._notifyCalcStatus.size(), S = this._contentfulSpatial, E = [];
+		const u = e ? e.length : 0, _ = this._values, f = _.getAxis() !== E.Axis.Row, g = this._spillSpatial, p = this._errorSpatial, m = this._notifyCalcStatus.size(), S = this._contentfulSpatial, w = [];
 		let I, y, v, x = h ? [] : null;
 		if (t && t.tuples) {
 			I = t.tuples;
 			let e = t.bounds;
-			if (e ? (y = le(e, f), y.scope = l) : y = {
+			if (e ? (y = oe(e, f), y.scope = l) : y = {
 				colStart: Number.MIN_SAFE_INTEGER,
 				rowStart: Number.MIN_SAFE_INTEGER,
 				colEnd: Number.MAX_SAFE_INTEGER,
 				rowEnd: Number.MAX_SAFE_INTEGER,
 				scope: l
 			}, x) {
-				h && E.push(y);
+				h && w.push(y);
 				const t = {
 					majorStart: 0,
 					minorStart: 0,
@@ -4593,12 +4590,12 @@ var wo = class extends ct {
 						t.minorStart = n[0];
 						const r = n[1];
 						t.minorEnd = t.minorStart + r.length - 1;
-						const s = le(t, f);
+						const s = oe(t, f);
 						s.scope = l, x && c.search(s).length > 0 && x.push(s);
 					}
 				}
 			}
-			v = ie(t.tuples, f, l);
+			v = se(t.tuples, f, l);
 		}
 		const C = (t, e) => {
 			t && this._notifySpillsInsert.push(t), e && this._notifySpillsRemove.push(e);
@@ -4606,30 +4603,30 @@ var wo = class extends ct {
 		if (n || I) {
 			let t;
 			n && (t = Kt(n, g, _, S, C, !1, !0, this._notifyValues, (t, e, n, r) => {
-				E.push({
+				w.push({
 					colStart: t,
 					rowStart: e,
 					colEnd: n,
 					rowEnd: r,
 					scope: l
 				});
-			})), $(-1, n ? [n] : r.EmptyArray, v, S, g, _, (t, e, n, r) => {
-				E.push({
+			})), Ct(-1, n ? [n] : r.EmptyArray, v, S, g, _, (t, e, n, r) => {
+				w.push({
 					colStart: t,
 					rowStart: e,
 					colEnd: n,
 					rowEnd: r,
 					scope: l
 				});
-			}, this._notifyValues, C, this._notifyCalcStatus, p, f, !1, this._circularSpatial, this._calcStatusSpatial), n && (_.delete(n), Ht(p, n)), t?.(), I && (_.setValues(I), zt(p, I, f));
+			}, this._notifyValues, C, this._notifyCalcStatus, p, f, !1, this._circularSpatial, this._calcStatusSpatial), n && (_.delete(n), Ht(p, n)), t?.(), I && (_.setValues(I), xe(p, I, f));
 		}
 		const b = i.getScope();
-		let A, R, k, N, M;
+		let R, A, k, N, M;
 		const F = (t, e) => {
 			const n = t.rowStart, r = t.colStart;
 			b && (b.rowIndex = n, b.colIndex = r);
 			const o = i.createFormulaBlock(l, a, e, n, r), c = new no(t, l, o, i, this._unanchored), d = s?.arrayFixed;
-			d && d.colStart === r && d.rowStart === n && (Ze(c.getAnchorNode()).fixedRef = {
+			d && d.colStart === r && d.rowStart === n && (sn(c.getAnchorNode()).fixedRef = {
 				colStart: d.colStart,
 				rowStart: d.rowStart,
 				colEnd: d.colEnd,
@@ -4640,7 +4637,7 @@ var wo = class extends ct {
 				scope: l,
 				value: c
 			};
-			A || (A = []), A.push(h);
+			R || (R = []), R.push(h);
 		}, D = (t) => {
 			const e = {
 				...t,
@@ -4650,10 +4647,10 @@ var wo = class extends ct {
 			k.insertNonOverlapping(e, {
 				noMerge: !0,
 				onUpdates(t, e, n) {
-					R || (R = []);
+					A || (A = []);
 					for (let t = 0; t < e.length; t++) {
 						const n = e[t];
-						if (R.push(n), M) for (let t = M.length - 1; t >= 0; t--) M[t].value === n.value && M.splice(t, 1);
+						if (A.push(n), M) for (let t = M.length - 1; t >= 0; t--) M[t].value === n.value && M.splice(t, 1);
 					}
 					const r = t ? t.length : 0;
 					for (let e = 0; e < r; e++) {
@@ -4665,7 +4662,7 @@ var wo = class extends ct {
 		}, T = x ? x.length : 0;
 		let G;
 		if (u > 0) {
-			G = st(u);
+			G = it(u);
 			for (let t = 0; t < u; t++) {
 				const n = e[t], r = n.value, s = o.sanitizeRange(n);
 				G[t] = s, null !== r && F(s, r);
@@ -4675,21 +4672,21 @@ var wo = class extends ct {
 		(T > 0 || u > 0) && (k = i.getFormulas().clone(B));
 		for (let t = 0; t < T; t++) D(x[t]);
 		for (let t = 0; t < u; t++) D(G[t]);
-		const V = R ? R.length : 0;
+		const V = A ? A.length : 0;
 		if (V > 0) {
 			const t = i.getDynamics();
 			let e = null;
 			for (let n = 0; n < V; n++) {
-				const r = R[n].value, o = t.get(r);
+				const r = A[n].value, o = t.get(r);
 				o && (N || (N = i.getPrecedents().clone(B)), N.removeAll(o, Go), e || (e = new Map(t)), e.delete(r));
 			}
 			e && i.setDynamics(e);
 		}
 		let O = [];
-		if (A || R) {
-			N || (N = i.getPrecedents().clone(B)), Po(k, N, A, R), M && Lo(N, M, null);
-			const t = A ? this._joinInserted(k, N, A, (t) => {
-				E.push({
+		if (R || A) {
+			N || (N = i.getPrecedents().clone(B)), Po(k, N, R, A), M && Lo(N, M, null);
+			const t = R ? this._joinInserted(k, N, R, (t) => {
+				w.push({
 					colStart: t.colStart,
 					rowStart: t.rowStart,
 					colEnd: t.colEnd,
@@ -4697,7 +4694,7 @@ var wo = class extends ct {
 					scope: l
 				});
 			}) : null;
-			this._touchFormulas(R), this._touchFormulas(A), this._touchFormulas(M), this._touchFormulas(t);
+			this._touchFormulas(A), this._touchFormulas(R), this._touchFormulas(M), this._touchFormulas(t);
 			const e = M ? function(t, ...e) {
 				const n = [];
 				if (!t) return n;
@@ -4715,9 +4712,9 @@ var wo = class extends ct {
 					}
 				}
 				return n;
-			}(R, x, G) : R;
-			$(-1, e, A, S, g, _, (t, e, n, r) => {
-				E.push({
+			}(A, x, G) : A;
+			Ct(-1, e, R, S, g, _, (t, e, n, r) => {
+				w.push({
 					colStart: t,
 					rowStart: e,
 					colEnd: n,
@@ -4726,8 +4723,8 @@ var wo = class extends ct {
 				});
 			}, this._notifyValues, C, this._notifyCalcStatus, p, f, !0, this._circularSpatial, this._calcStatusSpatial);
 		}
-		if (N && i.setPrecedents(N), k && (A || R || M) && i.setFormulas(k), A) for (let t = 0; t < A.length; t++) {
-			const e = A[t];
+		if (N && i.setPrecedents(N), k && (R || A || M) && i.setFormulas(k), R) for (let t = 0; t < R.length; t++) {
+			const e = R[t];
 			O.push({
 				colStart: e.colStart,
 				rowStart: e.rowStart,
@@ -4736,8 +4733,8 @@ var wo = class extends ct {
 				scope: l
 			});
 		}
-		if (R) for (let t = 0; t < R.length; t++) {
-			const e = R[t];
+		if (A) for (let t = 0; t < A.length; t++) {
+			const e = A[t];
 			O.push({
 				colStart: e.colStart,
 				rowStart: e.rowStart,
@@ -4746,7 +4743,7 @@ var wo = class extends ct {
 				scope: l
 			});
 		}
-		return this._notifyCalcStatus.size() !== m && (i.getDeferred?.()?.noteRepaint(l), i.requestCalculateGrid(l)), E.length > 0 && i.markDirty(E), O;
+		return this._notifyCalcStatus.size() !== m && (i.getDeferred?.()?.noteRepaint(l), i.requestCalculateGrid(l)), w.length > 0 && i.markDirty(w), O;
 	}
 	_rederivePrecedentsNow(t) {
 		const e = this._container, n = e.getPrecedents().clone();
@@ -4784,7 +4781,7 @@ var wo = class extends ct {
 			const s = n[o];
 			if (!a(s) || !d(s)) continue;
 			h = !1;
-			const l = W(c, s, (t, e, n, r) => {
+			const l = Q(c, s, (t, e, n, r) => {
 				if (!a(t) || !a(e)) return;
 				const o = {
 					colStart: n.colStart,
@@ -4834,9 +4831,9 @@ var wo = class extends ct {
 			if (t.data) {
 				const e = t.data;
 				this._values.setValues(e);
-				const n = this._values.getAxis() === w.Axis.Column;
-				zt(this._errorSpatial, e, n);
-				const r = ie(e, n, this._gridId);
+				const n = this._values.getAxis() === E.Axis.Column;
+				xe(this._errorSpatial, e, n);
+				const r = se(e, n, this._gridId);
 				this._contentfulSpatial.load(r);
 			}
 			const e = this._gridId, n = this._container, r = n.getPrecedents(), o = n.getFormulas(), s = {
@@ -4848,31 +4845,31 @@ var wo = class extends ct {
 				if (c) {
 					const t = c.length;
 					for (let e = 0; e < t; e++) {
-						const t = c[e], n = t[0], r = Yt(n, s).split(":")[0];
+						const t = c[e], n = t[0], r = Tt(n, s).split(":")[0];
 						d.add(r);
-						const o = yt(t, s);
+						const o = vt(t, s);
 						o && h.add(`${o.rowStart},${o.colStart}`);
 					}
 				}
-				const u = l.length, _ = new Array(u), f = [], g = n.getRuntime(), p = this._context, S = n.getScope();
-				S.colIndex = 0, S.rowIndex = 0, S.gridId = e;
-				const w = n.isLegacyIntersect();
+				const u = l.length, _ = new Array(u), f = [], g = n.getRuntime(), p = this._context, m = n.getScope();
+				m.colIndex = 0, m.rowIndex = 0, m.gridId = e;
+				const S = n.isLegacyIntersect();
 				for (let t = 0; t < u; t++) {
-					const r = yt(l[t], s);
+					const r = vt(l[t], s);
 					r.scope = e;
 					const o = r.value, i = r.rowStart, a = r.colStart;
-					S.colIndex = a, S.rowIndex = i;
-					const c = w && !(h.size > 0 && h.has(`${i},${a}`));
+					m.colIndex = a, m.rowIndex = i;
+					const c = S && !(h.size > 0 && h.has(`${i},${a}`));
 					let u = n.createFormulaBlock(e, p, o, i, a, void 0, c);
-					const g = u.resolvedPrecedentsAt(i, a, !0, Co, bo), E = g.length;
-					1 === E && (u = u.wrapImplicit(i, a, d));
-					const I = new no(r, e, u, n, this._unanchored);
-					I.fromLoad = !0, r.value = I, _[t] = r;
+					const g = u.resolvedPrecedentsAt(i, a, !0, Co, bo), w = g.length;
+					1 === w && (u = u.wrapImplicit(i, a, d));
+					const E = new no(r, e, u, n, this._unanchored);
+					E.fromLoad = !0, r.value = E, _[t] = r;
 					const y = r.rowEnd, v = r.colEnd - a, x = y - i, C = [], b = u.getReferences(i, a);
-					for (let t = 0; t < E; t++) {
+					for (let t = 0; t < w; t++) {
 						const n = g[t];
-						if (m.isError(n)) continue;
-						const o = ve(b[t], bo[t], Co[t]), s = o.$absColEnd, l = o.$absRowEnd, i = {
+						if (I.isError(n)) continue;
+						const o = ye(b[t], bo[t], Co[t]), s = o.$absColEnd, l = o.$absRowEnd, i = {
 							colStart: n.colStart,
 							rowStart: n.rowStart,
 							colEnd: n.colEnd + (s ? 0 : v),
@@ -4895,31 +4892,31 @@ var wo = class extends ct {
 				if (o.load(_), r.load(f), n.bumpCalcEpochs(!0), i.formulaInserts = this._formulaRecords(_), c) {
 					const t = [], l = [], a = /* @__PURE__ */ new Map(), d = this._values, h = c.length;
 					for (let n = 0; n < h; n++) {
-						const r = yt(c[n], s), i = r.value ?? "dynamic", h = "error" === i, u = r.colStart, _ = r.rowStart;
-						Ao.colStart = u, Ao.rowStart = _, Ao.colEnd = u, Ao.rowEnd = _, Ao.scope = e;
-						const f = o.search(Ao);
+						const r = vt(c[n], s), i = r.value ?? "dynamic", h = "error" === i, u = r.colStart, _ = r.rowStart;
+						Ro.colStart = u, Ro.rowStart = _, Ro.colEnd = u, Ro.rowEnd = _, Ro.scope = e;
+						const f = o.search(Ro);
 						if (1 !== f.length) continue;
-						const p = f[0].value, S = p.nodeAt(_, u), w = r.colEnd, E = r.rowEnd, I = {
+						const p = f[0].value, m = p.nodeAt(_, u), S = r.colEnd, w = r.rowEnd, E = {
 							colStart: u,
 							rowStart: _,
-							colEnd: w,
-							rowEnd: E
+							colEnd: S,
+							rowEnd: w
 						};
-						"fixed" === i && (Ze(S).fixedRef = I, p.densify()), S.cachedValue = h ? m.BuiltIn.Spill : new Re(g, d, I);
+						"fixed" === i && (sn(m).fixedRef = E, p.densify()), m.cachedValue = h ? I.BuiltIn.Spill : new Re(g, d, E);
 						const y = {
 							colStart: u,
 							rowStart: _,
-							colEnd: w,
-							rowEnd: E,
-							value: new x(I, 0, i)
+							colEnd: S,
+							rowEnd: w,
+							value: new Yt(E, 0, i)
 						};
 						l.push(y), t.push({
 							colStart: u,
 							rowStart: _,
-							colEnd: w,
-							rowEnd: E,
+							colEnd: S,
+							rowEnd: w,
 							value: i
-						}), K(a, S, I, -2);
+						}), U(a, m, E, -2);
 					}
 					if (this._spillSpatial.load(l), a.size > 0) {
 						r.load(Array.from(a.values()).flat()), n.bumpCalcEpochs(!1);
@@ -4929,26 +4926,26 @@ var wo = class extends ct {
 					}
 					t.length > 0 && (i.spillInserts = t);
 				}
-				let E = !1;
-				const I = t.volatile, y = I ? I.length : 0;
+				let w = !1;
+				const E = t.volatile, y = E ? E.length : 0;
 				if (y > 0) {
 					const t = n.getVolatiles(), e = (e) => {
 						t.add(e), e.state |= Hn, e.block.calcOnLoad = !0;
 					}, r = new Array(y);
 					for (let t = 0; t < y; t++) {
-						const n = I[t], l = z(n, s);
+						const n = E[t], l = H(n, s);
 						r[t] = { ...l };
 						const i = o.search(l), a = i.length;
 						for (let t = 0; t < a; t++) {
 							const n = i[t];
-							gt(n, l, e);
+							pt(n, l, e);
 						}
 					}
-					this._markDirtyRegionsNow(r), E = !0;
+					this._markDirtyRegionsNow(r), w = !0;
 				}
-				const v = this._contentfulSpatial, C = !v.isEmpty();
-				let b = null;
-				const A = {
+				const v = this._contentfulSpatial, x = !v.isEmpty();
+				let C = null;
+				const b = {
 					rowStart: 0,
 					colStart: 0,
 					rowEnd: 0,
@@ -4960,23 +4957,23 @@ var wo = class extends ct {
 					if (!e) continue;
 					const n = (e.rowEnd - e.rowStart + 1) * (e.colEnd - e.colStart + 1);
 					let r = 0;
-					if (C) {
-						A.rowStart = e.rowStart, A.colStart = e.colStart, A.rowEnd = e.rowEnd, A.colEnd = e.colEnd;
-						const t = v.search(A);
+					if (x) {
+						b.rowStart = e.rowStart, b.colStart = e.colStart, b.rowEnd = e.rowEnd, b.colEnd = e.colEnd;
+						const t = v.search(b);
 						for (let n = 0; n < t.length; n++) {
 							const o = t[n];
 							r += (Math.min(o.rowEnd, e.rowEnd) - Math.max(o.rowStart, e.rowStart) + 1) * (Math.min(o.colEnd, e.colEnd) - Math.max(o.colStart, e.colStart) + 1);
 						}
 					}
 					const o = r < n && !this._isSavedSpill(e);
-					o && (e.value.uncalculated = !0), (o || e.value?.getError()) && (b ??= []).push({
+					o && (e.value.uncalculated = !0), (o || e.value?.getError()) && (C ??= []).push({
 						rowStart: e.rowStart,
 						colStart: e.colStart,
 						rowEnd: e.rowEnd,
 						colEnd: e.colEnd
 					});
 				}
-				if (b && (this._markDirtyRegionsNow(b), E = !0), a && u > 0) {
+				if (C && (this._markDirtyRegionsNow(C), w = !0), a && u > 0) {
 					const t = new Array(u);
 					for (let e = 0; e < u; e++) {
 						const n = _[e];
@@ -4987,9 +4984,9 @@ var wo = class extends ct {
 							colEnd: n.colEnd
 						};
 					}
-					this._markDirtyRegionsNow(t), E = !0;
+					this._markDirtyRegionsNow(t), w = !0;
 				}
-				E && (n.isLoading() ? n.requestCalculateGrid(e) : this.calculate());
+				w && (n.isLoading() ? n.requestCalculateGrid(e) : this.calculate());
 			}
 		} catch (t) {
 			throw t;
@@ -5019,7 +5016,7 @@ var wo = class extends ct {
 	}
 	_toJSONNow(e) {
 		let n = this._container.getFormulas().getSpatialAt(this._gridId)?.all(), r = n ? n.length : 0;
-		r > 0 && (n = nt(n, t.Column, 2, Bo), n.sort(o.rowFirstRangeComparator)), r = n ? n.length : 0;
+		r > 0 && (n = ot(n, t.Column, 2, Bo), n.sort(o.rowFirstRangeComparator)), r = n ? n.length : 0;
 		const s = this._hiddenRows, l = this._hiddenColumns, i = this._filtered;
 		if (0 === r && !s && !l && !i) return null;
 		const a = {};
@@ -5036,7 +5033,7 @@ var wo = class extends ct {
 		if (d > 0) {
 			const t = this.getEntireCoords(), e = new Array(d);
 			for (let n = 0; n < d; n++) {
-				const r = c[n], o = ce(r, t);
+				const r = c[n], o = ie(r, t);
 				e[n] = [o, r.value.getKind()];
 			}
 			a.formulaArray = e;
@@ -5046,7 +5043,7 @@ var wo = class extends ct {
 		if (h.size > 0) {
 			const t = h.values();
 			let e = t.next();
-			const n = this._values.getAxis() === w.Axis.Column, r = B(!0);
+			const n = this._values.getAxis() === E.Axis.Column, r = z(!0);
 			for (; !e.done;) {
 				const o = e.value;
 				if (e = t.next(), o.gridId !== u) continue;
@@ -5070,14 +5067,14 @@ var wo = class extends ct {
 				}
 			};
 			f.isEmpty() || n(f.all());
-			const r = g.isEmpty() ? [] : g.all().filter((t) => t.value === se.CalcStatus.Working);
-			r.length > 0 && n(r), p.length > 0 && n(p), _ = nt(e, t.Column, 2);
+			const r = g.isEmpty() ? [] : g.all().filter((t) => t.value === re.CalcStatus.Working);
+			r.length > 0 && n(r), p.length > 0 && n(p), _ = ot(e, t.Column, 2);
 		}
 		const m = _ ? _.length : 0;
 		if (m > 0) {
 			const t = new Array(m);
 			for (let e = 0; e < m; e++) {
-				const n = _[e], r = ce(n, this.getEntireCoords());
+				const n = _[e], r = ie(n, this.getEntireCoords());
 				t[e] = r;
 			}
 			a.volatile = t;
@@ -5097,13 +5094,13 @@ var wo = class extends ct {
 	colStart: 0,
 	rowEnd: 0,
 	colEnd: 0
-}, Co = [], bo = [], Ao = {
+}, Co = [], bo = [], Ro = {
 	colStart: 0,
 	rowStart: 0,
 	colEnd: 0,
 	rowEnd: 0,
 	scope: null
-}, Ro = {
+}, Ao = {
 	colStart: 0,
 	rowStart: 0,
 	colEnd: 0,
@@ -5177,7 +5174,7 @@ function Lo(t, e, n) {
 		for (let e = 0; e < d; e++) {
 			const n = c[e];
 			if (null === n) continue;
-			if (m.isError(n)) continue;
+			if (I.isError(n)) continue;
 			ko.rowStart = n.rowStart, ko.colStart = n.colStart, ko.rowEnd = n.rowEnd, ko.colEnd = n.colEnd, ko.scope = n.scope ?? r.scope, To.length = 0;
 			const o = t.search(ko, !1, !1, To), s = o.length;
 			for (let e = 0; e < s; e++) {
@@ -5191,25 +5188,25 @@ function Lo(t, e, n) {
 	const s = [];
 	for (let t = 0; t < o; t++) {
 		const n = e[t], r = [], o = s.length;
-		te(n, s, r), s.length > o && (n.value.registeredPrecedents = s.slice(o));
+		Qt(n, s, r), s.length > o && (n.value.registeredPrecedents = s.slice(o));
 	}
 	t.load(s);
 }
 To.fill(null, 0, 10);
 var $o = (t) => {
 	let e = !1;
-	if (C.forEachLeaf(t, (t, n, r, o) => {
-		if (e || t instanceof ot) return;
+	if (b.forEachLeaf(t, (t, n, r, o) => {
+		if (e || t instanceof lt) return;
 		let s = n + o - r;
 		!0 === t.isIRepeatingList && (s = Math.min(s, n + t.getPeriod() - 1));
-		for (let r = n; !e && r <= s; r++) e = Rt(t.at(r));
+		for (let r = n; !e && r <= s; r++) e = kt(t.at(r));
 	}), !e) return t;
 	const n = t.length, r = new Array(n);
-	for (let e = 0; e < n; e++) r[e] = At(t.at(e));
-	return new V.ArrayList(r);
+	for (let e = 0; e < n; e++) r[e] = ct(t.at(e));
+	return new L.ArrayList(r);
 }, Ho = (t, e, n) => {
 	const r = n?.fetchedFrom;
-	if (!t) return new b({
+	if (!t) return new R({
 		source: { buffer: e },
 		fetchedFrom: r
 	});
@@ -5228,7 +5225,7 @@ var $o = (t) => {
 		this.isOpen() && (this.latest = void 0 === t ? null : this._normalize(t, e), this.state = 1, this._moved(), this._final());
 	}
 	reject(t) {
-		this.isOpen() && (this.latest = m.isError(t) ? t : new m.Value("The call failed", { cause: t }), this.state = 2, this._moved(), this._final());
+		this.isOpen() && (this.latest = I.isError(t) ? t : new I.Value("The call failed", { cause: t }), this.state = 2, this._moved(), this._final());
 	}
 	onCancel(t) {
 		(this._onCancel ??= []).push(t);
@@ -5250,18 +5247,18 @@ var $o = (t) => {
 		}
 	}
 	_moved() {
-		Mt(), this._onMoved?.(this);
+		Ft(), this._onMoved?.(this);
 	}
 	_final() {
 		const t = this._onFinal;
 		this._onFinal = null, t?.(this);
 	}
-}, Ko = (t) => t, qo = (t, e) => P.fromJSON({
+}, Ko = (t) => t, qo = (t, e) => J.fromJSON({
 	type: t,
 	data: e
-}), Uo = (t, e) => globalThis.fetch(t, e), Wo = () => {
+}), Uo = (t, e) => globalThis.fetch(t, e), Xo = () => {
 	throw new Error("getFormulaContext() needs a workbook being calculated");
-}, Xo = () => Promise.reject(/* @__PURE__ */ new Error("parseText() needs a workbook being calculated")), Jo = (t, e) => Ho(null, t, e), Qo = class {
+}, Wo = () => Promise.reject(/* @__PURE__ */ new Error("parseText() needs a workbook being calculated")), Jo = (t, e) => Ho(null, t, e), Qo = class {
 	constructor(t, e, n, r = null, o = 100, s = Ko, l, i = null) {
 		this._nextId = 1, this._calls = /* @__PURE__ */ new Map(), this._holders = !1, this._current = [], this._made = [], this._batch = /* @__PURE__ */ new Map(), this._states = /* @__PURE__ */ new Map(), this._moved = /* @__PURE__ */ new Set(), this._settleTimer = null, this._settledAt = 0, this._repaintGrids = /* @__PURE__ */ new Set(), this._settleDirty = [], this._serving = !1, this._external = !1, this.previous = void 0, this._waiters = /* @__PURE__ */ new Set(), this._scope = t, this._onCountsChange = i, this._heldAt = e, this._getRandom = n, this._onSettle = r, this._settleWindow = o, this._normalize = s;
 		const a = this._moved;
@@ -5282,8 +5279,8 @@ var $o = (t) => {
 			createRichData: l?.createRichData ?? qo,
 			addResource: l?.addResource ?? Jo,
 			fetch: l?.fetch ?? Uo,
-			getFormulaContext: l?.getFormulaContext ?? Wo,
-			parseText: l?.parseText ?? Xo
+			getFormulaContext: l?.getFormulaContext ?? Xo,
+			parseText: l?.parseText ?? Wo
 		};
 		const h = this._deferContext.fetch;
 		this._reloadContext = {
@@ -5372,7 +5369,7 @@ var $o = (t) => {
 		}, t);
 	}
 	newHolder(t, e) {
-		return this._holders = !0, new Dt(t, e.calls, e.direct);
+		return this._holders = !0, new Gt(t, e.calls, e.direct);
 	}
 	defer(t, e, n = null, r = !1) {
 		const o = this._scope, s = o.deferOrdinal++;
@@ -5448,7 +5445,7 @@ var $o = (t) => {
 		const e = this._scope, n = e.node;
 		if (!n || !this._holders || !e.gridId) return;
 		let r = this._heldAt(e.gridId, e.rowIndex, e.colIndex);
-		return null === r && Rt(n.cachedValue) && (r = n.cachedValue), null !== r ? r.calls[t] : void 0;
+		return null === r && kt(n.cachedValue) && (r = n.cachedValue), null !== r ? r.calls[t] : void 0;
 	}
 }, Yo = (t, e) => {
 	for (const n of t) n.isOpen() && n.reject(e);
@@ -5534,7 +5531,7 @@ var $o = (t) => {
 	hasErrorIn(t, e, n, r) {
 		for (let o = 0; o < this.size; o++) {
 			const s = this._order[o];
-			if (!m.isError(this._values[s])) continue;
+			if (!I.isError(this._values[s])) continue;
 			const l = this._keys[s], i = Math.floor(l / ns), a = l - i * ns;
 			if (i >= t && i <= n && a >= e && a <= r) return !0;
 		}
@@ -5542,7 +5539,7 @@ var $o = (t) => {
 	}
 	_grow() {
 		const t = this._keys, e = this._values, n = this._order, r = this.size, o = Math.max(64, 2 * (this._mask + 1));
-		this._keys = new Float64Array(o).fill(-1), this._values = Ce(o), this._order = new Int32Array(o), this._mask = o - 1;
+		this._keys = new Float64Array(o).fill(-1), this._values = ue(o), this._order = new Int32Array(o), this._mask = o - 1;
 		for (let o = 0; o < r; o++) {
 			const r = t[n[o]], s = Math.floor(r / ns), l = this._slotOf(s, r - s * ns, r);
 			this._keys[l] = r, this._values[l] = e[n[o]], this._order[o] = l;
@@ -5550,7 +5547,7 @@ var $o = (t) => {
 	}
 }, ss = class {
 	constructor(t, e, n) {
-		this._pending = new os(), this._unobserved = 0, this.observed = !1, this._errors = 0, this._uncovered = !1, this._coverChecked = 0, this._substitutedFrom = 0, this._rowStart = Number.MAX_SAFE_INTEGER, this._rowEnd = -1, this._colStart = Number.MAX_SAFE_INTEGER, this._colEnd = -1, this._demand = /* @__PURE__ */ new Map(), this._demandErrors = 0, this._demandRowStart = Number.MAX_SAFE_INTEGER, this._demandRowEnd = -1, this._demandColStart = Number.MAX_SAFE_INTEGER, this._demandColEnd = -1, this._anyRowStart = Number.MAX_SAFE_INTEGER, this._anyRowEnd = -1, this._anyColStart = Number.MAX_SAFE_INTEGER, this._anyColEnd = -1, this._inner = t, this._committed = e, this._flush = n, this._isColumn = t.getAxis() === w.Axis.Column;
+		this._pending = new os(), this._unobserved = 0, this.observed = !1, this._errors = 0, this._uncovered = !1, this._coverChecked = 0, this._substitutedFrom = 0, this._rowStart = Number.MAX_SAFE_INTEGER, this._rowEnd = -1, this._colStart = Number.MAX_SAFE_INTEGER, this._colEnd = -1, this._demand = /* @__PURE__ */ new Map(), this._demandErrors = 0, this._demandRowStart = Number.MAX_SAFE_INTEGER, this._demandRowEnd = -1, this._demandColStart = Number.MAX_SAFE_INTEGER, this._demandColEnd = -1, this._anyRowStart = Number.MAX_SAFE_INTEGER, this._anyRowEnd = -1, this._anyColStart = Number.MAX_SAFE_INTEGER, this._anyColEnd = -1, this._inner = t, this._committed = e, this._flush = n, this._isColumn = t.getAxis() === E.Axis.Column;
 	}
 	get isPendingOverlay() {
 		return !0;
@@ -5567,20 +5564,20 @@ var $o = (t) => {
 	push(t, e, n) {
 		if (this.observed) {
 			const r = this._pending.set(t, e, n ?? null);
-			void 0 !== r && m.isError(r) && this._errors--, m.isError(n) && this._errors++;
+			void 0 !== r && I.isError(r) && this._errors--, I.isError(n) && this._errors++;
 		} else this._unobserved++;
 		t < this._rowStart && (this._rowStart = t), t > this._rowEnd && (this._rowEnd = t), e < this._colStart && (this._colStart = e), e > this._colEnd && (this._colEnd = e), this._growAny(t, e);
 	}
 	pushDemand(t, e, n) {
 		n = n ?? null;
 		const r = rs(t, e), o = this._demand, s = o.get(r);
-		void 0 !== s && m.isError(s) && this._demandErrors--, m.isError(n) && this._demandErrors++, o.set(r, n), void 0 === this._inner.getValueAt(t, e) && this._inner.setValueAt(t, e, n), t < this._demandRowStart && (this._demandRowStart = t), t > this._demandRowEnd && (this._demandRowEnd = t), e < this._demandColStart && (this._demandColStart = e), e > this._demandColEnd && (this._demandColEnd = e), this._growAny(t, e);
+		void 0 !== s && I.isError(s) && this._demandErrors--, I.isError(n) && this._demandErrors++, o.set(r, n), void 0 === this._inner.getValueAt(t, e) && this._inner.setValueAt(t, e, n), t < this._demandRowStart && (this._demandRowStart = t), t > this._demandRowEnd && (this._demandRowEnd = t), e < this._demandColStart && (this._demandColStart = e), e > this._demandColEnd && (this._demandColEnd = e), this._growAny(t, e);
 	}
 	takeDemand(t, e) {
 		const n = this._demand;
 		if (0 === n.size) return;
 		const r = rs(t, e), o = n.get(r);
-		void 0 !== o && (m.isError(o) && this._demandErrors--, n.delete(r), 0 === n.size && this._resetDemand());
+		void 0 !== o && (I.isError(o) && this._demandErrors--, n.delete(r), 0 === n.size && this._resetDemand());
 	}
 	commitDemand() {
 		0 !== this._demand.size && (this._writeDemandIn(null), this._demand.clear(), this._resetDemand());
@@ -5610,7 +5607,7 @@ var $o = (t) => {
 		const e = t.rowStart, n = t.colStart, r = t.rowEnd, o = t.colEnd;
 		return this._unobserved > 0 && this._pendingIntersects(e, n, r, o) && this.observe(), this._committed.hasErrorIn(t) ? !this.intersects(e, n, r, o) || ls(this, t) : !!(this._errors > 0 && this._pendingIntersects(e, n, r, o) && this._pending.hasErrorIn(e, n, r, o)) || this._demandErrors > 0 && e <= this._demandRowEnd && r >= this._demandRowStart && n <= this._demandColEnd && o >= this._demandColStart && function(t, e, n, r, o) {
 			for (const [s, l] of t) {
-				if (!m.isError(l)) continue;
+				if (!I.isError(l)) continue;
 				const t = Math.floor(s / ns), i = s - t * ns;
 				if (t >= e && t <= r && i >= n && i <= o) return !0;
 			}
@@ -5785,7 +5782,7 @@ var $o = (t) => {
 };
 function ls(t, e) {
 	const n = t.values({ bounds: e });
-	for (let t = n.next(); !t.done; t = n.next()) if (m.isError(t.value)) return !0;
+	for (let t = n.next(); !t.done; t = n.next()) if (I.isError(t.value)) return !0;
 	return !1;
 }
 var is = {
@@ -5809,7 +5806,7 @@ var is = {
 	}
 }, fs = (t, e, n) => n === t.nodes[0].gridId && e.rowStart <= t.rowMax && e.rowEnd >= t.rowMin && e.colStart <= t.colMax && e.colEnd >= t.colMin, gs = 32768, ps = (t, e) => t * gs + e, ms = class {
 	constructor(t, e) {
-		this._map = /* @__PURE__ */ new Map(), this._errors = 0, this._rowStart = Number.MAX_SAFE_INTEGER, this._rowEnd = -1, this._colStart = Number.MAX_SAFE_INTEGER, this._colEnd = -1, this._inner = t, this._committed = e, this._isColumn = t.getAxis() === w.Axis.Column;
+		this._map = /* @__PURE__ */ new Map(), this._errors = 0, this._rowStart = Number.MAX_SAFE_INTEGER, this._rowEnd = -1, this._colStart = Number.MAX_SAFE_INTEGER, this._colEnd = -1, this._inner = t, this._committed = e, this._isColumn = t.getAxis() === E.Axis.Column;
 	}
 	get isWhatIfLayer() {
 		return !0;
@@ -5822,7 +5819,7 @@ var is = {
 	}
 	set(t, e, n) {
 		const r = ps(t, e), o = this._map, s = o.get(r);
-		void 0 !== s && m.isError(s) && this._errors--, m.isError(n) && this._errors++, o.set(r, n ?? null), t < this._rowStart && (this._rowStart = t), t > this._rowEnd && (this._rowEnd = t), e < this._colStart && (this._colStart = e), e > this._colEnd && (this._colEnd = e);
+		void 0 !== s && I.isError(s) && this._errors--, I.isError(n) && this._errors++, o.set(r, n ?? null), t < this._rowStart && (this._rowStart = t), t > this._rowEnd && (this._rowEnd = t), e < this._colStart && (this._colStart = e), e > this._colEnd && (this._colEnd = e);
 	}
 	clear() {
 		0 !== this._map.size && (this._map.clear(), this._errors = 0, this._rowStart = Number.MAX_SAFE_INTEGER, this._rowEnd = -1, this._colStart = Number.MAX_SAFE_INTEGER, this._colEnd = -1);
@@ -5837,7 +5834,7 @@ var is = {
 		}
 		if (0 === this._errors || !this.intersects(t.rowStart, t.colStart, t.rowEnd, t.colEnd)) return !1;
 		for (const [e, n] of this._map) {
-			if (!m.isError(n)) continue;
+			if (!I.isError(n)) continue;
 			const r = Math.floor(e / gs), o = e - r * gs;
 			if (r >= t.rowStart && r <= t.rowEnd && o >= t.colStart && o <= t.colEnd) return !0;
 		}
@@ -5936,7 +5933,7 @@ var is = {
 		const e = this.getRuns(t ? { bounds: t } : void 0);
 		let n = e.next();
 		if (n.done) return null;
-		const r = new L.Builder();
+		const r = new j.Builder();
 		for (; !n.done;) r.pushMultipleAt(n.value[0], n.value[1], n.value[2]), n = e.next();
 		return r.build();
 	}
@@ -6228,7 +6225,7 @@ var Es = class {
 		}, this._passHook = (t, e, n, r, o, s) => this._onPassRead(t, e, n, r, o, !0 === s), this._taintDownstream = (t) => {
 			if (0 !== (t.state & qn)) return;
 			t.state = t.state & ~Kn | $n | sr | ir;
-			const e = Ze(t);
+			const e = sn(t);
 			e.cycleGroup = this._taintGroup, e.demandValue = Ys(t), this._addCircular(t);
 		};
 	}
@@ -6284,15 +6281,15 @@ var Es = class {
 		};
 		const b = /* @__PURE__ */ new Map();
 		this._addDynamicPrecedent = (t, e, n) => {
-			t?.block && (u.getScope().perCellRead = !0, -1 === n && (t.state |= Hn), K(b, t, e, n));
+			t?.block && (u.getScope().perCellRead = !0, -1 === n && (t.state |= Hn), U(b, t, e, n));
 		};
-		const A = /* @__PURE__ */ new Map(), R = (t, e) => {
+		const R = /* @__PURE__ */ new Map(), A = (t, e) => {
 			(function(t, e, n, r) {
 				if (0 === e) return;
-				let o, s, l, i = As, a = [];
+				let o, s, l, i = Rs, a = [];
 				const c = /* @__PURE__ */ new Set(), d = () => {
 					const t = o.build();
-					t && t.tuples && (l.values.setValues(t.tuples), zt(l.errorSpatial, t.tuples, r));
+					t && t.tuples && (l.values.setValues(t.tuples), xe(l.errorSpatial, t.tuples, r));
 					const e = s.done(!0);
 					for (let t = 0; t < e.length; t++) {
 						const n = e[t];
@@ -6318,7 +6315,7 @@ var Es = class {
 				t.length = e, t.sort(Ns);
 				for (let h = 0; h < e; h++) {
 					const e = t[h], u = e.colIndex, _ = e.rowIndex, f = e.gridId;
-					f || console.log("nodeGridId is null", e), f !== i && (i !== As && d(), o = new L.Builder(Is), s = B(r), i = f, l = n(f));
+					f || console.log("nodeGridId is null", e), f !== i && (i !== Rs && d(), o = new j.Builder(Is), s = z(r), i = f, l = n(f));
 					const g = u, p = _, m = e.cachedValue;
 					m?.isIRange || (o.pushAt(g, p, m), s.append(g, p));
 					const S = e.block, w = e.numFmt;
@@ -6339,7 +6336,7 @@ var Es = class {
 								}
 							});
 						}
-					} else null !== w && (l.formatsConflating || (l.formatsConflating = B(r)), l.formatsConflating.append(g, p, w));
+					} else null !== w && (l.formatsConflating || (l.formatsConflating = z(r)), l.formatsConflating.append(g, p, w));
 				}
 				d();
 			})(t, e, _, !0);
@@ -6347,7 +6344,7 @@ var Es = class {
 				const e = t[n];
 				e.state = e.state & ~Kn | sr;
 			}
-			for (const [t, e] of S) A.set(t, e);
+			for (const [t, e] of S) R.set(t, e);
 			S.clear();
 		};
 		let k = r, N = Ul;
@@ -6355,8 +6352,8 @@ var Es = class {
 		let M = 0, F = !1;
 		do {
 			++y, I(), this.doMarkAndPlan(t, y, v, N);
-			const e = this.doEvaluate(t, _, R, k, N);
-			F = void 0 !== e, F && (k = !1, ++y, v.length = 0, this.doCollectDirtyCalcs(t, y, e.all(), v, c, g, w), M > 200 && (++y, I(), this.doMarkAndPlan(t, y, v, N, !0), this.doEvaluate(t, _, R, !1, N), this._hasCycle() || console.error("Too many iterations, possible cycle or leak"), F = !1)), M++;
+			const e = this.doEvaluate(t, _, A, k, N);
+			F = void 0 !== e, F && (k = !1, ++y, v.length = 0, this.doCollectDirtyCalcs(t, y, e.all(), v, c, g, w), M > 200 && (++y, I(), this.doMarkAndPlan(t, y, v, N, !0), this.doEvaluate(t, _, A, !1, N), this._hasCycle() || console.error("Too many iterations, possible cycle or leak"), F = !1)), M++;
 		} while (F);
 		for (const t of E) {
 			if (b.has(t)) continue;
@@ -6396,7 +6393,7 @@ var Es = class {
 		return this._gridUpdates = null, this._addDynamicPrecedent = null, this._context._setDynamicReadHook(null), this._passActive = !1, u.getDeferred?.()?.flush(), {
 			precedentSpatial: g,
 			dynamicByBlock: m,
-			lastUpdates: A,
+			lastUpdates: R,
 			skippedTables: this._takeSkippedTables()
 		};
 	}
@@ -6417,7 +6414,7 @@ var Es = class {
 			});
 		}
 		const o = n.getValues().getValueAt(t.rowIndex, t.colIndex);
-		return null == o || m.isError(o, m.Code.Busy) || m.isError(o, m.Code.Spill) ? void 0 : o;
+		return null == o || I.isError(o, I.Code.Busy) || I.isError(o, I.Code.Spill) ? void 0 : o;
 	}
 	_takeDeferred(t, e) {
 		const n = this._container.getDeferred?.();
@@ -6458,7 +6455,7 @@ var Es = class {
 			if (768 !== e || g || (this._flush?.(), g = !0, e = t.state & Kn), e !== or) 0 === e || 768 === e ? cl[_++] = t : 0 !== (t.state & qn) && (s ? p = !0 : d && this._demandActive ? this._onMemberRead(t) : d || this._demandActive ? this._markDownstream(t) : f = t);
 			else if (s) p = !0;
 			else {
-				if (u || (t.state &= ~Jn), !d || !this._demandActive) throw new Je(t);
+				if (u || (t.state &= ~Jn), !d || !this._demandActive) throw new nn(t);
 				0 === (t.state & jn) && (t.state |= jn, _l[this._iterHitsLength++] = t);
 			}
 		};
@@ -6477,27 +6474,27 @@ var Es = class {
 			}
 			c.forEachNodeIn(d, h, u, _, m);
 		}
-		if (_ > 0) throw new Ye(cl, _);
-		if (f) throw new nn(f);
+		if (_ > 0) throw new on(cl, _);
+		if (f) throw new cn(f);
 		return p;
 	}
 	_markDownstream(t) {
 		const e = this._container.getScope().node;
-		e && 0 === (e.state & qn) && (e.state = e.state & ~qn | ir, Ze(e).cycleGroup = this._resolveGroup(Qs(t)), this._addCircular(e), this._iterate && (pl[this._iterDownstreamLength++] = e));
+		e && 0 === (e.state & qn) && (e.state = e.state & ~qn | ir, sn(e).cycleGroup = this._resolveGroup(Qs(t)), this._addCircular(e), this._iterate && (pl[this._iterDownstreamLength++] = e));
 	}
 	_onMemberRead(t) {
 		const e = t.state;
 		if ((e & qn) === lr) {
 			if (this._openGroups.has(this._resolveGroup(t.ext.cycleGroup))) return void (0 === (e & jn) && (t.state |= jn, _l[this._iterHitsLength++] = t));
-		} else if (this._sweeping && 0 === (e & Xn) && void 0 !== t.ext.demandValue) {
+		} else if (this._sweeping && 0 === (e & Wn) && void 0 !== t.ext.demandValue) {
 			const e = this._container.getScope().node;
-			if (e && ((e.state & qn) === lr || 0 !== (e.state & Xn))) return void this._sweepAlong(t, e);
+			if (e && ((e.state & qn) === lr || 0 !== (e.state & Wn))) return void this._sweepAlong(t, e);
 		}
 		this._markDownstream(t);
 	}
 	_sweepAlong(t, e) {
 		const n = t.ext, r = e.ext, o = this._resolveGroup(r.cycleGroup);
-		(e.state & qn) === lr && this._resolveGroup(n.cycleGroup) === o ? (t.state = t.state & ~qn | lr, n.cycleGroup = o, null === r.cycleNext && (r.cycleNext = t)) : t.state |= Xn, this._addIterMember(t, n.demandValue);
+		(e.state & qn) === lr && this._resolveGroup(n.cycleGroup) === o ? (t.state = t.state & ~qn | lr, n.cycleGroup = o, null === r.cycleNext && (r.cycleNext = t)) : t.state |= Wn, this._addIterMember(t, n.demandValue);
 	}
 	_addIterMember(t, e) {
 		let n = this._iterMembersLength++;
@@ -6580,7 +6577,7 @@ var Es = class {
 		};
 		this._whatIf = c;
 		try {
-			const n = an(e, t), r = sn({
+			const n = fn(e, t), r = un({
 				container: e,
 				evaluate: (t) => this._evaluateWhatIf(t),
 				layerFor: d
@@ -6603,12 +6600,12 @@ var Es = class {
 		if (!n) return t.cachedValue ?? null;
 		const r = this._container.getScope();
 		let o;
-		Ln(t, hn(t)), r.gridId = t.gridId, r.node = t, r.rowIndex = t.rowIndex, r.colIndex = t.colIndex, r.drawIndex = 0;
+		Ln(t, mn(t)), r.gridId = t.gridId, r.node = t, r.rowIndex = t.rowIndex, r.colIndex = t.colIndex, r.drawIndex = 0;
 		try {
 			const e = r.deferCount;
 			o = n.finalizeValueForCell(n.evaluateAt(t.rowIndex, t.colIndex)), r.deferCount !== e && (o = this._takeDeferred(t, o));
 		} catch (e) {
-			if (!(e instanceof Gt)) throw e;
+			if (!(e instanceof Bt)) throw e;
 			o = t.cachedValue ?? null;
 		}
 		return this._fitCell(e, o);
@@ -6646,11 +6643,11 @@ var Es = class {
 		o.blankValue = e, o.blankCycleId = s, o.blankMarkId = l;
 		const _ = o.getTouchedCached().blank, f = t.gridId, g = n.values, p = n.errorSpatial, m = this._container.getGrid(f);
 		if (null !== m && null !== m.getShadowOf()) return void vs(_, n, f);
-		const S = g.getAxis() === w.Axis.Column, E = S ? w.Axis.Column : w.Axis.Row, I = qs, y = Us;
+		const S = g.getAxis() === E.Axis.Column, w = S ? E.Axis.Column : E.Axis.Row, I = qs, y = Us;
 		for (let t = 0; t < _.length; t++) {
-			const n = _[t], r = S ? n.colStart : n.rowStart, o = S ? n.colEnd : n.rowEnd, s = S ? n.rowStart : n.colStart, l = S ? n.rowEnd - n.rowStart + 1 : n.colEnd - n.colStart + 1, i = new he([e], l), a = new Array(o - r + 1);
+			const n = _[t], r = S ? n.colStart : n.rowStart, o = S ? n.colEnd : n.rowEnd, s = S ? n.rowStart : n.colStart, l = S ? n.rowEnd - n.rowStart + 1 : n.colEnd - n.colStart + 1, i = new ce([e], l), a = new Array(o - r + 1);
 			for (let t = r; t <= o; t++) a[t - r] = [t, [[s, i]]];
-			g.setValues(a), Ht(p, n), zt(p, a, S);
+			g.setValues(a), Ht(p, n), xe(p, a, S);
 			const c = {
 				colStart: n.colStart,
 				rowStart: n.rowStart,
@@ -6660,19 +6657,19 @@ var Es = class {
 			};
 			I.push({
 				...c,
-				value: new Ft(c, E)
+				value: new Dt(c, w)
 			}), y.push(c);
 		}
 		n.contentfulSpatial.insertAllNonOverlapping(I), n.notifyValues.insertAllNonOverlapping(y), I.length = 0, y.length = 0, o.setBlankShared(_), this._dirtyBlankReaders(f, _, u === e ? h : null);
 	}
 	_dirtyBlankReaders(t, e, n) {
 		if (null !== n && $r(e, n)) return;
-		const r = this._container.getPrecedents(), o = Xs, s = Js;
+		const r = this._container.getPrecedents(), o = Ws, s = Js;
 		s.scope = t;
 		for (let t = 0; t < e.length; t++) null === n ? o.push(e[t]) : Hr(e[t], n, o);
 		for (let e = 0; e < o.length; e++) {
 			const n = o[e];
-			s.colStart = n.colStart, s.rowStart = n.rowStart, s.colEnd = n.colEnd, s.rowEnd = n.rowEnd, 0 !== r.search(s).length && (this._fallbackDirty ?? (this._fallbackDirty = new et())).insertNonOverlapping({
+			s.colStart = n.colStart, s.rowStart = n.rowStart, s.colEnd = n.colEnd, s.rowEnd = n.rowEnd, 0 !== r.search(s).length && (this._fallbackDirty ?? (this._fallbackDirty = new rt())).insertNonOverlapping({
 				colStart: n.colStart,
 				rowStart: n.rowStart,
 				colEnd: n.colEnd,
@@ -6689,7 +6686,7 @@ var Es = class {
 		xs(t, n.blank, e);
 		const r = t.getDemandedBlank();
 		if (0 === r.length) return;
-		const o = this._fallbackDirty ?? (this._fallbackDirty = new et()), s = t.gridId, l = Ws;
+		const o = this._fallbackDirty ?? (this._fallbackDirty = new rt()), s = t.gridId, l = Xs;
 		for (let t = 0; t < r.length; t++) {
 			const e = r[t];
 			l.push({
@@ -6708,7 +6705,7 @@ var Es = class {
 		if (null === n) return;
 		const r = n.blank;
 		if (0 === r.length) return;
-		const o = this._fallbackDirty ?? (this._fallbackDirty = new et()), s = t.gridId, l = Ws;
+		const o = this._fallbackDirty ?? (this._fallbackDirty = new rt()), s = t.gridId, l = Xs;
 		for (let t = 0; t < r.length; t++) {
 			const e = r[t];
 			l.push({
@@ -6756,12 +6753,12 @@ var Es = class {
 				let r;
 				0 === n && (e.state = -131841 & e.state | or | $n, this._addCircular(e));
 				let d = null, h = !1;
-				Ln(e, hn(e)), e.state &= -65, s.node = e, s.gridId = e.gridId, s.rowIndex = e.rowIndex, s.colIndex = e.colIndex, s.drawIndex = 0, l.evaluations++, h = e.block.representative === e && e.block.isBlankAware(this._passCycleId), s.perCellRead = !1, s.positionRead = !1, o._setReadHook(this._passHook);
+				Ln(e, mn(e)), e.state &= -65, s.node = e, s.gridId = e.gridId, s.rowIndex = e.rowIndex, s.colIndex = e.colIndex, s.drawIndex = 0, l.evaluations++, h = e.block.representative === e && e.block.isBlankAware(this._passCycleId), s.perCellRead = !1, s.positionRead = !1, o._setReadHook(this._passHook);
 				try {
 					const t = e.block.formula, n = s.deferCount;
 					r = t.evaluateAt(e.rowIndex, e.colIndex), r = this._fitCell(e.block, t.finalizeValueForCell(r)), s.deferCount !== n && (r = this._takeDeferred(e, r)), r?.isIRange && r.getValueAt(0, 0);
 				} catch (t) {
-					if (!(t instanceof Ye || t instanceof Je || t instanceof nn)) throw t;
+					if (!(t instanceof on || t instanceof nn || t instanceof cn)) throw t;
 					d = t;
 				} finally {
 					o._setReadHook(null);
@@ -6782,17 +6779,17 @@ var Es = class {
 						}
 						this._iterHitsLength = 0;
 					}
-					if (d instanceof Ye) {
+					if (d instanceof on) {
 						if (0 !== (e.state & Jn)) {
 							this._unstartPrefetched(e), a = this._unwindSpeculative(i, a - 1);
 							continue;
 						}
 						l.retries++;
 						let t = 0;
-						const n = en(e), r = n.length;
+						const n = an(e), r = n.length;
 						for (let o = 0; o < r; o++) {
 							const r = n[o];
-							if (m.isError(r)) continue;
+							if (I.isError(r)) continue;
 							const s = r;
 							s.scope ? t = this._collectUnevaluated(s, c, t) : (js.rowStart = s.rowStart, js.colStart = s.colStart, js.rowEnd = s.rowEnd, js.colEnd = s.colEnd, js.scope = e.gridId, t = this._collectUnevaluated(js, c, t));
 						}
@@ -6807,7 +6804,7 @@ var Es = class {
 						}
 						continue;
 					}
-					if (d instanceof Je) {
+					if (d instanceof nn) {
 						if (0 !== (e.state & Jn)) {
 							this._unstartPrefetched(e), a = this._unwindSpeculative(i, a - 1);
 							continue;
@@ -6822,23 +6819,23 @@ var Es = class {
 							}
 							t.state = -66305 & t.state | sr;
 							const n = Ys(t);
-							Ze(t).demandValue = n, this._pushDemand(t, n);
+							sn(t).demandValue = n, this._pushDemand(t, n);
 							const r = t.block;
 							r.representative === t && r.isBlankAware(this._passCycleId) && this._fallbackBlank(r, !1);
 						}
 						a = t;
 						continue;
 					}
-					if (d instanceof nn) {
+					if (d instanceof cn) {
 						e.state = -69377 & e.state | sr | ir;
-						const t = Ys(e), n = Ze(e);
+						const t = Ys(e), n = sn(e);
 						n.cycleGroup = Qs(d.node), n.demandValue = t, this._pushDemand(e, t), h && this._fallbackBlank(e.block, !1), a--;
 						continue;
 					}
-					if (this._iterate || (e.state & qn) !== ir) Ze(e).demandValue = r, this._pushDemand(e, r), h && this._finalizeRepresentative(e, r, t(e.gridId), !1);
+					if (this._iterate || (e.state & qn) !== ir) sn(e).demandValue = r, this._pushDemand(e, r), h && this._finalizeRepresentative(e, r, t(e.gridId), !1);
 					else {
 						const t = Ys(e);
-						Ze(e).demandValue = t, this._pushDemand(e, t), h && this._fallbackBlank(e.block, !1);
+						sn(e).demandValue = t, this._pushDemand(e, t), h && this._fallbackBlank(e.block, !1);
 					}
 					if (e.state = -66305 & e.state | sr, a--, this._openGroups.size > 0 && (e.state & qn) === lr) {
 						const t = this._resolveGroup(e.ext.cycleGroup);
@@ -6870,7 +6867,7 @@ var Es = class {
 			if ((r & Kn) !== or) continue;
 			if (0 !== (r & Jn)) continue;
 			l && (r & qn) !== lr && this._addIterMember(e, this._valueOnGrid(e)), e.state = r & ~qn | lr;
-			const o = Ze(e);
+			const o = sn(e);
 			if (l && (r & qn) === lr) {
 				const t = this._resolveGroup(o.cycleGroup);
 				if (t !== s) {
@@ -6878,9 +6875,9 @@ var Es = class {
 					void 0 !== e && (e < i && (i = e), this._openGroups.delete(t)), this._groupAlias.set(t, s);
 				}
 			}
-			o.cycleGroup = s, c ? Ze(c).cycleNext = e : a = e, c = e;
+			o.cycleGroup = s, c ? sn(c).cycleNext = e : a = e, c = e;
 		}
-		return c && (Ze(c).cycleNext = r ?? a), l && this._openGroups.set(s, i), o;
+		return c && (sn(c).cycleNext = r ?? a), l && this._openGroups.set(s, i), o;
 	}
 	_demandSweep(t) {
 		const e = this._iterate, n = fl, r = e.maxIteration, o = e.maxChange;
@@ -6948,7 +6945,7 @@ var Es = class {
 		this._iterHitsLength = 0;
 	}
 	_demandEvaluateOne(t, e) {
-		const n = this._context, r = this._container.getScope(), o = e.block.formula, s = hn(e);
+		const n = this._context, r = this._container.getScope(), o = e.block.formula, s = mn(e);
 		for (;;) {
 			Ln(e, s), e.state &= -65, r.node = e, r.gridId = e.gridId, r.rowIndex = e.rowIndex, r.colIndex = e.colIndex, r.drawIndex = 0, this._demandStats.evaluations++;
 			let l, i = null;
@@ -6957,7 +6954,7 @@ var Es = class {
 				const t = r.deferCount;
 				l = this._fitCell(e.block, o.finalizeValueForCell(o.evaluateAt(e.rowIndex, e.colIndex))), r.deferCount !== t && (l = this._takeDeferred(e, l)), l?.isIRange && l.getValueAt(0, 0);
 			} catch (t) {
-				if (!(t instanceof Ye)) throw t;
+				if (!(t instanceof on)) throw t;
 				i = t;
 			} finally {
 				n._setReadHook(null);
@@ -6986,15 +6983,15 @@ var Es = class {
 		return !1;
 	}
 	_addCircular(t) {
-		0 === (t.state & Wn) && (t.state |= Wn, dl[this._circularNodesLength++] = t);
+		0 === (t.state & Xn) && (t.state |= Xn, dl[this._circularNodesLength++] = t);
 	}
 	_resetCircular() {
 		const t = this._circularNodesLength;
-		for (let e = 0; e < t; e++) dl[e].state &= ~Wn;
+		for (let e = 0; e < t; e++) dl[e].state &= ~Xn;
 		this._circularNodesLength = 0;
 	}
 	_trackCircular(t, e, n, r, o) {
-		const s = Ze(t), l = t.state & qn, i = 0 === l ? 0 : s.cycleGroup;
+		const s = sn(t), l = t.state & qn, i = 0 === l ? 0 : s.cycleGroup;
 		if (s.shownGroup === i && (t.state & Un) === l << 2) return;
 		if (this._cycleEpoch++, 0 !== s.shownGroup) {
 			const e = this._cycles.get(s.shownGroup);
@@ -7005,7 +7002,7 @@ var Es = class {
 			const e = this._cycleOf(i), n = l === lr;
 			(n ? e.members : e.downstream).add(t), a = e.getEntry(n);
 		}
-		s.shownGroup = i, t.state = t.state & ~Un | l << 2, e.circularConflating || (e.circularConflating = B(o)), e.circularConflating.append(n, r, a);
+		s.shownGroup = i, t.state = t.state & ~Un | l << 2, e.circularConflating || (e.circularConflating = z(o)), e.circularConflating.append(n, r, a);
 	}
 	_cycleOf(t) {
 		let e = this._cycles.get(t);
@@ -7045,37 +7042,37 @@ var Es = class {
 		this._passCycleId = t, this._passMarkId = e;
 		const c = this._container, d = c.getPrecedents(), h = c.getFormulas(), u = this.planCacheMode, { staticEpoch: _, precedentEpoch: f } = c.getCalcEpochs(), g = this._lastPlanId, p = this._planStats;
 		p.passes++;
-		const S = Ds();
-		let w = "off" !== u && !o && 0 !== g;
-		const E = w ? this._matchPlanMemo(l, t, e - 1, f) : null;
-		if (null !== E && p.closureEligible++, Vn = 0, null !== E && "on" === u) {
-			const n = E.plan, o = E.planLength, s = E.demandStart;
+		const m = Ds();
+		let S = "off" !== u && !o && 0 !== g;
+		const w = S ? this._matchPlanMemo(l, t, e - 1, f) : null;
+		if (null !== w && p.closureEligible++, Vn = 0, null !== w && "on" === u) {
+			const n = w.plan, o = w.planLength, s = w.demandStart;
 			for (let r = 0; r < o; r++) {
 				const o = n[r];
-				o.markId = e, o.cycleId = t, o.inDegree = 0, o.state &= ~rr, null !== o.ext && (o.ext.cycleGroup = 0), Pn(o, hn(o)), i[r] = o;
+				o.markId = e, o.cycleId = t, o.inDegree = 0, o.state &= ~rr, null !== o.ext && (o.ext.cycleGroup = 0), Pn(o, mn(o)), i[r] = o;
 			}
-			return r.length = o, s < o && this._flagDemandAppendix(i, s, o), p.closureHits++, p.discoveryMs += Ds() - S, s === o;
+			return r.length = o, s < o && this._flagDemandAppendix(i, s, o), p.closureHits++, p.discoveryMs += Ds() - m, s === o;
 		}
-		let I = 0, y = 0, v = 0, x = 0, C = 0, b = 0, A = 0, R = 0;
+		let E = 0, y = 0, v = 0, x = 0, C = 0, b = 0, R = 0, A = 0;
 		for (let n = 0; n < l; n++) {
 			const r = s[n];
 			if (r.cycleId === t && r.markId === e) continue;
 			r.markId = e, r.cycleId = t, r.inDegree = 0, r.state &= ~rr;
 			const o = r.ext;
-			null !== o && (o.cycleGroup = 0), (r.planEpoch !== _ || r.planId !== g || null !== o && 0 !== o.shownGroup) && (w = !1), Pn(r, hn(r)), nl[I++] = r, ol[R++] = r;
+			null !== o && (o.cycleGroup = 0), (r.planEpoch !== _ || r.planId !== g || null !== o && 0 !== o.shownGroup) && (S = !1), Pn(r, mn(r)), nl[E++] = r, ol[A++] = r;
 		}
 		const k = (n) => {
 			if (n.cycleId === t && n.markId === e) return;
 			n.markId = e, n.cycleId = t, n.inDegree = 0, n.state &= ~rr;
 			const r = n.ext;
-			null !== r && (r.cycleGroup = 0), (n.planEpoch !== _ || n.planId !== g || null !== r && 0 !== r.shownGroup) && (w = !1), Pn(n, hn(n)), nl[I++] = n, ol[R++] = n;
+			null !== r && (r.cycleGroup = 0), (n.planEpoch !== _ || n.planId !== g || null !== r && 0 !== r.shownGroup) && (S = !1), Pn(n, mn(n)), nl[E++] = n, ol[A++] = n;
 		}, N = (n, r, o, s, l, i) => {
 			if (n.unanchored) return;
 			const a = n.ref;
 			r <= a.rowStart && o >= a.rowEnd && s <= a.colStart && l >= a.colEnd && n.isBlankAware(t) ? n.forEachTouchedNode(t, e, i) : n.mintNodesIn(r, o, s, l, i);
 		}, M = /* @__PURE__ */ new Map();
-		for (; A < R;) {
-			const t = ol[A++], e = t.colIndex, n = t.rowIndex, r = t.gridId;
+		for (; R < A;) {
+			const t = ol[R++], e = t.colIndex, n = t.rowIndex, r = t.gridId;
 			let o;
 			const s = "off" !== u && t.dependentsEpoch === f;
 			s && "on" === u ? (p.dependentsCacheHits++, o = t.dependents) : (Ls.colStart = e, Ls.rowStart = n, Ls.colEnd = e, Ls.rowEnd = n, Ls.scope = r, o = d.search(Ls), s ? (p.dependentsCacheHits++, Os(t.dependents, o) || (p.dependentsAssertFailures++, console.error("CalcExecutor: stale dependents cache at", r, n, e))) : (p.dependentsCacheMisses++, "off" !== u && (t.dependentsEpoch = f))), t.dependents = o;
@@ -7085,28 +7082,28 @@ var Es = class {
 				$s.colStart = s, $s.rowStart = o, $s.colEnd = i, $s.rowEnd = l, $s.scope = r;
 				const a = d.search($s), c = a.length;
 				if (c > 0) {
-					const r = Ze(t);
+					const r = sn(t);
 					r.spillDependents = a, r.spillRowStart = o, r.spillColStart = s, r.spillRowEnd = l, r.spillColEnd = i, rl[y++] = t;
-					for (let t = 0; t < c; t++) Xe(a[t], n, e, o, s, l, i, k, N);
+					for (let t = 0; t < c; t++) en(a[t], n, e, o, s, l, i, k, N);
 				}
 			}
 			const i = o.length;
 			if (0 !== i) for (let t = 0; t < i; t++) {
 				const r = o[t];
-				dn(r, n, e, k, N, M);
+				pn(r, n, e, k, N, M);
 			}
 		}
 		const F = Ds();
-		if (p.discoveryMs += F - S, w && p.fastEligible++, null !== E) {
-			const n = E.plan;
-			let r = E.planLength === I;
-			for (let o = 0; r && o < I; o++) {
+		if (p.discoveryMs += F - m, S && p.fastEligible++, null !== w) {
+			const n = w.plan;
+			let r = w.planLength === E;
+			for (let o = 0; r && o < E; o++) {
 				const s = n[o];
 				r = s.cycleId === t && s.markId === e;
 			}
 			r || (p.closureAssertFailures++, console.error("CalcExecutor: whole-closure reuse would have planned a different affected set"));
 		}
-		if (w && "on" === u) {
+		if (S && "on" === u) {
 			(function(t, e, n, r) {
 				if (8 * e < r) {
 					const r = Bs;
@@ -7131,13 +7128,13 @@ var Es = class {
 					const e = o[t];
 					null !== e && (o[t] = null, n[i++] = e);
 				}
-			})(nl, I, i, this._lastStampedLength), r.length = I;
-			let t = I;
+			})(nl, E, i, this._lastStampedLength), r.length = E;
+			let t = E;
 			const e = this._lastStampedOrderedLength;
 			for (; t > 0 && i[t - 1].orderIndex >= e;) t--;
-			return t < I && this._flagDemandAppendix(i, t, I), this._rememberPlan(s, l, i, I, f, t), p.fastHits++, p.kahnMs += Ds() - F, t === I;
+			return t < E && this._flagDemandAppendix(i, t, E), this._rememberPlan(s, l, i, E, f, t), p.fastHits++, p.kahnMs += Ds() - F, t === E;
 		}
-		if ("on" === u && !o && M.size > 0 && 0 === y && I >= kl && 0 === this._cycles.size && function(t, e, n, r) {
+		if ("on" === u && !o && M.size > 0 && 0 === y && E >= kl && 0 === this._cycles.size && function(t, e, n, r) {
 			const o = /* @__PURE__ */ new Map();
 			let s = null;
 			for (let n = 0; n < e; n++) {
@@ -7163,7 +7160,7 @@ var Es = class {
 					const i = s[l].precedents;
 					if (null !== i) for (let r = 0; r < i.length; r++) {
 						const a = i[r];
-						if (m.isError(a)) continue;
+						if (I.isError(a)) continue;
 						const c = a.scope ?? e;
 						fs(t, a, c) && (0 === hs(a, s[l].rowIndex, s[l].colIndex) && (t.rowFirst = !1), 0 === us(a, s[l].rowIndex, s[l].colIndex) && (t.colFirst = !1)), _s(t, a.rowStart, a.rowEnd, a.colStart, a.colEnd, c, o, n);
 					}
@@ -7173,10 +7170,10 @@ var Es = class {
 				const { block: l, rowMin: i, rowMax: a, colMin: c, colMax: d } = t, h = l.paramLength;
 				for (let r = 0; r < h; r++) {
 					const s = l.getPrecedentsAt(i, c)[r];
-					if (m.isError(s)) continue;
+					if (I.isError(s)) continue;
 					as.rowStart = s.rowStart, as.rowEnd = s.rowEnd, as.colStart = s.colStart, as.colEnd = s.colEnd;
 					const h = l.getPrecedentsAt(a, d)[r];
-					if (m.isError(h)) return !1;
+					if (I.isError(h)) return !1;
 					const u = Math.min(as.rowStart, h.rowStart), _ = Math.max(as.rowEnd, h.rowEnd), f = Math.min(as.colStart, h.colStart), g = Math.max(as.colEnd, h.colEnd), p = h.scope ?? e;
 					if (u <= a && _ >= i && f <= d && g >= c && p === e) {
 						const e = hs(as, i, c);
@@ -7201,11 +7198,11 @@ var Es = class {
 				for (let t = 0; t < o.length; t++) 0 === --o[t].waitingOn && l.push(o[t]);
 			}
 			return l.length === o.size;
-		}(nl, I, h, i)) return r.length = I, this._stampPlan(i, I, I, _), this._rememberPlan(s, l, i, I, f), p.blockOrdered++, p.kahnMs += Ds() - F, !0;
+		}(nl, E, h, i)) return r.length = E, this._stampPlan(i, E, E, _), this._rememberPlan(s, l, i, E, f), p.blockOrdered++, p.kahnMs += Ds() - F, !0;
 		const D = (t) => {
-			p.planAssertFailures++, console.error("CalcExecutor: order-stamp fast path would invert a static edge at", t.gridId, t.rowIndex, t.colIndex), w = !1;
+			p.planAssertFailures++, console.error("CalcExecutor: order-stamp fast path would invert a static edge at", t.gridId, t.rowIndex, t.colIndex), S = !1;
 		}, T = (n) => {
-			n.cycleId === t && n.markId === e ? (bl++, w && n.orderIndex >= Cl.orderIndex && D(Cl)) : this._iterate || 0 === (n.state & Un) || (this._taintGroup = n.ext.shownGroup, this._taintDownstream(Cl));
+			n.cycleId === t && n.markId === e ? (bl++, S && n.orderIndex >= Cl.orderIndex && D(Cl)) : this._iterate || 0 === (n.state & Un) || (this._taintGroup = n.ext.shownGroup, this._taintDownstream(Cl));
 		};
 		let G = null;
 		const B = (n) => {
@@ -7223,7 +7220,7 @@ var Es = class {
 				if (s.rowFrom === e && s.rowTo === n && s.colFrom === r && s.colTo === o) return s;
 			}
 			let i;
-			return Gl = 0, Bl = -1, Vl = null, t.forEachNodeIn(e, n, r, o, B), l.length < Rl ? (i = {
+			return Gl = 0, Bl = -1, Vl = null, t.forEachNodeIn(e, n, r, o, B), l.length < Al ? (i = {
 				rowFrom: e,
 				rowTo: n,
 				colFrom: r,
@@ -7231,14 +7228,14 @@ var Es = class {
 				count: 0,
 				maxOrder: -1,
 				shownGroup: null
-			}, l.push(i)) : (i = l[s.next], s.next = (s.next + 1) % Rl, i.rowFrom = e, i.rowTo = n, i.colFrom = r, i.colTo = o), i.count = Gl, i.maxOrder = Bl, i.shownGroup = Vl, i;
+			}, l.push(i)) : (i = l[s.next], s.next = (s.next + 1) % Al, i.rowFrom = e, i.rowTo = n, i.colFrom = r, i.colTo = o), i.count = Gl, i.maxOrder = Bl, i.shownGroup = Vl, i;
 		};
-		for (let t = 0; t < I; t++) {
-			const e = nl[t], n = en(e), r = n.length;
+		for (let t = 0; t < E; t++) {
+			const e = nl[t], n = an(e), r = n.length;
 			let o = 0;
 			for (let t = 0; t < r; t++) {
 				const r = n[t];
-				if (m.isError(r)) continue;
+				if (I.isError(r)) continue;
 				const s = r.colStart, l = r.rowStart, i = r.colEnd, a = r.rowEnd, c = r.scope ?? e.gridId;
 				let d;
 				const u = t & Nl, _ = Ml[u];
@@ -7259,9 +7256,9 @@ var Es = class {
 				const f = d.length;
 				for (let t = 0; t < f; t++) {
 					const n = d[t], r = n.colStart, c = n.rowStart, h = n.colEnd, u = n.rowEnd, _ = Math.max(r, s), f = Math.max(c, l), g = Math.min(h, i), p = Math.min(u, a);
-					if ((p - f + 1) * (g - _ + 1) >= Al) {
+					if ((p - f + 1) * (g - _ + 1) >= Rl) {
 						const t = V(n.value, f, p, _, g);
-						o += t.count, w && t.maxOrder >= e.orderIndex && D(e), null !== t.shownGroup && (this._taintGroup = t.shownGroup, this._taintDownstream(e));
+						o += t.count, S && t.maxOrder >= e.orderIndex && D(e), null !== t.shownGroup && (this._taintGroup = t.shownGroup, this._taintDownstream(e));
 						continue;
 					}
 					Cl = e, bl = o, n.value.forEachNodeIn(f, p, _, g, T), o = bl;
@@ -7272,15 +7269,15 @@ var Es = class {
 		if (Ml.fill(null), Dl.fill(null), y > 0) {
 			let n = rl[0];
 			const r = (r) => {
-				r.cycleId === t && r.markId === e && (r.inDegree++, w && n.orderIndex >= r.orderIndex && (p.planAssertFailures++, console.error("CalcExecutor: order-stamp fast path would invert a spill body edge at", r.gridId, r.rowIndex, r.colIndex), w = !1));
+				r.cycleId === t && r.markId === e && (r.inDegree++, S && n.orderIndex >= r.orderIndex && (p.planAssertFailures++, console.error("CalcExecutor: order-stamp fast path would invert a spill body edge at", r.gridId, r.rowIndex, r.colIndex), S = !1));
 			};
 			for (let t = 0; t < y; t++) {
 				const e = rl[t];
 				n = e;
 				const o = e.ext, s = o.spillDependents, l = s.length;
-				for (let t = 0; t < l; t++) Xe(s[t], e.rowIndex, e.colIndex, o.spillRowStart, o.spillColStart, o.spillRowEnd, o.spillColEnd, r);
+				for (let t = 0; t < l; t++) en(s[t], e.rowIndex, e.colIndex, o.spillRowStart, o.spillColStart, o.spillRowEnd, o.spillColEnd, r);
 			}
-			for (let t = 0; t < I; t++) {
+			for (let t = 0; t < E; t++) {
 				const e = nl[t];
 				0 === e.inDegree && (sl[x++] = e);
 			}
@@ -7297,20 +7294,20 @@ var Es = class {
 			const e = t.colIndex, n = t.rowIndex, r = t.ext;
 			if (null !== r) {
 				const t = r.spillDependents, o = t.length;
-				for (let s = 0; s < o; s++) Xe(t[s], n, e, r.spillRowStart, r.spillColStart, r.spillRowEnd, r.spillColEnd, P);
+				for (let s = 0; s < o; s++) en(t[s], n, e, r.spillRowStart, r.spillColStart, r.spillRowEnd, r.spillColEnd, P);
 			}
 			let o;
 			o = t.dependents;
 			const s = o.length;
 			if (0 !== s) for (let t = 0; t < s; t++) {
 				const r = o[t];
-				ln(r, n, e, P);
+				_n(r, n, e, P);
 			}
 		}
-		if (p.kahnMs += Ds() - O, o || a < I) {
-			if (w) {
+		if (p.kahnMs += Ds() - O, o || a < E) {
+			if (S) {
 				const t = this._lastStampedOrderedLength;
-				for (let e = 0; e < I; e++) {
+				for (let e = 0; e < E; e++) {
 					const n = nl[e];
 					if (n.inDegree > 0 && n.orderIndex < t) {
 						p.planAssertFailures++, console.error("CalcExecutor: order-stamp fast path would have missed an unorderable subset");
@@ -7320,9 +7317,9 @@ var Es = class {
 			}
 			const t = this._demandBatch;
 			t.length = 0, o && (a = 0);
-			for (let e = 0; e < I; e++) {
+			for (let e = 0; e < E; e++) {
 				const n = nl[e];
-				(o || n.inDegree > 0) && (n.state |= $n, Ze(n).demandValue = void 0, t.push(n));
+				(o || n.inDegree > 0) && (n.state |= $n, sn(n).demandValue = void 0, t.push(n));
 			}
 			t.sort(Fs);
 			const e = t.length, n = a;
@@ -7330,9 +7327,9 @@ var Es = class {
 				const e = t[n];
 				i[a++] = e, this._addCircular(e);
 			}
-			return r.length = a, o ? (this._planMemos[0].epoch = -1, this._planMemos[1].epoch = -1) : "off" !== u && (w || this._stampPlan(i, a, n, _), this._rememberPlan(s, l, i, a, f, n)), !1;
+			return r.length = a, o ? (this._planMemos[0].epoch = -1, this._planMemos[1].epoch = -1) : "off" !== u && (S || this._stampPlan(i, a, n, _), this._rememberPlan(s, l, i, a, f, n)), !1;
 		}
-		return r.length = a, "off" === u || w || this._stampPlan(i, a, a, _), "off" !== u && this._rememberPlan(s, l, i, a, f), !0;
+		return r.length = a, "off" === u || S || this._stampPlan(i, a, a, _), "off" !== u && this._rememberPlan(s, l, i, a, f), !0;
 	}
 	_stampPlan(t, e, n, r) {
 		const o = ++this._planIdNext;
@@ -7348,7 +7345,7 @@ var Es = class {
 		r.length = 0;
 		for (let o = e; o < n; o++) {
 			const e = t[o];
-			e.state |= $n, Ze(e).demandValue = void 0, r.push(e), this._addCircular(e);
+			e.state |= $n, sn(e).demandValue = void 0, r.push(e), this._addCircular(e);
 		}
 	}
 	_invalidatePlans() {
@@ -7382,156 +7379,156 @@ var Es = class {
 		const l = Ds(), i = this._container, a = this._context, c = i.getScope(), d = a.getRuntime(), h = i.getDeferred?.() ?? null, u = s.values, _ = s.length;
 		zl = this._passCycleId, Ll = this._passMarkId;
 		const f = el;
-		let g, p, S, E, I, y, v, C, b, A, R, k, N, M = 0;
-		const F = /* @__PURE__ */ new Map();
-		this._overlays = F;
-		const D = (t) => this._overlayFor(t), T = (t) => {
-			R = i.getGrid(t), A = R.getEntireCoords.bind(R), p = e(t), S = p.gridId, N = D(t), E = p.values, k = p.errorSpatial, I = p.contentfulSpatial, y = p.spillSpatial, v = p.notifyValues, C = p.notifySpillsInsert, b = p.notifySpillsRemove, p.notifyFormats, p.notifyCalcStatus, c.gridId = S;
-		}, G = w.Axis.Column, V = G === w.Axis.Column, O = () => {
-			if (M > 0) {
-				n(f, M), M = 0;
-				for (const t of F.values()) t.reset();
-				void 0 !== S && (p = e(S));
+		let g, p, m, S, w, y, v, x, C, b, R, A, k, N = 0;
+		const M = /* @__PURE__ */ new Map();
+		this._overlays = M;
+		const F = (t) => this._overlayFor(t), D = (t) => {
+			R = i.getGrid(t), b = R.getEntireCoords.bind(R), p = e(t), m = p.gridId, k = F(t), S = p.values, A = p.errorSpatial, w = p.contentfulSpatial, y = p.spillSpatial, v = p.notifyValues, x = p.notifySpillsInsert, C = p.notifySpillsRemove, p.notifyFormats, p.notifyCalcStatus, c.gridId = m;
+		}, T = E.Axis.Column, G = T === E.Axis.Column, B = () => {
+			if (N > 0) {
+				n(f, N), N = 0;
+				for (const t of M.values()) t.reset();
+				void 0 !== m && (p = e(m));
 			}
 		};
-		this._flush = O;
-		const P = this._exceptTables;
-		if (P) for (let t = 0; t < _; t++) {
+		this._flush = B;
+		const V = this._exceptTables;
+		if (V) for (let t = 0; t < _; t++) {
 			const e = u[t];
 			e.block.hasDataTable() && (e.state = e.state & ~Kn | sr, this._skippedTables.add(e));
 		}
-		let z = 0;
-		for (; z < _;) try {
-			for (; z < _; z++) {
-				const n = u[z], s = n.colIndex, l = n.rowIndex;
+		let O = 0;
+		for (; O < _;) try {
+			for (; O < _; O++) {
+				const n = u[O], s = n.colIndex, l = n.rowIndex;
 				if (1 & n.state && t === n.cycleId) {
 					n.state &= -2;
 					continue;
 				}
-				if (P && n.block.hasDataTable()) continue;
+				if (V && n.block.hasDataTable()) continue;
 				const a = n.gridId;
-				a !== S && T(a);
-				const _ = n.block, w = _.representative === n && _.isBlankAware(t), F = n.cachedValue;
-				let L, $, H = !1;
-				"object" == typeof F && null !== F && (F.isIRange ? L = F : m.isError(F, m.Code.Spill) && ($ = F, H = !0));
-				const j = 0 !== (n.state & $n);
-				j && (n.state & Kn) !== sr && (O(), this.doDemandEvaluate(t, e, this._demandBatch, O), c.gridId = a);
-				const K = j ? null : en(n), q = n.inputsAt;
-				if (K && q >= 0) {
-					const t = On(), e = K.length;
+				a !== m && D(a);
+				const _ = n.block, E = _.representative === n && _.isBlankAware(t), M = n.cachedValue;
+				let P, L, $ = !1;
+				"object" == typeof M && null !== M && (M.isIRange ? P = M : I.isError(M, I.Code.Spill) && (L = M, $ = !0));
+				const H = 0 !== (n.state & $n);
+				H && (n.state & Kn) !== sr && (B(), this.doDemandEvaluate(t, e, this._demandBatch, B), c.gridId = a);
+				const j = H ? null : an(n), K = n.inputsAt;
+				if (j && K >= 0) {
+					const t = On(), e = j.length;
 					for (let n = 0; n < e; n++) {
-						const e = K[n];
-						if (m.isError(e)) {
-							t[q + n] = e;
+						const e = j[n];
+						if (I.isError(e)) {
+							t[K + n] = e;
 							continue;
 						}
 						const r = e.colStart, o = e.rowStart, s = e.colEnd, l = e.rowEnd;
 						if (l !== o || r !== s) {
-							let a = e.scope, c = E, h = A, u = N, _ = R;
-							a && a !== S && (_ = i.getGrid(a), _ && (c = _.getValues(), u = D(a), h = _.getEntireCoords.bind(_)));
+							let a = e.scope, c = S, h = b, u = k, _ = R;
+							a && a !== m && (_ = i.getGrid(a), _ && (c = _.getValues(), u = F(a), h = _.getEntireCoords.bind(_)));
 							let f = _;
 							u.intersects(o, r, l, s) && (c = u, f = u);
-							const g = new pt(d, c, { ...e }, null, h, i.resolveScope);
-							g._setErrorIndex(f), t[q + n] = g;
+							const g = new mt(d, c, { ...e }, null, h, i.resolveScope);
+							g._setErrorIndex(f), t[K + n] = g;
 						}
 					}
 				}
-				K && null !== h && 0 !== h.getOpenCount() && 0 === (n.state & Yn) && jl(K, S, i) && (n.state |= Yn);
-				const U = V ? s : l, W = V ? l : s;
+				j && null !== h && 0 !== h.getOpenCount() && 0 === (n.state & Yn) && jl(j, m, i) && (n.state |= Yn);
+				const q = G ? s : l, U = G ? l : s;
 				c.node = n, c.colIndex = s, c.rowIndex = l, c.drawIndex = 0;
 				const X = _.formula;
-				let J, Q = null, Y = !1;
-				const Z = 4 & n.state ? 0 !== (n.state & nr) ? se.CalcStatus.Working : se.CalcStatus.Waiting : 0;
-				let tt = Z;
-				const nt = r ? 0 : Z, rt = n.ext;
-				if (j && !this._iterate && 0 !== (n.state & qn)) null !== rt && (rt.demandValue = void 0), J = Ys(n), tt = 0;
+				let W, J = null, Q = !1;
+				const Y = 4 & n.state ? 0 !== (n.state & nr) ? re.CalcStatus.Working : re.CalcStatus.Waiting : 0;
+				let Z = Y;
+				const tt = r ? 0 : Y, et = n.ext;
+				if (H && !this._iterate && 0 !== (n.state & qn)) null !== et && (et.demandValue = void 0), W = Ys(n), Z = 0;
 				else {
-					if (j) {
-						const t = null !== rt ? rt.demandValue : void 0;
-						null !== rt && (rt.demandValue = void 0), J = void 0 === t ? 0 : t;
+					if (H) {
+						const t = null !== et ? et.demandValue : void 0;
+						null !== et && (et.demandValue = void 0), W = void 0 === t ? 0 : t;
 					} else {
 						if (n.state = n.state & ~Kn | or, c.perCellRead = !1, c.positionRead = !1, 0 !== (n.state & tr)) {
 							n.state &= ~tr;
-							const t = this._settlePass ? bs(E, y, l, s) : null;
+							const t = this._settlePass ? bs(S, y, l, s) : null;
 							if (null !== t && t.direct) {
-								Y = !0, n.state &= -2621441;
-								const e = At(t);
-								e?.isIRange ? (J = X.finalizeValueForCell(e), Q = t) : J = t;
+								Q = !0, n.state &= -2621441;
+								const e = ct(t);
+								e?.isIRange ? (W = X.finalizeValueForCell(e), J = t) : W = t;
 							}
 						}
-						if (!Y) {
+						if (!Q) {
 							this._planStats.evaluated++, n.state &= -2621505;
 							const t = c.deferCount;
-							J = X.evaluateAt(l, s), J = X.finalizeValueForCell(J), (c.perCellRead || c.positionRead) && (n.block.positionRead = !0), c.deferCount !== t && (J = this._takeDeferred(n, J), Q = this._spillHolder, this._spillHolder = null);
+							W = X.evaluateAt(l, s), W = X.finalizeValueForCell(W), (c.perCellRead || c.positionRead) && (n.block.positionRead = !0), c.deferCount !== t && (W = this._takeDeferred(n, W), J = this._spillHolder, this._spillHolder = null);
 						}
 					}
-					tt = 0 !== (n.state & er) ? se.CalcStatus.Working : 0 !== (n.state & (Yn | Zn)) ? se.CalcStatus.Waiting : 0, 0 !== tt && (n.state |= Zn);
+					Z = 0 !== (n.state & er) ? re.CalcStatus.Working : 0 !== (n.state & (Yn | Zn)) ? re.CalcStatus.Waiting : 0, 0 !== Z && (n.state |= Zn);
 				}
-				let ot;
-				(n.state & Kn) !== sr && (n.state = n.state & ~Kn | 768), tt !== nt && (0 === tt ? n.state &= ~(4 | nr) : tt === se.CalcStatus.Working ? n.state |= 4 | nr : n.state = (4 | n.state) & ~nr, p.calcStatusConflating || (p.calcStatusConflating = B(V)), p.calcStatusConflating.append(U, W, 0 !== tt && tt)), j && N.takeDemand(l, s);
-				const st = n.ext, lt = null !== st ? st.fixedRef : null;
-				if (L || $ || lt) {
+				let nt;
+				(n.state & Kn) !== sr && (n.state = n.state & ~Kn | 768), Z !== tt && (0 === Z ? n.state &= ~(4 | nr) : Z === re.CalcStatus.Working ? n.state |= 4 | nr : n.state = (4 | n.state) & ~nr, p.calcStatusConflating || (p.calcStatusConflating = z(G)), p.calcStatusConflating.append(q, U, 0 !== Z && Z)), H && k.takeDemand(l, s);
+				const ot = n.ext, st = null !== ot ? ot.fixedRef : null;
+				if (P || L || st) {
 					Zs.colStart = s, Zs.rowStart = l, Zs.colEnd = s, Zs.rowEnd = l;
 					const t = y.search(Zs);
-					for (let e = 0; !ot && e < t.length; e++) {
+					for (let e = 0; !nt && e < t.length; e++) {
 						const n = t[e];
-						n.value.isAnchor(l, s) && "pivot" !== n.value.getKind() && (ot = n);
+						n.value.isAnchor(l, s) && "pivot" !== n.value.getKind() && (nt = n);
 					}
-					if (ot && (y.remove(ot, Go), !ot || !ot.value.getError())) {
+					if (nt && (y.remove(nt, Go), !nt || !nt.value.getError())) {
 						const t = {
-							...o.sanitizeRange(ot),
-							scope: ot.scope,
+							...o.sanitizeRange(nt),
+							scope: nt.scope,
 							value: null
 						};
-						I.insertNonOverlapping(t), E.delete(t), Ht(k, t);
+						w.insertNonOverlapping(t), S.delete(t), Ht(A, t);
 					}
 				}
-				J = this._fitCell(_, J);
-				let it = 1, at = 1;
-				const ct = J, dt = "object" == typeof J && null !== J, ht = dt && ct.isIRange;
-				let ut, _t = dt && m.isError(J, m.Code.Spill);
-				if (lt) {
-					it = lt.colEnd - lt.colStart + 1, at = lt.rowEnd - lt.rowStart + 1;
+				W = this._fitCell(_, W);
+				let lt = 1, it = 1;
+				const at = W, dt = "object" == typeof W && null !== W, ht = dt && at.isIRange;
+				let ut, _t = dt && I.isError(W, I.Code.Spill);
+				if (st) {
+					lt = st.colEnd - st.colStart + 1, it = st.rowEnd - st.rowStart + 1;
 					const e = {
-						colStart: lt.colStart,
-						rowStart: lt.rowStart,
-						colEnd: lt.colEnd,
-						rowEnd: lt.rowEnd,
+						colStart: st.colStart,
+						rowStart: st.rowStart,
+						colEnd: st.colEnd,
+						rowEnd: st.rowEnd,
 						scope: a
-					}, r = rn(J, e, V)?.tuples;
-					E.delete(e), r && E.setValues(r), Ht(k, e), zt(k, r, V), ut = {
+					}, r = dn(W, e, G)?.tuples;
+					S.delete(e), r && S.setValues(r), Ht(A, e), xe(A, r, G), ut = {
 						...e,
-						value: new x(e, t, "fixed", null, Q)
-					}, y.insert(ut), i.addDynamicPrecedent(n, e, -2), I.insertNonOverlapping({
+						value: new Yt(e, t, "fixed", null, J)
+					}, y.insert(ut), i.addDynamicPrecedent(n, e, -2), w.insertNonOverlapping({
 						...e,
-						value: new Ft(e, G)
+						value: new Dt(e, T)
 					});
-				} else if (ht && ct.size > 1) {
-					it = ct.getColumnCount(), at = ct.getRowCount();
+				} else if (ht && at.size > 1) {
+					lt = at.getColumnCount(), it = at.getRowCount();
 					const e = vl(n), r = null !== e ? l - e.rows : l, c = null !== e ? s - e.columns : s, d = {
 						colStart: c,
 						rowStart: r,
-						colEnd: c + it - 1,
-						rowEnd: r + at - 1,
+						colEnd: c + lt - 1,
+						rowEnd: r + it - 1,
 						scope: a
-					}, h = A(), u = !o.isRangeWithinRange(d, h);
+					}, h = b(), u = !o.isRangeWithinRange(d, h);
 					if (u && (d.colEnd = Math.min(d.colEnd, h.colEnd), d.rowEnd = Math.min(d.rowEnd, h.rowEnd)), _t = u, !_t) {
-						const t = I.search(d);
+						const t = w.search(d);
 						if (_t = t.length > 1, !_t && 1 === t.length) {
 							const e = t[0], n = o.intersectRanges(d, e, Ps);
 							!n || n.rowEnd === n.rowStart && n.colStart === n.colEnd && n.colStart === s && n.rowStart === l || (_t = !0);
 						}
 					}
 					let _, f;
-					if (_t) J = m.BuiltIn.Spill, it = 1, at = 1, _ = [[U, [[W, [J]]]]], E.setValues(_), zt(k, _, V), f = {
+					if (_t) W = I.BuiltIn.Spill, lt = 1, it = 1, _ = [[q, [[U, [W]]]]], S.setValues(_), xe(A, _, G), f = {
 						colStart: s,
 						rowStart: l,
 						colEnd: s,
 						rowEnd: l
 					};
 					else {
-						const t = on(ct, V ? c : r, V ? r : c);
-						t && (_ = t.tuples), E.delete(d), _ && E.setValues(_), Ht(k, d), zt(k, _, V), f = d;
+						const t = hn(at, G ? c : r, G ? r : c);
+						t && (_ = t.tuples), S.delete(d), _ && S.setValues(_), Ht(A, d), xe(A, _, G), f = d;
 					}
 					const g = _t ? {
 						colStart: s,
@@ -7542,67 +7539,67 @@ var Es = class {
 					} : d;
 					ut = {
 						...g,
-						value: new x(g, t, _t ? "error" : "dynamic", _t || null === e ? null : e, Q, _t ? d : null)
-					}, y.insert(ut), i.addDynamicPrecedent(n, d, -2), I.insertNonOverlapping({
+						value: new Yt(g, t, _t ? "error" : "dynamic", _t || null === e ? null : e, J, _t ? d : null)
+					}, y.insert(ut), i.addDynamicPrecedent(n, d, -2), w.insertNonOverlapping({
 						...f,
-						value: new Ft(f, G)
+						value: new Dt(f, T)
 					});
 				}
-				!w || _.blankCycleId === t && _.blankMarkId === this._passMarkId || this._finalizeRepresentative(n, J, p, 0 !== tt || j || !0 === ht || _t || null !== lt || Y);
+				!E || _.blankCycleId === t && _.blankMarkId === this._passMarkId || this._finalizeRepresentative(n, W, p, 0 !== Z || H || !0 === ht || _t || null !== st || Q);
 				let ft = !1;
-				if ((ot || ut || _t || $) && (ft = o.isEqualRanges(ot, ut), ot && b.push(ot), ut && C.push(ut)), ut || ot) {
-					const t = ot ?? ut, e = ut ?? ot, r = {
+				if ((nt || ut || _t || L) && (ft = o.isEqualRanges(nt, ut), nt && C.push(nt), ut && x.push(ut)), ut || nt) {
+					const t = nt ?? ut, e = ut ?? nt, r = {
 						colStart: Math.min(s, t.colStart, e.colStart),
 						rowStart: Math.min(l, t.rowStart, e.rowStart),
 						colEnd: Math.max(s, t.colEnd, e.colEnd),
 						rowEnd: Math.max(l, t.rowEnd, e.rowEnd),
 						scope: a
 					};
-					v.insertNonOverlapping(r), ft && _t === H || (this._invalidatePlans(), i.getPrecedents().search(r).length > 0 && (n.state |= 1, g || (g = new et()), g.insertNonOverlapping(r)));
+					v.insertNonOverlapping(r), ft && _t === $ || (this._invalidatePlans(), i.getPrecedents().search(r).length > 0 && (n.state |= 1, g || (g = new rt()), g.insertNonOverlapping(r)));
 				}
-				n.cachedValue = J, f[M++] = n;
-				const gt = null !== h && h.hasHolders() ? At(J) : J;
-				ht || lt || N.push(l, s, gt), M >= (N.observed ? Rs : ks) && O(), (0 !== (n.state & qn) || null !== n.ext && 0 !== n.ext.shownGroup) && this._trackCircular(n, p, U, W, V);
-				const mt = n.dependents, St = mt.length;
+				n.cachedValue = W, f[N++] = n;
+				const gt = null !== h && h.hasHolders() ? ct(W) : W;
+				ht || st || k.push(l, s, gt), N >= (k.observed ? As : ks) && B(), (0 !== (n.state & qn) || null !== n.ext && 0 !== n.ext.shownGroup) && this._trackCircular(n, p, q, U, G);
+				const pt = n.dependents, St = pt.length;
 				if (St > 0) {
 					const t = !!(4 & n.state), e = !this._iterate && 0 !== (n.state & qn);
 					e && (this._taintGroup = n.ext.cycleGroup);
 					for (let n = 0; n < St; n++) {
-						const r = mt[n];
-						e && ln(r, l, s, this._taintDownstream);
+						const r = pt[n];
+						e && _n(r, l, s, this._taintDownstream);
 						const o = r.value.index;
-						o < 0 || (cn(r) && (Ol = o, Pl = gt, ln(r, l, s, $l)), t && ln(r, l, s, Hl));
+						o < 0 || (gn(r) && (Ol = o, Pl = gt, _n(r, l, s, $l)), t && _n(r, l, s, Hl));
 					}
 				}
 			}
 		} catch (n) {
-			const r = u[z];
-			if (n instanceof Ye || n instanceof Je && this._iterate) {
+			const r = u[O];
+			if (n instanceof on || n instanceof nn && this._iterate) {
 				const o = Ks;
-				if (o.length = 0, n instanceof Ye) for (let t = 0; t < n.count; t++) o.push(n.nodes[t]);
-				o.push(r), O(), r.state &= ~Kn, this.doDemandEvaluate(t, e, o, O);
+				if (o.length = 0, n instanceof on) for (let t = 0; t < n.count; t++) o.push(n.nodes[t]);
+				o.push(r), B(), r.state &= ~Kn, this.doDemandEvaluate(t, e, o, B);
 			} else {
-				if (!(n instanceof Je || n instanceof nn)) throw n;
+				if (!(n instanceof nn || n instanceof cn)) throw n;
 				{
-					const t = n instanceof Je;
+					const t = n instanceof nn;
 					r.state = -3841 & r.state | $n | sr | (t ? lr : ir);
-					const e = Ze(r);
+					const e = sn(r);
 					e.demandValue = Ys(r), e.cycleGroup = t ? ++this._cycleGroupNext : Qs(n.node), t && (e.cycleNext = r), this._addCircular(r);
 				}
 			}
 			c.gridId = r.gridId;
 		}
-		c.node = null, c.colIndex = Number.MAX_SAFE_INTEGER, c.rowIndex = Number.MAX_SAFE_INTEGER, O();
-		for (const t of F.values()) t.commitDemand();
+		c.node = null, c.colIndex = Number.MAX_SAFE_INTEGER, c.rowIndex = Number.MAX_SAFE_INTEGER, B();
+		for (const t of M.values()) t.commitDemand();
 		this._flush = null, this._overlays = null;
-		const L = this._fallbackDirty;
-		return null !== L && (this._fallbackDirty = null, g ? g.insertAllNonOverlapping(L.all()) : g = L), (() => {
+		const P = this._fallbackDirty;
+		return null !== P && (this._fallbackDirty = null, g ? g.insertAllNonOverlapping(P.all()) : g = P), (() => {
 			const t = Bn, e = Vn;
 			for (let n = 0; n < e; n++) t[n] = void 0;
 			Vn = 0;
 		})(), this._planStats.evaluateMs += Ds() - l, g;
 	}
-}, Is = (t, e) => new V.ArrayList(t.slice(0, e));
+}, Is = (t, e) => new L.ArrayList(t.slice(0, e));
 function ys(t, e, n, r, o, s) {
 	const l = e.rowStart + n, i = e.rowStart + r, a = e.colStart + o, c = e.colStart + s;
 	for (let e = 0; e < t.length; e++) {
@@ -7644,8 +7641,8 @@ function Cs(t, e, n) {
 }
 var bs = (t, e, n, r) => {
 	const o = t.getValueAt(n, r);
-	return Rt(o) ? o : Me(e, n, r);
-}, As = Symbol("unsetGridId"), Rs = 1024, ks = 65536;
+	return kt(o) ? o : Ne(e, n, r);
+}, Rs = Symbol("unsetGridId"), As = 1024, ks = 65536;
 function Ns(t, e) {
 	return t.scope !== e.scope ? null === t.scope ? -1 : null === e.scope ? 1 : t.scope.localeCompare(e.scope) : t.colIndex === e.colIndex ? t.rowIndex - e.rowIndex : t.colIndex - e.colIndex;
 }
@@ -7711,7 +7708,7 @@ var Ps = {
 	rowEnd: 0,
 	colEnd: 0,
 	scope: null
-}, Ks = [null], qs = [], Us = [], Ws = [], Xs = [], Js = {
+}, Ks = [null], qs = [], Us = [], Xs = [], Ws = [], Js = {
 	rowStart: 0,
 	colStart: 0,
 	rowEnd: 0,
@@ -7720,12 +7717,12 @@ var Ps = {
 }, Qs = (t) => {
 	const e = t.ext;
 	return null === e ? 0 : 0 !== (t.state & qn) ? e.cycleGroup : e.shownGroup;
-}, Ys = (t) => At(t.cachedValue) ?? 0, Zs = {
+}, Ys = (t) => ct(t.cachedValue) ?? 0, Zs = {
 	rowStart: 0,
 	colStart: 0,
 	rowEnd: 0,
 	colEnd: 0
-}, tl = 1e4, el = st(tl), nl = st(tl), rl = st(tl), ol = st(tl), sl = st(tl), ll = st(tl), il = st(tl), al = st(tl), cl = st(tl), dl = st(tl), hl = st(tl), ul = st(tl), _l = st(tl), fl = st(tl), gl = st(tl), pl = st(tl), ml = [null], Sl = [], wl = -1, El = -1, Il = -1, yl = -1;
+}, tl = 1e4, el = it(tl), nl = it(tl), rl = it(tl), ol = it(tl), sl = it(tl), ll = it(tl), il = it(tl), al = it(tl), cl = it(tl), dl = it(tl), hl = it(tl), ul = it(tl), _l = it(tl), fl = it(tl), gl = it(tl), pl = it(tl), ml = [null], Sl = [], wl = -1, El = -1, Il = -1, yl = -1;
 function vl(t) {
 	const e = t.block.formula;
 	return null !== e && void 0 !== e.getSpillOrigin ? e.getSpillOrigin() : null;
@@ -7738,7 +7735,7 @@ function xl(t) {
 	const o = vl(t);
 	return Il = null !== o ? t.rowIndex - o.rows : t.rowIndex, yl = null !== o ? t.colIndex - o.columns : t.colIndex, wl = Il + r.getRowCount() - 1, El = yl + r.getColumnCount() - 1, wl > Il || El > yl;
 }
-var Cl = null, bl = 0, Al = 64, Rl = 4, kl = 1024, Nl = 7, Ml = st(8), Fl = st(8), Dl = st(8), Tl = Array.from({ length: 8 }, () => ({
+var Cl = null, bl = 0, Rl = 64, Al = 4, kl = 1024, Nl = 7, Ml = it(8), Fl = it(8), Dl = it(8), Tl = Array.from({ length: 8 }, () => ({
 	colStart: 0,
 	colEnd: 0,
 	rowStart: 0,
@@ -7753,7 +7750,7 @@ var Cl = null, bl = 0, Al = 64, Rl = 4, kl = 1024, Nl = 7, Ml = st(8), Fl = st(8
 }, jl = (t, e, n) => {
 	for (let r = 0; r < t.length; r++) {
 		const o = t[r];
-		if (!o || m.isError(o)) continue;
+		if (!o || I.isError(o)) continue;
 		const s = n.getGrid(o.scope ?? e)?._calcStatusSpatial;
 		if (!s) continue;
 		const l = s.search(o);
@@ -7770,12 +7767,12 @@ function Kl(t, e) {
 	return n === r ? 0 : 1 / 0;
 }
 var ql = {
-	values: st(tl),
+	values: it(tl),
 	length: 0
 }, Ul = {
-	values: st(tl),
+	values: it(tl),
 	length: 0
-}, Wl = class {
+}, Xl = class {
 	constructor(t) {
 		this._namesByKey = /* @__PURE__ */ new Map(), this._namesById = /* @__PURE__ */ new Map(), this._hostsById = /* @__PURE__ */ new Map(), this._loadedData = /* @__PURE__ */ new Map(), this._options = t;
 	}
@@ -7784,14 +7781,14 @@ var ql = {
 		for (let e = 0; e < a.length; e++) {
 			const c = a[e], d = c.getId(), h = c.getSheetNames();
 			for (let t = 0; t < h.length; t++) {
-				const e = ht(d, t);
+				const e = ut(d, t);
 				s.add(e), o && (n(e) ? this._loadedData.get(e) !== (c.getSheetData(t)?.data ?? null) && (r(e), this._registerSheet(c, t, e), i.add(d)) : (this._registerSheet(c, t, e), i.add(d)));
 			}
 			const u = c.getDefinedNames();
 			for (let e = 0; e < u.length; e++) {
 				const n = u[e];
 				if (!n.name) continue;
-				const r = n.sheetIndex, o = ht(d, void 0 !== r && r >= 0 && r < h.length ? r : -1), s = Xl(o, n.name);
+				const r = n.sheetIndex, o = ut(d, void 0 !== r && r >= 0 && r < h.length ? r : -1), s = Wl(o, n.name);
 				l.add(s);
 				const a = this._namesByKey.get(s);
 				if (a) {
@@ -7803,17 +7800,17 @@ var ql = {
 				} else this._registerName(c, o, n, t), i.add(d);
 			}
 		}
-		for (const t of this._registeredSheetGrids()) s.has(t) || (r(t), this._loadedData.delete(t), i.add(de(t).bookId));
+		for (const t of this._registeredSheetGrids()) s.has(t) || (r(t), this._loadedData.delete(t), i.add(ae(t).bookId));
 		for (const [t, e] of this._namesByKey) {
 			if (l.has(t)) continue;
 			this._namesByKey.delete(t), this._namesById.delete(e.getId());
 			const n = this._hostsById.get(e.getId());
-			this._hostsById.delete(e.getId()), n?.setPlaceholder(m.BuiltIn.Name.toString()), i.add(de(e.getScope()).bookId);
+			this._hostsById.delete(e.getId()), n?.setPlaceholder(I.BuiltIn.Name.toString()), i.add(ae(e.getScope()).bookId);
 		}
 		return i;
 	}
 	getNameByScope(t, e) {
-		return this._namesByKey.get(Xl(e, t)) ?? null;
+		return this._namesByKey.get(Wl(e, t)) ?? null;
 	}
 	getNameById(t) {
 		return this._namesById.get(t) ?? null;
@@ -7821,7 +7818,7 @@ var ql = {
 	_registeredSheetGrids() {
 		const t = [];
 		for (const e of this._options.gridIds()) {
-			const n = de(e);
+			const n = ae(e);
 			n && n.sheetIndex >= 0 && t.push(e);
 		}
 		return t;
@@ -7848,7 +7845,7 @@ var ql = {
 			}
 			if (0 === e.length) return null;
 			e.sort((t, e) => t.col - e.col || t.row - e.row);
-			const n = new L.Builder();
+			const n = new j.Builder();
 			for (let t = 0; t < e.length; t++) n.pushAt(e[t].col, e[t].row, e[t].value);
 			return n.build()?.tuples ?? null;
 		}(o);
@@ -7861,15 +7858,15 @@ var ql = {
 			getScope: () => e,
 			refersTo: n.refersTo ?? ""
 		};
-		this._namesByKey.set(Xl(e, n.name), i), this._namesById.set(l, i);
+		this._namesByKey.set(Wl(e, n.name), i), this._namesById.set(l, i);
 		const a = s(l);
 		this._hostsById.set(l, a), this._queueBody(l, a, t, e, i.refersTo, r);
 	}
 	_queueBody(t, e, n, r, o, s) {
 		const { queue: l, recompileNamed: i } = this._options;
 		let a = o.trim();
-		a.startsWith("=") && (a = a.substring(1)), a || (a = m.BuiltIn.Ref.toString());
-		const c = de(r), d = c.sheetIndex >= 0 ? c.sheetIndex : n.getSheetNames().length > 0 ? 0 : -1, h = ht(c.bookId, d);
+		a.startsWith("=") && (a = a.substring(1)), a || (a = I.BuiltIn.Ref.toString());
+		const c = ae(r), d = c.sheetIndex >= 0 ? c.sheetIndex : n.getSheetNames().length > 0 ? 0 : -1, h = ut(c.bookId, d);
 		l(async () => {
 			this._hostsById.get(t) === e && e.setBody({
 				coords: Jl,
@@ -7879,7 +7876,7 @@ var ql = {
 			}) && (s || i(t));
 		});
 	}
-}, Xl = (t, e) => t + "::" + e.toLowerCase(), Jl = Object.freeze({
+}, Wl = (t, e) => t + "::" + e.toLowerCase(), Jl = Object.freeze({
 	colStart: 0,
 	rowStart: 0,
 	colEnd: 0,
@@ -7905,7 +7902,7 @@ var ql = {
 			deferOrdinal: 0,
 			deferRoot: !1,
 			deferServed: null
-		}, this._cycleId = 0, this._staticEpoch = 1, this._precedentEpoch = 1, this._epochSeenFormulas = null, this._epochSeenPrecedents = null, this._epochSeenDynamics = null, this._volatiles = /* @__PURE__ */ new Set(), this._calculatedCommitId = null, this._calculatedEngineId = null, this._holdsGrids = !1, this._engineIds = /* @__PURE__ */ new Map(), this._landingOf = /* @__PURE__ */ new Map(), this._mirroredId = null, this._lastRevert = null, this._symbolIndex = null, this._symbolIndexOf = null, this._sheetsDerived = null, this._tablesDerived = null, this._namesDerived = null, this._collecting = null, this._recompileNamedPending = null, this._recompileLoadedPending = null, this._invalidateNamedPending = null, this.resolveScope = (t) => this._symbols.resolve(ue.Sheet, t)?.toString(), this._heldCloneKey = null, this._callbacks = t.callbacks, this._runtime = t.runtime, this._richData = t.richData ?? v.DetachedContext, this._symbols = t.symbols, this._resolvers = t.resolvers, this._getSheetIndex = t.getSheetIndex ?? null, this._legacyIntersect = !0 === t.legacyIntersect, this._gridOptions = t.gridOptions ?? {}, this._calculation = t.calculation;
+		}, this._cycleId = 0, this._staticEpoch = 1, this._precedentEpoch = 1, this._epochSeenFormulas = null, this._epochSeenPrecedents = null, this._epochSeenDynamics = null, this._volatiles = /* @__PURE__ */ new Set(), this._calculatedCommitId = null, this._calculatedEngineId = null, this._holdsGrids = !1, this._engineIds = /* @__PURE__ */ new Map(), this._landingOf = /* @__PURE__ */ new Map(), this._mirroredId = null, this._lastRevert = null, this._symbolIndex = null, this._symbolIndexOf = null, this._sheetsDerived = null, this._tablesDerived = null, this._namesDerived = null, this._collecting = null, this._recompileNamedPending = null, this._recompileLoadedPending = null, this._invalidateNamedPending = null, this.resolveScope = (t) => this._symbols.resolve(de.Sheet, t)?.toString(), this._heldCloneKey = null, this._callbacks = t.callbacks, this._runtime = t.runtime, this._richData = t.richData ?? C.DetachedContext, this._symbols = t.symbols, this._resolvers = t.resolvers, this._getSheetIndex = t.getSheetIndex ?? null, this._legacyIntersect = !0 === t.legacyIntersect, this._gridOptions = t.gridOptions ?? {}, this._calculation = t.calculation;
 		const e = t.replica;
 		this._updateState({
 			gridsAll: /* @__PURE__ */ new Map(),
@@ -7924,8 +7921,8 @@ var ql = {
 			} }),
 			dynamicByBlock: /* @__PURE__ */ new Map(),
 			dirtySpatial: new wn()
-		}), t.modelCommitId && this.mirror(t.modelCommitId), this._context = new io(this, w.Axis.Column, t.functions), this._deferred = new Qo(this._calcScope, (t, e, n) => this._holderAt(t, e, n), () => this._runtime.getRandom(), () => this._settle(), void 0, (t, e) => this._normalizeResult(t, e), {
-			createRichData: (t, e) => P.fromJSON({
+		}), t.modelCommitId && this.mirror(t.modelCommitId), this._context = new io(this, E.Axis.Column, t.functions), this._deferred = new Qo(this._calcScope, (t, e, n) => this._holderAt(t, e, n), () => this._runtime.getRandom(), () => this._settle(), void 0, (t, e) => this._normalizeResult(t, e), {
+			createRichData: (t, e) => J.fromJSON({
 				type: t,
 				data: e
 			}, this._richData),
@@ -7935,7 +7932,7 @@ var ql = {
 			parseText: t.parseText
 		}, () => this._callbacks.onPendingChange());
 		const n = this._callbacks;
-		this._calcExecutor = new Es(this, this._context), t.planCacheMode && (this._calcExecutor.planCacheMode = t.planCacheMode), this._externalBindings = new Wl({
+		this._calcExecutor = new Es(this, this._context), t.planCacheMode && (this._calcExecutor.planCacheMode = t.planCacheMode), this._externalBindings = new Xl({
 			books: t.books,
 			createGrid: (t) => this.createBackendGrid({ uuid: t }),
 			unregisterGrid: (t) => {
@@ -7984,7 +7981,7 @@ var ql = {
 			let a = r.get(l);
 			if (!a) {
 				const t = this.getGrid(l);
-				a = new ti(!t || t.getValues().getAxis() === w.Axis.Column), r.set(l, a);
+				a = new ti(!t || t.getValues().getAxis() === E.Axis.Column), r.set(l, a);
 			}
 			a.add(s.rowIndex, s.colIndex);
 		}
@@ -8003,7 +8000,7 @@ var ql = {
 		if (Array.isArray(n)) try {
 			n = this._context.getRange(n);
 		} catch (t) {
-			return new m.Value("The result is not a rectangular array", { cause: t });
+			return new I.Value("The result is not a rectangular array", { cause: t });
 		}
 		return n?.isIRange && n.size <= 1 ? 0 === n.size ? null : n.getValueAt(0, 0) : (e?.keepBlanks && n?.isIRange && ((t) => {
 			Cn.add(t);
@@ -8013,7 +8010,7 @@ var ql = {
 		const r = this.getGrid(t);
 		if (!r) return null;
 		const o = r.getValues().getValueAt(e, n);
-		return Rt(o) ? o : Me(r.getSpills(), e, n);
+		return kt(o) ? o : Ne(r.getSpills(), e, n);
 	}
 	_settleNow() {
 		const t = this._deferred, e = t.takeMoved();
@@ -8022,7 +8019,7 @@ var ql = {
 			let r = t.get(e);
 			if (!r) {
 				const o = n.gridsAll.get(e);
-				r = new ti(!o || o.getValues().getAxis() === w.Axis.Column), t.set(e, r);
+				r = new ti(!o || o.getValues().getAxis() === E.Axis.Column), t.set(e, r);
 			}
 			return r;
 		}, a = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set(), d = [], h = (t) => {
@@ -8033,13 +8030,13 @@ var ql = {
 			if (null === _ || !o.isLiveNode(_)) continue;
 			const f = _.gridId, g = n.gridsAll.get(f);
 			if (!g) continue;
-			const p = _.rowIndex, S = _.colIndex, w = g.getValues().getValueAt(p, S), E = Rt(w), I = E ? w : Me(g.getSpills(), p, S);
-			if (null === I || I.calls.indexOf(u) < 0) continue;
-			if (!I.direct) {
-				c.add(_), i(s, f).add(p, S);
+			const p = _.rowIndex, m = _.colIndex, S = g.getValues().getValueAt(p, m), w = kt(S), E = w ? S : Ne(g.getSpills(), p, m);
+			if (null === E || E.calls.indexOf(u) < 0) continue;
+			if (!E.direct) {
+				c.add(_), i(s, f).add(p, m);
 				continue;
 			}
-			if (!E || u.latest?.isIRange) {
+			if (!w || u.latest?.isIRange) {
 				d.push(_);
 				continue;
 			}
@@ -8048,18 +8045,18 @@ var ql = {
 				grid: g,
 				runs: i(/* @__PURE__ */ new Map(), f),
 				errors: /* @__PURE__ */ new Map()
-			}), y.runs.add(p, S);
+			}), y.runs.add(p, m);
 			const v = u.latest;
-			if (m.isError(v)) {
+			if (I.isError(v)) {
 				const t = v.getLabel(), e = {
-					colStart: S,
+					colStart: m,
 					rowStart: p,
-					colEnd: S,
+					colEnd: m,
 					rowEnd: p
 				}, n = y.errors.get(t);
 				n ? n.push(e) : y.errors.set(t, [e]);
 			}
-			_.state &= -6815749, Zl.colStart = S, Zl.colEnd = S, Zl.rowStart = p, Zl.rowEnd = p, Zl.scope = f;
+			_.state &= -6815749, Zl.colStart = m, Zl.colEnd = m, Zl.rowStart = p, Zl.rowEnd = p, Zl.scope = f;
 			const x = r.search(Zl);
 			for (let t = 0; t < x.length; t++) {
 				const e = x[t], n = e.value;
@@ -8071,7 +8068,7 @@ var ql = {
 					});
 					continue;
 				}
-				ln(e, p, S, h);
+				_n(e, p, m, h);
 			}
 		}
 		for (const [e, n] of a) {
@@ -8112,8 +8109,8 @@ var ql = {
 	createFormulaBlock(t, e, n, r, o, s, l) {
 		const i = this._callbacks.getCompiler(s);
 		if (!i) throw new Error("The calculation engine has not started; nothing can compile yet.");
-		const a = de(t)?.bookId ?? null, c = a ? null : de(this._externalBindings.getNameById(t)?.getScope() ?? "")?.bookId ?? null;
-		return new bn(i.compile(e.getRuntime(), r, o, n, this._symbols, (t) => e.getFunction(t), a ?? c ? ht(a ?? c, -1) : this.getSheetName(t), l, a ? { book: a } : void 0), e, this._calcScope, t, () => this.getGrid(t)?.getEntireCoords() ?? null, this._resolvers);
+		const a = ae(t)?.bookId ?? null, c = a ? null : ae(this._externalBindings.getNameById(t)?.getScope() ?? "")?.bookId ?? null;
+		return new bn(i.compile(e.getRuntime(), r, o, n, this._symbols, (t) => e.getFunction(t), a ?? c ? ut(a ?? c, -1) : this.getSheetName(t), l, a ? { book: a } : void 0), e, this._calcScope, t, () => this.getGrid(t)?.getEntireCoords() ?? null, this._resolvers);
 	}
 	getSymbols() {
 		return this._symbols;
@@ -8130,15 +8127,15 @@ var ql = {
 		return this._sheetsCache().ids;
 	}
 	getSheetSpanIds(t) {
-		const e = ke(t);
+		const e = Ae(t);
 		if (e) {
 			const t = this.getSheetIds(), n = t.indexOf(e[0]), r = t.indexOf(e[1]);
 			return -1 === n || -1 === r ? null : t.slice(Math.min(n, r), Math.max(n, r) + 1);
 		}
-		const n = de(t);
+		const n = ae(t);
 		if (!n || n.sheetEnd === n.sheetIndex) return null;
 		const r = [];
-		for (let t = n.sheetIndex; t <= n.sheetEnd; t++) r.push(ht(n.bookId, t));
+		for (let t = n.sheetIndex; t <= n.sheetEnd; t++) r.push(ut(n.bookId, t));
 		return r;
 	}
 	getFormulas() {
@@ -8247,7 +8244,7 @@ var ql = {
 	}
 	markDirty(t) {
 		const e = this._getState(), n = e.dirtySpatial.clone(this._heldCloneKey), r = e.precedentSpatial, o = e.formulaSpatial;
-		let s = !1, l = nt(t, w.Axis.Column, 2);
+		let s = !1, l = ot(t, E.Axis.Column, 2);
 		for (let t = 0; t < l.length; t++) {
 			const e = l[t];
 			(r?.has(e) || o?.has(e)) && (s = !0, n.insertNonOverlapping(e));
@@ -8497,15 +8494,15 @@ var ql = {
 		switch (n.type) {
 			case "sheets": return this.applySheets(n.sheets), {
 				cycleId: this._cycleId,
-				commitId: T(n)
+				commitId: V(n)
 			};
 			case "tables": return this.applyTables(n.changes), {
 				cycleId: this._cycleId,
-				commitId: T(n)
+				commitId: V(n)
 			};
 			case "names": return this.applyNames(n.changes), {
 				cycleId: this._cycleId,
-				commitId: T(n)
+				commitId: V(n)
 			};
 			case "nameGraph": return {
 				cycleId: this._cycleId,
@@ -8518,7 +8515,7 @@ var ql = {
 		const o = this.getGrid(t);
 		return o ? r ? o._apply(n, this.getCurrentCommitId(), !0) : o._apply(n, e) : {
 			cycleId: this._cycleId,
-			commitId: T(n)
+			commitId: V(n)
 		};
 	}
 	applyHeld(t, e) {
@@ -8583,7 +8580,7 @@ var ql = {
 		return l;
 	}
 	followRestore(t, e) {
-		return e === dt.Status.Off || e === dt.Status.Error ? (this.retarget(t), !1) : e !== dt.Status.Running ? (null !== this.restoreTo(t) || this.holdsModelCommit(t) || this.retarget(t), !1) : this.holdsModelCommit(t) ? (this.restoreTo(t), !1) : (this.retarget(t), !0);
+		return e === ht.Status.Off || e === ht.Status.Error ? (this.retarget(t), !1) : e !== ht.Status.Running ? (null !== this.restoreTo(t) || this.holdsModelCommit(t) || this.retarget(t), !1) : this.holdsModelCommit(t) ? (this.restoreTo(t), !1) : (this.retarget(t), !0);
 	}
 	rebuild(t) {
 		this.drop(), this.setReplica(t), this.open();
@@ -8615,13 +8612,13 @@ var ql = {
 				if (u.deferCount !== l) {
 					const t = this._deferred, e = t.endEvaluation();
 					o.cachedValue = e.calls.length > 0 ? t.newHolder(a, e) : void 0, t.flush();
-				} else Rt(o.cachedValue) && (o.cachedValue = void 0);
-				let c = tn(t.finalizeValue(a));
+				} else kt(o.cachedValue) && (o.cachedValue = void 0);
+				let c = ln(t.finalizeValue(a));
 				return null === c && (c = 0), !r || c?.isIRange || Array.isArray(c) ? c : i.createRange(1, 1, c);
 			},
 			getCalls: () => {
 				const t = f.getAnchorNode().cachedValue;
-				return Rt(t) ? t.calls : r.EmptyArray;
+				return kt(t) ? t.calls : r.EmptyArray;
 			}
 		};
 	}
@@ -8638,7 +8635,7 @@ var ql = {
 			for (let t = 0; t < n.length; t++) {
 				const r = n[t].value;
 				if (null == r.gridId) continue;
-				if (it(r.gridId) || this._externalBindings.getNameById(r.gridId)) continue;
+				if (y(r.gridId) || this._externalBindings.getNameById(r.gridId)) continue;
 				const o = r.getReferencedSymbolIds();
 				if (0 === o.length) continue;
 				const s = r.ref, l = {
@@ -8701,10 +8698,10 @@ var ql = {
 				e ? e.push(l[t]) : s.set(u, [l[t]]);
 				continue;
 			}
-			const _ = null != u && !n.isDefinedName(u) && !it(u) && !this._externalBindings.getNameById(u);
+			const _ = null != u && !n.isDefinedName(u) && !y(u) && !this._externalBindings.getNameById(u);
 			if (h && _) for (let t = 0; t < o.length; t++) {
 				const [e, n] = o[t];
-				a.includes(e) && (h = h.replaceTableReferences(e, (t) => jt(t, n) ? ee() : null));
+				a.includes(e) && (h = h.replaceTableReferences(e, (t) => jt(t, n) ? Zt() : null));
 			}
 			const f = h && h !== i.formula ? h.getTextAt(d.rowStart, d.colStart) : i.getTextAt(d.rowStart, d.colStart);
 			this._writeBlockText(i, f);
@@ -8712,7 +8709,7 @@ var ql = {
 		if (s) for (const [t, e] of s) this.getGrid(t)?._rederivePrecedentsNow(e);
 	}
 	refitTableRows(t, e, n, r, s) {
-		const l = this._symbols.bind(ue.Sheet, t);
+		const l = this._symbols.bind(de.Sheet, t);
 		if (!l) return;
 		const i = this._getState().precedentSpatial.search({
 			colStart: e.colStart,
@@ -8726,7 +8723,7 @@ var ql = {
 			const e = i[t].value;
 			if (e.index < 0) continue;
 			const n = e.formulaEntry.value, r = n.gridId;
-			if (null == r || it(r) || this._externalBindings.getNameById(r)) continue;
+			if (null == r || y(r) || this._externalBindings.getNameById(r)) continue;
 			const o = (a ??= /* @__PURE__ */ new Map()).get(n);
 			o ? o.includes(e.index) || o.push(e.index) : a.set(n, [e.index]);
 		}
@@ -8792,11 +8789,11 @@ var ql = {
 		}
 	}
 	rewriteTableReferences(t, e) {
-		const n = (t) => e ? Ne(t, e) : ee(), r = this._callbacks, o = this._getState().formulaSpatial.all3D();
+		const n = (t) => e ? ke(t, e) : Zt(), r = this._callbacks, o = this._getState().formulaSpatial.all3D();
 		for (let e = 0; e < o.length; e++) {
 			const s = o[e].value, l = s.gridId;
 			if (null == l || !s.getReferencedSymbolIds().includes(t)) continue;
-			if (r.isDefinedName(l) || it(l) || this._externalBindings.getNameById(l)) continue;
+			if (r.isDefinedName(l) || y(l) || this._externalBindings.getNameById(l)) continue;
 			const i = s.formula, a = i?.replaceTableReferences(t, n);
 			if (!a || a === i) continue;
 			const c = s.ref;
@@ -9177,7 +9174,7 @@ var ql = {
 	scope: void 0
 }, ti = class {
 	constructor(t) {
-		this._unordered = null, this._lastMajor = -1, this._lastMinor = -1, this._isColumn = t, this._conflating = B(t);
+		this._unordered = null, this._lastMajor = -1, this._lastMinor = -1, this._isColumn = t, this._conflating = z(t);
 	}
 	add(t, e) {
 		const n = this._unordered;
@@ -9206,7 +9203,7 @@ var ql = {
 	colEnd: t.colEnd,
 	rowEnd: t.rowEnd
 }), ni = (t) => {
-	const e = nt(t, w.Axis.Column, 2), n = new Array(e.length);
+	const e = ot(t, E.Axis.Column, 2), n = new Array(e.length);
 	for (let t = 0; t < e.length; t++) {
 		const r = e[t];
 		n[t] = {