@sheetxl/studio-vanilla 0.6.11 → 0.6.13

package/cdn/assets/{DUeMOZjhpvJ_6uhS.js → 3Jv-_TB7f6AMsi_b.js}

@@ -1,6 +1,6 @@
-import { a as $s, n as D, X as ft, B as Ye, z as Ws, Z as Xt, E as jn, b as Gs, c as zs, u as Xe, J as Ks, M as se, d as Ue, v as Fe } from "./D556jZ6f2NRUvUyF.js";
+import { P as $s, n as D, X as ft, a as Ye, b as Ws, Z as Xt, E as jn, e as Gs, d as Ks, c as Xe, f as zs, M as se, Y as Ue, S as Fe } from "./CJB8tfn11J6m2Clz.js";
 /**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.6.11
+ * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.6.13
  *
  * (C) 2025-present SheetXL Inc. & Michael T. Ford
  * License: The license can be found at https://www.sheetxl.com/license.
@@ -155,13 +155,13 @@ function Ln(t, e) {
 function Fr(t, e, n) {
   e == "__proto__" && pn ? pn(t, e, { configurable: !0, enumerable: !0, value: n, writable: !0 }) : t[e] = n;
 }
-function Ke(t, e) {
+function ze(t, e) {
   return t === e || t != t && e != e;
 }
 var ga = Object.prototype.hasOwnProperty;
 function xn(t, e, n) {
   var r = t[e];
-  ga.call(t, e) && Ke(r, n) && (n !== void 0 || e in t) || Fr(t, e, n);
+  ga.call(t, e) && ze(r, n) && (n !== void 0 || e in t) || Fr(t, e, n);
 }
 function pr(t, e, n, r) {
   var i = !n;
@@ -204,7 +204,7 @@ function Mt(t) {
 function $o(t, e, n) {
   if (!Nt(n)) return !1;
   var r = typeof e;
-  return !!(r == "number" ? Mt(n) && Ln(e, n.length) : r == "string" && e in n) && Ke(n[e], t);
+  return !!(r == "number" ? Mt(n) && Ln(e, n.length) : r == "string" && e in n) && ze(n[e], t);
 }
 var Ta = Object.prototype;
 function Ve(t) {
@@ -220,22 +220,22 @@ var Wo = Object.prototype, Aa = Wo.hasOwnProperty, Ia = Wo.propertyIsEnumerable,
   return Ot(t) && Aa.call(t, "callee") && !Ia.call(t, "callee");
 }, Go = typeof exports == "object" && exports && !exports.nodeType && exports, si = Go && typeof module == "object" && module && !module.nodeType && module, ai = si && si.exports === Go ? wt.Buffer : void 0, De = (ai ? ai.isBuffer : void 0) || function() {
   return !1;
-}, K = {};
+}, z = {};
 function kn(t) {
   return function(e) {
     return t(e);
   };
 }
-K["[object Float32Array]"] = K["[object Float64Array]"] = K["[object Int8Array]"] = K["[object Int16Array]"] = K["[object Int32Array]"] = K["[object Uint8Array]"] = K["[object Uint8ClampedArray]"] = K["[object Uint16Array]"] = K["[object Uint32Array]"] = !0, K["[object Arguments]"] = K["[object Array]"] = K["[object ArrayBuffer]"] = K["[object Boolean]"] = K["[object DataView]"] = K["[object Date]"] = K["[object Error]"] = K["[object Function]"] = K["[object Map]"] = K["[object Number]"] = K["[object Object]"] = K["[object RegExp]"] = K["[object Set]"] = K["[object String]"] = K["[object WeakMap]"] = !1;
-var zo = typeof exports == "object" && exports && !exports.nodeType && exports, ke = zo && typeof module == "object" && module && !module.nodeType && module, Gn = ke && ke.exports === zo && Mo.process, Zt = (function() {
+z["[object Float32Array]"] = z["[object Float64Array]"] = z["[object Int8Array]"] = z["[object Int16Array]"] = z["[object Int32Array]"] = z["[object Uint8Array]"] = z["[object Uint8ClampedArray]"] = z["[object Uint16Array]"] = z["[object Uint32Array]"] = !0, z["[object Arguments]"] = z["[object Array]"] = z["[object ArrayBuffer]"] = z["[object Boolean]"] = z["[object DataView]"] = z["[object Date]"] = z["[object Error]"] = z["[object Function]"] = z["[object Map]"] = z["[object Number]"] = z["[object Object]"] = z["[object RegExp]"] = z["[object Set]"] = z["[object String]"] = z["[object WeakMap]"] = !1;
+var Ko = typeof exports == "object" && exports && !exports.nodeType && exports, ke = Ko && typeof module == "object" && module && !module.nodeType && module, Gn = ke && ke.exports === Ko && Mo.process, Zt = (function() {
   try {
     return ke && ke.require && ke.require("util").types || Gn && Gn.binding && Gn.binding("util");
   } catch {
   }
 })(), ci = Zt && Zt.isTypedArray, Br = ci ? kn(ci) : function(t) {
-  return Ot(t) && jr(t.length) && !!K[Jt(t)];
+  return Ot(t) && jr(t.length) && !!z[Jt(t)];
 }, Na = Object.prototype.hasOwnProperty;
-function Ko(t, e) {
+function zo(t, e) {
   var n = B(t), r = !n && Cn(t), i = !n && !r && De(t), o = !n && !r && !i && Br(t), s = n || r || i || o, a = s ? (function(l, h) {
     for (var N = -1, S = Array(l); ++N < l; ) S[N] = h(N);
     return S;
@@ -256,21 +256,21 @@ function Ho(t) {
   return e;
 }
 function yt(t) {
-  return Mt(t) ? Ko(t) : Ho(t);
+  return Mt(t) ? zo(t) : Ho(t);
 }
-var zn, va = Object.prototype.hasOwnProperty, pt = (zn = function(t, e) {
+var Kn, va = Object.prototype.hasOwnProperty, pt = (Kn = function(t, e) {
   if (Ve(e) || Mt(e)) pr(e, yt(e), t);
   else for (var n in e) va.call(e, n) && xn(t, n, e[n]);
 }, Dr(function(t, e) {
   var n = -1, r = e.length, i = r > 1 ? e[r - 1] : void 0, o = r > 2 ? e[2] : void 0;
-  for (i = zn.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && $o(e[0], e[1], o) && (i = r < 3 ? void 0 : i, r = 1), t = Object(t); ++n < r; ) {
+  for (i = Kn.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && $o(e[0], e[1], o) && (i = r < 3 ? void 0 : i, r = 1), t = Object(t); ++n < r; ) {
     var s = e[n];
-    s && zn(t, s);
+    s && Kn(t, s);
   }
   return t;
 })), Oa = Object.prototype.hasOwnProperty;
 function Yo(t) {
-  return Mt(t) ? Ko(t, !0) : (function(e) {
+  return Mt(t) ? zo(t, !0) : (function(e) {
     if (!Nt(e)) return (function(o) {
       var s = [];
       if (o != null) for (var a in Object(o)) s.push(a);
@@ -296,7 +296,7 @@ function re(t) {
   }
 }
 function qe(t, e) {
-  for (var n = t.length; n--; ) if (Ke(t[n][0], e)) return n;
+  for (var n = t.length; n--; ) if (ze(t[n][0], e)) return n;
   return -1;
 }
 re.prototype.clear = function() {
@@ -454,7 +454,7 @@ bt.prototype.clear = function() {
   return n.set(t, e), this.size = n.size, this;
 };
 var Zo = typeof exports == "object" && exports && !exports.nodeType && exports, li = Zo && typeof module == "object" && module && !module.nodeType && module, hi = li && li.exports === Zo ? wt.Buffer : void 0, fi = hi ? hi.allocUnsafe : void 0;
-function zr(t, e) {
+function Kr(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length, i = 0, o = []; ++n < r; ) {
     var s = t[n];
     e(s, n, t) && (o[i++] = s);
@@ -464,12 +464,12 @@ function zr(t, e) {
 function Qo() {
   return [];
 }
-var Ua = Object.prototype.propertyIsEnumerable, di = Object.getOwnPropertySymbols, Kr = di ? function(t) {
-  return t == null ? [] : (t = Object(t), zr(di(t), function(e) {
+var Ua = Object.prototype.propertyIsEnumerable, di = Object.getOwnPropertySymbols, zr = di ? function(t) {
+  return t == null ? [] : (t = Object(t), Kr(di(t), function(e) {
     return Ua.call(t, e);
   }));
 } : Qo, Fa = Object.getOwnPropertySymbols ? function(t) {
-  for (var e = []; t; ) Wr(e, Kr(t)), t = Xo(t);
+  for (var e = []; t; ) Wr(e, zr(t)), t = Xo(t);
   return e;
 } : Qo;
 function Jo(t, e, n) {
@@ -477,7 +477,7 @@ function Jo(t, e, n) {
   return B(t) ? r : Wr(r, n(t));
 }
 function gr(t) {
-  return Jo(t, yt, Kr);
+  return Jo(t, yt, zr);
 }
 var Tr = ce(wt, "DataView"), Ar = ce(wt, "Promise"), pe = ce(wt, "Set"), pi = "[object Map]", mi = "[object Promise]", Ei = "[object Set]", gi = "[object WeakMap]", Ti = "[object DataView]", Da = ae(Tr), ja = ae(je), Ba = ae(Ar), $a = ae(pe), Wa = ae(dr), At = Jt;
 (Tr && At(new Tr(new ArrayBuffer(1))) != Ti || je && At(new je()) != pi || Ar && At(Ar.resolve()) != mi || pe && At(new pe()) != Ei || dr && At(new dr()) != gi) && (At = function(t) {
@@ -496,7 +496,7 @@ var Tr = ce(wt, "DataView"), Ar = ce(wt, "Promise"), pe = ce(wt, "Set"), pi = "[
   }
   return e;
 });
-var Ga = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, za = /\w*$/, Ai = It ? It.prototype : void 0, Ii = Ai ? Ai.valueOf : void 0, Ni = Zt && Zt.isMap, Ka = Ni ? kn(Ni) : function(t) {
+var Ga = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, Ka = /\w*$/, Ai = It ? It.prototype : void 0, Ii = Ai ? Ai.valueOf : void 0, Ni = Zt && Zt.isMap, za = Ni ? kn(Ni) : function(t) {
   return Ot(t) && At(t) == "[object Map]";
 }, yi = Zt && Zt.isSet, Va = yi ? kn(yi) : function(t) {
   return Ot(t) && At(t) == "[object Set]";
@@ -519,7 +519,7 @@ function sn(t, e, n, r, i, o) {
   if (h == ns || h == ts || N && !i) return s = N ? {} : (function(m) {
     return typeof m.constructor != "function" || Ve(m) ? {} : ha(Xo(m));
   })(t), (function(m, y) {
-    return pr(m, Kr(m), y);
+    return pr(m, zr(m), y);
   })(t, (function(m, y) {
     return m && pr(y, yt(y), m);
   })(s, t));
@@ -552,7 +552,7 @@ function sn(t, e, n, r, i, o) {
         return new I(m);
       case "[object RegExp]":
         return (function(E) {
-          var R = new E.constructor(E.source, za.exec(E));
+          var R = new E.constructor(E.source, Ka.exec(E));
           return R.lastIndex = E.lastIndex, R;
         })(m);
       case "[object Symbol]":
@@ -563,7 +563,7 @@ function sn(t, e, n, r, i, o) {
   if (S) return S;
   o.set(t, s), Va(t) ? t.forEach(function(m) {
     s.add(sn(m, e, n, m, t, o));
-  }) : Ka(t) && t.forEach(function(m, y) {
+  }) : za(t) && t.forEach(function(m, y) {
     s.set(y, sn(m, e, n, y, t, o));
   });
   var _ = l ? void 0 : gr(t);
@@ -637,7 +637,7 @@ G[ts] = G["[object Array]"] = G["[object ArrayBuffer]"] = G["[object DataView]"]
 }, me.prototype.has = function(t) {
   return this.__data__.has(t);
 };
-var vi = It ? It.prototype : void 0, Kn = vi ? vi.valueOf : void 0, Ya = Object.prototype.hasOwnProperty, Oi = "[object Arguments]", Si = "[object Array]", Qe = "[object Object]", _i = Object.prototype.hasOwnProperty;
+var vi = It ? It.prototype : void 0, zn = vi ? vi.valueOf : void 0, Ya = Object.prototype.hasOwnProperty, Oi = "[object Arguments]", Si = "[object Array]", Qe = "[object Object]", _i = Object.prototype.hasOwnProperty;
 function Ir(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) {
     var h = B(o), N = B(s), S = h ? Si : At(o), _ = N ? Si : At(s), m = (S = S == Oi ? Qe : S) == Qe, y = (_ = _ == Oi ? Qe : _) == Qe, p = S == _;
@@ -655,7 +655,7 @@ function Ir(t, e, n, r, i) {
         case "[object Boolean]":
         case "[object Date]":
         case "[object Number]":
-          return Ke(+f, +d);
+          return ze(+f, +d);
         case "[object Error]":
           return f.name == d.name && f.message == d.message;
         case "[object RegExp]":
@@ -672,7 +672,7 @@ function Ir(t, e, n, r, i) {
           var C = Ri(O(f), O(d), E, R, M, L);
           return L.delete(f), C;
         case "[object Symbol]":
-          if (Kn) return Kn.call(f) == Kn.call(d);
+          if (zn) return zn.call(f) == zn.call(d);
       }
       return !1;
     })(o, s, S, a, c, u, l);
@@ -805,7 +805,7 @@ var os = Object.prototype, Qa = os.hasOwnProperty, Nr = Dr(function(t, e) {
   var n = -1, r = e.length, i = r > 2 ? e[2] : void 0;
   for (i && $o(e[0], e[1], i) && (r = 1); ++n < r; ) for (var o = e[n], s = Yo(o), a = -1, c = s.length; ++a < c; ) {
     var u = s[a], l = t[u];
-    (l === void 0 || Ke(l, os[u]) && !Qa.call(t, u)) && (t[u] = o[u]);
+    (l === void 0 || ze(l, os[u]) && !Qa.call(t, u)) && (t[u] = o[u]);
   }
   return t;
 });
@@ -863,7 +863,7 @@ function ss(t, e) {
   }), n;
 }
 function gt(t, e) {
-  return (B(t) ? zr : ss)(t, Pt(e));
+  return (B(t) ? Kr : ss)(t, Pt(e));
 }
 var bi, ec = Math.max, Te = (bi = function(t, e, n) {
   var r = t == null ? 0 : t.length;
@@ -927,7 +927,7 @@ function wi(t, e, n) {
   return t != null && t.length ? Ur(t, e, 0) : -1;
 }
 var cc = Object.prototype.hasOwnProperty;
-function z(t) {
+function K(t) {
   if (t == null) return !0;
   if (Mt(t) && (B(t) || typeof t == "string" || typeof t.splice == "function" || De(t) || Br(t) || Cn(t))) return !t.length;
   var e = At(t);
@@ -936,7 +936,7 @@ function z(t) {
   for (var n in t) if (cc.call(t, n)) return !1;
   return !0;
 }
-var Mi = Zt && Zt.isRegExp, zt = Mi ? kn(Mi) : function(t) {
+var Mi = Zt && Zt.isRegExp, Kt = Mi ? kn(Mi) : function(t) {
   return Ot(t) && Jt(t) == "[object RegExp]";
 };
 function Ht(t) {
@@ -980,7 +980,7 @@ function dt(t, e, n) {
   return r(t, Pt(e), n, i, ue);
 }
 function an(t, e) {
-  return (B(t) ? zr : ss)(t, (function(n) {
+  return (B(t) ? Kr : ss)(t, (function(n) {
     if (typeof n != "function") throw new TypeError("Expected a function");
     return function() {
       var r = arguments;
@@ -1154,7 +1154,7 @@ function cn(t) {
     const n = { type: "Terminal", name: t.terminalType.name, label: dc(t.terminalType), idx: t.idx };
     ut(t.label) && (n.terminalLabel = t.label);
     const r = t.terminalType.PATTERN;
-    return t.terminalType.PATTERN && (n.pattern = zt(r) ? r.source : r), n;
+    return t.terminalType.PATTERN && (n.pattern = Kt(r) ? r.source : r), n;
   }
   if (t instanceof Ae) return { type: "Rule", name: t.name, orgText: t.orgText, definition: e(t.definition) };
   throw Error("non exhaustive match");
@@ -2061,7 +2061,7 @@ function Wi(t) {
 }
 function ds(t) {
   const e = t.PATTERN;
-  if (zt(e)) return !1;
+  if (Kt(e)) return !1;
   if (Yt(e) || b(e, "exec")) return !0;
   if (ut(e)) return !1;
   throw Error("non exhaustive match");
@@ -2080,7 +2080,7 @@ const Rc = { test: function(t) {
 }, lastIndex: 0 };
 function Gi(t, e) {
   if (b(t, "LINE_BREAKS")) return !1;
-  if (zt(t.PATTERN)) {
+  if (Kt(t.PATTERN)) {
     try {
       _r(e, t.PATTERN);
     } catch (n) {
@@ -2092,7 +2092,7 @@ function Gi(t, e) {
   if (ds(t)) return { issue: H.CUSTOM_LINE_BREAK };
   throw Error("non exhaustive match");
 }
-function zi(t) {
+function Ki(t) {
   return k(t, (e) => ut(e) ? e.charCodeAt(0) : e);
 }
 function Yn(t, e, n) {
@@ -2110,7 +2110,7 @@ function Pe(t, e) {
 function yn(t, e) {
   return t.tokenTypeIdx === e.tokenTypeIdx;
 }
-let Ki = 1;
+let zi = 1;
 const Vi = {};
 function He(t) {
   const e = (function(n) {
@@ -2118,13 +2118,13 @@ function He(t) {
     for (; o; ) {
       i = $e(Rt(k(i, (a) => a.CATEGORIES)));
       const s = En(i, r);
-      r = r.concat(s), z(s) ? o = !1 : i = s;
+      r = r.concat(s), K(s) ? o = !1 : i = s;
     }
     return r;
   })(t);
   (function(n) {
     w(n, (r) => {
-      ms(r) || (Vi[Ki] = r, r.tokenTypeIdx = Ki++), Hi(r) && !B(r.CATEGORIES) && (r.CATEGORIES = [r.CATEGORIES]), Hi(r) || (r.CATEGORIES = []), b(r, "categoryMatches") || (r.categoryMatches = []), b(r, "categoryMatchesMap") || (r.categoryMatchesMap = {});
+      ms(r) || (Vi[zi] = r, r.tokenTypeIdx = zi++), Hi(r) && !B(r.CATEGORIES) && (r.CATEGORIES = [r.CATEGORIES]), Hi(r) || (r.CATEGORIES = []), b(r, "categoryMatches") || (r.categoryMatches = []), b(r, "categoryMatchesMap") || (r.categoryMatchesMap = {});
     });
   })(e), (function(n) {
     w(n, (r) => {
@@ -2205,7 +2205,7 @@ a boolean 2nd argument is no longer supported`);
         this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat((function(a, c, u) {
           const l = [];
           let h = !1;
-          const N = an($e(Rt(Q(a.modes))), (_) => _[ne] === ot.NA), S = zi(u);
+          const N = an($e(Rt(Q(a.modes))), (_) => _[ne] === ot.NA), S = Ki(u);
           return c && w(N, (_) => {
             const m = Gi(_, S);
             if (m !== !1) {
@@ -2244,13 +2244,13 @@ a boolean 2nd argument is no longer supported`);
               const S = (function(m) {
                 const y = gt(m, (p) => {
                   const T = p[ne];
-                  return !(zt(T) || Yt(T) || b(T, "exec") || ut(T));
+                  return !(Kt(T) || Yt(T) || b(T, "exec") || ut(T));
                 });
                 return { errors: k(y, (p) => ({ message: "Token Type: ->" + p.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.", type: H.INVALID_PATTERN, tokenTypes: [p] })), valid: En(m, y) };
               })(N.valid), _ = S.valid;
               return h = h.concat(S.errors), h = h.concat((function(m) {
                 let y = [];
-                const p = gt(m, (T) => zt(T[ne]));
+                const p = gt(m, (T) => Kt(T[ne]));
                 return y = y.concat((function(T) {
                   class g extends vr {
                     constructor() {
@@ -2311,13 +2311,13 @@ a boolean 2nd argument is no longer supported`);
               })(_, 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 }) : zt(v) && (f = v, Te([".", "\\", "[", "]", "|", "^", "$", "(", ")", "?", "*", "+", "{"], (d) => f.source.indexOf(d) !== -1) === void 0) && T.push({ str: v.source, idx: A, tokenType: g })), T;
+                  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;
                   var f;
                 }, []);
                 return w(m, (T, g) => {
                   w(p, ({ str: A, idx: v, tokenType: f }) => {
                     if (g < v && (function(d, I) {
-                      if (zt(I)) {
+                      if (Kt(I)) {
                         const E = I.exec(d);
                         return E !== null && E.index === 0;
                       }
@@ -2335,7 +2335,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                 }), y;
               })(_)), h;
             })(a, s));
-          }), z(this.lexerDefinitionErrors)) {
+          }), K(this.lexerDefinitionErrors)) {
             let u;
             He(a), this.TRACE_INIT("analyzeTokenTypes", () => {
               u = (function(l, h) {
@@ -2344,7 +2344,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                 let S;
                 N("initCharCodeToOptimizedIndexMap", () => {
                   (function() {
-                    if (z(ln)) {
+                    if (K(ln)) {
                       ln = new Array(65536);
                       for (let L = 0; L < 65536; L++) ln[L] = L > 255 ? 255 + ~~(L / 255) : L;
                     }
@@ -2356,7 +2356,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                 N("Transform Patterns", () => {
                   E = !1, _ = k(S, (L) => {
                     const O = L[ne];
-                    if (zt(O)) {
+                    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 ? Wi(O) : $i(O) : P[1] : P;
                     }
@@ -2384,7 +2384,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                     if (O) return B(O) ? k(O, (P) => wi(S, P)) : [wi(S, O)];
                   }), T = k(S, (L) => L.PUSH_MODE), g = k(S, (L) => b(L, "POP_MODE"));
                 }), N("Line Terminator Handling", () => {
-                  const L = zi(h.lineTerminatorCharacters);
+                  const L = Ki(h.lineTerminatorCharacters);
                   A = k(S, (O) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (O) => b(O, "LINE_BREAKS") ? !!O.LINE_BREAKS : Gi(O, L) === !1 && _r(L, O.PATTERN)));
                 }), N("Misc Mapping #2", () => {
                   v = k(S, ds), f = k(_, yc), d = dt(S, (L, O) => {
@@ -2404,13 +2404,13 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                         const $ = qt(typeof C == "string" ? C.charCodeAt(0) : C);
                         x !== $ && (x = $, Yn(L, $, I[P]));
                       });
-                    } else if (zt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Rr(`${Nn}	Unable to analyze < ${O.PATTERN.toString()} > pattern.
+                    } else if (Kt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Rr(`${Nn}	Unable to analyze < ${O.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 = Tc(O.PATTERN, h.ensureOptimizations);
-                      z(x) && (R = !1), w(x, (C) => {
+                      K(x) && (R = !1), w(x, (C) => {
                         Yn(L, C, I[P]);
                       });
                     }
@@ -2424,7 +2424,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
             }), this.patternIdxToConfig[c] = u.patternIdxToConfig, this.charCodeToPatternIdxToConfig[c] = u.charCodeToPatternIdxToConfig, this.emptyGroups = pt({}, this.emptyGroups, u.emptyGroups), this.hasCustom = u.hasCustom || this.hasCustom, this.canModeBeOptimized[c] = u.canBeOptimized;
           }
         });
-      }), this.defaultMode = i.defaultMode, !z(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
+      }), this.defaultMode = i.defaultMode, !K(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
         const a = k(this.lexerDefinitionErrors, (c) => c.message).join(`-----------------------
 `);
         throw new Error(`Errors detected in definition of Lexer:
@@ -2442,7 +2442,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
         this.hasCustom ? (this.addToken = this.addTokenUsingPush, this.handlePayload = this.handlePayloadWithCustom) : (this.addToken = this.addTokenUsingMemberAccess, this.handlePayload = this.handlePayloadNoCustom);
       }), this.TRACE_INIT("Failed Optimization Warnings", () => {
         const a = dt(this.canModeBeOptimized, (c, u, l) => (u === !1 && c.push(l), c), []);
-        if (n.ensureOptimizations && !z(a)) throw Error(`Lexer Modes: < ${a.join(", ")} > cannot be optimized.
+        if (n.ensureOptimizations && !K(a)) throw Error(`Lexer Modes: < ${a.join(", ")} > cannot be optimized.
 	 Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.
 	 Or inspect the console log for details on how to resolve these issues.`);
       }), this.TRACE_INIT("clearRegExpParserCache", () => {
@@ -2453,7 +2453,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
     });
   }
   tokenize(e, n = this.defaultMode) {
-    if (!z(this.lexerDefinitionErrors)) {
+    if (!K(this.lexerDefinitionErrors)) {
       const r = k(this.lexerDefinitionErrors, (i) => i.message).join(`-----------------------
 `);
       throw new Error(`Unable to Tokenize because Errors detected in definition of Lexer:
@@ -2718,7 +2718,7 @@ class _c extends Pn {
     }
   }
   updateExpectedNext() {
-    z(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
+    K(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
   }
 }
 class Lc extends _c {
@@ -2794,7 +2794,7 @@ function Lr(t, e, n = []) {
         r = o(a);
       } else {
         if (s instanceof xt) return w(s.definition, (a) => {
-          z(a.definition) === !1 && (r = o(a.definition));
+          K(a.definition) === !1 && (r = o(a.definition));
         }), r;
         if (!(s instanceof V)) throw Error("non exhaustive match");
         n.push(s.terminalType);
@@ -2808,14 +2808,14 @@ function Ts(t, e, n, r) {
   const i = "EXIT_NONE_TERMINAL", o = [i], s = "EXIT_ALTERNATIVE";
   let a = !1;
   const c = e.length, u = c - r - 1, l = [], h = [];
-  for (h.push({ idx: -1, def: t, ruleStack: [], occurrenceStack: [] }); !z(h); ) {
+  for (h.push({ idx: -1, def: t, ruleStack: [], occurrenceStack: [] }); !K(h); ) {
     const N = h.pop();
     if (N === s) {
       a && ge(h).idx <= u && h.pop();
       continue;
     }
     const S = N.def, _ = N.idx, m = N.ruleStack, y = N.occurrenceStack;
-    if (z(S)) continue;
+    if (K(S)) continue;
     const p = S[0];
     if (p === i) {
       const T = { idx: _, def: tt(S), ruleStack: We(m), occurrenceStack: We(y) };
@@ -2931,7 +2931,7 @@ function Pc(t, e, n) {
   const r = vt(t, (o) => o.length === 1), i = t.length;
   if (r && !n) {
     const o = Rt(t);
-    if (o.length === 1 && z(o[0].categoryMatches)) {
+    if (o.length === 1 && K(o[0].categoryMatches)) {
       const s = o[0].tokenTypeIdx;
       return function() {
         return this.LA(1).tokenTypeIdx === s;
@@ -3060,7 +3060,7 @@ function Is(t, e) {
       const u = a[c];
       for (let l = 0; l < u.length; l++) {
         const h = u[l].partialPath, N = u[l].suffixDef, S = Xn(h);
-        if (Mc(i, S, c) || z(N) || h.length === e) {
+        if (Mc(i, S, c) || K(N) || h.length === e) {
           const _ = r[c];
           if (kr(_, h) === !1) {
             _.push(h);
@@ -3106,7 +3106,7 @@ function kr(t, e) {
   return !1;
 }
 function so(t) {
-  return vt(t, (e) => vt(e, (n) => vt(n, (r) => z(r.categoryMatches))));
+  return vt(t, (e) => vt(e, (n) => vt(n, (r) => K(r.categoryMatches))));
 }
 function Uc(t) {
   return `${kt(t)}_#_${t.idx}_#_${Ns(t)}`;
@@ -3145,7 +3145,7 @@ class Fc extends Ie {
 }
 function ys(t, e, n, r = []) {
   const i = [], o = hn(e.definition);
-  if (z(o)) return [];
+  if (K(o)) return [];
   {
     const s = t.name;
     at(o, t) && i.push({ message: n.buildLeftRecursionError({ topLevelRule: t, leftRecursionPath: r }), type: st.LEFT_RECURSION, ruleName: s });
@@ -3158,7 +3158,7 @@ function ys(t, e, n, r = []) {
 }
 function hn(t) {
   let e = [];
-  if (z(t)) return e;
+  if (K(t)) return e;
   const n = St(t);
   if (n instanceof mt) e.push(n.referencedRule);
   else if (n instanceof ht || n instanceof lt || n instanceof Ft || n instanceof Dt || n instanceof Lt || n instanceof J) e = e.concat(hn(n.definition));
@@ -3247,14 +3247,14 @@ const Zn = 1024, Qn = 1280, nn = 1536;
 function Jn(t, e, n) {
   return n | e | t;
 }
-class zc {
+class Kc {
   constructor(e) {
     var n;
-    this.maxLookahead = (n = e?.maxLookahead) !== null && n !== void 0 ? n : Kt.maxLookahead;
+    this.maxLookahead = (n = e?.maxLookahead) !== null && n !== void 0 ? n : zt.maxLookahead;
   }
   validate(e) {
     const n = this.validateNoLeftRecursion(e.rules);
-    if (z(n)) {
+    if (K(n)) {
       const r = this.validateEmptyOrAlternatives(e.rules), i = this.validateAmbiguousAlternationAlternatives(e.rules, this.maxLookahead), o = this.validateSomeNonEmptyLookaheadPath(e.rules, this.maxLookahead);
       return [...n, ...r, ...i, ...o];
     }
@@ -3266,7 +3266,7 @@ class zc {
   validateEmptyOrAlternatives(e) {
     return Tt(e, (n) => (function(r, i) {
       const o = new br();
-      return r.accept(o), Tt(o.alternations, (s) => Tt(We(s.definition), (a, c) => z(Ts([a], [], Pe, 1)) ? [{ message: i.buildEmptyAlternationError({ topLevelRule: r, alternation: s, emptyChoiceIdx: c }), type: st.NONE_LAST_EMPTY_ALT, ruleName: r.name, occurrence: s.idx, alternative: c + 1 }] : []));
+      return r.accept(o), Tt(o.alternations, (s) => Tt(We(s.definition), (a, c) => K(Ts([a], [], Pe, 1)) ? [{ message: i.buildEmptyAlternationError({ topLevelRule: r, alternation: s, emptyChoiceIdx: c }), type: st.NONE_LAST_EMPTY_ALT, ruleName: r.name, occurrence: s.idx, alternative: c + 1 }] : []));
     })(n, oe));
   }
   validateAmbiguousAlternationAlternatives(e, n) {
@@ -3317,7 +3317,7 @@ class zc {
         const c = new Dc();
         a.accept(c), w(c.allProductions, (u) => {
           const l = io(u), h = u.maxLookahead || i;
-          if (z(Rt(Cr(u.idx, a, l, h)[0]))) {
+          if (K(Rt(Cr(u.idx, a, l, h)[0]))) {
             const N = o.buildEmptyRepetitionError({ topLevelRule: a, repetition: u });
             s.push({ message: N, type: st.NO_NON_EMPTY_LOOKAHEAD, ruleName: a.name });
           }
@@ -3373,7 +3373,7 @@ function uo(t, e) {
 function lo(t, e) {
   Object.defineProperty(t, "name", { enumerable: !1, configurable: !0, writable: !1, value: e });
 }
-function Kc(t, e) {
+function zc(t, e) {
   const n = yt(t), r = n.length;
   for (let i = 0; i < r; i++) {
     const o = t[n[i]], s = o.length;
@@ -3423,7 +3423,7 @@ function Rn(t) {
 }
 const fn = Yr(ie, "", NaN, NaN, NaN, NaN, NaN, NaN);
 Object.freeze(fn);
-const Kt = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: gs, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), on = Object.freeze({ recoveryValueFunc: () => {
+const zt = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: gs, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), on = Object.freeze({ recoveryValueFunc: () => {
 }, resyncEnabled: !0 });
 var st, tr;
 (function(t) {
@@ -3465,7 +3465,7 @@ class Ge {
           })(s, o.errMsgProvider);
         })({ rules: Q(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(r);
       }), this.TRACE_INIT("Grammar Validations", () => {
-        if (z(r) && this.skipValidations === !1) {
+        if (K(r) && this.skipValidations === !1) {
           const s = (o = { rules: Q(this.gastProductionsCache), tokenTypes: Q(this.tokensMap), errMsgProvider: oe, grammarName: n }, (function(c, u, l, h) {
             const N = Tt(c, (y) => (function(p, T) {
               const g = new Fc();
@@ -3500,7 +3500,7 @@ class Ge {
           this.definitionErrors = this.definitionErrors.concat(s, a);
         }
         var i, o;
-      }), z(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
+      }), K(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
         const i = (function(o) {
           const s = {};
           return w(o, (a) => {
@@ -3512,7 +3512,7 @@ class Ge {
       }), this.TRACE_INIT("ComputeLookaheadFunctions", () => {
         var i, o;
         (o = (i = this.lookaheadStrategy).initialize) === null || o === void 0 || o.call(i, { rules: Q(this.gastProductionsCache) }), this.preComputeLookaheadFunctions(Q(this.gastProductionsCache));
-      })), !Ge.DEFER_DEFINITION_ERRORS_HANDLING && !z(this.definitionErrors)) throw e = k(this.definitionErrors, (i) => i.message), new Error(`Parser Definition Errors detected:
+      })), !Ge.DEFER_DEFINITION_ERRORS_HANDLING && !K(this.definitionErrors)) throw e = k(this.definitionErrors, (i) => i.message), new Error(`Parser Definition Errors detected:
  ${e.join(`
 -------------------------------
 `)}`);
@@ -3525,12 +3525,12 @@ class Ge {
 	Please use the <IGNORE_AMBIGUITIES> flag on the relevant DSL method instead.
 	See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#IGNORING_AMBIGUITIES
 	For further details.`);
-    this.skipValidations = b(n, "skipValidations") ? n.skipValidations : Kt.skipValidations;
+    this.skipValidations = b(n, "skipValidations") ? n.skipValidations : zt.skipValidations;
   }
 }
 Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
   initRecoverable(t) {
-    this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = b(t, "recoveryEnabled") ? t.recoveryEnabled : Kt.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = Gc);
+    this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = b(t, "recoveryEnabled") ? t.recoveryEnabled : zt.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = Gc);
   }
   getTokenToInsert(t) {
     const e = Yr(t, "", NaN, NaN, NaN, NaN, NaN, NaN);
@@ -3577,7 +3577,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
     return this.canRecoverWithSingleTokenInsertion(t, e) || this.canRecoverWithSingleTokenDeletion(t);
   }
   canRecoverWithSingleTokenInsertion(t, e) {
-    if (!this.canTokenTypeBeInsertedInRecovery(t) || z(e)) return !1;
+    if (!this.canTokenTypeBeInsertedInRecovery(t) || K(e)) return !1;
     const n = this.LA(1);
     return Te(e, (r) => this.tokenMatcher(n, r)) !== void 0;
   }
@@ -3633,7 +3633,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
   }
 }, class {
   initLooksAhead(t) {
-    this.dynamicTokensEnabled = b(t, "dynamicTokensEnabled") ? t.dynamicTokensEnabled : Kt.dynamicTokensEnabled, this.maxLookahead = b(t, "maxLookahead") ? t.maxLookahead : Kt.maxLookahead, this.lookaheadStrategy = b(t, "lookaheadStrategy") ? t.lookaheadStrategy : new zc({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
+    this.dynamicTokensEnabled = b(t, "dynamicTokensEnabled") ? t.dynamicTokensEnabled : zt.dynamicTokensEnabled, this.maxLookahead = b(t, "maxLookahead") ? t.maxLookahead : zt.maxLookahead, this.lookaheadStrategy = b(t, "lookaheadStrategy") ? t.lookaheadStrategy : new Kc({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
   }
   preComputeLookaheadFunctions(t) {
     w(t, (e) => {
@@ -3680,7 +3680,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
   }
 }, class {
   initTreeBuilder(t) {
-    if (this.CST_STACK = [], this.outputCst = t.outputCst, this.nodeLocationTracking = b(t, "nodeLocationTracking") ? t.nodeLocationTracking : Kt.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = uo, this.setNodeLocationFromNode = uo, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
+    if (this.CST_STACK = [], this.outputCst = t.outputCst, this.nodeLocationTracking = b(t, "nodeLocationTracking") ? t.nodeLocationTracking : zt.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = uo, this.setNodeLocationFromNode = uo, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
     else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = co, this.setNodeLocationFromNode = co, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
     else {
       if (!/none/i.test(this.nodeLocationTracking)) throw Error(`Invalid <nodeLocationTracking> config option: "${t.nodeLocationTracking}"`);
@@ -3736,7 +3736,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
         }, validateVisitor: function() {
           const i = (o = this, $e(k(gt(n, (s) => Yt(o[s]) === !1), (s) => ({ msg: `Missing visitor method: <${s}> on ${o.constructor.name} CST Visitor.`, type: Pr.MISSING_METHOD, methodName: s }))));
           var o;
-          if (!z(i)) {
+          if (!K(i)) {
             const s = k(i, (a) => a.msg);
             throw Error(`Errors Detected in CST Visitor <${this.constructor.name}>:
 	${s.join(`
@@ -3758,7 +3758,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
         lo(i, e + "BaseSemanticsWithDefaults");
         const o = Object.create(r.prototype);
         return w(n, (s) => {
-          o[s] = Kc;
+          o[s] = zc;
         }), (i.prototype = o).constructor = i, i;
       })(this.className, yt(this.gastProductionsCache), this.getBaseCstVisitorConstructor());
       return this.baseCstVisitorWithDefaultsConstructor = t, t;
@@ -3819,7 +3819,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
 	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0
 	For Further details.`);
     if (B(t)) {
-      if (z(t)) throw Error(`A Token Vocabulary cannot be empty.
+      if (K(t)) throw Error(`A Token Vocabulary cannot be empty.
 	Note that the first argument for the parser constructor
 	is no longer a Token vector (since v4.0).`);
       if (typeof t[0].startOffset == "number") throw Error(`The Parser constructor no longer accepts a token vector as the first argument.
@@ -3835,7 +3835,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
       this.tokensMap = et(t);
     }
     this.tokensMap.EOF = ie;
-    const n = vt(b(t, "modes") ? Rt(Q(t.modes)) : Q(t), (r) => z(r.categoryMatches));
+    const n = vt(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) {
@@ -4355,7 +4355,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   }
 }, class {
   initErrorHandler(t) {
-    this._errors = [], this.errorMessageProvider = b(t, "errorMessageProvider") ? t.errorMessageProvider : Kt.errorMessageProvider;
+    this._errors = [], this.errorMessageProvider = b(t, "errorMessageProvider") ? t.errorMessageProvider : zt.errorMessageProvider;
   }
   SAVE_ERROR(t) {
     if (en(t)) return t.context = { ruleStack: this.getHumanReadableRuleStack(), ruleOccurrenceStack: et(this.RULE_OCCURRENCE_STACK) }, this._errors.push(t), t;
@@ -4506,7 +4506,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     if (b(t, "traceInitPerf")) {
       const e = t.traceInitPerf, n = typeof e == "number";
       this.traceInitMaxIdent = n ? e : 1 / 0, this.traceInitPerf = n ? e > 0 : e;
-    } else this.traceInitMaxIdent = 0, this.traceInitPerf = Kt.traceInitPerf;
+    } else this.traceInitMaxIdent = 0, this.traceInitPerf = zt.traceInitPerf;
     this.traceInitIndent = -1;
   }
   TRACE_INIT(t, e) {
@@ -4528,7 +4528,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   });
 });
 class Yc extends Ge {
-  constructor(e, n = Kt) {
+  constructor(e, n = zt) {
     const r = et(n);
     r.outputCst = !1, super(e, r);
   }
@@ -4607,7 +4607,7 @@ const Qt = { boolean: 3, string: 2, number: 1 }, bu = (t, e) => {
   if (n.isIReferenceRange && (n = n.getCoords()), n.colStart === void 0) return D.BuiltIn.Ref;
   const i = r(e, n);
   return i ? t.getReference(i) : D.BuiltIn.Null;
-}, zu = { "+": (t, e, n) => de(t, e, n, bu), "-": (t, e, n) => de(t, e, n, Pu), "*": (t, e, n) => de(t, e, n, Fs), "/": (t, e, n) => de(t, e, n, Ds), "^": (t, e, n) => de(t, e, n, wu), " ": (t, e, n, r) => _e(t, e, n, Xt.intersectRanges), ":": (t, e, n, r) => _e(t, e, n, Xt.unionRanges), ".:.": (t, e, n, r) => {
+}, Ku = { "+": (t, e, n) => de(t, e, n, bu), "-": (t, e, n) => de(t, e, n, Pu), "*": (t, e, n) => de(t, e, n, Fs), "/": (t, e, n) => de(t, e, n, Ds), "^": (t, e, n) => de(t, e, n, wu), " ": (t, e, n, r) => _e(t, e, n, Xt.intersectRanges), ":": (t, e, n, r) => _e(t, e, n, Xt.unionRanges), ".:.": (t, e, n, r) => {
   const i = _e(t, e, n, Xt.unionRanges);
   return t.getFunction("TRIMRANGE").execute(i, 3, 3);
 }, ".:": (t, e, n, r) => {
@@ -4620,7 +4620,7 @@ const Qt = { boolean: 3, string: 2, number: 1 }, bu = (t, e) => {
   if (i !== null && i.colStart !== void 0 && (i = r.getValueAt(i.rowStart, i.colStart)), o !== null && o.colStart !== void 0 && (o = r.getValueAt(o.rowStart, o.colStart)), typeof i == "string" && typeof o == "string") return s(i, o);
   let a, c;
   return i?.isIRange ? a = i : o?.isIRange && (c = o), a || c ? (a || (a = r.getRange(i)), a.broadcast(o, s, Gu)) : s(i = Ue(i, Fe(i, !0), se.String), o = Ue(o, Fe(o, !0), se.String));
-})(t, e, n, Mu), "=": (t, e, n) => he(t, e, n, Uu), "<>": (t, e, n) => he(t, e, n, Fu), ">": (t, e, n) => he(t, e, n, Du), "<": (t, e, n) => he(t, e, n, Bu), ">=": (t, e, n) => he(t, e, n, ju), "<=": (t, e, n) => he(t, e, n, $u) }, Ku = { "-": (t, e) => Eo("-", e), "+": (t, e) => Eo("+", e), "@": (t, e) => {
+})(t, e, n, Mu), "=": (t, e, n) => he(t, e, n, Uu), "<>": (t, e, n) => he(t, e, n, Fu), ">": (t, e, n) => he(t, e, n, Du), "<": (t, e, n) => he(t, e, n, Bu), ">=": (t, e, n) => he(t, e, n, ju), "<=": (t, e, n) => he(t, e, n, $u) }, zu = { "-": (t, e) => Eo("-", e), "+": (t, e) => Eo("+", e), "@": (t, e) => {
   if (!e || !e.isIReferenceRange) return e;
   const n = e.getCoords(), r = e, i = t.getPosition(), o = r.getHeight(), s = r.getWidth();
   if (s > 1 && o > 1) return D.BuiltIn.Value;
@@ -4695,7 +4695,7 @@ function yo(t) {
 function vn(t) {
   return { type: "error", value: t ? D.getBuiltInByLabel(t.toUpperCase()) : D.BuiltIn.Ref, inputs: null, isReference: !0 };
 }
-function ze(t, e) {
+function Ke(t, e) {
   return (function n(r, i) {
     const o = r.inputs;
     let s;
@@ -4711,14 +4711,14 @@ function ze(t, e) {
   })(t, void 0) || this;
 }
 function dn(t, e) {
-  let n = 0, r = ze(t, (g) => {
+  let n = 0, r = Ke(t, (g) => {
     const A = { ...g };
     return A.evalIndex = n++, A;
   });
   const i = new Array(n), o = /* @__PURE__ */ new Set(), s = /* @__PURE__ */ new Map();
   let a;
   const c = /* @__PURE__ */ new Map(), u = [], l = [];
-  r = ze(r, (g, A) => {
+  r = Ke(r, (g, A) => {
     const v = 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 };
@@ -4768,7 +4768,7 @@ function dn(t, e) {
         }
         E[R] = O;
       }
-      i[f] = Ks(E);
+      i[f] = zs(E);
     }
     else {
       if (v !== "empty") return u.push(g), g;
@@ -4798,10 +4798,10 @@ function dn(t, e) {
     const A = u[g], v = A.type;
     if (v === "infix") {
       const f = A.value;
-      A.fn = zu[f];
+      A.fn = Ku[f];
     } else if (v === "prefix") {
       const f = A.value;
-      A.fn = Ku[f];
+      A.fn = zu[f];
     } else if (v === "postfix") {
       const f = A.value;
       A.fn = Vu[f];
@@ -5212,7 +5212,7 @@ class vl extends Yc {
     const o = r.tokens;
     this.input = o, this.inputTextLength = n.length;
     const s = e.getPosition();
-    return this.position = s, this.astErrors = [], this.reset(), i = this.intersectOp(), i = ze(i, (a, c) => {
+    return this.position = s, this.astErrors = [], this.reset(), i = this.intersectOp(), i = Ke(i, (a, c) => {
       let u = a.type;
       if (u === "function" && a.value && a.value.toUpperCase().startsWith("_XLFN.")) {
         const l = a.value.substring(6);
@@ -5305,7 +5305,7 @@ class Me {
       if (c.type !== "cell") throw a.op === "named" ? new Error("Cannot setReference for a named reference") : new Error(`Invalidate reference index: ${e}`);
       _ = c.evalIndex;
     }
-    const y = this._compiled.ast, p = ze(y, (A) => {
+    const y = this._compiled.ast, p = Ke(y, (A) => {
       if (!A || !A.isReference) return;
       const v = A.type;
       if (!n && Bs.includes(A.value)) {
@@ -5397,7 +5397,7 @@ class Me {
     let a = this._compiled;
     if (n !== void 0) {
       let f;
-      if (ze(a.ast, (d) => {
+      if (Ke(a.ast, (d) => {
         d.evalIndex === n && (f = d);
       }), !f) throw new Error(`Invalid evalIndex: ${n}`);
       a = dn(f, a.error);
@@ -5523,7 +5523,7 @@ class Me {
     if (i.type === "cell") return this;
     if (i.value === "@") return this;
     if (!r) return this;
-    const o = Gs(n) + zs(e);
+    const o = Gs(n) + Ks(e);
     if (r.has(o)) return this;
     const s = dn(Ce("@", i, !0), this._compiled.error);
     return new Me(this._options, s);