a3js 0.0.54 → 1.0.0

package/dist/a3js.es.js

@@ -145,8 +145,8 @@ class Pe {
   }
   mul(e, t, n, r) {
     const s = this.x, o = this.y, c = this.z, A = this.w;
-    let a, h, u, m;
-    return typeof e == "number" ? (a = e, h = t, u = n, m = r) : (a = e.x, h = e.y, u = e.z, m = e.w), this.x = A * a + s * m + o * u - c * h, this.y = A * h - s * u + o * m + c * a, this.z = A * u + s * h - o * a + c * m, this.w = A * m - s * a - o * h - c * u, this;
+    let a, h, u, E;
+    return typeof e == "number" ? (a = e, h = t, u = n, E = r) : (a = e.x, h = e.y, u = e.z, E = e.w), this.x = A * a + s * E + o * u - c * h, this.y = A * h - s * u + o * E + c * a, this.z = A * u + s * h - o * a + c * E, this.w = A * E - s * a - o * h - c * u, this;
   }
   /**
    * 2つのクォータニオン `q1` と `q2` を線形補間し、結果をこのクォータニオンに設定します。
@@ -188,21 +188,21 @@ class Pe {
 const tt = new Pe();
 function mt(i, e, t, n) {
   t.normalize();
-  const r = i.clone().sub(e).normalize(), s = new Ae().cross(r, t).normalize(), o = new Ae().cross(s, r), c = s.x, A = o.x, a = -r.x, h = s.y, u = o.y, m = -r.y, p = s.z, E = o.z, g = -r.z;
+  const r = i.clone().sub(e).normalize(), s = new Ae().cross(r, t).normalize(), o = new Ae().cross(s, r), c = s.x, A = o.x, a = -r.x, h = s.y, u = o.y, E = -r.y, p = s.z, m = o.z, g = -r.z;
   let l, d, f, b;
   const I = c + u + g;
   if (I > 0) {
     const v = Math.sqrt(I + 1) * 2;
-    l = (E - m) / v, d = (a - p) / v, f = (h - A) / v, b = 0.25 * v;
+    l = (m - E) / v, d = (a - p) / v, f = (h - A) / v, b = 0.25 * v;
   } else if (c > u && c > g) {
     const v = Math.sqrt(1 + c - u - g) * 2;
-    l = 0.25 * v, d = (A + h) / v, f = (a + p) / v, b = (E - m) / v;
+    l = 0.25 * v, d = (A + h) / v, f = (a + p) / v, b = (m - E) / v;
   } else if (u > g) {
     const v = Math.sqrt(1 + u - c - g) * 2;
-    l = (A + h) / v, d = 0.25 * v, f = (m + E) / v, b = (a - p) / v;
+    l = (A + h) / v, d = 0.25 * v, f = (E + m) / v, b = (a - p) / v;
   } else {
     const v = Math.sqrt(1 + g - c - u) * 2;
-    l = (a + p) / v, d = (m + E) / v, f = 0.25 * v, b = (h - A) / v;
+    l = (a + p) / v, d = (E + m) / v, f = 0.25 * v, b = (h - A) / v;
   }
   const C = n ?? new Pe();
   return C.set(l, d, f, b), C;
@@ -224,8 +224,8 @@ function Qt(i, e = "ZXY", t) {
   return n;
 }
 function oo(i) {
-  const e = [[], [], []], t = i.x + i.x, n = i.y + i.y, r = i.z + i.z, s = i.x * t, o = i.x * n, c = i.x * r, A = i.y * n, a = i.y * r, h = i.z * r, u = i.w * t, m = i.w * n, p = i.w * r;
-  return e[0][0] = 1 - (A + h), e[0][1] = o - p, e[0][2] = c + m, e[1][0] = o + p, e[1][1] = 1 - (s + h), e[1][2] = a - u, e[2][0] = c - m, e[2][1] = a + u, e[2][2] = 1 - (s + A), e;
+  const e = [[], [], []], t = i.x + i.x, n = i.y + i.y, r = i.z + i.z, s = i.x * t, o = i.x * n, c = i.x * r, A = i.y * n, a = i.y * r, h = i.z * r, u = i.w * t, E = i.w * n, p = i.w * r;
+  return e[0][0] = 1 - (A + h), e[0][1] = o - p, e[0][2] = c + E, e[1][0] = o + p, e[1][1] = 1 - (s + h), e[1][2] = a - u, e[2][0] = c - E, e[2][1] = a + u, e[2][2] = 1 - (s + A), e;
 }
 const xt = (i) => Math.max(-1, Math.min(1, i));
 function fi(i, e = "ZXY", t) {
@@ -870,8 +870,8 @@ function pi(i) {
   if (t) {
     const A = t.array;
     for (let a = 0; a < A.length; a += 3) {
-      const h = A[a] * 3, u = A[a + 1] * 3, m = A[a + 2] * 3;
-      s.set(n[h], n[h + 1], n[h + 2]), o.set(n[u], n[u + 1], n[u + 2]), c.set(n[m], n[m + 1], n[m + 2]), r += s.dot(o.clone().cross(c));
+      const h = A[a] * 3, u = A[a + 1] * 3, E = A[a + 2] * 3;
+      s.set(n[h], n[h + 1], n[h + 2]), o.set(n[u], n[u + 1], n[u + 2]), c.set(n[E], n[E + 1], n[E + 2]), r += s.dot(o.clone().cross(c));
     }
   } else
     for (let A = 0; A < n.length; A += 9)
@@ -2112,18 +2112,18 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
     else throw Error("non exhaustive match");
   }
   i.forEach = u;
-  function m(F) {
+  function E(F) {
     return typeof F == "string";
   }
-  i.isString = m;
+  i.isString = E;
   function p(F) {
     return F === void 0;
   }
   i.isUndefined = p;
-  function E(F) {
+  function m(F) {
     return F instanceof Function;
   }
-  i.isFunction = E;
+  i.isFunction = m;
   function g(F, Y) {
     return Y === void 0 && (Y = 1), F.slice(Y, F.length);
   }
@@ -2515,16 +2515,16 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
       var l, d = !1;
       switch (this.popChar()) {
         case "d":
-          l = m;
+          l = E;
           break;
         case "D":
-          l = m, d = !0;
+          l = E, d = !0;
           break;
         case "s":
-          l = E;
+          l = m;
           break;
         case "S":
-          l = E, d = !0;
+          l = m, d = !0;
           break;
         case "w":
           l = p;
@@ -2809,12 +2809,12 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
     function h() {
       throw Error("Internal Error - Should never get here!");
     }
-    var u, m = [];
-    for (u = o("0"); u <= o("9"); u++) m.push(u);
-    var p = [o("_")].concat(m);
+    var u, E = [];
+    for (u = o("0"); u <= o("9"); u++) E.push(u);
+    var p = [o("_")].concat(E);
     for (u = o("a"); u <= o("z"); u++) p.push(u);
     for (u = o("A"); u <= o("Z"); u++) p.push(u);
-    var E = [o(" "), o("\f"), o(`
+    var m = [o(" "), o("\f"), o(`
 `), o("\r"), o("	"), o("\v"), o("	"), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o(" "), o("\u2028"), o("\u2029"), o(" "), o(" "), o("　"), o("\uFEFF")];
     function g() {
     }
@@ -2994,7 +2994,7 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
               throw Error("Non Exhaustive Match");
           }
           var v = C.quantifier !== void 0 && C.quantifier.atLeast === 0;
-          if (C.type === "Group" && m(C) === !1 || C.type !== "Group" && v === !1) break;
+          if (C.type === "Group" && E(C) === !1 || C.type !== "Group" && v === !1) break;
         }
         break;
       default:
@@ -3029,8 +3029,8 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
       }) !== void 0;
     });
   }
-  function m(g) {
-    return g.quantifier && g.quantifier.atLeast === 0 ? !0 : g.value ? n.isArray(g.value) ? n.every(g.value, m) : m(g.value) : !1;
+  function E(g) {
+    return g.quantifier && g.quantifier.atLeast === 0 ? !0 : g.value ? n.isArray(g.value) ? n.every(g.value, E) : E(g.value) : !1;
   }
   var p = (function(g) {
     e(l, g);
@@ -3056,7 +3056,7 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
       d.complement ? u(d, this.targetCharCodes) === void 0 && (this.found = !0) : u(d, this.targetCharCodes) !== void 0 && (this.found = !0);
     }, l;
   })(t.BaseRegExpVisitor);
-  function E(g, l) {
+  function m(g, l) {
     if (l instanceof RegExp) {
       var d = r.getRegExpAst(l), f = new p(g);
       return f.visit(d), f.found;
@@ -3064,7 +3064,7 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
       return n.contains(g, b.charCodeAt(0));
     }) !== void 0;
   }
-  i.canMatchCharCode = E;
+  i.canMatchCharCode = m;
 }), lr = ve((i) => {
   var e = i && i.__extends || /* @__PURE__ */ (function() {
     var P = function(U, W) {
@@ -3204,11 +3204,11 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
   function u(P, U) {
     var W = [], q = p(P);
     W = W.concat(q.errors);
-    var ee = E(q.valid), re = ee.valid;
-    return W = W.concat(ee.errors), W = W.concat(m(re)), W = W.concat(v(re)), W = W.concat(x(re, U)), W = W.concat(j(re)), W;
+    var ee = m(q.valid), re = ee.valid;
+    return W = W.concat(ee.errors), W = W.concat(E(re)), W = W.concat(v(re)), W = W.concat(x(re, U)), W = W.concat(j(re)), W;
   }
   i.validatePatterns = u;
-  function m(P) {
+  function E(P) {
     var U = [], W = r.filter(P, function(q) {
       return r.isRegExp(q[c]);
     });
@@ -3223,7 +3223,7 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
     return { errors: W, valid: q };
   }
   i.findMissingPatterns = p;
-  function E(P) {
+  function m(P) {
     var U = r.filter(P, function(ee) {
       var re = ee[c];
       return !r.isRegExp(re) && !r.isFunction(re) && !r.has(re, "exec") && !r.isString(re);
@@ -3232,7 +3232,7 @@ var ve = (i, e) => () => (e || (e = { exports: {} }, i(e.exports, e)), e.exports
     }), q = r.difference(P, U);
     return { errors: W, valid: q };
   }
-  i.findInvalidPatterns = E;
+  i.findInvalidPatterns = m;
   var g = /[^\\][\$]/;
   function l(P) {
     var U = (function(ee) {
@@ -3530,7 +3530,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
   i.expandCategories = s;
   function o(g) {
     e.forEach(g, function(l) {
-      h(l) || (i.tokenIdxToClass[i.tokenShortNameIdx] = l, l.tokenTypeIdx = i.tokenShortNameIdx++), u(l) && !e.isArray(l.CATEGORIES) && (l.CATEGORIES = [l.CATEGORIES]), u(l) || (l.CATEGORIES = []), m(l) || (l.categoryMatches = []), p(l) || (l.categoryMatchesMap = {});
+      h(l) || (i.tokenIdxToClass[i.tokenShortNameIdx] = l, l.tokenTypeIdx = i.tokenShortNameIdx++), u(l) && !e.isArray(l.CATEGORIES) && (l.CATEGORIES = [l.CATEGORIES]), u(l) || (l.CATEGORIES = []), E(l) || (l.categoryMatches = []), p(l) || (l.categoryMatchesMap = {});
     });
   }
   i.assignTokenDefaultProps = o;
@@ -3565,18 +3565,18 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
     return e.has(g, "CATEGORIES");
   }
   i.hasCategoriesProperty = u;
-  function m(g) {
+  function E(g) {
     return e.has(g, "categoryMatches");
   }
-  i.hasExtendingTokensTypesProperty = m;
+  i.hasExtendingTokensTypesProperty = E;
   function p(g) {
     return e.has(g, "categoryMatchesMap");
   }
   i.hasExtendingTokensTypesMapProperty = p;
-  function E(g) {
+  function m(g) {
     return e.has(g, "tokenTypeIdx");
   }
-  i.isTokenType = E;
+  i.isTokenType = m;
 }), ur = ve((i) => {
   Object.defineProperty(i, "__esModule", { value: !0 }), i.defaultLexerErrorProvider = void 0, i.defaultLexerErrorProvider = { buildUnableToPopLexerModeMessage: function(e) {
     return "Unable to pop Lexer Mode after encountering Token ->" + e.image + "<- The Mode Stack is empty";
@@ -3598,15 +3598,15 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
       if (h === void 0 && (h = o), this.lexerDefinition = a, this.lexerDefinitionErrors = [], this.lexerDefinitionWarning = [], this.patternIdxToConfig = {}, this.charCodeToPatternIdxToConfig = {}, this.modes = [], this.emptyGroups = {}, this.config = void 0, this.trackStartLines = !0, this.trackEndLines = !0, this.hasCustom = !1, this.canModeBeOptimized = {}, typeof h == "boolean") throw Error(`The second argument to the Lexer constructor is now an ILexerConfig Object.
 a boolean 2nd argument is no longer supported`);
       this.config = t.merge(o, h);
-      var m = this.config.traceInitPerf;
-      m === !0 ? (this.traceInitMaxIdent = 1 / 0, this.traceInitPerf = !0) : typeof m == "number" && (this.traceInitMaxIdent = m, this.traceInitPerf = !0), this.traceInitIndent = -1, this.TRACE_INIT("Lexer Constructor", function() {
-        var p, E = !0;
+      var E = this.config.traceInitPerf;
+      E === !0 ? (this.traceInitMaxIdent = 1 / 0, this.traceInitPerf = !0) : typeof E == "number" && (this.traceInitMaxIdent = E, this.traceInitPerf = !0), this.traceInitIndent = -1, this.TRACE_INIT("Lexer Constructor", function() {
+        var p, m = !0;
         u.TRACE_INIT("Lexer Config handling", function() {
           if (u.config.lineTerminatorsPattern === o.lineTerminatorsPattern) u.config.lineTerminatorsPattern = e.LineTerminatorOptimizedTester;
           else if (u.config.lineTerminatorCharacters === o.lineTerminatorCharacters) throw Error(`Error: Missing <lineTerminatorCharacters> property on the Lexer config.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS`);
           if (h.safeMode && h.ensureOptimizations) throw Error('"safeMode" and "ensureOptimizations" flags are mutually exclusive.');
-          u.trackStartLines = /full|onlyStart/i.test(u.config.positionTracking), u.trackEndLines = /full/i.test(u.config.positionTracking), t.isArray(a) ? (p = { modes: {} }, p.modes[e.DEFAULT_MODE] = t.cloneArr(a), p[e.DEFAULT_MODE] = e.DEFAULT_MODE) : (E = !1, p = t.cloneObj(a));
+          u.trackStartLines = /full|onlyStart/i.test(u.config.positionTracking), u.trackEndLines = /full/i.test(u.config.positionTracking), t.isArray(a) ? (p = { modes: {} }, p.modes[e.DEFAULT_MODE] = t.cloneArr(a), p[e.DEFAULT_MODE] = e.DEFAULT_MODE) : (m = !1, p = t.cloneObj(a));
         }), u.config.skipValidations === !1 && (u.TRACE_INIT("performRuntimeChecks", function() {
           u.lexerDefinitionErrors = u.lexerDefinitionErrors.concat(e.performRuntimeChecks(p, u.trackStartLines, u.config.lineTerminatorCharacters));
         }), u.TRACE_INIT("performWarningRuntimeChecks", function() {
@@ -3640,7 +3640,7 @@ a boolean 2nd argument is no longer supported`);
         t.forEach(u.lexerDefinitionWarning, function(f) {
           t.PRINT_WARNING(f.message);
         }), u.TRACE_INIT("Choosing sub-methods implementations", function() {
-          if (e.SUPPORT_STICKY ? (u.chopInput = t.IDENTITY, u.match = u.matchWithTest) : (u.updateLastIndex = t.NOOP, u.match = u.matchWithExec), E && (u.handleModes = t.NOOP), u.trackStartLines === !1 && (u.computeNewColumn = t.IDENTITY), u.trackEndLines === !1 && (u.updateTokenEndLineColumnLocation = t.NOOP), /full/i.test(u.config.positionTracking)) u.createTokenInstance = u.createFullToken;
+          if (e.SUPPORT_STICKY ? (u.chopInput = t.IDENTITY, u.match = u.matchWithTest) : (u.updateLastIndex = t.NOOP, u.match = u.matchWithExec), m && (u.handleModes = t.NOOP), u.trackStartLines === !1 && (u.computeNewColumn = t.IDENTITY), u.trackEndLines === !1 && (u.updateTokenEndLineColumnLocation = t.NOOP), /full/i.test(u.config.positionTracking)) u.createTokenInstance = u.createFullToken;
           else if (/onlyStart/i.test(u.config.positionTracking)) u.createTokenInstance = u.createStartOnlyToken;
           else if (/onlyOffset/i.test(u.config.positionTracking)) u.createTokenInstance = u.createOffsetOnlyToken;
           else throw Error('Invalid <positionTracking> config option: "' + u.config.positionTracking + '"');
@@ -3661,17 +3661,17 @@ a boolean 2nd argument is no longer supported`);
     }
     return A.prototype.tokenize = function(a, h) {
       if (h === void 0 && (h = this.defaultMode), !t.isEmpty(this.lexerDefinitionErrors)) {
-        var u = t.map(this.lexerDefinitionErrors, function(E) {
-          return E.message;
-        }), m = u.join(`-----------------------
+        var u = t.map(this.lexerDefinitionErrors, function(m) {
+          return m.message;
+        }), E = u.join(`-----------------------
 `);
         throw new Error(`Unable to Tokenize because Errors detected in definition of Lexer:
-` + m);
+` + E);
       }
       var p = this.tokenizeInternal(a, h);
       return p;
     }, A.prototype.tokenizeInternal = function(a, h) {
-      var u = this, m, p, E, g, l, d, f, b, I, C, v, x, j, R, M = a, _ = M.length, T = 0, N = 0, L = this.hasCustom ? 0 : Math.floor(a.length / 10), J = new Array(L), X = [], z = this.trackStartLines ? 1 : void 0, Z = this.trackStartLines ? 1 : void 0, ne = e.cloneEmptyGroups(this.emptyGroups), le = this.trackStartLines, oe = this.config.lineTerminatorsPattern, se = 0, $ = [], he = [], P = [], U = [];
+      var u = this, E, p, m, g, l, d, f, b, I, C, v, x, j, R, M = a, _ = M.length, T = 0, N = 0, L = this.hasCustom ? 0 : Math.floor(a.length / 10), J = new Array(L), X = [], z = this.trackStartLines ? 1 : void 0, Z = this.trackStartLines ? 1 : void 0, ne = e.cloneEmptyGroups(this.emptyGroups), le = this.trackStartLines, oe = this.config.lineTerminatorsPattern, se = 0, $ = [], he = [], P = [], U = [];
       Object.freeze(U);
       var W = void 0;
       function q() {
@@ -3702,15 +3702,15 @@ a boolean 2nd argument is no longer supported`);
       for (var Be; T < _; ) {
         l = null;
         var Ne = M.charCodeAt(T), ze = W(Ne), et = ze.length;
-        for (m = 0; m < et; m++) {
-          Be = ze[m];
+        for (E = 0; E < et; E++) {
+          Be = ze[E];
           var Ke = Be.pattern;
           d = null;
           var F = Be.short;
           if (F !== !1 ? Ne === F && (l = Ke) : Be.isCustom === !0 ? (R = Ke.exec(M, T, J, ne), R !== null ? (l = R[0], R.payload !== void 0 && (d = R.payload)) : l = null) : (this.updateLastIndex(Ke, T), l = this.match(Ke, a, T)), l !== null) {
             if (g = Be.longerAlt, g !== void 0) {
               var Y = $[g], H = Y.pattern;
-              f = null, Y.isCustom === !0 ? (R = H.exec(M, T, J, ne), R !== null ? (E = R[0], R.payload !== void 0 && (f = R.payload)) : E = null) : (this.updateLastIndex(H, T), E = this.match(H, a, T)), E && E.length > l.length && (l = E, d = f, Be = Y);
+              f = null, Y.isCustom === !0 ? (R = H.exec(M, T, J, ne), R !== null ? (m = R[0], R.payload !== void 0 && (f = R.payload)) : m = null) : (this.updateLastIndex(H, T), m = this.match(H, a, T)), m && m.length > l.length && (l = m, d = f, Be = Y);
             }
             break;
           }
@@ -3734,29 +3734,29 @@ a boolean 2nd argument is no longer supported`);
         }
       }
       return this.hasCustom || (J.length = N), { tokens: J, groups: ne, errors: X };
-    }, A.prototype.handleModes = function(a, h, u, m) {
+    }, A.prototype.handleModes = function(a, h, u, E) {
       if (a.pop === !0) {
         var p = a.push;
-        h(m), p !== void 0 && u.call(this, p);
+        h(E), p !== void 0 && u.call(this, p);
       } else a.push !== void 0 && u.call(this, a.push);
     }, A.prototype.chopInput = function(a, h) {
       return a.substring(h);
     }, A.prototype.updateLastIndex = function(a, h) {
       a.lastIndex = h;
-    }, A.prototype.updateTokenEndLineColumnLocation = function(a, h, u, m, p, E, g) {
+    }, A.prototype.updateTokenEndLineColumnLocation = function(a, h, u, E, p, m, g) {
       var l, d;
-      h !== void 0 && (l = u === g - 1, d = l ? -1 : 0, m === 1 && l === !0 || (a.endLine = p + d, a.endColumn = E - 1 + -d));
+      h !== void 0 && (l = u === g - 1, d = l ? -1 : 0, E === 1 && l === !0 || (a.endLine = p + d, a.endColumn = m - 1 + -d));
     }, A.prototype.computeNewColumn = function(a, h) {
       return a + h;
     }, A.prototype.createTokenInstance = function() {
       for (var a = [], h = 0; h < arguments.length; h++) a[h] = arguments[h];
       return null;
-    }, A.prototype.createOffsetOnlyToken = function(a, h, u, m) {
-      return { image: a, startOffset: h, tokenTypeIdx: u, tokenType: m };
-    }, A.prototype.createStartOnlyToken = function(a, h, u, m, p, E) {
-      return { image: a, startOffset: h, startLine: p, startColumn: E, tokenTypeIdx: u, tokenType: m };
-    }, A.prototype.createFullToken = function(a, h, u, m, p, E, g) {
-      return { image: a, startOffset: h, endOffset: h + g - 1, startLine: p, endLine: p, startColumn: E, endColumn: E + g - 1, tokenTypeIdx: u, tokenType: m };
+    }, A.prototype.createOffsetOnlyToken = function(a, h, u, E) {
+      return { image: a, startOffset: h, tokenTypeIdx: u, tokenType: E };
+    }, A.prototype.createStartOnlyToken = function(a, h, u, E, p, m) {
+      return { image: a, startOffset: h, startLine: p, startColumn: m, tokenTypeIdx: u, tokenType: E };
+    }, A.prototype.createFullToken = function(a, h, u, E, p, m, g) {
+      return { image: a, startOffset: h, endOffset: h + g - 1, startLine: p, endLine: p, startColumn: m, endColumn: m + g - 1, tokenTypeIdx: u, tokenType: E };
     }, A.prototype.addToken = function(a, h, u) {
       return 666;
     }, A.prototype.addTokenUsingPush = function(a, h, u) {
@@ -3770,8 +3770,8 @@ a boolean 2nd argument is no longer supported`);
     }, A.prototype.match = function(a, h, u) {
       return null;
     }, A.prototype.matchWithTest = function(a, h, u) {
-      var m = a.test(h);
-      return m === !0 ? h.substring(u, a.lastIndex) : null;
+      var E = a.test(h);
+      return E === !0 ? h.substring(u, a.lastIndex) : null;
     }, A.prototype.matchWithExec = function(a, h) {
       var u = a.exec(h);
       return u !== null ? u[0] : u;
@@ -3780,8 +3780,8 @@ a boolean 2nd argument is no longer supported`);
         this.traceInitIndent++;
         var u = new Array(this.traceInitIndent + 1).join("	");
         this.traceInitIndent < this.traceInitMaxIdent && console.log(u + "--> <" + a + ">");
-        var m = t.timer(h), p = m.time, E = m.value, g = p > 10 ? console.warn : console.log;
-        return this.traceInitIndent < this.traceInitMaxIdent && g(u + "<-- <" + a + "> time: " + p + "ms"), this.traceInitIndent--, E;
+        var E = t.timer(h), p = E.time, m = E.value, g = p > 10 ? console.warn : console.log;
+        return this.traceInitIndent < this.traceInitMaxIdent && g(u + "<-- <" + a + "> time: " + p + "ms"), this.traceInitIndent--, m;
       } else return h();
     }, A.SKIPPED = "This marks a skipped Token pattern, this means each token identified by it willbe consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.", A.NA = /NOT_APPLICABLE/, A;
   })();
@@ -3801,7 +3801,7 @@ a boolean 2nd argument is no longer supported`);
     return e.isString(I.LABEL) && I.LABEL !== "";
   }
   i.hasTokenLabel = o;
-  var c = "parent", A = "categories", a = "label", h = "group", u = "push_mode", m = "pop_mode", p = "longer_alt", E = "line_breaks", g = "start_chars_hint";
+  var c = "parent", A = "categories", a = "label", h = "group", u = "push_mode", E = "pop_mode", p = "longer_alt", m = "line_breaks", g = "start_chars_hint";
   function l(I) {
     return d(I);
   }
@@ -3810,7 +3810,7 @@ a boolean 2nd argument is no longer supported`);
     var C = I.pattern, v = {};
     if (v.name = I.name, e.isUndefined(C) || (v.PATTERN = C), e.has(I, c)) throw `The parent property is no longer supported.
 See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.`;
-    return e.has(I, A) && (v.CATEGORIES = I[A]), n.augmentTokenTypes([v]), e.has(I, a) && (v.LABEL = I[a]), e.has(I, h) && (v.GROUP = I[h]), e.has(I, m) && (v.POP_MODE = I[m]), e.has(I, u) && (v.PUSH_MODE = I[u]), e.has(I, p) && (v.LONGER_ALT = I[p]), e.has(I, E) && (v.LINE_BREAKS = I[E]), e.has(I, g) && (v.START_CHARS_HINT = I[g]), v;
+    return e.has(I, A) && (v.CATEGORIES = I[A]), n.augmentTokenTypes([v]), e.has(I, a) && (v.LABEL = I[a]), e.has(I, h) && (v.GROUP = I[h]), e.has(I, E) && (v.POP_MODE = I[E]), e.has(I, u) && (v.PUSH_MODE = I[u]), e.has(I, p) && (v.LONGER_ALT = I[p]), e.has(I, m) && (v.LINE_BREAKS = I[m]), e.has(I, g) && (v.START_CHARS_HINT = I[g]), v;
   }
   i.EOF = l({ name: "EOF", pattern: t.Lexer.NA }), n.augmentTokenTypes([i.EOF]);
   function f(I, C, v, x, j, R, M, _) {
@@ -3937,7 +3937,7 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
     return f;
   })(r);
   i.Repetition = u;
-  var m = (function(d) {
+  var E = (function(d) {
     e(f, d);
     function f(b) {
       var I = d.call(this, b.definition) || this;
@@ -3947,7 +3947,7 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
     }
     return f;
   })(r);
-  i.RepetitionWithSeparator = m;
+  i.RepetitionWithSeparator = E;
   var p = (function(d) {
     e(f, d);
     function f(b) {
@@ -3963,7 +3963,7 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
     }, enumerable: !1, configurable: !0 }), f;
   })(r);
   i.Alternation = p;
-  var E = (function() {
+  var m = (function() {
     function d(f) {
       this.idx = 1, t.assign(this, t.pick(f, function(b) {
         return b !== void 0;
@@ -3973,7 +3973,7 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
       f.visit(this);
     }, d;
   })();
-  i.Terminal = E;
+  i.Terminal = m;
   function g(d) {
     return t.map(d, l);
   }
@@ -3986,11 +3986,11 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
     if (d instanceof c) return { type: "Alternative", definition: f(d.definition) };
     if (d instanceof A) return { type: "Option", idx: d.idx, definition: f(d.definition) };
     if (d instanceof a) return { type: "RepetitionMandatory", idx: d.idx, definition: f(d.definition) };
-    if (d instanceof h) return { type: "RepetitionMandatoryWithSeparator", idx: d.idx, separator: l(new E({ terminalType: d.separator })), definition: f(d.definition) };
-    if (d instanceof m) return { type: "RepetitionWithSeparator", idx: d.idx, separator: l(new E({ terminalType: d.separator })), definition: f(d.definition) };
+    if (d instanceof h) return { type: "RepetitionMandatoryWithSeparator", idx: d.idx, separator: l(new m({ terminalType: d.separator })), definition: f(d.definition) };
+    if (d instanceof E) return { type: "RepetitionWithSeparator", idx: d.idx, separator: l(new m({ terminalType: d.separator })), definition: f(d.definition) };
     if (d instanceof u) return { type: "Repetition", idx: d.idx, definition: f(d.definition) };
     if (d instanceof p) return { type: "Alternation", idx: d.idx, definition: f(d.definition) };
-    if (d instanceof E) {
+    if (d instanceof m) {
       var b = { type: "Terminal", name: d.terminalType.name, label: n.tokenLabel(d.terminalType), idx: d.idx }, I = d.terminalType.PATTERN;
       return d.terminalType.PATTERN && (b.pattern = t.isRegExp(I) ? I.source : I), b;
     } else {
@@ -4042,8 +4042,8 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
     }, s.prototype.walkOr = function(o, c, A) {
       var a = this, h = c.concat(A);
       e.forEach(o.definition, function(u) {
-        var m = new t.Alternative({ definition: [u] });
-        a.walk(m, h);
+        var E = new t.Alternative({ definition: [u] });
+        a.walk(E, h);
       });
     }, s;
   })();
@@ -4098,86 +4098,86 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
   i.GAstVisitor = t;
 }), pn = ve((i) => {
   var e = i && i.__extends || /* @__PURE__ */ (function() {
-    var m = function(p, E) {
-      return m = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(g, l) {
+    var E = function(p, m) {
+      return E = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(g, l) {
         g.__proto__ = l;
       } || function(g, l) {
         for (var d in l) Object.prototype.hasOwnProperty.call(l, d) && (g[d] = l[d]);
-      }, m(p, E);
+      }, E(p, m);
     };
-    return function(p, E) {
-      if (typeof E != "function" && E !== null) throw new TypeError("Class extends value " + String(E) + " is not a constructor or null");
-      m(p, E);
+    return function(p, m) {
+      if (typeof m != "function" && m !== null) throw new TypeError("Class extends value " + String(m) + " is not a constructor or null");
+      E(p, m);
       function g() {
         this.constructor = p;
       }
-      p.prototype = E === null ? Object.create(E) : (g.prototype = E.prototype, new g());
+      p.prototype = m === null ? Object.create(m) : (g.prototype = m.prototype, new g());
     };
   })();
   Object.defineProperty(i, "__esModule", { value: !0 }), i.collectMethods = i.DslMethodsCollectorVisitor = i.getProductionDslName = i.isBranchingProd = i.isOptionalProd = i.isSequenceProd = void 0;
   var t = Fe(), n = nt(), r = en();
-  function s(m) {
-    return m instanceof n.Alternative || m instanceof n.Option || m instanceof n.Repetition || m instanceof n.RepetitionMandatory || m instanceof n.RepetitionMandatoryWithSeparator || m instanceof n.RepetitionWithSeparator || m instanceof n.Terminal || m instanceof n.Rule;
+  function s(E) {
+    return E instanceof n.Alternative || E instanceof n.Option || E instanceof n.Repetition || E instanceof n.RepetitionMandatory || E instanceof n.RepetitionMandatoryWithSeparator || E instanceof n.RepetitionWithSeparator || E instanceof n.Terminal || E instanceof n.Rule;
   }
   i.isSequenceProd = s;
-  function o(m, p) {
+  function o(E, p) {
     p === void 0 && (p = []);
-    var E = m instanceof n.Option || m instanceof n.Repetition || m instanceof n.RepetitionWithSeparator;
-    return E ? !0 : m instanceof n.Alternation ? t.some(m.definition, function(g) {
+    var m = E instanceof n.Option || E instanceof n.Repetition || E instanceof n.RepetitionWithSeparator;
+    return m ? !0 : E instanceof n.Alternation ? t.some(E.definition, function(g) {
       return o(g, p);
-    }) : m instanceof n.NonTerminal && t.contains(p, m) ? !1 : m instanceof n.AbstractProduction ? (m instanceof n.NonTerminal && p.push(m), t.every(m.definition, function(g) {
+    }) : E instanceof n.NonTerminal && t.contains(p, E) ? !1 : E instanceof n.AbstractProduction ? (E instanceof n.NonTerminal && p.push(E), t.every(E.definition, function(g) {
       return o(g, p);
     })) : !1;
   }
   i.isOptionalProd = o;
-  function c(m) {
-    return m instanceof n.Alternation;
+  function c(E) {
+    return E instanceof n.Alternation;
   }
   i.isBranchingProd = c;
-  function A(m) {
-    if (m instanceof n.NonTerminal) return "SUBRULE";
-    if (m instanceof n.Option) return "OPTION";
-    if (m instanceof n.Alternation) return "OR";
-    if (m instanceof n.RepetitionMandatory) return "AT_LEAST_ONE";
-    if (m instanceof n.RepetitionMandatoryWithSeparator) return "AT_LEAST_ONE_SEP";
-    if (m instanceof n.RepetitionWithSeparator) return "MANY_SEP";
-    if (m instanceof n.Repetition) return "MANY";
-    if (m instanceof n.Terminal) return "CONSUME";
+  function A(E) {
+    if (E instanceof n.NonTerminal) return "SUBRULE";
+    if (E instanceof n.Option) return "OPTION";
+    if (E instanceof n.Alternation) return "OR";
+    if (E instanceof n.RepetitionMandatory) return "AT_LEAST_ONE";
+    if (E instanceof n.RepetitionMandatoryWithSeparator) return "AT_LEAST_ONE_SEP";
+    if (E instanceof n.RepetitionWithSeparator) return "MANY_SEP";
+    if (E instanceof n.Repetition) return "MANY";
+    if (E instanceof n.Terminal) return "CONSUME";
     throw Error("non exhaustive match");
   }
   i.getProductionDslName = A;
-  var a = (function(m) {
-    e(p, m);
+  var a = (function(E) {
+    e(p, E);
     function p() {
-      var E = m !== null && m.apply(this, arguments) || this;
-      return E.separator = "-", E.dslMethods = { option: [], alternation: [], repetition: [], repetitionWithSeparator: [], repetitionMandatory: [], repetitionMandatoryWithSeparator: [] }, E;
+      var m = E !== null && E.apply(this, arguments) || this;
+      return m.separator = "-", m.dslMethods = { option: [], alternation: [], repetition: [], repetitionWithSeparator: [], repetitionMandatory: [], repetitionMandatoryWithSeparator: [] }, m;
     }
     return p.prototype.reset = function() {
       this.dslMethods = { option: [], alternation: [], repetition: [], repetitionWithSeparator: [], repetitionMandatory: [], repetitionMandatoryWithSeparator: [] };
-    }, p.prototype.visitTerminal = function(E) {
-      var g = E.terminalType.name + this.separator + "Terminal";
-      t.has(this.dslMethods, g) || (this.dslMethods[g] = []), this.dslMethods[g].push(E);
-    }, p.prototype.visitNonTerminal = function(E) {
-      var g = E.nonTerminalName + this.separator + "Terminal";
-      t.has(this.dslMethods, g) || (this.dslMethods[g] = []), this.dslMethods[g].push(E);
-    }, p.prototype.visitOption = function(E) {
-      this.dslMethods.option.push(E);
-    }, p.prototype.visitRepetitionWithSeparator = function(E) {
-      this.dslMethods.repetitionWithSeparator.push(E);
-    }, p.prototype.visitRepetitionMandatory = function(E) {
-      this.dslMethods.repetitionMandatory.push(E);
-    }, p.prototype.visitRepetitionMandatoryWithSeparator = function(E) {
-      this.dslMethods.repetitionMandatoryWithSeparator.push(E);
-    }, p.prototype.visitRepetition = function(E) {
-      this.dslMethods.repetition.push(E);
-    }, p.prototype.visitAlternation = function(E) {
-      this.dslMethods.alternation.push(E);
+    }, p.prototype.visitTerminal = function(m) {
+      var g = m.terminalType.name + this.separator + "Terminal";
+      t.has(this.dslMethods, g) || (this.dslMethods[g] = []), this.dslMethods[g].push(m);
+    }, p.prototype.visitNonTerminal = function(m) {
+      var g = m.nonTerminalName + this.separator + "Terminal";
+      t.has(this.dslMethods, g) || (this.dslMethods[g] = []), this.dslMethods[g].push(m);
+    }, p.prototype.visitOption = function(m) {
+      this.dslMethods.option.push(m);
+    }, p.prototype.visitRepetitionWithSeparator = function(m) {
+      this.dslMethods.repetitionWithSeparator.push(m);
+    }, p.prototype.visitRepetitionMandatory = function(m) {
+      this.dslMethods.repetitionMandatory.push(m);
+    }, p.prototype.visitRepetitionMandatoryWithSeparator = function(m) {
+      this.dslMethods.repetitionMandatoryWithSeparator.push(m);
+    }, p.prototype.visitRepetition = function(m) {
+      this.dslMethods.repetition.push(m);
+    }, p.prototype.visitAlternation = function(m) {
+      this.dslMethods.alternation.push(m);
     }, p;
   })(r.GAstVisitor);
   i.DslMethodsCollectorVisitor = a;
   var h = new a();
-  function u(m) {
-    h.reset(), m.accept(h);
+  function u(E) {
+    h.reset(), E.accept(h);
     var p = h.dslMethods;
     return h.reset(), p;
   }
@@ -4194,7 +4194,7 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
   }
   i.first = r;
   function s(A) {
-    for (var a = [], h = A.definition, u = 0, m = h.length > u, p, E = !0; m && E; ) p = h[u], E = n.isOptionalProd(p), a = a.concat(r(p)), u = u + 1, m = h.length > u;
+    for (var a = [], h = A.definition, u = 0, E = h.length > u, p, m = !0; E && m; ) p = h[u], m = n.isOptionalProd(p), a = a.concat(r(p)), u = u + 1, E = h.length > u;
     return e.uniq(a);
   }
   i.firstForSequence = s;
@@ -4213,53 +4213,53 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
   Object.defineProperty(i, "__esModule", { value: !0 }), i.IN = void 0, i.IN = "_~IN~_";
 }), jo = ve((i) => {
   var e = i && i.__extends || /* @__PURE__ */ (function() {
-    var u = function(m, p) {
-      return u = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(E, g) {
-        E.__proto__ = g;
-      } || function(E, g) {
-        for (var l in g) Object.prototype.hasOwnProperty.call(g, l) && (E[l] = g[l]);
-      }, u(m, p);
+    var u = function(E, p) {
+      return u = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(m, g) {
+        m.__proto__ = g;
+      } || function(m, g) {
+        for (var l in g) Object.prototype.hasOwnProperty.call(g, l) && (m[l] = g[l]);
+      }, u(E, p);
     };
-    return function(m, p) {
+    return function(E, p) {
       if (typeof p != "function" && p !== null) throw new TypeError("Class extends value " + String(p) + " is not a constructor or null");
-      u(m, p);
-      function E() {
-        this.constructor = m;
+      u(E, p);
+      function m() {
+        this.constructor = E;
       }
-      m.prototype = p === null ? Object.create(p) : (E.prototype = p.prototype, new E());
+      E.prototype = p === null ? Object.create(p) : (m.prototype = p.prototype, new m());
     };
   })();
   Object.defineProperty(i, "__esModule", { value: !0 }), i.buildInProdFollowPrefix = i.buildBetweenProdsFollowPrefix = i.computeAllProdsFollows = i.ResyncFollowsWalker = void 0;
   var t = ii(), n = hr(), r = Fe(), s = dr(), o = nt(), c = (function(u) {
-    e(m, u);
-    function m(p) {
-      var E = u.call(this) || this;
-      return E.topProd = p, E.follows = {}, E;
+    e(E, u);
+    function E(p) {
+      var m = u.call(this) || this;
+      return m.topProd = p, m.follows = {}, m;
     }
-    return m.prototype.startWalking = function() {
+    return E.prototype.startWalking = function() {
       return this.walk(this.topProd), this.follows;
-    }, m.prototype.walkTerminal = function(p, E, g) {
-    }, m.prototype.walkProdRef = function(p, E, g) {
-      var l = a(p.referencedRule, p.idx) + this.topProd.name, d = E.concat(g), f = new o.Alternative({ definition: d }), b = n.first(f);
+    }, E.prototype.walkTerminal = function(p, m, g) {
+    }, E.prototype.walkProdRef = function(p, m, g) {
+      var l = a(p.referencedRule, p.idx) + this.topProd.name, d = m.concat(g), f = new o.Alternative({ definition: d }), b = n.first(f);
       this.follows[l] = b;
-    }, m;
+    }, E;
   })(t.RestWalker);
   i.ResyncFollowsWalker = c;
   function A(u) {
-    var m = {};
+    var E = {};
     return r.forEach(u, function(p) {
-      var E = new c(p).startWalking();
-      r.assign(m, E);
-    }), m;
+      var m = new c(p).startWalking();
+      r.assign(E, m);
+    }), E;
   }
   i.computeAllProdsFollows = A;
-  function a(u, m) {
-    return u.name + m + s.IN;
+  function a(u, E) {
+    return u.name + E + s.IN;
   }
   i.buildBetweenProdsFollowPrefix = a;
   function h(u) {
-    var m = u.terminalType.name;
-    return m + u.idx + s.IN;
+    var E = u.terminalType.name;
+    return E + u.idx + s.IN;
   }
   i.buildInProdFollowPrefix = h;
 }), gn = ve((i) => {
@@ -4278,34 +4278,34 @@ See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346
     o.previous;
     var a = o.customUserDescription;
     o.ruleName;
-    var h = "Expecting: ", u = n.first(A).image, m = `
+    var h = "Expecting: ", u = n.first(A).image, E = `
 but found: '` + u + "'";
-    if (a) return h + a + m;
+    if (a) return h + a + E;
     var p = n.reduce(c, function(d, f) {
       return d.concat(f);
-    }, []), E = n.map(p, function(d) {
+    }, []), m = n.map(p, function(d) {
       return "[" + n.map(d, function(f) {
         return e.tokenLabel(f);
       }).join(", ") + "]";
-    }), g = n.map(E, function(d, f) {
+    }), g = n.map(m, function(d, f) {
       return "  " + (f + 1) + ". " + d;
     }), l = `one of these possible Token sequences:
 ` + g.join(`
 `);
-    return h + l + m;
+    return h + l + E;
   }, buildEarlyExitMessage: function(o) {
     var c = o.expectedIterationPaths, A = o.actual, a = o.customUserDescription;
     o.ruleName;
-    var h = "Expecting: ", u = n.first(A).image, m = `
+    var h = "Expecting: ", u = n.first(A).image, E = `
 but found: '` + u + "'";
-    if (a) return h + a + m;
+    if (a) return h + a + E;
     var p = n.map(c, function(g) {
       return "[" + n.map(g, function(l) {
         return e.tokenLabel(l);
       }).join(",") + "]";
-    }), E = `expecting at least one iteration which starts with one of these possible Token sequences::
+    }), m = `expecting at least one iteration which starts with one of these possible Token sequences::
   ` + ("<" + p.join(" ,") + ">");
-    return h + E + m;
+    return h + m + E;
   } }, Object.freeze(i.defaultParserErrorProvider), i.defaultGrammarResolverErrorProvider = { buildRuleNotFoundError: function(o, c) {
     var A = "Invalid grammar, reference to a rule which is not defined: ->" + c.nonTerminalName + `<-
 inside top level rule: ->` + o.name + "<-";
@@ -4314,7 +4314,7 @@ inside top level rule: ->` + o.name + "<-";
     function A(l) {
       return l instanceof r.Terminal ? l.terminalType.name : l instanceof r.NonTerminal ? l.nonTerminalName : "";
     }
-    var a = o.name, h = n.first(c), u = h.idx, m = s.getProductionDslName(h), p = A(h), E = u > 0, g = "->" + m + (E ? u : "") + "<- " + (p ? "with argument: ->" + p + "<-" : "") + `
+    var a = o.name, h = n.first(c), u = h.idx, E = s.getProductionDslName(h), p = A(h), m = u > 0, g = "->" + E + (m ? u : "") + "<- " + (p ? "with argument: ->" + p + "<-" : "") + `
                   appears more than once (` + c.length + " times) in the top level rule: ->" + a + `<-.
                   For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES
                   `;
@@ -4385,7 +4385,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
       return c = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(h, u) {
         h.__proto__ = u;
       } || function(h, u) {
-        for (var m in u) Object.prototype.hasOwnProperty.call(u, m) && (h[m] = u[m]);
+        for (var E in u) Object.prototype.hasOwnProperty.call(u, E) && (h[E] = u[E]);
       }, c(A, a);
     };
     return function(A, a) {
@@ -4529,7 +4529,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     }, d;
   })(A);
   i.NextTerminalAfterAtLeastOneWalker = u;
-  var m = (function(l) {
+  var E = (function(l) {
     e(d, l);
     function d() {
       return l !== null && l.apply(this, arguments) || this;
@@ -4541,7 +4541,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
       } else l.prototype.walkAtLeastOneSep.call(this, f, b, I);
     }, d;
   })(A);
-  i.NextTerminalAfterAtLeastOneSepWalker = m;
+  i.NextTerminalAfterAtLeastOneSepWalker = E;
   function p(l, d, f) {
     f === void 0 && (f = []), f = n.cloneArr(f);
     var b = [], I = 0;
@@ -4580,7 +4580,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     return b.push({ partialPath: f, suffixDef: n.drop(l, I) }), b;
   }
   i.possiblePathsFrom = p;
-  function E(l, d, f, b) {
+  function m(l, d, f, b) {
     var I = "EXIT_NONE_TERMINAL", C = [I], v = "EXIT_ALTERNATIVE", x = !1, j = d.length, R = j - b - 1, M = [], _ = [];
     for (_.push({ idx: -1, def: l, ruleStack: [], occurrenceStack: [] }); !n.isEmpty(_); ) {
       var T = _.pop();
@@ -4641,7 +4641,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     }
     return M;
   }
-  i.nextPossibleTokensAfter = E;
+  i.nextPossibleTokensAfter = m;
   function g(l, d, f, b) {
     var I = n.cloneArr(f);
     I.push(l.name);
@@ -4691,7 +4691,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     return L(J[0], X, T);
   }
   i.buildLookaheadFuncForOptionalProd = u;
-  function m(R, M, _, T) {
+  function E(R, M, _, T) {
     var N = R.length, L = t.every(R, function(z) {
       return t.every(z, function(Z) {
         return Z.length === 1;
@@ -4739,7 +4739,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
       }
     };
   }
-  i.buildAlternativesLookAheadFunc = m;
+  i.buildAlternativesLookAheadFunc = E;
   function p(R, M, _) {
     var T = t.every(R, function(Z) {
       return Z.length === 1;
@@ -4774,7 +4774,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     };
   }
   i.buildSingleAlternativeLookaheadFunction = p;
-  var E = (function(R) {
+  var m = (function(R) {
     e(M, R);
     function M(_, T, N) {
       var L = R.call(this) || this;
@@ -4891,7 +4891,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
   function C(R, M, _, T) {
     var N = new g(R, _);
     M.accept(N);
-    var L = N.result, J = new E(M, R, _), X = J.startWalking(), z = new o.Alternative({ definition: L }), Z = new o.Alternative({ definition: X });
+    var L = N.result, J = new m(M, R, _), X = J.startWalking(), z = new o.Alternative({ definition: L }), Z = new o.Alternative({ definition: X });
     return b([z, Z], T);
   }
   i.getLookaheadPathsForOptionalProd = C;
@@ -4966,9 +4966,9 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
   }
   i.validateGrammar = h;
   function u(T, N) {
-    var L = new E();
+    var L = new m();
     T.accept(L);
-    var J = L.allProductions, X = t.groupBy(J, m), z = t.pick(X, function(ne) {
+    var J = L.allProductions, X = t.groupBy(J, E), z = t.pick(X, function(ne) {
       return ne.length > 1;
     }), Z = t.map(t.values(z), function(ne) {
       var le = t.first(ne), oe = N.buildDuplicateFoundError(T, ne), se = s.getProductionDslName(le), $ = { message: oe, type: r.ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS, ruleName: T.name, dslName: se, occurrence: le.idx }, he = p(le);
@@ -4976,14 +4976,14 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     });
     return Z;
   }
-  function m(T) {
+  function E(T) {
     return s.getProductionDslName(T) + "_#_" + T.idx + "_#_" + p(T);
   }
-  i.identifyProductionForDuplicates = m;
+  i.identifyProductionForDuplicates = E;
   function p(T) {
     return T instanceof A.Terminal ? T.terminalType.name : T instanceof A.NonTerminal ? T.nonTerminalName : "";
   }
-  var E = (function(T) {
+  var m = (function(T) {
     e(N, T);
     function N() {
       var L = T !== null && T.apply(this, arguments) || this;
@@ -5007,7 +5007,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
       this.allProductions.push(L);
     }, N;
   })(a.GAstVisitor);
-  i.OccurrenceValidationCollector = E;
+  i.OccurrenceValidationCollector = m;
   function g(T, N, L, J) {
     var X = [], z = n.reduce(N, function(ne, le) {
       return le.name === T.name ? ne + 1 : ne;
@@ -5199,16 +5199,16 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
   i.validateGrammar = o;
 }), tn = ve((i) => {
   var e = i && i.__extends || /* @__PURE__ */ (function() {
-    var E = function(g, l) {
-      return E = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(d, f) {
+    var m = function(g, l) {
+      return m = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(d, f) {
         d.__proto__ = f;
       } || function(d, f) {
         for (var b in f) Object.prototype.hasOwnProperty.call(f, b) && (d[b] = f[b]);
-      }, E(g, l);
+      }, m(g, l);
     };
     return function(g, l) {
       if (typeof l != "function" && l !== null) throw new TypeError("Class extends value " + String(l) + " is not a constructor or null");
-      E(g, l);
+      m(g, l);
       function d() {
         this.constructor = g;
       }
@@ -5218,48 +5218,48 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
   Object.defineProperty(i, "__esModule", { value: !0 }), i.EarlyExitException = i.NotAllInputParsedException = i.NoViableAltException = i.MismatchedTokenException = i.isRecognitionException = void 0;
   var t = Fe(), n = "MismatchedTokenException", r = "NoViableAltException", s = "EarlyExitException", o = "NotAllInputParsedException", c = [n, r, s, o];
   Object.freeze(c);
-  function A(E) {
-    return t.contains(c, E.name);
+  function A(m) {
+    return t.contains(c, m.name);
   }
   i.isRecognitionException = A;
-  var a = (function(E) {
-    e(g, E);
+  var a = (function(m) {
+    e(g, m);
     function g(l, d) {
-      var f = this.constructor, b = E.call(this, l) || this;
+      var f = this.constructor, b = m.call(this, l) || this;
       return b.token = d, b.resyncedTokens = [], Object.setPrototypeOf(b, f.prototype), Error.captureStackTrace && Error.captureStackTrace(b, b.constructor), b;
     }
     return g;
-  })(Error), h = (function(E) {
-    e(g, E);
+  })(Error), h = (function(m) {
+    e(g, m);
     function g(l, d, f) {
-      var b = E.call(this, l, d) || this;
+      var b = m.call(this, l, d) || this;
       return b.previousToken = f, b.name = n, b;
     }
     return g;
   })(a);
   i.MismatchedTokenException = h;
-  var u = (function(E) {
-    e(g, E);
+  var u = (function(m) {
+    e(g, m);
     function g(l, d, f) {
-      var b = E.call(this, l, d) || this;
+      var b = m.call(this, l, d) || this;
       return b.previousToken = f, b.name = r, b;
     }
     return g;
   })(a);
   i.NoViableAltException = u;
-  var m = (function(E) {
-    e(g, E);
+  var E = (function(m) {
+    e(g, m);
     function g(l, d) {
-      var f = E.call(this, l, d) || this;
+      var f = m.call(this, l, d) || this;
       return f.name = o, f;
     }
     return g;
   })(a);
-  i.NotAllInputParsedException = m;
-  var p = (function(E) {
-    e(g, E);
+  i.NotAllInputParsedException = E;
+  var p = (function(m) {
+    e(g, m);
     function g(l, d, f) {
-      var b = E.call(this, l, d) || this;
+      var b = m.call(this, l, d) || this;
       return b.previousToken = f, b.name = s, b;
     }
     return g;
@@ -5283,27 +5283,27 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
       return u.isInsertedInRecovery = !0, u;
     }, a.prototype.canTokenTypeBeInsertedInRecovery = function(h) {
       return !0;
-    }, a.prototype.tryInRepetitionRecovery = function(h, u, m, p) {
-      for (var E = this, g = this.findReSyncTokenType(), l = this.exportLexerState(), d = [], f = !1, b = this.LA(1), I = this.LA(1), C = function() {
-        var v = E.LA(0), x = E.errorMessageProvider.buildMismatchTokenMessage({ expected: p, actual: b, previous: v, ruleName: E.getCurrRuleFullName() }), j = new n.MismatchedTokenException(x, b, E.LA(0));
-        j.resyncedTokens = t.dropRight(d), E.SAVE_ERROR(j);
+    }, a.prototype.tryInRepetitionRecovery = function(h, u, E, p) {
+      for (var m = this, g = this.findReSyncTokenType(), l = this.exportLexerState(), d = [], f = !1, b = this.LA(1), I = this.LA(1), C = function() {
+        var v = m.LA(0), x = m.errorMessageProvider.buildMismatchTokenMessage({ expected: p, actual: b, previous: v, ruleName: m.getCurrRuleFullName() }), j = new n.MismatchedTokenException(x, b, m.LA(0));
+        j.resyncedTokens = t.dropRight(d), m.SAVE_ERROR(j);
       }; !f; ) if (this.tokenMatcher(I, p)) {
         C();
         return;
-      } else if (m.call(this)) {
+      } else if (E.call(this)) {
         C(), h.apply(this, u);
         return;
       } else this.tokenMatcher(I, g) ? f = !0 : (I = this.SKIP_TOKEN(), this.addToResyncTokens(I, d));
       this.importLexerState(l);
-    }, a.prototype.shouldInRepetitionRecoveryBeTried = function(h, u, m) {
-      return !(m === !1 || h === void 0 || u === void 0 || this.tokenMatcher(this.LA(1), h) || this.isBackTracking() || this.canPerformInRuleRecovery(h, this.getFollowsForInRuleRecovery(h, u)));
+    }, a.prototype.shouldInRepetitionRecoveryBeTried = function(h, u, E) {
+      return !(E === !1 || h === void 0 || u === void 0 || this.tokenMatcher(this.LA(1), h) || this.isBackTracking() || this.canPerformInRuleRecovery(h, this.getFollowsForInRuleRecovery(h, u)));
     }, a.prototype.getFollowsForInRuleRecovery = function(h, u) {
-      var m = this.getCurrentGrammarPath(h, u), p = this.getNextPossibleTokenTypes(m);
+      var E = this.getCurrentGrammarPath(h, u), p = this.getNextPossibleTokenTypes(E);
       return p;
     }, a.prototype.tryInRuleRecovery = function(h, u) {
       if (this.canRecoverWithSingleTokenInsertion(h, u)) {
-        var m = this.getTokenToInsert(h);
-        return m;
+        var E = this.getTokenToInsert(h);
+        return E;
       }
       if (this.canRecoverWithSingleTokenDeletion(h)) {
         var p = this.SKIP_TOKEN();
@@ -5313,36 +5313,36 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     }, a.prototype.canPerformInRuleRecovery = function(h, u) {
       return this.canRecoverWithSingleTokenInsertion(h, u) || this.canRecoverWithSingleTokenDeletion(h);
     }, a.prototype.canRecoverWithSingleTokenInsertion = function(h, u) {
-      var m = this;
+      var E = this;
       if (!this.canTokenTypeBeInsertedInRecovery(h) || t.isEmpty(u)) return !1;
-      var p = this.LA(1), E = t.find(u, function(g) {
-        return m.tokenMatcher(p, g);
+      var p = this.LA(1), m = t.find(u, function(g) {
+        return E.tokenMatcher(p, g);
       }) !== void 0;
-      return E;
+      return m;
     }, a.prototype.canRecoverWithSingleTokenDeletion = function(h) {
       var u = this.tokenMatcher(this.LA(2), h);
       return u;
     }, a.prototype.isInCurrentRuleReSyncSet = function(h) {
-      var u = this.getCurrFollowKey(), m = this.getFollowSetFromFollowKey(u);
-      return t.contains(m, h);
+      var u = this.getCurrFollowKey(), E = this.getFollowSetFromFollowKey(u);
+      return t.contains(E, h);
     }, a.prototype.findReSyncTokenType = function() {
-      for (var h = this.flattenFollowSet(), u = this.LA(1), m = 2; ; ) {
+      for (var h = this.flattenFollowSet(), u = this.LA(1), E = 2; ; ) {
         var p = u.tokenType;
         if (t.contains(h, p)) return p;
-        u = this.LA(m), m++;
+        u = this.LA(E), E++;
       }
     }, a.prototype.getCurrFollowKey = function() {
       if (this.RULE_STACK.length === 1) return i.EOF_FOLLOW_KEY;
-      var h = this.getLastExplicitRuleShortName(), u = this.getLastExplicitRuleOccurrenceIndex(), m = this.getPreviousExplicitRuleShortName();
-      return { ruleName: this.shortRuleNameToFullName(h), idxInCallingRule: u, inRule: this.shortRuleNameToFullName(m) };
+      var h = this.getLastExplicitRuleShortName(), u = this.getLastExplicitRuleOccurrenceIndex(), E = this.getPreviousExplicitRuleShortName();
+      return { ruleName: this.shortRuleNameToFullName(h), idxInCallingRule: u, inRule: this.shortRuleNameToFullName(E) };
     }, a.prototype.buildFullFollowKeyStack = function() {
-      var h = this, u = this.RULE_STACK, m = this.RULE_OCCURRENCE_STACK;
-      return t.map(u, function(p, E) {
-        return E === 0 ? i.EOF_FOLLOW_KEY : { ruleName: h.shortRuleNameToFullName(p), idxInCallingRule: m[E], inRule: h.shortRuleNameToFullName(u[E - 1]) };
+      var h = this, u = this.RULE_STACK, E = this.RULE_OCCURRENCE_STACK;
+      return t.map(u, function(p, m) {
+        return m === 0 ? i.EOF_FOLLOW_KEY : { ruleName: h.shortRuleNameToFullName(p), idxInCallingRule: E[m], inRule: h.shortRuleNameToFullName(u[m - 1]) };
       });
     }, a.prototype.flattenFollowSet = function() {
-      var h = this, u = t.map(this.buildFullFollowKeyStack(), function(m) {
-        return h.getFollowSetFromFollowKey(m);
+      var h = this, u = t.map(this.buildFullFollowKeyStack(), function(E) {
+        return h.getFollowSetFromFollowKey(E);
       });
       return t.flatten(u);
     }, a.prototype.getFollowSetFromFollowKey = function(h) {
@@ -5352,12 +5352,12 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     }, a.prototype.addToResyncTokens = function(h, u) {
       return this.tokenMatcher(h, e.EOF) || u.push(h), u;
     }, a.prototype.reSyncTo = function(h) {
-      for (var u = [], m = this.LA(1); this.tokenMatcher(m, h) === !1; ) m = this.SKIP_TOKEN(), this.addToResyncTokens(m, u);
+      for (var u = [], E = this.LA(1); this.tokenMatcher(E, h) === !1; ) E = this.SKIP_TOKEN(), this.addToResyncTokens(E, u);
       return t.dropRight(u);
-    }, a.prototype.attemptInRepetitionRecovery = function(h, u, m, p, E, g, l) {
+    }, a.prototype.attemptInRepetitionRecovery = function(h, u, E, p, m, g, l) {
     }, a.prototype.getCurrentGrammarPath = function(h, u) {
-      var m = this.getHumanReadableRuleStack(), p = t.cloneArr(this.RULE_OCCURRENCE_STACK), E = { ruleStack: m, occurrenceStack: p, lastTok: h, lastTokOccurrence: u };
-      return E;
+      var E = this.getHumanReadableRuleStack(), p = t.cloneArr(this.RULE_OCCURRENCE_STACK), m = { ruleStack: E, occurrenceStack: p, lastTok: h, lastTokOccurrence: u };
+      return m;
     }, a.prototype.getHumanReadableRuleStack = function() {
       var h = this;
       return t.map(this.RULE_STACK, function(u) {
@@ -5366,10 +5366,10 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
     }, a;
   })();
   i.Recoverable = c;
-  function A(a, h, u, m, p, E, g) {
-    var l = this.getKeyForAutomaticLookahead(m, p), d = this.firstAfterRepMap[l];
+  function A(a, h, u, E, p, m, g) {
+    var l = this.getKeyForAutomaticLookahead(E, p), d = this.firstAfterRepMap[l];
     if (d === void 0) {
-      var f = this.getCurrRuleFullName(), b = this.getGAstProductions()[f], I = new E(b, p);
+      var f = this.getCurrRuleFullName(), b = this.getGAstProductions()[f], I = new m(b, p);
       d = I.startWalking(), this.firstAfterRepMap[l] = d;
     }
     var C = d.token, v = d.occurrence, x = d.isEndOfRule;
@@ -5393,8 +5393,8 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
       var a = this;
       t.forEach(A, function(h) {
         a.TRACE_INIT(h.name + " Rule Lookahead", function() {
-          var u = s.collectMethods(h), m = u.alternation, p = u.repetition, E = u.option, g = u.repetitionMandatory, l = u.repetitionMandatoryWithSeparator, d = u.repetitionWithSeparator;
-          t.forEach(m, function(f) {
+          var u = s.collectMethods(h), E = u.alternation, p = u.repetition, m = u.option, g = u.repetitionMandatory, l = u.repetitionMandatoryWithSeparator, d = u.repetitionWithSeparator;
+          t.forEach(E, function(f) {
             var b = f.idx === 0 ? "" : f.idx;
             a.TRACE_INIT("" + s.getProductionDslName(f) + b, function() {
               var I = e.buildLookaheadFuncForOr(f.idx, h, f.maxLookahead || a.maxLookahead, f.hasPredicates, a.dynamicTokensEnabled, a.lookAheadBuilderForAlternatives), C = r.getKeyForAutomaticLookahead(a.fullRuleNameToShort[h.name], r.OR_IDX, f.idx);
@@ -5402,7 +5402,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
             });
           }), t.forEach(p, function(f) {
             a.computeLookaheadFunc(h, f.idx, r.MANY_IDX, e.PROD_TYPE.REPETITION, f.maxLookahead, s.getProductionDslName(f));
-          }), t.forEach(E, function(f) {
+          }), t.forEach(m, function(f) {
             a.computeLookaheadFunc(h, f.idx, r.OPTION_IDX, e.PROD_TYPE.OPTION, f.maxLookahead, s.getProductionDslName(f));
           }), t.forEach(g, function(f) {
             a.computeLookaheadFunc(h, f.idx, r.AT_LEAST_ONE_IDX, e.PROD_TYPE.REPETITION_MANDATORY, f.maxLookahead, s.getProductionDslName(f));
@@ -5413,11 +5413,11 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
           });
         });
       });
-    }, c.prototype.computeLookaheadFunc = function(A, a, h, u, m, p) {
-      var E = this;
+    }, c.prototype.computeLookaheadFunc = function(A, a, h, u, E, p) {
+      var m = this;
       this.TRACE_INIT("" + p + (a === 0 ? "" : a), function() {
-        var g = e.buildLookaheadFuncForOptionalProd(a, A, m || E.maxLookahead, E.dynamicTokensEnabled, u, E.lookAheadBuilderForOptional), l = r.getKeyForAutomaticLookahead(E.fullRuleNameToShort[A.name], h, a);
-        E.setLaFuncCache(l, g);
+        var g = e.buildLookaheadFuncForOptionalProd(a, A, E || m.maxLookahead, m.dynamicTokensEnabled, u, m.lookAheadBuilderForOptional), l = r.getKeyForAutomaticLookahead(m.fullRuleNameToShort[A.name], h, a);
+        m.setLaFuncCache(l, g);
       });
     }, c.prototype.lookAheadBuilderForOptional = function(A, a, h) {
       return e.buildSingleAlternativeLookaheadFunction(A, a, h);
@@ -5478,21 +5478,21 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
 }), Vo = ve((i) => {
   Object.defineProperty(i, "__esModule", { value: !0 }), i.validateRedundantMethods = i.validateMissingCstMethods = i.validateVisitor = i.CstVisitorDefinitionError = i.createBaseVisitorConstructorWithDefaults = i.createBaseSemanticVisitorConstructor = i.defaultVisit = void 0;
   var e = Fe(), t = gr();
-  function n(u, m) {
-    for (var p = e.keys(u), E = p.length, g = 0; g < E; g++) for (var l = p[g], d = u[l], f = d.length, b = 0; b < f; b++) {
+  function n(u, E) {
+    for (var p = e.keys(u), m = p.length, g = 0; g < m; g++) for (var l = p[g], d = u[l], f = d.length, b = 0; b < f; b++) {
       var I = d[b];
-      I.tokenTypeIdx === void 0 && this[I.name](I.children, m);
+      I.tokenTypeIdx === void 0 && this[I.name](I.children, E);
     }
   }
   i.defaultVisit = n;
-  function r(u, m) {
+  function r(u, E) {
     var p = function() {
     };
     t.defineNameProp(p, u + "BaseSemantics");
-    var E = { visit: function(g, l) {
+    var m = { visit: function(g, l) {
       if (e.isArray(g) && (g = g[0]), !e.isUndefined(g)) return this[g.name](g.children, l);
     }, validateVisitor: function() {
-      var g = c(this, m);
+      var g = c(this, E);
       if (!e.isEmpty(g)) {
         var l = e.map(g, function(d) {
           return d.msg;
@@ -5504,41 +5504,41 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;
 	`)));
       }
     } };
-    return p.prototype = E, p.prototype.constructor = p, p._RULE_NAMES = m, p;
+    return p.prototype = m, p.prototype.constructor = p, p._RULE_NAMES = E, p;
   }
   i.createBaseSemanticVisitorConstructor = r;
-  function s(u, m, p) {
-    var E = function() {
+  function s(u, E, p) {
+    var m = function() {
     };
-    t.defineNameProp(E, u + "BaseSemanticsWithDefaults");
+    t.defineNameProp(m, u + "BaseSemanticsWithDefaults");
     var g = Object.create(p.prototype);
-    return e.forEach(m, function(l) {
+    return e.forEach(E, function(l) {
       g[l] = n;
-    }), E.prototype = g, E.prototype.constructor = E, E;
+    }), m.prototype = g, m.prototype.constructor = m, m;
   }
   i.createBaseVisitorConstructorWithDefaults = s;
   var o;
   (function(u) {
     u[u.REDUNDANT_METHOD = 0] = "REDUNDANT_METHOD", u[u.MISSING_METHOD = 1] = "MISSING_METHOD";
   })(o = i.CstVisitorDefinitionError || (i.CstVisitorDefinitionError = {}));
-  function c(u, m) {
-    var p = A(u, m), E = h(u, m);
-    return p.concat(E);
+  function c(u, E) {
+    var p = A(u, E), m = h(u, E);
+    return p.concat(m);
   }
   i.validateVisitor = c;
-  function A(u, m) {
-    var p = e.map(m, function(E) {
-      if (!e.isFunction(u[E])) return { msg: "Missing visitor method: <" + E + "> on " + t.functionName(u.constructor) + " CST Visitor.", type: o.MISSING_METHOD, methodName: E };
+  function A(u, E) {
+    var p = e.map(E, function(m) {
+      if (!e.isFunction(u[m])) return { msg: "Missing visitor method: <" + m + "> on " + t.functionName(u.constructor) + " CST Visitor.", type: o.MISSING_METHOD, methodName: m };
     });
     return e.compact(p);
   }
   i.validateMissingCstMethods = A;
   var a = ["constructor", "visit", "validateVisitor"];
-  function h(u, m) {
+  function h(u, E) {
     var p = [];
-    for (var E in u) e.isFunction(u[E]) && !e.contains(a, E) && !e.contains(m, E) && p.push({ msg: "Redundant visitor method: <" + E + "> on " + t.functionName(u.constructor) + ` CST Visitor
+    for (var m in u) e.isFunction(u[m]) && !e.contains(a, m) && !e.contains(E, m) && p.push({ msg: "Redundant visitor method: <" + m + "> on " + t.functionName(u.constructor) + ` CST Visitor
 There is no Grammar Rule corresponding to this method's name.
-`, type: o.REDUNDANT_METHOD, methodName: E });
+`, type: o.REDUNDANT_METHOD, methodName: m });
     return p;
   }
   i.validateRedundantMethods = h;
@@ -5816,16 +5816,16 @@ There is no Grammar Rule corresponding to this method's name.
       this.atLeastOneSepFirstInternal(9, a);
     }, A.prototype.RULE = function(a, h, u) {
       if (u === void 0 && (u = n.DEFAULT_RULE_CONFIG), e.contains(this.definedRulesNames, a)) {
-        var m = r.defaultGrammarValidatorErrorProvider.buildDuplicateRuleNameError({ topLevelRule: a, grammarName: this.className }), p = { message: m, type: n.ParserDefinitionErrorType.DUPLICATE_RULE_NAME, ruleName: a };
+        var E = r.defaultGrammarValidatorErrorProvider.buildDuplicateRuleNameError({ topLevelRule: a, grammarName: this.className }), p = { message: E, type: n.ParserDefinitionErrorType.DUPLICATE_RULE_NAME, ruleName: a };
         this.definitionErrors.push(p);
       }
       this.definedRulesNames.push(a);
-      var E = this.defineRule(a, h, u);
-      return this[a] = E, E;
+      var m = this.defineRule(a, h, u);
+      return this[a] = m, m;
     }, A.prototype.OVERRIDE_RULE = function(a, h, u) {
       u === void 0 && (u = n.DEFAULT_RULE_CONFIG);
-      var m = [];
-      m = m.concat(s.validateRuleIsOverridden(a, this.definedRulesNames, this.className)), this.definitionErrors = this.definitionErrors.concat(m);
+      var E = [];
+      E = E.concat(s.validateRuleIsOverridden(a, this.definedRulesNames, this.className)), this.definitionErrors = this.definitionErrors.concat(E);
       var p = this.defineRule(a, h, u);
       return this[a] = p, p;
     }, A.prototype.BACKTRACK = function(a, h) {
@@ -5834,9 +5834,9 @@ There is no Grammar Rule corresponding to this method's name.
         var u = this.saveRecogState();
         try {
           return a.apply(this, h), !0;
-        } catch (m) {
-          if (t.isRecognitionException(m)) return !1;
-          throw m;
+        } catch (E) {
+          if (t.isRecognitionException(E)) return !1;
+          throw E;
         } finally {
           this.reloadRecogState(u), this.isBackTrackingStack.pop();
         }
@@ -5851,10 +5851,10 @@ There is no Grammar Rule corresponding to this method's name.
 }), Xo = ve((i) => {
   Object.defineProperty(i, "__esModule", { value: !0 }), i.RecognizerEngine = void 0;
   var e = Fe(), t = ri(), n = tn(), r = En(), s = mn(), o = st(), c = pr(), A = St(), a = $t(), h = gr(), u = (function() {
-    function m() {
+    function E() {
     }
-    return m.prototype.initRecognizerEngine = function(p, E) {
-      if (this.className = h.classNameFromInstance(this), this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = a.tokenStructuredMatcherNoCategories, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_OCCURRENCE_STACK = [], this.gastProductionsCache = {}, e.has(E, "serializedGrammar")) throw Error(`The Parser's configuration can no longer contain a <serializedGrammar> property.
+    return E.prototype.initRecognizerEngine = function(p, m) {
+      if (this.className = h.classNameFromInstance(this), this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = a.tokenStructuredMatcherNoCategories, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_OCCURRENCE_STACK = [], this.gastProductionsCache = {}, e.has(m, "serializedGrammar")) throw Error(`The Parser's configuration can no longer contain a <serializedGrammar> property.
 	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0
 	For Further details.`);
       if (e.isArray(p)) {
@@ -5880,7 +5880,7 @@ There is no Grammar Rule corresponding to this method's name.
         return e.isEmpty(f.categoryMatches);
       });
       this.tokenMatcher = d ? a.tokenStructuredMatcherNoCategories : a.tokenStructuredMatcher, a.augmentTokenTypes(e.values(this.tokensMap));
-    }, m.prototype.defineRule = function(p, E, g) {
+    }, E.prototype.defineRule = function(p, m, g) {
       if (this.selfAnalysisDone) throw Error("Grammar rule <" + p + `> may not be defined after the 'performSelfAnalysis' method has been called'
 Make sure that all grammar rule definitions are done before 'performSelfAnalysis' is called.`);
       var l = e.has(g, "resyncEnabled") ? g.resyncEnabled : o.DEFAULT_RULE_CONFIG.resyncEnabled, d = e.has(g, "recoveryValueFunc") ? g.recoveryValueFunc : o.DEFAULT_RULE_CONFIG.recoveryValueFunc, f = this.ruleShortNameIdx << t.BITS_FOR_METHOD_TYPE + t.BITS_FOR_OCCURRENCE_IDX;
@@ -5888,10 +5888,10 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       function b(v) {
         try {
           if (this.outputCst === !0) {
-            E.apply(this, v);
+            m.apply(this, v);
             var x = this.CST_STACK[this.CST_STACK.length - 1];
             return this.cstPostRule(x), x;
-          } else return E.apply(this, v);
+          } else return m.apply(this, v);
         } catch (j) {
           return this.invokeRuleCatch(j, l, d);
         } finally {
@@ -5901,9 +5901,9 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       var I = function(v, x) {
         return v === void 0 && (v = 0), this.ruleInvocationStateUpdate(f, p, v), b.call(this, x);
       }, C = "ruleName";
-      return I[C] = p, I.originalGrammarAction = E, I;
-    }, m.prototype.invokeRuleCatch = function(p, E, g) {
-      var l = this.RULE_STACK.length === 1, d = E && !this.isBackTracking() && this.recoveryEnabled;
+      return I[C] = p, I.originalGrammarAction = m, I;
+    }, E.prototype.invokeRuleCatch = function(p, m, g) {
+      var l = this.RULE_STACK.length === 1, d = m && !this.isBackTracking() && this.recoveryEnabled;
       if (n.isRecognitionException(p)) {
         var f = p;
         if (d) {
@@ -5924,10 +5924,10 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
           throw f;
         }
       } else throw p;
-    }, m.prototype.optionInternal = function(p, E) {
-      var g = this.getKeyForAutomaticLookahead(t.OPTION_IDX, E);
-      return this.optionInternalLogic(p, E, g);
-    }, m.prototype.optionInternalLogic = function(p, E, g) {
+    }, E.prototype.optionInternal = function(p, m) {
+      var g = this.getKeyForAutomaticLookahead(t.OPTION_IDX, m);
+      return this.optionInternalLogic(p, m, g);
+    }, E.prototype.optionInternalLogic = function(p, m, g) {
       var l = this, d = this.getLaFuncFromCache(g), f, b;
       if (p.DEF !== void 0) {
         if (f = p.DEF, b = p.GATE, b !== void 0) {
@@ -5938,54 +5938,54 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
         }
       } else f = p;
       if (d.call(this) === !0) return f.call(this);
-    }, m.prototype.atLeastOneInternal = function(p, E) {
+    }, E.prototype.atLeastOneInternal = function(p, m) {
       var g = this.getKeyForAutomaticLookahead(t.AT_LEAST_ONE_IDX, p);
-      return this.atLeastOneInternalLogic(p, E, g);
-    }, m.prototype.atLeastOneInternalLogic = function(p, E, g) {
+      return this.atLeastOneInternalLogic(p, m, g);
+    }, E.prototype.atLeastOneInternalLogic = function(p, m, g) {
       var l = this, d = this.getLaFuncFromCache(g), f, b;
-      if (E.DEF !== void 0) {
-        if (f = E.DEF, b = E.GATE, b !== void 0) {
+      if (m.DEF !== void 0) {
+        if (f = m.DEF, b = m.GATE, b !== void 0) {
           var I = d;
           d = function() {
             return b.call(l) && I.call(l);
           };
         }
-      } else f = E;
+      } else f = m;
       if (d.call(this) === !0) for (var C = this.doSingleRepetition(f); d.call(this) === !0 && C === !0; ) C = this.doSingleRepetition(f);
-      else throw this.raiseEarlyExitException(p, r.PROD_TYPE.REPETITION_MANDATORY, E.ERR_MSG);
-      this.attemptInRepetitionRecovery(this.atLeastOneInternal, [p, E], d, t.AT_LEAST_ONE_IDX, p, s.NextTerminalAfterAtLeastOneWalker);
-    }, m.prototype.atLeastOneSepFirstInternal = function(p, E) {
+      else throw this.raiseEarlyExitException(p, r.PROD_TYPE.REPETITION_MANDATORY, m.ERR_MSG);
+      this.attemptInRepetitionRecovery(this.atLeastOneInternal, [p, m], d, t.AT_LEAST_ONE_IDX, p, s.NextTerminalAfterAtLeastOneWalker);
+    }, E.prototype.atLeastOneSepFirstInternal = function(p, m) {
       var g = this.getKeyForAutomaticLookahead(t.AT_LEAST_ONE_SEP_IDX, p);
-      this.atLeastOneSepFirstInternalLogic(p, E, g);
-    }, m.prototype.atLeastOneSepFirstInternalLogic = function(p, E, g) {
-      var l = this, d = E.DEF, f = E.SEP, b = this.getLaFuncFromCache(g);
+      this.atLeastOneSepFirstInternalLogic(p, m, g);
+    }, E.prototype.atLeastOneSepFirstInternalLogic = function(p, m, g) {
+      var l = this, d = m.DEF, f = m.SEP, b = this.getLaFuncFromCache(g);
       if (b.call(this) === !0) {
         d.call(this);
         for (var I = function() {
           return l.tokenMatcher(l.LA(1), f);
         }; this.tokenMatcher(this.LA(1), f) === !0; ) this.CONSUME(f), d.call(this);
         this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [p, f, I, d, s.NextTerminalAfterAtLeastOneSepWalker], I, t.AT_LEAST_ONE_SEP_IDX, p, s.NextTerminalAfterAtLeastOneSepWalker);
-      } else throw this.raiseEarlyExitException(p, r.PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, E.ERR_MSG);
-    }, m.prototype.manyInternal = function(p, E) {
+      } else throw this.raiseEarlyExitException(p, r.PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, m.ERR_MSG);
+    }, E.prototype.manyInternal = function(p, m) {
       var g = this.getKeyForAutomaticLookahead(t.MANY_IDX, p);
-      return this.manyInternalLogic(p, E, g);
-    }, m.prototype.manyInternalLogic = function(p, E, g) {
+      return this.manyInternalLogic(p, m, g);
+    }, E.prototype.manyInternalLogic = function(p, m, g) {
       var l = this, d = this.getLaFuncFromCache(g), f, b;
-      if (E.DEF !== void 0) {
-        if (f = E.DEF, b = E.GATE, b !== void 0) {
+      if (m.DEF !== void 0) {
+        if (f = m.DEF, b = m.GATE, b !== void 0) {
           var I = d;
           d = function() {
             return b.call(l) && I.call(l);
           };
         }
-      } else f = E;
+      } else f = m;
       for (var C = !0; d.call(this) === !0 && C === !0; ) C = this.doSingleRepetition(f);
-      this.attemptInRepetitionRecovery(this.manyInternal, [p, E], d, t.MANY_IDX, p, s.NextTerminalAfterManyWalker, C);
-    }, m.prototype.manySepFirstInternal = function(p, E) {
+      this.attemptInRepetitionRecovery(this.manyInternal, [p, m], d, t.MANY_IDX, p, s.NextTerminalAfterManyWalker, C);
+    }, E.prototype.manySepFirstInternal = function(p, m) {
       var g = this.getKeyForAutomaticLookahead(t.MANY_SEP_IDX, p);
-      this.manySepFirstInternalLogic(p, E, g);
-    }, m.prototype.manySepFirstInternalLogic = function(p, E, g) {
-      var l = this, d = E.DEF, f = E.SEP, b = this.getLaFuncFromCache(g);
+      this.manySepFirstInternalLogic(p, m, g);
+    }, E.prototype.manySepFirstInternalLogic = function(p, m, g) {
+      var l = this, d = m.DEF, f = m.SEP, b = this.getLaFuncFromCache(g);
       if (b.call(this) === !0) {
         d.call(this);
         for (var I = function() {
@@ -5993,76 +5993,76 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
         }; this.tokenMatcher(this.LA(1), f) === !0; ) this.CONSUME(f), d.call(this);
         this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [p, f, I, d, s.NextTerminalAfterManySepWalker], I, t.MANY_SEP_IDX, p, s.NextTerminalAfterManySepWalker);
       }
-    }, m.prototype.repetitionSepSecondInternal = function(p, E, g, l, d) {
-      for (; g(); ) this.CONSUME(E), l.call(this);
-      this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [p, E, g, l, d], g, t.AT_LEAST_ONE_SEP_IDX, p, d);
-    }, m.prototype.doSingleRepetition = function(p) {
-      var E = this.getLexerPosition();
+    }, E.prototype.repetitionSepSecondInternal = function(p, m, g, l, d) {
+      for (; g(); ) this.CONSUME(m), l.call(this);
+      this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [p, m, g, l, d], g, t.AT_LEAST_ONE_SEP_IDX, p, d);
+    }, E.prototype.doSingleRepetition = function(p) {
+      var m = this.getLexerPosition();
       p.call(this);
       var g = this.getLexerPosition();
-      return g > E;
-    }, m.prototype.orInternal = function(p, E) {
-      var g = this.getKeyForAutomaticLookahead(t.OR_IDX, E), l = e.isArray(p) ? p : p.DEF, d = this.getLaFuncFromCache(g), f = d.call(this, l);
+      return g > m;
+    }, E.prototype.orInternal = function(p, m) {
+      var g = this.getKeyForAutomaticLookahead(t.OR_IDX, m), l = e.isArray(p) ? p : p.DEF, d = this.getLaFuncFromCache(g), f = d.call(this, l);
       if (f !== void 0) {
         var b = l[f];
         return b.ALT.call(this);
       }
-      this.raiseNoAltException(E, p.ERR_MSG);
-    }, m.prototype.ruleFinallyStateUpdate = function() {
+      this.raiseNoAltException(m, p.ERR_MSG);
+    }, E.prototype.ruleFinallyStateUpdate = function() {
       if (this.RULE_STACK.pop(), this.RULE_OCCURRENCE_STACK.pop(), this.cstFinallyStateUpdate(), this.RULE_STACK.length === 0 && this.isAtEndOfInput() === !1) {
-        var p = this.LA(1), E = this.errorMessageProvider.buildNotAllInputParsedMessage({ firstRedundant: p, ruleName: this.getCurrRuleFullName() });
-        this.SAVE_ERROR(new n.NotAllInputParsedException(E, p));
+        var p = this.LA(1), m = this.errorMessageProvider.buildNotAllInputParsedMessage({ firstRedundant: p, ruleName: this.getCurrRuleFullName() });
+        this.SAVE_ERROR(new n.NotAllInputParsedException(m, p));
       }
-    }, m.prototype.subruleInternal = function(p, E, g) {
+    }, E.prototype.subruleInternal = function(p, m, g) {
       var l;
       try {
         var d = g !== void 0 ? g.ARGS : void 0;
-        return l = p.call(this, E, d), this.cstPostNonTerminal(l, g !== void 0 && g.LABEL !== void 0 ? g.LABEL : p.ruleName), l;
+        return l = p.call(this, m, d), this.cstPostNonTerminal(l, g !== void 0 && g.LABEL !== void 0 ? g.LABEL : p.ruleName), l;
       } catch (f) {
         this.subruleInternalError(f, g, p.ruleName);
       }
-    }, m.prototype.subruleInternalError = function(p, E, g) {
-      throw n.isRecognitionException(p) && p.partialCstResult !== void 0 && (this.cstPostNonTerminal(p.partialCstResult, E !== void 0 && E.LABEL !== void 0 ? E.LABEL : g), delete p.partialCstResult), p;
-    }, m.prototype.consumeInternal = function(p, E, g) {
+    }, E.prototype.subruleInternalError = function(p, m, g) {
+      throw n.isRecognitionException(p) && p.partialCstResult !== void 0 && (this.cstPostNonTerminal(p.partialCstResult, m !== void 0 && m.LABEL !== void 0 ? m.LABEL : g), delete p.partialCstResult), p;
+    }, E.prototype.consumeInternal = function(p, m, g) {
       var l;
       try {
         var d = this.LA(1);
         this.tokenMatcher(d, p) === !0 ? (this.consumeToken(), l = d) : this.consumeInternalError(p, d, g);
       } catch (f) {
-        l = this.consumeInternalRecovery(p, E, f);
+        l = this.consumeInternalRecovery(p, m, f);
       }
       return this.cstPostTerminal(g !== void 0 && g.LABEL !== void 0 ? g.LABEL : p.name, l), l;
-    }, m.prototype.consumeInternalError = function(p, E, g) {
+    }, E.prototype.consumeInternalError = function(p, m, g) {
       var l, d = this.LA(0);
-      throw g !== void 0 && g.ERR_MSG ? l = g.ERR_MSG : l = this.errorMessageProvider.buildMismatchTokenMessage({ expected: p, actual: E, previous: d, ruleName: this.getCurrRuleFullName() }), this.SAVE_ERROR(new n.MismatchedTokenException(l, E, d));
-    }, m.prototype.consumeInternalRecovery = function(p, E, g) {
+      throw g !== void 0 && g.ERR_MSG ? l = g.ERR_MSG : l = this.errorMessageProvider.buildMismatchTokenMessage({ expected: p, actual: m, previous: d, ruleName: this.getCurrRuleFullName() }), this.SAVE_ERROR(new n.MismatchedTokenException(l, m, d));
+    }, E.prototype.consumeInternalRecovery = function(p, m, g) {
       if (this.recoveryEnabled && g.name === "MismatchedTokenException" && !this.isBackTracking()) {
-        var l = this.getFollowsForInRuleRecovery(p, E);
+        var l = this.getFollowsForInRuleRecovery(p, m);
         try {
           return this.tryInRuleRecovery(p, l);
         } catch (d) {
           throw d.name === c.IN_RULE_RECOVERY_EXCEPTION ? g : d;
         }
       } else throw g;
-    }, m.prototype.saveRecogState = function() {
-      var p = this.errors, E = e.cloneArr(this.RULE_STACK);
-      return { errors: p, lexerState: this.exportLexerState(), RULE_STACK: E, CST_STACK: this.CST_STACK };
-    }, m.prototype.reloadRecogState = function(p) {
+    }, E.prototype.saveRecogState = function() {
+      var p = this.errors, m = e.cloneArr(this.RULE_STACK);
+      return { errors: p, lexerState: this.exportLexerState(), RULE_STACK: m, CST_STACK: this.CST_STACK };
+    }, E.prototype.reloadRecogState = function(p) {
       this.errors = p.errors, this.importLexerState(p.lexerState), this.RULE_STACK = p.RULE_STACK;
-    }, m.prototype.ruleInvocationStateUpdate = function(p, E, g) {
-      this.RULE_OCCURRENCE_STACK.push(g), this.RULE_STACK.push(p), this.cstInvocationStateUpdate(E, p);
-    }, m.prototype.isBackTracking = function() {
+    }, E.prototype.ruleInvocationStateUpdate = function(p, m, g) {
+      this.RULE_OCCURRENCE_STACK.push(g), this.RULE_STACK.push(p), this.cstInvocationStateUpdate(m, p);
+    }, E.prototype.isBackTracking = function() {
       return this.isBackTrackingStack.length !== 0;
-    }, m.prototype.getCurrRuleFullName = function() {
+    }, E.prototype.getCurrRuleFullName = function() {
       var p = this.getLastExplicitRuleShortName();
       return this.shortRuleNameToFull[p];
-    }, m.prototype.shortRuleNameToFullName = function(p) {
+    }, E.prototype.shortRuleNameToFullName = function(p) {
       return this.shortRuleNameToFull[p];
-    }, m.prototype.isAtEndOfInput = function() {
+    }, E.prototype.isAtEndOfInput = function() {
       return this.tokenMatcher(this.LA(1), A.EOF);
-    }, m.prototype.reset = function() {
+    }, E.prototype.reset = function() {
       this.resetLexerState(), this.isBackTrackingStack = [], this.errors = [], this.RULE_STACK = [], this.CST_STACK = [], this.RULE_OCCURRENCE_STACK = [];
-    }, m;
+    }, E;
   })();
   i.RecognizerEngine = u;
 }), Zo = ve((i) => {
@@ -6080,13 +6080,13 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     }, set: function(c) {
       this._errors = c;
     }, enumerable: !1, configurable: !0 }), o.prototype.raiseEarlyExitException = function(c, A, a) {
-      for (var h = this.getCurrRuleFullName(), u = this.getGAstProductions()[h], m = n.getLookaheadPathsForOptionalProd(c, u, A, this.maxLookahead), p = m[0], E = [], g = 1; g <= this.maxLookahead; g++) E.push(this.LA(g));
-      var l = this.errorMessageProvider.buildEarlyExitMessage({ expectedIterationPaths: p, actual: E, previous: this.LA(0), customUserDescription: a, ruleName: h });
+      for (var h = this.getCurrRuleFullName(), u = this.getGAstProductions()[h], E = n.getLookaheadPathsForOptionalProd(c, u, A, this.maxLookahead), p = E[0], m = [], g = 1; g <= this.maxLookahead; g++) m.push(this.LA(g));
+      var l = this.errorMessageProvider.buildEarlyExitMessage({ expectedIterationPaths: p, actual: m, previous: this.LA(0), customUserDescription: a, ruleName: h });
       throw this.SAVE_ERROR(new e.EarlyExitException(l, this.LA(1), this.LA(0)));
     }, o.prototype.raiseNoAltException = function(c, A) {
-      for (var a = this.getCurrRuleFullName(), h = this.getGAstProductions()[a], u = n.getLookaheadPathsForOr(c, h, this.maxLookahead), m = [], p = 1; p <= this.maxLookahead; p++) m.push(this.LA(p));
-      var E = this.LA(0), g = this.errorMessageProvider.buildNoViableAltMessage({ expectedPathsPerAlt: u, actual: m, previous: E, customUserDescription: A, ruleName: this.getCurrRuleFullName() });
-      throw this.SAVE_ERROR(new e.NoViableAltException(g, this.LA(1), E));
+      for (var a = this.getCurrRuleFullName(), h = this.getGAstProductions()[a], u = n.getLookaheadPathsForOr(c, h, this.maxLookahead), E = [], p = 1; p <= this.maxLookahead; p++) E.push(this.LA(p));
+      var m = this.LA(0), g = this.errorMessageProvider.buildNoViableAltMessage({ expectedPathsPerAlt: u, actual: E, previous: m, customUserDescription: A, ruleName: this.getCurrRuleFullName() });
+      throw this.SAVE_ERROR(new e.NoViableAltException(g, this.LA(1), m));
     }, o;
   })();
   i.ErrorHandler = s;
@@ -6112,11 +6112,11 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   Object.freeze(A);
   var a = !0, h = Math.pow(2, c.BITS_FOR_OCCURRENCE_IDX) - 1, u = s.createToken({ name: "RECORDING_PHASE_TOKEN", pattern: n.Lexer.NA });
   r.augmentTokenTypes([u]);
-  var m = s.createTokenInstance(u, `This IToken indicates the Parser is in Recording Phase
+  var E = s.createTokenInstance(u, `This IToken indicates the Parser is in Recording Phase
 	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details`, -1, -1, -1, -1, -1, -1);
-  Object.freeze(m);
+  Object.freeze(E);
   var p = { name: `This CSTNode indicates the Parser is in Recording Phase
-	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details`, children: {} }, E = (function() {
+	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details`, children: {} }, m = (function() {
     function b() {
     }
     return b.prototype.initGastRecorder = function(I) {
@@ -6215,10 +6215,10 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
         throw x.KNOWN_RECORDER_ERROR = !0, x;
       }
       var j = e.peek(this.recordingProdStack), R = new t.Terminal({ idx: C, terminalType: I });
-      return j.definition.push(R), m;
+      return j.definition.push(R), E;
     }, b;
   })();
-  i.GastRecorder = E;
+  i.GastRecorder = m;
   function g(b, I, C, v) {
     v === void 0 && (v = !1), f(C);
     var x = e.peek(this.recordingProdStack), j = e.isFunction(I) ? I : I.DEF, R = new b({ definition: [], idx: C });
@@ -6302,7 +6302,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     };
   })();
   Object.defineProperty(i, "__esModule", { value: !0 }), i.EmbeddedActionsParser = i.CstParser = i.Parser = i.EMPTY_ALT = i.ParserDefinitionErrorType = i.DEFAULT_RULE_CONFIG = i.DEFAULT_PARSER_CONFIG = i.END_OF_FILE = void 0;
-  var t = Fe(), n = jo(), r = St(), s = gn(), o = qo(), c = pr(), A = zo(), a = Wo(), h = Yo(), u = Jo(), m = Xo(), p = Zo(), E = $o(), g = ea(), l = ta(), d = na();
+  var t = Fe(), n = jo(), r = St(), s = gn(), o = qo(), c = pr(), A = zo(), a = Wo(), h = Yo(), u = Jo(), E = Xo(), p = Zo(), m = $o(), g = ea(), l = ta(), d = na();
   i.END_OF_FILE = r.createTokenInstance(r.EOF, "", NaN, NaN, NaN, NaN, NaN, NaN), Object.freeze(i.END_OF_FILE), i.DEFAULT_PARSER_CONFIG = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: s.defaultParserErrorProvider, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), i.DEFAULT_RULE_CONFIG = Object.freeze({ recoveryValueFunc: function() {
   }, resyncEnabled: !0 }), (function(v) {
     v[v.INVALID_RULE_NAME = 0] = "INVALID_RULE_NAME", v[v.DUPLICATE_RULE_NAME = 1] = "DUPLICATE_RULE_NAME", v[v.INVALID_RULE_OVERRIDE = 2] = "INVALID_RULE_OVERRIDE", v[v.DUPLICATE_PRODUCTIONS = 3] = "DUPLICATE_PRODUCTIONS", v[v.UNRESOLVED_SUBRULE_REF = 4] = "UNRESOLVED_SUBRULE_REF", v[v.LEFT_RECURSION = 5] = "LEFT_RECURSION", v[v.NONE_LAST_EMPTY_ALT = 6] = "NONE_LAST_EMPTY_ALT", v[v.AMBIGUOUS_ALTS = 7] = "AMBIGUOUS_ALTS", v[v.CONFLICT_TOKENS_RULES_NAMESPACE = 8] = "CONFLICT_TOKENS_RULES_NAMESPACE", v[v.INVALID_TOKEN_NAME = 9] = "INVALID_TOKEN_NAME", v[v.NO_NON_EMPTY_LOOKAHEAD = 10] = "NO_NON_EMPTY_LOOKAHEAD", v[v.AMBIGUOUS_PREFIX_ALTS = 11] = "AMBIGUOUS_PREFIX_ALTS", v[v.TOO_MANY_ALTS = 12] = "TOO_MANY_ALTS";
@@ -6367,7 +6367,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       });
     }, v.DEFER_DEFINITION_ERRORS_HANDLING = !1, v;
   })();
-  i.Parser = b, d.applyMixins(b, [c.Recoverable, A.LooksAhead, a.TreeBuilder, h.LexerAdapter, m.RecognizerEngine, u.RecognizerApi, p.ErrorHandler, E.ContentAssist, g.GastRecorder, l.PerformanceTracer]);
+  i.Parser = b, d.applyMixins(b, [c.Recoverable, A.LooksAhead, a.TreeBuilder, h.LexerAdapter, E.RecognizerEngine, u.RecognizerApi, p.ErrorHandler, m.ContentAssist, g.GastRecorder, l.PerformanceTracer]);
   var I = (function(v) {
     e(x, v);
     function x(j, R) {
@@ -6404,14 +6404,14 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
 
 `, u = `
 <link rel='stylesheet' href='` + a + `'>
-`, m = `
+`, E = `
 <script src='` + c + `vendor/railroad-diagrams.js'><\/script>
 <script src='` + c + `src/diagrams_builder.js'><\/script>
 <script src='` + c + `src/diagrams_behavior.js'><\/script>
 <script src='` + c + `src/main.js'><\/script>
 `, p = `
 <div id="diagrams" align="center"></div>
-`, E = `
+`, m = `
 <script>
     window.serializedGrammar = ` + JSON.stringify(n, null, "  ") + `;
 <\/script>
@@ -6421,7 +6421,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     main.drawDiagramsFromSerializedGrammar(serializedGrammar, diagramsDiv);
 <\/script>
 `;
-    return h + u + m + p + E + g;
+    return h + u + E + p + m + g;
   }
   i.createSyntaxDiagramsCode = t;
 }), ra = ve((i) => {
@@ -6518,16 +6518,16 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
 	 Please avoid using it as it will be completely removed in the future`);
   }
   i.clearCache = u;
-  var m = ia();
+  var E = ia();
   Object.defineProperty(i, "createSyntaxDiagramsCode", { enumerable: !0, get: function() {
-    return m.createSyntaxDiagramsCode;
+    return E.createSyntaxDiagramsCode;
   } });
   var p = /* @__PURE__ */ (function() {
-    function E() {
+    function m() {
       throw new Error(`The Parser class has been deprecated, use CstParser or EmbeddedActionsParser instead.
 See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_7-0-0`);
     }
-    return E;
+    return m;
   })();
   i.Parser = p;
 });
@@ -6882,7 +6882,7 @@ class sa extends dt {
           y = p(Q);
           break;
         case "Shape":
-          y = E(Q);
+          y = m(Q);
           break;
         case "Appearance":
           y = g(Q);
@@ -7022,7 +7022,7 @@ class sa extends dt {
       }
       return w;
     }
-    const m = this;
+    const E = this;
     function p(Q) {
       const w = new zt();
       let y, k, B, D, O, G, V, te, ae, ge;
@@ -7066,8 +7066,8 @@ class sa extends dt {
         }
       }
       if (O && G && V && te && ae && ge) {
-        const Qe = new ds(m.manager);
-        m.backgroundTexture = Qe.load([
+        const Qe = new ds(E.manager);
+        E.backgroundTexture = Qe.load([
           ae[0],
           te[0],
           ge[0],
@@ -7099,7 +7099,7 @@ class sa extends dt {
       }
       return w;
     }
-    function E(Q) {
+    function m(Q) {
       const w = Q.fields;
       let y = new Tt({
         name: dt.DEFAULT_MATERIAL_NAME,
@@ -7520,10 +7520,10 @@ class sa extends dt {
         }
       }
       if (y === "LINEAR")
-        m.fog = new ps(w, 0, k);
+        E.fog = new ps(w, 0, k);
       else if (y === "EXPONENTIAL") {
         let D = 0.02;
-        k !== 0 && (D = 2.146 / k), m.fog = new gs(w, D);
+        k !== 0 && (D = 2.146 / k), E.fog = new gs(w, D);
       } else
         console.warn("ThreeMFLoader.VRMLLoader2: Unknown fogType:", y);
       return new ut();
@@ -8087,7 +8087,7 @@ const aa = Yt.CstParser;
 class Aa extends aa {
   constructor(e) {
     super(e);
-    const t = this, n = e.Version, r = e.LCurly, s = e.RCurly, o = e.LSquare, c = e.RSquare, A = e.Identifier, a = e.RouteIdentifier, h = e.StringLiteral, u = e.HexLiteral, m = e.NumberLiteral, p = e.TrueLiteral, E = e.FalseLiteral, g = e.NullLiteral, l = e.DEF, d = e.USE, f = e.ROUTE, b = e.TO, I = e.NodeName;
+    const t = this, n = e.Version, r = e.LCurly, s = e.RCurly, o = e.LSquare, c = e.RSquare, A = e.Identifier, a = e.RouteIdentifier, h = e.StringLiteral, u = e.HexLiteral, E = e.NumberLiteral, p = e.TrueLiteral, m = e.FalseLiteral, g = e.NullLiteral, l = e.DEF, d = e.USE, f = e.ROUTE, b = e.TO, I = e.NodeName;
     t.RULE("vrml", function() {
       t.SUBRULE(t.version), t.AT_LEAST_ONE(function() {
         t.SUBRULE(t.node);
@@ -8145,13 +8145,13 @@ class Aa extends aa {
             t.CONSUME(u);
           } },
           { ALT: function() {
-            t.CONSUME(m);
+            t.CONSUME(E);
           } },
           { ALT: function() {
             t.CONSUME(p);
           } },
           { ALT: function() {
-            t.CONSUME(E);
+            t.CONSUME(m);
           } },
           { ALT: function() {
             t.CONSUME(g);
@@ -8174,7 +8174,7 @@ class Aa extends aa {
             t.CONSUME(u);
           } },
           { ALT: function() {
-            t.CONSUME(m);
+            t.CONSUME(E);
           } },
           { ALT: function() {
             t.CONSUME(g);
@@ -8342,7 +8342,7 @@ class la {
     for (let o = 0; o < e; o++) {
       const A = 1 - 2 * ((o + 0.5) / e);
       for (let a = 0; a < e; a++) {
-        const u = 2 * ((a + 0.5) / e) - 1, m = 1, p = Math.sqrt(u * u + A * A + m * m), E = Math.acos(Math.max(-1, Math.min(1, A / p))), [g, l, d] = this._colorAtPitch(E), f = (o * e + a) * 4;
+        const u = 2 * ((a + 0.5) / e) - 1, E = 1, p = Math.sqrt(u * u + A * A + E * E), m = Math.acos(Math.max(-1, Math.min(1, A / p))), [g, l, d] = this._colorAtPitch(m), f = (o * e + a) * 4;
         s[f] = Math.round(g * 255), s[f + 1] = Math.round(l * 255), s[f + 2] = Math.round(d * 255), s[f + 3] = 255;
       }
     }
@@ -8364,8 +8364,8 @@ class la {
     for (let o = 0; o < e; o++) {
       const c = 2 * (o + 0.5) / e - 1;
       for (let A = 0; A < e; A++) {
-        const a = 2 * (A + 0.5) / e - 1, h = 1, u = Math.sqrt(a * a + h * h + c * c), m = Math.acos(Math.max(-1, Math.min(1, h / u))), [p, E, g] = this._colorAtPitch(m), l = (o * e + A) * 4;
-        s[l] = Math.round(p * 255), s[l + 1] = Math.round(E * 255), s[l + 2] = Math.round(g * 255), s[l + 3] = 255;
+        const a = 2 * (A + 0.5) / e - 1, h = 1, u = Math.sqrt(a * a + h * h + c * c), E = Math.acos(Math.max(-1, Math.min(1, h / u))), [p, m, g] = this._colorAtPitch(E), l = (o * e + A) * 4;
+        s[l] = Math.round(p * 255), s[l + 1] = Math.round(m * 255), s[l + 2] = Math.round(g * 255), s[l + 3] = 255;
       }
     }
     return n.putImageData(r, 0, 0), t;
@@ -8386,8 +8386,8 @@ class la {
     for (let o = 0; o < e; o++) {
       const c = 2 * (o + 0.5) / e - 1;
       for (let A = 0; A < e; A++) {
-        const a = 2 * (A + 0.5) / e - 1, h = -1, u = Math.sqrt(a * a + h * h + c * c), m = Math.acos(Math.max(-1, Math.min(1, h / u))), [p, E, g] = this._colorAtPitch(m), l = (o * e + A) * 4;
-        s[l] = Math.round(p * 255), s[l + 1] = Math.round(E * 255), s[l + 2] = Math.round(g * 255), s[l + 3] = 255;
+        const a = 2 * (A + 0.5) / e - 1, h = -1, u = Math.sqrt(a * a + h * h + c * c), E = Math.acos(Math.max(-1, Math.min(1, h / u))), [p, m, g] = this._colorAtPitch(E), l = (o * e + A) * 4;
+        s[l] = Math.round(p * 255), s[l + 1] = Math.round(m * 255), s[l + 2] = Math.round(g * 255), s[l + 3] = 255;
       }
     }
     return n.putImageData(r, 0, 0), t;
@@ -8451,7 +8451,7 @@ class ha extends dt {
   parse(e) {
     function t(p) {
       c(p) !== "HIERARCHY" && console.error("THREE.BVHLoader2: HIERARCHY expected.");
-      const E = [], g = r(p, c(p), E);
+      const m = [], g = r(p, c(p), m);
       c(p) !== "MOTION" && console.error("THREE.BVHLoader2: MOTION expected.");
       let l = c(p).split(/[\s]+/);
       const d = parseInt(l[1]);
@@ -8460,12 +8460,12 @@ class ha extends dt {
       isNaN(f) && console.error("THREE.BVHLoader2: Failed to read frame time.");
       for (let b = 0; b < d; b++)
         l = c(p).split(/[\s]+/), n(l, b * f, g);
-      return E;
+      return m;
     }
-    function n(p, E, g) {
+    function n(p, m, g) {
       if (g.type === "ENDSITE") return;
       const l = {
-        time: E,
+        time: m,
         position: new _e(),
         rotation: new Jt(),
         scale: new _e(1, 1, 1)
@@ -8505,12 +8505,12 @@ class ha extends dt {
             console.warn("THREE.BVHLoader2: Invalid channel type.");
         }
       for (let C = 0; C < g.children.length; C++)
-        n(p, E, g.children[C]);
+        n(p, m, g.children[C]);
     }
-    function r(p, E, g) {
+    function r(p, m, g) {
       const l = { name: "", type: "", frames: [] };
       g.push(l);
-      let d = E.split(/[\s]+/);
+      let d = m.split(/[\s]+/);
       d[0].toUpperCase() === "END" && d[1].toUpperCase() === "SITE" ? (l.type = "ENDSITE", l.name = "ENDSITE") : (l.name = d[1], l.type = d[0].toUpperCase()), c(p) !== "{" && console.error("THREE.BVHLoader2: Expected opening { after type & name"), d = c(p).split(/[\s]+/), d[0] !== "OFFSET" && console.error("THREE.BVHLoader2: Expected OFFSET but got: " + d[0]), d.length !== 4 && console.error("THREE.BVHLoader2: Invalid number of values for OFFSET.");
       const f = new _e(
         parseFloat(d[1]),
@@ -8529,15 +8529,15 @@ class ha extends dt {
         l.children.push(r(p, b, g));
       }
     }
-    function s(p, E) {
+    function s(p, m) {
       const g = new Ki();
-      if (E.push(g), g.position.add(p.offset), g.name = p.name, p.type !== "ENDSITE")
+      if (m.push(g), g.position.add(p.offset), g.name = p.name, p.type !== "ENDSITE")
         for (let l = 0; l < p.children.length; l++)
-          g.add(s(p.children[l], E));
+          g.add(s(p.children[l], m));
       return g;
     }
     function o(p) {
-      const E = [];
+      const m = [];
       for (let g = 0; g < p.length; g++) {
         const l = p[g];
         if (l.type === "ENDSITE")
@@ -8547,22 +8547,22 @@ class ha extends dt {
           const v = l.frames[C];
           d.push(v.time), f.push(v.position.x + l.offset.x), f.push(v.position.y + l.offset.y), f.push(v.position.z + l.offset.z), b.push(v.rotation.x), b.push(v.rotation.y), b.push(v.rotation.z), b.push(v.rotation.w), I.push(v.scale.x), I.push(v.scale.y), I.push(v.scale.z);
         }
-        A.animateBonePositions && E.push(new an(l.name + ".position", d, f)), A.animateBoneRotations && E.push(new Pn(l.name + ".quaternion", d, b)), A.animateBoneScales && E.push(new an(l.name + ".scale", d, I));
+        A.animateBonePositions && m.push(new an(l.name + ".position", d, f)), A.animateBoneRotations && m.push(new Pn(l.name + ".quaternion", d, b)), A.animateBoneScales && m.push(new an(l.name + ".scale", d, I));
       }
-      return new Vi("animation", -1, E);
+      return new Vi("animation", -1, m);
     }
     function c(p) {
-      let E;
-      for (; (E = p.shift().trim()).length === 0; )
+      let m;
+      for (; (m = p.shift().trim()).length === 0; )
         ;
-      return E;
+      return m;
     }
     const A = this, a = e.split(/[\r\n]+/g), h = t(a), u = [];
     s(h[0], u);
-    const m = o(h);
+    const E = o(h);
     return {
       skeleton: new zi(u),
-      clip: m
+      clip: E
     };
   }
 }
@@ -8823,19 +8823,19 @@ class ma extends Wt {
         this.thumbnails.push(I);
       }
     });
-    const m = s.getElementsByTagNameNS("http://www.w3.org/1999/02/22-rdf-syntax-ns#", "RDF");
-    m[0] && (this.rdf = m[0]);
+    const E = s.getElementsByTagNameNS("http://www.w3.org/1999/02/22-rdf-syntax-ns#", "RDF");
+    E[0] && (this.rdf = E[0]);
     const p = s.getElementsByTagNameNS(o, "htmlfile");
     if (p[0]) {
       const f = p[0].getAttribute("src");
       f && (this.htmlfile = un(t, f));
     }
-    const E = [], g = s.getElementsByTagNameNS(o, "a"), l = {};
+    const m = [], g = s.getElementsByTagNameNS(o, "a"), l = {};
     let d;
     for (const f of Array.from(g)) {
       const b = f.getAttribute("an");
       if (b) {
-        E.push(b), d || (d = b);
+        m.push(b), d || (d = b);
         let I;
         const C = f.getAttribute("bvh");
         if (C && C !== "none") {
@@ -8939,7 +8939,7 @@ class ma extends Wt {
         );
       }
     }
-    return c[0] && (c[0].getAttribute("haltActionNo") !== null && (this.haltActionName = E[Number(c[0].getAttribute("haltActionNo"))]), c[0].getAttribute("walkActionNo") !== null && (this.walkActionName = E[Number(c[0].getAttribute("walkActionNo"))]), c[0].getAttribute("runActionNo") !== null && (this.runActionName = E[Number(c[0].getAttribute("runActionNo"))]), c[0].getAttribute("minWalkSpeed") !== null && (this.minWalkSpeed = Number(c[0].getAttribute("minWalkSpeed"))), c[0].getAttribute("minRunSpeed") !== null && (this.minRunSpeed = Number(c[0].getAttribute("minRunSpeed")))), d && this.syncInit(d, l), this;
+    return c[0] && (c[0].getAttribute("haltActionNo") !== null && (this.haltActionName = m[Number(c[0].getAttribute("haltActionNo"))]), c[0].getAttribute("walkActionNo") !== null && (this.walkActionName = m[Number(c[0].getAttribute("walkActionNo"))]), c[0].getAttribute("runActionNo") !== null && (this.runActionName = m[Number(c[0].getAttribute("runActionNo"))]), c[0].getAttribute("minWalkSpeed") !== null && (this.minWalkSpeed = Number(c[0].getAttribute("minWalkSpeed"))), c[0].getAttribute("minRunSpeed") !== null && (this.minRunSpeed = Number(c[0].getAttribute("minRunSpeed")))), d && this.syncInit(d, l), this;
   }
 }
 function Er(i, e) {
@@ -9133,10 +9133,10 @@ class Ia extends si {
     if (!this.view) return;
     const t = this.view.camera.getPosition(), n = this.view.camera.getQuat();
     if (this.isLeftDown && !this.ctrlKey) {
-      const s = Math.sin(-this.dx * 0.01), o = Math.cos(-this.dx * 0.01), c = Math.sin(-this.dy * 0.01), A = Math.cos(-this.dy * 0.01), a = new Ae(1, 0, 0).apply(n), h = new Ae(0, 1, 0).apply(n), u = new Pe(a.x * c, a.y * c, a.z * c, A), m = new Pe(h.x * s, h.y * s, h.z * s, o), p = new Ae(t);
-      p.sub(this.target), p.apply(u), p.apply(m), p.add(this.target), t.set(p);
-      const E = mt(t, this.target, new Ae(0, 1, 0));
-      E.mul(new Pe(0, 1, 0, 0)), n.set(E);
+      const s = Math.sin(-this.dx * 0.01), o = Math.cos(-this.dx * 0.01), c = Math.sin(-this.dy * 0.01), A = Math.cos(-this.dy * 0.01), a = new Ae(1, 0, 0).apply(n), h = new Ae(0, 1, 0).apply(n), u = new Pe(a.x * c, a.y * c, a.z * c, A), E = new Pe(h.x * s, h.y * s, h.z * s, o), p = new Ae(t);
+      p.sub(this.target), p.apply(u), p.apply(E), p.add(this.target), t.set(p);
+      const m = mt(t, this.target, new Ae(0, 1, 0));
+      m.mul(new Pe(0, 1, 0, 0)), n.set(m);
     } else if (this.isLeftDown) {
       S.v0.set(this.target), S.v0.sub(t);
       const s = 5e-3 * S.v0.length(), o = new Ae(1, 0, 0).apply(n).scale(-this.dx * s), c = new Ae(0, 1, 0).apply(n).scale(this.dy * s);
@@ -9387,44 +9387,44 @@ class Cr {
         width: n,
         height: r
       };
-    }, this.render = function(E, g) {
-      E.matrixWorldAutoUpdate === !0 && E.updateMatrixWorld(), g.parent === null && g.matrixWorldAutoUpdate === !0 && g.updateMatrixWorld(), Ei.copy(g.matrixWorldInverse), Ii.multiplyMatrices(g.projectionMatrix, Ei), h(E, E, g), this.sortObjects && p(E);
-    }, this.setSize = function(E, g) {
-      n = E, r = g, s = n / 2, o = r / 2, A.style.width = E + "px", A.style.height = g + "px";
+    }, this.render = function(m, g) {
+      m.matrixWorldAutoUpdate === !0 && m.updateMatrixWorld(), g.parent === null && g.matrixWorldAutoUpdate === !0 && g.updateMatrixWorld(), Ei.copy(g.matrixWorldInverse), Ii.multiplyMatrices(g.projectionMatrix, Ei), h(m, m, g), this.sortObjects && p(m);
+    }, this.setSize = function(m, g) {
+      n = m, r = g, s = n / 2, o = r / 2, A.style.width = m + "px", A.style.height = g + "px";
     };
-    function a(E) {
-      E.isCSS2DObject && (E.element.style.display = "none");
-      for (let g = 0, l = E.children.length; g < l; g++)
-        a(E.children[g]);
-    }
-    function h(E, g, l) {
-      if (E.visible === !1) {
-        a(E);
+    function a(m) {
+      m.isCSS2DObject && (m.element.style.display = "none");
+      for (let g = 0, l = m.children.length; g < l; g++)
+        a(m.children[g]);
+    }
+    function h(m, g, l) {
+      if (m.visible === !1) {
+        a(m);
         return;
       }
-      if (E.isCSS2DObject) {
-        _t.setFromMatrixPosition(E.matrixWorld), _t.applyMatrix4(Ii);
-        const d = _t.z >= -1 && _t.z <= 1 && E.layers.test(l.layers) === !0, f = E.element;
-        f.style.display = d === !0 ? "" : "none", d === !0 && (E.onBeforeRender(t, g, l), f.style.transform = "translate(" + -100 * E.center.x + "%," + -100 * E.center.y + "%)translate(" + (_t.x * s + s) + "px," + (-_t.y * o + o) + "px)", f.parentNode !== A && A.appendChild(f), E.onAfterRender(t, g, l));
+      if (m.isCSS2DObject) {
+        _t.setFromMatrixPosition(m.matrixWorld), _t.applyMatrix4(Ii);
+        const d = _t.z >= -1 && _t.z <= 1 && m.layers.test(l.layers) === !0, f = m.element;
+        f.style.display = d === !0 ? "" : "none", d === !0 && (m.onBeforeRender(t, g, l), f.style.transform = "translate(" + -100 * m.center.x + "%," + -100 * m.center.y + "%)translate(" + (_t.x * s + s) + "px," + (-_t.y * o + o) + "px)", f.parentNode !== A && A.appendChild(f), m.onAfterRender(t, g, l));
         const b = {
-          distanceToCameraSquared: u(l, E)
+          distanceToCameraSquared: u(l, m)
         };
-        c.objects.set(E, b);
+        c.objects.set(m, b);
       }
-      for (let d = 0, f = E.children.length; d < f; d++)
-        h(E.children[d], g, l);
+      for (let d = 0, f = m.children.length; d < f; d++)
+        h(m.children[d], g, l);
     }
-    function u(E, g) {
-      return bi.setFromMatrixPosition(E.matrixWorld), Ci.setFromMatrixPosition(g.matrixWorld), bi.distanceToSquared(Ci);
+    function u(m, g) {
+      return bi.setFromMatrixPosition(m.matrixWorld), Ci.setFromMatrixPosition(g.matrixWorld), bi.distanceToSquared(Ci);
     }
-    function m(E) {
+    function E(m) {
       const g = [];
-      return E.traverseVisible(function(l) {
+      return m.traverseVisible(function(l) {
         l.isCSS2DObject && g.push(l);
       }), g;
     }
-    function p(E) {
-      const g = m(E).sort(function(d, f) {
+    function p(m) {
+      const g = E(m).sort(function(d, f) {
         if (d.renderOrder !== f.renderOrder)
           return f.renderOrder - d.renderOrder;
         const b = c.objects.get(d).distanceToCameraSquared, I = c.objects.get(f).distanceToCameraSquared;
@@ -9633,7 +9633,7 @@ class yr extends dt {
     }
     if (s.extensionsUsed)
       for (let h = 0; h < s.extensionsUsed.length; ++h) {
-        const u = s.extensionsUsed[h], m = s.extensionsRequired || [];
+        const u = s.extensionsUsed[h], E = s.extensionsRequired || [];
         switch (u) {
           case ke.KHR_MATERIALS_UNLIT:
             o[u] = new wa();
@@ -9648,7 +9648,7 @@ class yr extends dt {
             o[u] = new qa();
             break;
           default:
-            m.indexOf(u) >= 0 && c[u] === void 0 && console.warn('THREE.GLTFLoader: Unknown extension "' + u + '".');
+            E.indexOf(u) >= 0 && c[u] === void 0 && console.warn('THREE.GLTFLoader: Unknown extension "' + u + '".');
         }
       }
     a.setExtensions(o), a.setPlugins(c), a.parse(n, r);
@@ -10027,12 +10027,12 @@ class Pa {
         return null;
       }
       return s.then(function(c) {
-        const A = r.byteOffset || 0, a = r.byteLength || 0, h = r.count, u = r.byteStride, m = new Uint8Array(c, A, a);
-        return o.decodeGltfBufferAsync ? o.decodeGltfBufferAsync(h, u, m, r.mode, r.filter).then(function(p) {
+        const A = r.byteOffset || 0, a = r.byteLength || 0, h = r.count, u = r.byteStride, E = new Uint8Array(c, A, a);
+        return o.decodeGltfBufferAsync ? o.decodeGltfBufferAsync(h, u, E, r.mode, r.filter).then(function(p) {
           return p.buffer;
         }) : o.ready.then(function() {
           const p = new ArrayBuffer(h * u);
-          return o.decodeGltfBuffer(new Uint8Array(p), h, u, m, r.mode, r.filter), p;
+          return o.decodeGltfBuffer(new Uint8Array(p), h, u, E, r.mode, r.filter), p;
         });
       });
     } else
@@ -10055,17 +10055,17 @@ class Ga {
     for (const a in o)
       c.push(this.parser.getDependency("accessor", o[a]).then((h) => (A[a] = h, A[a])));
     return c.length < 1 ? null : (c.push(this.parser.createNodeMesh(e)), Promise.all(c).then((a) => {
-      const h = a.pop(), u = h.isGroup ? h.children : [h], m = a[0].count, p = [];
-      for (const E of u) {
-        const g = new Mt(), l = new _e(), d = new Jt(), f = new _e(1, 1, 1), b = new ws(E.geometry, E.material, m);
-        for (let I = 0; I < m; I++)
+      const h = a.pop(), u = h.isGroup ? h.children : [h], E = a[0].count, p = [];
+      for (const m of u) {
+        const g = new Mt(), l = new _e(), d = new Jt(), f = new _e(1, 1, 1), b = new ws(m.geometry, m.material, E);
+        for (let I = 0; I < E; I++)
           A.TRANSLATION && l.fromBufferAttribute(A.TRANSLATION, I), A.ROTATION && d.fromBufferAttribute(A.ROTATION, I), A.SCALE && f.fromBufferAttribute(A.SCALE, I), b.setMatrixAt(I, g.compose(l, d, f));
         for (const I in A)
           if (I === "_COLOR_0") {
             const C = A[I];
             b.instanceColor = new vs(C.array, C.itemSize, C.normalized);
-          } else I !== "TRANSLATION" && I !== "ROTATION" && I !== "SCALE" && E.geometry.setAttribute(I, A[I]);
-        ut.prototype.copy.call(b, E), this.parser.assignFinalMaterial(b), p.push(b);
+          } else I !== "TRANSLATION" && I !== "ROTATION" && I !== "SCALE" && m.geometry.setAttribute(I, A[I]);
+        ut.prototype.copy.call(b, m), this.parser.assignFinalMaterial(b), p.push(b);
       }
       return h.isGroup ? (h.clear(), h.add(...p), h) : p[0];
     }));
@@ -10118,19 +10118,19 @@ class ja {
     for (const h in e.attributes) {
       const u = Wn[h] || h.toLowerCase();
       if (o[h] !== void 0) {
-        const m = n.accessors[e.attributes[h]], p = Ot[m.componentType];
-        a[u] = p.name, A[u] = m.normalized === !0;
+        const E = n.accessors[e.attributes[h]], p = Ot[E.componentType];
+        a[u] = p.name, A[u] = E.normalized === !0;
       }
     }
     return t.getDependency("bufferView", s).then(function(h) {
-      return new Promise(function(u, m) {
+      return new Promise(function(u, E) {
         r.decodeDracoFile(h, function(p) {
-          for (const E in p.attributes) {
-            const g = p.attributes[E], l = A[E];
+          for (const m in p.attributes) {
+            const g = p.attributes[m], l = A[m];
             l !== void 0 && (g.normalized = l);
           }
           u(p);
-        }, c, a, At, m);
+        }, c, a, At, E);
       });
     });
   }
@@ -10159,9 +10159,9 @@ class wr extends Ms {
     return t;
   }
   interpolate_(e, t, n, r) {
-    const s = this.resultBuffer, o = this.sampleValues, c = this.valueSize, A = c * 2, a = c * 3, h = r - t, u = (n - t) / h, m = u * u, p = m * u, E = e * a, g = E - a, l = -2 * p + 3 * m, d = p - m, f = 1 - l, b = d - m + u;
+    const s = this.resultBuffer, o = this.sampleValues, c = this.valueSize, A = c * 2, a = c * 3, h = r - t, u = (n - t) / h, E = u * u, p = E * u, m = e * a, g = m - a, l = -2 * p + 3 * E, d = p - E, f = 1 - l, b = d - E + u;
     for (let I = 0; I !== c; I++) {
-      const C = o[g + I + c], v = o[g + I + A] * h, x = o[E + I + c], j = o[E + I] * h;
+      const C = o[g + I + c], v = o[g + I + A] * h, x = o[m + I + c], j = o[m + I] * h;
       s[I] = f * C + b * v + l * x + d * j;
     }
     return s;
@@ -10264,16 +10264,16 @@ function Ya(i, e, t) {
   for (let a = 0, h = e.length; a < h; a++) {
     const u = e[a];
     if (n) {
-      const m = u.POSITION !== void 0 ? t.getDependency("accessor", u.POSITION) : i.attributes.position;
-      o.push(m);
+      const E = u.POSITION !== void 0 ? t.getDependency("accessor", u.POSITION) : i.attributes.position;
+      o.push(E);
     }
     if (r) {
-      const m = u.NORMAL !== void 0 ? t.getDependency("accessor", u.NORMAL) : i.attributes.normal;
-      c.push(m);
+      const E = u.NORMAL !== void 0 ? t.getDependency("accessor", u.NORMAL) : i.attributes.normal;
+      c.push(E);
     }
     if (s) {
-      const m = u.COLOR_0 !== void 0 ? t.getDependency("accessor", u.COLOR_0) : i.attributes.color;
-      A.push(m);
+      const E = u.COLOR_0 !== void 0 ? t.getDependency("accessor", u.COLOR_0) : i.attributes.color;
+      A.push(E);
     }
   }
   return Promise.all([
@@ -10281,8 +10281,8 @@ function Ya(i, e, t) {
     Promise.all(c),
     Promise.all(A)
   ]).then(function(a) {
-    const h = a[0], u = a[1], m = a[2];
-    return n && (i.morphAttributes.position = h), r && (i.morphAttributes.normal = u), s && (i.morphAttributes.color = m), i.morphTargetsRelative = !0, i;
+    const h = a[0], u = a[1], E = a[2];
+    return n && (i.morphAttributes.position = h), r && (i.morphAttributes.normal = u), s && (i.morphAttributes.color = E), i.morphTargetsRelative = !0, i;
   });
 }
 function Ja(i, e) {
@@ -10587,14 +10587,14 @@ class eA {
     }
     const s = [];
     return r.bufferView !== void 0 ? s.push(this.getDependency("bufferView", r.bufferView)) : s.push(null), r.sparse !== void 0 && (s.push(this.getDependency("bufferView", r.sparse.indices.bufferView)), s.push(this.getDependency("bufferView", r.sparse.values.bufferView))), Promise.all(s).then(function(o) {
-      const c = o[0], A = Rn[r.type], a = Ot[r.componentType], h = a.BYTES_PER_ELEMENT, u = h * A, m = r.byteOffset || 0, p = r.bufferView !== void 0 ? n.bufferViews[r.bufferView].byteStride : void 0, E = r.normalized === !0;
+      const c = o[0], A = Rn[r.type], a = Ot[r.componentType], h = a.BYTES_PER_ELEMENT, u = h * A, E = r.byteOffset || 0, p = r.bufferView !== void 0 ? n.bufferViews[r.bufferView].byteStride : void 0, m = r.normalized === !0;
       let g, l;
       if (p && p !== u) {
-        const d = Math.floor(m / p), f = "InterleavedBuffer:" + r.bufferView + ":" + r.componentType + ":" + d + ":" + r.count;
+        const d = Math.floor(E / p), f = "InterleavedBuffer:" + r.bufferView + ":" + r.componentType + ":" + d + ":" + r.count;
         let b = t.cache.get(f);
-        b || (g = new a(c, d * p, r.count * p / h), b = new Yi(g, p / h), t.cache.add(f, b)), l = new Ji(b, A, m % p / h, E);
+        b || (g = new a(c, d * p, r.count * p / h), b = new Yi(g, p / h), t.cache.add(f, b)), l = new Ji(b, A, E % p / h, m);
       } else
-        c === null ? g = new a(r.count * A) : g = new a(c, m, r.count * A), l = new Kt(g, A, E);
+        c === null ? g = new a(r.count * A) : g = new a(c, E, r.count * A), l = new Kt(g, A, m);
       if (r.sparse !== void 0) {
         const d = Rn.SCALAR, f = Ot[r.sparse.indices.componentType], b = r.sparse.indices.byteOffset || 0, I = r.sparse.values.byteOffset || 0, C = new f(o[1], b, r.sparse.count * d), v = new a(o[2], I, r.sparse.count * A);
         c !== null && (l = new Kt(l.array.slice(), l.itemSize, l.normalized)), l.normalized = !1;
@@ -10602,7 +10602,7 @@ class eA {
           const R = C[x];
           if (l.setX(R, v[x * A]), A >= 2 && l.setY(R, v[x * A + 1]), A >= 3 && l.setZ(R, v[x * A + 2]), A >= 4 && l.setW(R, v[x * A + 3]), A >= 5) throw new Error("THREE.GLTFLoader: Unsupported itemSize in sparse BufferAttribute.");
         }
-        l.normalized = E;
+        l.normalized = m;
       }
       return l;
     });
@@ -10629,8 +10629,8 @@ class eA {
       return this.textureCache[A];
     const a = this.loadImageSource(t, n).then(function(h) {
       h.flipY = !1, h.name = o.name || c.name || "", h.name === "" && typeof c.uri == "string" && c.uri.startsWith("data:image/") === !1 && (h.name = c.uri);
-      const m = (s.samplers || {})[o.sampler] || {};
-      return h.magFilter = wi[m.magFilter] || Bt, h.minFilter = wi[m.minFilter] || Zt, h.wrapS = vi[m.wrapS] || Rt, h.wrapT = vi[m.wrapT] || Rt, h.generateMipmaps = !h.isCompressedTexture && h.minFilter !== An && h.minFilter !== Bt, r.associations.set(h, { textures: e }), h;
+      const E = (s.samplers || {})[o.sampler] || {};
+      return h.magFilter = wi[E.magFilter] || Bt, h.minFilter = wi[E.minFilter] || Zt, h.wrapS = vi[E.wrapS] || Rt, h.wrapT = vi[E.wrapT] || Rt, h.generateMipmaps = !h.isCompressedTexture && h.minFilter !== An && h.minFilter !== Bt, r.associations.set(h, { textures: e }), h;
     }).catch(function() {
       return null;
     });
@@ -10645,18 +10645,18 @@ class eA {
     if (o.bufferView !== void 0)
       A = n.getDependency("bufferView", o.bufferView).then(function(u) {
         a = !0;
-        const m = new Blob([u], { type: o.mimeType });
-        return A = c.createObjectURL(m), A;
+        const E = new Blob([u], { type: o.mimeType });
+        return A = c.createObjectURL(E), A;
       });
     else if (o.uri === void 0)
       throw new Error("THREE.GLTFLoader: Image " + e + " is missing URI and bufferView");
     const h = Promise.resolve(A).then(function(u) {
-      return new Promise(function(m, p) {
-        let E = m;
-        t.isImageBitmapLoader === !0 && (E = function(g) {
+      return new Promise(function(E, p) {
+        let m = E;
+        t.isImageBitmapLoader === !0 && (m = function(g) {
           const l = new Ai(g);
-          l.needsUpdate = !0, m(l);
-        }), t.load(Ft.resolveURL(u, s.path), E, void 0, p);
+          l.needsUpdate = !0, E(l);
+        }), t.load(Ft.resolveURL(u, s.path), m, void 0, p);
       });
     }).then(function(u) {
       return a === !0 && c.revokeObjectURL(A), ct(u, o), u.userData.mimeType = o.mimeType || Za(o.uri), u;
@@ -10740,13 +10740,13 @@ class eA {
     } else {
       const u = s.pbrMetallicRoughness || {};
       if (c.color = new Xe(1, 1, 1), c.opacity = 1, Array.isArray(u.baseColorFactor)) {
-        const m = u.baseColorFactor;
-        c.color.setRGB(m[0], m[1], m[2], At), c.opacity = m[3];
+        const E = u.baseColorFactor;
+        c.color.setRGB(E[0], E[1], E[2], At), c.opacity = E[3];
       }
-      u.baseColorTexture !== void 0 && a.push(t.assignTexture(c, "map", u.baseColorTexture, Ze)), c.metalness = u.metallicFactor !== void 0 ? u.metallicFactor : 1, c.roughness = u.roughnessFactor !== void 0 ? u.roughnessFactor : 1, u.metallicRoughnessTexture !== void 0 && (a.push(t.assignTexture(c, "metalnessMap", u.metallicRoughnessTexture)), a.push(t.assignTexture(c, "roughnessMap", u.metallicRoughnessTexture))), o = this._invokeOne(function(m) {
-        return m.getMaterialType && m.getMaterialType(e);
-      }), a.push(Promise.all(this._invokeAll(function(m) {
-        return m.extendMaterialParams && m.extendMaterialParams(e, c);
+      u.baseColorTexture !== void 0 && a.push(t.assignTexture(c, "map", u.baseColorTexture, Ze)), c.metalness = u.metallicFactor !== void 0 ? u.metallicFactor : 1, c.roughness = u.roughnessFactor !== void 0 ? u.roughnessFactor : 1, u.metallicRoughnessTexture !== void 0 && (a.push(t.assignTexture(c, "metalnessMap", u.metallicRoughnessTexture)), a.push(t.assignTexture(c, "roughnessMap", u.metallicRoughnessTexture))), o = this._invokeOne(function(E) {
+        return E.getMaterialType && E.getMaterialType(e);
+      }), a.push(Promise.all(this._invokeAll(function(E) {
+        return E.extendMaterialParams && E.extendMaterialParams(e, c);
       })));
     }
     s.doubleSided === !0 && (c.side = Pi);
@@ -10797,8 +10797,8 @@ class eA {
       if (u)
         o.push(u.promise);
       else {
-        let m;
-        a.extensions && a.extensions[ke.KHR_DRACO_MESH_COMPRESSION] ? m = s(a) : m = Ti(new Ct(), a, t), r[h] = { primitive: a, promise: m }, o.push(m);
+        let E;
+        a.extensions && a.extensions[ke.KHR_DRACO_MESH_COMPRESSION] ? E = s(a) : E = Ti(new Ct(), a, t), r[h] = { primitive: a, promise: E }, o.push(E);
       }
     }
     return Promise.all(o);
@@ -10818,7 +10818,7 @@ class eA {
     }
     return c.push(t.loadGeometries(o)), Promise.all(c).then(function(A) {
       const a = A.slice(0, A.length - 1), h = A[A.length - 1], u = [];
-      for (let p = 0, E = h.length; p < E; p++) {
+      for (let p = 0, m = h.length; p < m; p++) {
         const g = h[p], l = o[p];
         let d;
         const f = a[p];
@@ -10836,18 +10836,18 @@ class eA {
           throw new Error("THREE.GLTFLoader: Primitive mode unsupported: " + l.mode);
         Object.keys(d.geometry.morphAttributes).length > 0 && Ja(d, s), d.name = t.createUniqueName(s.name || "mesh_" + e), ct(d, s), l.extensions && wt(r, d, l), t.assignFinalMaterial(d), u.push(d);
       }
-      for (let p = 0, E = u.length; p < E; p++)
+      for (let p = 0, m = u.length; p < m; p++)
         t.associations.set(u[p], {
           meshes: e,
           primitives: p
         });
       if (u.length === 1)
         return s.extensions && wt(r, u[0], s), u[0];
-      const m = new zt();
-      s.extensions && wt(r, m, s), t.associations.set(m, { meshes: e });
-      for (let p = 0, E = u.length; p < E; p++)
-        m.add(u[p]);
-      return m;
+      const E = new zt();
+      s.extensions && wt(r, E, s), t.associations.set(E, { meshes: e });
+      for (let p = 0, m = u.length; p < m; p++)
+        E.add(u[p]);
+      return E;
     });
   }
   /**
@@ -10883,8 +10883,8 @@ class eA {
         const u = o[a];
         if (u) {
           c.push(u);
-          const m = new Mt();
-          s !== null && m.fromArray(s.array, a * 16), A.push(m);
+          const E = new Mt();
+          s !== null && E.fromArray(s.array, a * 16), A.push(E);
         } else
           console.warn('THREE.GLTFLoader: Joint "%s" could not be found.', t.joints[a]);
       }
@@ -10900,9 +10900,9 @@ class eA {
    */
   loadAnimation(e) {
     const t = this.json, n = this, r = t.animations[e], s = r.name ? r.name : "animation_" + e, o = [], c = [], A = [], a = [], h = [];
-    for (let u = 0, m = r.channels.length; u < m; u++) {
-      const p = r.channels[u], E = r.samplers[p.sampler], g = p.target, l = g.node, d = r.parameters !== void 0 ? r.parameters[E.input] : E.input, f = r.parameters !== void 0 ? r.parameters[E.output] : E.output;
-      g.node !== void 0 && (o.push(this.getDependency("node", l)), c.push(this.getDependency("accessor", d)), A.push(this.getDependency("accessor", f)), a.push(E), h.push(g));
+    for (let u = 0, E = r.channels.length; u < E; u++) {
+      const p = r.channels[u], m = r.samplers[p.sampler], g = p.target, l = g.node, d = r.parameters !== void 0 ? r.parameters[m.input] : m.input, f = r.parameters !== void 0 ? r.parameters[m.output] : m.output;
+      g.node !== void 0 && (o.push(this.getDependency("node", l)), c.push(this.getDependency("accessor", d)), A.push(this.getDependency("accessor", f)), a.push(m), h.push(g));
     }
     return Promise.all([
       Promise.all(o),
@@ -10911,9 +10911,9 @@ class eA {
       Promise.all(a),
       Promise.all(h)
     ]).then(function(u) {
-      const m = u[0], p = u[1], E = u[2], g = u[3], l = u[4], d = [];
-      for (let b = 0, I = m.length; b < I; b++) {
-        const C = m[b], v = p[b], x = E[b], j = g[b], R = l[b];
+      const E = u[0], p = u[1], m = u[2], g = u[3], l = u[4], d = [];
+      for (let b = 0, I = E.length; b < I; b++) {
+        const C = E[b], v = p[b], x = m[b], j = g[b], R = l[b];
         if (C === void 0) continue;
         C.updateMatrix && C.updateMatrix();
         const M = n._createAnimationTracks(C, v, x, j, R);
@@ -10953,11 +10953,11 @@ class eA {
       Promise.all(o),
       A
     ]).then(function(a) {
-      const h = a[0], u = a[1], m = a[2];
-      m !== null && h.traverse(function(p) {
-        p.isSkinnedMesh && p.bind(m, $a);
+      const h = a[0], u = a[1], E = a[2];
+      E !== null && h.traverse(function(p) {
+        p.isSkinnedMesh && p.bind(E, $a);
       });
-      for (let p = 0, E = u.length; p < E; p++)
+      for (let p = 0, m = u.length; p < m; p++)
         h.add(u[p]);
       return h;
     });
@@ -10980,7 +10980,7 @@ class eA {
     }), this.nodeCache[e] = Promise.all(c).then(function(a) {
       let h;
       if (s.isBone === !0 ? h = new Ki() : a.length > 1 ? h = new zt() : a.length === 1 ? h = a[0] : h = new ut(), h !== a[0])
-        for (let u = 0, m = a.length; u < m; u++)
+        for (let u = 0, E = a.length; u < E; u++)
           h.add(a[u]);
       if (s.name && (h.userData.name = s.name, h.name = o), ct(h, s), s.extensions && wt(n, h, s), s.matrix !== void 0) {
         const u = new Mt();
@@ -11014,11 +11014,11 @@ class eA {
         s.add(A[h]);
       const a = (h) => {
         const u = /* @__PURE__ */ new Map();
-        for (const [m, p] of r.associations)
-          (m instanceof Bn || m instanceof Ai) && u.set(m, p);
-        return h.traverse((m) => {
-          const p = r.associations.get(m);
-          p != null && u.set(m, p);
+        for (const [E, p] of r.associations)
+          (E instanceof Bn || E instanceof Ai) && u.set(E, p);
+        return h.traverse((E) => {
+          const p = r.associations.get(E);
+          p != null && u.set(E, p);
         }), u;
       };
       return r.associations = a(s), s;
@@ -11026,8 +11026,8 @@ class eA {
   }
   _createAnimationTracks(e, t, n, r, s) {
     const o = [], c = e.name ? e.name : e.uuid, A = [];
-    bt[s.path] === bt.weights ? e.traverse(function(m) {
-      m.morphTargetInfluences && A.push(m.name ? m.name : m.uuid);
+    bt[s.path] === bt.weights ? e.traverse(function(E) {
+      E.morphTargetInfluences && A.push(E.name ? E.name : E.uuid);
     }) : A.push(c);
     let a;
     switch (bt[s.path]) {
@@ -11046,14 +11046,14 @@ class eA {
         break;
     }
     const h = r.interpolation !== void 0 ? Va[r.interpolation] : $i, u = this._getArrayFromAccessor(n);
-    for (let m = 0, p = A.length; m < p; m++) {
-      const E = new a(
-        A[m] + "." + bt[s.path],
+    for (let E = 0, p = A.length; E < p; E++) {
+      const m = new a(
+        A[E] + "." + bt[s.path],
         t.array,
         u,
         h
       );
-      r.interpolation === "CUBICSPLINE" && this._createCubicSplineTrackInterpolant(E), o.push(E);
+      r.interpolation === "CUBICSPLINE" && this._createCubicSplineTrackInterpolant(m), o.push(m);
     }
     return o;
   }
@@ -11098,10 +11098,10 @@ function tA(i, e, t) {
     for (let a = 0, h = s.length; a < h; a++) {
       const u = s[a];
       if (u.POSITION !== void 0) {
-        const m = t.json.accessors[u.POSITION], p = m.min, E = m.max;
-        if (p !== void 0 && E !== void 0) {
-          if (A.setX(Math.max(Math.abs(p[0]), Math.abs(E[0]))), A.setY(Math.max(Math.abs(p[1]), Math.abs(E[1]))), A.setZ(Math.max(Math.abs(p[2]), Math.abs(E[2]))), m.normalized) {
-            const g = Yn(Ot[m.componentType]);
+        const E = t.json.accessors[u.POSITION], p = E.min, m = E.max;
+        if (p !== void 0 && m !== void 0) {
+          if (A.setX(Math.max(Math.abs(p[0]), Math.abs(m[0]))), A.setY(Math.max(Math.abs(p[1]), Math.abs(m[1]))), A.setZ(Math.max(Math.abs(p[2]), Math.abs(m[2]))), E.normalized) {
+            const g = Yn(Ot[E.componentType]);
             A.multiplyScalar(g);
           }
           c.max(A);
@@ -11343,14 +11343,14 @@ function iA() {
       case "decode":
         const A = c.buffer, a = c.taskConfig;
         e.then((h) => {
-          const u = h.draco, m = new u.Decoder();
+          const u = h.draco, E = new u.Decoder();
           try {
-            const p = t(u, m, new Int8Array(A), a), E = p.attributes.map((g) => g.array.buffer);
-            p.index && E.push(p.index.array.buffer), self.postMessage({ type: "decode", id: c.id, geometry: p }, E);
+            const p = t(u, E, new Int8Array(A), a), m = p.attributes.map((g) => g.array.buffer);
+            p.index && m.push(p.index.array.buffer), self.postMessage({ type: "decode", id: c.id, geometry: p }, m);
           } catch (p) {
             console.error(p), self.postMessage({ type: "error", id: c.id, error: p.message });
           } finally {
-            u.destroy(m);
+            u.destroy(E);
           }
         });
         break;
@@ -11358,40 +11358,40 @@ function iA() {
   };
   function t(o, c, A, a) {
     const h = a.attributeIDs, u = a.attributeTypes;
-    let m, p;
-    const E = c.GetEncodedGeometryType(A);
-    if (E === o.TRIANGULAR_MESH)
-      m = new o.Mesh(), p = c.DecodeArrayToMesh(A, A.byteLength, m);
-    else if (E === o.POINT_CLOUD)
-      m = new o.PointCloud(), p = c.DecodeArrayToPointCloud(A, A.byteLength, m);
+    let E, p;
+    const m = c.GetEncodedGeometryType(A);
+    if (m === o.TRIANGULAR_MESH)
+      E = new o.Mesh(), p = c.DecodeArrayToMesh(A, A.byteLength, E);
+    else if (m === o.POINT_CLOUD)
+      E = new o.PointCloud(), p = c.DecodeArrayToPointCloud(A, A.byteLength, E);
     else
       throw new Error("THREE.DRACOLoader: Unexpected geometry type.");
-    if (!p.ok() || m.ptr === 0)
+    if (!p.ok() || E.ptr === 0)
       throw new Error("THREE.DRACOLoader: Decoding failed: " + p.error_msg());
     const g = { index: null, attributes: [] };
     for (const l in h) {
       const d = self[u[l]];
       let f, b;
       if (a.useUniqueIDs)
-        b = h[l], f = c.GetAttributeByUniqueId(m, b);
+        b = h[l], f = c.GetAttributeByUniqueId(E, b);
       else {
-        if (b = c.GetAttributeId(m, o[h[l]]), b === -1) continue;
-        f = c.GetAttribute(m, b);
+        if (b = c.GetAttributeId(E, o[h[l]]), b === -1) continue;
+        f = c.GetAttribute(E, b);
       }
-      const I = r(o, c, m, l, d, f);
+      const I = r(o, c, E, l, d, f);
       l === "color" && (I.vertexColorSpace = a.vertexColorSpace), g.attributes.push(I);
     }
-    return E === o.TRIANGULAR_MESH && (g.index = n(o, c, m)), o.destroy(m), g;
+    return m === o.TRIANGULAR_MESH && (g.index = n(o, c, E)), o.destroy(E), g;
   }
   function n(o, c, A) {
-    const h = A.num_faces() * 3, u = h * 4, m = o._malloc(u);
-    c.GetTrianglesUInt32Array(A, u, m);
-    const p = new Uint32Array(o.HEAPF32.buffer, m, h).slice();
-    return o._free(m), { array: p, itemSize: 1 };
+    const h = A.num_faces() * 3, u = h * 4, E = o._malloc(u);
+    c.GetTrianglesUInt32Array(A, u, E);
+    const p = new Uint32Array(o.HEAPF32.buffer, E, h).slice();
+    return o._free(E), { array: p, itemSize: 1 };
   }
   function r(o, c, A, a, h, u) {
-    const m = A.num_points(), p = u.num_components(), E = s(o, h), g = p * h.BYTES_PER_ELEMENT, l = Math.ceil(g / 4) * 4, d = l / h.BYTES_PER_ELEMENT, f = m * g, b = m * l, I = o._malloc(f);
-    c.GetAttributeDataArrayForAllPoints(A, u, E, f, I);
+    const E = A.num_points(), p = u.num_components(), m = s(o, h), g = p * h.BYTES_PER_ELEMENT, l = Math.ceil(g / 4) * 4, d = l / h.BYTES_PER_ELEMENT, f = E * g, b = E * l, I = o._malloc(f);
+    c.GetAttributeDataArrayForAllPoints(A, u, m, f, I);
     const C = new h(o.HEAPF32.buffer, I, f / h.BYTES_PER_ELEMENT);
     let v;
     if (g === l)
@@ -11407,7 +11407,7 @@ function iA() {
     }
     return o._free(I), {
       name: a,
-      count: m,
+      count: E,
       itemSize: p,
       array: v,
       stride: d
@@ -11546,11 +11546,11 @@ function dA(i) {
   if (e[0] !== $e[0] || e[1] !== $e[1] || e[2] !== $e[2] || e[3] !== $e[3] || e[4] !== $e[4] || e[5] !== $e[5] || e[6] !== $e[6] || e[7] !== $e[7] || e[8] !== $e[8] || e[9] !== $e[9] || e[10] !== $e[10] || e[11] !== $e[11]) throw new Error("Missing KTX 2.0 identifier.");
   const t = { vkFormat: 0, typeSize: 1, pixelWidth: 0, pixelHeight: 0, pixelDepth: 0, layerCount: 0, faceCount: 1, levelCount: 0, supercompressionScheme: 0, levels: [], dataFormatDescriptor: [{ vendorId: 0, descriptorType: 0, versionNumber: 2, colorModel: 0, colorPrimaries: 1, transferFunction: 2, flags: 0, texelBlockDimension: [0, 0, 0, 0], bytesPlane: [0, 0, 0, 0, 0, 0, 0, 0], samples: [] }], keyValue: {}, globalData: null }, n = 17 * Uint32Array.BYTES_PER_ELEMENT, r = new Ut(i, $e.length, n, !0);
   t.vkFormat = r._nextUint32(), t.typeSize = r._nextUint32(), t.pixelWidth = r._nextUint32(), t.pixelHeight = r._nextUint32(), t.pixelDepth = r._nextUint32(), t.layerCount = r._nextUint32(), t.faceCount = r._nextUint32(), t.levelCount = r._nextUint32(), t.supercompressionScheme = r._nextUint32();
-  const s = r._nextUint32(), o = r._nextUint32(), c = r._nextUint32(), A = r._nextUint32(), a = r._nextUint64(), h = r._nextUint64(), u = 3 * Math.max(t.levelCount, 1) * 8, m = new Ut(i, $e.length + n, u, !0);
-  for (let oe = 0, se = Math.max(t.levelCount, 1); oe < se; oe++) t.levels.push({ levelData: new Uint8Array(i.buffer, i.byteOffset + m._nextUint64(), m._nextUint64()), uncompressedByteLength: m._nextUint64() });
+  const s = r._nextUint32(), o = r._nextUint32(), c = r._nextUint32(), A = r._nextUint32(), a = r._nextUint64(), h = r._nextUint64(), u = 3 * Math.max(t.levelCount, 1) * 8, E = new Ut(i, $e.length + n, u, !0);
+  for (let oe = 0, se = Math.max(t.levelCount, 1); oe < se; oe++) t.levels.push({ levelData: new Uint8Array(i.buffer, i.byteOffset + E._nextUint64(), E._nextUint64()), uncompressedByteLength: E._nextUint64() });
   const p = new Ut(i, s, o, !0);
   p._skip(4);
-  const E = p._nextUint16(), g = p._nextUint16(), l = p._nextUint16(), d = p._nextUint16(), f = { vendorId: E, descriptorType: g, versionNumber: l, colorModel: p._nextUint8(), colorPrimaries: p._nextUint8(), transferFunction: p._nextUint8(), flags: p._nextUint8(), texelBlockDimension: [p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8()], bytesPlane: [p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8()], samples: [] }, b = (d / 4 - 6) / 4;
+  const m = p._nextUint16(), g = p._nextUint16(), l = p._nextUint16(), d = p._nextUint16(), f = { vendorId: m, descriptorType: g, versionNumber: l, colorModel: p._nextUint8(), colorPrimaries: p._nextUint8(), transferFunction: p._nextUint8(), flags: p._nextUint8(), texelBlockDimension: [p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8()], bytesPlane: [p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8()], samples: [] }, b = (d / 4 - 6) / 4;
   for (let oe = 0; oe < b; oe++) {
     const se = { bitOffset: p._nextUint16(), bitLength: p._nextUint8(), channelType: p._nextUint8(), samplePosition: [p._nextUint8(), p._nextUint8(), p._nextUint8(), p._nextUint8()], sampleLower: Number.NEGATIVE_INFINITY, sampleUpper: Number.POSITIVE_INFINITY };
     64 & se.channelType ? (se.sampleLower = p._nextInt32(), se.sampleUpper = p._nextInt32()) : (se.sampleLower = p._nextUint32(), se.sampleUpper = p._nextUint32()), f.samples[oe] = se;
@@ -11735,8 +11735,8 @@ class rt extends dt {
     if (t.faceCount === 6)
       u = new Us(s, A, a);
     else {
-      const m = s[0].mipmaps;
-      u = t.layerCount > 1 ? new js(m, o, c, t.layerCount, A, a) : new er(m, o, c, A, a);
+      const E = s[0].mipmaps;
+      u = t.layerCount > 1 ? new js(E, o, c, t.layerCount, A, a) : new er(E, o, c, A, a);
     }
     return u.minFilter = s[0].mipmaps.length === 1 ? Bt : Zt, u.magFilter = Bt, u.generateMipmaps = !1, u.needsUpdate = !0, u.colorSpace = As(t), u.premultiplyAlpha = !!(h & oA), u;
   }
@@ -11809,8 +11809,8 @@ rt.EngineType = {
 rt.BasisWorker = function() {
   let i, e, t;
   const n = _EngineFormat, r = _EngineType, s = _TranscoderFormat, o = _BasisFormat;
-  self.addEventListener("message", function(E) {
-    const g = E.data;
+  self.addEventListener("message", function(m) {
+    const g = m.data;
     switch (g.type) {
       case "init":
         i = g.config, c(g.transcoderBinary);
@@ -11827,15 +11827,15 @@ rt.BasisWorker = function() {
         break;
     }
   });
-  function c(E) {
+  function c(m) {
     e = new Promise((g) => {
-      t = { wasmBinary: E, onRuntimeInitialized: g }, BASIS(t);
+      t = { wasmBinary: m, onRuntimeInitialized: g }, BASIS(t);
     }).then(() => {
       t.initializeBasis(), t.KTX2File === void 0 && console.warn("THREE.KTX2Loader: Please update Basis Universal transcoder.");
     });
   }
-  function A(E) {
-    const g = new t.KTX2File(new Uint8Array(E));
+  function A(m) {
+    const g = new t.KTX2File(new Uint8Array(m));
     function l() {
       g.close(), g.delete();
     }
@@ -11966,34 +11966,34 @@ rt.BasisWorker = function() {
       needsPowerOfTwo: !1
     }
   ], h = {
-    [o.ETC1S]: a.filter((E) => E.basisFormat.includes(o.ETC1S)).sort((E, g) => E.priorityETC1S - g.priorityETC1S),
-    [o.UASTC]: a.filter((E) => E.basisFormat.includes(o.UASTC)).sort((E, g) => E.priorityUASTC - g.priorityUASTC),
-    [o.UASTC_HDR]: a.filter((E) => E.basisFormat.includes(o.UASTC_HDR)).sort((E, g) => E.priorityHDR - g.priorityHDR)
+    [o.ETC1S]: a.filter((m) => m.basisFormat.includes(o.ETC1S)).sort((m, g) => m.priorityETC1S - g.priorityETC1S),
+    [o.UASTC]: a.filter((m) => m.basisFormat.includes(o.UASTC)).sort((m, g) => m.priorityUASTC - g.priorityUASTC),
+    [o.UASTC_HDR]: a.filter((m) => m.basisFormat.includes(o.UASTC_HDR)).sort((m, g) => m.priorityHDR - g.priorityHDR)
   };
-  function u(E, g, l, d) {
-    const f = h[E];
+  function u(m, g, l, d) {
+    const f = h[m];
     for (let b = 0; b < f.length; b++) {
       const I = f[b];
-      if (I.if && !i[I.if] || !I.basisFormat.includes(E) || d && I.transcoderFormat.length < 2 || I.needsPowerOfTwo && !(m(g) && m(l))) continue;
+      if (I.if && !i[I.if] || !I.basisFormat.includes(m) || d && I.transcoderFormat.length < 2 || I.needsPowerOfTwo && !(E(g) && E(l))) continue;
       const C = I.transcoderFormat[d ? 1 : 0], v = I.engineFormat[d ? 1 : 0], x = I.engineType[0];
       return { transcoderFormat: C, engineFormat: v, engineType: x };
     }
     throw new Error("THREE.KTX2Loader: Failed to identify transcoding target.");
   }
-  function m(E) {
-    return E <= 2 ? !0 : (E & E - 1) === 0 && E !== 0;
+  function E(m) {
+    return m <= 2 ? !0 : (m & m - 1) === 0 && m !== 0;
   }
-  function p(E) {
-    if (E.length === 1) return E[0];
+  function p(m) {
+    if (m.length === 1) return m[0];
     let g = 0;
-    for (let f = 0; f < E.length; f++) {
-      const b = E[f];
+    for (let f = 0; f < m.length; f++) {
+      const b = m[f];
       g += b.byteLength;
     }
     const l = new Uint8Array(g);
     let d = 0;
-    for (let f = 0; f < E.length; f++) {
-      const b = E[f];
+    for (let f = 0; f < m.length; f++) {
+      const b = m[f];
       l.set(b, d), d += b.byteLength;
     }
     return l;
@@ -12106,21 +12106,21 @@ async function EA(i) {
       u = t.decode(h.levelData, h.uncompressedByteLength);
     else
       throw new Error("THREE.KTX2Loader: Unsupported supercompressionScheme.");
-    let m;
-    Dt[e] === Vt ? m = new Float32Array(
+    let E;
+    Dt[e] === Vt ? E = new Float32Array(
       u.buffer,
       u.byteOffset,
       u.byteLength / Float32Array.BYTES_PER_ELEMENT
-    ) : Dt[e] === vt ? m = new Uint16Array(
+    ) : Dt[e] === vt ? E = new Uint16Array(
       u.buffer,
       u.byteOffset,
       u.byteLength / Uint16Array.BYTES_PER_ELEMENT
-    ) : Dt[e] === rr || Dt[e] === ir ? m = new Uint32Array(
+    ) : Dt[e] === rr || Dt[e] === ir ? E = new Uint32Array(
       u.buffer,
       u.byteOffset,
       u.byteLength / Uint32Array.BYTES_PER_ELEMENT
-    ) : m = u, n.push({
-      data: m,
+    ) : E = u, n.push({
+      data: E,
       width: c,
       height: A,
       depth: a
@@ -12287,7 +12287,7 @@ var cs = (function() {
     ATTRIBUTES: "meshopt_decodeVertexBuffer",
     TRIANGLES: "meshopt_decodeIndexBuffer",
     INDICES: "meshopt_decodeIndexSequence"
-  }, u = [], m = 0;
+  }, u = [], E = 0;
   function p(d) {
     var f = {
       object: new Worker(d),
@@ -12299,7 +12299,7 @@ var cs = (function() {
       f.pending -= I.count, f.requests[I.id][I.action](I.value), delete f.requests[I.id];
     }, f;
   }
-  function E(d) {
+  function m(d) {
     for (var f = "self.ready = WebAssembly.instantiate(new Uint8Array([" + new Uint8Array(r) + "]), {}).then(function(result) { result.instance.exports.__wasm_call_ctors(); return result.instance; });self.onmessage = " + l.name + ";" + A.toString() + l.toString(), b = new Blob([f], { type: "text/javascript" }), I = URL.createObjectURL(b), C = u.length; C < d; ++C)
       u[C] = p(I);
     for (var C = d; C < u.length; ++C)
@@ -12310,7 +12310,7 @@ var cs = (function() {
     for (var v = u[0], x = 1; x < u.length; ++x)
       u[x].pending < v.pending && (v = u[x]);
     return new Promise(function(j, R) {
-      var M = new Uint8Array(b), _ = ++m;
+      var M = new Uint8Array(b), _ = ++E;
       v.pending += d, v.requests[_] = { resolve: j, reject: R }, v.object.postMessage({ id: _, count: d, size: f, source: M, mode: I, filter: C }, [M.buffer]);
     });
   }
@@ -12331,7 +12331,7 @@ var cs = (function() {
     ready: o,
     supported: !0,
     useWorkers: function(d) {
-      E(d);
+      m(d);
     },
     decodeVertexBuffer: function(d, f, b, I, C) {
       A(s, s.exports.meshopt_decodeVertexBuffer, d, f, b, I, s.exports[a[C]]);
@@ -13061,8 +13061,8 @@ function xA(i, e, t, n) {
 `)
       A = 0, a -= o;
     else {
-      const m = LA(u, s, A, a, t);
-      n == "tb" ? (A = 0, a += t.ascender * s) : A += m.offsetX, c.push(m.path);
+      const E = LA(u, s, A, a, t);
+      n == "tb" ? (A = 0, a += t.ascender * s) : A += E.offsetX, c.push(E.path);
     }
   }
   return c;
@@ -13074,7 +13074,7 @@ function LA(i, e, t, n, r) {
     return;
   }
   const o = new no();
-  let c, A, a, h, u, m, p, E;
+  let c, A, a, h, u, E, p, m;
   if (s.o) {
     const g = s._cachedOutline || (s._cachedOutline = s.o.split(" "));
     for (let l = 0, d = g.length; l < d; )
@@ -13086,10 +13086,10 @@ function LA(i, e, t, n, r) {
           c = g[l++] * e + t, A = g[l++] * e + n, o.lineTo(c, A);
           break;
         case "q":
-          a = g[l++] * e + t, h = g[l++] * e + n, u = g[l++] * e + t, m = g[l++] * e + n, o.quadraticCurveTo(u, m, a, h);
+          a = g[l++] * e + t, h = g[l++] * e + n, u = g[l++] * e + t, E = g[l++] * e + n, o.quadraticCurveTo(u, E, a, h);
           break;
         case "b":
-          a = g[l++] * e + t, h = g[l++] * e + n, u = g[l++] * e + t, m = g[l++] * e + n, p = g[l++] * e + t, E = g[l++] * e + n, o.bezierCurveTo(u, m, p, E, a, h);
+          a = g[l++] * e + t, h = g[l++] * e + n, u = g[l++] * e + t, E = g[l++] * e + n, p = g[l++] * e + t, m = g[l++] * e + n, o.bezierCurveTo(u, E, p, m, a, h);
           break;
       }
   }
@@ -13272,6 +13272,7 @@ class MA extends HTMLElement {
    * `x`・`y` ともに -1 〜 1 の範囲で、中央が `0`、最大傾きが `±1` です。
    */
   leftJoystick;
+  _leftPointerId = null;
   _rightActive;
   _rightCenter;
   /**
@@ -13279,6 +13280,7 @@ class MA extends HTMLElement {
    * `x`・`y` ともに -1 〜 1 の範囲で、中央が `0`、最大傾きが `±1` です。
    */
   rightJoystick;
+  _rightPointerId = null;
   /** 左ボタンが押されているとき `true`（PC では Space キーに対応）。 */
   leftButton;
   /** 右ボタンが押されているとき `true`（PC では Enter キーに対応）。 */
@@ -13375,59 +13377,65 @@ class MA extends HTMLElement {
     <button class="btn left">L</button>
     <button class="btn right">R</button>
   </div>
-`, this.canvas = this.shadowRoot.querySelector("canvas-a3"), this.scene = this.canvas.scene, this.camera = this.canvas.camera, this.controller = this.canvas.controller, this._maxDistance = 40, this._leftActive = !1, this._leftCenter = { x: 0, y: 0 }, this.leftJoystick = { x: 0, y: 0 }, this._rightActive = !1, this._rightCenter = { x: 0, y: 0 }, this.rightJoystick = { x: 0, y: 0 }, this.leftButton = !1, this.rightButton = !1, this.keys = /* @__PURE__ */ new Set(), this._leftButtonCount = 0, this._rightButtonCount = 0;
+`, this.style.touchAction = "none", this.canvas = this.shadowRoot.querySelector("canvas-a3"), this.scene = this.canvas.scene, this.camera = this.canvas.camera, this.controller = this.canvas.controller, this._maxDistance = 40, this._leftActive = !1, this._leftCenter = { x: 0, y: 0 }, this.leftJoystick = { x: 0, y: 0 }, this._leftPointerId, this._rightActive = !1, this._rightCenter = { x: 0, y: 0 }, this.rightJoystick = { x: 0, y: 0 }, this.leftButton = !1, this.rightButton = !1, this.keys = /* @__PURE__ */ new Set(), this._leftButtonCount = 0, this._rightButtonCount = 0;
     const t = this.shadowRoot.querySelector(".joystick.left .stick");
     if (!t) return;
-    t.addEventListener("pointerdown", (o) => {
-      this._leftActive = !0;
-      const c = t.getBoundingClientRect();
-      this._leftCenter.x = c.left + c.width / 2, this._leftCenter.y = c.top + c.height / 2, t.setPointerCapture(o.pointerId);
-    }), t.addEventListener("pointermove", (o) => {
-      if (!this._leftActive) return;
-      const c = o.clientX - this._leftCenter.x, A = o.clientY - this._leftCenter.y, a = Math.sqrt(c * c + A * A);
-      let h = c, u = A;
-      if (a > 40) {
-        const m = Math.atan2(A, c);
-        h = Math.cos(m) * this._maxDistance, u = Math.sin(m) * this._maxDistance;
-      }
-      t.style.transform = `translate(calc(-50% + ${h}px), calc(-50% + ${u}px))`, this.leftJoystick.x = h / this._maxDistance, this.leftJoystick.y = -(u / this._maxDistance);
-    }), t.addEventListener("pointerup", () => {
-      this._leftActive = !1, t.style.transform = "translate(-50%, -50%)", this.leftJoystick.x = 0, this.leftJoystick.y = 0;
+    t.addEventListener("pointerdown", (A) => {
+      if (this._leftPointerId !== null) return;
+      this._leftPointerId = A.pointerId, this._leftActive = !0, t.setPointerCapture(A.pointerId);
+      const a = t.getBoundingClientRect();
+      this._leftCenter.x = a.left + a.width / 2, this._leftCenter.y = a.top + a.height / 2;
+    }), t.addEventListener("pointermove", (A) => {
+      if (!this._leftActive || A.pointerId !== this._leftPointerId) return;
+      const a = A.clientX - this._leftCenter.x, h = A.clientY - this._leftCenter.y, u = Math.sqrt(a * a + h * h);
+      let E = a, p = h;
+      if (u > this._maxDistance) {
+        const m = Math.atan2(h, a);
+        E = Math.cos(m) * this._maxDistance, p = Math.sin(m) * this._maxDistance;
+      }
+      t.style.transform = `translate(calc(-50% + ${E}px), calc(-50% + ${p}px))`, this.leftJoystick.x = E / this._maxDistance, this.leftJoystick.y = -(p / this._maxDistance);
     });
-    const n = this.shadowRoot.querySelector(".joystick.right .stick");
-    if (!n) return;
-    n.addEventListener("pointerdown", (o) => {
-      this._rightActive = !0;
-      const c = n.getBoundingClientRect();
-      this._rightCenter.x = c.left + c.width / 2, this._rightCenter.y = c.top + c.height / 2, n.setPointerCapture(o.pointerId);
-    }), n.addEventListener("pointermove", (o) => {
-      if (!this._rightActive) return;
-      const c = o.clientX - this._rightCenter.x, A = o.clientY - this._rightCenter.y, a = Math.sqrt(c * c + A * A);
-      let h = c, u = A;
-      if (a > 40) {
-        const m = Math.atan2(A, c);
-        h = Math.cos(m) * this._maxDistance, u = Math.sin(m) * this._maxDistance;
-      }
-      n.style.transform = `translate(calc(-50% + ${h}px), calc(-50% + ${u}px))`, this.rightJoystick.x = h / this._maxDistance, this.rightJoystick.y = -(u / this._maxDistance);
-    }), n.addEventListener("pointerup", () => {
-      this._rightActive = !1, n.style.transform = "translate(-50%, -50%)", this.rightJoystick.x = 0, this.rightJoystick.y = 0;
-    });
-    const r = this.shadowRoot.querySelector(".btn.left");
+    const n = (A) => {
+      A.pointerId === this._leftPointerId && (this._leftPointerId = null, this._leftActive = !1, t.style.transform = "translate(-50%, -50%)", this.leftJoystick.x = 0, this.leftJoystick.y = 0);
+    };
+    t.addEventListener("pointerup", n), t.addEventListener("pointercancel", n);
+    const r = this.shadowRoot.querySelector(".joystick.right .stick");
     if (!r) return;
-    r.addEventListener("pointerdown", () => {
+    r.addEventListener("pointerdown", (A) => {
+      if (this._rightPointerId !== null) return;
+      this._rightPointerId = A.pointerId, this._rightActive = !0;
+      const a = r.getBoundingClientRect();
+      this._rightCenter.x = a.left + a.width / 2, this._rightCenter.y = a.top + a.height / 2, r.setPointerCapture(A.pointerId);
+    }), r.addEventListener("pointermove", (A) => {
+      if (!this._rightActive || A.pointerId !== this._rightPointerId) return;
+      const a = A.clientX - this._rightCenter.x, h = A.clientY - this._rightCenter.y, u = Math.sqrt(a * a + h * h);
+      let E = a, p = h;
+      if (u > this._maxDistance) {
+        const m = Math.atan2(h, a);
+        E = Math.cos(m) * this._maxDistance, p = Math.sin(m) * this._maxDistance;
+      }
+      r.style.transform = `translate(calc(-50% + ${E}px), calc(-50% + ${p}px))`, this.rightJoystick.x = E / this._maxDistance, this.rightJoystick.y = -(p / this._maxDistance);
+    });
+    const s = (A) => {
+      A.pointerId === this._rightPointerId && (this._rightPointerId = null, this._rightActive = !1, r.style.transform = "translate(-50%, -50%)", this.rightJoystick.x = 0, this.rightJoystick.y = 0);
+    };
+    r.addEventListener("pointerup", s), r.addEventListener("pointercancel", s);
+    const o = this.shadowRoot.querySelector(".btn.left");
+    if (!o) return;
+    o.addEventListener("pointerdown", () => {
       this.leftButton = !0, this._leftButtonCount++;
-    }), r.addEventListener("pointerup", () => {
+    }), o.addEventListener("pointerup", () => {
       this.leftButton = !1;
     });
-    const s = this.shadowRoot.querySelector(".btn.right");
-    s && (s.addEventListener("pointerdown", () => {
+    const c = this.shadowRoot.querySelector(".btn.right");
+    c && (c.addEventListener("pointerdown", () => {
       this.rightButton = !0, this._rightButtonCount++;
-    }), s.addEventListener("pointerup", () => {
+    }), c.addEventListener("pointerup", () => {
       this.rightButton = !1;
-    }), window.addEventListener("keydown", this.keyDownListener), window.addEventListener("keyup", this.keyUpListener), this.options.touchDevice || (this.shadowRoot.querySelectorAll(".joystick").forEach((o) => {
-      o.style.display = "none";
-    }), this.shadowRoot.querySelectorAll(".btn").forEach((o) => {
-      o.style.display = "none";
+    }), window.addEventListener("keydown", this.keyDownListener), window.addEventListener("keyup", this.keyUpListener), this.options.touchDevice || (this.shadowRoot.querySelectorAll(".joystick").forEach((A) => {
+      A.style.display = "none";
+    }), this.shadowRoot.querySelectorAll(".btn").forEach((A) => {
+      A.style.display = "none";
     })));
   }
   keyDownListener = (e) => {
@@ -13744,20 +13752,20 @@ class UA {
         Math.cos(b / 2)
       ), u.mul(c);
     }
-    const m = new Ae(), p = new Pe();
+    const E = new Ae(), p = new Pe();
     {
       const l = this.cm.opt.wheelRearAxle, d = this.cm.trans.controller.wheelSuspensionLength(2) || 0, f = this.cm.trans.controller.wheelSteering(2) || 0, b = this.cm.trans.controller.wheelRotation(2) || 0;
-      m.set(-this.cm.opt.wheelRearAxleLength / 2, this.cm.opt.wheelRearYPosition, this.cm.opt.wheelRearZPosition), m.sub(0, d, 0), p.set(0, Math.sin(f / 2), 0, Math.cos(f / 2)), c.set(
+      E.set(-this.cm.opt.wheelRearAxleLength / 2, this.cm.opt.wheelRearYPosition, this.cm.opt.wheelRearZPosition), E.sub(0, d, 0), p.set(0, Math.sin(f / 2), 0, Math.cos(f / 2)), c.set(
         l.x * Math.sin(b / 2),
         l.y * Math.sin(b / 2),
         l.z * Math.sin(b / 2),
         Math.cos(b / 2)
       ), p.mul(c);
     }
-    const E = new Ae(), g = new Pe();
+    const m = new Ae(), g = new Pe();
     {
       const l = this.cm.opt.wheelRearAxle, d = this.cm.trans.controller.wheelSuspensionLength(3) || 0, f = this.cm.trans.controller.wheelSteering(3) || 0, b = this.cm.trans.controller.wheelRotation(3) || 0;
-      E.set(this.cm.opt.wheelRearAxleLength / 2, this.cm.opt.wheelRearYPosition, this.cm.opt.wheelRearZPosition), E.sub(0, d, 0), g.set(0, Math.sin(f / 2), 0, Math.cos(f / 2)), c.set(
+      m.set(this.cm.opt.wheelRearAxleLength / 2, this.cm.opt.wheelRearYPosition, this.cm.opt.wheelRearZPosition), m.sub(0, d, 0), g.set(0, Math.sin(f / 2), 0, Math.cos(f / 2)), c.set(
         l.x * Math.sin(b / 2),
         l.y * Math.sin(b / 2),
         l.z * Math.sin(b / 2),
@@ -13768,8 +13776,8 @@ class UA {
       chassis: { loc: s, quat: o },
       frontRight: { loc: h, quat: u },
       frontLeft: { loc: A, quat: a },
-      rearRight: { loc: E, quat: g },
-      rearLeft: { loc: m, quat: p }
+      rearRight: { loc: m, quat: g },
+      rearLeft: { loc: E, quat: p }
     };
   }
 }