@sheetxl/studio-vanilla 0.4.14 → 0.4.16

package/browser/esm/{DQLk_UmdpJBt-zZi.mjs → XMnVd_ZFLys2rjY7.mjs}

@@ -1,6 +1,6 @@
-import { aV as Gs, Y as D, l as ft, aW as Ye, aX as Ks, D as Xt, aY as jn, aZ as zs, a_ as Vs, a$ as Xe, b0 as Hs, K as se, b1 as Ue, b2 as Fe } from "./BbW_1O3cEhZ4aSgS.mjs";
+import { aL as Gs, Y as D, n as ft, aM as Ye, aN as Ks, m as Xt, aO as jn, aP as zs, aQ as Vs, aR as Xe, aS as Hs, f as se, aT as Ue, aU as Fe } from "./BFGNX8BKN0YukAfE.mjs";
 /**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.4.14
+ * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.4.16
  *
  * (C) 2025-present SheetXL Inc. & Michael T. Ford
  * License: The license can be found at https://www.sheetxl.com/license.
@@ -19,11 +19,11 @@ function Jt(t) {
   }(t) : (e = t, Zs.call(e));
   var e;
 }
-function Ot(t) {
+function vt(t) {
   return t != null && typeof t == "object";
 }
-function On(t) {
-  return typeof t == "symbol" || Ot(t) && Jt(t) == "[object Symbol]";
+function vn(t) {
+  return typeof t == "symbol" || vt(t) && Jt(t) == "[object Symbol]";
 }
 function Sn(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length, i = Array(r); ++n < r; ) i[n] = e(t[n], n, t);
@@ -33,7 +33,7 @@ var B = Array.isArray, ti = It ? It.prototype : void 0, ei = ti ? ti.toString :
 function jo(t) {
   if (typeof t == "string") return t;
   if (B(t)) return Sn(t, jo) + "";
-  if (On(t)) return ei ? ei.call(t) : "";
+  if (vn(t)) return ei ? ei.call(t) : "";
   var e = t + "";
   return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
 }
@@ -46,7 +46,7 @@ var ta = /^[-+]0x[0-9a-f]+$/i, ea = /^0b[01]+$/i, na = /^0o[0-7]+$/i, ra = parse
 function oa(t) {
   return t ? (t = function(e) {
     if (typeof e == "number") return e;
-    if (On(e)) return NaN;
+    if (vn(e)) return NaN;
     if (Nt(e)) {
       var n = typeof e.valueOf == "function" ? e.valueOf() : e;
       e = Nt(n) ? n + "" : n;
@@ -211,12 +211,12 @@ function Ve(t) {
   return t === (typeof e == "function" && e.prototype || Ia);
 }
 function ai(t) {
-  return Ot(t) && Jt(t) == "[object Arguments]";
+  return vt(t) && Jt(t) == "[object Arguments]";
 }
 var Ko = Object.prototype, Na = Ko.hasOwnProperty, ya = Ko.propertyIsEnumerable, Cn = ai(/* @__PURE__ */ function() {
   return arguments;
 }()) ? ai : function(t) {
-  return Ot(t) && Na.call(t, "callee") && !ya.call(t, "callee");
+  return vt(t) && Na.call(t, "callee") && !ya.call(t, "callee");
 }, zo = typeof exports == "object" && exports && !exports.nodeType && exports, ci = zo && typeof module == "object" && module && !module.nodeType && module, ui = ci && ci.exports === zo ? wt.Buffer : void 0, De = (ui ? ui.isBuffer : void 0) || function() {
   return !1;
 }, z = {};
@@ -232,7 +232,7 @@ var Vo = typeof exports == "object" && exports && !exports.nodeType && exports,
   } catch {
   }
 }(), li = Zt && Zt.isTypedArray, Wr = li ? kn(li) : function(t) {
-  return Ot(t) && $r(t.length) && !!z[Jt(t)];
+  return vt(t) && $r(t.length) && !!z[Jt(t)];
 }, Ra = Object.prototype.hasOwnProperty;
 function Ho(t, e) {
   var n = B(t), r = !n && Cn(t), i = !n && !r && De(t), o = !n && !r && !i && Wr(t), s = n || r || i || o, a = s ? function(l, h) {
@@ -247,11 +247,11 @@ function Yo(t, e) {
     return t(e(n));
   };
 }
-var va = Yo(Object.keys, Object), Oa = Object.prototype.hasOwnProperty;
+var Oa = Yo(Object.keys, Object), va = Object.prototype.hasOwnProperty;
 function Xo(t) {
-  if (!Ve(t)) return va(t);
+  if (!Ve(t)) return Oa(t);
   var e = [];
-  for (var n in Object(t)) Oa.call(t, n) && n != "constructor" && e.push(n);
+  for (var n in Object(t)) va.call(t, n) && n != "constructor" && e.push(n);
   return e;
 }
 function yt(t) {
@@ -284,7 +284,7 @@ var La = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, xa = /^\w*$/;
 function gr(t, e) {
   if (B(t)) return !1;
   var n = typeof t;
-  return !(n != "number" && n != "symbol" && n != "boolean" && t != null && !On(t)) || xa.test(t) || !La.test(t) || e != null && t in Object(e);
+  return !(n != "number" && n != "symbol" && n != "boolean" && t != null && !vn(t)) || xa.test(t) || !La.test(t) || e != null && t in Object(e);
 }
 var Re = ce(Object, "create"), Ca = Object.prototype.hasOwnProperty, ka = Object.prototype.hasOwnProperty;
 function re(t) {
@@ -388,7 +388,7 @@ function bn(t, e) {
   }(t));
 }
 function Be(t) {
-  if (typeof t == "string" || On(t)) return t;
+  if (typeof t == "string" || vn(t)) return t;
   var e = t + "";
   return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
 }
@@ -493,9 +493,9 @@ var Ir = ce(wt, "DataView"), Nr = ce(wt, "Promise"), pe = ce(wt, "Set"), Ei = "[
   return e;
 });
 var za = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, Va = /\w*$/, Ni = It ? It.prototype : void 0, yi = Ni ? Ni.valueOf : void 0, Ri = Zt && Zt.isMap, Ha = Ri ? kn(Ri) : function(t) {
-  return Ot(t) && At(t) == "[object Map]";
-}, vi = Zt && Zt.isSet, Ya = vi ? kn(vi) : function(t) {
-  return Ot(t) && At(t) == "[object Set]";
+  return vt(t) && At(t) == "[object Map]";
+}, Oi = Zt && Zt.isSet, Ya = Oi ? kn(Oi) : function(t) {
+  return vt(t) && At(t) == "[object Set]";
 }, ns = "[object Arguments]", rs = "[object Function]", is = "[object Object]", G = {};
 function sn(t, e, n, r, i, o) {
   var s;
@@ -521,10 +521,10 @@ function sn(t, e, n, r, i, o) {
   }(s, t));
   if (!G[h]) return i ? t : {};
   s = function(m, y) {
-    var p, T, g, A, v, f, d, I = m.constructor;
+    var p, T, g, A, O, f, d, I = m.constructor;
     switch (y) {
       case "[object ArrayBuffer]":
-        return v = new (A = m).constructor(A.byteLength), new mn(v).set(new mn(A)), v;
+        return O = new (A = m).constructor(A.byteLength), new mn(O).set(new mn(A)), O;
       case "[object Boolean]":
       case "[object Date]":
         return new I(+m);
@@ -588,7 +588,7 @@ function os(t, e) {
 function Yr(t, e) {
   return t.has(e);
 }
-function Oi(t, e, n, r, i, o) {
+function vi(t, e, n, r, i, o) {
   var s = 1 & n, a = t.length, c = e.length;
   if (a != c && !(s && c > a)) return !1;
   var u = o.get(t), l = o.get(e);
@@ -635,13 +635,13 @@ G[ns] = G["[object Array]"] = G["[object ArrayBuffer]"] = G["[object DataView]"]
 };
 var Si = It ? It.prototype : void 0, Hn = Si ? Si.valueOf : void 0, qa = Object.prototype.hasOwnProperty, _i = "[object Arguments]", Li = "[object Array]", Qe = "[object Object]", xi = Object.prototype.hasOwnProperty;
 function yr(t, e, n, r, i) {
-  return t === e || (t == null || e == null || !Ot(t) && !Ot(e) ? t != t && e != e : function(o, s, a, c, u, l) {
+  return t === e || (t == null || e == null || !vt(t) && !vt(e) ? t != t && e != e : function(o, s, a, c, u, l) {
     var h = B(o), N = B(s), S = h ? Li : At(o), _ = N ? Li : At(s), m = (S = S == _i ? Qe : S) == Qe, y = (_ = _ == _i ? Qe : _) == Qe, p = S == _;
     if (p && De(o)) {
       if (!De(s)) return !1;
       h = !0, m = !1;
     }
-    if (p && !m) return l || (l = new bt()), h || Wr(o) ? Oi(o, s, a, c, u, l) : function(f, d, I, E, R, M, L) {
+    if (p && !m) return l || (l = new bt()), h || Wr(o) ? vi(o, s, a, c, u, l) : function(f, d, I, E, R, M, L) {
       switch (I) {
         case "[object DataView]":
           if (f.byteLength != d.byteLength || f.byteOffset != d.byteOffset) return !1;
@@ -658,14 +658,14 @@ function yr(t, e, n, r, i) {
         case "[object String]":
           return f == d + "";
         case "[object Map]":
-          var O = Xa;
+          var v = Xa;
         case "[object Set]":
           var P = 1 & E;
-          if (O || (O = Xr), f.size != d.size && !P) return !1;
+          if (v || (v = Xr), f.size != d.size && !P) return !1;
           var x = L.get(f);
           if (x) return x == d;
           E |= 2, L.set(f, d);
-          var C = Oi(O(f), O(d), E, R, M, L);
+          var C = vi(v(f), v(d), E, R, M, L);
           return L.delete(f), C;
         case "[object Symbol]":
           if (Hn) return Hn.call(f) == Hn.call(d);
@@ -675,15 +675,15 @@ function yr(t, e, n, r, i) {
     if (!(1 & a)) {
       var T = m && xi.call(o, "__wrapped__"), g = y && xi.call(s, "__wrapped__");
       if (T || g) {
-        var A = T ? o.value() : o, v = g ? s.value() : s;
-        return l || (l = new bt()), u(A, v, a, c, l);
+        var A = T ? o.value() : o, O = g ? s.value() : s;
+        return l || (l = new bt()), u(A, O, a, c, l);
       }
     }
     return !!p && (l || (l = new bt()), function(f, d, I, E, R, M) {
-      var L = 1 & I, O = Ar(f), P = O.length;
+      var L = 1 & I, v = Ar(f), P = v.length;
       if (P != Ar(d).length && !L) return !1;
       for (var x = P; x--; ) {
-        var C = O[x];
+        var C = v[x];
         if (!(L ? C in d : qa.call(d, C))) return !1;
       }
       var $ = M.get(f), X = M.get(d);
@@ -691,7 +691,7 @@ function yr(t, e, n, r, i) {
       var W = !0;
       M.set(f, d), M.set(d, f);
       for (var rt = L; ++x < P; ) {
-        var Et = f[C = O[x]], Ct = d[C];
+        var Et = f[C = v[x]], Ct = d[C];
         if (E) var Ne = L ? E(Ct, Et, C, d, f, M) : E(Et, Ct, C, f, d, M);
         if (!(Ne === void 0 ? Et === Ct || R(Et, Ct, I, E, M) : Ne)) {
           W = !1;
@@ -806,7 +806,7 @@ var as = Object.prototype, tc = as.hasOwnProperty, Rr = Br(function(t, e) {
   return t;
 });
 function Pi(t) {
-  return Ot(t) && Mt(t);
+  return vt(t) && Mt(t);
 }
 var En = Br(function(t, e) {
   return Pi(t) ? function(n, r) {
@@ -849,7 +849,7 @@ function nc(t, e) {
     return n = !!e(r, i, o);
   }), n;
 }
-function vt(t, e, n) {
+function Ot(t, e, n) {
   return (B(t) ? ec : nc)(t, Pt(e));
 }
 function cs(t, e) {
@@ -904,7 +904,7 @@ function b(t, e) {
   return t != null && ss(t, e, cc);
 }
 function ut(t) {
-  return typeof t == "string" || !B(t) && Ot(t) && Jt(t) == "[object String]";
+  return typeof t == "string" || !B(t) && vt(t) && Jt(t) == "[object String]";
 }
 function Q(t) {
   return t == null ? [] : function(e, n) {
@@ -933,7 +933,7 @@ function K(t) {
   return !0;
 }
 var Fi = Zt && Zt.isRegExp, Kt = Fi ? kn(Fi) : function(t) {
-  return Ot(t) && Jt(t) == "[object RegExp]";
+  return vt(t) && Jt(t) == "[object RegExp]";
 };
 function Ht(t) {
   return t === void 0;
@@ -1006,7 +1006,7 @@ function us(t, e, n) {
 var pc = pe && 1 / Xr(new pe([, -0]))[1] == 1 / 0 ? function(t) {
   return new pe(t);
 } : Z;
-function vr(t) {
+function Or(t) {
   return t && t.length ? function(e) {
     var n = -1, r = Wo, i = e.length, o = !0, s = [], a = s;
     if (i >= 200) {
@@ -1024,7 +1024,7 @@ function vr(t) {
     return s;
   }(t) : [];
 }
-function Or(t) {
+function vr(t) {
   console && console.error && console.error(`Error: ${t}`);
 }
 function ls(t) {
@@ -1205,7 +1205,7 @@ class Ie {
   }
 }
 function gn(t, e = []) {
-  return t instanceof lt || t instanceof J || t instanceof Lt || (t instanceof xt ? us(t.definition, (n) => gn(n, e)) : !(t instanceof mt && at(e, t)) && t instanceof Ut && (t instanceof mt && e.push(t), vt(t.definition, (n) => gn(n, e))));
+  return t instanceof lt || t instanceof J || t instanceof Lt || (t instanceof xt ? us(t.definition, (n) => gn(n, e)) : !(t instanceof mt && at(e, t)) && t instanceof Ut && (t instanceof mt && e.push(t), Ot(t.definition, (n) => gn(n, e))));
 }
 function kt(t) {
   if (t instanceof mt) return "SUBRULE";
@@ -1285,12 +1285,12 @@ function be(t) {
     const r = e.definition;
     let i, o = 0, s = r.length > o, a = !0;
     for (; s && a; ) i = r[o], a = gn(i), n = n.concat(be(i)), o += 1, s = r.length > o;
-    return vr(n);
+    return Or(n);
   }(t);
   if (function(e) {
     return e instanceof xt;
   }(t)) return function(e) {
-    return vr(Rt(k(e.definition, (n) => be(n))));
+    return Or(Rt(k(e.definition, (n) => be(n))));
   }(t);
   throw Error("non exhaustive match");
 }
@@ -1319,7 +1319,7 @@ function Yn(t, e) {
     e.push(n);
   }) : e.push(t);
 }
-function ve(t, e) {
+function Oe(t, e) {
   if (t[e] === !0) throw "duplicate flag " + e;
   t[e], t[e] = !0;
 }
@@ -1444,19 +1444,19 @@ const Ac = new class {
     const n = { type: "Flags", loc: { begin: this.idx, end: t.length }, global: !1, ignoreCase: !1, multiLine: !1, unicode: !1, sticky: !1 };
     for (; this.isRegExpFlag(); ) switch (this.popChar()) {
       case "g":
-        ve(n, "global");
+        Oe(n, "global");
         break;
       case "i":
-        ve(n, "ignoreCase");
+        Oe(n, "ignoreCase");
         break;
       case "m":
-        ve(n, "multiLine");
+        Oe(n, "multiLine");
         break;
       case "u":
-        ve(n, "unicode");
+        Oe(n, "unicode");
         break;
       case "y":
-        ve(n, "sticky");
+        Oe(n, "sticky");
     }
     if (this.idx !== this.input.length) throw Error("Redundant input: " + this.input.substring(this.idx));
     return { type: "Pattern", flags: n, value: e, loc: this.loc(0) };
@@ -1923,7 +1923,7 @@ function Ic(t, e = !1) {
       let r = "";
       e && (r = `
 	This will disable the lexer's first char optimizations.
-	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.`), Or(`${Nn}
+	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.`), vr(`${Nn}
 	Failed parsing: < ${t.toString()} >
 	Using the @chevrotain/regexp-to-ast library
 	Please open an issue at: https://github.com/chevrotain/chevrotain/issues` + r);
@@ -2014,7 +2014,7 @@ function $i(t, e) {
 }
 function Lr(t) {
   const e = t.quantifier;
-  return !(!e || e.atLeast !== 0) || !!t.value && (B(t.value) ? vt(t.value, Lr) : Lr(t.value));
+  return !(!e || e.atLeast !== 0) || !!t.value && (B(t.value) ? Ot(t.value, Lr) : Lr(t.value));
 }
 class Nc extends Sr {
   constructor(e) {
@@ -2045,7 +2045,7 @@ function xr(t, e) {
   }
   return Te(e, (n) => at(t, n.charCodeAt(0))) !== void 0;
 }
-const ne = "PATTERN", Oe = "defaultMode", Xn = "modes";
+const ne = "PATTERN", ve = "defaultMode", Xn = "modes";
 let Wi = typeof new RegExp("(?:)").sticky == "boolean";
 const yc = /[^\\][$]/, Rc = /[^\\[][\^]|^\^/;
 function Gi(t) {
@@ -2063,10 +2063,10 @@ function ms(t) {
   if (ut(e)) return !1;
   throw Error("non exhaustive match");
 }
-function vc(t) {
+function Oc(t) {
   return !(!ut(t) || t.length !== 1) && t.charCodeAt(0);
 }
-const Oc = { test: function(t) {
+const vc = { test: function(t) {
   const e = t.length;
   for (let n = this.lastIndex; n < e; n++) {
     const r = t.charCodeAt(n);
@@ -2177,17 +2177,17 @@ a boolean 2nd argument is no longer supported`);
     r === !0 ? (this.traceInitMaxIdent = 1 / 0, this.traceInitPerf = !0) : typeof r == "number" && (this.traceInitMaxIdent = r, this.traceInitPerf = !0), this.traceInitIndent = -1, this.TRACE_INIT("Lexer Constructor", () => {
       let i, o = !0;
       this.TRACE_INIT("Lexer Config handling", () => {
-        if (this.config.lineTerminatorsPattern === xe.lineTerminatorsPattern) this.config.lineTerminatorsPattern = Oc;
+        if (this.config.lineTerminatorsPattern === xe.lineTerminatorsPattern) this.config.lineTerminatorsPattern = vc;
         else if (this.config.lineTerminatorCharacters === xe.lineTerminatorCharacters) throw Error(`Error: Missing <lineTerminatorCharacters> property on the Lexer config.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS`);
         if (n.safeMode && n.ensureOptimizations) throw Error('"safeMode" and "ensureOptimizations" flags are mutually exclusive.');
-        this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking), this.trackEndLines = /full/i.test(this.config.positionTracking), B(e) ? i = { modes: { defaultMode: et(e) }, defaultMode: Oe } : (o = !1, i = et(e));
+        this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking), this.trackEndLines = /full/i.test(this.config.positionTracking), B(e) ? i = { modes: { defaultMode: et(e) }, defaultMode: ve } : (o = !1, i = et(e));
       }), this.config.skipValidations === !1 && (this.TRACE_INIT("performRuntimeChecks", () => {
         this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(function(a) {
           const c = [];
-          return b(a, Oe) || c.push({ message: "A MultiMode Lexer cannot be initialized without a <" + Oe + `> property in its definition
+          return b(a, ve) || c.push({ message: "A MultiMode Lexer cannot be initialized without a <" + ve + `> property in its definition
 `, type: H.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE }), b(a, Xn) || c.push({ message: `A MultiMode Lexer cannot be initialized without a <modes> property in its definition
-`, type: H.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY }), b(a, Xn) && b(a, Oe) && !b(a.modes, a.defaultMode) && c.push({ message: `A MultiMode Lexer cannot be initialized with a ${Oe}: <${a.defaultMode}>which does not exist
+`, type: H.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY }), b(a, Xn) && b(a, ve) && !b(a.modes, a.defaultMode) && c.push({ message: `A MultiMode Lexer cannot be initialized with a ${ve}: <${a.defaultMode}>which does not exist
 `, type: H.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST }), b(a, Xn) && w(a.modes, (u, l) => {
             w(u, (h, N) => {
               Ht(h) ? c.push({ message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${l}> at index: <${N}>
@@ -2253,17 +2253,17 @@ a boolean 2nd argument is no longer supported`);
                     constructor() {
                       super(...arguments), this.found = !1;
                     }
-                    visitEndAnchor(v) {
+                    visitEndAnchor(O) {
                       this.found = !0;
                     }
                   }
                   return k(gt(T, (A) => {
-                    const v = A.PATTERN;
+                    const O = A.PATTERN;
                     try {
-                      const f = In(v), d = new g();
+                      const f = In(O), d = new g();
                       return d.visit(f), d.found;
                     } catch {
-                      return yc.test(v.source);
+                      return yc.test(O.source);
                     }
                   }), (A) => ({ message: `Unexpected RegExp Anchor Error:
 	Token Type: ->` + A.name + `<- static 'PATTERN' cannot contain end of input anchor '$'
@@ -2273,17 +2273,17 @@ a boolean 2nd argument is no longer supported`);
                     constructor() {
                       super(...arguments), this.found = !1;
                     }
-                    visitStartAnchor(v) {
+                    visitStartAnchor(O) {
                       this.found = !0;
                     }
                   }
                   return k(gt(T, (A) => {
-                    const v = A.PATTERN;
+                    const O = A.PATTERN;
                     try {
-                      const f = In(v), d = new g();
+                      const f = In(O), d = new g();
                       return d.visit(f), d.found;
                     } catch {
-                      return Rc.test(v.source);
+                      return Rc.test(O.source);
                     }
                   }), (A) => ({ message: `Unexpected RegExp Anchor Error:
 	Token Type: ->` + A.name + `<- static 'PATTERN' cannot contain start of input anchor '^'
@@ -2293,10 +2293,10 @@ a boolean 2nd argument is no longer supported`);
                   return g instanceof RegExp && (g.multiline || g.global);
                 }), (T) => ({ message: "Token Type: ->" + T.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')", type: H.UNSUPPORTED_FLAGS_FOUND, tokenTypes: [T] }))), y = y.concat(function(T) {
                   const g = [];
-                  let A = k(T, (v) => dt(T, (f, d) => (v.PATTERN.source !== d.PATTERN.source || at(g, d) || d.PATTERN === ot.NA || (g.push(d), f.push(d)), f), []));
-                  return A = $e(A), k(gt(A, (v) => v.length > 1), (v) => {
-                    const f = k(v, (d) => d.name);
-                    return { message: `The same RegExp pattern ->${St(v).PATTERN}<-has been used in all of the following Token Types: ${f.join(", ")} <-`, type: H.DUPLICATE_PATTERNS_FOUND, tokenTypes: v };
+                  let A = k(T, (O) => dt(T, (f, d) => (O.PATTERN.source !== d.PATTERN.source || at(g, d) || d.PATTERN === ot.NA || (g.push(d), f.push(d)), f), []));
+                  return A = $e(A), k(gt(A, (O) => O.length > 1), (O) => {
+                    const f = k(O, (d) => d.name);
+                    return { message: `The same RegExp pattern ->${St(O).PATTERN}<-has been used in all of the following Token Types: ${f.join(", ")} <-`, type: H.DUPLICATE_PATTERNS_FOUND, tokenTypes: O };
                   });
                 }(p)), y = y.concat(k(gt(p, (T) => T.PATTERN.test("")), (T) => ({ message: "Token Type: ->" + T.name + "<- static 'PATTERN' must not match an empty string", type: H.EMPTY_MATCH_PATTERN, tokenTypes: [T] }))), y;
               }(_)), h = h.concat(k(gt(_, (m) => {
@@ -2307,13 +2307,13 @@ a boolean 2nd argument is no longer supported`);
                 return k(gt(m, (p) => p.PUSH_MODE !== void 0 && !at(y, p.PUSH_MODE)), (p) => ({ message: `Token Type: ->${p.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${p.PUSH_MODE}<-which does not exist`, type: H.PUSH_MODE_DOES_NOT_EXIST, tokenTypes: [p] }));
               }(_, l)), h = h.concat(function(m) {
                 const y = [], p = dt(m, (T, g, A) => {
-                  const v = g.PATTERN;
-                  return v === ot.NA || (ut(v) ? T.push({ str: v, idx: A, tokenType: g }) : Kt(v) && (f = v, Te([".", "\\", "[", "]", "|", "^", "$", "(", ")", "?", "*", "+", "{"], (d) => f.source.indexOf(d) !== -1) === void 0) && T.push({ str: v.source, idx: A, tokenType: g })), T;
+                  const O = g.PATTERN;
+                  return O === ot.NA || (ut(O) ? T.push({ str: O, idx: A, tokenType: g }) : Kt(O) && (f = O, Te([".", "\\", "[", "]", "|", "^", "$", "(", ")", "?", "*", "+", "{"], (d) => f.source.indexOf(d) !== -1) === void 0) && T.push({ str: O.source, idx: A, tokenType: g })), T;
                   var f;
                 }, []);
                 return w(m, (T, g) => {
-                  w(p, ({ str: A, idx: v, tokenType: f }) => {
-                    if (g < v && function(d, I) {
+                  w(p, ({ str: A, idx: O, tokenType: f }) => {
+                    if (g < O && function(d, I) {
                       if (Kt(I)) {
                         const E = I.exec(d);
                         return E !== null && E.index === 0;
@@ -2337,7 +2337,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
             He(a), this.TRACE_INIT("analyzeTokenTypes", () => {
               u = function(l, h) {
                 const N = (h = Rr(h, { useSticky: Wi, debug: !1, safeMode: !1, positionTracking: "full", lineTerminatorCharacters: ["\r", `
-`], tracer: (L, O) => O() })).tracer;
+`], tracer: (L, v) => v() })).tracer;
                 let S;
                 N("initCharCodeToOptimizedIndexMap", () => {
                   (function() {
@@ -2349,20 +2349,20 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                 }), N("Reject Lexer.NA", () => {
                   S = an(l, (L) => L[ne] === ot.NA);
                 });
-                let _, m, y, p, T, g, A, v, f, d, I, E = !1;
+                let _, m, y, p, T, g, A, O, f, d, I, E = !1;
                 N("Transform Patterns", () => {
                   E = !1, _ = k(S, (L) => {
-                    const O = L[ne];
-                    if (Kt(O)) {
-                      const P = O.source;
-                      return P.length !== 1 || P === "^" || P === "$" || P === "." || O.ignoreCase ? P.length !== 2 || P[0] !== "\\" || at(["d", "D", "s", "S", "t", "r", "n", "t", "0", "c", "b", "B", "f", "v", "w", "W"], P[1]) ? h.useSticky ? Ki(O) : Gi(O) : P[1] : P;
+                    const v = L[ne];
+                    if (Kt(v)) {
+                      const P = v.source;
+                      return P.length !== 1 || P === "^" || P === "$" || P === "." || v.ignoreCase ? P.length !== 2 || P[0] !== "\\" || at(["d", "D", "s", "S", "t", "r", "n", "t", "0", "c", "b", "B", "f", "v", "w", "W"], P[1]) ? h.useSticky ? Ki(v) : Gi(v) : P[1] : P;
                     }
-                    if (Yt(O)) return E = !0, { exec: O };
-                    if (typeof O == "object") return E = !0, O;
-                    if (typeof O == "string") {
-                      if (O.length === 1) return O;
+                    if (Yt(v)) return E = !0, { exec: v };
+                    if (typeof v == "object") return E = !0, v;
+                    if (typeof v == "string") {
+                      if (v.length === 1) return v;
                       {
-                        const P = O.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&"), x = new RegExp(P);
+                        const P = v.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&"), x = new RegExp(P);
                         return h.useSticky ? Ki(x) : Gi(x);
                       }
                     }
@@ -2370,48 +2370,48 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                   });
                 }), N("misc mapping", () => {
                   m = k(S, (L) => L.tokenTypeIdx), y = k(S, (L) => {
-                    const O = L.GROUP;
-                    if (O !== ot.SKIPPED) {
-                      if (ut(O)) return O;
-                      if (Ht(O)) return !1;
+                    const v = L.GROUP;
+                    if (v !== ot.SKIPPED) {
+                      if (ut(v)) return v;
+                      if (Ht(v)) return !1;
                       throw Error("non exhaustive match");
                     }
                   }), p = k(S, (L) => {
-                    const O = L.LONGER_ALT;
-                    if (O) return B(O) ? k(O, (P) => Ui(S, P)) : [Ui(S, O)];
+                    const v = L.LONGER_ALT;
+                    if (v) return B(v) ? k(v, (P) => Ui(S, P)) : [Ui(S, v)];
                   }), T = k(S, (L) => L.PUSH_MODE), g = k(S, (L) => b(L, "POP_MODE"));
                 }), N("Line Terminator Handling", () => {
                   const L = Vi(h.lineTerminatorCharacters);
-                  A = k(S, (O) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (O) => b(O, "LINE_BREAKS") ? !!O.LINE_BREAKS : zi(O, L) === !1 && xr(L, O.PATTERN)));
+                  A = k(S, (v) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (v) => b(v, "LINE_BREAKS") ? !!v.LINE_BREAKS : zi(v, L) === !1 && xr(L, v.PATTERN)));
                 }), N("Misc Mapping #2", () => {
-                  v = k(S, ms), f = k(_, vc), d = dt(S, (L, O) => {
-                    const P = O.GROUP;
+                  O = k(S, ms), f = k(_, Oc), d = dt(S, (L, v) => {
+                    const P = v.GROUP;
                     return ut(P) && P !== ot.SKIPPED && (L[P] = []), L;
-                  }, {}), I = k(_, (L, O) => ({ pattern: _[O], longerAlt: p[O], canLineTerminator: A[O], isCustom: v[O], short: f[O], group: y[O], push: T[O], pop: g[O], tokenTypeIdx: m[O], tokenType: S[O] }));
+                  }, {}), I = k(_, (L, v) => ({ pattern: _[v], longerAlt: p[v], canLineTerminator: A[v], isCustom: O[v], short: f[v], group: y[v], push: T[v], pop: g[v], tokenTypeIdx: m[v], tokenType: S[v] }));
                 });
                 let R = !0, M = [];
                 return h.safeMode || N("First Char Optimization", () => {
-                  M = dt(S, (L, O, P) => {
-                    if (typeof O.PATTERN == "string") {
-                      const x = qt(O.PATTERN.charCodeAt(0));
+                  M = dt(S, (L, v, P) => {
+                    if (typeof v.PATTERN == "string") {
+                      const x = qt(v.PATTERN.charCodeAt(0));
                       qn(L, x, I[P]);
-                    } else if (B(O.START_CHARS_HINT)) {
+                    } else if (B(v.START_CHARS_HINT)) {
                       let x;
-                      w(O.START_CHARS_HINT, (C) => {
+                      w(v.START_CHARS_HINT, (C) => {
                         const $ = qt(typeof C == "string" ? C.charCodeAt(0) : C);
                         x !== $ && (x = $, qn(L, $, I[P]));
                       });
-                    } else if (Kt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Or(`${Nn}	Unable to analyze < ${O.PATTERN.toString()} > pattern.
+                    } else if (Kt(v.PATTERN)) if (v.PATTERN.unicode) R = !1, h.ensureOptimizations && vr(`${Nn}	Unable to analyze < ${v.PATTERN.toString()} > pattern.
 	The regexp unicode flag is not currently supported by the regexp-to-ast library.
 	This will disable the lexer's first char optimizations.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
                     else {
-                      const x = Ic(O.PATTERN, h.ensureOptimizations);
+                      const x = Ic(v.PATTERN, h.ensureOptimizations);
                       K(x) && (R = !1), w(x, (C) => {
                         qn(L, C, I[P]);
                       });
                     }
-                    else h.ensureOptimizations && Or(`${Nn}	TokenType: <${O.name}> is using a custom token pattern without providing <start_chars_hint> parameter.
+                    else h.ensureOptimizations && vr(`${Nn}	TokenType: <${v.name}> is using a custom token pattern without providing <start_chars_hint> parameter.
 	This will disable the lexer's first char optimizations.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), R = !1;
                     return L;
@@ -2461,7 +2461,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
   tokenizeInternal(e, n) {
     let r, i, o, s, a, c, u, l, h, N, S, _, m, y, p;
     const T = e, g = T.length;
-    let A = 0, v = 0;
+    let A = 0, O = 0;
     const f = this.hasCustom ? 0 : Math.floor(e.length / 10), d = new Array(f), I = [];
     let E = this.trackStartLines ? 1 : void 0, R = this.trackStartLines ? 1 : void 0;
     const M = function(q) {
@@ -2471,7 +2471,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
         if (!B(ct)) throw Error("non exhaustive match");
         it[jt] = [];
       }), it;
-    }(this.emptyGroups), L = this.trackStartLines, O = this.config.lineTerminatorsPattern;
+    }(this.emptyGroups), L = this.trackStartLines, v = this.config.lineTerminatorsPattern;
     let P = 0, x = [], C = [];
     const $ = [], X = [];
     let W;
@@ -2526,11 +2526,11 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
         }
       }
       if (c !== null) {
-        if (h = c.length, N = nt.group, N !== void 0 && (S = nt.tokenTypeIdx, _ = this.createTokenInstance(c, A, S, nt.tokenType, E, R, h), this.handlePayload(_, u), N === !1 ? v = this.addToken(d, v, _) : M[N].push(_)), e = this.chopInput(e, h), A += h, R = this.computeNewColumn(R, h), L === !0 && nt.canLineTerminator === !0) {
+        if (h = c.length, N = nt.group, N !== void 0 && (S = nt.tokenTypeIdx, _ = this.createTokenInstance(c, A, S, nt.tokenType, E, R, h), this.handlePayload(_, u), N === !1 ? O = this.addToken(d, O, _) : M[N].push(_)), e = this.chopInput(e, h), A += h, R = this.computeNewColumn(R, h), L === !0 && nt.canLineTerminator === !0) {
           let ct, Bt, $t = 0;
-          O.lastIndex = 0;
+          v.lastIndex = 0;
           do
-            ct = O.test(c), ct === !0 && (Bt = O.lastIndex - 1, $t++);
+            ct = v.test(c), ct === !0 && (Bt = v.lastIndex - 1, $t++);
           while (ct === !0);
           $t !== 0 && (E += $t, R = h - Bt, this.updateTokenEndLineColumnLocation(_, N, Bt, $t, E, R, h));
         }
@@ -2545,7 +2545,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
         if (m = A - ct, R = this.computeNewColumn(R, m), y = this.config.errorMessageProvider.buildUnexpectedCharactersMessage(T, ct, m, Bt, $t), I.push({ offset: ct, line: Bt, column: $t, length: m, message: y }), te === !1) break;
       }
     }
-    return this.hasCustom || (d.length = v), { tokens: d, groups: M, errors: I };
+    return this.hasCustom || (d.length = O), { tokens: d, groups: M, errors: I };
   }
   handleModes(e, n, r, i) {
     if (e.pop === !0) {
@@ -2848,8 +2848,8 @@ function Is(t, e, n, r) {
     } else if (p instanceof Lt) {
       const T = { idx: _, def: tt(S), ruleStack: m, occurrenceStack: y };
       h.push(T), h.push(s);
-      const g = new V({ terminalType: p.separator }), A = new J({ definition: [g].concat(p.definition), idx: p.idx }), v = { idx: _, def: p.definition.concat([A], tt(S)), ruleStack: m, occurrenceStack: y };
-      h.push(v);
+      const g = new V({ terminalType: p.separator }), A = new J({ definition: [g].concat(p.definition), idx: p.idx }), O = { idx: _, def: p.definition.concat([A], tt(S)), ruleStack: m, occurrenceStack: y };
+      h.push(O);
     } else if (p instanceof J) {
       const T = { idx: _, def: tt(S), ruleStack: m, occurrenceStack: y };
       h.push(T), h.push(s);
@@ -2884,7 +2884,7 @@ function so(t) {
   throw Error("non exhaustive match");
 }
 function wc(t, e, n, r) {
-  const i = t.length, o = vt(t, (s) => vt(s, (a) => a.length === 1));
+  const i = t.length, o = Ot(t, (s) => Ot(s, (a) => a.length === 1));
   if (e) return function(s) {
     const a = k(s, (c) => c.GATE);
     for (let c = 0; c < i; c++) {
@@ -2925,7 +2925,7 @@ function wc(t, e, n, r) {
   };
 }
 function Mc(t, e, n) {
-  const r = vt(t, (o) => o.length === 1), i = t.length;
+  const r = Ot(t, (o) => o.length === 1), i = t.length;
   if (r && !n) {
     const o = Rt(t);
     if (o.length === 1 && K(o[0].categoryMatches)) {
@@ -3103,7 +3103,7 @@ function Pr(t, e) {
   return !1;
 }
 function co(t) {
-  return vt(t, (e) => vt(e, (n) => vt(n, (r) => K(r.categoryMatches))));
+  return Ot(t, (e) => Ot(e, (n) => Ot(n, (r) => K(r.categoryMatches))));
 }
 function Dc(t) {
   return `${kt(t)}_#_${t.idx}_#_${Rs(t)}`;
@@ -3140,7 +3140,7 @@ class jc extends Ie {
     this.allProductions.push(e);
   }
 }
-function vs(t, e, n, r = []) {
+function Os(t, e, n, r = []) {
   const i = [], o = hn(e.definition);
   if (K(o)) return [];
   {
@@ -3148,7 +3148,7 @@ function vs(t, e, n, r = []) {
     at(o, t) && i.push({ message: n.buildLeftRecursionError({ topLevelRule: t, leftRecursionPath: r }), type: st.LEFT_RECURSION, ruleName: s });
     const a = Tt(En(o, r.concat([t])), (c) => {
       const u = et(r);
-      return u.push(c), vs(t, c, n, u);
+      return u.push(c), Os(t, c, n, u);
     });
     return i.concat(a);
   }
@@ -3193,7 +3193,7 @@ class Bc extends Ie {
     this.allProductions.push(e);
   }
 }
-const Os = "MismatchedTokenException", Ss = "NoViableAltException", _s = "EarlyExitException", Ls = "NotAllInputParsedException", xs = [Os, Ss, _s, Ls];
+const vs = "MismatchedTokenException", Ss = "NoViableAltException", _s = "EarlyExitException", Ls = "NotAllInputParsedException", xs = [vs, Ss, _s, Ls];
 function en(t) {
   return at(xs, t.name);
 }
@@ -3205,7 +3205,7 @@ class Mn extends Error {
 }
 class uo extends Mn {
   constructor(e, n, r) {
-    super(e, n), this.previousToken = r, this.name = Os;
+    super(e, n), this.previousToken = r, this.name = vs;
   }
 }
 class $c extends Mn {
@@ -3258,7 +3258,7 @@ class Vc {
     return n;
   }
   validateNoLeftRecursion(e) {
-    return Tt(e, (n) => vs(n, n, oe));
+    return Tt(e, (n) => Os(n, n, oe));
   }
   validateEmptyOrAlternatives(e) {
     return Tt(e, (n) => function(r, i) {
@@ -3274,31 +3274,31 @@ class Vc {
       return c = an(c, (u) => u.ignoreAmbiguities === !0), Tt(c, (u) => {
         const l = u.idx, h = u.maxLookahead || o, N = kr(l, i, h, u), S = function(m, y, p, T) {
           const g = [];
-          return k(dt(m, (A, v, f) => (y.definition[f].ignoreAmbiguities === !0 || w(v, (d) => {
+          return k(dt(m, (A, O, f) => (y.definition[f].ignoreAmbiguities === !0 || w(O, (d) => {
             const I = [f];
             w(m, (E, R) => {
               f !== R && Pr(E, d) && y.definition[R].ignoreAmbiguities !== !0 && I.push(R);
             }), I.length > 1 && !Pr(g, d) && (g.push(d), A.push({ alts: I, path: d }));
           }), A), []), (A) => {
-            const v = k(A.alts, (f) => f + 1);
-            return { message: T.buildAlternationAmbiguityError({ topLevelRule: p, alternation: y, ambiguityIndices: v, prefixPath: A.path }), type: st.AMBIGUOUS_ALTS, ruleName: p.name, occurrence: y.idx, alternatives: A.alts };
+            const O = k(A.alts, (f) => f + 1);
+            return { message: T.buildAlternationAmbiguityError({ topLevelRule: p, alternation: y, ambiguityIndices: O, prefixPath: A.path }), type: st.AMBIGUOUS_ALTS, ruleName: p.name, occurrence: y.idx, alternatives: A.alts };
           });
         }(N, u, i, s), _ = function(m, y, p, T) {
-          const g = dt(m, (A, v, f) => {
-            const d = k(v, (I) => ({ idx: f, path: I }));
+          const g = dt(m, (A, O, f) => {
+            const d = k(O, (I) => ({ idx: f, path: I }));
             return A.concat(d);
           }, []);
           return $e(Tt(g, (A) => {
             if (y.definition[A.idx].ignoreAmbiguities === !0) return [];
-            const v = A.idx, f = A.path;
+            const O = A.idx, f = A.path;
             return k(gt(g, (d) => {
-              return y.definition[d.idx].ignoreAmbiguities !== !0 && d.idx < v && (I = d.path, E = f, I.length < E.length && vt(I, (R, M) => {
+              return y.definition[d.idx].ignoreAmbiguities !== !0 && d.idx < O && (I = d.path, E = f, I.length < E.length && Ot(I, (R, M) => {
                 const L = E[M];
                 return R === L || L.categoryMatchesMap[R.tokenTypeIdx];
               }));
               var I, E;
             }), (d) => {
-              const I = [d.idx + 1, v + 1], E = y.idx === 0 ? "" : y.idx;
+              const I = [d.idx + 1, O + 1], E = y.idx === 0 ? "" : y.idx;
               return { message: T.buildAlternationPrefixAmbiguityError({ topLevelRule: p, alternation: y, ambiguityIndices: I, prefixPath: d.path }), type: st.AMBIGUOUS_PREFIX_ALTS, ruleName: p.name, occurrence: E, alternatives: I };
             });
           }));
@@ -3468,16 +3468,16 @@ class Ge {
               const g = new jc();
               p.accept(g);
               const A = g.allProductions;
-              return k(Q(_t(sc(A, Dc), (v) => v.length > 1)), (v) => {
-                const f = St(v), d = T.buildDuplicateFoundError(p, v), I = kt(f), E = { message: d, type: st.DUPLICATE_PRODUCTIONS, ruleName: p.name, dslName: I, occurrence: f.idx }, R = Rs(f);
+              return k(Q(_t(sc(A, Dc), (O) => O.length > 1)), (O) => {
+                const f = St(O), d = T.buildDuplicateFoundError(p, O), I = kt(f), E = { message: d, type: st.DUPLICATE_PRODUCTIONS, ruleName: p.name, dslName: I, occurrence: f.idx }, R = Rs(f);
                 return R && (E.parameter = R), E;
               });
             }(y, l)), S = function(y, p, T) {
-              const g = [], A = k(p, (v) => v.name);
-              return w(y, (v) => {
-                const f = v.name;
+              const g = [], A = k(p, (O) => O.name);
+              return w(y, (O) => {
+                const f = O.name;
                 if (at(A, f)) {
-                  const d = T.buildNamespaceConflictError(v);
+                  const d = T.buildNamespaceConflictError(O);
                   g.push({ message: d, type: st.CONFLICT_TOKENS_RULES_NAMESPACE, ruleName: f });
                 }
               }), g;
@@ -3485,12 +3485,12 @@ class Ge {
               const g = new wr();
               return p.accept(g), Tt(g.alternations, (A) => A.definition.length > 255 ? [{ message: T.buildTooManyAlternativesError({ topLevelRule: p, alternation: A }), type: st.TOO_MANY_ALTS, ruleName: p.name, occurrence: A.idx }] : []);
             }(y, l)), m = Tt(c, (y) => function(p, T, g, A) {
-              const v = [];
+              const O = [];
               if (dt(T, (f, d) => d.name === p.name ? f + 1 : f, 0) > 1) {
                 const f = A.buildDuplicateRuleNameError({ topLevelRule: p, grammarName: g });
-                v.push({ message: f, type: st.DUPLICATE_RULE_NAME, ruleName: p.name });
+                O.push({ message: f, type: st.DUPLICATE_RULE_NAME, ruleName: p.name });
               }
-              return v;
+              return O;
             }(y, c, h, l));
             return N.concat(S, _, m);
           }((o = Rr(o, { errMsgProvider: oe })).rules, o.tokenTypes, o.errMsgProvider, o.grammarName)), a = k((i = { lookaheadStrategy: this.lookaheadStrategy, rules: Q(this.gastProductionsCache), tokenTypes: Q(this.tokensMap), grammarName: n }).lookaheadStrategy.validate({ rules: i.rules, tokenTypes: i.tokenTypes, grammarName: i.grammarName }), (c) => Object.assign({ type: st.CUSTOM_LOOKAHEAD_VALIDATION }, c));
@@ -3824,15 +3824,15 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
 	For Further details.`);
     }
     if (B(t)) this.tokensMap = dt(t, (r, i) => (r[i.name] = i, r), {});
-    else if (b(t, "modes") && vt(Rt(Q(t.modes)), Sc)) {
-      const r = vr(Rt(Q(t.modes)));
+    else if (b(t, "modes") && Ot(Rt(Q(t.modes)), Sc)) {
+      const r = Or(Rt(Q(t.modes)));
       this.tokensMap = dt(r, (i, o) => (i[o.name] = o, i), {});
     } else {
       if (!Nt(t)) throw new Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
       this.tokensMap = et(t);
     }
     this.tokensMap.EOF = ie;
-    const n = vt(b(t, "modes") ? Rt(Q(t.modes)) : Q(t), (r) => K(r.categoryMatches));
+    const n = Ot(b(t, "modes") ? Rt(Q(t.modes)) : Q(t), (r) => K(r.categoryMatches));
     this.tokenMatcher = n ? yn : Pe, He(Q(this.tokensMap));
   }
   defineRule(t, e, n) {
@@ -4553,7 +4553,7 @@ const Zc = F({ name: "WhiteSpace", pattern: /\s+/, group: ot.SKIPPED }), Ps = F(
   return t;
 })() }), iu = F({ name: "Cell", pattern: /[$]?[A-Za-z]{1,3}[$]?[1-9][0-9]*/, longer_alt: Fn }), ou = F({ name: "Column", pattern: /[$]?[A-Za-z]{1,3}/, longer_alt: Fn }), su = F({ name: "AbsRow", pattern: /[$][0-9]+/, longer_alt: Fn }), au = F({ name: "NumberToken", pattern: /[0-9]+[.]?[0-9]*([eE][+-][0-9]+)?/ }), cu = F({ name: "Boolean", pattern: /TRUE|FALSE/i }), uu = F({ name: "Comma", pattern: /,/ }), lu = F({ name: "RangeUnion", pattern: /:/ }), hu = F({ name: "RangeTrimFull", pattern: /\.:\./ }), fu = F({ name: "RangeTrimLeading", pattern: /\.:/ }), du = F({ name: "RangeTrimTrailing", pattern: /:\./ }), pu = F({ name: "Semicolon", pattern: /;/ }), mu = F({ name: "OpenParen", pattern: /\(/ }), Eu = F({ name: "CloseParen", pattern: /\)/ }), gu = F({ name: "OpenSquareParen", pattern: /\[/ }), Tu = F({ name: "CloseSquareParen", pattern: /]/ });
 F({ name: "exclamationMark", pattern: /!/ });
-const Au = F({ name: "OpenCurlyParen", pattern: /{/ }), Iu = F({ name: "CloseCurlyParen", pattern: /}/ }), Nu = F({ name: "QuoteS", pattern: /'/ }), go = F({ name: "MulOp", pattern: /\*/ }), yu = F({ name: "PlusOp", pattern: /\+/ }), Ru = F({ name: "DivOp", pattern: /\// }), vu = F({ name: "MinOp", pattern: /-/ }), Ou = F({ name: "ImplicitIntersectOp", pattern: /@/ }), Su = F({ name: "ConcatOp", pattern: /&/ }), _u = F({ name: "ExOp", pattern: /\^/ }), Lu = F({ name: "PercentOp", pattern: /%/ }), Fs = F({ name: "TableSpecifier", pattern: /#(All|Data|Headers|Totals|This Row)/i }), xu = F({ name: "ArrayAnchorOp", pattern: /#/, longer_alt: [Fs, Ms, Us] }), Cu = F({ name: "GtOp", pattern: />/ }), ku = F({ name: "EqOp", pattern: /=/ }), bu = F({ name: "LtOp", pattern: /</ }), Ds = [Zc, Ps, Jc, Qc, tu, ws, eu, Ms, Us, nu, iu, cu, ou, su, Fs, xu, Ou, Fn, au, uu, hu, fu, du, lu, pu, mu, Eu, gu, Tu, Au, Iu, Nu, go, yu, Ru, vu, Su, _u, go, Lu, F({ name: "NeqOp", pattern: /<>/ }), F({ name: "GteOp", pattern: />=/ }), F({ name: "LteOp", pattern: /<=/ }), Cu, ku, bu], Pu = new ot(Ds, { ensureOptimizations: !0 }), Zr = {};
+const Au = F({ name: "OpenCurlyParen", pattern: /{/ }), Iu = F({ name: "CloseCurlyParen", pattern: /}/ }), Nu = F({ name: "QuoteS", pattern: /'/ }), go = F({ name: "MulOp", pattern: /\*/ }), yu = F({ name: "PlusOp", pattern: /\+/ }), Ru = F({ name: "DivOp", pattern: /\// }), Ou = F({ name: "MinOp", pattern: /-/ }), vu = F({ name: "ImplicitIntersectOp", pattern: /@/ }), Su = F({ name: "ConcatOp", pattern: /&/ }), _u = F({ name: "ExOp", pattern: /\^/ }), Lu = F({ name: "PercentOp", pattern: /%/ }), Fs = F({ name: "TableSpecifier", pattern: /#(All|Data|Headers|Totals|This Row)/i }), xu = F({ name: "ArrayAnchorOp", pattern: /#/, longer_alt: [Fs, Ms, Us] }), Cu = F({ name: "GtOp", pattern: />/ }), ku = F({ name: "EqOp", pattern: /=/ }), bu = F({ name: "LtOp", pattern: /</ }), Ds = [Zc, Ps, Jc, Qc, tu, ws, eu, Ms, Us, nu, iu, cu, ou, su, Fs, xu, vu, Fn, au, uu, hu, fu, du, lu, pu, mu, Eu, gu, Tu, Au, Iu, Nu, go, yu, Ru, Ou, Su, _u, go, Lu, F({ name: "NeqOp", pattern: /<>/ }), F({ name: "GteOp", pattern: />=/ }), F({ name: "LteOp", pattern: /<=/ }), Cu, ku, bu], Pu = new ot(Ds, { ensureOptimizations: !0 }), Zr = {};
 Ds.forEach((t) => {
   Zr[t.name] = t;
 });
@@ -4686,10 +4686,10 @@ function cr(t) {
 function Ro(t) {
   return { type: "boolean", value: t === "TRUE" || t.toUpperCase() === "TRUE", isLiteral: !0 };
 }
-function vo(t) {
+function Oo(t) {
   return { type: "error", value: D.getBuiltInByLabel(t.toUpperCase()), isLiteral: !0 };
 }
-function vn(t) {
+function On(t) {
   return { type: "error", value: t ? D.getBuiltInByLabel(t.toUpperCase()) : D.BuiltIn.Ref, inputs: null, isReference: !0 };
 }
 function Ke(t, e) {
@@ -4716,44 +4716,44 @@ function dn(t, e) {
   let a;
   const c = /* @__PURE__ */ new Map(), u = [], l = [];
   r = Ke(r, (g, A) => {
-    const v = g.type, f = g.evalIndex;
+    const O = g.type, f = g.evalIndex;
     if (i[f] = null, g.isReference) {
       const d = g, I = { node: g, index: c.size, op: null, value: null, inputs: null };
-      if (c.set(d, I), v === "cell") {
+      if (c.set(d, I), O === "cell") {
         const E = d.value;
         return E.$colIndex && (I.hasHorizontalAbs = !0), E.$rowIndex && (I.hasVerticalAbs = !0), I.value = s.size, s.set(d, s.size), o.add(I), g.refIndex = l.length, void l.push(I.index);
       }
-      if (v === "infix" || v === "prefix" || v === "postfix" || v === "spill") {
+      if (O === "infix" || O === "prefix" || O === "postfix" || O === "spill") {
         const E = d.inputs, R = E.length, M = g.value;
         I.op = M;
         const L = new Array(R);
         I.inputs = L;
-        for (let O = 0; O < R; O++) {
-          const P = E[O], x = c.get(P);
-          x && (x.hasHorizontalAbs && (I.hasHorizontalAbs = !0), x.hasVerticalAbs && (I.hasVerticalAbs = !0)), L[O] = x ? x.index : -1, o.delete(x);
+        for (let v = 0; v < R; v++) {
+          const P = E[v], x = c.get(P);
+          x && (x.hasHorizontalAbs && (I.hasHorizontalAbs = !0), x.hasVerticalAbs && (I.hasVerticalAbs = !0)), L[v] = x ? x.index : -1, o.delete(x);
         }
         if (o.add(I), Ws.includes(M)) {
-          const O = E[0], P = !!O && O.type === "cell", x = E[1], C = !!x && x.type === "cell";
-          P && C && (l.splice(x.refIndex, 1), x.refIndex = O.refIndex, g.refIndex = O.refIndex, l[O.refIndex] = I.index);
+          const v = E[0], P = !!v && v.type === "cell", x = E[1], C = !!x && x.type === "cell";
+          P && C && (l.splice(x.refIndex, 1), x.refIndex = v.refIndex, g.refIndex = v.refIndex, l[v.refIndex] = I.index);
         } else M === "#" && (g.refIndex = E[0].refIndex);
         return void u.push(g);
       }
-      if (v === "error" || v === "named") {
+      if (O === "error" || O === "named") {
         a || (a = /* @__PURE__ */ new Map());
         const E = d.value;
         let R = a.get(E);
-        return I.op = v, R === void 0 && (R = a.size, a.set(E, R)), I.value = R, o.add(I), g.refIndex = l.length, void l.push(I.index);
+        return I.op = O, R === void 0 && (R = a.size, a.set(E, R)), I.value = R, o.add(I), g.refIndex = l.length, void l.push(I.index);
       }
-      v === "tableReference" && (I.op = v), v === "tableSpecifier" && (I.op = v), v === "structuredArg" && (I.op = v);
+      O === "tableReference" && (I.op = O), O === "tableSpecifier" && (I.op = O), O === "structuredArg" && (I.op = O);
     } else if (A && A.isReference) {
       const d = g, I = { node: g, index: c.size, op: "function", value: g.value, inputs: null };
       c.set(d, I);
     }
-    if (g.isLiteral) if (v !== "array") i[f] = g.value;
+    if (g.isLiteral) if (O !== "array") i[f] = g.value;
     else {
       const d = g.value, I = d.length, E = new Array(I);
       for (let R = 0; R < I; R++) {
-        const M = d[R].value, L = M.length, O = new Array(L);
+        const M = d[R].value, L = M.length, v = new Array(L);
         for (let P = 0; P < L; P++) {
           const x = M[P];
           let C = x.value;
@@ -4761,21 +4761,21 @@ function dn(t, e) {
             const $ = x.value;
             C = x.inputs[0].value, $ === "-" && (C = -C);
           }
-          O[P] = C;
+          v[P] = C;
         }
-        E[R] = O;
+        E[R] = v;
       }
       i[f] = Hs(E);
     }
     else {
-      if (v !== "empty") return u.push(g), g;
+      if (O !== "empty") return u.push(g), g;
       i[f] = void 0;
     }
   });
   const h = new Array(s.size);
   s.forEach((g, A) => {
-    const v = A.value, f = v.colIndex, d = v.rowIndex, I = v.$colIndex, E = v.$rowIndex, R = { colStart: f, rowStart: d, colEnd: f, rowEnd: d, $colStart: I, $rowStart: E, $colEnd: I, $rowEnd: E };
-    f === Number.MIN_SAFE_INTEGER && (R.colEnd = Number.MAX_SAFE_INTEGER), d === Number.MIN_SAFE_INTEGER && (R.rowEnd = Number.MAX_SAFE_INTEGER), v.sheetName && (R.sheetName = v.sheetName), h[g] = R;
+    const O = A.value, f = O.colIndex, d = O.rowIndex, I = O.$colIndex, E = O.$rowIndex, R = { colStart: f, rowStart: d, colEnd: f, rowEnd: d, $colStart: I, $rowStart: E, $colEnd: I, $rowEnd: E };
+    f === Number.MIN_SAFE_INTEGER && (R.colEnd = Number.MAX_SAFE_INTEGER), d === Number.MIN_SAFE_INTEGER && (R.rowEnd = Number.MAX_SAFE_INTEGER), O.sheetName && (R.sheetName = O.sheetName), h[g] = R;
   });
   const N = h.length, S = new Array(N);
   for (let g = 0; g < N; g++) S[g] = { colStart: 0, rowStart: 0, colEnd: 0, rowEnd: 0, sheetName: null };
@@ -4792,20 +4792,20 @@ function dn(t, e) {
   });
   const p = u.length;
   for (let g = 0; g < p; g++) {
-    const A = u[g], v = A.type;
-    if (v === "infix") {
+    const A = u[g], O = A.type;
+    if (O === "infix") {
       const f = A.value;
       A.fn = Vu[f];
-    } else if (v === "prefix") {
+    } else if (O === "prefix") {
       const f = A.value;
       A.fn = Hu[f];
-    } else if (v === "postfix") {
+    } else if (O === "postfix") {
       const f = A.value;
       A.fn = Yu[f];
     }
   }
   const T = function(g) {
-    const A = [], v = (I, E) => {
+    const A = [], O = (I, E) => {
       const R = { type: I.type, value: I.value };
       I.evalIndex !== void 0 && (R.evalIndex = I.evalIndex), I.refIndex !== void 0 && (R.refIndex = I.refIndex), E && (R.ctx = E), A.push(R);
     }, f = (I, E, R, M) => {
@@ -4814,13 +4814,13 @@ function dn(t, e) {
       R && (L.ctx = R), M !== void 0 && (L.evalIndex = M), A.push(L);
     };
     (function I(E, R, M) {
-      const L = E.evalIndex ?? M ?? 0, O = E.type, P = (x, C, $) => {
+      const L = E.evalIndex ?? M ?? 0, v = E.type, P = (x, C, $) => {
         if (!x) return;
         const X = x.length;
         for (let W = 0; W < X; W++) I(x[W], C, $), W < X - 1 && f("comma", ",", C);
       };
       if (E.isLiteral) {
-        if (f("whitespace", E.wsBefore, R), O === "array") {
+        if (f("whitespace", E.wsBefore, R), v === "array") {
           f("type", "{", R);
           const x = E.value, C = x.length;
           for (let $ = 0; $ < C; $++) {
@@ -4832,17 +4832,17 @@ function dn(t, e) {
             $ < C - 1 && (f("whitespace", X.wsBefore, R), f("comma", ";", R), f("whitespace", X.wsAfter, R));
           }
           E.error || f("type", "}", R);
-        } else O === "quotedString" && (E = { type: O, value: '"' + E.value + '"' }), v(E, R);
+        } else v === "quotedString" && (E = { type: v, value: '"' + E.value + '"' }), O(E, R);
         f("whitespace", E.wsAfter, R);
-      } else if (O === "infix") I(E.inputs[0], R, L), f("whitespace", E.wsBefore, R), v(E, R), f("whitespace", E.wsAfter, R), I(E.inputs[1], R, L);
-      else if (O === "prefix") f("whitespace", E.wsBefore, R), v(E, R), f("whitespace", E.wsAfter, R), I(E.inputs[0], R, L);
-      else if (O === "postfix") I(E.inputs[0], R, L), f("whitespace", E.wsBefore, R), v(E, R), f("whitespace", E.wsAfter, R);
+      } else if (v === "infix") I(E.inputs[0], R, L), f("whitespace", E.wsBefore, R), O(E, R), f("whitespace", E.wsAfter, R), I(E.inputs[1], R, L);
+      else if (v === "prefix") f("whitespace", E.wsBefore, R), O(E, R), f("whitespace", E.wsAfter, R), I(E.inputs[0], R, L);
+      else if (v === "postfix") I(E.inputs[0], R, L), f("whitespace", E.wsBefore, R), O(E, R), f("whitespace", E.wsAfter, R);
       else {
         f("whitespace", E.wsBefore, R);
         const x = E.inputs;
-        switch (O) {
+        switch (v) {
           case "function":
-            v(E, R);
+            O(E, R);
             const C = { name: String(E.value), argIndex: -1 };
             if (f("paren", "(", C, E.evalIndex), x) {
               const X = x.length;
@@ -4854,16 +4854,16 @@ function dn(t, e) {
             E.error || f("paren", ")", C, E.evalIndex);
             break;
           case "cell":
-            v(E, R);
+            O(E, R);
             break;
           case "paren":
-            f(O, "(", R, L), P(x, R, L), E.error || f(O, ")", R, L);
+            f(v, "(", R, L), P(x, R, L), E.error || f(v, ")", R, L);
             break;
           case "squareParen":
-            f(O, "[", R, L), P(x, R, L), E.error || f(O, "]", R, L);
+            f(v, "[", R, L), P(x, R, L), E.error || f(v, "]", R, L);
             break;
           case "tableReference":
-            v(E, R);
+            O(E, R);
             const $ = { name: String(E.value), argIndex: -1 };
             if (f("paren", "[", $), x) {
               const X = x.length;
@@ -4875,7 +4875,7 @@ function dn(t, e) {
             E.error || f("paren", "]", $);
             break;
           default:
-            E.value !== void 0 && v(E, R), x && x.forEach((X) => I(X, R, L));
+            E.value !== void 0 && O(E, R), x && x.forEach((X) => I(X, R, L));
         }
         f("whitespace", E.wsAfter, R);
       }
@@ -4892,7 +4892,7 @@ function dn(t, e) {
   }(r);
   return { ast: r, evaluations: i, executions: u, precedentsAbsolute: S, precedentsExecute: _, precedentsNamed: m, precedentsRelative: h, precedentsRoot: y, references: l, tokens: T, error: e };
 }
-function Oo(t, e) {
+function vo(t, e) {
   let n, r = -1, i = "";
   Number.isSafeInteger(t.previousToken?.startLine) ? (r = t.previousToken.startLine, n = t.previousToken.endColumn + 1) : Number.isSafeInteger(t.token?.startLine) && (r = t.token.startLine, n = t.token.startColumn), r !== -1 ? (i += `
 ` + e.split(`
@@ -4906,7 +4906,7 @@ function Oo(t, e) {
 }
 const ur = function(t, e) {
   return e.wsBefore && (t.wsBefore = e.wsBefore), e.wsAfter && (t.wsAfter = e.wsAfter), e.image && (t.image = e.image), t;
-}, So = Object.freeze([[":", ".:.", ".:", , ":."], ["^"], ["*", "/"], ["+", "-"], ["&"], ["<", ">", "=", "<>", "<=", ">="]]), Ws = Object.freeze([":", ".:.", ".:", , ":."]), Xu = Object.freeze([":", " ", ".:.", ".:", , ":."]), qu = Object.freeze(["@"]), Zu = Object.freeze(["#"]), lr = Object.freeze(Xu.concat(qu).concat(Zu)), { String: _o, SheetQuoted: Qu, SingleQuotedString: Ju, FunctionToken: tl, NamedTableReference: el, LiteralError: Lo, RefError: xo, Cell: nl, Sheet: rl, Name: Co, NumberToken: ko, Boolean: bo, Column: il, AbsRow: ol, ImplicitIntersectOp: hr, Comma: fe, RangeUnion: sl, RangeTrimFull: al, RangeTrimLeading: cl, RangeTrimTrailing: ul, Semicolon: ll, OpenParen: hl, CloseParen: fr, OpenSquareParen: Po, CloseSquareParen: wo, OpenCurlyParen: fl, CloseCurlyParen: dl, MulOp: pl, PlusOp: dr, DivOp: ml, MinOp: pr, ConcatOp: El, ExOp: gl, PercentOp: Tl, ArrayAnchorOp: Mo, TableSpecifier: Al, BracketedString: Uo, NeqOp: Il, GteOp: Nl, LteOp: yl, GtOp: Rl, EqOp: vl, LtOp: Ol } = Zr;
+}, So = Object.freeze([[":", ".:.", ".:", , ":."], ["^"], ["*", "/"], ["+", "-"], ["&"], ["<", ">", "=", "<>", "<=", ">="]]), Ws = Object.freeze([":", ".:.", ".:", , ":."]), Xu = Object.freeze([":", " ", ".:.", ".:", , ":."]), qu = Object.freeze(["@"]), Zu = Object.freeze(["#"]), lr = Object.freeze(Xu.concat(qu).concat(Zu)), { String: _o, SheetQuoted: Qu, SingleQuotedString: Ju, FunctionToken: tl, NamedTableReference: el, LiteralError: Lo, RefError: xo, Cell: nl, Sheet: rl, Name: Co, NumberToken: ko, Boolean: bo, Column: il, AbsRow: ol, ImplicitIntersectOp: hr, Comma: fe, RangeUnion: sl, RangeTrimFull: al, RangeTrimLeading: cl, RangeTrimTrailing: ul, Semicolon: ll, OpenParen: hl, CloseParen: fr, OpenSquareParen: Po, CloseSquareParen: wo, OpenCurlyParen: fl, CloseCurlyParen: dl, MulOp: pl, PlusOp: dr, DivOp: ml, MinOp: pr, ConcatOp: El, ExOp: gl, PercentOp: Tl, ArrayAnchorOp: Mo, TableSpecifier: Al, BracketedString: Uo, NeqOp: Il, GteOp: Nl, LteOp: yl, GtOp: Rl, EqOp: Ol, LtOp: vl } = Zr;
 class Sl extends qc {
   constructor() {
     super(Zr, { nodeLocationTracking: "full", maxLookahead: 1, skipValidations: !0, recoveryEnabled: !0 }), this.position = { colIndex: 0, rowIndex: 0 }, this.astErrors = [];
@@ -4926,7 +4926,7 @@ class Sl extends qc {
     e.RULE("infixOp", () => {
       const r = [], i = [e.SUBRULE(e.postfixOp)];
       return e.MANY(() => {
-        const o = e.OR(e.c1 || (e.c1 = [{ ALT: () => e.CONSUME(sl).image }, { ALT: () => e.CONSUME(dr).image }, { ALT: () => e.CONSUME(pr).image }, { ALT: () => e.CONSUME(pl).image }, { ALT: () => e.CONSUME(ml).image }, { ALT: () => e.CONSUME(gl).image }, { ALT: () => e.CONSUME(El).image }, { ALT: () => e.CONSUME(Rl).image }, { ALT: () => e.CONSUME(vl).image }, { ALT: () => e.CONSUME(Ol).image }, { ALT: () => e.CONSUME(Il).image }, { ALT: () => e.CONSUME(Nl).image }, { ALT: () => e.CONSUME(yl).image }, { ALT: () => e.CONSUME(al).image }, { ALT: () => e.CONSUME(cl).image }, { ALT: () => e.CONSUME(ul).image }]));
+        const o = e.OR(e.c1 || (e.c1 = [{ ALT: () => e.CONSUME(sl).image }, { ALT: () => e.CONSUME(dr).image }, { ALT: () => e.CONSUME(pr).image }, { ALT: () => e.CONSUME(pl).image }, { ALT: () => e.CONSUME(ml).image }, { ALT: () => e.CONSUME(gl).image }, { ALT: () => e.CONSUME(El).image }, { ALT: () => e.CONSUME(Rl).image }, { ALT: () => e.CONSUME(Ol).image }, { ALT: () => e.CONSUME(vl).image }, { ALT: () => e.CONSUME(Il).image }, { ALT: () => e.CONSUME(Nl).image }, { ALT: () => e.CONSUME(yl).image }, { ALT: () => e.CONSUME(al).image }, { ALT: () => e.CONSUME(cl).image }, { ALT: () => e.CONSUME(ul).image }]));
         r.push([o, e.getLexerPosition(), lr.includes(o)]), i.push(e.SUBRULE2(e.postfixOp));
       }), e.ACTION(() => {
         let o = r.length;
@@ -5033,10 +5033,10 @@ class Sl extends qc {
       return e.ACTION(() => this._ensureWhitespace(Ro(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
       const r = e.CONSUME(Lo);
-      return e.ACTION(() => this._ensureWhitespace(vo(r.image), e.getLexerPosition()));
+      return e.ACTION(() => this._ensureWhitespace(Oo(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
       const r = e.CONSUME(xo);
-      return e.ACTION(() => this._ensureWhitespace(vn(r.image), e.getLexerPosition()));
+      return e.ACTION(() => this._ensureWhitespace(On(r.image), e.getLexerPosition()));
     } }])), e.RULE("literal", () => e.OR([{ ALT: () => {
       const r = e.CONSUME(ko);
       return e.ACTION(() => this._ensureWhitespace(yo(r.image), e.getLexerPosition()));
@@ -5048,7 +5048,7 @@ class Sl extends qc {
       return e.ACTION(() => this._ensureWhitespace(Ro(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
       const r = e.CONSUME(Lo);
-      return e.ACTION(() => this._ensureWhitespace(vo(r.image), e.getLexerPosition()));
+      return e.ACTION(() => this._ensureWhitespace(Oo(r.image), e.getLexerPosition()));
     } }])), e.RULE("function", () => {
       const r = e.CONSUME(tl).image.slice(0, -1), i = e.getLexerPosition(), o = e.SUBRULE(e.functionArguments);
       let s = e.ACTION(() => this._ensureWhitespace(No(r, o), i, !0));
@@ -5166,7 +5166,7 @@ class Sl extends qc {
         return e.ACTION(() => this._ensureWhitespace(Io(o.image, e.position), e.getLexerPosition()));
       } }, { ALT: () => {
         const o = e.CONSUME(xo);
-        return e.ACTION(() => this._ensureWhitespace(vn(o.image), e.getLexerPosition()));
+        return e.ACTION(() => this._ensureWhitespace(On(o.image), e.getLexerPosition()));
       } }]);
       return e.ACTION(() => {
         r && (i = Ce(r, i, !0), i = this._ensureWhitespace(i, e.getLexerPosition()));
@@ -5244,9 +5244,9 @@ class Sl extends qc {
       o = c instanceof D.Parse ? c : new D.Parse(c.message, c);
     }
     const s = this.errors;
-    s.length > 0 && (o = Oo(s[0], n));
+    s.length > 0 && (o = vo(s[0], n));
     const a = this.astErrors;
-    return a.length > 0 && (o = Oo(a[0], n)), i = r ? dn(r, o) : { ast: null, evaluations: ft.EmptyArray, executions: ft.EmptyArray, precedentsAbsolute: ft.EmptyArray, precedentsExecute: ft.EmptyArray, precedentsNamed: null, precedentsRelative: ft.EmptyArray, precedentsRoot: ft.EmptyArray, references: ft.EmptyArray, tokens: ft.EmptyArray, error: o }, i;
+    return a.length > 0 && (o = vo(a[0], n)), i = r ? dn(r, o) : { ast: null, evaluations: ft.EmptyArray, executions: ft.EmptyArray, precedentsAbsolute: ft.EmptyArray, precedentsExecute: ft.EmptyArray, precedentsNamed: null, precedentsRelative: ft.EmptyArray, precedentsRoot: ft.EmptyArray, references: ft.EmptyArray, tokens: ft.EmptyArray, error: o }, i;
   }
 }
 class Me {
@@ -5304,16 +5304,16 @@ class Me {
     }
     const y = this._compiled.ast, p = Ke(y, (A) => {
       if (!A || !A.isReference) return;
-      const v = A.type;
+      const O = A.type;
       if (!n && Ws.includes(A.value)) {
         const E = u[0], R = u[1];
         let M = E.evalIndex === _, L = R.evalIndex === m;
         if (M || L) {
-          const O = vn();
-          return O.image = "#REF!", O;
+          const v = On();
+          return v.image = "#REF!", v;
         }
       }
-      if (v !== "cell" && v !== "error") return;
+      if (O !== "cell" && O !== "error") return;
       const f = A.evalIndex;
       let d, I = f === _;
       if (I || f === m) {
@@ -5321,7 +5321,7 @@ class Me {
           let E = I ? l : h;
           d = { ...A }, d.value = E, d.image = null;
         } else d = N ? Ur(":", rr(l), rr(h), !0) : rr(l);
-        else d = vn(), d.image = "#REF!";
+        else d = On(), d.image = "#REF!";
         return d;
       }
     });
@@ -5367,17 +5367,17 @@ class Me {
       }
       const A = T.inputs;
       if (!A) continue;
-      let v = m[A[0]];
-      if (v === void 0) {
+      let O = m[A[0]];
+      if (O === void 0) {
         m[T.index] = D.BuiltIn.Value;
         continue;
       }
-      if (v.isFormulaError) {
-        m[T.index] = v;
+      if (O.isFormulaError) {
+        m[T.index] = O;
         continue;
       }
       let f, d = m[A[1]];
-      d !== void 0 ? d.isFormulaError ? m[T.index] = d : (g === " " ? f = Xt.intersectRanges(v, d) : g !== ":" && g !== ".:." && g !== ":." && g !== ".:" || (f = m[T.index] = Xt.unionRanges(v, d)), m[T.index] = f ?? D.BuiltIn.Null) : m[T.index] = D.BuiltIn.Value;
+      d !== void 0 ? d.isFormulaError ? m[T.index] = d : (g === " " ? f = Xt.intersectRanges(O, d) : g !== ":" && g !== ".:." && g !== ":." && g !== ".:" || (f = m[T.index] = Xt.unionRanges(O, d)), m[T.index] = f ?? D.BuiltIn.Null) : m[T.index] = D.BuiltIn.Value;
     }
     const y = new Array(c);
     for (let p = 0; p < c; p++) {
@@ -5447,8 +5447,8 @@ class Me {
           }
           if (M && M.isFormulaError) return M;
           if (L && L.isFormulaError) return L;
-          const O = f.fn;
-          return E = O ? O(e, M, L) : D.BuiltIn.Value, E = Xe(E, null), E;
+          const v = f.fn;
+          return E = v ? v(e, M, L) : D.BuiltIn.Value, E = Xe(E, null), E;
         case "function":
           T || (T = new Array(I)), T.length !== I && (T.length = I);
           for (let C = 0; C < I; C++) T[C] = c[d[C].evalIndex];
@@ -5494,8 +5494,8 @@ class Me {
       const f = c[c.length - 1];
       return this._finalizeReturnValue(e, f);
     });
-    const v = c[c.length - 1];
-    return this._finalizeReturnValue(e, v);
+    const O = c[c.length - 1];
+    return this._finalizeReturnValue(e, O);
   }
   _resolvePrecedents(e) {
     const n = e.getPosition(), r = n?.rowIndex ?? 0, i = n?.colIndex ?? 0, o = this.getDirectPrecedentsAt(r, i), s = o.length;