@sheetxl/mcp 0.8.0-beta.24 → 1.0.0

package/assets/{C-nA4SXN5hWHaxV6.js → BPlrBhzIqyWK19E2.js}

@@ -1,18 +1,18 @@
 /**
-* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v0.8.0-beta.24
+* @license @sheetxl/mcp - MCP server exposing SheetXL spreadsheet operations as tools and resources. - v1.0.0
 *
 * (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 "./DMDTS0LH9Ke9t-3z.js";
-import { a as i, r as a } from "./TZnuVwhVjkOBax9F.js";
-import { A as c, at as d, mt as h, p as u, sn as _, v as f, z as g } from "./B16G2473LTkZP6Mq.js";
-import { a as p, f as m, l as S, m as w, p as E, u as I } from "./DRzZ4bEyLRGVOLzV.js";
-import { $t as y, A as v, Aa as x, An as C, Ba as b, Bi as R, C as A, Ci as k, Ct as N, D as M, Da as F, Dr as D, E as T, Ea as G, En as B, Et as V, F as O, Fa as P, Fn as z, Ft as L, G as $, Ga as H, Gt as j, H as K, Ha as q, Ir as W, Ja as U, Jn as X, Jr as J, Ka as Z, Ki as Q, Li as Y, Ln as tt, Mn as et, Mr as nt, Ni as rt, Nr as ot, Or as st, P as lt, Pn as it, Pr as at, Pt as ct, Q as dt, Qi as ht, R as ut, Ri as _t, T as ft, Ta as gt, V as pt, Vn as mt, Wi as St, Wr as wt, X as Et, Y as It, Yr as yt, Z as vt, Zi as xt, Zn as Ct, Zr as bt, _n as Rt, _t as At, a as kt, ao as Nt, bt as Mt, ci as Ft, cn as Dt, cr as Tt, ct as Gt, da as Bt, di as Vt, dt as Ot, ea as Pt, eo as zt, f as Lt, fn as $t, gn as Ht, gr as jt, h as Kt, ha as qt, hi as Wt, hn as Ut, hr as Xt, ht as Jt, i as Zt, in as Qt, it as Yt, j as te, ja as ee, ka as ne, ki as re, kr as oe, lo as se, m as le, mi as ie, mr as ae, nt as ce, o as de, oo as he, pr as ue, qn as _e, r as fe, ra as ge, ri as pe, ro as me, rr as Se, s as we, sa as Ee, sr as Ie, t as ye, tn as ve, to as xe, tr as Ce, ut as be, va as Re, vr as Ae, w as ke, wi as Ne, wn as Me, wt as Fe, xi as De, xr as Te, y as Ge, yi as Be, yn as Ve } from "./C9iFJ52KwQTePQ81.js";
-import { _ as Oe, a as Pe, c as ze, d as Le, f as $e, g as He, h as je, i as Ke, l as qe, m as We, n as Ue, o as Xe, p as Je, r as Ze, s as Qe, u as Ye } from "./B-5mBXpY9i6-eCrZ.js";
-import { c as tn, i as en, n as nn, o as rn, s as on, t as sn } from "./CnI4Nli8vtWdFKvf.js";
-import { C as ln, E as an, O as cn, _ as dn, a as hn, b as un, d as _n, m as fn, r as gn, u as pn } from "./BrJd9jVVv9SQzZol.js";
-import { n as mn } from "./6CBUVbF01Bedq0e2.js";
+import { Q as t, St as e, Z as n, ht as r, ot as o, r as s, u as l } from "./DzYvbv5u7E2H7IoB.js";
+import { a as i, r as a } from "./BaZAIwIrqn1x69WH.js";
+import { $ as c, Dt as d, I as h, Nt as u, Xt as _, n as f, sn as g } from "./8hLtXHueDl7B_SEn.js";
+import { a as p, f as m, l as S, m as w, p as E, u as I } from "./8mWHFnE0j-CaNsxr.js";
+import { $a as y, $i as v, $r as x, A as C, An as b, At as R, Ba as A, C as k, Ca as N, Cr as M, Di as F, Ea as D, En as T, F as G, Fa as B, Fi as V, Fr as O, Ft as P, Gi as z, Ha as L, Ht as $, Ia as H, In as j, Ji as K, Jn as q, Jt as U, K as X, Ki as W, Kr as J, Kt as Y, La as Q, Li as Z, Ni as tt, Nr as et, Nt as nt, Oi as rt, On as ot, Or as st, P as lt, Pa as it, Qi as at, Qt as ct, Ri as dt, S as ht, Sa as ut, Tt as _t, U as ft, Ui as gt, Un as pt, Ur as mt, Vi as St, Vr as wt, Wr as Et, X as It, Xa as yt, Xi as vt, Xt as xt, Ya as Ct, Yi as bt, Yn as Rt, Yr as At, Z as kt, Zr as Nt, _ as Mt, _i as Ft, _n as Dt, _r as Tt, _t as Gt, aa as Bt, ai as Vt, an as Ot, ao as Pt, bi as zt, bn as Lt, co as $t, dn as Ht, ea as jt, et as Kt, fi as qt, fo as Ut, gi as Xt, ha as Wt, hr as Jt, it as Yt, ja as Qt, jt as Zt, k as te, l as ee, lt as ne, mn as re, mo as oe, mr as se, na as le, nn as ie, no as ae, nr as ce, o as de, oa as he, oi as ue, oo as _e, or as fe, q as ge, qt as pe, ra as me, s as Se, sa as we, si as Ee, tn as Ie, tr as ye, u as ve, ur as xe, ut as Ce, vi as be, wi as Re, wn as Ae, wr as ke, xa as Ne, xn as Me, xt as Fe, yt as De, za as Te, zn as Ge, zr as Be, zt as Ve } from "./Dcw7GSCgw_dgsum7.js";
+import { c as Oe, i as Pe, n as ze, o as Le, s as $e, t as He } from "./B5rrqMYFybo3oW9k.js";
+import { _ as je, a as Ke, c as qe, d as Ue, f as Xe, g as We, h as Je, i as Ye, l as Qe, m as Ze, n as tn, o as en, p as nn, r as rn, s as on, u as sn } from "./q6advQx4x6PXvl0i.js";
+import { C as ln, E as an, O as cn, _ as dn, a as hn, b as un, d as _n, m as fn, r as gn, u as pn } from "./DvHZEP1wpb6549uf.js";
+import { n as mn } from "./DCWHNfq5qCxvALwe.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 be({
+			t = new Z({
 				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 N;
+		if (null == r) return Ie;
 		const o = e?.bounds;
-		if (o && ((o.colStart ?? 0) > 0 || (o.rowStart ?? 0) > 0 || (o.colEnd ?? 0) < 0 || (o.rowEnd ?? 0) < 0)) return N;
-		const s = e?.axis ? e.axis === t.Column : this._axis === t.Column, l = e ? x(e.reuseResult) : void 0, i = this;
+		if (o && ((o.colStart ?? 0) > 0 || (o.rowStart ?? 0) > 0 || (o.colEnd ?? 0) < 0 || (o.rowEnd ?? 0) < 0)) return Ie;
+		const s = e?.axis ? e.axis === t.Column : this._axis === t.Column, l = e ? v(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 ? it : (a = !0, Xt(0, 0, r, s, l)),
+			next: (t) => c ? c.next(t) : t ? (c = i._materialize().entries(e), c.next(t)) : a ? It : (a = !0, W(0, 0, r, s, l)),
 			[Symbol.iterator]() {
 				return this;
 			},
-			return: (t) => it,
-			throw: (t) => it
+			return: (t) => It,
+			throw: (t) => It
 		};
 	}
 	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 me(this._options2D), this._mapScopeTo2Ds.set(t, e), this._last2DKey = t, this._last2DMap = e), e;
+		return e || (e = new nt(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 ??= Wt(this);
+		return this._asFunction ??= Se(this);
 	}
 	execute(...t) {
 		return this._function().execute(...t);
@@ -301,7 +301,7 @@ var Sn = class e {
 			try {
 				return t.execute(...e);
 			} catch (t) {
-				if (yt(t)) throw t;
+				if (N(t)) throw t;
 				return I.isError(t) ? t : new I.Value(t?.message, { cause: t });
 			}
 		};
@@ -342,17 +342,17 @@ var Sn = class e {
 		const s = "display" === o, l = this._compiled;
 		if (l.error && !l.ast) return l.error.input;
 		let i = void 0 !== r ? un(l.ast, r) : l.getTokens();
-		i = Kt(i, l.symbols, !s, s, s ? {
+		i = ke(i, l.symbols, !s, s, s ? {
 			scope: this._gridId,
 			rowIndex: t,
 			colIndex: e
 		} : null);
-		const a = s ? this._displayLocale() : q;
-		return n ? oe(i, this._getEntireCoords?.(), a) : Ht(i, this._getEntireCoords?.(), t, e, a);
+		const a = s ? this._displayLocale() : Pt;
+		return n ? Mt(i, this._getEntireCoords?.(), a) : F(i, this._getEntireCoords?.(), t, e, a);
 	}
 	_displayLocale() {
 		const t = this._context.getRuntime().getLocaleProfile();
-		return v(he(t.decimal));
+		return te(Ct(t.decimal));
 	}
 	getRecord() {
 		const t = this._record;
@@ -396,7 +396,7 @@ var Sn = class e {
 					$rowEnd: e.$rowEnd,
 					scope: t.scope
 				};
-			} else n.node.type === le.Cell ? i = { ...o[n.value] } : n.op === le.Named ? i = { nameId: n.node.value.nameId } : n.op === le.TableReference && (i = { table: { ...n.node.value } });
+			} else n.node.type === M.Cell ? i = { ...o[n.value] } : n.op === M.Named ? i = { nameId: n.node.value.nameId } : n.op === M.TableReference && (i = { table: { ...n.node.value } });
 			s[t] = i;
 		}
 		return s;
@@ -408,7 +408,7 @@ var Sn = class e {
 	getTokensAt(t, e, n) {
 		const r = this._compiled;
 		let o = void 0 !== n ? un(r.ast, n) : r.getTokens();
-		return o = Kt(o, r.symbols, !1, !0), te(o, t, e);
+		return o = ke(o, r.symbols, !1, !0), C(o, t, e);
 	}
 	getError() {
 		return this._compiled.error ?? null;
@@ -462,12 +462,12 @@ var Sn = class e {
 		const n = this._compiled.getTokens(), r = e._compiled.getTokens();
 		if (n.length !== r.length) return !1;
 		const o = this._context.getEntireCoords();
-		return oe(n, o) === oe(r, o);
+		return Mt(n, o) === Mt(r, o);
 	}
 	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 = Zt(s);
+		const l = n.referencesExecute, i = n.referencesRelative, a = gt(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 === le.Cell) {
+			} else if (r.node.type === M.Cell) {
 				const t = i[r.value];
 				a[n] = { ...t };
-			} else if (r.op === le.Named) {
-				const t = r.node.value.nameId, e = this._compiled.symbols?.resolve(Fe.NamedFormula, t)?.toString() ?? t;
+			} else if (r.op === M.Named) {
+				const t = r.node.value.nameId, e = this._compiled.symbols?.resolve(ie.NamedFormula, t)?.toString() ?? t;
 				a[n] = { nameId: e };
-			} else if (r.op === le.TableReference) {
+			} else if (r.op === M.TableReference) {
 				const o = r.node.value;
 				let s = this._resolveStructuredRef(o, t, e);
 				!s || I.isError(s) ? a[n] = null : a[n] = {
 					...s,
 					tableId: o.tableId
 				};
-			} else r.op === le.Error && (a[n] = null);
+			} else r.op === M.Error && (a[n] = null);
 		}
 		return a;
 	}
 	getReferencesAt(t, e) {
 		const n = this.getReferences(t, e);
-		return 0 === n.length ? r.EmptyArray : Ve(n, t, e);
+		return 0 === n.length ? r.EmptyArray : _e(n, t, e);
 	}
 	getFormatReferences() {
 		const t = this._formatReferences;
@@ -532,7 +532,7 @@ 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 === le.Named, f = 2 === u.length;
+		const d = a[c], h = d.node, u = h.inputs ?? r.EmptyArray, _ = d.op === M.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;
@@ -562,7 +562,7 @@ var Sn = class e {
 		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 === le.TableReference) x = h.evalIndex;
+		else if (d.op === M.TableReference) x = h.evalIndex;
 		else {
 			if (!_) throw new Error(`Invalidate reference index: ${e}`);
 			C = h.evalIndex;
@@ -572,31 +572,31 @@ 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(Fe.Sheet, r) ? null : r;
+				if (r) return e && !e.resolve(ie.Sheet, r) ? null : r;
 			}
 			return null;
-		}, R = h, A = this._compiled.ast, k = ft(A, (t) => {
+		}, R = h, A = this._compiled.ast, k = Bt(A, (t) => {
 			if (!t || !t.isReference) return;
-			if (E && t === R) return pt(g);
+			if (E && t === R) return Lt(g);
 			const e = t.type;
-			if (-1 !== C && t.evalIndex === C && e === le.Named) {
-				if (!n) return we();
+			if (-1 !== C && t.evalIndex === C && e === M.Named) {
+				if (!n) return O();
 				if (n && "nameId" in n) {
-					const e = n, r = this._compiled.symbols?.bind(Fe.NamedFormula, e.nameId) ?? e.nameId, o = { ...t };
+					const e = n, r = this._compiled.symbols?.bind(ie.NamedFormula, e.nameId) ?? e.nameId, o = { ...t };
 					return o.value = {
 						...t.value,
 						...e,
 						nameId: r
 					}, o;
 				}
-				return m ? ye(":", pt(g), pt(p), !0) : pt(g);
+				return m ? wt(":", Lt(g), Lt(p), !0) : Lt(g);
 			}
-			if (-1 !== x && t.evalIndex === x && e === le.TableReference) return n ? m ? ye(":", pt(g), pt(p), !0) : pt(g) : we();
+			if (-1 !== x && t.evalIndex === x && e === M.TableReference) return n ? m ? wt(":", Lt(g), Lt(p), !0) : Lt(g) : O();
 			if (!n && an.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 = we(void 0, void 0, b(n, o));
+					const e = O(void 0, void 0, b(n, o));
 					return e.evalIndex = t.evalIndex, e;
 				}
 			}
@@ -607,8 +607,8 @@ var Sn = class e {
 				if (n) if (f === m) {
 					let e = l ? g : p;
 					s = { ...t }, s.value = e, s.image = null;
-				} else s = ye(":", pt(g), pt(p), !0);
-				else s = we(void 0, void 0, b(t)), s.evalIndex = t.evalIndex;
+				} else s = wt(":", Lt(g), Lt(p), !0);
+				else s = O(void 0, void 0, b(t)), s.evalIndex = t.evalIndex;
 				return s;
 			}
 		});
@@ -617,9 +617,9 @@ var Sn = class e {
 		return new t(N, 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(Fe.Sheet, e), l = r.transform((t, e) => {
+		const r = this._compiled, o = this._gridId, s = this._compiled.symbols.bind(ie.Sheet, e), l = r.transform((t, e) => {
 			if (!t || !t.isReference) return;
-			if (t.type !== le.Cell) return;
+			if (t.type !== M.Cell) return;
 			if (ln(e) && e.inputs?.[0] !== t) return;
 			let r;
 			const l = t.value.scope;
@@ -631,7 +631,7 @@ 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 !== le.Cell) return;
+			if (t.type !== M.Cell) return;
 			if (ln(r) && r.inputs?.[0] !== t) return;
 			if (t.value.scope !== e) return;
 			const o = { ...t };
@@ -641,7 +641,7 @@ var Sn = class e {
 	}
 	replaceTableReferences(e, n) {
 		const r = this._compiled, o = r.transform((t) => {
-			if (t?.type !== le.TableReference) return;
+			if (t?.type !== M.TableReference) return;
 			const r = t.value;
 			if ("object" != typeof r || r?.tableId !== e) return;
 			const o = n(r);
@@ -654,7 +654,7 @@ var Sn = class e {
 		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(Fe.NamedFormula, r), n = e ? e.toString() : r, o = t.getFunction?.(n) ?? null;
+			const t = this._compiled, e = t.symbols?.resolve(ie.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;
@@ -694,15 +694,15 @@ var Sn = class e {
 				f[r.index] = t;
 				continue;
 			}
-			if (o === le.Named) {
+			if (o === M.Named) {
 				f[r.index] = this._resolveNamedPrecedents(r.node.value, t, e);
 				continue;
 			}
-			if (o === le.Error) {
-				f[r.index] = W(r.node.value);
+			if (o === M.Error) {
+				f[r.index] = L(r.node.value);
 				continue;
 			}
-			if (o === le.TableReference) {
+			if (o === M.TableReference) {
 				const n = r.node.value;
 				let o;
 				n && (o = this._resolveStructuredRef(n, t, e)), o || (o = I.BuiltIn.Ref), f[r.index] = o;
@@ -729,13 +729,13 @@ var Sn = class e {
 			else {
 				if (" " === o) {
 					const t = l.scope ? a.scope ? null : l.scope : a.scope;
-					i = t && this._gridId && t !== this._gridId ? I.BuiltIn.Value : mt(l, a);
-				} else if (":" === o || ".:." === o || ":." === o || ".:" === o) i = Ie(l, a);
+					i = t && this._gridId && t !== this._gridId ? I.BuiltIn.Value : Re(l, a);
+				} else if (":" === o || ".:." === o || ":." === o || ".:" === o) i = q(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) || I.isError(t) || (i = i ? Ie(i, t) : t);
+						void 0 === t || Array.isArray(t) || I.isError(t) || (i = i ? q(i, t) : t);
 					}
 				}
 				f[r.index] = i ?? I.BuiltIn.Null;
@@ -762,7 +762,7 @@ var Sn = class e {
 			const s = e.op;
 			let h, u = null;
 			if (s) {
-				if (s === le.Error) h = W(e.node.value);
+				if (s === M.Error) h = L(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 (ft(s.ast, (t) => {
+			if (Bt(s.ast, (t) => {
 				t.evalIndex === n && (r = t);
 			}), !r) throw new Error(`Invalid evalIndex: ${n}`);
 			if (s.bindings.length > 0 && !s.error) {
@@ -808,13 +808,13 @@ var Sn = class e {
 		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 === le.Named) if (r.node.deferredResolve) l[r.node.evalIndex] = null;
+			if (s) if (s === M.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 === le.Error) l[i.evalIndex] = W(r.node.value);
-			else if (s === le.TableReference) {
+			else if (s === M.Error) l[i.evalIndex] = L(r.node.value);
+			else if (s === M.TableReference) {
 				const n = r.node.value;
 				let 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);
@@ -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 === le.Error) return this;
+		if (s.type === M.Error) return this;
 		if ("@" === s.value) return this;
 		if (!r) return this;
-		const l = K(n) + zt(e);
+		const l = Me(n) + R(e);
 		if (r.has(l)) return this;
-		const i = G("@", s, !0), a = hn(o.runtime, o.symbols, i, !1, o.error, o.getFunction);
+		const i = bt("@", s, !0), a = hn(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 le.Infix: {
+			case M.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 = 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 k(!0 === t.snapsCancellation ? Me(e, r) : e, null);
+					return it(!0 === t.snapsCancellation ? Ae(e, r) : e, null);
 				}
 				if (!t.isReference) {
 					if (r && I.isError(r)) return r;
 					if (o && I.isError(o)) return o;
 				}
 				const i = t.fn ?? (t.fn = !0 === t.snapsCancellation ? cn[t.value] : _n[t.value]);
-				return c = i ? i(s, r, o) : I.BuiltIn.Value, c = k(c, null), c;
+				return c = i ? i(s, r, o) : I.BuiltIn.Value, c = it(c, null), c;
 			}
-			case le.Function: {
+			case M.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 = xt.enter();
+					const s = Ft.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 xt && (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 Ft && (c = c._force());
 					} finally {
-						xt.leave(s);
+						Ft.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 le.Prefix:
-			case le.Postfix: {
+			case M.Prefix:
+			case M.Postfix: {
 				let n = e[l[0].evalIndex];
 				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 === le.Prefix ? fn[t.value] : dn[t.value]);
+				const r = t.fn ?? (t.fn = a === M.Prefix ? fn[t.value] : dn[t.value]);
 				return c = r ? r(s, n) : I.BuiltIn.Value, c;
 			}
-			case le.List:
-			case le.Paren: {
+			case M.List:
+			case M.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 && P(n.scope)) return I.BuiltIn.Name;
+					if (null !== n && "object" == typeof n && Kt(n.scope)) return I.BuiltIn.Name;
 				}
 				let t = !1;
-				for (let n = 0; n < i; n++) if (Qt(e[l[n].evalIndex])) {
+				for (let n = 0; n < i; n++) if (b(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];
-						Qt(r) ? t.push(...r) : t.push(r);
+						b(r) ? t.push(...r) : t.push(r);
 					}
-					const n = Zt(t.length);
+					const n = gt(t.length);
 					for (let e = 0; e < t.length; e++) n[e] = t[e];
 					return n;
 				}
-				const n = Zt(i);
+				const n = gt(i);
 				for (let t = 0; t < i; t++) n[t] = e[l[t].evalIndex];
 				return n;
 			}
-			case le.Named: {
+			case M.Named: {
 				const s = t.binding;
 				if (void 0 !== s) {
 					const n = this._compiled.bindings[s.slot];
@@ -921,12 +921,12 @@ var Sn = class e {
 				}
 				return !0 === t.deferredResolve ? this._evaluateNamed(t.value, n, r) : e[t.evalIndex] ?? null;
 			}
-			case le.TableReference: return e[t.evalIndex] ?? null;
-			case le.Call: {
+			case M.TableReference: return e[t.evalIndex] ?? null;
+			case M.Call: {
 				const n = e[l[0].evalIndex];
 				return n && I.isError(n) ? n : (c = this._applyCallee(n, t, e), c);
 			}
-			case le.Empty: return;
+			case M.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 : Qt(o)) && (a = !0);
+			!a && (!0 === o?.isIRange ? o.size > 1 : b(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] : xt.deferred(l, a, this, e, n, r, o, s) : n[e.evalIndex];
+			Fn[a] = !0 === e?.lazyArg ? i ? i[a] : Ft.deferred(l, a, this, e, n, r, o, s) : n[e.evalIndex];
 		}
 	}
 	_createLambdaValue(t, e, n, r, o) {
@@ -972,14 +972,14 @@ var Sn = class e {
 			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 === le.Empty;
+				const s = e[t], i = t >= o || r[t + 1]?.type === M.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 === le.Empty ? void 0 : n[r[t].evalIndex]);
+			for (let t = 1; t < r.length; t++) e.push(r[t]?.type === M.Empty ? void 0 : n[r[t].evalIndex]);
 			return this._dispatchFunction(t.fn, e, e.length);
 		}
 		return t && (t.isIRange || void 0 !== t.colStart) || "boolean" == typeof t ? I.BuiltIn.Ref : I.BuiltIn.Value;
@@ -995,7 +995,7 @@ var Sn = class e {
 			o.set(n[t].slot, void 0 === r ? xn : r);
 		}
 		const s = this._evaluateBody(t, o);
-		return k(s, this._context);
+		return it(s, this._context);
 	}
 	_evaluateBody(t, e) {
 		const n = this._calcScope;
@@ -1019,7 +1019,7 @@ var Sn = class e {
 			return this._runList(s, e, r, o, n), e[t.evalIndex];
 		} catch (t) {
 			if (I.isError(t)) return t;
-			if (yt(t)) throw t;
+			if (N(t)) throw t;
 			return t instanceof RangeError ? I.BuiltIn.Num : new I.Value(t?.message, { cause: t });
 		}
 	}
@@ -1032,7 +1032,7 @@ var Sn = class e {
 	}
 	_listWithin(t) {
 		let e;
-		ft(this._compiled.ast, (n, r, o) => {
+		Bt(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();
-		ft(t, (t) => {
+		Bt(t, (t) => {
 			n.add(t);
 		});
 		const r = e?.deferred?.filter((t) => n.has(t)) ?? [];
@@ -1081,7 +1081,7 @@ var Sn = class e {
 			try {
 				r = t.execute();
 			} catch (t) {
-				if (yt(t)) throw t;
+				if (N(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 (yt(t)) throw t;
+			if (N(t)) throw t;
 			r = Gn(t);
 		}
 		const l = this._calcScope;
@@ -1123,7 +1123,7 @@ var Sn = class e {
 	}
 	finalizeValue(t) {
 		const e = this._context;
-		if (Q(t)) return I.BuiltIn.Calc;
+		if (Qt(t)) return I.BuiltIn.Calc;
 		if (p(t)) return I.BuiltIn.Calc;
 		if (t && void 0 !== t.colStart) try {
 			if (t.scope) {
@@ -1132,13 +1132,13 @@ var Sn = class e {
 			}
 			t = e.getValueAt(t.rowStart, t.colStart, t.scope);
 		} catch (t) {
-			if (yt(t)) throw t;
+			if (N(t)) throw t;
 			return I.isError(t) ? t : new I.Value(t?.message, { cause: t });
 		}
 		if (Array.isArray(t) && t.isSheetSpan) return I.BuiltIn.Ref;
 		if (Array.isArray(t)) {
-			if (Qt(t)) {
-				const e = Zt(t.length);
+			if (b(t)) {
+				const e = gt(t.length);
 				for (let n = 0; n < t.length; n++) e[n] = this.finalizeValue(t[n]);
 				return e;
 			}
@@ -1150,7 +1150,7 @@ var Sn = class e {
 			}
 		}
 		var n;
-		return t?.isIRange ? t.size <= 1 ? (t = 0 === t.size ? null : t.getValueAt(0, 0, Mn), null === (t = k(t, e)) && (t = 0)) : (n = t, Cn.has(n) || (t = t.fillEmpty(0))) : null === (t = k(t, e)) && (t = 0), t;
+		return t?.isIRange ? t.size <= 1 ? (t = 0 === t.size ? null : t.getValueAt(0, 0, Mn), null === (t = it(t, e)) && (t = 0)) : (n = t, Cn.has(n) || (t = t.fillEmpty(0))) : null === (t = it(t, e)) && (t = 0), t;
 	}
 	finalizeValueForCell(t) {
 		const e = this.finalizeValue(t);
@@ -1160,7 +1160,7 @@ var Sn = class e {
 		const t = this._compiled;
 		if (t.error) return t.error.toString();
 		const e = this._calcScope;
-		return e?.node ? this.getTextAt(e.node.rowIndex, e.node.colIndex) : oe(t.getTokens(), null);
+		return e?.node ? this.getTextAt(e.node.rowIndex, e.node.colIndex) : Mt(t.getTokens(), null);
 	}
 	get [Symbol.toStringTag]() {
 		return "[FormulaBlock]";
@@ -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 === le.Empty && (Fn[n] = xn);
+	for (let n = 0; n < e; n++) t[n]?.type === M.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) => 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) => {
+}, Gn = (t) => I.isError(t) ? t : t instanceof RangeError ? I.BuiltIn.Num : new I.Value(t?.message, { cause: t }), Bn = vt(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 = ue(Math.max(r, 2 * Bn.length));
+		const t = vt(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, Wn = 12288, Un = 16384, Xn = 32768, Jn = 65536, Zn = 1 << 17, Qn = 1 << 18, Yn = 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, Yn = 1 << 17, Qn = 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));
@@ -1375,7 +1375,7 @@ 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 = et.peek();
+		const s = ge.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 I.BuiltIn.Value;
@@ -1406,11 +1406,11 @@ var Nn = (t, e, n, r, o, s, l) => {
 				colStart: o,
 				colEnd: o
 			});
-			new rn().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 nn(), 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 = on[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 } = tn(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 = en(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;
 	}
@@ -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);
-		$e(c).fixedRef = 0 === n && 0 === r ? l : {
+		Xe(c).fixedRef = 0 === n && 0 === r ? l : {
 			colStart: l.colStart + n,
 			rowStart: l.rowStart + r,
 			colEnd: l.colEnd + n,
@@ -1693,10 +1693,10 @@ var Kr = {
 	rowStart: 0,
 	colEnd: 0,
 	rowEnd: 0
-}, Wr = {
+}, Ur = {
 	bounds: qr,
 	reuseResult: !0
-}, Ur = (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,
@@ -1707,14 +1707,14 @@ var Kr = {
 	colEnd: 0,
 	rowEnd: 0,
 	scope: null
-}, Zr = null, Qr = null, Yr = {
+}, Yr = null, Qr = null, Zr = {
 	colStart: 0,
 	rowStart: 0,
 	colEnd: 0,
 	rowEnd: 0,
 	scope: null
 }, to = (t) => {
-	const e = Zr;
+	const e = Yr;
 	let n = t ?? Qr;
 	if (null === n) return null;
 	let r = e.getGrid(n);
@@ -1727,7 +1727,7 @@ var Kr = {
 	const s = e.getFormulas();
 	return {
 		values: r.getValues(),
-		searchFormulas: (t) => (Yr.colStart = t.colStart, Yr.rowStart = t.rowStart, Yr.colEnd = t.colEnd, Yr.rowEnd = t.rowEnd, Yr.scope = n, s.search(Yr))
+		searchFormulas: (t) => (Zr.colStart = t.colStart, Zr.rowStart = t.rowStart, Zr.colEnd = t.colEnd, Zr.rowEnd = t.rowEnd, Zr.scope = n, s.search(Zr))
 	};
 }, eo = Object.freeze({
 	tokens: Object.freeze([]),
@@ -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 be({ axis: E.Axis.Column }), e = this._anchor;
+		const t = new Z({ axis: E.Axis.Column }), e = this._anchor;
 		return null !== e && t.setValueAt(e.rowIndex, e.colIndex, e), this._nodes = t, t;
 	}
 	_mintDense() {
@@ -1833,7 +1833,7 @@ var Kr = {
 			return;
 		}
 		qr.rowStart = l, qr.rowEnd = i, qr.colStart = a, qr.colEnd = c;
-		const h = d.entries(Wr);
+		const h = d.entries(Ur);
 		let u = h.next();
 		for (; !u.done;) {
 			const t = u.value[1];
@@ -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 ht.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 be.Builder()), h.pushAt(t, e, this._newNode(e, t, d, null)));
 			if (null !== h) {
 				const t = h.build();
 				t && o.setValues(t.tuples);
@@ -1889,7 +1889,7 @@ var Kr = {
 				continue;
 			}
 			kn(i, t, e, Kr), kn(c, t, e, Jr);
-			const d = Ie(Kr, Jr, a);
+			const d = q(Kr, Jr, a);
 			o[n] = d ?? I.BuiltIn.Null;
 		}
 		return this._scratchRow = t, this._scratchCol = e, o;
@@ -1906,11 +1906,11 @@ var Kr = {
 	getTouched(t, e) {
 		let n = this._touched;
 		if (null !== n && this._touchedCycleId === t && this._touchedMarkId === e) return n;
-		Zr = this._container, Qr = this.gridId;
+		Yr = this._container, Qr = this.gridId;
 		try {
 			n = Vr(this._template, this.ref, to);
 		} finally {
-			Zr = null, Qr = null;
+			Yr = null, Qr = null;
 		}
 		this._touched = n, this._touchedCycleId = t, this._touchedMarkId = e;
 		const r = this.blankShared;
@@ -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 = Zt(r);
-		for (let t = 0; t < r; t++) s[t] = Zt(o);
+		const t = this.ref, e = t.rowStart, n = t.colStart, r = t.rowEnd - e + 1, o = t.colEnd - n + 1, s = gt(r);
+		for (let t = 0; t < r; t++) s[t] = gt(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 = Zt(n.rowEnd - s + 1), h = n.colEnd - o + 1, u = d.length;
+		const d = gt(n.rowEnd - s + 1), h = n.colEnd - o + 1, u = d.length;
 		for (let n = 0; n < u; n++) {
-			const l = Zt(h), u = l.length;
+			const l = gt(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 = Zt(i);
+					c = gt(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 = Zt(i);
+		const d = this.gridId, h = gt(i);
 		for (let e = 0; e < i; e++) {
-			const n = Zt(a);
+			const n = gt(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 ht.Builder();
+			const c = i.rowStart + l.originRow, d = i.colStart + l.originCol, h = n - c, u = r - d, _ = new be.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(Ur);
-		const a = new ht.Builder();
+		i.sort(Xr);
+		const a = new be.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,7 +2150,7 @@ var Kr = {
 	}
 	toJSON(t = !1, e = this.ref) {
 		const n = e;
-		return [Ne(n), this.formula.getTextAt(n.rowStart, n.colStart, t)];
+		return [xe(n), this.formula.getTextAt(n.rowStart, n.colStart, t)];
 	}
 	getCoords() {
 		return this.ref;
@@ -2545,12 +2545,12 @@ var Kr = {
 			const o = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), s = o && t > o.rowEnd + 1 ? {
 				...o,
 				rowEnd: t - 1
-			} : o, l = new be({
+			} : o, l = new Z({
 				axis: this._axis,
 				maxCoords: s
 			});
 			for (let t = 0; t < r; t++) l.setValueAt(e[t], 0, n[t]);
-			return new De(this._runtime, l, {
+			return new B(this._runtime, l, {
 				colStart: 0,
 				rowStart: 0,
 				colEnd: 0,
@@ -2583,15 +2583,15 @@ var Kr = {
 		return this._calcScope.node ? this._container.evaluateWhatIf(t) : null;
 	}
 	async _initialize(t) {
-		const e = await wt.assertUsable("calcs", 0), n = this._container, r = n.getRuntime();
-		this._runtime = new _t("Calculation Runtime", {
+		const e = await Nt.assertUsable("calcs", 0), n = this._container, r = n.getRuntime();
+		this._runtime = new Jt("Calculation Runtime", {
 			isDate1904: () => r.isDate1904(),
 			isR1C1: () => r.isR1C1(),
 			getNow: () => n.getNow(),
 			getRandom: () => r.getRandom(),
 			getLocale: () => r.getLocale()
-		}, e), this._calcScope = n.getScope(), this._coerceToNumber = Mt(this._runtime, m.Number, qt);
-		const { initializeFunctions: o } = await import("./xD41vsQY6h60lCqz.js"), s = this, l = Object.freeze(o(() => s, this._functionProviders)), a = new ke({
+		}, e), this._calcScope = n.getScope(), this._coerceToNumber = Gt(this._runtime, m.Number, Tt);
+		const { initializeFunctions: o } = await import("./BR4Wpxs0eSlaoLOl.js"), s = this, l = Object.freeze(o(() => s, this._functionProviders)), a = new me({
 			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(Fe.Sheet, e);
+		const n = this._container, r = n.getSymbols().bind(ie.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 = Z(t);
+		const e = ve(t);
 		if (void 0 !== e) {
 			const t = this._functions.getByName(e);
 			if (t && !t.isLambda()) return t;
@@ -2654,7 +2654,7 @@ var Kr = {
 		return this._functions._getStamp();
 	}
 	getNumberFormat(t, e) {
-		return h.getEngine().format(t, e, {
+		return _.getEngine().format(t, e, {
 			date1904: this.getRuntime().isDate1904(),
 			locale: this.getRuntime().getLocale()
 		}).text;
@@ -2665,7 +2665,7 @@ var Kr = {
 	getFormulaAt(t, e, n) {
 		const r = this._container;
 		let o;
-		if (this._calcScope.perCellRead = !0, o = n ? r.getSymbols().bind(Fe.Sheet, n) : this._calcScope.gridId, !o) return null;
+		if (this._calcScope.perCellRead = !0, o = n ? r.getSymbols().bind(ie.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;
@@ -2681,15 +2681,15 @@ var Kr = {
 	defer(t, e) {
 		if ("function" != typeof t) throw new I.Value("defer needs an executor function");
 		const n = this._container.getDeferred?.();
-		if (n) return Ot(n.defer(t, e, Vt(), M())), n.previous;
-		Ot(null);
+		if (n) return dt(n.defer(t, e, At(), we())), n.previous;
+		dt(null);
 	}
 	formatResults(t) {
 		const e = this._calcScope.node;
 		e && (e.numFmt = t);
 	}
 	filterHidden(t, e) {
-		if (!(t?.isIReferenceRange && t instanceof U)) return t;
+		if (!(t?.isIReferenceRange && t instanceof Ot)) 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;
@@ -2700,7 +2700,7 @@ var Kr = {
 		}) : t;
 	}
 	_gridIdOf(t) {
-		return t.scope ? this._container.getSymbols().bind(Fe.Sheet, t.scope) : this._calcScope.gridId;
+		return t.scope ? this._container.getSymbols().bind(ie.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(Fe.Sheet, this._calcScope.gridId);
+				const t = this._container.getSymbols().resolve(ie.Sheet, this._calcScope.gridId);
 				e = t ? t.getName ? t.getName() ?? void 0 : t.toString() : void 0;
 			}
 		}
@@ -2754,22 +2754,22 @@ var Kr = {
 		return this._container.getSheetCount?.() ?? 1;
 	}
 	isValidDate(t, e = !1) {
-		return g(t, e);
+		return c(t, e);
 	}
 	fromSerialDate(t, e = !1) {
-		return c(e ? Math.floor(t) : t, this.getRuntime().isDate1904());
+		return g(e ? Math.floor(t) : t, this.getRuntime().isDate1904());
 	}
 	toSerialDate(t, e = !1) {
-		const n = _(t, this.getRuntime().isDate1904());
+		const n = f(t, this.getRuntime().isDate1904());
 		return e ? Math.floor(n) : n;
 	}
 	getDateParts(t, e) {
-		const n = f(t, this.getRuntime().isDate1904(), e);
+		const n = d(t, this.getRuntime().isDate1904(), e);
 		if (null === n) throw I.BuiltIn.Num;
 		return n;
 	}
 	getSerialDate(t, e, n, r = 0, o = 0, s = 0, l = 0) {
-		return u({
+		return h({
 			year: t,
 			month: e,
 			day: n,
@@ -2782,7 +2782,7 @@ var Kr = {
 		}, this.getRuntime().isDate1904());
 	}
 	getNow() {
-		return _(new Date(this.getRuntime().getNow()), this.getRuntime().isDate1904());
+		return f(new Date(this.getRuntime().getNow()), this.getRuntime().isDate1904());
 	}
 	getRandom() {
 		const t = this._calcScope;
@@ -2794,33 +2794,33 @@ var Kr = {
 			const r = t.gridId;
 			if (r !== this._gridKeyId) {
 				this._gridKeyId = r;
-				const t = null === r ? null : this._container.getSymbols().resolve(Fe.Sheet, r), n = t?.getName ? t.getName() : null;
+				const t = null === r ? null : this._container.getSymbols().resolve(ie.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 ot.compare(t, e, this.getRuntime().getLocaleProfile(), n);
+		return Te.compare(t, e, this.getRuntime().getLocaleProfile(), n);
 	}
 	_fromTuples(t, e = null, n = !1, r = !1) {
 		if (!t) return null;
-		const o = de(t.bounds, !0), s = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), l = new be({
+		const o = Et(t.bounds, !0), s = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), l = new Z({
 			axis: this._axis,
 			maxCoords: s
 		});
 		l.setValues(t.tuples);
 		let i = e ? { type: e } : void 0;
-		return new De(this._runtime, l, o, i, n, r);
+		return new B(this._runtime, l, o, i, n, r);
 	}
 	getValueAt(t, e, n = null, o) {
 		const s = this._container, l = this._calcScope;
 		let i, a;
 		if (n) {
-			if (i = s.getSymbols().bind(Fe.Sheet, n), P(i)) return I.BuiltIn.Ref;
+			if (i = s.getSymbols().bind(ie.Sheet, n), Kt(i)) return I.BuiltIn.Ref;
 		} else i = l.gridId;
 		if (!i) return I.BuiltIn.Ref;
-		const c = l.node, d = c ? je(c) : r.EmptyArray, h = d.length;
+		const c = l.node, d = c ? Je(c) : r.EmptyArray, h = d.length;
 		for (let n = 0; n < h; n++) {
 			const r = d[n];
 			if (!r) 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 = Pt(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 = y(a))), o && o.type, a;
 	}
 	getSpillAt(t, e, n) {
 		const r = this._container, o = this._calcScope;
 		let s;
-		s = n ? r.getSymbols().bind(Fe.Sheet, n) : o.gridId;
+		s = n ? r.getSymbols().bind(ie.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,12 +2871,12 @@ var Kr = {
 			...r,
 			rowEnd: Math.max(r.rowEnd, t - 1),
 			colEnd: Math.max(r.colEnd, e - 1)
-		} : r, s = new be({
+		} : r, s = new Z({
 			axis: this._axis,
 			maxCoords: o
 		});
-		let l = new De(this._runtime, s, null, void 0, !1);
-		return t > 0 && e > 0 && ("function" == typeof n ? (l = l.resize(t, e), l = l.map(n, fo)) : Array.isArray(n) ? (l = l.replace(n), l = l.resize(t, e)) : l = null != n ? new De(this._runtime, s, {
+		let l = new B(this._runtime, s, null, void 0, !1);
+		return t > 0 && e > 0 && ("function" == typeof n ? (l = l.resize(t, e), l = l.map(n, fo)) : Array.isArray(n) ? (l = l.replace(n), l = l.resize(t, e)) : l = null != n ? new B(this._runtime, s, {
 			colStart: 0,
 			rowStart: 0,
 			colEnd: e - 1,
@@ -2905,7 +2905,7 @@ var Kr = {
 		const s = Array.isArray(t);
 		if (n = n ?? s, !s && void 0 !== t) {
 			const r = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords();
-			return new De(this._runtime, new Sn(t, {
+			return new B(this._runtime, new Sn(t, {
 				axis: this._axis,
 				maxCoords: r
 			}), {
@@ -2920,13 +2920,13 @@ var Kr = {
 			if (t[0]?.isIRange) throw I.BuiltIn.Value;
 			r = [t];
 		}
-		const l = this._axis, i = l === E.Axis.Column, a = this._fromTuples(st(r, i, Ce(0, 0, void 0, void 0, i), !0), e, n, !s);
+		const l = this._axis, i = l === E.Axis.Column, a = this._fromTuples(ue(r, i, Q(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 be({
+		const c = this._container.getGrid(this._calcScope.gridId)?.getEntireCoords(), d = new Z({
 			axis: l,
 			maxCoords: c
 		}), h = e ? { type: e } : void 0;
-		return new De(this._runtime, d, o.EmptyRange, h, n);
+		return new B(this._runtime, d, o.EmptyRange, h, n);
 	}
 	getRow() {
 		const t = this._calcScope;
@@ -2958,7 +2958,7 @@ var Kr = {
 			const r = i?.();
 			let o;
 			try {
-				let n = T(t, r, ie, () => {
+				let n = he(t, r, de, () => {
 					throw I.BuiltIn.Ref;
 				}, e);
 				if (n.length > 1) throw I.BuiltIn.Ref;
@@ -2994,7 +2994,7 @@ var Kr = {
 		if (!t) throw I.BuiltIn.Ref;
 		let a = t.scope;
 		if (a) {
-			if (a = r.getSymbols().bind(Fe.Sheet, t.scope), !a) return I.BuiltIn.Ref;
+			if (a = r.getSymbols().bind(ie.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 I.BuiltIn.Name;
@@ -3011,7 +3011,7 @@ var Kr = {
 					scope: a
 				};
 				if (r.isGridless?.(a)) {
-					const t = new be({ axis: this._axis });
+					const t = new Z({ axis: this._axis });
 					return this._toReference(t, e, void 0, a, !1, null);
 				}
 				t = e;
@@ -3025,14 +3025,14 @@ var Kr = {
 		let d;
 		const h = n.node;
 		let u = -1;
-		if (h && (u = co(je(h), t)), -1 !== u) {
+		if (h && (u = co(Je(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 be({
+				const r = new Z({
 					axis: this._axis,
 					maxCoords: i?.()
 				});
@@ -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 || !P(e.scope)) return null;
+		if (void 0 === e.colStart || !Kt(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,7 +3076,7 @@ var Kr = {
 		const i = this._onRead ?? (s ? this._dynamicRead : null);
 		i && (t = new oo(t, o, i));
 		try {
-			const n = new U(this._runtime, t, e, void 0, r, this._container.resolveScope);
+			const n = new Ot(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 I.BuiltIn.Ref;
@@ -3086,14 +3086,14 @@ var Kr = {
 	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 ? ae(t, n, e) : kt(t, n, e);
+		return void 0 !== t.colIndex ? z(t, n, e) : mt(t, n, e);
 	}
 	parseAsSerialDate(t, e) {
 		if (void 0 === t) return;
 		if ("number" == typeof t) return t;
 		if (I.isError(t)) throw t;
 		if ("string" != typeof t) throw I.BuiltIn.Value;
-		const n = d(this._runtime, t, e);
+		const n = u(this._runtime, t, e);
 		if (null === n) throw I.BuiltIn.Value;
 		return n;
 	}
@@ -3143,30 +3143,30 @@ var Kr = {
 		return pr.create(t, e, this._createSparseColumn, n);
 	}
 	getPivotAt(t) {
-		if (!(t instanceof U)) return null;
+		if (!(t instanceof Ot)) 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 sn(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 sn(n, l ? "blocked" : "wanted");
+			return He(n, l ? "blocked" : "wanted");
 		}
 		return null;
 	}
 	parseAsLiteral(t) {
-		return B(t) ?? ct(t);
+		return T(t) ?? ne(t);
 	}
 	toText(t) {
-		return It(t, this._runtime);
+		return X(t, this._runtime);
 	}
 	getRuntime() {
 		return this._runtime;
 	}
 	createRichData(t, e) {
-		return Jt.fromJSON({
+		return xt.fromJSON({
 			type: t,
 			data: e
 		}, this._container.getRichDataContext?.());
@@ -3291,7 +3291,7 @@ function So(t, e, n) {
 		colEnd: a[1]
 	};
 }
-var wo = class extends At {
+var wo = class extends ct {
 	constructor(t) {
 		const e = (t = { ...t }).container;
 		super({
@@ -3299,15 +3299,15 @@ var wo = class extends At {
 			send: (t, n, r) => e.sendRequest(t, n, r),
 			calculation: t.calculation
 		}), this._touchedOthers = null, this._iterationId = 0, this._resized = null, this._hiddenRows = null, this._hiddenColumns = null, this._filtered = !1, this._pivots = null, this._demanded = [], this._isProcessingJSON = !1, this._snapshots = null, this._options = t, this._context = t.context, this._container = t.container;
-		const n = { ...Ae }, o = t.getEntireCoords ?? (() => n);
+		const n = { ...$t }, o = t.getEntireCoords ?? (() => n);
 		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($(V.results(t, "onCalculated"), this._container.getImager(this._gridId)));
-		} : () => {}, this._values = new be({
+			s($(ot.results(t, "onCalculated"), this._container.getImager(this._gridId)));
+		} : () => {}, this._values = new Z({
 			axis: E.Axis.Column,
-			createRun: ze
-		}), this._iterationId = 0, this._contentfulSpatial = new me({ updateEntryOptions: {
+			createRun: qe
+		}), this._iterationId = 0, this._contentfulSpatial = new nt({ updateEntryOptions: {
 			isSplitOnExpand: !0,
 			isMergeOnShift: !0
 		} });
@@ -3315,7 +3315,7 @@ var wo = class extends At {
 			isSplitOnExpand: !0,
 			isMergeOnShift: !1
 		} };
-		this._spillSpatial = new me(l), this._errorSpatial = new me(l), this._calcStatusSpatial = new me(l), this._circularSpatial = new me(l), this._notifyValues = new me(), this._notifyBlank = null, this._notifySpillsInsert = [], this._notifySpillsRemove = [], this._notifyFormats = new me(), this._notifyCalcStatus = new me(), this._notifyCircular = new me(), this._touchedFormulas = [], this._container.registerGrid(this), this._publishMaps();
+		this._spillSpatial = new nt(l), this._errorSpatial = new nt(l), this._calcStatusSpatial = new nt(l), this._circularSpatial = new nt(l), this._notifyValues = new nt(), this._notifyBlank = null, this._notifySpillsInsert = [], this._notifySpillsRemove = [], this._notifyFormats = new nt(), this._notifyCalcStatus = new nt(), this._notifyCircular = new nt(), this._touchedFormulas = [], this._container.registerGrid(this), this._publishMaps();
 	}
 	_land(t, e) {
 		return this._container.landRequest(t, () => (void 0 !== t && this._versionMaps(t), e()));
@@ -3441,7 +3441,7 @@ var wo = class extends At {
 					cycleId: this._container.getCycleId(),
 					commitId: t.commitId
 				};
-				const r = Ut(t.destination, t.coords, t.fitDestination, t.transpose);
+				const r = re(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);
@@ -3567,8 +3567,8 @@ var wo = class extends At {
 		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 === 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;
-		nt(d, s, i, a);
-		const u = [], _ = this._container.getPrecedents().search(s), f = O(s, d, o, h, void 0, !1, !1, void 0, (t, e, r, o) => {
+		ht(d, s, i, a);
+		const u = [], _ = this._container.getPrecedents().search(s), f = G(s, d, o, h, void 0, !1, !1, void 0, (t, e, r, o) => {
 			u.push({
 				colStart: t,
 				rowStart: e,
@@ -3586,7 +3586,7 @@ var wo = class extends At {
 			colEnd: i && 1 === c ? S.colEnd : s.colEnd,
 			rowEnd: i || 1 !== c ? s.rowEnd : S.rowEnd,
 			scope: n
-		}, I = a ? ge(m, w) : Y(m, s);
+		}, I = a ? ae(m, w) : se(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,
@@ -3596,7 +3596,7 @@ var wo = class extends At {
 			scope: n
 		};
 		let C;
-		const b = Ge(() => m, () => {
+		const b = st(() => m, () => {
 			const t = g.getDynamics();
 			return C = new Map(t), C;
 		}, x, {
@@ -3688,9 +3688,9 @@ var wo = class extends At {
 			let h = c;
 			for (let r = 0; r < d.length; r++) {
 				const o = d[r];
-				if (!at(o)) continue;
+				if (!A(o)) continue;
 				let s = l.get(o);
-				void 0 === s && (s = pe(o, t, e, n) ?? null, l.set(o, s)), null !== s && (h = h.replaceScopeIds(o, s));
+				void 0 === s && (s = Ee(o, t, e, n) ?? null, l.set(o, s)), null !== s && (h = h.replaceScopeIds(o, s));
 			}
 			h !== c && (i.push(o), a.push({
 				...o,
@@ -3806,7 +3806,7 @@ var wo = class extends At {
 		l || (l = /* @__PURE__ */ new Map(), Eo.set(r, l));
 		let i = l.get(e);
 		if (!i) {
-			const t = L(r);
+			const t = Ce(r);
 			i = 0 === e ? t : (n, r) => t(n + e, r) - e, l.set(e, i);
 		}
 		return i;
@@ -3837,7 +3837,7 @@ var wo = class extends At {
 				columns: e.anchor.column - n.colStart
 			}, i = {
 				...n,
-				value: new ce(n, l, "pivot", s)
+				value: new j(n, l, "pivot", s)
 			};
 			o.insert(i), this._notifySpillsInsert.push(i);
 		}
@@ -3962,7 +3962,7 @@ var wo = class extends At {
 			}
 			this._pushWithSpills(h, w);
 		}
-		return h = Yt(h, 2, t.Row), h.sort(o.rowFirstRangeComparator), h;
+		return h = Ge(h, 2, t.Row), h.sort(o.rowFirstRangeComparator), h;
 	}
 	_pushWithSpills(t, e) {
 		t.push(e);
@@ -4030,7 +4030,7 @@ var wo = class extends At {
 			}
 			f.push(...C);
 		}
-		return f = Yt(f, 2, t.Row), f.sort(o.rowFirstRangeComparator), f;
+		return f = Ge(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;
@@ -4051,11 +4051,11 @@ var wo = class extends At {
 		return i;
 	}
 	getDependentsAt(t) {
-		const e = Tt(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 = Tt(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) {
@@ -4166,16 +4166,16 @@ var wo = class extends At {
 		if ("scalar" === o) {
 			let o = t.evaluateAt(e, n, r);
 			if (o && void 0 !== o.colStart) o = t.finalizeValue(o);
-			else if (Qt(o)) return t.finalizeValue(o);
-			const s = k(o, this._context);
+			else if (b(o)) return t.finalizeValue(o);
+			const s = it(o, this._context);
 			return null === s ? 0 : s;
 		}
-		return He(t.finalizeValue(t.evaluateAt(e, n, r)));
+		return We(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 = re(s, t, e) : r && void 0 !== r.colIndex && (s = xe(s, t, e));
+		r && void 0 !== r.colStart ? s = Ve(s, t, e) : r && void 0 !== r.colIndex && (s = Zt(s, t, e));
 		const l = o.value.formula.setReferenceAt(n, s).getTextAt(t, e);
 		return this._land(void 0, () => {
 			l ? this._setInputsNow(null, [{
@@ -4196,7 +4196,7 @@ var wo = class extends At {
 	_setReferenceModeNow(t, e, n, r, o) {
 		const s = this.getReferencesAt(t, e)[n];
 		if (!s || "nameId" in s) throw new Error(`Reference at index ${n} is not a cell reference and cannot have its style changed.`);
-		return this._setReferenceNow(t, e, n, z(s, r, o));
+		return this._setReferenceNow(t, e, n, kt(s, r, o));
 	}
 	_isVolatileNow(t, e) {
 		const n = this._formulaAt(t, e);
@@ -4231,7 +4231,7 @@ var wo = class extends At {
 				rowStart: u,
 				colEnd: o,
 				rowEnd: f,
-				value: new ce(g, 0, e.value.getKind())
+				value: new j(g, 0, e.value.getKind())
 			});
 		}
 		return {
@@ -4244,7 +4244,7 @@ var wo = class extends At {
 		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(Fe.Sheet, e)?.toString() : void 0, d = this._context;
+		const c = e ? s.getSymbols().resolve(ie.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;
@@ -4280,7 +4280,7 @@ var wo = class extends At {
 				if (p === Number.MIN_SAFE_INTEGER && (I = a, v = d), m === Number.MIN_SAFE_INTEGER && (y = c, x = h), I < a || v > d || y < c || x > h) {
 					const o = a - I, g = c - y, p = d - v, m = h - x;
 					Mo.colStart = Math.max(s, s + o), Mo.rowStart = Math.max(l, l + g), Mo.colEnd = Math.min(i, i + p), Mo.rowEnd = Math.min(u, u + m);
-					const w = vt(t, Mo, Dt);
+					const w = pe(t, Mo, Wt);
 					if (w) {
 						const e = w.length;
 						t = w[e - 1], n = t.value, r = n.ref, s = r.colStart, l = r.rowStart, i = r.colEnd, u = r.rowEnd;
@@ -4304,7 +4304,7 @@ var wo = class extends At {
 		this._removeNow(n);
 		const a = this._container, c = a.getPrecedents().clone(), d = a.getFormulas().clone();
 		a.setPrecedents(c), a.setFormulas(d);
-		const h = ut(c, e, n);
+		const h = Dt(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) {
@@ -4352,7 +4352,7 @@ var wo = class extends At {
 		}
 		let p;
 		Po(d, c, _), this._touchFormulas(_);
-		const m = $t(c, () => {
+		const m = Ht(c, () => {
 			const t = a.getDynamics();
 			return p = new Map(t), p;
 		}, e, n);
@@ -4374,7 +4374,7 @@ var wo = class extends At {
 		t.values.copyTo(S, {
 			colIndex: n.colStart,
 			rowIndex: n.rowStart
-		}, e), ne(this._errorSpatial, S, n);
+		}, e), at(this._errorSpatial, S, n);
 		const w = t.spillSpatial;
 		let y = [], v = [];
 		for (let t = 0; t < f; t++) {
@@ -4387,7 +4387,7 @@ var wo = class extends At {
 			const t = (t, e) => {
 				t && this._notifySpillsInsert.push(t), e && this._notifySpillsRemove.push(e);
 			};
-			rt(a.getCycleId(), v, r.EmptyArray, s._contentfulSpatial, s._spillSpatial, s._values, (t, e, n, r) => {
+			et(a.getCycleId(), v, r.EmptyArray, s._contentfulSpatial, s._spillSpatial, s._values, (t, e, n, r) => {
 				x.push({
 					colStart: t,
 					rowStart: e,
@@ -4433,7 +4433,7 @@ var wo = class extends At {
 				}
 			}
 			e && (t = i.concat(e)), t.sort(o.columnFirstRangeComparator);
-			const n = new ht.Builder((t, e) => new dt.ArrayList(t.slice(0, e)));
+			const n = new be.Builder((t, e) => new U.ArrayList(t.slice(0, e)));
 			let r;
 			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++) {
@@ -4530,9 +4530,9 @@ var wo = class extends At {
 				const i = e.search(o), a = i.length;
 				for (let e = 0; e < a; e++) {
 					let r = i[e];
-					if (Be(o.rowStart, o.colStart, r) && (s || r.value.getCycleId() === t)) {
+					if (fe(o.rowStart, o.colStart, r) && (s || r.value.getCycleId() === t)) {
 						m || (m = [], n = /* @__PURE__ */ new Set());
-						const t = K(r.colStart) + zt(r.rowStart);
+						const t = Me(r.colStart) + R(r.rowStart);
 						if (n.has(t)) continue;
 						n.add(t);
 						const e = r.value.getBlockedCoords() ?? o;
@@ -4567,7 +4567,7 @@ var wo = class extends At {
 		if (t && t.tuples) {
 			I = t.tuples;
 			let e = t.bounds;
-			if (e ? (y = de(e, f), y.scope = l) : y = {
+			if (e ? (y = Et(e, f), y.scope = l) : y = {
 				colStart: Number.MIN_SAFE_INTEGER,
 				rowStart: Number.MIN_SAFE_INTEGER,
 				colEnd: Number.MAX_SAFE_INTEGER,
@@ -4590,19 +4590,19 @@ var wo = class extends At {
 						t.minorStart = n[0];
 						const r = n[1];
 						t.minorEnd = t.minorStart + r.length - 1;
-						const s = de(t, f);
+						const s = Et(t, f);
 						s.scope = l, x && c.search(s).length > 0 && x.push(s);
 					}
 				}
 			}
-			v = Se(t.tuples, f, l);
+			v = pt(t.tuples, f, l);
 		}
 		const C = (t, e) => {
 			t && this._notifySpillsInsert.push(t), e && this._notifySpillsRemove.push(e);
 		};
 		if (n || I) {
 			let t;
-			n && (t = O(n, g, _, S, C, !1, !0, this._notifyValues, (t, e, n, r) => {
+			n && (t = G(n, g, _, S, C, !1, !0, this._notifyValues, (t, e, n, r) => {
 				w.push({
 					colStart: t,
 					rowStart: e,
@@ -4610,7 +4610,7 @@ var wo = class extends At {
 					rowEnd: r,
 					scope: l
 				});
-			})), rt(-1, n ? [n] : r.EmptyArray, v, S, g, _, (t, e, n, r) => {
+			})), et(-1, n ? [n] : r.EmptyArray, v, S, g, _, (t, e, n, r) => {
 				w.push({
 					colStart: t,
 					rowStart: e,
@@ -4618,7 +4618,7 @@ var wo = class extends At {
 					rowEnd: r,
 					scope: l
 				});
-			}, this._notifyValues, C, this._notifyCalcStatus, p, f, !1, this._circularSpatial, this._calcStatusSpatial), n && (_.delete(n), J(p, n)), t?.(), I && (_.setValues(I), Ct(p, I, f));
+			}, this._notifyValues, C, this._notifyCalcStatus, p, f, !1, this._circularSpatial, this._calcStatusSpatial), n && (_.delete(n), ut(p, n)), t?.(), I && (_.setValues(I), H(p, I, f));
 		}
 		const b = i.getScope();
 		let R, A, k, N, M;
@@ -4626,7 +4626,7 @@ var wo = class extends At {
 			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 && ($e(c.getAnchorNode()).fixedRef = {
+			d && d.colStart === r && d.rowStart === n && (Xe(c.getAnchorNode()).fixedRef = {
 				colStart: d.colStart,
 				rowStart: d.rowStart,
 				colEnd: d.colEnd,
@@ -4660,31 +4660,31 @@ var wo = class extends At {
 				}
 			});
 		}, T = x ? x.length : 0;
-		let G;
+		let B;
 		if (u > 0) {
-			G = Zt(u);
+			B = gt(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);
+				B[t] = s, null !== r && F(s, r);
 			}
 		}
-		const B = s?.cloneKey ?? null;
-		(T > 0 || u > 0) && (k = i.getFormulas().clone(B));
+		const V = s?.cloneKey ?? null;
+		(T > 0 || u > 0) && (k = i.getFormulas().clone(V));
 		for (let t = 0; t < T; t++) D(x[t]);
-		for (let t = 0; t < u; t++) D(G[t]);
-		const V = A ? A.length : 0;
-		if (V > 0) {
+		for (let t = 0; t < u; t++) D(B[t]);
+		const O = A ? A.length : 0;
+		if (O > 0) {
 			const t = i.getDynamics();
 			let e = null;
-			for (let n = 0; n < V; n++) {
+			for (let n = 0; n < O; n++) {
 				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));
+				o && (N || (N = i.getPrecedents().clone(V)), N.removeAll(o, Go), e || (e = new Map(t)), e.delete(r));
 			}
 			e && i.setDynamics(e);
 		}
 		let P = [];
 		if (R || A) {
-			N || (N = i.getPrecedents().clone(B)), Po(k, N, R, A), M && Lo(N, M, null);
+			N || (N = i.getPrecedents().clone(V)), Po(k, N, R, A), M && Lo(N, M, null);
 			const t = R ? this._joinInserted(k, N, R, (t) => {
 				w.push({
 					colStart: t.colStart,
@@ -4712,8 +4712,8 @@ var wo = class extends At {
 					}
 				}
 				return n;
-			}(A, x, G) : A;
-			rt(-1, e, R, S, g, _, (t, e, n, r) => {
+			}(A, x, B) : A;
+			et(-1, e, R, S, g, _, (t, e, n, r) => {
 				w.push({
 					colStart: t,
 					rowStart: e,
@@ -4781,7 +4781,7 @@ var wo = class extends At {
 			const s = n[o];
 			if (!a(s) || !d(s)) continue;
 			h = !1;
-			const l = X(c, s, (t, e, n, r) => {
+			const l = ce(c, s, (t, e, n, r) => {
 				if (!a(t) || !a(e)) return;
 				const o = {
 					colStart: n.colStart,
@@ -4832,8 +4832,8 @@ var wo = class extends At {
 				const e = t.data;
 				this._values.setValues(e);
 				const n = this._values.getAxis() === E.Axis.Column;
-				Ct(this._errorSpatial, e, n);
-				const r = Se(e, n, this._gridId);
+				H(this._errorSpatial, e, n);
+				const r = pt(e, n, this._gridId);
 				this._contentfulSpatial.load(r);
 			}
 			const e = this._gridId, n = this._container, r = n.getPrecedents(), o = n.getFormulas(), s = {
@@ -4845,9 +4845,9 @@ var wo = class extends At {
 				if (c) {
 					const t = c.length;
 					for (let e = 0; e < t; e++) {
-						const t = c[e], n = t[0], r = Bt(n, s).split(":")[0];
+						const t = c[e], n = t[0], r = oe(n, s).split(":")[0];
 						d.add(r);
-						const o = j(t, s);
+						const o = _t(t, s);
 						o && h.add(`${o.rowStart},${o.colStart}`);
 					}
 				}
@@ -4855,7 +4855,7 @@ var wo = class extends At {
 				m.colIndex = 0, m.rowIndex = 0, m.gridId = e;
 				const S = n.isLegacyIntersect();
 				for (let t = 0; t < u; t++) {
-					const r = j(l[t], s);
+					const r = _t(l[t], s);
 					r.scope = e;
 					const o = r.value, i = r.rowStart, a = r.colStart;
 					m.colIndex = a, m.rowIndex = i;
@@ -4869,7 +4869,7 @@ var wo = class extends At {
 					for (let t = 0; t < w; t++) {
 						const n = g[t];
 						if (I.isError(n)) continue;
-						const o = Lt(b[t], bo[t], Co[t]), s = o.$absColEnd, l = o.$absRowEnd, i = {
+						const o = Be(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),
@@ -4892,7 +4892,7 @@ var wo = class extends At {
 				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 = j(c[n], s), i = r.value ?? "dynamic", h = "error" === i, u = r.colStart, _ = r.rowStart;
+						const r = _t(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;
@@ -4902,13 +4902,13 @@ var wo = class extends At {
 							colEnd: S,
 							rowEnd: w
 						};
-						"fixed" === i && ($e(m).fixedRef = E, p.densify()), m.cachedValue = h ? I.BuiltIn.Spill : new De(g, d, E);
+						"fixed" === i && (Xe(m).fixedRef = E, p.densify()), m.cachedValue = h ? I.BuiltIn.Spill : new B(g, d, E);
 						const y = {
 							colStart: u,
 							rowStart: _,
 							colEnd: S,
 							rowEnd: w,
-							value: new ce(E, 0, i)
+							value: new j(E, 0, i)
 						};
 						l.push(y), t.push({
 							colStart: u,
@@ -4916,7 +4916,7 @@ var wo = class extends At {
 							colEnd: S,
 							rowEnd: w,
 							value: i
-						}), D(a, m, E, -2);
+						}), Vt(a, m, E, -2);
 					}
 					if (this._spillSpatial.load(l), a.size > 0) {
 						r.load(Array.from(a.values()).flat()), n.bumpCalcEpochs(!1);
@@ -4933,12 +4933,12 @@ var wo = class extends At {
 						t.add(e), e.state |= Hn, e.block.calcOnLoad = !0;
 					}, r = new Array(y);
 					for (let t = 0; t < y; t++) {
-						const n = E[t], l = _e(n, s);
+						const n = E[t], l = ye(n, s);
 						r[t] = { ...l };
 						const i = o.search(l), a = i.length;
 						for (let t = 0; t < a; t++) {
 							const n = i[t];
-							se(n, l, e);
+							yt(n, l, e);
 						}
 					}
 					this._markDirtyRegionsNow(r), w = !0;
@@ -5016,7 +5016,7 @@ var wo = class extends At {
 	}
 	_toJSONNow(e) {
 		let n = this._container.getFormulas().getSpatialAt(this._gridId)?.all(), r = n ? n.length : 0;
-		r > 0 && (n = y(n, t.Column, 2, Bo), n.sort(o.rowFirstRangeComparator)), r = n ? n.length : 0;
+		r > 0 && (n = De(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 = {};
@@ -5033,7 +5033,7 @@ var wo = class extends At {
 		if (d > 0) {
 			const t = this.getEntireCoords(), e = new Array(d);
 			for (let n = 0; n < d; n++) {
-				const r = c[n], o = Ne(r, t);
+				const r = c[n], o = xe(r, t);
 				e[n] = [o, r.value.getKind()];
 			}
 			a.formulaArray = e;
@@ -5043,7 +5043,7 @@ var wo = class extends At {
 		if (h.size > 0) {
 			const t = h.values();
 			let e = t.next();
-			const n = this._values.getAxis() === E.Axis.Column, r = b(!0);
+			const n = this._values.getAxis() === E.Axis.Column, r = Yt(!0);
 			for (; !e.done;) {
 				const o = e.value;
 				if (e = t.next(), o.gridId !== u) continue;
@@ -5067,14 +5067,14 @@ var wo = class extends At {
 				}
 			};
 			f.isEmpty() || n(f.all());
-			const r = g.isEmpty() ? [] : g.all().filter((t) => t.value === Nt.CalcStatus.Working);
-			r.length > 0 && n(r), p.length > 0 && n(p), _ = y(e, t.Column, 2);
+			const r = g.isEmpty() ? [] : g.all().filter((t) => t.value === P.CalcStatus.Working);
+			r.length > 0 && n(r), p.length > 0 && n(p), _ = De(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 = Ne(n, this.getEntireCoords());
+				const n = _[e], r = xe(n, this.getEntireCoords());
 				t[e] = r;
 			}
 			a.volatile = t;
@@ -5188,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;
-		Ft(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 (ve.forEachLeaf(t, (t, n, r, o) => {
-		if (e || t instanceof Rt) return;
+	if (Fe.forEachLeaf(t, (t, n, r, o) => {
+		if (e || t instanceof rt) 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 = bt(t.at(r));
+		for (let r = n; !e && r <= s; r++) e = k(t.at(r));
 	}), !e) return t;
 	const n = t.length, r = new Array(n);
-	for (let e = 0; e < n; e++) r[e] = Pt(t.at(e));
-	return new dt.ArrayList(r);
+	for (let e = 0; e < n; e++) r[e] = y(t.at(e));
+	return new U.ArrayList(r);
 }, Ho = (t, e, n) => {
 	const r = n?.fetchedFrom;
-	if (!t) return new Et({
+	if (!t) return new Y({
 		source: { buffer: e },
 		fetchedFrom: r
 	});
@@ -5247,18 +5247,18 @@ var $o = (t) => {
 		}
 	}
 	_moved() {
-		A(), this._onMoved?.(this);
+		le(), this._onMoved?.(this);
 	}
 	_final() {
 		const t = this._onFinal;
 		this._onFinal = null, t?.(this);
 	}
-}, Ko = (t) => t, qo = (t, e) => Jt.fromJSON({
+}, Ko = (t) => t, qo = (t, e) => xt.fromJSON({
 	type: t,
 	data: e
-}), Wo = (t, e) => globalThis.fetch(t, e), Uo = () => {
+}), 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), Zo = class {
+}, Wo = () => Promise.reject(/* @__PURE__ */ new Error("parseText() needs a workbook being calculated")), Jo = (t, e) => Ho(null, t, e), Yo = 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;
@@ -5278,9 +5278,9 @@ var $o = (t) => {
 			byPayload: ts,
 			createRichData: l?.createRichData ?? qo,
 			addResource: l?.addResource ?? Jo,
-			fetch: l?.fetch ?? Wo,
-			getFormulaContext: l?.getFormulaContext ?? Uo,
-			parseText: l?.parseText ?? Xo
+			fetch: l?.fetch ?? Uo,
+			getFormulaContext: l?.getFormulaContext ?? Xo,
+			parseText: l?.parseText ?? Wo
 		};
 		const h = this._deferContext.fetch;
 		this._reloadContext = {
@@ -5369,7 +5369,7 @@ var $o = (t) => {
 		}, t);
 	}
 	newHolder(t, e) {
-		return this._holders = !0, new Gt(t, e.calls, e.direct);
+		return this._holders = !0, new V(t, e.calls, e.direct);
 	}
 	defer(t, e, n = null, r = !1) {
 		const o = this._scope, s = o.deferOrdinal++;
@@ -5445,11 +5445,11 @@ 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 && bt(n.cachedValue) && (r = n.cachedValue), null !== r ? r.calls[t] : void 0;
+		return null === r && k(n.cachedValue) && (r = n.cachedValue), null !== r ? r.calls[t] : void 0;
 	}
 }, Qo = (t, e) => {
 	for (const n of t) n.isOpen() && n.reject(e);
-}, Yo = Symbol("-0"), ts = async (t, e) => {
+}, Zo = Symbol("-0"), ts = async (t, e) => {
 	const n = /* @__PURE__ */ new Map(), r = [], o = [];
 	for (const e of t) {
 		const t = e.payload;
@@ -5465,7 +5465,7 @@ var $o = (t) => {
 			}
 			continue;
 		}
-		const s = Object.is(t, -0) ? Yo : t, l = n.get(s);
+		const s = Object.is(t, -0) ? Zo : t, l = n.get(s);
 		if (l) l.push(e);
 		else {
 			const r = {
@@ -5539,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 = ue(o), this._order = new Int32Array(o), this._mask = o - 1;
+		this._keys = new Float64Array(o).fill(-1), this._values = vt(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;
@@ -5933,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 ht.Builder();
+		const r = new be.Builder();
 		for (; !n.done;) r.pushMultipleAt(n.value[0], n.value[1], n.value[2]), n = e.next();
 		return r.build();
 	}
@@ -6225,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 = $e(t);
+			const e = Xe(t);
 			e.cycleGroup = this._taintGroup, e.demandValue = Qs(t), this._addCircular(t);
 		};
 	}
@@ -6279,17 +6279,17 @@ var Es = class {
 			dynamicByBlock: m,
 			lastUpdates: new Map(S)
 		};
-		const R = /* @__PURE__ */ new Map();
+		const b = /* @__PURE__ */ new Map();
 		this._addDynamicPrecedent = (t, e, n) => {
-			t?.block && (u.getScope().perCellRead = !0, -1 === n && (t.state |= Hn), D(R, t, e, n));
+			t?.block && (u.getScope().perCellRead = !0, -1 === n && (t.state |= Hn), Vt(b, t, e, n));
 		};
-		const A = /* @__PURE__ */ new Map(), k = (t, e) => {
+		const R = /* @__PURE__ */ new Map(), A = (t, e) => {
 			(function(t, e, n, r) {
 				if (0 === e) return;
 				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), Ct(l.errorSpatial, t.tuples, r));
+					t && t.tuples && (l.values.setValues(t.tuples), H(l.errorSpatial, t.tuples, r));
 					const e = s.done(!0);
 					for (let t = 0; t < e.length; t++) {
 						const n = e[t];
@@ -6315,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 !== Rs && d(), o = new ht.Builder(Is), s = b(r), i = f, l = n(f));
+					f || console.log("nodeGridId is null", e), f !== i && (i !== Rs && d(), o = new be.Builder(Is), s = Yt(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;
@@ -6336,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 = Yt(r)), l.formatsConflating.append(g, p, w));
 				}
 				d();
 			})(t, e, _, !0);
@@ -6344,23 +6344,23 @@ 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 N = r, M = Wl;
-		M.length = 0;
-		let F = 0, T = !1;
+		let k = r, N = Ul;
+		N.length = 0;
+		let M = 0, F = !1;
 		do {
-			++y, I(), this.doMarkAndPlan(t, y, v, M);
-			const e = this.doEvaluate(t, _, k, N, M);
-			T = void 0 !== e, T && (N = !1, ++y, v.length = 0, this.doCollectDirtyCalcs(t, y, e.all(), v, c, g, w), F > 200 && (++y, I(), this.doMarkAndPlan(t, y, v, M, !0), this.doEvaluate(t, _, k, !1, M), this._hasCycle() || console.error("Too many iterations, possible cycle or leak"), T = !1)), F++;
-		} while (T);
+			++y, I(), this.doMarkAndPlan(t, y, v, N);
+			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 (R.has(t)) continue;
+			if (b.has(t)) continue;
 			const e = m.get(t);
 			e && (g.removeAll(e, Go), m === p && (m = new Map(m)), m.delete(t));
 		}
-		if (R.size > 0) if (function(t, e, n) {
+		if (b.size > 0) if (function(t, e, n) {
 			for (const e of n) if (!t.has(e)) return !1;
 			for (const [n, r] of t) {
 				const t = e.get(n);
@@ -6379,21 +6379,21 @@ var Es = class {
 				}
 			}
 			return !0;
-		}(R, p, E)) g = f, m = p, R.clear();
+		}(b, p, E)) g = f, m = p, b.clear();
 		else {
 			g === f && (g = g.clone()), m === p && (m = new Map(m));
-			for (const t of R.keys()) {
+			for (const t of b.keys()) {
 				const e = m.get(t);
 				e && g.removeAll(e, Go);
 			}
-			g.load(Array.from(R.values()).flat());
-			for (const [t, e] of R) m.set(t, e);
-			R.clear();
+			g.load(Array.from(b.values()).flat());
+			for (const [t, e] of b) m.set(t, e);
+			b.clear();
 		}
 		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()
 		};
 	}
@@ -6406,7 +6406,7 @@ var Es = class {
 		if (r?.isIRange && r.size > 1) {
 			if (e.uncalculated) return;
 			const o = t.rowIndex, s = t.colIndex;
-			return new De(this._container.getRuntime(), n.getValues().clone(), {
+			return new B(this._container.getRuntime(), n.getValues().clone(), {
 				rowStart: o,
 				colStart: s,
 				rowEnd: o + r.getRowCount() - 1,
@@ -6424,7 +6424,7 @@ var Es = class {
 		const o = n.endEvaluation(), s = o.calls;
 		if (0 === s.length) return e;
 		for (let e = 0; e < s.length; e++) if (s[e].isOpen()) {
-			t.state |= Yn | er;
+			t.state |= Zn | er;
 			break;
 		}
 		const l = n.newHolder(e, o);
@@ -6450,12 +6450,12 @@ var Es = class {
 		const a = this._container.getFormulas().search(js), c = a.length, d = null !== this._iterate, h = this._container.getScope().node, u = null !== h && 0 !== (h.state & Jn);
 		let _ = 0, f = null, g = !1, p = !1;
 		const m = (t) => {
-			if (t.cycleId !== l || t.markId !== i) return void (d || 0 === (t.state & Wn) || (s ? p = !0 : this._demandActive ? this._markDownstream(t) : f = t));
+			if (t.cycleId !== l || t.markId !== i) return void (d || 0 === (t.state & Un) || (s ? p = !0 : this._demandActive ? this._markDownstream(t) : f = t));
 			let e = t.state & Kn;
 			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 Pe(t);
+				if (u || (t.state &= ~Jn), !d || !this._demandActive) throw new Ke(t);
 				0 === (t.state & jn) && (t.state |= jn, _l[this._iterHitsLength++] = t);
 			}
 		};
@@ -6474,27 +6474,27 @@ var Es = class {
 			}
 			c.forEachNodeIn(d, h, u, _, m);
 		}
-		if (_ > 0) throw new Le(cl, _);
-		if (f) throw new Ke(f);
+		if (_ > 0) throw new Ue(cl, _);
+		if (f) throw new Ye(f);
 		return p;
 	}
 	_markDownstream(t) {
 		const e = this._container.getScope().node;
-		e && 0 === (e.state & qn) && (e.state = e.state & ~qn | ir, $e(e).cycleGroup = this._resolveGroup(Zs(t)), this._addCircular(e), this._iterate && (pl[this._iterDownstreamLength++] = e));
+		e && 0 === (e.state & qn) && (e.state = e.state & ~qn | ir, Xe(e).cycleGroup = this._resolveGroup(Ys(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++;
@@ -6577,7 +6577,7 @@ var Es = class {
 		};
 		this._whatIf = c;
 		try {
-			const n = Je(e, t), r = Ue({
+			const n = nn(e, t), r = tn({
 				container: e,
 				evaluate: (t) => this._evaluateWhatIf(t),
 				layerFor: d
@@ -6600,12 +6600,12 @@ var Es = class {
 		if (!n) return t.cachedValue ?? null;
 		const r = this._container.getScope();
 		let o;
-		Ln(t, Ye(t)), r.gridId = t.gridId, r.node = t, r.rowIndex = t.rowIndex, r.colIndex = t.colIndex, r.drawIndex = 0;
+		Ln(t, sn(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 ee)) throw e;
+			if (!(e instanceof jt)) throw e;
 			o = t.cachedValue ?? null;
 		}
 		return this._fitCell(e, o);
@@ -6643,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() === E.Axis.Column, w = S ? E.Axis.Column : E.Axis.Row, I = qs, y = Ws;
+		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 Re([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 tt([e], l), a = new Array(o - r + 1);
 			for (let t = r; t <= o; t++) a[t - r] = [t, [[s, i]]];
-			g.setValues(a), J(p, n), Ct(p, a, S);
+			g.setValues(a), ut(p, n), H(p, a, S);
 			const c = {
 				colStart: n.colStart,
 				rowStart: n.rowStart,
@@ -6657,19 +6657,19 @@ var Es = class {
 			};
 			I.push({
 				...c,
-				value: new tt(c, w)
+				value: new zt(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 me())).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 nt())).insertNonOverlapping({
 				colStart: n.colStart,
 				rowStart: n.rowStart,
 				colEnd: n.colEnd,
@@ -6686,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 me()), s = t.gridId, l = Us;
+		const o = this._fallbackDirty ?? (this._fallbackDirty = new nt()), s = t.gridId, l = Xs;
 		for (let t = 0; t < r.length; t++) {
 			const e = r[t];
 			l.push({
@@ -6705,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 me()), s = t.gridId, l = Us;
+		const o = this._fallbackDirty ?? (this._fallbackDirty = new nt()), s = t.gridId, l = Xs;
 		for (let t = 0; t < r.length; t++) {
 			const e = r[t];
 			l.push({
@@ -6753,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, Ye(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, sn(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 Le || t instanceof Pe || t instanceof Ke)) throw t;
+					if (!(t instanceof Ue || t instanceof Ke || t instanceof Ye)) throw t;
 					d = t;
 				} finally {
 					o._setReadHook(null);
@@ -6779,14 +6779,14 @@ var Es = class {
 						}
 						this._iterHitsLength = 0;
 					}
-					if (d instanceof Le) {
+					if (d instanceof Ue) {
 						if (0 !== (e.state & Jn)) {
 							this._unstartPrefetched(e), a = this._unwindSpeculative(i, a - 1);
 							continue;
 						}
 						l.retries++;
 						let t = 0;
-						const n = je(e), r = n.length;
+						const n = Je(e), r = n.length;
 						for (let o = 0; o < r; o++) {
 							const r = n[o];
 							if (I.isError(r)) continue;
@@ -6795,16 +6795,16 @@ var Es = class {
 						}
 						for (let e = 0; e < t; e++) {
 							const t = c[e];
-							0 === (t.state & (Kn | Zn)) && (t.state |= Jn | Zn, i[a++] = t);
+							0 === (t.state & (Kn | Yn)) && (t.state |= Jn | Yn, i[a++] = t);
 						}
 						const o = d.nodes, s = d.count;
 						for (let t = 0; t < s; t++) {
 							const e = o[t];
-							0 === (e.state & Kn) && (e.state = e.state & ~Jn | Zn, i[a++] = e);
+							0 === (e.state & Kn) && (e.state = e.state & ~Jn | Yn, i[a++] = e);
 						}
 						continue;
 					}
-					if (d instanceof Pe) {
+					if (d instanceof Ke) {
 						if (0 !== (e.state & Jn)) {
 							this._unstartPrefetched(e), a = this._unwindSpeculative(i, a - 1);
 							continue;
@@ -6819,23 +6819,23 @@ var Es = class {
 							}
 							t.state = -66305 & t.state | sr;
 							const n = Qs(t);
-							$e(t).demandValue = n, this._pushDemand(t, n);
+							Xe(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 Ke) {
+					if (d instanceof Ye) {
 						e.state = -69377 & e.state | sr | ir;
-						const t = Qs(e), n = $e(e);
-						n.cycleGroup = Zs(d.node), n.demandValue = t, this._pushDemand(e, t), h && this._fallbackBlank(e.block, !1), a--;
+						const t = Qs(e), n = Xe(e);
+						n.cycleGroup = Ys(d.node), n.demandValue = t, this._pushDemand(e, t), h && this._fallbackBlank(e.block, !1), a--;
 						continue;
 					}
-					if (this._iterate || (e.state & qn) !== ir) $e(e).demandValue = r, this._pushDemand(e, r), h && this._finalizeRepresentative(e, r, t(e.gridId), !1);
+					if (this._iterate || (e.state & qn) !== ir) Xe(e).demandValue = r, this._pushDemand(e, r), h && this._finalizeRepresentative(e, r, t(e.gridId), !1);
 					else {
 						const t = Qs(e);
-						$e(e).demandValue = t, this._pushDemand(e, t), h && this._fallbackBlank(e.block, !1);
+						Xe(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);
@@ -6867,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 = $e(e);
+			const o = Xe(e);
 			if (l && (r & qn) === lr) {
 				const t = this._resolveGroup(o.cycleGroup);
 				if (t !== s) {
@@ -6875,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 ? $e(c).cycleNext = e : a = e, c = e;
+			o.cycleGroup = s, c ? Xe(c).cycleNext = e : a = e, c = e;
 		}
-		return c && ($e(c).cycleNext = r ?? a), l && this._openGroups.set(s, i), o;
+		return c && (Xe(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;
@@ -6945,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 = Ye(e);
+		const n = this._context, r = this._container.getScope(), o = e.block.formula, s = sn(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;
@@ -6954,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 Le)) throw t;
+				if (!(t instanceof Ue)) throw t;
 				i = t;
 			} finally {
 				n._setReadHook(null);
@@ -6983,16 +6983,16 @@ var Es = class {
 		return !1;
 	}
 	_addCircular(t) {
-		0 === (t.state & Un) && (t.state |= Un, 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 &= ~Un;
+		for (let e = 0; e < t; e++) dl[e].state &= ~Xn;
 		this._circularNodesLength = 0;
 	}
 	_trackCircular(t, e, n, r, o) {
-		const s = $e(t), l = t.state & qn, i = 0 === l ? 0 : s.cycleGroup;
-		if (s.shownGroup === i && (t.state & Wn) === l << 2) return;
+		const s = Xe(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);
 			e && (e.members.delete(t), e.downstream.delete(t), e.isEmpty() && this._cycles.delete(s.shownGroup));
@@ -7002,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 & ~Wn | 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 = Yt(o)), e.circularConflating.append(n, r, a);
 	}
 	_cycleOf(t) {
 		let e = this._cycles.get(t);
@@ -7049,7 +7049,7 @@ var Es = class {
 			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, Ye(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, sn(o)), i[r] = o;
 			}
 			return r.length = o, s < o && this._flagDemandAppendix(i, s, o), p.closureHits++, p.discoveryMs += Ds() - m, s === o;
 		}
@@ -7059,13 +7059,13 @@ var Es = class {
 			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) && (S = !1), Pn(r, Ye(r)), nl[E++] = r, ol[A++] = r;
+			null !== o && (o.cycleGroup = 0), (r.planEpoch !== _ || r.planId !== g || null !== o && 0 !== o.shownGroup) && (S = !1), Pn(r, sn(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) && (S = !1), Pn(n, Ye(n)), nl[E++] = n, ol[A++] = n;
+			null !== r && (r.cycleGroup = 0), (n.planEpoch !== _ || n.planId !== g || null !== r && 0 !== r.shownGroup) && (S = !1), Pn(n, sn(n)), nl[E++] = n, ol[A++] = n;
 		}, N = (n, r, o, s, l, i) => {
 			if (n.unanchored) return;
 			const a = n.ref;
@@ -7082,15 +7082,15 @@ 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 = $e(t);
+					const r = Xe(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++) Oe(a[t], n, e, o, s, l, i, k, N);
+					for (let t = 0; t < c; t++) je(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];
-				Qe(r, n, e, k, N, M);
+				on(r, n, e, k, N, M);
 			}
 		}
 		const F = Ds();
@@ -7202,11 +7202,11 @@ var Es = class {
 		const D = (t) => {
 			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++, S && n.orderIndex >= Cl.orderIndex && D(Cl)) : this._iterate || 0 === (n.state & Wn) || (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) => {
-			n.cycleId === t && n.markId === e ? (Gl++, n.orderIndex > Bl && (Bl = n.orderIndex)) : null !== Vl || this._iterate || 0 === (n.state & Wn) || (Vl = n.ext.shownGroup);
+			n.cycleId === t && n.markId === e ? (Gl++, n.orderIndex > Bl && (Bl = n.orderIndex)) : null !== Vl || this._iterate || 0 === (n.state & Un) || (Vl = n.ext.shownGroup);
 		}, V = (t, e, n, r, o) => {
 			null === G && (G = /* @__PURE__ */ new Map());
 			let s = G.get(t);
@@ -7231,7 +7231,7 @@ var Es = class {
 			}, 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 < E; t++) {
-			const e = nl[t], n = je(e), r = n.length;
+			const e = nl[t], n = Je(e), r = n.length;
 			let o = 0;
 			for (let t = 0; t < r; t++) {
 				const r = n[t];
@@ -7275,7 +7275,7 @@ var Es = class {
 				const e = rl[t];
 				n = e;
 				const o = e.ext, s = o.spillDependents, l = s.length;
-				for (let t = 0; t < l; t++) Oe(s[t], e.rowIndex, e.colIndex, o.spillRowStart, o.spillColStart, o.spillRowEnd, o.spillColEnd, r);
+				for (let t = 0; t < l; t++) je(s[t], e.rowIndex, e.colIndex, o.spillRowStart, o.spillColStart, o.spillRowEnd, o.spillColEnd, r);
 			}
 			for (let t = 0; t < E; t++) {
 				const e = nl[t];
@@ -7294,14 +7294,14 @@ 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++) Oe(t[s], n, e, r.spillRowStart, r.spillColStart, r.spillRowEnd, r.spillColEnd, P);
+				for (let s = 0; s < o; s++) je(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];
-				Xe(r, n, e, P);
+				en(r, n, e, P);
 			}
 		}
 		if (p.kahnMs += Ds() - O, o || a < E) {
@@ -7319,7 +7319,7 @@ var Es = class {
 			t.length = 0, o && (a = 0);
 			for (let e = 0; e < E; e++) {
 				const n = nl[e];
-				(o || n.inDegree > 0) && (n.state |= $n, $e(n).demandValue = void 0, t.push(n));
+				(o || n.inDegree > 0) && (n.state |= $n, Xe(n).demandValue = void 0, t.push(n));
 			}
 			t.sort(Fs);
 			const e = t.length, n = a;
@@ -7345,7 +7345,7 @@ var Es = class {
 		r.length = 0;
 		for (let o = e; o < n; o++) {
 			const e = t[o];
-			e.state |= $n, $e(e).demandValue = void 0, r.push(e), this._addCircular(e);
+			e.state |= $n, Xe(e).demandValue = void 0, r.push(e), this._addCircular(e);
 		}
 	}
 	_invalidatePlans() {
@@ -7379,11 +7379,11 @@ 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, m, S, w, y, v, x, C, R, A, k, N, M = 0;
+		let g, p, m, S, w, v, x, C, b, R, A, k, N, M = 0;
 		const F = /* @__PURE__ */ new Map();
 		this._overlays = F;
 		const D = (t) => this._overlayFor(t), T = (t) => {
-			A = i.getGrid(t), R = A.getEntireCoords.bind(A), p = e(t), m = p.gridId, N = D(t), S = p.values, k = p.errorSpatial, w = p.contentfulSpatial, y = p.spillSpatial, v = p.notifyValues, x = p.notifySpillsInsert, C = p.notifySpillsRemove, p.notifyFormats, p.notifyCalcStatus, c.gridId = m;
+			A = i.getGrid(t), R = A.getEntireCoords.bind(A), p = e(t), m = p.gridId, N = D(t), S = p.values, k = p.errorSpatial, w = p.contentfulSpatial, v = p.spillSpatial, x = p.notifyValues, C = p.notifySpillsInsert, b = p.notifySpillsRemove, p.notifyFormats, p.notifyCalcStatus, c.gridId = m;
 		}, G = E.Axis.Column, B = G === E.Axis.Column, V = () => {
 			if (M > 0) {
 				n(f, M), M = 0;
@@ -7397,10 +7397,10 @@ var Es = class {
 			const e = u[t];
 			e.block.hasDataTable() && (e.state = e.state & ~Kn | sr, this._skippedTables.add(e));
 		}
-		let P = 0;
-		for (; P < _;) try {
-			for (; P < _; P++) {
-				const n = u[P], s = n.colIndex, l = n.rowIndex;
+		let z = 0;
+		for (; z < _;) try {
+			for (; z < _; z++) {
+				const n = u[z], s = n.colIndex, l = n.rowIndex;
 				if (1 & n.state && t === n.cycleId) {
 					n.state &= -2;
 					continue;
@@ -7409,17 +7409,17 @@ var Es = class {
 				const a = n.gridId;
 				a !== m && T(a);
 				const _ = n.block, E = _.representative === n && _.isBlankAware(t), F = n.cachedValue;
-				let z, L, $ = !1;
-				"object" == typeof F && null !== F && (F.isIRange ? z = F : I.isError(F, I.Code.Spill) && (L = F, $ = !0));
-				const H = 0 !== (n.state & $n);
-				H && (n.state & Kn) !== sr && (V(), this.doDemandEvaluate(t, e, this._demandBatch, V), c.gridId = a);
-				const j = H ? null : je(n), K = n.inputsAt;
-				if (j && K >= 0) {
-					const t = On(), e = j.length;
+				let L, $, K = !1;
+				"object" == typeof F && null !== F && (F.isIRange ? L = F : I.isError(F, I.Code.Spill) && ($ = F, K = !0));
+				const q = 0 !== (n.state & $n);
+				q && (n.state & Kn) !== sr && (V(), this.doDemandEvaluate(t, e, this._demandBatch, V), c.gridId = a);
+				const U = q ? null : Je(n), X = n.inputsAt;
+				if (U && X >= 0) {
+					const t = On(), e = U.length;
 					for (let n = 0; n < e; n++) {
-						const e = j[n];
+						const e = U[n];
 						if (I.isError(e)) {
-							t[K + n] = e;
+							t[X + n] = e;
 							continue;
 						}
 						const r = e.colStart, o = e.rowStart, s = e.colEnd, l = e.rowEnd;
@@ -7428,163 +7428,163 @@ var Es = class {
 							a && a !== m && (_ = i.getGrid(a), _ && (c = _.getValues(), u = D(a), h = _.getEntireCoords.bind(_)));
 							let f = _;
 							u.intersects(o, r, l, s) && (c = u, f = u);
-							const g = new U(d, c, { ...e }, null, h, i.resolveScope);
-							g._setErrorIndex(f), t[K + n] = g;
+							const g = new Ot(d, c, { ...e }, null, h, i.resolveScope);
+							g._setErrorIndex(f), t[X + n] = g;
 						}
 					}
 				}
-				j && null !== h && 0 !== h.getOpenCount() && 0 === (n.state & Qn) && jl(j, m, i) && (n.state |= Qn);
-				const q = B ? s : l, W = B ? l : s;
+				U && null !== h && 0 !== h.getOpenCount() && 0 === (n.state & Qn) && jl(U, m, i) && (n.state |= Qn);
+				const W = B ? s : l, J = B ? l : s;
 				c.node = n, c.colIndex = s, c.rowIndex = l, c.drawIndex = 0;
-				const X = _.formula;
-				let Z, Q = null, Y = !1;
-				const et = 4 & n.state ? 0 !== (n.state & nr) ? Nt.CalcStatus.Working : Nt.CalcStatus.Waiting : 0;
-				let nt = et;
-				const rt = r ? 0 : et, ot = n.ext;
-				if (H && !this._iterate && 0 !== (n.state & qn)) null !== ot && (ot.demandValue = void 0), Z = Qs(n), nt = 0;
+				const Y = _.formula;
+				let Q, Z = null, tt = !1;
+				const et = 4 & n.state ? 0 !== (n.state & nr) ? P.CalcStatus.Working : P.CalcStatus.Waiting : 0;
+				let rt = et;
+				const ot = r ? 0 : et, st = n.ext;
+				if (q && !this._iterate && 0 !== (n.state & qn)) null !== st && (st.demandValue = void 0), Q = Qs(n), rt = 0;
 				else {
-					if (H) {
-						const t = null !== ot ? ot.demandValue : void 0;
-						null !== ot && (ot.demandValue = void 0), Z = void 0 === t ? 0 : t;
+					if (q) {
+						const t = null !== st ? st.demandValue : void 0;
+						null !== st && (st.demandValue = void 0), Q = 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(S, y, l, s) : null;
+							const t = this._settlePass ? bs(S, v, l, s) : null;
 							if (null !== t && t.direct) {
-								Y = !0, n.state &= -2621441;
-								const e = Pt(t);
-								e?.isIRange ? (Z = X.finalizeValueForCell(e), Q = t) : Z = t;
+								tt = !0, n.state &= -2621441;
+								const e = y(t);
+								e?.isIRange ? (Q = Y.finalizeValueForCell(e), Z = t) : Q = t;
 							}
 						}
-						if (!Y) {
+						if (!tt) {
 							this._planStats.evaluated++, n.state &= -2621505;
 							const t = c.deferCount;
-							Z = X.evaluateAt(l, s), Z = X.finalizeValueForCell(Z), (c.perCellRead || c.positionRead) && (n.block.positionRead = !0), c.deferCount !== t && (Z = this._takeDeferred(n, Z), Q = this._spillHolder, this._spillHolder = null);
+							Q = Y.evaluateAt(l, s), Q = Y.finalizeValueForCell(Q), (c.perCellRead || c.positionRead) && (n.block.positionRead = !0), c.deferCount !== t && (Q = this._takeDeferred(n, Q), Z = this._spillHolder, this._spillHolder = null);
 						}
 					}
-					nt = 0 !== (n.state & er) ? Nt.CalcStatus.Working : 0 !== (n.state & (Qn | Yn)) ? Nt.CalcStatus.Waiting : 0, 0 !== nt && (n.state |= Yn);
+					rt = 0 !== (n.state & er) ? P.CalcStatus.Working : 0 !== (n.state & (Qn | Zn)) ? P.CalcStatus.Waiting : 0, 0 !== rt && (n.state |= Zn);
 				}
-				let st;
-				(n.state & Kn) !== sr && (n.state = n.state & ~Kn | 768), nt !== rt && (0 === nt ? n.state &= ~(4 | nr) : nt === Nt.CalcStatus.Working ? n.state |= 4 | nr : n.state = (4 | n.state) & ~nr, p.calcStatusConflating || (p.calcStatusConflating = b(B)), p.calcStatusConflating.append(q, W, 0 !== nt && nt)), H && N.takeDemand(l, s);
-				const lt = n.ext, it = null !== lt ? lt.fixedRef : null;
-				if (z || L || it) {
-					Ys.colStart = s, Ys.rowStart = l, Ys.colEnd = s, Ys.rowEnd = l;
-					const t = y.search(Ys);
-					for (let e = 0; !st && e < t.length; e++) {
+				let lt;
+				(n.state & Kn) !== sr && (n.state = n.state & ~Kn | 768), rt !== ot && (0 === rt ? n.state &= ~(4 | nr) : rt === P.CalcStatus.Working ? n.state |= 4 | nr : n.state = (4 | n.state) & ~nr, p.calcStatusConflating || (p.calcStatusConflating = Yt(B)), p.calcStatusConflating.append(W, J, 0 !== rt && rt)), q && N.takeDemand(l, s);
+				const it = n.ext, at = null !== it ? it.fixedRef : null;
+				if (L || $ || at) {
+					Zs.colStart = s, Zs.rowStart = l, Zs.colEnd = s, Zs.rowEnd = l;
+					const t = v.search(Zs);
+					for (let e = 0; !lt && e < t.length; e++) {
 						const n = t[e];
-						n.value.isAnchor(l, s) && "pivot" !== n.value.getKind() && (st = n);
+						n.value.isAnchor(l, s) && "pivot" !== n.value.getKind() && (lt = n);
 					}
-					if (st && (y.remove(st, Go), !st || !st.value.getError())) {
+					if (lt && (v.remove(lt, Go), !lt || !lt.value.getError())) {
 						const t = {
-							...o.sanitizeRange(st),
-							scope: st.scope,
+							...o.sanitizeRange(lt),
+							scope: lt.scope,
 							value: null
 						};
-						w.insertNonOverlapping(t), S.delete(t), J(k, t);
+						w.insertNonOverlapping(t), S.delete(t), ut(k, t);
 					}
 				}
-				Z = this._fitCell(_, Z);
-				let at = 1, ct = 1;
-				const dt = Z, ht = "object" == typeof Z && null !== Z, ut = ht && dt.isIRange;
-				let _t, ft = ht && I.isError(Z, I.Code.Spill);
-				if (it) {
-					at = it.colEnd - it.colStart + 1, ct = it.rowEnd - it.rowStart + 1;
+				Q = this._fitCell(_, Q);
+				let ct = 1, dt = 1;
+				const ht = Q, _t = "object" == typeof Q && null !== Q, ft = _t && ht.isIRange;
+				let gt, pt = _t && I.isError(Q, I.Code.Spill);
+				if (at) {
+					ct = at.colEnd - at.colStart + 1, dt = at.rowEnd - at.rowStart + 1;
 					const e = {
-						colStart: it.colStart,
-						rowStart: it.rowStart,
-						colEnd: it.colEnd,
-						rowEnd: it.rowEnd,
+						colStart: at.colStart,
+						rowStart: at.rowStart,
+						colEnd: at.colEnd,
+						rowEnd: at.rowEnd,
 						scope: a
-					}, r = qe(Z, e, B)?.tuples;
-					S.delete(e), r && S.setValues(r), J(k, e), Ct(k, r, B), _t = {
+					}, r = Qe(Q, e, B)?.tuples;
+					S.delete(e), r && S.setValues(r), ut(k, e), H(k, r, B), gt = {
 						...e,
-						value: new ce(e, t, "fixed", null, Q)
-					}, y.insert(_t), i.addDynamicPrecedent(n, e, -2), w.insertNonOverlapping({
+						value: new j(e, t, "fixed", null, Z)
+					}, v.insert(gt), i.addDynamicPrecedent(n, e, -2), w.insertNonOverlapping({
 						...e,
-						value: new tt(e, G)
+						value: new zt(e, G)
 					});
-				} else if (ut && dt.size > 1) {
-					at = dt.getColumnCount(), ct = dt.getRowCount();
+				} else if (ft && ht.size > 1) {
+					ct = ht.getColumnCount(), dt = ht.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 + at - 1,
-						rowEnd: r + ct - 1,
+						colEnd: c + ct - 1,
+						rowEnd: r + dt - 1,
 						scope: a
 					}, h = R(), u = !o.isRangeWithinRange(d, h);
-					if (u && (d.colEnd = Math.min(d.colEnd, h.colEnd), d.rowEnd = Math.min(d.rowEnd, h.rowEnd)), ft = u, !ft) {
+					if (u && (d.colEnd = Math.min(d.colEnd, h.colEnd), d.rowEnd = Math.min(d.rowEnd, h.rowEnd)), pt = u, !pt) {
 						const t = w.search(d);
-						if (ft = t.length > 1, !ft && 1 === t.length) {
+						if (pt = t.length > 1, !pt && 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 || (ft = !0);
+							!n || n.rowEnd === n.rowStart && n.colStart === n.colEnd && n.colStart === s && n.rowStart === l || (pt = !0);
 						}
 					}
 					let _, f;
-					if (ft) Z = I.BuiltIn.Spill, at = 1, ct = 1, _ = [[q, [[W, [Z]]]]], S.setValues(_), Ct(k, _, B), f = {
+					if (pt) Q = I.BuiltIn.Spill, ct = 1, dt = 1, _ = [[W, [[J, [Q]]]]], S.setValues(_), H(k, _, B), f = {
 						colStart: s,
 						rowStart: l,
 						colEnd: s,
 						rowEnd: l
 					};
 					else {
-						const t = We(dt, B ? c : r, B ? r : c);
-						t && (_ = t.tuples), S.delete(d), _ && S.setValues(_), J(k, d), Ct(k, _, B), f = d;
+						const t = Ze(ht, B ? c : r, B ? r : c);
+						t && (_ = t.tuples), S.delete(d), _ && S.setValues(_), ut(k, d), H(k, _, B), f = d;
 					}
-					const g = ft ? {
+					const g = pt ? {
 						colStart: s,
 						rowStart: l,
 						colEnd: s,
 						rowEnd: l,
 						scope: a
 					} : d;
-					_t = {
+					gt = {
 						...g,
-						value: new ce(g, t, ft ? "error" : "dynamic", ft || null === e ? null : e, Q, ft ? d : null)
-					}, y.insert(_t), i.addDynamicPrecedent(n, d, -2), w.insertNonOverlapping({
+						value: new j(g, t, pt ? "error" : "dynamic", pt || null === e ? null : e, Z, pt ? d : null)
+					}, v.insert(gt), i.addDynamicPrecedent(n, d, -2), w.insertNonOverlapping({
 						...f,
-						value: new tt(f, G)
+						value: new zt(f, G)
 					});
 				}
-				!E || _.blankCycleId === t && _.blankMarkId === this._passMarkId || this._finalizeRepresentative(n, Z, p, 0 !== nt || H || !0 === ut || ft || null !== it || Y);
-				let gt = !1;
-				if ((st || _t || ft || L) && (gt = o.isEqualRanges(st, _t), st && C.push(st), _t && x.push(_t)), _t || st) {
-					const t = st ?? _t, e = _t ?? st, r = {
+				!E || _.blankCycleId === t && _.blankMarkId === this._passMarkId || this._finalizeRepresentative(n, Q, p, 0 !== rt || q || !0 === ft || pt || null !== at || tt);
+				let mt = !1;
+				if ((lt || gt || pt || $) && (mt = o.isEqualRanges(lt, gt), lt && b.push(lt), gt && C.push(gt)), gt || lt) {
+					const t = lt ?? gt, e = gt ?? lt, 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), gt && ft === $ || (this._invalidatePlans(), i.getPrecedents().search(r).length > 0 && (n.state |= 1, g || (g = new me()), g.insertNonOverlapping(r)));
+					x.insertNonOverlapping(r), mt && pt === K || (this._invalidatePlans(), i.getPrecedents().search(r).length > 0 && (n.state |= 1, g || (g = new nt()), g.insertNonOverlapping(r)));
 				}
-				n.cachedValue = Z, f[M++] = n;
-				const pt = null !== h && h.hasHolders() ? Pt(Z) : Z;
-				ut || it || N.push(l, s, pt), M >= (N.observed ? As : ks) && V(), (0 !== (n.state & qn) || null !== n.ext && 0 !== n.ext.shownGroup) && this._trackCircular(n, p, q, W, B);
-				const mt = n.dependents, St = mt.length;
-				if (St > 0) {
+				n.cachedValue = Q, f[M++] = n;
+				const St = null !== h && h.hasHolders() ? y(Q) : Q;
+				ft || at || N.push(l, s, St), M >= (N.observed ? As : ks) && V(), (0 !== (n.state & qn) || null !== n.ext && 0 !== n.ext.shownGroup) && this._trackCircular(n, p, W, J, B);
+				const wt = n.dependents, Et = wt.length;
+				if (Et > 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 && Xe(r, l, s, this._taintDownstream);
+					for (let n = 0; n < Et; n++) {
+						const r = wt[n];
+						e && en(r, l, s, this._taintDownstream);
 						const o = r.value.index;
-						o < 0 || (Ze(r) && (Ol = o, Pl = pt, Xe(r, l, s, $l)), t && Xe(r, l, s, Hl));
+						o < 0 || (rn(r) && (Ol = o, Pl = St, en(r, l, s, $l)), t && en(r, l, s, Hl));
 					}
 				}
 			}
 		} catch (n) {
-			const r = u[P];
-			if (n instanceof Le || n instanceof Pe && this._iterate) {
+			const r = u[z];
+			if (n instanceof Ue || n instanceof Ke && this._iterate) {
 				const o = Ks;
-				if (o.length = 0, n instanceof Le) for (let t = 0; t < n.count; t++) o.push(n.nodes[t]);
+				if (o.length = 0, n instanceof Ue) for (let t = 0; t < n.count; t++) o.push(n.nodes[t]);
 				o.push(r), V(), r.state &= ~Kn, this.doDemandEvaluate(t, e, o, V);
 			} else {
-				if (!(n instanceof Pe || n instanceof Ke)) throw n;
+				if (!(n instanceof Ke || n instanceof Ye)) throw n;
 				{
-					const t = n instanceof Pe;
+					const t = n instanceof Ke;
 					r.state = -3841 & r.state | $n | sr | (t ? lr : ir);
-					const e = $e(r);
-					e.demandValue = Qs(r), e.cycleGroup = t ? ++this._cycleGroupNext : Zs(n.node), t && (e.cycleNext = r), this._addCircular(r);
+					const e = Xe(r);
+					e.demandValue = Qs(r), e.cycleGroup = t ? ++this._cycleGroupNext : Ys(n.node), t && (e.cycleNext = r), this._addCircular(r);
 				}
 			}
 			c.gridId = r.gridId;
@@ -7592,14 +7592,14 @@ var Es = class {
 		c.node = null, c.colIndex = Number.MAX_SAFE_INTEGER, c.rowIndex = Number.MAX_SAFE_INTEGER, V();
 		for (const t of F.values()) t.commitDemand();
 		this._flush = null, this._overlays = null;
-		const z = this._fallbackDirty;
-		return null !== z && (this._fallbackDirty = null, g ? g.insertAllNonOverlapping(z.all()) : g = z), (() => {
+		const L = this._fallbackDirty;
+		return null !== L && (this._fallbackDirty = null, g ? g.insertAllNonOverlapping(L.all()) : g = L), (() => {
 			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 dt.ArrayList(t.slice(0, e));
+}, Is = (t, e) => new U.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++) {
@@ -7609,10 +7609,10 @@ function ys(t, e, n, r, o, s) {
 	return !1;
 }
 function vs(t, e, n) {
-	const r = e.values, o = e.errorSpatial, s = qs, l = Ws;
+	const r = e.values, o = e.errorSpatial, s = qs, l = Us;
 	for (let i = 0; i < t.length; i++) {
 		const a = t[i];
-		r.delete(a), J(o, a);
+		r.delete(a), ut(o, a);
 		const c = {
 			colStart: a.colStart,
 			rowStart: a.rowStart,
@@ -7641,7 +7641,7 @@ function Cs(t, e, n) {
 }
 var bs = (t, e, n, r) => {
 	const o = t.getValueAt(n, r);
-	return bt(o) ? o : Ee(e, n, r);
+	return k(o) ? o : Ut(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;
@@ -7708,21 +7708,21 @@ var Ps = {
 	rowEnd: 0,
 	colEnd: 0,
 	scope: null
-}, Ks = [null], qs = [], Ws = [], Us = [], Xs = [], Js = {
+}, Ks = [null], qs = [], Us = [], Xs = [], Ws = [], Js = {
 	rowStart: 0,
 	colStart: 0,
 	rowEnd: 0,
 	colEnd: 0,
 	scope: null
-}, Zs = (t) => {
+}, Ys = (t) => {
 	const e = t.ext;
 	return null === e ? 0 : 0 !== (t.state & qn) ? e.cycleGroup : e.shownGroup;
-}, Qs = (t) => Pt(t.cachedValue) ?? 0, Ys = {
+}, Qs = (t) => y(t.cachedValue) ?? 0, Zs = {
 	rowStart: 0,
 	colStart: 0,
 	rowEnd: 0,
 	colEnd: 0
-}, tl = 1e4, el = Zt(tl), nl = Zt(tl), rl = Zt(tl), ol = Zt(tl), sl = Zt(tl), ll = Zt(tl), il = Zt(tl), al = Zt(tl), cl = Zt(tl), dl = Zt(tl), hl = Zt(tl), ul = Zt(tl), _l = Zt(tl), fl = Zt(tl), gl = Zt(tl), pl = Zt(tl), ml = [null], Sl = [], wl = -1, El = -1, Il = -1, yl = -1;
+}, tl = 1e4, el = gt(tl), nl = gt(tl), rl = gt(tl), ol = gt(tl), sl = gt(tl), ll = gt(tl), il = gt(tl), al = gt(tl), cl = gt(tl), dl = gt(tl), hl = gt(tl), ul = gt(tl), _l = gt(tl), fl = gt(tl), gl = gt(tl), pl = gt(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;
@@ -7735,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, Rl = 64, Al = 4, kl = 1024, Nl = 7, Ml = Zt(8), Fl = Zt(8), Dl = Zt(8), Tl = Array.from({ length: 8 }, () => ({
+var Cl = null, bl = 0, Rl = 64, Al = 4, kl = 1024, Nl = 7, Ml = gt(8), Fl = gt(8), Dl = gt(8), Tl = Array.from({ length: 8 }, () => ({
 	colStart: 0,
 	colEnd: 0,
 	rowStart: 0,
@@ -7767,12 +7767,12 @@ function Kl(t, e) {
 	return n === r ? 0 : 1 / 0;
 }
 var ql = {
-	values: Zt(tl),
+	values: gt(tl),
 	length: 0
-}, Wl = {
-	values: Zt(tl),
+}, Ul = {
+	values: gt(tl),
 	length: 0
-}, Ul = 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;
 	}
@@ -7781,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 = R(d, t);
+				const e = D(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 = R(d, void 0 !== r && r >= 0 && r < h.length ? r : -1), s = Xl(o, n.name);
+				const r = n.sheetIndex, o = D(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) {
@@ -7800,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(gt(t).bookId));
+		for (const t of this._registeredSheetGrids()) s.has(t) || (r(t), this._loadedData.delete(t), i.add(K(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(I.BuiltIn.Name.toString()), i.add(gt(e.getScope()).bookId);
+			this._hostsById.delete(e.getId()), n?.setPlaceholder(I.BuiltIn.Name.toString()), i.add(K(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;
@@ -7818,7 +7818,7 @@ var ql = {
 	_registeredSheetGrids() {
 		const t = [];
 		for (const e of this._options.gridIds()) {
-			const n = gt(e);
+			const n = K(e);
 			n && n.sheetIndex >= 0 && t.push(e);
 		}
 		return t;
@@ -7834,7 +7834,7 @@ var ql = {
 				for (let t = 0; t < o.length; t++) {
 					const [n, s] = o[t], l = s.length;
 					for (let t = 0; t < l; t++) {
-						const o = fe.fromJSONValue(s.at(t));
+						const o = J.fromJSONValue(s.at(t));
 						null != o && e.push({
 							col: n + t,
 							row: r,
@@ -7845,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 ht.Builder();
+			const n = new be.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);
@@ -7858,7 +7858,7 @@ 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);
 	}
@@ -7866,22 +7866,22 @@ var ql = {
 		const { queue: l, recompileNamed: i } = this._options;
 		let a = o.trim();
 		a.startsWith("=") && (a = a.substring(1)), a || (a = I.BuiltIn.Ref.toString());
-		const c = gt(r), d = c.sheetIndex >= 0 ? c.sheetIndex : n.getSheetNames().length > 0 ? 0 : -1, h = R(c.bookId, d);
+		const c = K(r), d = c.sheetIndex >= 0 ? c.sheetIndex : n.getSheetNames().length > 0 ? 0 : -1, h = D(c.bookId, d);
 		l(async () => {
 			this._hostsById.get(t) === e && e.setBody({
 				coords: Jl,
 				expression: a,
-				authoredAt: Zl,
+				authoredAt: Yl,
 				scopeGridId: h
 			}) && (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,
 	rowEnd: 0
-}), Zl = Object.freeze({
+}), Yl = Object.freeze({
 	rowIndex: 0,
 	colIndex: 0
 }), Ql = class extends a {
@@ -7902,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(Fe.Sheet, t)?.toString(), this._heldCloneKey = null, this._callbacks = t.callbacks, this._runtime = t.runtime, this._richData = t.richData ?? Te.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(ie.Sheet, t)?.toString(), this._heldCloneKey = null, this._callbacks = t.callbacks, this._runtime = t.runtime, this._richData = t.richData ?? x.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(),
@@ -7921,8 +7921,8 @@ var ql = {
 			} }),
 			dynamicByBlock: /* @__PURE__ */ new Map(),
 			dirtySpatial: new wn()
-		}), t.modelCommitId && this.mirror(t.modelCommitId), this._context = new io(this, E.Axis.Column, t.functions), this._deferred = new Zo(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) => Jt.fromJSON({
+		}), t.modelCommitId && this.mirror(t.modelCommitId), this._context = new io(this, E.Axis.Column, t.functions), this._deferred = new Yo(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) => xt.fromJSON({
 				type: t,
 				data: e
 			}, this._richData),
@@ -7932,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 Ul({
+		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) => {
@@ -8010,7 +8010,7 @@ var ql = {
 		const r = this.getGrid(t);
 		if (!r) return null;
 		const o = r.getValues().getValueAt(e, n);
-		return bt(o) ? o : Ee(r.getSpills(), e, n);
+		return k(o) ? o : Ut(r.getSpills(), e, n);
 	}
 	_settleNow() {
 		const t = this._deferred, e = t.takeMoved();
@@ -8030,7 +8030,7 @@ var ql = {
 			if (null === _ || !o.isLiveNode(_)) continue;
 			const f = _.gridId, g = n.gridsAll.get(f);
 			if (!g) continue;
-			const p = _.rowIndex, m = _.colIndex, S = g.getValues().getValueAt(p, m), w = bt(S), E = w ? S : Ee(g.getSpills(), p, m);
+			const p = _.rowIndex, m = _.colIndex, S = g.getValues().getValueAt(p, m), w = k(S), E = w ? S : Ut(g.getSpills(), p, m);
 			if (null === E || E.calls.indexOf(u) < 0) continue;
 			if (!E.direct) {
 				c.add(_), i(s, f).add(p, m);
@@ -8056,8 +8056,8 @@ var ql = {
 				}, n = y.errors.get(t);
 				n ? n.push(e) : y.errors.set(t, [e]);
 			}
-			_.state &= -6815749, Yl.colStart = m, Yl.colEnd = m, Yl.rowStart = p, Yl.rowEnd = p, Yl.scope = f;
-			const x = r.search(Yl);
+			_.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;
 				if (n.index < 0) {
@@ -8068,7 +8068,7 @@ var ql = {
 					});
 					continue;
 				}
-				Xe(e, p, m, h);
+				en(e, p, m, h);
 			}
 		}
 		for (const [e, n] of a) {
@@ -8083,7 +8083,7 @@ var ql = {
 				}), s[t] = {
 					...e,
 					value: !1
-				}, J(r.errorSpatial, e);
+				}, ut(r.errorSpatial, e);
 			}
 			r.notifyCalcStatus.load(s);
 			for (const [t, e] of n.errors) r.errorSpatial.load(ni(e).map((e) => ({
@@ -8109,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 = gt(t)?.bookId ?? null, c = a ? null : gt(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 ? R(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 = K(t)?.bookId ?? null, c = a ? null : K(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 ? D(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;
@@ -8127,15 +8127,15 @@ var ql = {
 		return this._sheetsCache().ids;
 	}
 	getSheetSpanIds(t) {
-		const e = at(t);
+		const e = A(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 = gt(t);
+		const n = K(t);
 		if (!n || n.sheetEnd === n.sheetIndex) return null;
 		const r = [];
-		for (let t = n.sheetIndex; t <= n.sheetEnd; t++) r.push(R(n.bookId, t));
+		for (let t = n.sheetIndex; t <= n.sheetEnd; t++) r.push(D(n.bookId, t));
 		return r;
 	}
 	getFormulas() {
@@ -8244,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 = y(t, E.Axis.Column, 2);
+		let s = !1, l = De(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));
@@ -8446,7 +8446,7 @@ var ql = {
 		}), e;
 	}
 	createEngineGrid(t) {
-		const e = t.id, n = t.sizeOf, r = t.entireCoords, o = void 0 !== n ? () => this.getGrid(n)?.getEntireCoords() ?? Ae : r ? () => r : void 0, s = this._callbacks;
+		const e = t.id, n = t.sizeOf, r = t.entireCoords, o = void 0 !== n ? () => this.getGrid(n)?.getEntireCoords() ?? $t : r ? () => r : void 0, s = this._callbacks;
 		return this.createBackendGrid({
 			uuid: e,
 			shadowOf: t.shadowOf,
@@ -8494,15 +8494,15 @@ var ql = {
 		switch (n.type) {
 			case "sheets": return this.applySheets(n.sheets), {
 				cycleId: this._cycleId,
-				commitId: C(n)
+				commitId: ft(n)
 			};
 			case "tables": return this.applyTables(n.changes), {
 				cycleId: this._cycleId,
-				commitId: C(n)
+				commitId: ft(n)
 			};
 			case "names": return this.applyNames(n.changes), {
 				cycleId: this._cycleId,
-				commitId: C(n)
+				commitId: ft(n)
 			};
 			case "nameGraph": return {
 				cycleId: this._cycleId,
@@ -8515,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: C(n)
+			commitId: ft(n)
 		};
 	}
 	applyHeld(t, e) {
@@ -8580,7 +8580,7 @@ var ql = {
 		return l;
 	}
 	followRestore(t, e) {
-		return e === H.Status.Off || e === H.Status.Error ? (this.retarget(t), !1) : e !== H.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 === ee.Status.Off || e === ee.Status.Error ? (this.retarget(t), !1) : e !== ee.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();
@@ -8612,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 bt(o.cachedValue) && (o.cachedValue = void 0);
-				let c = He(t.finalizeValue(a));
+				} else k(o.cachedValue) && (o.cachedValue = void 0);
+				let c = We(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 bt(t) ? t.calls : r.EmptyArray;
+				return k(t) ? t.calls : r.EmptyArray;
 			}
 		};
 	}
@@ -8635,7 +8635,7 @@ var ql = {
 			for (let t = 0; t < n.length; t++) {
 				const r = n[t].value;
 				if (null == r.gridId) continue;
-				if (jt(r.gridId) || this._externalBindings.getNameById(r.gridId)) continue;
+				if (St(r.gridId) || this._externalBindings.getNameById(r.gridId)) continue;
 				const o = r.getReferencedSymbolIds();
 				if (0 === o.length) continue;
 				const s = r.ref, l = {
@@ -8698,10 +8698,10 @@ var ql = {
 				e ? e.push(l[t]) : s.set(u, [l[t]]);
 				continue;
 			}
-			const _ = null != u && !n.isDefinedName(u) && !jt(u) && !this._externalBindings.getNameById(u);
+			const _ = null != u && !n.isDefinedName(u) && !St(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) => F(t, n) ? we() : null));
+				a.includes(e) && (h = h.replaceTableReferences(e, (t) => Ne(t, n) ? O() : null));
 			}
 			const f = h && h !== i.formula ? h.getTextAt(d.rowStart, d.colStart) : i.getTextAt(d.rowStart, d.colStart);
 			this._writeBlockText(i, f);
@@ -8709,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(Fe.Sheet, t);
+		const l = this._symbols.bind(ie.Sheet, t);
 		if (!l) return;
 		const i = this._getState().precedentSpatial.search({
 			colStart: e.colStart,
@@ -8723,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 || jt(r) || this._externalBindings.getNameById(r)) continue;
+			if (null == r || St(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]);
 		}
@@ -8789,11 +8789,11 @@ var ql = {
 		}
 	}
 	rewriteTableReferences(t, e) {
-		const n = (t) => e ? St(t, e) : we(), r = this._callbacks, o = this._getState().formulaSpatial.all3D();
+		const n = (t) => e ? Xt(t, e) : O(), 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) || jt(l) || this._externalBindings.getNameById(l)) continue;
+			if (r.isDefinedName(l) || St(l) || this._externalBindings.getNameById(l)) continue;
 			const i = s.formula, a = i?.replaceTableReferences(t, n);
 			if (!a || a === i) continue;
 			const c = s.ref;
@@ -9166,7 +9166,7 @@ var ql = {
 	toString() {
 		return "CalcBackend";
 	}
-}, Yl = {
+}, Zl = {
 	colStart: 0,
 	rowStart: 0,
 	colEnd: 0,
@@ -9174,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 = Yt(t);
 	}
 	add(t, e) {
 		const n = this._unordered;
@@ -9203,7 +9203,7 @@ var ql = {
 	colEnd: t.colEnd,
 	rowEnd: t.rowEnd
 }), ni = (t) => {
-	const e = y(t, E.Axis.Column, 2), n = new Array(e.length);
+	const e = De(t, E.Axis.Column, 2), n = new Array(e.length);
 	for (let t = 0; t < e.length; t++) {
 		const r = e[t];
 		n[t] = {