@guihz/trading-vue-editor-tes 0.1.30 → 0.1.31

package/lib/assets/{parserTccWorker-ClNWfPLI.js → parserTccWorker-CNzNddjG.js}

@@ -543,7 +543,7 @@ var kE = h4((AT, V2) => {
         return a && typeof Symbol == "function" && a.constructor === Symbol && a !== Symbol.prototype ? "symbol" : typeof a;
       }, U(h);
     }
-    function K(h, a) {
+    function Y(h, a) {
       if (!(h instanceof a))
         throw new TypeError("Cannot call a class as a function");
     }
@@ -568,9 +568,9 @@ var kE = h4((AT, V2) => {
     function c0(h, a, d) {
       return a && F(h.prototype, a), d && F(h, d), Object.defineProperty(h, "prototype", { writable: !1 }), h;
     }
-    var Y = function() {
+    var K = function() {
       function h() {
-        K(this, h);
+        Y(this, h);
       }
       return c0(h, [{ key: "hashCode", value: function() {
         var a = new f();
@@ -600,7 +600,7 @@ var kE = h4((AT, V2) => {
       var a = L(d);
       function d(u, O) {
         var M;
-        K(this, d), M = a.call(this);
+        Y(this, d), M = a.call(this);
         var A = new q();
         u instanceof d ? u.opnds.map(function(g) {
           A.add(g);
@@ -630,15 +630,15 @@ var kE = h4((AT, V2) => {
           var l = this.opnds[c], g = l.evalPrecedence(u, O);
           if (M |= g !== l, g === null)
             return null;
-          g !== Y.NONE && A.push(g);
+          g !== K.NONE && A.push(g);
         }
         if (!M)
           return this;
         if (A.length === 0)
-          return Y.NONE;
+          return K.NONE;
         var v = null;
         return A.map(function(R) {
-          v = v === null ? R : Y.andContext(v, R);
+          v = v === null ? R : K.andContext(v, R);
         }), v;
       } }, { key: "toString", value: function() {
         var u = this.opnds.map(function(O) {
@@ -646,12 +646,12 @@ var kE = h4((AT, V2) => {
         });
         return (u.length > 3 ? u.slice(3) : u).join("&&");
       } }]), d;
-    }(Y), u0 = function(h) {
+    }(K), u0 = function(h) {
       W(d, h);
       var a = L(d);
       function d(u, O) {
         var M;
-        K(this, d), M = a.call(this);
+        Y(this, d), M = a.call(this);
         var A = new q();
         u instanceof d ? u.opnds.map(function(v) {
           A.add(v);
@@ -679,8 +679,8 @@ var kE = h4((AT, V2) => {
       } }, { key: "evalPrecedence", value: function(u, O) {
         for (var M = !1, A = [], c = 0; c < this.opnds.length; c++) {
           var l = this.opnds[c], g = l.evalPrecedence(u, O);
-          if (M |= g !== l, g === Y.NONE)
-            return Y.NONE;
+          if (M |= g !== l, g === K.NONE)
+            return K.NONE;
           g !== null && A.push(g);
         }
         return M ? (A.length === 0 || A.map(function(v) {
@@ -692,11 +692,11 @@ var kE = h4((AT, V2) => {
         });
         return (u.length > 3 ? u.slice(3) : u).join("||");
       } }]), d;
-    }(Y);
+    }(K);
     function q0(h) {
       var a = [];
       return h.values().map(function(d) {
-        d instanceof Y.PrecedencePredicate && a.push(d);
+        d instanceof K.PrecedencePredicate && a.push(d);
       }), a;
     }
     function Y0(h) {
@@ -737,7 +737,7 @@ var kE = h4((AT, V2) => {
         (function(M, A) {
           if (!(M instanceof A))
             throw new TypeError("Cannot call a class as a function");
-        })(this, h), this.checkContext(u, O), u = r1(u), O = r1(O, !0), this.state = u.state !== null ? u.state : O.state, this.alt = u.alt !== null ? u.alt : O.alt, this.context = u.context !== null ? u.context : O.context, this.semanticContext = u.semanticContext !== null ? u.semanticContext : O.semanticContext !== null ? O.semanticContext : Y.NONE, this.reachesIntoOuterContext = O.reachesIntoOuterContext, this.precedenceFilterSuppressed = O.precedenceFilterSuppressed;
+        })(this, h), this.checkContext(u, O), u = r1(u), O = r1(O, !0), this.state = u.state !== null ? u.state : O.state, this.alt = u.alt !== null ? u.alt : O.alt, this.context = u.context !== null ? u.context : O.context, this.semanticContext = u.semanticContext !== null ? u.semanticContext : O.semanticContext !== null ? O.semanticContext : K.NONE, this.reachesIntoOuterContext = O.reachesIntoOuterContext, this.precedenceFilterSuppressed = O.precedenceFilterSuppressed;
       }
       var a, d;
       return a = h, (d = [{ key: "checkContext", value: function(u, O) {
@@ -755,7 +755,7 @@ var kE = h4((AT, V2) => {
       } }, { key: "equalsForConfigSet", value: function(u) {
         return this === u || u instanceof h && this.state.stateNumber === u.state.stateNumber && this.alt === u.alt && this.semanticContext.equals(u.semanticContext);
       } }, { key: "toString", value: function() {
-        return "(" + this.state + "," + this.alt + (this.context !== null ? ",[" + this.context.toString() + "]" : "") + (this.semanticContext !== Y.NONE ? "," + this.semanticContext.toString() : "") + (this.reachesIntoOuterContext > 0 ? ",up=" + this.reachesIntoOuterContext : "") + ")";
+        return "(" + this.state + "," + this.alt + (this.context !== null ? ",[" + this.context.toString() + "]" : "") + (this.semanticContext !== K.NONE ? "," + this.semanticContext.toString() : "") + (this.reachesIntoOuterContext > 0 ? ",up=" + this.reachesIntoOuterContext : "") + ")";
       } }]) && k0(a.prototype, d), Object.defineProperty(a, "prototype", { writable: !1 }), h;
     }();
     function xe(h) {
@@ -4051,7 +4051,7 @@ var kE = h4((AT, V2) => {
       } }, { key: "toString", value: function() {
         return "{" + this.ruleIndex + ":" + this.predIndex + "}?";
       } }]) && Hd(a.prototype, d), Object.defineProperty(a, "prototype", { writable: !1 }), A;
-    }(Y);
+    }(K);
     function Bs(h) {
       return Bs = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(a) {
         return typeof a;
@@ -4087,7 +4087,7 @@ var kE = h4((AT, V2) => {
         return a.__proto__ || Object.getPrototypeOf(a);
       }, Uc(h);
     }
-    Y.NONE = new zh();
+    K.NONE = new zh();
     var fh = function(h) {
       (function(c, l) {
         if (typeof l != "function" && l !== null)
@@ -4220,7 +4220,7 @@ var kE = h4((AT, V2) => {
       return a = A, (d = [{ key: "evaluate", value: function(c, l) {
         return c.precpred(l, this.precedence);
       } }, { key: "evalPrecedence", value: function(c, l) {
-        return c.precpred(l, this.precedence) ? Y.NONE : null;
+        return c.precpred(l, this.precedence) ? K.NONE : null;
       } }, { key: "compareTo", value: function(c) {
         return this.precedence - c.precedence;
       } }, { key: "updateHashCode", value: function(c) {
@@ -4230,7 +4230,7 @@ var kE = h4((AT, V2) => {
       } }, { key: "toString", value: function() {
         return "{" + this.precedence + ">=prec}?";
       } }]) && jd(a.prototype, d), Object.defineProperty(a, "prototype", { writable: !1 }), A;
-    }(Y);
+    }(K);
     function Ps(h) {
       return Ps = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(a) {
         return typeof a;
@@ -4266,7 +4266,7 @@ var kE = h4((AT, V2) => {
         return a.__proto__ || Object.getPrototypeOf(a);
       }, Vc(h);
     }
-    Y.PrecedencePredicate = Oh;
+    K.PrecedencePredicate = Oh;
     var Kd = function(h) {
       (function(c, l) {
         if (typeof l != "function" && l !== null)
@@ -6332,7 +6332,7 @@ var kE = h4((AT, V2) => {
       return a = h, (d = [{ key: "add", value: function(u, O) {
         if (O === void 0 && (O = null), this.readOnly)
           throw "This set is readonly";
-        u.semanticContext !== Y.NONE && (this.hasSemanticContext = !0), u.reachesIntoOuterContext > 0 && (this.dipsIntoOuterContext = !0);
+        u.semanticContext !== K.NONE && (this.hasSemanticContext = !0), u.reachesIntoOuterContext > 0 && (this.dipsIntoOuterContext = !0);
         var M = this.configLookup.add(u);
         if (M === u)
           return this.cachedHashCode = -1, this.configs.push(u), !0;
@@ -6345,7 +6345,7 @@ var kE = h4((AT, V2) => {
       } }, { key: "getPredicates", value: function() {
         for (var u = [], O = 0; O < this.configs.length; O++) {
           var M = this.configs[O].semanticContext;
-          M !== Y.NONE && u.push(M.semanticContext);
+          M !== K.NONE && u.push(M.semanticContext);
         }
         return u;
       } }, { key: "optimizeConfigs", value: function(u) {
@@ -7153,7 +7153,7 @@ var kE = h4((AT, V2) => {
       if (h === yr.SLL && a.hasSemanticContext) {
         for (var d = new Rn(), u = 0; u < a.items.length; u++) {
           var O = a.items[u];
-          O = new $0({ semanticContext: Y.NONE }, O), d.add(O);
+          O = new $0({ semanticContext: K.NONE }, O), d.add(O);
         }
         a = d;
       }
@@ -7580,17 +7580,17 @@ var kE = h4((AT, V2) => {
       } }, { key: "getPredsForAmbigAlts", value: function(c, l, g) {
         for (var v = [], R = 0; R < l.items.length; R++) {
           var w = l.items[R];
-          c.has(w.alt) && (v[w.alt] = Y.orContext(v[w.alt] || null, w.semanticContext));
+          c.has(w.alt) && (v[w.alt] = K.orContext(v[w.alt] || null, w.semanticContext));
         }
         for (var l0 = 0, I0 = 1; I0 < g + 1; I0++) {
           var B0 = v[I0] || null;
-          B0 === null ? v[I0] = Y.NONE : B0 !== Y.NONE && (l0 += 1);
+          B0 === null ? v[I0] = K.NONE : B0 !== K.NONE && (l0 += 1);
         }
         return l0 === 0 && (v = null), this.debug && console.log("getPredsForAmbigAlts result " + x(v)), v;
       } }, { key: "getPredicatePredictions", value: function(c, l) {
         for (var g = [], v = !1, R = 1; R < l.length; R++) {
           var w = l[R];
-          c !== null && c.has(R) && g.push(new kh(w, R)), w !== Y.NONE && (v = !0);
+          c !== null && c.has(R) && g.push(new kh(w, R)), w !== K.NONE && (v = !0);
         }
         return v ? g : null;
       } }, { key: "getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule", value: function(c, l) {
@@ -7605,13 +7605,13 @@ var kE = h4((AT, V2) => {
       } }, { key: "splitAccordingToSemanticValidity", value: function(c, l) {
         for (var g = new Rn(c.fullCtx), v = new Rn(c.fullCtx), R = 0; R < c.items.length; R++) {
           var w = c.items[R];
-          w.semanticContext !== Y.NONE ? w.semanticContext.evaluate(this.parser, l) ? g.add(w) : v.add(w) : g.add(w);
+          w.semanticContext !== K.NONE ? w.semanticContext.evaluate(this.parser, l) ? g.add(w) : v.add(w) : g.add(w);
         }
         return [g, v];
       } }, { key: "evalSemanticContext", value: function(c, l, g) {
         for (var v = new En(), R = 0; R < c.length; R++) {
           var w = c[R];
-          if (w.pred !== Y.NONE) {
+          if (w.pred !== K.NONE) {
             var l0 = w.pred.evaluate(this.parser, l);
             if ((this.debug || this.dfa_debug) && console.log("eval pred " + w + "=" + l0), l0 && ((this.debug || this.dfa_debug) && console.log("PREDICT " + w.alt), v.add(w.alt), !g))
               break;
@@ -7715,7 +7715,7 @@ var kE = h4((AT, V2) => {
             var I0 = l.getPredicate().evaluate(this.parser, this._outerContext);
             this._input.seek(l0), I0 && (w = new $0({ state: l.target }, c));
           } else {
-            var B0 = Y.andContext(c.semanticContext, l.getPredicate());
+            var B0 = K.andContext(c.semanticContext, l.getPredicate());
             w = new $0({ state: l.target, semanticContext: B0 }, c);
           }
         else
@@ -7731,7 +7731,7 @@ var kE = h4((AT, V2) => {
             var I0 = l.getPredicate().evaluate(this.parser, this._outerContext);
             this._input.seek(l0), I0 && (w = new $0({ state: l.target }, c));
           } else {
-            var B0 = Y.andContext(c.semanticContext, l.getPredicate());
+            var B0 = K.andContext(c.semanticContext, l.getPredicate());
             w = new $0({ state: l.target, semanticContext: B0 }, c);
           }
         else
@@ -22258,7 +22258,7 @@ Arguments: ` + Array.prototype.slice.call(n).join("") + `
       U.prototype.scoreOffsetAt = function(J) {
         this.offsetScore += Math.abs(this.zone.utcOffset(J.at) - J.offset), this.zone.abbr(J.at).replace(/[^A-Z]/g, "") !== J.abbr && this.abbrScore++;
       };
-      function K(J, j) {
+      function Y(J, j) {
         for (var n0, t0; t0 = ((j.at - J.at) / 12e4 | 0) * 6e4; )
           n0 = new C(new Date(J.at + t0)), n0.offset === J.offset ? J = n0 : j = n0;
         return J;
@@ -22266,7 +22266,7 @@ Arguments: ` + Array.prototype.slice.call(n).join("") + `
       function F() {
         var J = (/* @__PURE__ */ new Date()).getFullYear() - 2, j = new C(new Date(J, 0, 1)), n0 = j.offset, t0 = [j], P0, J0, b1, g1;
         for (g1 = 1; g1 < 48; g1++)
-          b1 = new Date(J, g1, 1).getTimezoneOffset(), b1 !== n0 && (J0 = new C(new Date(J, g1, 1)), P0 = K(j, J0), t0.push(P0), t0.push(new C(new Date(P0.at + 6e4))), j = J0, n0 = b1);
+          b1 = new Date(J, g1, 1).getTimezoneOffset(), b1 !== n0 && (J0 = new C(new Date(J, g1, 1)), P0 = Y(j, J0), t0.push(P0), t0.push(new C(new Date(P0.at + 6e4))), j = J0, n0 = b1);
         for (g1 = 0; g1 < 4; g1++)
           t0.push(new C(new Date(J + g1, 0, 1))), t0.push(new C(new Date(J + g1, 6, 1)));
         return t0;
@@ -22274,7 +22274,7 @@ Arguments: ` + Array.prototype.slice.call(n).join("") + `
       function c0(J, j) {
         return J.offsetScore !== j.offsetScore ? J.offsetScore - j.offsetScore : J.abbrScore !== j.abbrScore ? J.abbrScore - j.abbrScore : J.zone.population !== j.zone.population ? j.zone.population - J.zone.population : j.zone.name.localeCompare(J.zone.name);
       }
-      function Y(J, j) {
+      function K(J, j) {
         var n0, t0;
         for (T(j), n0 = 0; n0 < j.length; n0++)
           t0 = j[n0], p[t0] = p[t0] || {}, p[t0][J] = !0;
@@ -22320,7 +22320,7 @@ Arguments: ` + Array.prototype.slice.call(n).join("") + `
       function k0(J) {
         var j, n0, t0, P0;
         for (typeof J == "string" && (J = [J]), j = 0; j < J.length; j++)
-          t0 = J[j].split("|"), n0 = t0[0], P0 = Y0(n0), n[P0] = J[j], o[P0] = n0, Y(P0, t0[2].split(" "));
+          t0 = J[j].split("|"), n0 = t0[0], P0 = Y0(n0), n[P0] = J[j], o[P0] = n0, K(P0, t0[2].split(" "));
       }
       function r1(J, j) {
         J = Y0(J);
@@ -25520,21 +25520,21 @@ Arguments: ` + Array.prototype.slice.call(n).join("") + `
       const q = this._parserSingleExpression(b), W = this._parserSingleExpression(f), N = y ? this._parserSingleExpression(y) : "", L = this._parserBlockLine(i, t, !1, !0);
       jr.includes(s) && (s = `$${s}`);
       const C = `var ${E} = Date.now()`;
-      let K = `for (var ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${_}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
+      let Y = `for (var ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${_}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
             if (Date.now() - ${E} > 500) {
                 throw new Error('${T1.loopRuntimeErr}')
             }
             ${x}++
             ${L}
         }`;
-      return K = `${C};
+      return Y = `${C};
         ${m ? "" : `var ${x} = 0`};
         const ${_} = ${W};
         const ${z} = (${q})>${_} ? 1 : -1;
-        ${K}`, t || this._codesCol[this._blockCount].push({
-        code: K,
+        ${Y}`, t || this._codesCol[this._blockCount].push({
+        code: Y,
         depends: this._getDepends(T)
-      }), this._isInLoop = m, t ? this._functionalProcess(K, o) : K;
+      }), this._isInLoop = m, t ? this._functionalProcess(Y, o) : Y;
     }
     _parserAgainAssign(e) {
       const { operator: t, name: n, value: i } = e, { varPos: s, declare: o } = n, p = `$againAssign${this._blockCount}`;
@@ -26444,15 +26444,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         case 102:
           return "\f";
         case 120:
-          return String.fromCharCode(K(2, O0));
+          return String.fromCharCode(Y(2, O0));
         case 117:
           if (s() == "{") {
             for (p(!0), s() === "}" && W("Expecting hex-character between {}"); s() == "0"; )
               p(!0);
             var R0, h1 = m("}", !0) - i.pos;
-            return (h1 > 6 || (R0 = K(h1, O0)) > 1114111) && W("Unicode reference out of bounds"), p(!0), kq(R0);
+            return (h1 > 6 || (R0 = Y(h1, O0)) > 1114111) && W("Unicode reference out of bounds"), p(!0), kq(R0);
           }
-          return String.fromCharCode(K(4, O0));
+          return String.fromCharCode(Y(4, O0));
         case 10:
           return "";
         case 13:
@@ -26466,7 +26466,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       var A0 = s();
       return A0 >= "0" && A0 <= "7" && (M0 += p(!0), M0[0] <= "3" && (A0 = s()) >= "0" && A0 <= "7" && (M0 += p(!0))), M0 === "0" ? "\0" : (M0.length > 0 && $1.has_directive("use strict") && O0 && W("Legacy octal escape sequences are not allowed in strict mode"), String.fromCharCode(parseInt(M0, 8)));
     }
-    function K(M0, O0) {
+    function Y(M0, O0) {
       for (var A0 = 0; M0 > 0; --M0) {
         if (!O0 && isNaN(parseInt(s(), 16)))
           return parseInt(A0, 16) || "";
@@ -26508,7 +26508,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       }
       return i.template_braces.pop(), R0 = _(M0 ? "template_head" : "template_substitution", O0), Ua.set(R0, A0), R0.template_end = !0, R0;
     });
-    function Y(M0) {
+    function K(M0) {
       var O0 = i.regex_allowed, A0 = y(), D0;
       return A0 == -1 ? (D0 = i.text.substr(i.pos), i.pos = i.text.length) : (D0 = i.text.substring(i.pos, A0), i.pos = A0), i.col = i.tokcol + (i.pos - i.tokpos), i.comments_before.push(_(M0, D0, !0)), i.regex_allowed = O0, $1;
     }
@@ -26569,7 +26569,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     function k0() {
       switch (p(), s()) {
         case "/":
-          return p(), Y("comment1");
+          return p(), K("comment1");
         case "*":
           return p(), W0();
       }
@@ -26603,14 +26603,14 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     function $1(M0) {
       if (M0 != null)
         return q0(M0);
-      for (n && i.pos == 0 && f("#!") && (E(), b(2), Y("comment5")); ; ) {
+      for (n && i.pos == 0 && f("#!") && (E(), b(2), K("comment5")); ; ) {
         if (z(), E(), t) {
           if (f("<!--")) {
-            b(4), Y("comment3");
+            b(4), K("comment3");
             continue;
           }
           if (f("-->") && i.newline_before) {
-            b(3), Y("comment4");
+            b(3), K("comment4");
             continue;
           }
         }
@@ -26832,7 +26832,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             var R1 = Be();
             return W(), R1;
           }
-          return Gt(s(), "punc", ":") ? K() : F();
+          return Gt(s(), "punc", ":") ? Y() : F();
         case "punc":
           switch (n.token.value) {
             case "{":
@@ -26874,7 +26874,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
                 })
               });
             case "for":
-              return o(), Y();
+              return o(), K();
             case "class":
               return o(), G && b("classes are not allowed as the body of a loop"), p0 && b("classes are not allowed as the body of an if"), m1(Pn, H);
             case "function":
@@ -26927,7 +26927,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       }
       y();
     });
-    function K() {
+    function Y() {
       var k = it(Mc);
       k.name === "await" && z() && f(n.prev, "await cannot be used as label inside async function"), n.labels.some((G) => G.name === k.name) && b("Label " + k.name + " defined twice"), E(":"), n.labels.push(k);
       var H = U();
@@ -26949,7 +26949,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       var p0 = new k({ label: H });
       return G && G.references.push(p0), p0;
     }
-    function Y() {
+    function K() {
       var k = "`for await` invalid in this context", H = n.token;
       H.type == "name" && H.value == "await" ? (q() || f(H, k), o()) : H = !1, E("(");
       var G = null;
@@ -30216,8 +30216,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           const L = _.raw || z, C = L.match(/^\/(.*)\/(\w*)$/);
           if (!C)
             throw new Error("Invalid regex source " + L);
-          const [U, K, F] = C;
-          return q.value = { source: K, flags: F }, new en(q);
+          const [U, Y, F] = C;
+          return q.value = { source: Y, flags: F }, new en(q);
         }
         if (z === null)
           return new Jt(q);
@@ -31350,7 +31350,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     function T(j) {
       return " ".repeat(r.indent_start + i - j * r.indent_level);
     }
-    var _ = !1, z = !1, q = !1, W = 0, N = !1, L = !1, C = -1, U = "", K, F, c0 = r.source_map && [], Y = c0 ? function() {
+    var _ = !1, z = !1, q = !1, W = 0, N = !1, L = !1, C = -1, U = "", Y, F, c0 = r.source_map && [], K = c0 ? function() {
       c0.forEach(function(j) {
         try {
           let { name: n0, token: t0 } = j;
@@ -31378,7 +31378,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         }
         o++, p++, s = n0;
       }
-      W && (W = 0, Y());
+      W && (W = 0, K());
     } : Mn, u0 = ee("( [ + * / - , . `");
     function q0(j) {
       j = String(j);
@@ -31388,12 +31388,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
 `), r1())), L && n0 && (L = !1, /[\s;})]/.test(n0) || k0()), C = -1;
       var t0 = U.charAt(U.length - 1);
       q && (q = !1, (t0 === ":" && n0 === "}" || (!n0 || !";}".includes(n0)) && t0 !== ";") && (r.semicolons || u0.has(n0) ? (b.append(";"), s++, p++) : (W0(), s > 0 && (b.append(`
-`), p++, o++, s = 0), /^\s+$/.test(j) && (q = !0)), r.beautify || (z = !1))), z && ((lp(t0) && (lp(n0) || n0 == "\\") || n0 == "/" && n0 == t0 || (n0 == "+" || n0 == "-") && n0 == U) && (b.append(" "), s++, p++), z = !1), K && (c0.push({
-        token: K,
+`), p++, o++, s = 0), /^\s+$/.test(j) && (q = !0)), r.beautify || (z = !1))), z && ((lp(t0) && (lp(n0) || n0 == "\\") || n0 == "/" && n0 == t0 || (n0 == "+" || n0 == "-") && n0 == U) && (b.append(" "), s++, p++), z = !1), Y && (c0.push({
+        token: Y,
         name: F,
         line: o,
         col: s
-      }), K = !1, W || Y()), b.append(j), _ = j[j.length - 1] == "(", p += j.length;
+      }), Y = !1, W || K()), b.append(j), _ = j[j.length - 1] == "(", p += j.length;
       var P0 = j.split(/\r?\n/), J0 = P0.length - 1;
       o += J0, s += P0[0].length, J0 > 0 && (W0(), s = P0[J0].length), U = j;
     }
@@ -31456,7 +31456,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       q0(":"), k0();
     }
     var h1 = c0 ? function(j, n0) {
-      K = j, F = n0;
+      Y = j, F = n0;
     } : Mn;
     function J1() {
       return W && W0(), b.toString();
@@ -34331,8 +34331,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         if (y === e) {
           var L;
           if (_.name && (_ instanceof Tr && !Bo(r.option("keep_classnames"), (L = _.name.definition()).name) || _ instanceof he && !Bo(r.option("keep_fnames"), (L = _.name.definition()).name)) && (!s.has(L.id) || L.orig.length > 1) && (_.name = null), _ instanceof u1 && !(_ instanceof li))
-            for (var C = !r.option("keep_fargs"), U = _.argnames, K = U.length; --K >= 0; ) {
-              var F = U[K];
+            for (var C = !r.option("keep_fargs"), U = _.argnames, Y = U.length; --Y >= 0; ) {
+              var F = U[Y];
               F instanceof P1 && (F = F.expression), F instanceof Tn && (F = F.left), !(F instanceof me) && !s.has(F.definition().id) ? (An(F, xi), C && U.pop()) : C = !1;
             }
           if (_ instanceof Pn && _ !== e) {
@@ -34349,7 +34349,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               return k0.eliminated++, q ? Re.skip : D(ie, _);
           }
           if (_ instanceof Xe && !(W instanceof kt && W.init === _)) {
-            var c0 = !(W instanceof ge) && !(_ instanceof Mt), Y = [], W0 = [], u0 = [], q0 = [];
+            var c0 = !(W instanceof ge) && !(_ instanceof Mt), K = [], W0 = [], u0 = [], q0 = [];
             switch (_.definitions.forEach(function(k0) {
               k0.value && (k0.value = k0.value.transform(E));
               var r1 = k0.name instanceof me, $0 = r1 ? new Qo(null, { name: "<destructure>" }) : k0.name.definition();
@@ -34374,7 +34374,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
                     return;
                   }
                 }
-                k0.value ? (q0.length > 0 && (u0.length > 0 ? (q0.push(k0.value), k0.value = L1(k0.value, q0)) : Y.push(D(o1, _, {
+                k0.value ? (q0.length > 0 && (u0.length > 0 ? (q0.push(k0.value), k0.value = L1(k0.value, q0)) : K.push(D(o1, _, {
                   body: L1(_, q0)
                 })), q0 = []), u0.push(k0)) : W0.push(k0);
               } else if ($0.orig[0] instanceof Xn) {
@@ -34384,15 +34384,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
                 var $1 = k0.value && k0.value.drop_side_effect_free(r);
                 $1 && q0.push($1), $0.eliminated++;
               }
-            }), (W0.length > 0 || u0.length > 0) && (_.definitions = W0.concat(u0), Y.push(_)), q0.length > 0 && Y.push(D(o1, _, {
+            }), (W0.length > 0 || u0.length > 0) && (_.definitions = W0.concat(u0), K.push(_)), q0.length > 0 && K.push(D(o1, _, {
               body: L1(_, q0)
-            })), Y.length) {
+            })), K.length) {
               case 0:
                 return q ? Re.skip : D(ie, _);
               case 1:
-                return Y[0];
+                return K[0];
               default:
-                return q ? Re.splice(Y) : D(y1, _, { body: Y });
+                return q ? Re.splice(K) : D(y1, _, { body: K });
             }
           }
           if (_ instanceof at) {
@@ -34801,11 +34801,11 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     function f(N, L) {
       if (t.pinned() || n.pinned())
         return N;
-      for (var C, U = [], K = N.length, F = new nn(function($) {
+      for (var C, U = [], Y = N.length, F = new nn(function($) {
         if (A0)
           return $;
         if (!O0)
-          return $ !== Y[W0] ? $ : (W0++, W0 < Y.length ? te($) : (O0 = !0, Y0 = n0($, 0), Y0 === $ && (A0 = !0), $));
+          return $ !== K[W0] ? $ : (W0++, W0 < K.length ? te($) : (O0 = !0, Y0 = n0($, 0), Y0 === $ && (A0 = !0), $));
         var F0 = F.parent();
         if ($ instanceof C1 && ($.logical || $.operator != "=" && r1.equivalent_to($.left)) || $ instanceof On || $ instanceof i1 && r1 instanceof d1 && r1.equivalent_to($.expression) || ($ instanceof i1 || $ instanceof d1) && $.optional || $ instanceof pi || $ instanceof me || $ instanceof P1 && $.expression instanceof F1 && ($.expression instanceof Wt || $.expression.definition().references.length > 1) || $ instanceof In && !($ instanceof at) || $ instanceof rr || $ instanceof mn || $ instanceof fn || $ instanceof dn || $ instanceof pt || $ instanceof V1 || F0 instanceof at && $ !== F0.init || !e1 && $ instanceof S0 && !$.is_declared(L) && !ou.has($) || $ instanceof S0 && F0 instanceof i1 && Qt(F0, hs) || $ instanceof Ue && $.key instanceof C0)
           return A0 = !0, $;
@@ -34837,17 +34837,17 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         if (A0)
           return $;
         if (!O0)
-          return $ !== Y[W0] ? $ : (W0++, W0 < Y.length ? void 0 : (O0 = !0, $));
+          return $ !== K[W0] ? $ : (W0++, W0 < K.length ? void 0 : (O0 = !0, $));
         if ($ instanceof S0 && $.name == J1.name)
           return --D0 || (A0 = !0), ls($, c0.parent()) ? $ : (J1.replaced++, q0.replaced--, u0.value);
         if ($ instanceof gs || $ instanceof A1)
           return $;
-      }); --K >= 0; ) {
-        K == 0 && L.option("unused") && J();
-        var Y = [];
-        for (j(N[K]); U.length > 0; ) {
-          Y = U.pop();
-          var W0 = 0, u0 = Y[Y.length - 1], q0 = null, Y0 = null, k0 = null, r1 = P0(u0);
+      }); --Y >= 0; ) {
+        Y == 0 && L.option("unused") && J();
+        var K = [];
+        for (j(N[Y]); U.length > 0; ) {
+          K = U.pop();
+          var W0 = 0, u0 = K[K.length - 1], q0 = null, Y0 = null, k0 = null, r1 = P0(u0);
           if (!(!r1 || EO(r1) || r1.has_side_effects(L))) {
             var $0 = b1(u0), xe = m1(r1);
             r1 instanceof S0 && $0.set(r1.name, { def: r1.definition(), modified: !1 });
@@ -34857,7 +34857,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
                 C[$].transform(F);
               R0 = !0;
             }
-            for (var h1 = K; !A0 && h1 < N.length; h1++)
+            for (var h1 = Y; !A0 && h1 < N.length; h1++)
               N[h1].transform(F);
             if (q0) {
               var J1 = u0.name.definition();
@@ -34865,12 +34865,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
                 D0 = !1;
               else {
                 A0 = !1, W0 = 0, O0 = M0;
-                for (var h1 = K; !A0 && h1 < N.length; h1++)
+                for (var h1 = Y; !A0 && h1 < N.length; h1++)
                   N[h1].transform(c0);
                 q0.single_use = !1;
               }
             }
-            D0 && !g1(u0) && N.splice(K, 1);
+            D0 && !g1(u0) && N.splice(Y, 1);
           }
         }
       }
@@ -34883,7 +34883,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             var j0 = $.body[F0];
             if (j0 instanceof ir) {
               if (!O0) {
-                if (j0 !== Y[W0])
+                if (j0 !== K[W0])
                   continue;
                 W0++;
               }
@@ -34966,8 +34966,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         }
       }
       function j($) {
-        if (Y.push($), $ instanceof C1)
-          !$.left.has_side_effects(L) && !($.right instanceof nt) && U.push(Y.slice()), j($.right);
+        if (K.push($), $ instanceof C1)
+          !$.left.has_side_effects(L) && !($.right instanceof nt) && U.push(K.slice()), j($.right);
         else if ($ instanceof f0)
           j($.left), j($.right);
         else if ($ instanceof i1 && !Qt($, hs))
@@ -34981,8 +34981,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           for (Q0 < 0 && (Q0 = 0); Q0 < F0; Q0++)
             j($.definitions[Q0]);
         } else
-          $ instanceof Jp ? (j($.condition), $.body instanceof ot || j($.body)) : $ instanceof Yt ? $.value && j($.value) : $ instanceof at ? ($.init && j($.init), $.condition && j($.condition), $.step && j($.step), $.body instanceof ot || j($.body)) : $ instanceof kt ? (j($.object), $.body instanceof ot || j($.body)) : $ instanceof ne ? (j($.condition), $.body instanceof ot || j($.body), $.alternative && !($.alternative instanceof ot) && j($.alternative)) : $ instanceof B1 ? $.expressions.forEach(j) : $ instanceof o1 ? j($.body) : $ instanceof St ? (j($.expression), $.body.forEach(j)) : $ instanceof qe ? ($.operator == "++" || $.operator == "--") && U.push(Y.slice()) : $ instanceof Me && $.value && !($.value instanceof nt) && (U.push(Y.slice()), j($.value));
-        Y.pop();
+          $ instanceof Jp ? (j($.condition), $.body instanceof ot || j($.body)) : $ instanceof Yt ? $.value && j($.value) : $ instanceof at ? ($.init && j($.init), $.condition && j($.condition), $.step && j($.step), $.body instanceof ot || j($.body)) : $ instanceof kt ? (j($.object), $.body instanceof ot || j($.body)) : $ instanceof ne ? (j($.condition), $.body instanceof ot || j($.body), $.alternative && !($.alternative instanceof ot) && j($.alternative)) : $ instanceof B1 ? $.expressions.forEach(j) : $ instanceof o1 ? j($.body) : $ instanceof St ? (j($.expression), $.body.forEach(j)) : $ instanceof qe ? ($.operator == "++" || $.operator == "--") && U.push(K.slice()) : $ instanceof Me && $.value && !($.value instanceof nt) && (U.push(K.slice()), j($.value));
+        K.pop();
       }
       function n0($, F0, Q0) {
         var j0 = F.parent(F0);
@@ -35048,7 +35048,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           return !0;
         }
         var Le = !1;
-        return N[K].transform(new nn(function(D1, Ze, it) {
+        return N[Y].transform(new nn(function(D1, Ze, it) {
           if (Le)
             return D1;
           if (D1 === $ || D1.body === $)
@@ -35125,69 +35125,69 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       }
     }
     function m(N, L) {
-      var C = L.self(), U = k0(N), K = C instanceof u1;
+      var C = L.self(), U = k0(N), Y = C instanceof u1;
       const F = Math.min(N.length, 500);
       for (var c0 = F; --c0 >= 0; ) {
-        var Y = N[c0], W0 = e1(c0), u0 = N[W0];
-        if (K && !u0 && Y instanceof $e) {
-          if (!Y.value) {
+        var K = N[c0], W0 = e1(c0), u0 = N[W0];
+        if (Y && !u0 && K instanceof $e) {
+          if (!K.value) {
             o = !0, N.splice(c0, 1);
             continue;
           }
-          if (Y.value instanceof M1 && Y.value.operator == "void") {
-            o = !0, N[c0] = D(o1, Y, {
-              body: Y.value.expression
+          if (K.value instanceof M1 && K.value.operator == "void") {
+            o = !0, N[c0] = D(o1, K, {
+              body: K.value.expression
             });
             continue;
           }
         }
-        if (Y instanceof ne) {
+        if (K instanceof ne) {
           let M0, O0;
-          if (M0 = xn(Y.body), $0(M0) && (O0 = j1(Y.body, M0))) {
-            M0.label && Do(M0.label.thedef.references, M0), o = !0, Y = Y.clone(), Y.condition = Y.condition.negate(L), Y.body = D(y1, Y, {
-              body: H2(Y.alternative).concat(xe())
-            }), Y.alternative = D(y1, Y, {
+          if (M0 = xn(K.body), $0(M0) && (O0 = j1(K.body, M0))) {
+            M0.label && Do(M0.label.thedef.references, M0), o = !0, K = K.clone(), K.condition = K.condition.negate(L), K.body = D(y1, K, {
+              body: H2(K.alternative).concat(xe())
+            }), K.alternative = D(y1, K, {
               body: O0
-            }), N[c0] = Y.transform(L);
+            }), N[c0] = K.transform(L);
             continue;
           }
-          if (M0 = xn(Y.alternative), $0(M0) && (O0 = j1(Y.alternative, M0))) {
-            M0.label && Do(M0.label.thedef.references, M0), o = !0, Y = Y.clone(), Y.body = D(y1, Y.body, {
-              body: H2(Y.body).concat(xe())
-            }), Y.alternative = D(y1, Y.alternative, {
+          if (M0 = xn(K.alternative), $0(M0) && (O0 = j1(K.alternative, M0))) {
+            M0.label && Do(M0.label.thedef.references, M0), o = !0, K = K.clone(), K.body = D(y1, K.body, {
+              body: H2(K.body).concat(xe())
+            }), K.alternative = D(y1, K.alternative, {
               body: O0
-            }), N[c0] = Y.transform(L);
+            }), N[c0] = K.transform(L);
             continue;
           }
         }
-        if (Y instanceof ne && Y.body instanceof $e) {
-          var q0 = Y.body.value;
-          if (!q0 && !Y.alternative && (K && !u0 || u0 instanceof $e && !u0.value)) {
-            o = !0, N[c0] = D(o1, Y.condition, {
-              body: Y.condition
+        if (K instanceof ne && K.body instanceof $e) {
+          var q0 = K.body.value;
+          if (!q0 && !K.alternative && (Y && !u0 || u0 instanceof $e && !u0.value)) {
+            o = !0, N[c0] = D(o1, K.condition, {
+              body: K.condition
             });
             continue;
           }
-          if (q0 && !Y.alternative && u0 instanceof $e && u0.value) {
-            o = !0, Y = Y.clone(), Y.alternative = u0, N[c0] = Y.transform(L), N.splice(W0, 1);
+          if (q0 && !K.alternative && u0 instanceof $e && u0.value) {
+            o = !0, K = K.clone(), K.alternative = u0, N[c0] = K.transform(L), N.splice(W0, 1);
             continue;
           }
-          if (q0 && !Y.alternative && (!u0 && K && U || u0 instanceof $e)) {
-            o = !0, Y = Y.clone(), Y.alternative = u0 || D($e, Y, {
+          if (q0 && !K.alternative && (!u0 && Y && U || u0 instanceof $e)) {
+            o = !0, K = K.clone(), K.alternative = u0 || D($e, K, {
               value: null
-            }), N[c0] = Y.transform(L), u0 && N.splice(W0, 1);
+            }), N[c0] = K.transform(L), u0 && N.splice(W0, 1);
             continue;
           }
           var Y0 = N[$1(c0)];
-          if (L.option("sequences") && K && !Y.alternative && Y0 instanceof ne && Y0.body instanceof $e && e1(W0) == N.length && u0 instanceof o1) {
-            o = !0, Y = Y.clone(), Y.alternative = D(y1, u0, {
+          if (L.option("sequences") && Y && !K.alternative && Y0 instanceof ne && Y0.body instanceof $e && e1(W0) == N.length && u0 instanceof o1) {
+            o = !0, K = K.clone(), K.alternative = D(y1, u0, {
               body: [
                 u0,
                 D($e, u0, {
                   value: null
                 })
               ]
-            }), N[c0] = Y.transform(L), N.splice(W0, 1);
+            }), N[c0] = K.transform(L), N.splice(W0, 1);
             continue;
           }
         }
@@ -35212,7 +35212,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             return !1;
         }
         var R0 = M0 instanceof rr ? L.loopcontrol_target(M0) : null;
-        return M0 instanceof $e && K && r1(M0.value) || M0 instanceof wi && C === _b(R0) || M0 instanceof Ln && R0 instanceof y1 && C === R0;
+        return M0 instanceof $e && Y && r1(M0.value) || M0 instanceof wi && C === _b(R0) || M0 instanceof Ln && R0 instanceof y1 && C === R0;
       }
       function xe() {
         var M0 = N.slice(c0 + 1);
@@ -35245,15 +35245,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       }
     }
     function E(N, L) {
-      for (var C, U = L.self(), K = 0, F = 0, c0 = N.length; K < c0; K++) {
-        var Y = N[K];
-        if (Y instanceof rr) {
-          var W0 = L.loopcontrol_target(Y);
-          Y instanceof Ln && !(W0 instanceof In) && _b(W0) === U || Y instanceof wi && _b(W0) === U ? Y.label && Do(Y.label.thedef.references, Y) : N[F++] = Y;
+      for (var C, U = L.self(), Y = 0, F = 0, c0 = N.length; Y < c0; Y++) {
+        var K = N[Y];
+        if (K instanceof rr) {
+          var W0 = L.loopcontrol_target(K);
+          K instanceof Ln && !(W0 instanceof In) && _b(W0) === U || K instanceof wi && _b(W0) === U ? K.label && Do(K.label.thedef.references, K) : N[F++] = K;
         } else
-          N[F++] = Y;
-        if (xn(Y)) {
-          C = N.slice(K + 1);
+          N[F++] = K;
+        if (xn(K)) {
+          C = N.slice(Y + 1);
           break;
         }
       }
@@ -35268,27 +35268,27 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       if (N.length < 2)
         return;
       var C = [], U = 0;
-      function K() {
+      function Y() {
         if (C.length) {
           var u0 = L1(C[0], C);
           N[U++] = D(o1, u0, { body: u0 }), C = [];
         }
       }
       for (var F = 0, c0 = N.length; F < c0; F++) {
-        var Y = N[F];
-        if (Y instanceof o1) {
-          C.length >= L.sequences_limit && K();
-          var W0 = Y.body;
+        var K = N[F];
+        if (K instanceof o1) {
+          C.length >= L.sequences_limit && Y();
+          var W0 = K.body;
           C.length > 0 && (W0 = W0.drop_side_effect_free(L)), W0 && GM(C, W0);
         } else
-          Y instanceof Xe && x(Y) || Y instanceof Ce || K(), N[U++] = Y;
+          K instanceof Xe && x(K) || K instanceof Ce || Y(), N[U++] = K;
       }
-      K(), N.length = U, U != c0 && (o = !0);
+      Y(), N.length = U, U != c0 && (o = !0);
     }
     function _(N, L) {
       if (!(N instanceof y1))
         return N;
-      for (var C = null, U = 0, K = N.body.length; U < K; U++) {
+      for (var C = null, U = 0, Y = N.body.length; U < Y; U++) {
         var F = N.body[U];
         if (F instanceof Mt && x(F))
           L.push(F);
@@ -35303,29 +35303,29 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     function z(N, L) {
       function C(Y0) {
         U--, o = !0;
-        var k0 = K.body;
+        var k0 = Y.body;
         return L1(k0, [k0, Y0]).transform(L);
       }
-      for (var U = 0, K, F = 0; F < N.length; F++) {
+      for (var U = 0, Y, F = 0; F < N.length; F++) {
         var c0 = N[F];
-        if (K && (c0 instanceof Yt ? c0.value = C(c0.value || D(Se, c0).transform(L)) : c0 instanceof at ? c0.init instanceof Xe || ft(K.body, (k0) => {
+        if (Y && (c0 instanceof Yt ? c0.value = C(c0.value || D(Se, c0).transform(L)) : c0 instanceof at ? c0.init instanceof Xe || ft(Y.body, (k0) => {
           if (k0 instanceof A1)
             return !0;
           if (k0 instanceof f0 && k0.operator === "in")
             return tn;
-        }) || (c0.init ? c0.init = C(c0.init) : (c0.init = K.body, U--, o = !0)) : c0 instanceof kt ? !(c0.init instanceof ar) && !(c0.init instanceof or) && (c0.object = C(c0.object)) : c0 instanceof ne ? c0.condition = C(c0.condition) : (c0 instanceof St || c0 instanceof fn) && (c0.expression = C(c0.expression))), L.option("conditionals") && c0 instanceof ne) {
-          var Y = [], W0 = _(c0.body, Y), u0 = _(c0.alternative, Y);
-          if (W0 !== !1 && u0 !== !1 && Y.length > 0) {
-            var q0 = Y.length;
-            Y.push(D(ne, c0, {
+        }) || (c0.init ? c0.init = C(c0.init) : (c0.init = Y.body, U--, o = !0)) : c0 instanceof kt ? !(c0.init instanceof ar) && !(c0.init instanceof or) && (c0.object = C(c0.object)) : c0 instanceof ne ? c0.condition = C(c0.condition) : (c0 instanceof St || c0 instanceof fn) && (c0.expression = C(c0.expression))), L.option("conditionals") && c0 instanceof ne) {
+          var K = [], W0 = _(c0.body, K), u0 = _(c0.alternative, K);
+          if (W0 !== !1 && u0 !== !1 && K.length > 0) {
+            var q0 = K.length;
+            K.push(D(ne, c0, {
               condition: c0.condition,
               body: W0 || D(ie, c0.body),
               alternative: u0
-            })), Y.unshift(U, 1), [].splice.apply(N, Y), F += q0, U += q0 + 1, K = null, o = !0;
+            })), K.unshift(U, 1), [].splice.apply(N, K), F += q0, U += q0 + 1, Y = null, o = !0;
             continue;
           }
         }
-        N[U++] = c0, K = c0 instanceof o1 ? c0 : null;
+        N[U++] = c0, Y = c0 instanceof o1 ? c0 : null;
       }
       N.length = U;
     }
@@ -35335,7 +35335,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         if (C.value instanceof se) {
           var U;
           if (L instanceof C1 && !L.logical ? U = [L] : L instanceof B1 && (U = L.expressions.slice()), !!U) {
-            var K = !1;
+            var Y = !1;
             do {
               var F = U[0];
               if (!(F instanceof C1) || F.operator != "=" || !(F.left instanceof d1))
@@ -35343,54 +35343,54 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               var c0 = F.left.expression;
               if (!(c0 instanceof S0) || C.name.name != c0.name || !F.right.is_constant_expression(t))
                 break;
-              var Y = F.left.property;
-              if (Y instanceof C0 && (Y = Y.evaluate(e)), Y instanceof C0)
+              var K = F.left.property;
+              if (K instanceof C0 && (K = K.evaluate(e)), K instanceof C0)
                 break;
-              Y = "" + Y;
+              K = "" + K;
               var W0 = e.option("ecma") < 2015 && e.has_directive("use strict") ? function(q0) {
-                return q0.key != Y && q0.key && q0.key.name != Y;
+                return q0.key != K && q0.key && q0.key.name != K;
               } : function(q0) {
-                return q0.key && q0.key.name != Y;
+                return q0.key && q0.key.name != K;
               };
               if (!C.value.properties.every(W0))
                 break;
               var u0 = C.value.properties.filter(function(q0) {
-                return q0.key === Y;
+                return q0.key === K;
               })[0];
               u0 ? u0.value = new B1({
                 start: u0.start,
                 expressions: [u0.value.clone(), F.right.clone()],
                 end: u0.end
               }) : C.value.properties.push(D(We, F, {
-                key: Y,
+                key: K,
                 value: F.right
-              })), U.shift(), K = !0;
+              })), U.shift(), Y = !0;
             } while (U.length);
-            return K && U;
+            return Y && U;
           }
         }
       }
     }
     function W(N) {
-      for (var L, C = 0, U = -1, K = N.length; C < K; C++) {
+      for (var L, C = 0, U = -1, Y = N.length; C < Y; C++) {
         var F = N[C], c0 = N[U];
         if (F instanceof Xe)
           c0 && c0.TYPE == F.TYPE ? (c0.definitions = c0.definitions.concat(F.definitions), o = !0) : L && L.TYPE == F.TYPE && x(F) ? (L.definitions = L.definitions.concat(F.definitions), o = !0) : (N[++U] = F, L = F);
         else if (F instanceof Yt)
           F.value = W0(F.value);
         else if (F instanceof at) {
-          var Y = q(c0, F.init);
-          Y ? (o = !0, F.init = Y.length ? L1(F.init, Y) : null, N[++U] = F) : c0 instanceof Mt && (!F.init || F.init.TYPE == c0.TYPE) ? (F.init && (c0.definitions = c0.definitions.concat(F.init.definitions)), F.init = c0, N[U] = F, o = !0) : L instanceof Mt && F.init instanceof Mt && x(F.init) ? (L.definitions = L.definitions.concat(F.init.definitions), F.init = null, N[++U] = F, o = !0) : N[++U] = F;
+          var K = q(c0, F.init);
+          K ? (o = !0, F.init = K.length ? L1(F.init, K) : null, N[++U] = F) : c0 instanceof Mt && (!F.init || F.init.TYPE == c0.TYPE) ? (F.init && (c0.definitions = c0.definitions.concat(F.init.definitions)), F.init = c0, N[U] = F, o = !0) : L instanceof Mt && F.init instanceof Mt && x(F.init) ? (L.definitions = L.definitions.concat(F.init.definitions), F.init = null, N[++U] = F, o = !0) : N[++U] = F;
         } else if (F instanceof kt)
           F.object = W0(F.object);
         else if (F instanceof ne)
           F.condition = W0(F.condition);
         else if (F instanceof o1) {
-          var Y = q(c0, F.body);
-          if (Y) {
-            if (o = !0, !Y.length)
+          var K = q(c0, F.body);
+          if (K) {
+            if (o = !0, !K.length)
               continue;
-            F.body = L1(F.body, Y);
+            F.body = L1(F.body, K);
           }
           N[++U] = F;
         } else
@@ -35508,8 +35508,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       }
       if (n.argnames.length === 1 && n.argnames[0] instanceof zt && r.args.length < 2 && !(r.args[0] instanceof P1) && F instanceof S0 && F.name === n.argnames[0].name) {
         const c0 = (r.args[0] || D(Se)).optimize(e);
-        let Y;
-        return c0 instanceof d1 && (Y = e.parent()) instanceof i1 && Y.expression === r ? L1(r, [
+        let K;
+        return c0 instanceof d1 && (K = e.parent()) instanceof i1 && K.expression === r ? L1(r, [
           D(q1, r, { value: 0 }),
           c0
         ]) : c0;
@@ -35517,8 +35517,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     }
     if (b) {
       var f, y, m = -1;
-      let F, c0, Y;
-      if (i && !n.uses_arguments && !(e.parent() instanceof V1) && !(n.name && n instanceof he) && (c0 = z(o)) && (t === n || Qt(r, Pb) || e.option("unused") && (F = t.definition()).references.length == 1 && !QM(e, F) && n.is_constant_expression(t.scope)) && !Qt(r, $M | hs) && !n.contains_this() && N() && (Y = e.find_scope()) && !Xb(Y, n) && !function() {
+      let F, c0, K;
+      if (i && !n.uses_arguments && !(e.parent() instanceof V1) && !(n.name && n instanceof he) && (c0 = z(o)) && (t === n || Qt(r, Pb) || e.option("unused") && (F = t.definition()).references.length == 1 && !QM(e, F) && n.is_constant_expression(t.scope)) && !Qt(r, $M | hs) && !n.contains_this() && N() && (K = e.find_scope()) && !Xb(K, n) && !function() {
         let u0 = 0, q0;
         for (; q0 = e.parent(u0++); ) {
           if (q0 instanceof Tn)
@@ -35528,7 +35528,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         }
         return !1;
       }() && !(f instanceof V1))
-        return An(n, zs), Y.add_child_scope(n), L1(r, K(c0)).optimize(e);
+        return An(n, zs), K.add_child_scope(n), L1(r, Y(c0)).optimize(e);
     }
     if (b && Qt(r, Pb))
       return An(n, zs), n = D(n.CTOR === Ce ? he : n.CTOR, n, n), n = n.clone(!0), n.figure_out_scope({}, {
@@ -35560,11 +35560,11 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         });
     }
     function z(F) {
-      var c0 = n.body, Y = c0.length;
+      var c0 = n.body, K = c0.length;
       if (e.option("inline") < 3)
-        return Y == 1 && _(F);
+        return K == 1 && _(F);
       F = null;
-      for (var W0 = 0; W0 < Y; W0++) {
+      for (var W0 = 0; W0 < K; W0++) {
         var u0 = c0[W0];
         if (u0 instanceof Mt) {
           if (F && !u0.definitions.every(
@@ -35580,8 +35580,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       return _(F);
     }
     function q(F, c0) {
-      for (var Y = 0, W0 = n.argnames.length; Y < W0; Y++) {
-        var u0 = n.argnames[Y];
+      for (var K = 0, W0 = n.argnames.length; K < W0; K++) {
+        var u0 = n.argnames[K];
         if (u0 instanceof Tn) {
           if (Rt(u0.left, xi))
             continue;
@@ -35603,7 +35603,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       return !0;
     }
     function W(F, c0) {
-      for (var Y = n.body.length, W0 = 0; W0 < Y; W0++) {
+      for (var K = n.body.length, W0 = 0; W0 < K; W0++) {
         var u0 = n.body[W0];
         if (u0 instanceof Mt) {
           if (!c0)
@@ -35630,16 +35630,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         else if (f instanceof S0 && f.fixed_value() instanceof A1)
           return !1;
       while (!(f instanceof A1));
-      var c0 = !(f instanceof ge) || e.toplevel.vars, Y = e.option("inline");
-      return !W(F, Y >= 3 && c0) || !q(F, Y >= 2 && c0) ? !1 : !y || y.length == 0 || !OO(n, y);
+      var c0 = !(f instanceof ge) || e.toplevel.vars, K = e.option("inline");
+      return !W(F, K >= 3 && c0) || !q(F, K >= 2 && c0) ? !1 : !y || y.length == 0 || !OO(n, y);
     }
-    function L(F, c0, Y, W0) {
-      var u0 = Y.definition();
-      f.variables.has(Y.name) || (f.variables.set(Y.name, u0), f.enclosed.push(u0), F.push(D(Me, Y, {
-        name: Y,
+    function L(F, c0, K, W0) {
+      var u0 = K.definition();
+      f.variables.has(K.name) || (f.variables.set(K.name, u0), f.enclosed.push(u0), F.push(D(Me, K, {
+        name: K,
         value: null
       })));
-      var Y0 = D(S0, Y, Y);
+      var Y0 = D(S0, K, K);
       u0.references.push(Y0), W0 && c0.push(D(C1, r, {
         operator: "=",
         logical: !1,
@@ -35648,9 +35648,9 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       }));
     }
     function C(F, c0) {
-      for (var Y = n.argnames.length, W0 = r.args.length; --W0 >= Y; )
+      for (var K = n.argnames.length, W0 = r.args.length; --W0 >= K; )
         c0.push(r.args[W0]);
-      for (W0 = Y; --W0 >= 0; ) {
+      for (W0 = K; --W0 >= 0; ) {
         var u0 = n.argnames[W0], q0 = r.args[W0];
         if (Rt(u0, xi) || !u0.name || f.conflicting_def(u0.name))
           q0 && c0.push(q0);
@@ -35662,7 +35662,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       F.reverse(), c0.reverse();
     }
     function U(F, c0) {
-      for (var Y = c0.length, W0 = 0, u0 = n.body.length; W0 < u0; W0++) {
+      for (var K = c0.length, W0 = 0, u0 = n.body.length; W0 < u0; W0++) {
         var q0 = n.body[W0];
         if (q0 instanceof Mt)
           for (var Y0 = 0, k0 = q0.definitions.length; Y0 < k0; Y0++) {
@@ -35671,7 +35671,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               (e1) => e1.name != $0.name
             )) {
               var xe = n.variables.get($0.name), j1 = D(S0, $0, $0);
-              xe.references.push(j1), c0.splice(Y++, 0, D(C1, r1, {
+              xe.references.push(j1), c0.splice(K++, 0, D(C1, r1, {
                 operator: "=",
                 logical: !1,
                 left: j1,
@@ -35681,15 +35681,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           }
       }
     }
-    function K(F) {
-      var c0 = [], Y = [];
-      if (C(c0, Y), U(c0, Y), Y.push(F), c0.length) {
+    function Y(F) {
+      var c0 = [], K = [];
+      if (C(c0, K), U(c0, K), K.push(F), c0.length) {
         const W0 = f.body.indexOf(e.parent(m - 1)) + 1;
         f.body.splice(W0, 0, D(Mt, n, {
           definitions: c0
         }));
       }
-      return Y.map((W0) => W0.clone(!0));
+      return K.map((W0) => W0.clone(!0));
     }
   }
   (function(r) {
@@ -36387,14 +36387,14 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       for (let L = 0; L < o.length; L++) {
         const C = o[L];
         for (let U = L + 1; U < o.length; U++) {
-          const K = o[U];
-          if (K.body.length === 0)
+          const Y = o[U];
+          if (Y.body.length === 0)
             continue;
-          const F = U === o.length - 1, c0 = _(K, C, !1);
-          if (c0 || F && _(K, C, !0)) {
-            !c0 && F && K.body.push(D(Ln));
-            let Y = U - 1, W0 = 0;
-            for (; Y > L && N(o[Y--]); )
+          const F = U === o.length - 1, c0 = _(Y, C, !1);
+          if (c0 || F && _(Y, C, !0)) {
+            !c0 && F && Y.body.push(D(Ln));
+            let K = U - 1, W0 = 0;
+            for (; K > L && N(o[K--]); )
               W0++;
             const u0 = o.splice(U - W0, 1 + W0);
             o.splice(L + 1, 0, ...u0), L += u0.length;
@@ -36405,10 +36405,10 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       let C = o[L];
       if (C.body.length !== 0 && xn(C))
         for (let U = L + 1; U < o.length; L++, U++) {
-          let K = o[U];
-          if (K.body.length !== 0) {
-            if (_(K, C, !1) || U === o.length - 1 && _(K, C, !0)) {
-              C.body = [], C = K;
+          let Y = o[U];
+          if (Y.body.length !== 0) {
+            if (_(Y, C, !1) || U === o.length - 1 && _(Y, C, !0)) {
+              C.body = [], C = Y;
               continue;
             }
             break;
@@ -36442,15 +36442,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           break e;
         let U = o.length - 1;
         for (; U >= 0; U--) {
-          let K = o[U];
-          if (K !== x && K.expression.has_side_effects(e))
+          let Y = o[U];
+          if (Y !== x && Y.expression.has_side_effects(e))
             break;
         }
         if (C > U) {
-          let K = L - 1;
-          for (; K >= 0 && N(o[K]); K--)
+          let Y = L - 1;
+          for (; Y >= 0 && N(o[Y]); Y--)
             ;
-          let F = Math.max(U, K) + 1, c0 = L;
+          let F = Math.max(U, Y) + 1, c0 = L;
           U > L ? (c0 = U, o[U].body = o[C].body) : x.body = o[C].body, o.splice(c0 + 1, C - c0), o.splice(F, L - F);
         }
       }
@@ -36474,8 +36474,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               C || []
             )
           }).optimize(e);
-        const K = o.indexOf(x);
-        if (o.splice(K, 1), x = null, C)
+        const Y = o.indexOf(x);
+        if (o.splice(Y, 1), x = null, C)
           return D(y1, r, {
             body: s.concat(r, C)
           }).optimize(e);
@@ -36519,7 +36519,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           })
         }).optimize(e);
       }
-      let U = "===", K = D(y1, L, {
+      let U = "===", Y = D(y1, L, {
         body: L.body
       }), F = D(y1, x, {
         body: [].concat(
@@ -36530,7 +36530,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       if (o[0] === x) {
         U = "!==";
         let c0 = F;
-        F = K, K = c0;
+        F = Y, Y = c0;
       }
       return D(y1, r, {
         body: [
@@ -36540,7 +36540,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               left: r.expression,
               right: L.expression
             }),
-            body: K,
+            body: Y,
             alternative: null
           })
         ].concat(F)
@@ -36551,11 +36551,11 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       C && !xn(C) ? C.body = C.body.concat(L.body) : ds(e, L, s);
     }
     function _(L, C, U) {
-      let K = L.body, F = C.body;
-      if (U && (K = K.concat(D(Ln))), K.length !== F.length)
+      let Y = L.body, F = C.body;
+      if (U && (Y = Y.concat(D(Ln))), Y.length !== F.length)
         return !1;
-      let c0 = D(y1, L, { body: K }), Y = D(y1, C, { body: F });
-      return c0.equivalent_to(Y);
+      let c0 = D(y1, L, { body: Y }), K = D(y1, C, { body: F });
+      return c0.equivalent_to(K);
     }
     function z(L) {
       return D(o1, L, {
@@ -36563,13 +36563,13 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       });
     }
     function q(L) {
-      let C = !1, U = new Ot((K) => {
-        if (C || K instanceof u1 || K instanceof o1)
+      let C = !1, U = new Ot((Y) => {
+        if (C || Y instanceof u1 || Y instanceof o1)
           return !0;
-        if (!W(K, U))
+        if (!W(Y, U))
           return;
         let F = U.parent();
-        F instanceof bi && F.body[F.body.length - 1] === K || (C = !0);
+        F instanceof bi && F.body[F.body.length - 1] === Y || (C = !0);
       });
       return L.walk(U), C;
     }
@@ -36836,21 +36836,21 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         try {
           var W0 = "n(function(" + r.args.slice(0, -1).map(function(u0) {
             return u0.value;
-          }).join(",") + "){" + r.args[r.args.length - 1].value + "})", K = Za(W0), F = e.mangle_options();
-          K.figure_out_scope(F);
+          }).join(",") + "){" + r.args[r.args.length - 1].value + "})", Y = Za(W0), F = e.mangle_options();
+          Y.figure_out_scope(F);
           var c0 = new RO(e.options, {
             mangle_options: e._mangle_options
           });
-          K = K.transform(c0), K.figure_out_scope(F), K.compute_char_frequency(F), K.mangle_names(F);
-          var Y;
-          ft(K, (u0) => {
+          Y = Y.transform(c0), Y.figure_out_scope(F), Y.compute_char_frequency(F), Y.mangle_names(F);
+          var K;
+          ft(Y, (u0) => {
             if (su(u0))
-              return Y = u0, tn;
+              return K = u0, tn;
           });
           var W0 = XM();
-          return y1.prototype._codegen.call(Y, Y, W0), r.args = [
+          return y1.prototype._codegen.call(K, K, W0), r.args = [
             D(I1, r, {
-              value: Y.argnames.map(function(u0) {
+              value: K.argnames.map(function(u0) {
                 return u0.print_to_string();
               }).join(",")
             }),
@@ -36981,8 +36981,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
     function n(U) {
       if (t()) {
         U && (r.operator = U);
-        var K = r.left;
-        r.left = r.right, r.right = K;
+        var Y = r.left;
+        r.left = r.right, r.right = Y;
       }
     }
     if (e.option("lhs_constants") && zg.has(r.operator) && r.right.is_constant() && !r.left.is_constant() && (r.left instanceof f0 && vn[r.left.operator] >= vn[r.operator] || n()), r = r.lift_sequences(e), e.option("comparisons"))
@@ -37010,16 +37010,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               const U = (W0) => D(M1, W0, {
                 operator: "!",
                 expression: W0
-              }), K = (W0, u0) => u0 ? e.in_boolean_context() ? W0 : U(U(W0)) : U(W0);
+              }), Y = (W0, u0) => u0 ? e.in_boolean_context() ? W0 : U(U(W0)) : U(W0);
               if (r.left instanceof q1 && r.left.value === 0)
-                return K(r.right, r.operator[0] === "!");
+                return Y(r.right, r.operator[0] === "!");
               if (r.right instanceof q1 && r.right.value === 0)
-                return K(r.left, r.operator[0] === "!");
-              let F, c0, Y;
-              if ((F = r.left instanceof f0 ? r.left : r.right instanceof f0 ? r.right : null) && (Y = F === r.left ? r.right : r.left) && F.operator === "&" && Y instanceof q1 && Y.is_32_bit_integer() && (c0 = F.left.equivalent_to(Y) ? F.right : F.right.equivalent_to(Y) ? F.left : null)) {
-                let W0 = K(D(f0, r, {
+                return Y(r.left, r.operator[0] === "!");
+              let F, c0, K;
+              if ((F = r.left instanceof f0 ? r.left : r.right instanceof f0 ? r.right : null) && (K = F === r.left ? r.right : r.left) && F.operator === "&" && K instanceof q1 && K.is_32_bit_integer() && (c0 = F.left.equivalent_to(K) ? F.right : F.right.equivalent_to(K) ? F.left : null)) {
+                let W0 = Y(D(f0, r, {
                   operator: "&",
-                  left: Y,
+                  left: K,
                   right: D(M1, r, {
                     operator: "~",
                     expression: c0
@@ -37288,12 +37288,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           })));
       }
       if (e3.has(r.operator)) {
-        let U, K, F, c0, Y = r.left;
-        if (r.operator === "&" && r.right instanceof f0 && r.right.operator === "|" && typeof (K = r.left.evaluate(e)) == "number" && (typeof (U = r.right.right.evaluate(e)) == "number" ? (F = r.right.left, c0 = r.right.right) : typeof (U = r.right.left.evaluate(e)) == "number" && (F = r.right.right, c0 = r.right.left), F && c0))
-          if (!(U & K))
+        let U, Y, F, c0, K = r.left;
+        if (r.operator === "&" && r.right instanceof f0 && r.right.operator === "|" && typeof (Y = r.left.evaluate(e)) == "number" && (typeof (U = r.right.right.evaluate(e)) == "number" ? (F = r.right.left, c0 = r.right.right) : typeof (U = r.right.left.evaluate(e)) == "number" && (F = r.right.right, c0 = r.right.left), F && c0))
+          if (!(U & Y))
             r = D(f0, r, {
               operator: r.operator,
-              left: Y,
+              left: K,
               right: F
             });
           else {
@@ -37302,9 +37302,9 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               left: D(f0, r, {
                 operator: "&",
                 left: F,
-                right: Y
+                right: K
               }),
-              right: jt(U & K, c0)
+              right: jt(U & Y, c0)
             });
             r = hn(e, r, $0);
           }
@@ -38093,7 +38093,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       function U(X) {
         return X.startsWith("/");
       }
-      function K(X) {
+      function Y(X) {
         return X.startsWith("file:");
       }
       function F(X) {
@@ -38103,7 +38103,7 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
         const V = W.exec(X);
         return W0(V[1], V[2] || "", V[3], V[4] || "", V[5] || "/", V[6] || "", V[7] || "");
       }
-      function Y(X) {
+      function K(X) {
         const V = N.exec(X), e0 = V[2];
         return W0("file:", "", V[1] || "", "", U(e0) ? e0 : "/" + e0, V[3] || "", V[4] || "");
       }
@@ -38128,8 +38128,8 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
           const e0 = c0("http://foo.com" + X);
           return e0.scheme = "", e0.host = "", e0.type = 5, e0;
         }
-        if (K(X))
-          return Y(X);
+        if (Y(X))
+          return K(X);
         if (L(X))
           return c0(X);
         const V = c0("http://foo.com/" + X);
@@ -60453,21 +60453,21 @@ Input files:
       const q = this._parserSingleExpression(b), W = this._parserSingleExpression(f), N = y ? this._parserSingleExpression(y) : "", L = this._parserBlockLine(i, t, !1, !0);
       Kr.includes(s) && (s = `$${s}`);
       const C = `var ${E} = Date.now()`;
-      let K = `for (let ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${_}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
+      let Y = `for (let ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${_}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
             if (Date.now() - ${E} > 500) {
                 throw new Error('${p1.loopRuntimeErr}')
             }
             ${x}++
             ${L}
         }`;
-      return K = `${C};
+      return Y = `${C};
         ${m ? "" : `var ${x} = 0`};
         const ${_} = ${W};
         const ${z} = (${q})>${_} ? 1 : -1;
-        ${K}`, t || this._codesCol[this._blockCount].push({
-        code: K,
+        ${Y}`, t || this._codesCol[this._blockCount].push({
+        code: Y,
         depends: this._getDepends(T)
-      }), this._isInLoop = m, t ? this._functionalProcess(K, o) : K;
+      }), this._isInLoop = m, t ? this._functionalProcess(Y, o) : Y;
     }
     _parserAgainAssign(e) {
       const { operator: t, name: n, value: i } = e, { varPos: s, declare: o } = n, p = `$againAssign${this._blockCount}`;
@@ -76413,12 +76413,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             const _ = x.args.params || [], z = { ...E }, q = this._getMethodTypes([z], [o[T]]) || [], W = q[0];
             if (this._types.has(W)) {
               if (x.name.includes(".")) {
-                const L = x.name.split("."), C = L.pop(), U = L.join("."), K = this._getMethodFiledType(q, U, e), F = this._getOriginMethodName(K, C);
+                const L = x.name.split("."), C = L.pop(), U = L.join("."), Y = this._getMethodFiledType(q, U, e), F = this._getOriginMethodName(Y, C);
                 return this._buildinFunctions.has(F) ? x.name = F : x.name = C, z.ctx = o[T], _.unshift({
                   ruleType: b0.Name,
                   hasMethod: !0,
                   exprs: [z, U],
-                  type: K
+                  type: Y
                 }), x.args.params = _, x;
               } else
                 y = T, E.isType = !0;
@@ -78435,16 +78435,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             case "any matrix type":
               if (this._isMatrixType(m)) {
                 if (T === "id2") {
-                  const K = this._getArrayType(i?.type);
-                  if (!K)
+                  const Y = this._getArrayType(i?.type);
+                  if (!Y)
                     return;
                   const F = this._getArrayType(m) || "";
-                  if (K !== F)
+                  if (Y !== F)
                     return y0(_0.typeMismatch, {
                       operator: n,
                       index: T,
                       typeE: F,
-                      typeR: K
+                      typeR: Y
                     });
                 }
               } else
@@ -78458,16 +78458,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             case "any array type":
               if (this._isArrayType(m)) {
                 if (T === "id2") {
-                  const K = this._getArrayType(i?.type);
-                  if (!K)
+                  const Y = this._getArrayType(i?.type);
+                  if (!Y)
                     return;
                   const F = this._getArrayType(m) || "";
-                  if (K !== F)
+                  if (Y !== F)
                     return y0(_0.typeMismatch, {
                       operator: n,
                       index: T,
                       typeE: F,
-                      typeR: K
+                      typeR: Y
                     });
                 }
               } else
@@ -78492,16 +78492,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             case "any map type":
               if (this._isMapType(m)) {
                 if (T === "id2") {
-                  const K = this._getMapType(i?.type);
-                  if (!K)
+                  const Y = this._getMapType(i?.type);
+                  if (!Y)
                     return;
                   const F = this._getMapType(m) || [];
-                  if (K[0] !== F[0] || K[1] !== F[1])
+                  if (Y[0] !== F[0] || Y[1] !== F[1])
                     return y0(_0.mapKeyValErr, {
                       typeA: this._typeAddSeries(F[0]),
                       typeB: this._typeAddSeries(F[1]),
-                      typeC: this._typeAddSeries(K[0]),
-                      typeD: this._typeAddSeries(K[1]),
+                      typeC: this._typeAddSeries(Y[0]),
+                      typeD: this._typeAddSeries(Y[1]),
                       name: n
                     });
                 }
@@ -78543,12 +78543,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               break;
             case "variable, object or function of series int/float/bool/string/color, or a tuple of these":
               if (b === b0.Brackethesized) {
-                for (const K of f)
-                  if (!E.includes(K.type) && K.type !== I.UNDETERMINED)
+                for (const Y of f)
+                  if (!E.includes(Y.type) && Y.type !== I.UNDETERMINED)
                     return y0(_0.requestArgsErr, {
                       name: n,
                       argName: T,
-                      type: K.type
+                      type: Y.type
                     });
               }
               break;
@@ -78602,15 +78602,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             default:
               const U = this._removePrefix(e.type);
               if (e.arg && e.arg.isArg && !o) {
-                const K = E.find((F) => F.endsWith(U));
-                if (K) {
-                  e.type = K, e.arg.type = K;
+                const Y = E.find((F) => F.endsWith(U));
+                if (Y) {
+                  e.type = Y, e.arg.type = Y;
                   return;
                 }
               }
               if (E.length === 1 && this._removePrefix(E[0]) === U) {
-                const K = this._getPrefix(e.type), F = this._getPrefix(E[0]);
-                if (Qr.indexOf(K) >= Qr.indexOf(F))
+                const Y = this._getPrefix(e.type), F = this._getPrefix(E[0]);
+                if (Qr.indexOf(Y) >= Qr.indexOf(F))
                   return;
               }
               if (x)
@@ -78694,9 +78694,9 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             if (C.length !== x.length)
               _ = U.ctx;
             else
-              for (const [K, F] of x.entries())
-                if (this._compareType(C[K], F, !0))
-                  (C[K].includes(I.FLOAT) && !F.includes(I.FLOAT) || x[K] === `${I.SIMPLE} ${I.NA}` || x[K] === I.UNDETERMINED && C[K] !== `${I.SIMPLE} ${I.NA}`) && (x[K] = C[K]);
+              for (const [Y, F] of x.entries())
+                if (this._compareType(C[Y], F, !0))
+                  (C[Y].includes(I.FLOAT) && !F.includes(I.FLOAT) || x[Y] === `${I.SIMPLE} ${I.NA}` || x[Y] === I.UNDETERMINED && C[Y] !== `${I.SIMPLE} ${I.NA}`) && (x[Y] = C[Y]);
                 else {
                   _ = U.ctx;
                   break;
@@ -78951,26 +78951,28 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       this._isInLoop = !0;
       const E = `$start${this._count + 1}`;
       m || (this._count += 1);
-      const x = `$$count${this._count}`, T = `$forTo${this._blockCount}`, _ = `$$toCount${p.start.tokenIndex}`, z = `_$sign${p.start.tokenIndex}`;
+      const x = `$$count${this._count}`, T = `$forTo${this._blockCount}`, _ = `$$toCount${p.start.tokenIndex}`, z = `_$sign${p.start.tokenIndex}`, q = `_$step${p.start.tokenIndex}`;
       t || (this._dependsObj[T] = /* @__PURE__ */ new Map());
-      const q = this._parserSingleExpression(b), W = this._parserSingleExpression(f), N = y ? this._parserSingleExpression(y) : "", L = this._parserBlockLine(i, t, !1, !0);
+      const W = this._parserSingleExpression(b), N = this._parserSingleExpression(f), L = y ? this._parserSingleExpression(y) : "", C = this._parserBlockLine(i, t, !1, !0);
       Fe.includes(s) && (s = `$${s}`);
-      const C = `var ${E} = Date.now()`;
-      let K = `for (let ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${_}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
+      const U = `var ${E} = Date.now()`;
+      let F = `for (let ${s}=${W};${s} * ${z} >= ${_}; ${s}-=${q}){
             if (Date.now() - ${E} > 500) {
                 throw new Error('${_0.loopRuntimeErr}')
             }
             ${x}++
-            ${L}
+            ${C}
         }`;
-      return K = `${C};
+      return F = `${U};
         ${m ? "" : `var ${x} = 0`};
-        const ${_} = ${W};
-        const ${z} = (${q})>${_} ? 1 : -1;
-        ${K}`, t || this._codesCol[this._blockCount].push({
-        code: K,
+        let ${_} = ${N};
+        const ${z} = (${W})>${_} ? 1 : -1;
+        ${_} = ${_}*${z};
+        const ${q} = (${L || "1"}) * ${z}
+        ${F}`, t || this._codesCol[this._blockCount].push({
+        code: F,
         depends: this._getDepends(T)
-      }), this._isInLoop = m, t ? this._functionalProcess(K, o) : K;
+      }), this._isInLoop = m, t ? this._functionalProcess(F, o) : F;
     }
     _parserForInStatement(e, t = !1) {
       const { names: n, block: i, array: s, type: o } = e, p = this._isInLoop;
@@ -80454,11 +80456,11 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             b.exportPositions.length || (N.message = _0.libraryExportErr, i.push(N));
           else if (b.exportPositions.length) {
             const L = b.exportPositions.map((C) => {
-              const { type: U, ...K } = C;
+              const { type: U, ...Y } = C;
               return {
                 message: y0(_0.exportUseErr, { type: U }),
                 type: Ye.Error,
-                ...K
+                ...Y
               };
             });
             i.push(...L);
@@ -96003,12 +96005,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             const _ = x.args.params || [], z = { ...E }, q = this._getMethodTypes([z], [o[T]]) || [], W = q[0];
             if (this._types.has(W)) {
               if (x.name.includes(".")) {
-                const L = x.name.split("."), C = L.pop(), U = L.join("."), K = this._getMethodFiledType(q, U, e), F = this._getOriginMethodName(K, C);
+                const L = x.name.split("."), C = L.pop(), U = L.join("."), Y = this._getMethodFiledType(q, U, e), F = this._getOriginMethodName(Y, C);
                 return this._buildinFunctions.has(F) ? x.name = F : x.name = C, z.ctx = o[T], _.unshift({
                   ruleType: v0.Name,
                   hasMethod: !0,
                   exprs: [z, U],
-                  type: K
+                  type: Y
                 }), x.args.params = _, x;
               } else
                 y = T, E.isType = !0;
@@ -98022,16 +98024,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             case "any matrix type":
               if (this._isMatrixType(m)) {
                 if (T === "id2") {
-                  const K = this._getArrayType(i?.type);
-                  if (!K)
+                  const Y = this._getArrayType(i?.type);
+                  if (!Y)
                     return;
                   const F = this._getArrayType(m) || "";
-                  if (K !== F)
+                  if (Y !== F)
                     return g0(d0.typeMismatch, {
                       operator: n,
                       index: T,
                       typeE: F,
-                      typeR: K
+                      typeR: Y
                     });
                 }
               } else
@@ -98045,16 +98047,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             case "any array type":
               if (this._isArrayType(m)) {
                 if (T === "id2") {
-                  const K = this._getArrayType(i?.type);
-                  if (!K)
+                  const Y = this._getArrayType(i?.type);
+                  if (!Y)
                     return;
                   const F = this._getArrayType(m) || "";
-                  if (K !== F)
+                  if (Y !== F)
                     return g0(d0.typeMismatch, {
                       operator: n,
                       index: T,
                       typeE: F,
-                      typeR: K
+                      typeR: Y
                     });
                 }
               } else
@@ -98079,16 +98081,16 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             case "any map type":
               if (this._isMapType(m)) {
                 if (T === "id2") {
-                  const K = this._getMapType(i?.type);
-                  if (!K)
+                  const Y = this._getMapType(i?.type);
+                  if (!Y)
                     return;
                   const F = this._getMapType(m) || [];
-                  if (K[0] !== F[0] || K[1] !== F[1])
+                  if (Y[0] !== F[0] || Y[1] !== F[1])
                     return g0(d0.mapKeyValErr, {
                       typeA: this._typeAddSeries(F[0]),
                       typeB: this._typeAddSeries(F[1]),
-                      typeC: this._typeAddSeries(K[0]),
-                      typeD: this._typeAddSeries(K[1]),
+                      typeC: this._typeAddSeries(Y[0]),
+                      typeD: this._typeAddSeries(Y[1]),
                       name: n
                     });
                 }
@@ -98129,12 +98131,12 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
               break;
             case "variable, object or function of series int/float/bool/string/color/enum, or a tuple of these":
               if (b === v0.Brackethesized) {
-                for (const K of f)
-                  if (!E.includes(K.type) && K.type !== P.UNDETERMINED)
+                for (const Y of f)
+                  if (!E.includes(Y.type) && Y.type !== P.UNDETERMINED)
                     return g0(d0.requestArgsErr, {
                       name: n,
                       argName: T,
-                      type: K.type
+                      type: Y.type
                     });
               }
               break;
@@ -98189,15 +98191,15 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             default:
               const U = this._removePrefix(e.type);
               if (e.arg && e.arg.isArg && !o) {
-                const K = E.find((F) => F.endsWith(U));
-                if (K) {
-                  e.type = K, e.arg.type = K;
+                const Y = E.find((F) => F.endsWith(U));
+                if (Y) {
+                  e.type = Y, e.arg.type = Y;
                   return;
                 }
               }
               if (E.length === 1 && this._removePrefix(E[0]) === U) {
-                const K = this._getPrefix(e.type), F = this._getPrefix(E[0]);
-                if (Zr.indexOf(K) >= Zr.indexOf(F))
+                const Y = this._getPrefix(e.type), F = this._getPrefix(E[0]);
+                if (Zr.indexOf(Y) >= Zr.indexOf(F))
                   return;
               }
               if (x)
@@ -98281,9 +98283,9 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             if (C.length !== x.length)
               _ = U.ctx;
             else
-              for (const [K, F] of x.entries())
-                if (this._compareType(C[K], F))
-                  (C[K].includes(P.FLOAT) && !F.includes(P.FLOAT) || x[K] === `${P.SIMPLE} ${P.NA}` || x[K] === P.UNDETERMINED && C[K] !== `${P.SIMPLE} ${P.NA}`) && (x[K] = C[K]);
+              for (const [Y, F] of x.entries())
+                if (this._compareType(C[Y], F))
+                  (C[Y].includes(P.FLOAT) && !F.includes(P.FLOAT) || x[Y] === `${P.SIMPLE} ${P.NA}` || x[Y] === P.UNDETERMINED && C[Y] !== `${P.SIMPLE} ${P.NA}`) && (x[Y] = C[Y]);
                 else {
                   _ = U.ctx;
                   break;
@@ -98548,21 +98550,21 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
       const q = this._parserSingleExpression(b), W = this._parserSingleExpression(f), N = y ? this._parserSingleExpression(y) : "", L = this._parserBlockLine(i, t, !1, !0);
       ln.includes(s) && (s = `$${s}`);
       const C = `var ${E} = Date.now()`;
-      let K = `for (let ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${W}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
+      let Y = `for (let ${s}=${q};(${this._prefixNameVar}.compareDataHandle(${s}) - ${W}) * ${z} >= 0; ${s}-=(${N || "1"}) * ${z}){
             if (Date.now() - ${E} > 500) {
                 throw new Error('${d0.loopRuntimeErr}')
             }
             ${x}++
             ${L}
         }`;
-      return K = `${C};
+      return Y = `${C};
         ${m ? "" : `var ${x} = 0`};
         const ${_} = ${W};
         const ${z} = (${q})>${_} ? 1 : -1;
-        ${K}`, t || this._codesCol[this._blockCount].push({
-        code: K,
+        ${Y}`, t || this._codesCol[this._blockCount].push({
+        code: Y,
         depends: this._getDepends(T)
-      }), this._isInLoop = m, t ? this._functionalProcess(K, o) : K;
+      }), this._isInLoop = m, t ? this._functionalProcess(Y, o) : Y;
     }
     _parserForInStatement(e, t = !1) {
       const { names: n, block: i, array: s, type: o } = e, p = this._isInLoop;
@@ -99234,11 +99236,11 @@ ${this._prefixNameVar}.setCacheData("m${b}_" + ${f}, ${m})
             b.exportPositions.length || (N.message = d0.libraryExportErr, i.push(N));
           else if (b.exportPositions.length) {
             const L = b.exportPositions.map((C) => {
-              const { type: U, ...K } = C;
+              const { type: U, ...Y } = C;
               return {
                 message: g0(d0.exportUseErr, { type: U }),
                 type: Ft.Error,
-                ...K
+                ...Y
               };
             });
             i.push(...L);