xmlui 0.9.90 → 0.9.93

package/dist/lib/{transform-bUuxPyao.mjs → transform-CDSgqN5L.mjs}

@@ -1,100 +1,100 @@
-import { parseRegExpLiteral as Xe } from "@eslint-community/regexpp";
-const Bn = 1, Wn = 2, Un = 3, yn = 4, Mn = 5, Fn = 6, $n = 7, qn = 8, Xn = 9, Gn = 10, Hn = 11, Qn = 12, zn = 13, Yn = 14, Jn = 15, Zn = 16, Kn = 17, Cn = 18, jn = 19, Vn = 20, er = 100, nr = 101, rr = 102, tr = 103, ir = 104, lr = 105, sr = 106, ar = 107, or = 108, cr = 109, ur = 110, fr = 111, hr = 112, dr = 113, pr = 114, Er = 115, kr = 116, gr = 117, _r = 118, Nr = 200, Sr = 201, Tr = 202, mr = 203, xr = 204, Ar = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+import { parseRegExpLiteral as Ge } from "@eslint-community/regexpp";
+const Wn = 1, Un = 2, yn = 3, Mn = 4, Fn = 5, $n = 6, qn = 7, Xn = 8, Gn = 9, Hn = 10, Qn = 11, zn = 12, Yn = 13, Jn = 14, Zn = 15, Kn = 16, Cn = 17, jn = 18, Vn = 19, er = 20, nr = 100, rr = 101, tr = 102, ir = 103, lr = 104, sr = 105, ar = 106, or = 107, cr = 108, ur = 109, fr = 110, hr = 111, dr = 112, pr = 113, Er = 114, kr = 115, gr = 116, _r = 117, Nr = 118, Sr = 200, Tr = 201, mr = 202, xr = 203, Ar = 204, Lr = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  T_ARRAY_DESTRUCTURE: Tr,
-  T_ARRAY_LITERAL: ur,
-  T_ARROW_EXPRESSION: Er,
-  T_ARROW_EXPRESSION_STATEMENT: yn,
-  T_ASSIGNMENT_EXPRESSION: dr,
-  T_BINARY_EXPRESSION: nr,
-  T_BLOCK_STATEMENT: Bn,
-  T_BREAK_STATEMENT: Gn,
-  T_CALCULATED_MEMBER_ACCESS_EXPRESSION: sr,
-  T_CONDITIONAL_EXPRESSION: tr,
-  T_CONST_STATEMENT: Fn,
-  T_CONTINUE_STATEMENT: Hn,
-  T_DESTRUCTURE: Sr,
-  T_DO_WHILE_STATEMENT: zn,
-  T_EMPTY_STATEMENT: Wn,
-  T_EXPRESSION_STATEMENT: Un,
-  T_FOR_IN_STATEMENT: Jn,
-  T_FOR_OF_STATEMENT: Zn,
-  T_FOR_STATEMENT: Yn,
-  T_FUNCTION_DECLARATION: Vn,
-  T_FUNCTION_INVOCATION_EXPRESSION: ir,
-  T_IDENTIFIER: ar,
-  T_IF_STATEMENT: qn,
-  T_LET_STATEMENT: Mn,
-  T_LITERAL: cr,
-  T_MEMBER_ACCESS_EXPRESSION: lr,
-  T_NO_ARG_EXPRESSION: pr,
-  T_OBJECT_DESTRUCTURE: mr,
-  T_OBJECT_LITERAL: fr,
-  T_POSTFIX_OP_EXPRESSION: gr,
-  T_PREFIX_OP_EXPRESSION: kr,
-  T_REACTIVE_VAR_DECLARATION: _r,
-  T_RETURN_STATEMENT: Xn,
-  T_SEQUENCE_EXPRESSION: rr,
-  T_SPREAD_EXPRESSION: hr,
-  T_SWITCH_CASE: xr,
-  T_SWITCH_STATEMENT: jn,
-  T_TEMPLATE_LITERAL_EXPRESSION: or,
-  T_THROW_STATEMENT: Kn,
-  T_TRY_STATEMENT: Cn,
-  T_UNARY_EXPRESSION: er,
-  T_VAR_DECLARATION: Nr,
-  T_VAR_STATEMENT: $n,
-  T_WHILE_STATEMENT: Qn
+  T_ARRAY_DESTRUCTURE: mr,
+  T_ARRAY_LITERAL: fr,
+  T_ARROW_EXPRESSION: kr,
+  T_ARROW_EXPRESSION_STATEMENT: Mn,
+  T_ASSIGNMENT_EXPRESSION: pr,
+  T_BINARY_EXPRESSION: rr,
+  T_BLOCK_STATEMENT: Wn,
+  T_BREAK_STATEMENT: Hn,
+  T_CALCULATED_MEMBER_ACCESS_EXPRESSION: ar,
+  T_CONDITIONAL_EXPRESSION: ir,
+  T_CONST_STATEMENT: $n,
+  T_CONTINUE_STATEMENT: Qn,
+  T_DESTRUCTURE: Tr,
+  T_DO_WHILE_STATEMENT: Yn,
+  T_EMPTY_STATEMENT: Un,
+  T_EXPRESSION_STATEMENT: yn,
+  T_FOR_IN_STATEMENT: Zn,
+  T_FOR_OF_STATEMENT: Kn,
+  T_FOR_STATEMENT: Jn,
+  T_FUNCTION_DECLARATION: er,
+  T_FUNCTION_INVOCATION_EXPRESSION: lr,
+  T_IDENTIFIER: or,
+  T_IF_STATEMENT: Xn,
+  T_LET_STATEMENT: Fn,
+  T_LITERAL: ur,
+  T_MEMBER_ACCESS_EXPRESSION: sr,
+  T_NO_ARG_EXPRESSION: Er,
+  T_OBJECT_DESTRUCTURE: xr,
+  T_OBJECT_LITERAL: hr,
+  T_POSTFIX_OP_EXPRESSION: _r,
+  T_PREFIX_OP_EXPRESSION: gr,
+  T_REACTIVE_VAR_DECLARATION: Nr,
+  T_RETURN_STATEMENT: Gn,
+  T_SEQUENCE_EXPRESSION: tr,
+  T_SPREAD_EXPRESSION: dr,
+  T_SWITCH_CASE: Ar,
+  T_SWITCH_STATEMENT: Vn,
+  T_TEMPLATE_LITERAL_EXPRESSION: cr,
+  T_THROW_STATEMENT: Cn,
+  T_TRY_STATEMENT: jn,
+  T_UNARY_EXPRESSION: nr,
+  T_VAR_DECLARATION: Sr,
+  T_VAR_STATEMENT: qn,
+  T_WHILE_STATEMENT: zn
 }, Symbol.toStringTag, { value: "Module" })), {
   // Statement node type values
-  T_BLOCK_STATEMENT: Re,
-  T_EMPTY_STATEMENT: ge,
-  T_EXPRESSION_STATEMENT: an,
-  T_ARROW_EXPRESSION_STATEMENT: Lr,
-  T_LET_STATEMENT: on,
-  T_CONST_STATEMENT: cn,
-  T_VAR_STATEMENT: qe,
-  T_IF_STATEMENT: un,
-  T_RETURN_STATEMENT: fn,
-  T_BREAK_STATEMENT: hn,
-  T_CONTINUE_STATEMENT: dn,
-  T_WHILE_STATEMENT: pn,
-  T_DO_WHILE_STATEMENT: En,
-  T_FOR_STATEMENT: kn,
-  T_FOR_IN_STATEMENT: _e,
-  T_FOR_OF_STATEMENT: Te,
-  T_THROW_STATEMENT: gn,
-  T_TRY_STATEMENT: _n,
-  T_SWITCH_STATEMENT: Nn,
-  T_FUNCTION_DECLARATION: be,
+  T_BLOCK_STATEMENT: we,
+  T_EMPTY_STATEMENT: Ne,
+  T_EXPRESSION_STATEMENT: on,
+  T_ARROW_EXPRESSION_STATEMENT: Or,
+  T_LET_STATEMENT: cn,
+  T_CONST_STATEMENT: un,
+  T_VAR_STATEMENT: Xe,
+  T_IF_STATEMENT: fn,
+  T_RETURN_STATEMENT: hn,
+  T_BREAK_STATEMENT: dn,
+  T_CONTINUE_STATEMENT: pn,
+  T_WHILE_STATEMENT: En,
+  T_DO_WHILE_STATEMENT: kn,
+  T_FOR_STATEMENT: gn,
+  T_FOR_IN_STATEMENT: Se,
+  T_FOR_OF_STATEMENT: xe,
+  T_THROW_STATEMENT: _n,
+  T_TRY_STATEMENT: Nn,
+  T_SWITCH_STATEMENT: Sn,
+  T_FUNCTION_DECLARATION: Pe,
   // Expression node type values
-  T_UNARY_EXPRESSION: Sn,
+  T_UNARY_EXPRESSION: Tn,
   T_BINARY_EXPRESSION: Y,
-  T_SEQUENCE_EXPRESSION: ce,
-  T_CONDITIONAL_EXPRESSION: Tn,
-  T_FUNCTION_INVOCATION_EXPRESSION: mn,
-  T_MEMBER_ACCESS_EXPRESSION: xn,
-  T_CALCULATED_MEMBER_ACCESS_EXPRESSION: An,
-  T_IDENTIFIER: q,
-  T_TEMPLATE_LITERAL_EXPRESSION: Ln,
-  T_LITERAL: C,
-  T_ARRAY_LITERAL: ue,
-  T_OBJECT_LITERAL: fe,
-  T_SPREAD_EXPRESSION: he,
-  T_ASSIGNMENT_EXPRESSION: On,
-  T_NO_ARG_EXPRESSION: Ne,
-  T_ARROW_EXPRESSION: ve,
-  T_PREFIX_OP_EXPRESSION: Rn,
-  T_POSTFIX_OP_EXPRESSION: In,
-  T_REACTIVE_VAR_DECLARATION: wn,
+  T_SEQUENCE_EXPRESSION: ue,
+  T_CONDITIONAL_EXPRESSION: mn,
+  T_FUNCTION_INVOCATION_EXPRESSION: xn,
+  T_MEMBER_ACCESS_EXPRESSION: An,
+  T_CALCULATED_MEMBER_ACCESS_EXPRESSION: Ln,
+  T_IDENTIFIER: $,
+  T_TEMPLATE_LITERAL_EXPRESSION: On,
+  T_LITERAL: Z,
+  T_ARRAY_LITERAL: fe,
+  T_OBJECT_LITERAL: he,
+  T_SPREAD_EXPRESSION: de,
+  T_ASSIGNMENT_EXPRESSION: Rn,
+  T_NO_ARG_EXPRESSION: Te,
+  T_ARROW_EXPRESSION: De,
+  T_PREFIX_OP_EXPRESSION: In,
+  T_POSTFIX_OP_EXPRESSION: wn,
+  T_REACTIVE_VAR_DECLARATION: vn,
   // Other node type values
-  T_VAR_DECLARATION: ye,
-  T_DESTRUCTURE: Ie,
+  T_VAR_DECLARATION: Fe,
+  T_DESTRUCTURE: ve,
   T_ARRAY_DESTRUCTURE: ie,
-  T_OBJECT_DESTRUCTURE: ae,
-  T_SWITCH_CASE: vn
-} = Ar;
-class Ge {
+  T_OBJECT_DESTRUCTURE: oe,
+  T_SWITCH_CASE: bn
+} = Lr;
+class He {
   // Creates a stream that uses the specified source code
   constructor(n) {
     this.source = n, this._pos = 0, this._line = 1, this._column = 0;
@@ -134,7 +134,7 @@ class Ge {
   }
 }
 var i = /* @__PURE__ */ ((e) => (e[e.Eof = -1] = "Eof", e[e.Ws = -2] = "Ws", e[e.BlockComment = -3] = "BlockComment", e[e.EolComment = -4] = "EolComment", e[e.Unknown = 0] = "Unknown", e[e.LParent = 1] = "LParent", e[e.RParent = 2] = "RParent", e[e.Identifier = 3] = "Identifier", e[e.Exponent = 4] = "Exponent", e[e.Divide = 5] = "Divide", e[e.Multiply = 6] = "Multiply", e[e.Remainder = 7] = "Remainder", e[e.Plus = 8] = "Plus", e[e.Minus = 9] = "Minus", e[e.BitwiseXor = 10] = "BitwiseXor", e[e.BitwiseOr = 11] = "BitwiseOr", e[e.LogicalOr = 12] = "LogicalOr", e[e.BitwiseAnd = 13] = "BitwiseAnd", e[e.LogicalAnd = 14] = "LogicalAnd", e[e.IncOp = 15] = "IncOp", e[e.DecOp = 16] = "DecOp", e[e.Assignment = 17] = "Assignment", e[e.AddAssignment = 18] = "AddAssignment", e[e.SubtractAssignment = 19] = "SubtractAssignment", e[e.ExponentAssignment = 20] = "ExponentAssignment", e[e.MultiplyAssignment = 21] = "MultiplyAssignment", e[e.DivideAssignment = 22] = "DivideAssignment", e[e.RemainderAssignment = 23] = "RemainderAssignment", e[e.ShiftLeftAssignment = 24] = "ShiftLeftAssignment", e[e.ShiftRightAssignment = 25] = "ShiftRightAssignment", e[e.SignedShiftRightAssignment = 26] = "SignedShiftRightAssignment", e[e.BitwiseAndAssignment = 27] = "BitwiseAndAssignment", e[e.BitwiseXorAssignment = 28] = "BitwiseXorAssignment", e[e.BitwiseOrAssignment = 29] = "BitwiseOrAssignment", e[e.LogicalAndAssignment = 30] = "LogicalAndAssignment", e[e.LogicalOrAssignment = 31] = "LogicalOrAssignment", e[e.NullCoalesceAssignment = 32] = "NullCoalesceAssignment", e[e.Semicolon = 33] = "Semicolon", e[e.Comma = 34] = "Comma", e[e.Colon = 35] = "Colon", e[e.LSquare = 36] = "LSquare", e[e.RSquare = 37] = "RSquare", e[e.QuestionMark = 38] = "QuestionMark", e[e.NullCoalesce = 39] = "NullCoalesce", e[e.OptionalChaining = 40] = "OptionalChaining", e[e.BinaryNot = 41] = "BinaryNot", e[e.LBrace = 42] = "LBrace", e[e.RBrace = 43] = "RBrace", e[e.Equal = 44] = "Equal", e[e.StrictEqual = 45] = "StrictEqual", e[e.LogicalNot = 46] = "LogicalNot", e[e.NotEqual = 47] = "NotEqual", e[e.StrictNotEqual = 48] = "StrictNotEqual", e[e.LessThan = 49] = "LessThan", e[e.LessThanOrEqual = 50] = "LessThanOrEqual", e[e.ShiftLeft = 51] = "ShiftLeft", e[e.GreaterThan = 52] = "GreaterThan", e[e.GreaterThanOrEqual = 53] = "GreaterThanOrEqual", e[e.ShiftRight = 54] = "ShiftRight", e[e.SignedShiftRight = 55] = "SignedShiftRight", e[e.Dot = 56] = "Dot", e[e.Spread = 57] = "Spread", e[e.Global = 58] = "Global", e[e.Backtick = 59] = "Backtick", e[e.DollarLBrace = 60] = "DollarLBrace", e[e.Arrow = 61] = "Arrow", e[e.DecimalLiteral = 62] = "DecimalLiteral", e[e.HexadecimalLiteral = 63] = "HexadecimalLiteral", e[e.BinaryLiteral = 64] = "BinaryLiteral", e[e.RealLiteral = 65] = "RealLiteral", e[e.StringLiteral = 66] = "StringLiteral", e[e.Infinity = 67] = "Infinity", e[e.NaN = 68] = "NaN", e[e.True = 69] = "True", e[e.False = 70] = "False", e[e.Typeof = 71] = "Typeof", e[e.Null = 72] = "Null", e[e.Undefined = 73] = "Undefined", e[e.In = 74] = "In", e[e.Let = 75] = "Let", e[e.Const = 76] = "Const", e[e.Var = 77] = "Var", e[e.If = 78] = "If", e[e.Else = 79] = "Else", e[e.Return = 80] = "Return", e[e.Break = 81] = "Break", e[e.Continue = 82] = "Continue", e[e.Do = 83] = "Do", e[e.While = 84] = "While", e[e.For = 85] = "For", e[e.Of = 86] = "Of", e[e.Try = 87] = "Try", e[e.Catch = 88] = "Catch", e[e.Finally = 89] = "Finally", e[e.Throw = 90] = "Throw", e[e.Switch = 91] = "Switch", e[e.Case = 92] = "Case", e[e.Default = 93] = "Default", e[e.Delete = 94] = "Delete", e[e.Function = 95] = "Function", e[e.As = 96] = "As", e[e.From = 97] = "From", e))(i || {});
-class He {
+class Qe {
   /**
    * Initializes the tokenizer with the input stream
    * @param input Input source code stream
@@ -159,9 +159,9 @@ class He {
       throw new Error("Cannot look ahead more than 16 tokens");
     for (; this._ahead.length <= n; ) {
       const t = this.fetch();
-      if (Qe(t))
+      if (ze(t))
         return t;
-      (r || !r && !ze(t)) && this._ahead.push(t);
+      (r || !r && !Ye(t)) && this._ahead.push(t);
     }
     return this._ahead[n];
   }
@@ -178,7 +178,7 @@ class He {
     }
     for (; ; ) {
       const r = this.fetch();
-      if (Qe(r) || n || !n && !ze(r))
+      if (ze(r) || n || !n && !Ye(r))
         return r;
     }
   }
@@ -213,12 +213,12 @@ class He {
   fetch() {
     const n = this, r = this.input, t = this._prefetchedPos || r.position, l = r.line, a = this._prefetchedColumn || r.column;
     this._lastFetchPosition = this.input.position;
-    let s = null, o = "", u = i.Eof, w = r.position, O = r.column, h = null, y = !1, N = this.getStartingPhaseThenReset();
+    let s = null, o = "", u = i.Eof, v = r.position, R = r.column, h = null, M = !1, S = this.getStartingPhaseThenReset();
     for (; ; ) {
       if (h = this.fetchNextChar(), h === null)
-        return R();
+        return I();
       u === i.Eof && (u = i.Unknown);
-      e: switch (N) {
+      e: switch (S) {
         case 0:
           switch (h) {
             case " ":
@@ -226,37 +226,37 @@ class He {
             case `
 `:
             case "\r":
-              N = 1, u = i.Ws;
+              S = 1, u = i.Ws;
               break;
             case "/":
-              N = 5, u = i.Divide;
+              S = 5, u = i.Divide;
               break;
             case "$":
-              N = 6, u = i.Identifier;
+              S = 6, u = i.Identifier;
               break;
             case "*":
-              N = 8, u = i.Multiply;
+              S = 8, u = i.Multiply;
               break;
             case "%":
-              N = 54, u = i.Remainder;
+              S = 54, u = i.Remainder;
               break;
             case "+":
-              N = 51, u = i.Plus;
+              S = 51, u = i.Plus;
               break;
             case "-":
-              N = 52, u = i.Minus;
+              S = 52, u = i.Minus;
               break;
             case "^":
-              N = 58, u = i.BitwiseXor;
+              S = 58, u = i.BitwiseXor;
               break;
             case "|":
-              N = 7, u = i.BitwiseOr;
+              S = 7, u = i.BitwiseOr;
               break;
             case "&":
-              N = 9, u = i.BitwiseAnd;
+              S = 9, u = i.BitwiseAnd;
               break;
             case "?":
-              N = 22, u = i.QuestionMark;
+              S = 22, u = i.QuestionMark;
               break;
             case ";":
               return m(i.Semicolon);
@@ -267,7 +267,7 @@ class He {
             case ")":
               return m(i.RParent);
             case ":":
-              N = 20, u = i.Colon;
+              S = 20, u = i.Colon;
               break;
             case "`":
               return m(i.Backtick);
@@ -282,39 +282,39 @@ class He {
             case "}":
               return m(i.RBrace);
             case "=":
-              N = 10, u = i.Assignment;
+              S = 10, u = i.Assignment;
               break;
             case "!":
-              N = 13, u = i.LogicalNot;
+              S = 13, u = i.LogicalNot;
               break;
             case "<":
-              N = 14, u = i.LessThan;
+              S = 14, u = i.LessThan;
               break;
             case ">":
-              N = 15, u = i.GreaterThan;
+              S = 15, u = i.GreaterThan;
               break;
             case "0":
-              N = 21, u = i.DecimalLiteral;
+              S = 21, u = i.DecimalLiteral;
               break;
             case ".":
-              N = 18, u = i.Dot;
+              S = 18, u = i.Dot;
               break;
             case '"':
             case "'":
-              s = h, N = 35;
+              s = h, S = 35;
               break;
             default:
-              Ye(h) ? (y = !0, N = 17, u = i.Identifier) : te(h) ? (N = 27, u = i.DecimalLiteral) : m(i.Unknown);
+              Je(h) ? (M = !0, S = 17, u = i.Identifier) : te(h) ? (S = 27, u = i.DecimalLiteral) : m(i.Unknown);
               break;
           }
           break;
         case 1:
           if (h !== " " && h !== "	" && h !== "\r" && h !== `
 `)
-            return R();
+            return I();
           break;
         case 3:
-          h === "*" && (N = 4);
+          h === "*" && (S = 4);
           break;
         case 4:
           if (h === "/")
@@ -326,230 +326,230 @@ class He {
             return m();
           break;
         case 17:
-          if (!Je(h))
-            return R();
+          if (!Ze(h))
+            return I();
           break;
         case 20:
-          return h === ":" ? m(i.Global) : R();
+          return h === ":" ? m(i.Global) : I();
         case 5:
           if (h === "*")
-            N = 3;
+            S = 3;
           else if (h === "/")
-            N = 2, u = i.EolComment;
-          else return h === "=" ? m(i.DivideAssignment) : R();
+            S = 2, u = i.EolComment;
+          else return h === "=" ? m(i.DivideAssignment) : I();
           break;
         case 51:
-          return h === "+" ? m(i.IncOp) : h === "=" ? m(i.AddAssignment) : R();
+          return h === "+" ? m(i.IncOp) : h === "=" ? m(i.AddAssignment) : I();
         case 52:
-          return h === "-" ? m(i.DecOp) : h === "=" ? m(i.SubtractAssignment) : R();
+          return h === "-" ? m(i.DecOp) : h === "=" ? m(i.SubtractAssignment) : I();
         case 54:
-          return h === "=" ? m(i.RemainderAssignment) : R();
+          return h === "=" ? m(i.RemainderAssignment) : I();
         case 58:
-          return h === "=" ? m(i.BitwiseXorAssignment) : R();
+          return h === "=" ? m(i.BitwiseXorAssignment) : I();
         case 7:
           if (h === "=")
             return m(i.BitwiseOrAssignment);
           if (h === "|") {
-            N = 59, u = i.LogicalOr;
+            S = 59, u = i.LogicalOr;
             break;
           }
-          return R();
+          return I();
         case 59:
-          return h === "=" ? m(i.LogicalOrAssignment) : R();
+          return h === "=" ? m(i.LogicalOrAssignment) : I();
         case 9:
           if (h === "=")
             return m(i.BitwiseAndAssignment);
           if (h === "&") {
-            N = 57, u = i.LogicalAnd;
+            S = 57, u = i.LogicalAnd;
             break;
           }
-          return R();
+          return I();
         case 57:
-          return h === "=" ? m(i.LogicalAndAssignment) : R();
+          return h === "=" ? m(i.LogicalAndAssignment) : I();
         case 8:
           if (h === "*") {
-            N = 50, u = i.Exponent;
+            S = 50, u = i.Exponent;
             break;
           } else if (h === "=")
             return m(i.MultiplyAssignment);
-          return R();
+          return I();
         case 50:
-          return h === "=" ? m(i.ExponentAssignment) : R();
+          return h === "=" ? m(i.ExponentAssignment) : I();
         case 22:
           if (h === "?") {
-            N = 60, u = i.NullCoalesce;
+            S = 60, u = i.NullCoalesce;
             break;
           }
-          return h === "." ? m(i.OptionalChaining) : R();
+          return h === "." ? m(i.OptionalChaining) : I();
         case 60:
-          return h === "=" ? m(i.NullCoalesceAssignment) : R();
+          return h === "=" ? m(i.NullCoalesceAssignment) : I();
         case 10:
           if (h === ">")
             return m(i.Arrow);
           if (h === "=") {
-            N = 11, u = i.Equal;
+            S = 11, u = i.Equal;
             break;
           }
-          return R();
+          return I();
         case 11:
-          return h === "=" ? m(i.StrictEqual) : R();
+          return h === "=" ? m(i.StrictEqual) : I();
         case 13:
           if (h === "=") {
-            N = 12, u = i.NotEqual;
+            S = 12, u = i.NotEqual;
             break;
           }
-          return R();
+          return I();
         case 12:
-          return h === "=" ? m(i.StrictNotEqual) : R();
+          return h === "=" ? m(i.StrictNotEqual) : I();
         case 14:
           if (h === "=")
             return m(i.LessThanOrEqual);
           if (h === "<") {
-            N = 55, u = i.ShiftLeft;
+            S = 55, u = i.ShiftLeft;
             break;
           }
-          return R();
+          return I();
         case 55:
-          return h === "=" ? m(i.ShiftLeftAssignment) : R();
+          return h === "=" ? m(i.ShiftLeftAssignment) : I();
         case 15:
           if (h === "=")
             return m(i.GreaterThanOrEqual);
           if (h === ">") {
-            N = 16, u = i.SignedShiftRight;
+            S = 16, u = i.SignedShiftRight;
             break;
           }
-          return R();
+          return I();
         case 16:
           if (h === ">") {
-            N = 56, u = i.ShiftRight;
+            S = 56, u = i.ShiftRight;
             break;
           }
-          return h === "=" ? m(i.SignedShiftRightAssignment) : R();
+          return h === "=" ? m(i.SignedShiftRightAssignment) : I();
         case 56:
-          return h === "=" ? m(i.ShiftRightAssignment) : R();
+          return h === "=" ? m(i.ShiftRightAssignment) : I();
         case 21:
           if (h === "x")
-            N = 23, u = i.Unknown;
+            S = 23, u = i.Unknown;
           else if (h === "b")
-            N = 25, u = i.Unknown;
+            S = 25, u = i.Unknown;
           else if (te(h) || h === "_")
-            N = 27;
+            S = 27;
           else if (h === ".")
-            N = 28, u = i.Unknown;
+            S = 28, u = i.Unknown;
           else if (h === "e" || h === "E")
-            N = 30, u = i.Unknown;
+            S = 30, u = i.Unknown;
           else
-            return R();
+            return I();
           break;
         case 18:
           if (h === ".") {
-            N = 19, u = i.Unknown;
+            S = 19, u = i.Unknown;
             break;
           }
           if (!te(h))
-            return R();
-          N = 29, u = i.RealLiteral;
+            return I();
+          S = 29, u = i.RealLiteral;
           break;
         case 19:
-          return h === "." ? m(i.Spread) : R();
+          return h === "." ? m(i.Spread) : I();
         case 23:
           if (h === "_")
             break;
-          if (!K(h))
-            return R();
-          N = 24, u = i.HexadecimalLiteral;
+          if (!J(h))
+            return I();
+          S = 24, u = i.HexadecimalLiteral;
           break;
         case 24:
-          if (!K(h) && h !== "_")
-            return R();
+          if (!J(h) && h !== "_")
+            return I();
           break;
         case 25:
           if (h === "_")
             break;
-          if (!Ze(h))
-            return R();
-          N = 26, u = i.BinaryLiteral;
+          if (!Ke(h))
+            return I();
+          S = 26, u = i.BinaryLiteral;
           break;
         case 26:
-          if (!Ze(h) && h !== "_")
-            return R();
+          if (!Ke(h) && h !== "_")
+            return I();
           u = i.BinaryLiteral;
           break;
         case 27:
           if (te(h) || h === "_")
             break;
           if (h === "." && (this.input.peek() === null || te(this.input.peek())))
-            N = 28, u = i.Unknown;
+            S = 28, u = i.Unknown;
           else if (h === "e" || h === "E")
-            N = 30, u = i.Unknown;
+            S = 30, u = i.Unknown;
           else
-            return R();
+            return I();
           break;
         case 28:
           if (te(h))
-            N = 29, u = i.RealLiteral;
+            S = 29, u = i.RealLiteral;
           else if (h === "e" || h === "E")
-            N = 30;
+            S = 30;
           else
-            return R();
+            return I();
           break;
         case 29:
           if (h === "e" || h === "E")
-            N = 30, u = i.Unknown;
+            S = 30, u = i.Unknown;
           else if (!te(h) && h !== "_")
-            return R();
+            return I();
           break;
         case 30:
           if (h === "+" || h === "-")
-            N = 31;
+            S = 31;
           else if (te(h))
-            N = 32, u = i.RealLiteral;
+            S = 32, u = i.RealLiteral;
           else
-            return R();
+            return I();
           break;
         case 31:
           if (te(h))
-            N = 32, u = i.RealLiteral;
+            S = 32, u = i.RealLiteral;
           else
-            return R();
+            return I();
           break;
         case 32:
           if (!te(h))
-            return R();
+            return I();
           break;
         case 6:
           if (h === "{")
             return m(i.DollarLBrace);
-          N = 17, y = !0, u = i.Identifier, Je(h) || R();
+          S = 17, M = !0, u = i.Identifier, Ze(h) || I();
           break;
         case 33: {
-          N = 34;
-          const Q = this.input.ahead(0), X = this.input.ahead(1);
-          if (Q === "`" || Q === "$" && X === "{")
+          S = 34;
+          const z = this.input.ahead(0), j = this.input.ahead(1);
+          if (z === "`" || z === "$" && j === "{")
             return m(i.StringLiteral);
           break;
         }
         case 34:
           switch (h) {
             case "\\":
-              N = 33, u = i.Unknown;
+              S = 33, u = i.Unknown;
               break e;
             case "`":
               return m(i.Backtick);
             case "$":
               if (this.input.ahead(0) === "{")
-                return V(), this.fetchNextChar(), m(i.DollarLBrace);
+                return C(), this.fetchNextChar(), m(i.DollarLBrace);
           }
-          const H = this.input.ahead(0), x = this.input.ahead(1);
-          if (H === "`" || H === "$" && x === "{")
+          const H = this.input.ahead(0), A = this.input.ahead(1);
+          if (H === "`" || H === "$" && A === "{")
             return m(i.StringLiteral);
           break;
         case 35:
           if (h === s)
             return m(i.StringLiteral);
-          if (Or(h))
+          if (Rr(h))
             return m(i.Unknown);
-          h === "\\" && (N = 36, u = i.Unknown);
+          h === "\\" && (S = 36, u = i.Unknown);
           break;
         case 36:
           switch (h) {
@@ -565,133 +565,133 @@ class He {
             case '"':
             case "`":
             case "\\":
-              N = 35;
+              S = 35;
               break;
             case "x":
-              N = 37;
+              S = 37;
               break;
             case "u":
-              N = 39;
+              S = 39;
               break;
             default:
-              N = 35;
+              S = 35;
               break;
           }
           break;
         case 37:
-          if (K(h))
-            N = 38;
+          if (J(h))
+            S = 38;
           else
             return m(i.Unknown);
           break;
         case 38:
-          if (K(h))
-            N = 35;
+          if (J(h))
+            S = 35;
           else
             return m(i.Unknown);
           break;
         case 39:
           if (h === "{") {
-            N = 43;
+            S = 43;
             break;
           }
-          if (K(h))
-            N = 40;
+          if (J(h))
+            S = 40;
           else
             return m(i.Unknown);
           break;
         case 40:
-          if (K(h))
-            N = 41;
+          if (J(h))
+            S = 41;
           else
             return m(i.Unknown);
           break;
         case 41:
-          if (K(h))
-            N = 42;
+          if (J(h))
+            S = 42;
           else
             return m(i.Unknown);
           break;
         case 42:
-          if (K(h))
-            N = 35;
+          if (J(h))
+            S = 35;
           else
             return m(i.Unknown);
           break;
         case 43:
-          if (K(h))
-            N = 44;
+          if (J(h))
+            S = 44;
           else
             return m(i.Unknown);
           break;
         case 44:
           if (h === "}")
-            N = 35;
-          else if (K(h))
-            N = 45;
+            S = 35;
+          else if (J(h))
+            S = 45;
           else
             return m(i.Unknown);
           break;
         case 45:
           if (h === "}")
-            N = 35;
-          else if (K(h))
-            N = 46;
+            S = 35;
+          else if (J(h))
+            S = 46;
           else
             return m(i.Unknown);
           break;
         case 46:
           if (h === "}")
-            N = 35;
-          else if (K(h))
-            N = 47;
+            S = 35;
+          else if (J(h))
+            S = 47;
           else
             return m(i.Unknown);
           break;
         case 47:
           if (h === "}")
-            N = 35;
-          else if (K(h))
-            N = 48;
+            S = 35;
+          else if (J(h))
+            S = 48;
           else
             return m(i.Unknown);
           break;
         case 48:
           if (h === "}")
-            N = 35;
-          else if (K(h))
-            N = 49;
+            S = 35;
+          else if (J(h))
+            S = 49;
           else
             return m(i.Unknown);
           break;
         case 49:
           if (h === "}")
-            N = 35;
+            S = 35;
           else
             return m(i.Unknown);
           break;
         default:
-          return R();
+          return I();
       }
-      V();
+      C();
     }
-    function V() {
-      o += h, n._prefetched = null, n._prefetchedPos = null, n._prefetchedColumn = null, w = r.position, O = r.position;
+    function C() {
+      o += h, n._prefetched = null, n._prefetchedPos = null, n._prefetchedColumn = null, v = r.position, R = r.position;
     }
-    function R() {
-      return y && (u = W.get(o) ?? (Ye(o[0]) && o[o.length - 1] !== "'" ? i.Identifier : i.Unknown)), {
+    function I() {
+      return M && (u = W.get(o) ?? (Je(o[0]) && o[o.length - 1] !== "'" ? i.Identifier : i.Unknown)), {
         text: o,
         type: u,
         startPosition: t,
-        endPosition: w,
+        endPosition: v,
         startLine: l,
         endLine: l,
         startColumn: a,
-        endColumn: O
+        endColumn: R
       };
     }
     function m(H) {
-      return V(), H !== void 0 && (u = H), R();
+      return C(), H !== void 0 && (u = H), I();
     }
   }
   getStartingPhaseThenReset() {
@@ -707,7 +707,7 @@ class He {
   fetchRegEx() {
     const n = this._ahead.length > 0 ? this._ahead[0].startPosition : this._lastFetchPosition, r = this.input.getTail(n);
     try {
-      const t = Xe(r), l = t.raw;
+      const t = Ge(r), l = t.raw;
       for (let a = 1; a < l.length; a++)
         this.fetchNextChar(), this._prefetched = null, this._prefetchedPos = null, this._prefetchedColumn = null;
       return this._ahead.length = 0, {
@@ -728,7 +728,7 @@ class He {
         };
       const a = r.substring(0, l);
       try {
-        const s = Xe(a), o = s.raw;
+        const s = Ge(a), o = s.raw;
         for (let u = 1; u < o.length; u++)
           this.fetchNextChar(), this._prefetched = null, this._prefetchedPos = null, this._prefetchedColumn = null;
         return this._ahead.length = 0, {
@@ -778,37 +778,37 @@ W.set("delete", i.Delete);
 W.set("function", i.Function);
 W.set("as", i.As);
 W.set("from", i.From);
-function Qe(e) {
+function ze(e) {
   return e.type === i.Eof;
 }
-function ze(e) {
+function Ye(e) {
   return e.type <= i.Ws;
 }
-function Ye(e) {
+function Je(e) {
   return e >= "a" && e <= "z" || e >= "A" && e <= "Z" || e === "_" || e === "$";
 }
-function Je(e) {
+function Ze(e) {
   return e >= "a" && e <= "z" || e >= "A" && e <= "Z" || e >= "0" && e <= "9" || e === "_" || e === "$";
 }
-function Ze(e) {
+function Ke(e) {
   return e === "0" || e === "1";
 }
 function te(e) {
   return e >= "0" && e <= "9";
 }
-function K(e) {
+function J(e) {
   return e >= "0" && e <= "9" || e >= "A" && e <= "F" || e >= "a" && e <= "f";
 }
-function Or(e) {
+function Rr(e) {
   return e === "\r" || e === `
 ` || e === "…" || e === "\u2028" || e === "\u2029";
 }
-let Rr = class bn extends Error {
+let Ir = class Dn extends Error {
   constructor(n, r) {
-    super(n), this.code = r, Object.setPrototypeOf(this, bn.prototype);
+    super(n), this.code = r, Object.setPrototypeOf(this, Dn.prototype);
   }
 };
-const we = {
+const be = {
   W001: "An expression expected",
   W002: "Unexpected token: {0}",
   W003: "An identifier expected",
@@ -944,24 +944,24 @@ const we = {
   [i.As]: { keywordLike: !0 },
   [i.From]: { keywordLike: !0 }
 };
-let Ir = 0;
-function Le() {
-  return ++Ir;
+let wr = 0;
+function Re() {
+  return ++wr;
 }
-class Me {
+class $e {
   /**
    * Initializes the parser with the specified source code
    * @param source Source code to parse
    */
   constructor(n) {
-    this._parseErrors = [], this._statementLevel = 0, this._lexer = new He(new Ge(n ?? ""));
+    this._parseErrors = [], this._statementLevel = 0, this._lexer = new Qe(new He(n ?? ""));
   }
   /**
    * Sets the source code to parse
    * @param source Source code to parse
    */
   setSource(n) {
-    this._lexer = new He(new Ge(n));
+    this._lexer = new Qe(new He(n));
   }
   /**
    * The errors raised during the parse phase
@@ -1009,7 +1009,7 @@ class Me {
     for (; !this.isEof; ) {
       const r = this.parseStatement();
       if (!r) return null;
-      n.push(r), r.type !== ge && this.skipToken(i.Semicolon);
+      n.push(r), r.type !== Ne && this.skipToken(i.Semicolon);
     }
     return n;
   }
@@ -1041,14 +1041,14 @@ class Me {
           return this.parseReturnStatement();
         case i.Break:
           return this._lexer.get(), this.createStatementNode(
-            hn,
+            dn,
             {},
             r,
             r
           );
         case i.Continue:
           return this._lexer.get(), this.createStatementNode(
-            dn,
+            pn,
             {},
             r,
             r
@@ -1079,7 +1079,7 @@ class Me {
    */
   parseEmptyStatement() {
     const n = this._lexer.get();
-    return this.createStatementNode(ge, {}, n, n);
+    return this.createStatementNode(Ne, {}, n, n);
   }
   /**
    * Parses an expression statement
@@ -1091,7 +1091,7 @@ class Me {
   parseExpressionStatement(n = !0) {
     const r = this._lexer.peek(), t = this.getExpression(n);
     return t ? this.createStatementNode(
-      an,
+      on,
       {
         expr: t
       },
@@ -1144,7 +1144,7 @@ class Me {
         return this.reportError("W009", s), null;
       if (t.push(
         this.createExpressionNode(
-          ye,
+          Fe,
           a,
           l,
           r
@@ -1153,7 +1153,7 @@ class Me {
       this._lexer.get();
     }
     return this.createStatementNode(
-      on,
+      cn,
       {
         decls: t
       },
@@ -1202,7 +1202,7 @@ class Me {
       if (s === null) return null;
       if (a.expr = s, r = s.endToken, t.push(
         this.createExpressionNode(
-          ye,
+          Fe,
           a,
           l,
           r
@@ -1211,7 +1211,7 @@ class Me {
       this._lexer.get();
     }
     return this.createStatementNode(
-      cn,
+      un,
       {
         decls: t
       },
@@ -1238,7 +1238,7 @@ class Me {
           return this.reportError("W031"), null;
         r = this._lexer.get(), a = {
           id: {
-            type: q,
+            type: $,
             name: l.text,
             startToken: l,
             endToken: r
@@ -1251,7 +1251,7 @@ class Me {
       if (s === null) return null;
       if (a.expr = s, r = s.endToken, t.push(
         this.createExpressionNode(
-          wn,
+          vn,
           a,
           l,
           r
@@ -1260,7 +1260,7 @@ class Me {
       this._lexer.get();
     }
     return this.createStatementNode(
-      qe,
+      Xe,
       {
         decls: t
       },
@@ -1292,7 +1292,7 @@ class Me {
       }
       l = this._lexer.peek(), (l.type === i.Comma || l.type === i.RBrace) && (n.push(
         this.createExpressionNode(
-          ae,
+          oe,
           { id: a, alias: s, aDestr: o, oDestr: u },
           r,
           t
@@ -1353,11 +1353,11 @@ class Me {
     for (; this._lexer.peek().type !== i.RBrace; ) {
       const l = this.parseStatement();
       if (!l) return null;
-      r.push(l), l.type !== ge && this.skipToken(i.Semicolon);
+      r.push(l), l.type !== Ne && this.skipToken(i.Semicolon);
     }
     const t = this._lexer.get();
     return this.createStatementNode(
-      Re,
+      we,
       { stmts: r },
       n,
       t
@@ -1381,14 +1381,14 @@ class Me {
     if (!l) return null;
     r = l.endToken;
     let a = !0;
-    l.type !== Re && (this._lexer.peek().type === i.Semicolon ? this._lexer.get() : a = !1);
+    l.type !== we && (this._lexer.peek().type === i.Semicolon ? this._lexer.get() : a = !1);
     let s = null;
     if (a && this._lexer.peek().type === i.Else) {
       if (this._lexer.get(), s = this.parseStatement(), !s) return null;
       r = s.endToken;
     }
     return this.createStatementNode(
-      un,
+      fn,
       {
         cond: t,
         thenB: l,
@@ -1413,7 +1413,7 @@ class Me {
     this.expectToken(i.RParent, "W006");
     const t = this.parseStatement();
     return t ? this.createStatementNode(
-      pn,
+      En,
       {
         cond: r,
         body: t
@@ -1432,12 +1432,12 @@ class Me {
   parseDoWhileStatement() {
     const n = this._lexer.get(), r = this.parseStatement();
     if (!r) return null;
-    r.type !== Re && r.type !== ge && this.expectToken(i.Semicolon), this.expectToken(i.While), this.expectToken(i.LParent, "W014");
+    r.type !== we && r.type !== Ne && this.expectToken(i.Semicolon), this.expectToken(i.While), this.expectToken(i.LParent, "W014");
     const t = this.getExpression();
     if (!t) return null;
     const l = this._lexer.peek();
     return this.expectToken(i.RParent, "W006"), this.createStatementNode(
-      En,
+      kn,
       {
         cond: t,
         body: r
@@ -1461,7 +1461,7 @@ class Me {
       r = t.endToken;
     }
     return this.createStatementNode(
-      fn,
+      hn,
       {
         expr: t
       },
@@ -1481,26 +1481,26 @@ class Me {
     let r = this._lexer.peek();
     if (r.type === i.Identifier) {
       if (this._lexer.ahead(1).type === i.In)
-        return this.parseForInOfStatement(n, "none", r, _e);
+        return this.parseForInOfStatement(n, "none", r, Se);
       if (this._lexer.ahead(1).type === i.Of)
-        return this.parseForInOfStatement(n, "none", r, Te);
+        return this.parseForInOfStatement(n, "none", r, xe);
     } else if (r.type === i.Let) {
       const o = this._lexer.ahead(1);
       if (o.type === i.Identifier) {
         const u = this._lexer.ahead(2);
         if (u.type === i.In)
-          return this.parseForInOfStatement(n, "let", o, _e);
+          return this.parseForInOfStatement(n, "let", o, Se);
         if (u.type === i.Of)
-          return this.parseForInOfStatement(n, "let", o, Te);
+          return this.parseForInOfStatement(n, "let", o, xe);
       }
     } else if (r.type === i.Const) {
       const o = this._lexer.ahead(1);
       if (o.type === i.Identifier) {
         const u = this._lexer.ahead(2);
         if (u.type === i.In)
-          return this.parseForInOfStatement(n, "const", o, _e);
+          return this.parseForInOfStatement(n, "const", o, Se);
         if (u.type === i.Of)
-          return this.parseForInOfStatement(n, "const", o, Te);
+          return this.parseForInOfStatement(n, "const", o, xe);
       }
     }
     let t;
@@ -1533,7 +1533,7 @@ class Me {
     this.expectToken(i.RParent, "W006");
     const s = this.parseStatement();
     return s ? this.createStatementNode(
-      kn,
+      gn,
       {
         init: t,
         cond: l,
@@ -1565,12 +1565,12 @@ class Me {
     const a = this.getExpression(!0);
     this.expectToken(i.RParent, "W006");
     const s = this.parseStatement();
-    return s ? l === _e ? this.createStatementNode(
-      _e,
+    return s ? l === Se ? this.createStatementNode(
+      Se,
       {
         varB: r,
         id: {
-          type: q,
+          type: $,
           name: t.text,
           startToken: t,
           endToken: t
@@ -1581,11 +1581,11 @@ class Me {
       n,
       s.endToken
     ) : this.createStatementNode(
-      Te,
+      xe,
       {
         varB: r,
         id: {
-          type: q,
+          type: $,
           name: t.text,
           startToken: t,
           endToken: t
@@ -1609,7 +1609,7 @@ class Me {
     this._lexer.get();
     let r;
     return r = this.getExpression(), r === null ? null : this.createStatementNode(
-      gn,
+      _n,
       {
         expr: r
       },
@@ -1635,27 +1635,27 @@ class Me {
   parseTryStatement() {
     const n = this._lexer.peek();
     let r = this._lexer.get();
-    const t = this, l = w();
+    const t = this, l = v();
     let a, s, o, u = this._lexer.peek();
     if (u.type === i.Catch) {
       if (this._lexer.get(), u = this._lexer.peek(), u.type === i.LParent) {
         if (this._lexer.get(), u = this._lexer.peek(), u.type !== i.Identifier)
           return this.reportError("W003", u), null;
         s = {
-          type: q,
-          nodeId: Le(),
+          type: $,
+          nodeId: Re(),
           name: u.text,
           startToken: u,
           endToken: u
         }, this._lexer.get(), this.expectToken(i.RParent, "W006");
       }
-      a = w(), r = a.endToken, this._lexer.peek().type === i.Finally && (this._lexer.get(), o = w(), r = o.endToken);
+      a = v(), r = a.endToken, this._lexer.peek().type === i.Finally && (this._lexer.get(), o = v(), r = o.endToken);
     } else if (u.type === i.Finally)
-      this._lexer.get(), o = w(), r = o.endToken;
+      this._lexer.get(), o = v(), r = o.endToken;
     else
       return this.reportError("W013", u), null;
     return this.createStatementNode(
-      _n,
+      Nn,
       {
         tryB: l,
         catchB: a,
@@ -1665,9 +1665,9 @@ class Me {
       n,
       r
     );
-    function w() {
-      const O = t._lexer.peek();
-      return O.type !== i.LBrace ? (t.reportError("W012", O), null) : t.parseBlockStatement();
+    function v() {
+      const R = t._lexer.peek();
+      return R.type !== i.LBrace ? (t.reportError("W012", R), null) : t.parseBlockStatement();
     }
   }
   /**
@@ -1704,25 +1704,25 @@ class Me {
         return this.reportError("W015"), null;
       }
       this.expectToken(i.Colon, "W008");
-      let u = [], w = !1;
-      for (; !w; )
+      let u = [], v = !1;
+      for (; !v; )
         switch (this._lexer.peek().type) {
           case i.Case:
           case i.Default:
           case i.RBrace:
-            w = !0;
+            v = !0;
             break;
           default:
             const h = this.parseStatement();
             if (h === null) {
-              w = !0;
+              v = !0;
               break;
             }
-            u.push(h), h.type !== ge && this.skipToken(i.Semicolon);
+            u.push(h), h.type !== Ne && this.skipToken(i.Semicolon);
         }
       t.push(
         this.createNode(
-          vn,
+          bn,
           {
             caseE: o,
             stmts: u
@@ -1733,7 +1733,7 @@ class Me {
     }
     const a = this._lexer.peek();
     return this.expectToken(i.RBrace, "W004"), this.createStatementNode(
-      Nn,
+      Sn,
       {
         expr: r,
         cases: t
@@ -1771,41 +1771,41 @@ class Me {
     let o;
     const u = [];
     switch (s.type) {
-      case Ne:
+      case Te:
         o = !0;
         break;
-      case q:
+      case $:
         o = (s.parenthesized ?? 0) <= 1, u.push(s);
         break;
-      case ce:
+      case ue:
         o = s.parenthesized === 1;
-        let O = !1;
+        let R = !1;
         if (o)
           for (const h of s.exprs) {
-            if (O) {
+            if (R) {
               o = !1;
               break;
             }
             switch (h.type) {
-              case q:
+              case $:
                 o = !h.parenthesized, u.push(h);
                 break;
-              case fe: {
+              case he: {
                 if (o = !h.parenthesized, o) {
-                  const y = this.convertToObjectDestructure(h);
-                  y && u.push(y);
+                  const M = this.convertToObjectDestructure(h);
+                  M && u.push(M);
                 }
                 break;
               }
-              case ue: {
+              case fe: {
                 if (o = !h.parenthesized, o) {
-                  const y = this.convertToArrayDestructure(h);
-                  y && u.push(y);
+                  const M = this.convertToArrayDestructure(h);
+                  M && u.push(M);
                 }
                 break;
               }
-              case he: {
-                if (O = !0, h.expr.type !== q) {
+              case de: {
+                if (R = !0, h.expr.type !== $) {
                   o = !1;
                   break;
                 }
@@ -1818,20 +1818,20 @@ class Me {
             }
           }
         break;
-      case fe:
+      case he:
         if (o = s.parenthesized === 1, o) {
           const h = this.convertToObjectDestructure(s);
           h && u.push(h);
         }
         break;
-      case ue:
+      case fe:
         if (o = s.parenthesized === 1, o) {
           const h = this.convertToArrayDestructure(s);
           h && u.push(h);
         }
         break;
-      case he:
-        if (s.expr.type !== q) {
+      case de:
+        if (s.expr.type !== $) {
           o = !1;
           break;
         }
@@ -1844,16 +1844,16 @@ class Me {
       return this.reportError("W010", r), null;
     if (this._lexer.peek().type !== i.LBrace)
       return this.reportError("W012", this._lexer.peek()), null;
-    const w = this.parseBlockStatement();
-    return w ? this.createStatementNode(
-      be,
+    const v = this.parseBlockStatement();
+    return v ? this.createStatementNode(
+      Pe,
       {
-        id: { type: q, name: t },
+        id: { type: $, name: t },
         args: u,
-        stmt: w
+        stmt: v
       },
       r,
-      w.endToken
+      v.endToken
     ) : null;
   }
   // ==========================================================================
@@ -1884,7 +1884,7 @@ class Me {
       for (l.push(t); this.skipToken(i.Comma); )
         if (this._lexer.peek().type === i.Comma)
           a = !0, r = this._lexer.peek(), l.push(
-            this.createExpressionNode(Ne, {}, r, r)
+            this.createExpressionNode(Te, {}, r, r)
           );
         else {
           const s = this.parseCondOrSpreadOrAsgnOrArrowExpr();
@@ -1893,7 +1893,7 @@ class Me {
           r = s.endToken, l.push(s);
         }
     return l.length && (t = this.createExpressionNode(
-      ce,
+      ue,
       {
         exprs: l,
         loose: a
@@ -1915,7 +1915,7 @@ class Me {
       this._lexer.get();
       const l = this.parseNullCoalescingExpr();
       return l ? this.createExpressionNode(
-        he,
+        de,
         {
           expr: l
         },
@@ -1926,7 +1926,7 @@ class Me {
     if (n.type === i.Function) {
       const l = this.parseFunctionDeclaration(!0);
       return l ? this.createExpressionNode(
-        ve,
+        De,
         {
           name: l.id.name,
           args: l.args,
@@ -1948,7 +1948,7 @@ class Me {
       this.expectToken(i.Colon);
       const a = this.getExpression(!1);
       return this.createExpressionNode(
-        Tn,
+        mn,
         {
           cond: r,
           thenE: l,
@@ -1962,7 +1962,7 @@ class Me {
       this._lexer.get();
       const l = this.getExpression();
       return l ? this.createExpressionNode(
-        On,
+        Rn,
         {
           leftValue: r,
           op: t.text,
@@ -1983,13 +1983,13 @@ class Me {
     let t;
     const l = [];
     switch (r.type) {
-      case Ne:
+      case Te:
         t = !0;
         break;
-      case q:
+      case $:
         t = (r.parenthesized ?? 0) <= 1, l.push(r);
         break;
-      case ce:
+      case ue:
         t = r.parenthesized === 1;
         let s = !1;
         if (t)
@@ -1999,25 +1999,25 @@ class Me {
               break;
             }
             switch (o.type) {
-              case q:
+              case $:
                 t = !o.parenthesized, l.push(o);
                 break;
-              case fe: {
+              case he: {
                 if (t = !o.parenthesized, t) {
                   const u = this.convertToObjectDestructure(o);
                   u && l.push(u);
                 }
                 break;
               }
-              case ue: {
+              case fe: {
                 if (t = !o.parenthesized, t) {
                   const u = this.convertToArrayDestructure(o);
                   u && l.push(u);
                 }
                 break;
               }
-              case he: {
-                if (s = !0, o.expr.type !== q) {
+              case de: {
+                if (s = !0, o.expr.type !== $) {
                   t = !1;
                   break;
                 }
@@ -2030,20 +2030,20 @@ class Me {
             }
           }
         break;
-      case fe:
+      case he:
         if (t = r.parenthesized === 1, t) {
           const o = this.convertToObjectDestructure(r);
           o && l.push(o);
         }
         break;
-      case ue:
+      case fe:
         if (t = r.parenthesized === 1, t) {
           const o = this.convertToArrayDestructure(r);
           o && l.push(o);
         }
         break;
-      case he:
-        t = r.expr.type === q, t && l.push(r);
+      case de:
+        t = r.expr.type === $, t && l.push(r);
         break;
       default:
         t = !1;
@@ -2053,7 +2053,7 @@ class Me {
     this._lexer.get();
     const a = this.parseStatement(!1);
     return a ? this.createExpressionNode(
-      ve,
+      De,
       {
         args: l,
         statement: a
@@ -2451,7 +2451,7 @@ class Me {
       this._lexer.get();
       const r = this.parseUnaryOrPrefixExpr();
       return r ? this.createExpressionNode(
-        Sn,
+        Tn,
         {
           op: n.text,
           expr: r
@@ -2464,7 +2464,7 @@ class Me {
       this._lexer.get();
       const r = this.parseMemberOrInvocationExpr();
       return r ? this.createExpressionNode(
-        Rn,
+        In,
         {
           op: n.text,
           expr: r
@@ -2494,19 +2494,19 @@ class Me {
       switch (a.type) {
         case i.LParent: {
           this._lexer.get();
-          let O = [];
+          let R = [];
           if (this._lexer.peek().type !== i.RParent) {
-            const y = this.parseExpr();
-            if (!y)
+            const M = this.parseExpr();
+            if (!M)
               return this.reportError("W001"), null;
-            O = y.type === ce ? y.exprs : [y];
+            R = M.type === ue ? M.exprs : [M];
           }
           const h = this._lexer.peek();
           this.expectToken(i.RParent, "W006"), r = this.createExpressionNode(
-            mn,
+            xn,
             {
               obj: r,
-              arguments: O
+              arguments: R
             },
             n,
             h
@@ -2520,7 +2520,7 @@ class Me {
           if (!pe[s.type].keywordLike)
             return this.reportError("W003"), null;
           r = this.createExpressionNode(
-            xn,
+            An,
             {
               obj: r,
               member: s.text,
@@ -2535,15 +2535,15 @@ class Me {
           const u = this.getExpression();
           if (!u)
             return null;
-          const w = this._lexer.peek();
+          const v = this._lexer.peek();
           this.expectToken(i.RSquare, "W005"), r = this.createExpressionNode(
-            An,
+            Ln,
             {
               obj: r,
               member: u
             },
             n,
-            w
+            v
           );
           break;
         default:
@@ -2553,7 +2553,7 @@ class Me {
     } while (!t);
     const l = this._lexer.peek();
     return l.type === i.IncOp || l.type === i.DecOp ? (this._lexer.get(), this.createExpressionNode(
-      In,
+      wn,
       {
         op: l.text,
         expr: r
@@ -2578,7 +2578,7 @@ class Me {
         if (this._lexer.get(), this._lexer.peek().type === i.RParent) {
           const l = this._lexer.get();
           return this.createExpressionNode(
-            Ne,
+            Te,
             {},
             n,
             l
@@ -2597,7 +2597,7 @@ class Me {
       case i.Identifier: {
         const l = this._lexer.get();
         return this.createExpressionNode(
-          q,
+          $,
           {
             name: l.text
           },
@@ -2609,7 +2609,7 @@ class Me {
         this._lexer.get();
         const l = this._lexer.get();
         return l.type !== i.Identifier ? (this.reportError("W003"), null) : this.createExpressionNode(
-          q,
+          $,
           {
             name: l.text,
             isGlobal: !0
@@ -2623,7 +2623,7 @@ class Me {
       case i.False:
       case i.True:
         return this._lexer.get(), this.createExpressionNode(
-          C,
+          Z,
           {
             value: n.type === i.True
           },
@@ -2642,7 +2642,7 @@ class Me {
         return this._lexer.get(), this.parseStringLiteral(n);
       case i.Infinity:
         return this._lexer.get(), this.createExpressionNode(
-          C,
+          Z,
           {
             value: 1 / 0
           },
@@ -2651,7 +2651,7 @@ class Me {
         );
       case i.NaN:
         return this._lexer.get(), this.createExpressionNode(
-          C,
+          Z,
           {
             value: NaN
           },
@@ -2660,7 +2660,7 @@ class Me {
         );
       case i.Null:
         return this._lexer.get(), this.createExpressionNode(
-          C,
+          Z,
           {
             value: null
           },
@@ -2669,7 +2669,7 @@ class Me {
         );
       case i.Undefined:
         return this._lexer.get(), this.createExpressionNode(
-          C,
+          Z,
           {
             value: void 0
           },
@@ -2710,7 +2710,7 @@ class Me {
     }
     const t = this._lexer.get();
     return this.createExpressionNode(
-      Ln,
+      On,
       { segments: r },
       n,
       t
@@ -2724,11 +2724,11 @@ class Me {
     let r = [];
     if (this._lexer.peek().type !== i.RSquare) {
       const l = this.getExpression();
-      l && (r = l.type === ce ? l.exprs : [l]);
+      l && (r = l.type === ue ? l.exprs : [l]);
     }
     const t = this._lexer.peek();
     return this.expectToken(i.RSquare), this.createExpressionNode(
-      ue,
+      fe,
       {
         items: r
       },
@@ -2751,7 +2751,7 @@ class Me {
             if (this._lexer.get(), s = this.getExpression(), !s)
               return null;
             this.expectToken(i.RSquare, "W005"), s = this.createExpressionNode(
-              ce,
+              ue,
               {
                 exprs: [s]
               },
@@ -2760,14 +2760,14 @@ class Me {
           } else if (a.isPropLiteral) {
             if (s = this.getExpression(!1), !s)
               return null;
-            if (s.type !== q && s.type !== C && s.type !== he)
+            if (s.type !== $ && s.type !== Z && s.type !== de)
               return this.reportError("W007"), null;
           } else
             return this.reportError("W007"), null;
         else if (a.keywordLike)
           s = {
-            type: q,
-            nodeId: Le(),
+            type: $,
+            nodeId: Re(),
             name: l.text,
             startToken: l,
             endToken: l
@@ -2775,22 +2775,22 @@ class Me {
         else
           return this.reportError("W001"), null;
         const o = s.type;
-        if (o === he)
+        if (o === de)
           r.push(s);
         else {
-          if (o === C) {
-            const O = s.value;
-            if (typeof O != "number" && typeof O != "string")
+          if (o === Z) {
+            const R = s.value;
+            if (typeof R != "number" && typeof R != "string")
               return this.expectToken(i.RBrace, "W007"), null;
           }
-          let w = null;
-          if (o === q) {
-            const O = this._lexer.peek();
-            (O.type === i.Comma || O.type === i.RBrace) && (w = { ...s });
+          let v = null;
+          if (o === $) {
+            const R = this._lexer.peek();
+            (R.type === i.Comma || R.type === i.RBrace) && (v = { ...s });
           }
-          if (!w && (this.expectToken(i.Colon, "W008"), w = this.getExpression(!1), !w))
+          if (!v && (this.expectToken(i.Colon, "W008"), v = this.getExpression(!1), !v))
             return null;
-          r.push([s, w]);
+          r.push([s, v]);
         }
         const u = this._lexer.peek().type;
         if (u === i.Comma)
@@ -2800,7 +2800,7 @@ class Me {
       }
     const t = this._lexer.peek();
     return this.expectToken(i.RBrace, "W004"), this.createExpressionNode(
-      fe,
+      he,
       {
         props: r
       },
@@ -2811,7 +2811,7 @@ class Me {
   parseRegExpLiteral() {
     const n = this._lexer.peek(), r = this._lexer.getRegEx();
     return r.success ? this.createExpressionNode(
-      C,
+      Z,
       {
         value: new RegExp(r.pattern, r.flags)
       },
@@ -2864,7 +2864,7 @@ class Me {
    * @param options Error message options
    */
   reportError(n, r, ...t) {
-    let l = we[n] ?? "Unkonwn error";
+    let l = be[n] ?? "Unkonwn error";
     throw t && t.forEach(
       (s, o) => l = a(l, `{${o}}`, t[o].toString())
     ), r || (r = this._lexer.peek()), this._parseErrors.push({
@@ -2872,7 +2872,7 @@ class Me {
       text: l,
       line: r.startLine,
       column: r.startColumn
-    }), new Rr(l, n);
+    }), new Ir(l, n);
     function a(s, o, u) {
       do
         s = s.replace(o, u);
@@ -2906,7 +2906,7 @@ class Me {
   createExpressionNode(n, r = {}, t, l) {
     return l || (l = this._lexer.peek()), t || (t = l), Object.assign({}, r, {
       type: n,
-      nodeId: Le(),
+      nodeId: Re(),
       startToken: t,
       endToken: l
     });
@@ -2921,7 +2921,7 @@ class Me {
   createStatementNode(n, r, t, l) {
     return Object.assign({}, r, {
       type: n,
-      nodeId: Le(),
+      nodeId: Re(),
       startToken: t,
       endToken: l
     });
@@ -2934,7 +2934,7 @@ class Me {
     let r;
     const t = BigInt(n.text.replace(/[_']/g, ""));
     return t < Number.MIN_SAFE_INTEGER || t > Number.MAX_SAFE_INTEGER ? r = t : r = parseInt(n.text.substring(2).replace(/[_']/g, ""), 2), this.createExpressionNode(
-      C,
+      Z,
       {
         value: r
       },
@@ -2950,7 +2950,7 @@ class Me {
     let r;
     const t = BigInt(n.text.replace(/[_']/g, ""));
     return t < Number.MIN_SAFE_INTEGER || t > Number.MAX_SAFE_INTEGER ? r = t : r = parseInt(n.text.replace(/[_']/g, ""), 10), this.createExpressionNode(
-      C,
+      Z,
       {
         value: r
       },
@@ -2966,7 +2966,7 @@ class Me {
     let r;
     const t = BigInt(n.text.replace(/[_']/g, ""));
     return t < Number.MIN_SAFE_INTEGER || t > Number.MAX_SAFE_INTEGER ? r = t : r = parseInt(n.text.substring(2).replace(/[_']/g, ""), 16), this.createExpressionNode(
-      C,
+      Z,
       {
         value: r
       },
@@ -2981,7 +2981,7 @@ class Me {
   parseRealLiteral(n) {
     let r = parseFloat(n.text.replace(/[_']/g, ""));
     return this.createExpressionNode(
-      C,
+      Z,
       {
         value: r
       },
@@ -3105,7 +3105,7 @@ class Me {
         break;
     }
     return this.createExpressionNode(
-      C,
+      Z,
       {
         value: l
       },
@@ -3118,8 +3118,8 @@ class Me {
   }
   convertToArrayDestructure(n) {
     var l;
-    const r = n.type === ce ? n.exprs : n.items, t = this.createExpressionNode(
-      Ie,
+    const r = n.type === ue ? n.exprs : n.items, t = this.createExpressionNode(
+      ve,
       { aDestr: [] },
       n.startToken,
       n.endToken
@@ -3127,7 +3127,7 @@ class Me {
     for (const a of r) {
       let s;
       switch (a.type) {
-        case Ne:
+        case Te:
           s = this.createExpressionNode(
             ie,
             {},
@@ -3135,7 +3135,7 @@ class Me {
             a.endToken
           );
           break;
-        case q:
+        case $:
           s = this.createExpressionNode(
             ie,
             { id: a.name },
@@ -3143,13 +3143,13 @@ class Me {
             a.endToken
           );
           break;
-        case Ie:
+        case ve:
           t.aDestr.push(...a.aDestr);
           break;
         case ie:
           s = a;
           break;
-        case ue: {
+        case fe: {
           const o = this.convertToArrayDestructure(a);
           o && (s = this.createExpressionNode(
             ie,
@@ -3161,7 +3161,7 @@ class Me {
           ));
           break;
         }
-        case ae:
+        case oe:
           s = this.createExpressionNode(
             ie,
             {
@@ -3171,7 +3171,7 @@ class Me {
             a.endToken
           );
           break;
-        case fe: {
+        case he: {
           const o = this.convertToObjectDestructure(a);
           o && (s = this.createExpressionNode(
             ie,
@@ -3193,7 +3193,7 @@ class Me {
   convertToObjectDestructure(n) {
     var t;
     const r = this.createExpressionNode(
-      Ie,
+      ve,
       { oDestr: [] },
       n.startToken,
       n.endToken
@@ -3201,18 +3201,18 @@ class Me {
     for (const l of n.props) {
       if (!Array.isArray(l)) return reportError("W018"), null;
       const [a, s] = l;
-      if (a.type !== q)
+      if (a.type !== $)
         return reportError("W018"), null;
       let o;
       switch (s.type) {
-        case q:
+        case $:
           s.name === a.name ? o = this.createExpressionNode(
-            ae,
+            oe,
             { id: a.name },
             s.startToken,
             s.endToken
           ) : o = this.createExpressionNode(
-            ae,
+            oe,
             {
               id: a.name,
               alias: s.name
@@ -3223,7 +3223,7 @@ class Me {
           break;
         case ie: {
           o = this.createExpressionNode(
-            ae,
+            oe,
             {
               id: a.name,
               aDestr: s
@@ -3233,10 +3233,10 @@ class Me {
           );
           break;
         }
-        case ue: {
+        case fe: {
           const u = this.convertToArrayDestructure(s);
           u && (o = this.createExpressionNode(
-            ae,
+            oe,
             {
               id: a.name,
               aDestr: u.aDestr
@@ -3246,13 +3246,13 @@ class Me {
           ));
           break;
         }
-        case ae:
+        case oe:
           o = s;
           break;
-        case fe: {
+        case he: {
           const u = this.convertToObjectDestructure(s);
           u && (o = this.createExpressionNode(
-            ae,
+            oe,
             {
               id: a.name,
               oDestr: u.oDestr
@@ -3278,13 +3278,13 @@ class Me {
   }
 }
 var c = /* @__PURE__ */ ((e) => (e[e.Unknown = 0] = "Unknown", e[e.EndOfFileToken = 1] = "EndOfFileToken", e[e.CommentTrivia = 2] = "CommentTrivia", e[e.NewLineTrivia = 3] = "NewLineTrivia", e[e.WhitespaceTrivia = 4] = "WhitespaceTrivia", e[e.Identifier = 5] = "Identifier", e[e.OpenNodeStart = 6] = "OpenNodeStart", e[e.CloseNodeStart = 7] = "CloseNodeStart", e[e.NodeEnd = 8] = "NodeEnd", e[e.NodeClose = 9] = "NodeClose", e[e.Colon = 10] = "Colon", e[e.Equal = 11] = "Equal", e[e.StringLiteral = 12] = "StringLiteral", e[e.CData = 13] = "CData", e[e.Script = 14] = "Script", e[e.TextNode = 15] = "TextNode", e[e.AmpersandEntity = 16] = "AmpersandEntity", e[e.LessThanEntity = 17] = "LessThanEntity", e[e.GreaterThanEntity = 18] = "GreaterThanEntity", e[e.SingleQuoteEntity = 19] = "SingleQuoteEntity", e[e.DoubleQuoteEntity = 20] = "DoubleQuoteEntity", e[e.ElementNode = 21] = "ElementNode", e[e.AttributeNode = 22] = "AttributeNode", e[e.AttributeKeyNode = 23] = "AttributeKeyNode", e[e.ContentListNode = 24] = "ContentListNode", e[e.AttributeListNode = 25] = "AttributeListNode", e[e.TagNameNode = 26] = "TagNameNode", e[e.ErrorNode = 27] = "ErrorNode", e))(c || {});
-function wr(e) {
+function vr(e) {
   return e >= 2 && e <= 4;
 }
-function vr(e) {
+function br(e) {
   return e >= 21 && e <= 27;
 }
-function Fe(e) {
+function qe(e) {
   switch (e) {
     case 0:
       return "Unknown";
@@ -3343,24 +3343,24 @@ function Fe(e) {
     case 23:
       return "AttributeKeyNode";
   }
-  return br();
+  return Dr();
 }
-function br(e) {
+function Dr(e) {
   throw new Error("Didn't expect to get here");
 }
-function Dr(e, n, r = 0) {
+function Pr(e, n, r = 0) {
   var l;
-  const t = `${"  ".repeat(r)} ${Fe(e.kind)} @${e.start}..${e.end}`;
-  if (vr(e.kind))
+  const t = `${"  ".repeat(r)} ${qe(e.kind)} @${e.start}..${e.end}`;
+  if (br(e.kind))
     return t + `
-` + ((l = e.children) == null ? void 0 : l.map((a) => Dr(a, n, r + 1)).join(`
+` + ((l = e.children) == null ? void 0 : l.map((a) => Pr(a, n, r + 1)).join(`
 `));
   {
     let a = n(e);
     return e.kind === c.NewLineTrivia && (a = "*newline*"), t + ` "${a}"`;
   }
 }
-function Pr(e, n, r) {
+function Br(e, n, r) {
   var a, s;
   const t = ((a = e.children) == null ? void 0 : a.filter((o) => o.kind !== c.ErrorNode)) ?? [], l = ((s = n.children) == null ? void 0 : s.filter((o) => o.kind !== c.ErrorNode)) ?? [];
   if (t.length !== l.length)
@@ -3370,7 +3370,7 @@ function Pr(e, n, r) {
       return !1;
   return !0;
 }
-function Br(e, n) {
+function Wr(e, n) {
   const r = [e];
   let t;
   if (e.start > n || n > e.end)
@@ -3386,27 +3386,27 @@ function Br(e, n) {
     ), s = e.children[a], o = e.children[a - 1];
     if (o !== void 0 && n <= s.pos)
       return t = r.length, {
-        chainBeforePos: r.concat(Ur(o)),
+        chainBeforePos: r.concat(yr(o)),
         sharedParents: t,
-        chainAtPos: r.concat(Wr(s))
+        chainAtPos: r.concat(Ur(s))
       };
     e = s, l.chainAtPos.push(e);
   }
   return l;
 }
-function Wr(e) {
+function Ur(e) {
   const n = [e];
   for (; e.children !== void 0 && e.children.length > 0; )
     e = e.children[0], n.push(e);
   return n;
 }
-function Ur(e) {
+function yr(e) {
   const n = [e];
   for (; e.children !== void 0 && e.children.length > 0; )
     e = e.children[e.children.length - 1], n.push(e);
   return n;
 }
-class j {
+class K {
   constructor(n, r, t, l, a) {
     var s, o;
     this.kind = n, this.pos = r, this.end = t, this.triviaBefore = l, this.children = a, l ? this.start = ((s = l[0]) == null ? void 0 : s.start) ?? r : a ? this.start = ((o = a[0]) == null ? void 0 : o.start) ?? r : this.start = r;
@@ -3430,30 +3430,30 @@ class j {
     return this.kind === c.TagNameNode;
   }
   findTokenAtPos(n) {
-    return Br(this, n);
+    return Wr(this, n);
   }
 }
-class ht extends j {
+class dt extends K {
   getAttributeListNode() {
     return this.children.find((n) => n.isContentListNode());
   }
 }
-class dt extends j {
+class pt extends K {
 }
-class pt extends j {
+class Et extends K {
 }
-class Et extends j {
+class kt extends K {
 }
-class kt extends j {
+class gt extends K {
 }
-class gt extends j {
+class _t extends K {
 }
-var d = /* @__PURE__ */ ((e) => (e[e.EOF = -1] = "EOF", e[e.nullCharacter = 0] = "nullCharacter", e[e.maxAsciiCharacter = 127] = "maxAsciiCharacter", e[e.lineFeed = 10] = "lineFeed", e[e.carriageReturn = 13] = "carriageReturn", e[e.lineSeparator = 8232] = "lineSeparator", e[e.paragraphSeparator = 8233] = "paragraphSeparator", e[e.nextLine = 133] = "nextLine", e[e.space = 32] = "space", e[e.nonBreakingSpace = 160] = "nonBreakingSpace", e[e.enQuad = 8192] = "enQuad", e[e.emQuad = 8193] = "emQuad", e[e.enSpace = 8194] = "enSpace", e[e.emSpace = 8195] = "emSpace", e[e.threePerEmSpace = 8196] = "threePerEmSpace", e[e.fourPerEmSpace = 8197] = "fourPerEmSpace", e[e.sixPerEmSpace = 8198] = "sixPerEmSpace", e[e.figureSpace = 8199] = "figureSpace", e[e.punctuationSpace = 8200] = "punctuationSpace", e[e.thinSpace = 8201] = "thinSpace", e[e.hairSpace = 8202] = "hairSpace", e[e.zeroWidthSpace = 8203] = "zeroWidthSpace", e[e.narrowNoBreakSpace = 8239] = "narrowNoBreakSpace", e[e.ideographicSpace = 12288] = "ideographicSpace", e[e.mathematicalSpace = 8287] = "mathematicalSpace", e[e.ogham = 5760] = "ogham", e[e.replacementCharacter = 65533] = "replacementCharacter", e[e._ = 95] = "_", e[e.$ = 36] = "$", e[e._0 = 48] = "_0", e[e._1 = 49] = "_1", e[e._2 = 50] = "_2", e[e._3 = 51] = "_3", e[e._4 = 52] = "_4", e[e._5 = 53] = "_5", e[e._6 = 54] = "_6", e[e._7 = 55] = "_7", e[e._8 = 56] = "_8", e[e._9 = 57] = "_9", e[e.a = 97] = "a", e[e.b = 98] = "b", e[e.c = 99] = "c", e[e.d = 100] = "d", e[e.e = 101] = "e", e[e.f = 102] = "f", e[e.g = 103] = "g", e[e.h = 104] = "h", e[e.i = 105] = "i", e[e.j = 106] = "j", e[e.k = 107] = "k", e[e.l = 108] = "l", e[e.m = 109] = "m", e[e.n = 110] = "n", e[e.o = 111] = "o", e[e.p = 112] = "p", e[e.q = 113] = "q", e[e.r = 114] = "r", e[e.s = 115] = "s", e[e.t = 116] = "t", e[e.u = 117] = "u", e[e.v = 118] = "v", e[e.w = 119] = "w", e[e.x = 120] = "x", e[e.y = 121] = "y", e[e.z = 122] = "z", e[e.A = 65] = "A", e[e.B = 66] = "B", e[e.C = 67] = "C", e[e.D = 68] = "D", e[e.E = 69] = "E", e[e.F = 70] = "F", e[e.G = 71] = "G", e[e.H = 72] = "H", e[e.I = 73] = "I", e[e.J = 74] = "J", e[e.K = 75] = "K", e[e.L = 76] = "L", e[e.M = 77] = "M", e[e.N = 78] = "N", e[e.O = 79] = "O", e[e.P = 80] = "P", e[e.Q = 81] = "Q", e[e.R = 82] = "R", e[e.S = 83] = "S", e[e.T = 84] = "T", e[e.U = 85] = "U", e[e.V = 86] = "V", e[e.W = 87] = "W", e[e.X = 88] = "X", e[e.Y = 89] = "Y", e[e.Z = 90] = "Z", e[e.ampersand = 38] = "ampersand", e[e.asterisk = 42] = "asterisk", e[e.at = 64] = "at", e[e.backslash = 92] = "backslash", e[e.backtick = 96] = "backtick", e[e.bar = 124] = "bar", e[e.caret = 94] = "caret", e[e.closeBrace = 125] = "closeBrace", e[e.closeBracket = 93] = "closeBracket", e[e.closeParen = 41] = "closeParen", e[e.colon = 58] = "colon", e[e.comma = 44] = "comma", e[e.dot = 46] = "dot", e[e.doubleQuote = 34] = "doubleQuote", e[e.equals = 61] = "equals", e[e.exclamation = 33] = "exclamation", e[e.greaterThan = 62] = "greaterThan", e[e.hash = 35] = "hash", e[e.lessThan = 60] = "lessThan", e[e.minus = 45] = "minus", e[e.openBrace = 123] = "openBrace", e[e.openBracket = 91] = "openBracket", e[e.openParen = 40] = "openParen", e[e.percent = 37] = "percent", e[e.plus = 43] = "plus", e[e.question = 63] = "question", e[e.semicolon = 59] = "semicolon", e[e.singleQuote = 39] = "singleQuote", e[e.slash = 47] = "slash", e[e.tilde = 126] = "tilde", e[e.backspace = 8] = "backspace", e[e.formFeed = 12] = "formFeed", e[e.byteOrderMark = 65279] = "byteOrderMark", e[e.tab = 9] = "tab", e[e.verticalTab = 11] = "verticalTab", e))(d || {}), Dn = /* @__PURE__ */ ((e) => (e[e.Error = 1] = "Error", e[e.Warning = 2] = "Warning", e[e.Information = 3] = "Information", e[e.Hint = 4] = "Hint", e))(Dn || {}), $e = /* @__PURE__ */ ((e) => (e.onlyOneElem = "U002", e.expTagOpen = "U003", e.expTagName = "U004", e.expCloseStart = "U005", e.expEndOrClose = "U006", e.tagNameMismatch = "U007", e.expEnd = "U008", e.expAttrName = "U009", e.expEq = "U010", e.expAttrValue = "U011", e.duplAttr = "U012", e.uppercaseAttr = "U013", e.expTagNameAfterNamespace = "U014", e.expCloseStartWithName = "U015", e.expAttrNameAfterNamespace = "U016", e.unexpectedCloseTag = "U017", e.expTagNameAfterCloseStart = "U019", e.expAttrNameBeforeEq = "U020", e.invalidChar = "W001", e.untermStr = "W002", e.untermComment = "W007", e.untermCData = "W008", e.untermScript = "W009", e))($e || {});
-const $ = {
+var d = /* @__PURE__ */ ((e) => (e[e.EOF = -1] = "EOF", e[e.nullCharacter = 0] = "nullCharacter", e[e.maxAsciiCharacter = 127] = "maxAsciiCharacter", e[e.lineFeed = 10] = "lineFeed", e[e.carriageReturn = 13] = "carriageReturn", e[e.lineSeparator = 8232] = "lineSeparator", e[e.paragraphSeparator = 8233] = "paragraphSeparator", e[e.nextLine = 133] = "nextLine", e[e.space = 32] = "space", e[e.nonBreakingSpace = 160] = "nonBreakingSpace", e[e.enQuad = 8192] = "enQuad", e[e.emQuad = 8193] = "emQuad", e[e.enSpace = 8194] = "enSpace", e[e.emSpace = 8195] = "emSpace", e[e.threePerEmSpace = 8196] = "threePerEmSpace", e[e.fourPerEmSpace = 8197] = "fourPerEmSpace", e[e.sixPerEmSpace = 8198] = "sixPerEmSpace", e[e.figureSpace = 8199] = "figureSpace", e[e.punctuationSpace = 8200] = "punctuationSpace", e[e.thinSpace = 8201] = "thinSpace", e[e.hairSpace = 8202] = "hairSpace", e[e.zeroWidthSpace = 8203] = "zeroWidthSpace", e[e.narrowNoBreakSpace = 8239] = "narrowNoBreakSpace", e[e.ideographicSpace = 12288] = "ideographicSpace", e[e.mathematicalSpace = 8287] = "mathematicalSpace", e[e.ogham = 5760] = "ogham", e[e.replacementCharacter = 65533] = "replacementCharacter", e[e._ = 95] = "_", e[e.$ = 36] = "$", e[e._0 = 48] = "_0", e[e._1 = 49] = "_1", e[e._2 = 50] = "_2", e[e._3 = 51] = "_3", e[e._4 = 52] = "_4", e[e._5 = 53] = "_5", e[e._6 = 54] = "_6", e[e._7 = 55] = "_7", e[e._8 = 56] = "_8", e[e._9 = 57] = "_9", e[e.a = 97] = "a", e[e.b = 98] = "b", e[e.c = 99] = "c", e[e.d = 100] = "d", e[e.e = 101] = "e", e[e.f = 102] = "f", e[e.g = 103] = "g", e[e.h = 104] = "h", e[e.i = 105] = "i", e[e.j = 106] = "j", e[e.k = 107] = "k", e[e.l = 108] = "l", e[e.m = 109] = "m", e[e.n = 110] = "n", e[e.o = 111] = "o", e[e.p = 112] = "p", e[e.q = 113] = "q", e[e.r = 114] = "r", e[e.s = 115] = "s", e[e.t = 116] = "t", e[e.u = 117] = "u", e[e.v = 118] = "v", e[e.w = 119] = "w", e[e.x = 120] = "x", e[e.y = 121] = "y", e[e.z = 122] = "z", e[e.A = 65] = "A", e[e.B = 66] = "B", e[e.C = 67] = "C", e[e.D = 68] = "D", e[e.E = 69] = "E", e[e.F = 70] = "F", e[e.G = 71] = "G", e[e.H = 72] = "H", e[e.I = 73] = "I", e[e.J = 74] = "J", e[e.K = 75] = "K", e[e.L = 76] = "L", e[e.M = 77] = "M", e[e.N = 78] = "N", e[e.O = 79] = "O", e[e.P = 80] = "P", e[e.Q = 81] = "Q", e[e.R = 82] = "R", e[e.S = 83] = "S", e[e.T = 84] = "T", e[e.U = 85] = "U", e[e.V = 86] = "V", e[e.W = 87] = "W", e[e.X = 88] = "X", e[e.Y = 89] = "Y", e[e.Z = 90] = "Z", e[e.ampersand = 38] = "ampersand", e[e.asterisk = 42] = "asterisk", e[e.at = 64] = "at", e[e.backslash = 92] = "backslash", e[e.backtick = 96] = "backtick", e[e.bar = 124] = "bar", e[e.caret = 94] = "caret", e[e.closeBrace = 125] = "closeBrace", e[e.closeBracket = 93] = "closeBracket", e[e.closeParen = 41] = "closeParen", e[e.colon = 58] = "colon", e[e.comma = 44] = "comma", e[e.dot = 46] = "dot", e[e.doubleQuote = 34] = "doubleQuote", e[e.equals = 61] = "equals", e[e.exclamation = 33] = "exclamation", e[e.greaterThan = 62] = "greaterThan", e[e.hash = 35] = "hash", e[e.lessThan = 60] = "lessThan", e[e.minus = 45] = "minus", e[e.openBrace = 123] = "openBrace", e[e.openBracket = 91] = "openBracket", e[e.openParen = 40] = "openParen", e[e.percent = 37] = "percent", e[e.plus = 43] = "plus", e[e.question = 63] = "question", e[e.semicolon = 59] = "semicolon", e[e.singleQuote = 39] = "singleQuote", e[e.slash = 47] = "slash", e[e.tilde = 126] = "tilde", e[e.backspace = 8] = "backspace", e[e.formFeed = 12] = "formFeed", e[e.byteOrderMark = 65279] = "byteOrderMark", e[e.tab = 9] = "tab", e[e.verticalTab = 11] = "verticalTab", e))(d || {}), Pn = /* @__PURE__ */ ((e) => (e[e.Error = 1] = "Error", e[e.Warning = 2] = "Warning", e[e.Information = 3] = "Information", e[e.Hint = 4] = "Hint", e))(Pn || {}), ee = /* @__PURE__ */ ((e) => (e.onlyOneElem = "U002", e.expTagOpen = "U003", e.expTagName = "U004", e.expCloseStart = "U005", e.expEndOrClose = "U006", e.tagNameMismatch = "U007", e.expEnd = "U008", e.expAttrName = "U009", e.expEq = "U010", e.expAttrValue = "U011", e.duplAttr = "U012", e.uppercaseAttr = "U013", e.expTagNameAfterNamespace = "U014", e.expCloseStartWithName = "U015", e.expAttrNameAfterNamespace = "U016", e.unexpectedCloseTag = "U017", e.expTagNameAfterCloseStart = "U019", e.expAttrNameBeforeEq = "U020", e.invalidChar = "W001", e.untermStr = "W002", e.untermComment = "W007", e.untermCData = "W008", e.untermScript = "W009", e))(ee || {});
+const F = {
   unexpectedCloseTag: {
     category: 1,
     code: "U017",
-    message: "Read '</', but there's no opening tag to close. You have too many closing tags."
+    message: "Read '</', but there's no opening tag to close."
   },
   expCloseStartWithName: function(e) {
     return {
@@ -3555,69 +3555,69 @@ const $ = {
     message: "Expected attribute name before '='."
   }
 };
-function _t(e, n = !0) {
-  const r = Dn[e.category];
+function Nt(e, n = !0) {
+  const r = Pn[e.category];
   return n ? r.toLowerCase() : r;
 }
-const Pe = {
+const We = {
   code: "W001",
   category: 1,
   message: "Invalid character."
-}, yr = {
+}, Mr = {
   code: "W002",
   category: 1,
   message: "Unterminated string literal."
-}, Mr = {
+}, Fr = {
   code: "W007",
   category: 1,
   message: "Unterminated comment"
-}, Fr = {
+}, $r = {
   code: "W008",
   category: 1,
   message: "Unterminated CDATA section"
-}, $r = {
+}, qr = {
   code: "W009",
   category: 1,
   message: "Unterminated script section"
 };
-function qr(e, n, r, t, l) {
-  let a = n ?? "", s, o, u, w, O, h;
-  return F(a, t, l), {
+function Xr(e, n, r, t, l) {
+  let a = n ?? "", s, o, u, v, R, h;
+  return Q(a, t, l), {
     getStartPos: () => u,
     getTokenEnd: () => s,
-    getToken: () => O,
-    getTokenStart: () => w,
-    getTokenText: () => a.substring(w, s),
+    getToken: () => R,
+    getTokenStart: () => v,
+    getTokenText: () => a.substring(v, s),
     getTokenValue: () => h,
-    isIdentifier: () => O === c.Identifier,
-    peekChar: y,
-    scanChar: N,
-    scan: V,
-    scanTrivia: R,
+    isIdentifier: () => R === c.Identifier,
+    peekChar: M,
+    scanChar: S,
+    scan: C,
+    scanTrivia: I,
     scanText: m,
     getText: H,
-    setText: F,
-    setOnError: z,
-    resetTokenState: ee,
-    back: J
+    setText: Q,
+    setOnError: X,
+    resetTokenState: q,
+    back: Ee
   };
-  function y(k) {
+  function M(k) {
     if (s + (k ?? 0) >= o)
       return null;
-    const p = Q(s + (k ?? 0));
+    const p = z(s + (k ?? 0));
     return isNaN(p) ? null : p;
   }
-  function N() {
+  function S() {
     if (s >= o)
       return null;
-    const k = Q(s);
-    return s += le(k), k;
+    const k = z(s);
+    return s += se(k), k;
   }
-  function V() {
+  function C() {
     for (u = s; ; ) {
-      if (w = s, s >= o)
-        return O = c.EndOfFileToken;
-      const k = Q(s);
+      if (v = s, s >= o)
+        return R = c.EndOfFileToken;
+      const k = z(s);
       switch (k) {
         case d.lineFeed:
         case d.carriageReturn:
@@ -3625,7 +3625,7 @@ function qr(e, n, r, t, l) {
             s++;
             continue;
           } else
-            return k === d.carriageReturn && s + 1 < o && x(s + 1) === d.lineFeed ? s += 2 : s++, O = c.NewLineTrivia;
+            return k === d.carriageReturn && s + 1 < o && A(s + 1) === d.lineFeed ? s += 2 : s++, R = c.NewLineTrivia;
         case d.tab:
         case d.verticalTab:
         case d.formFeed:
@@ -3652,78 +3652,78 @@ function qr(e, n, r, t, l) {
             s++;
             continue;
           } else {
-            for (; s < o && Ke(x(s)); )
+            for (; s < o && Ce(A(s)); )
               s++;
-            return O = c.WhitespaceTrivia;
+            return R = c.WhitespaceTrivia;
           }
         case d.doubleQuote:
         case d.singleQuote:
         case d.backtick:
-          return h = E(), O = c.StringLiteral;
+          return h = E(), R = c.StringLiteral;
         case d.ampersand:
-          return x(s + 1) === d.a && x(s + 2) === d.m && x(s + 3) === d.p && x(s + 4) === d.semicolon ? (s += 5, O = c.AmpersandEntity) : x(s + 1) === d.l && x(s + 2) === d.t && x(s + 3) === d.semicolon ? (s += 4, O = c.LessThanEntity) : x(s + 1) === d.g && x(s + 2) === d.t && x(s + 3) === d.semicolon ? (s += 4, O = c.GreaterThanEntity) : x(s + 1) === d.q && x(s + 2) === d.u && x(s + 3) === d.o && x(s + 4) === d.t && x(s + 5) === d.semicolon ? (s += 6, O = c.DoubleQuoteEntity) : x(s + 1) === d.a && x(s + 2) === d.p && x(s + 3) === d.o && x(s + 4) === d.s && x(s + 5) === d.semicolon ? (s += 6, O = c.SingleQuoteEntity) : (s++, f(Pe, 1), O = c.Unknown);
+          return A(s + 1) === d.a && A(s + 2) === d.m && A(s + 3) === d.p && A(s + 4) === d.semicolon ? (s += 5, R = c.AmpersandEntity) : A(s + 1) === d.l && A(s + 2) === d.t && A(s + 3) === d.semicolon ? (s += 4, R = c.LessThanEntity) : A(s + 1) === d.g && A(s + 2) === d.t && A(s + 3) === d.semicolon ? (s += 4, R = c.GreaterThanEntity) : A(s + 1) === d.q && A(s + 2) === d.u && A(s + 3) === d.o && A(s + 4) === d.t && A(s + 5) === d.semicolon ? (s += 6, R = c.DoubleQuoteEntity) : A(s + 1) === d.a && A(s + 2) === d.p && A(s + 3) === d.o && A(s + 4) === d.s && A(s + 5) === d.semicolon ? (s += 6, R = c.SingleQuoteEntity) : (s++, f(We, 1), R = c.Unknown);
         case d.equals:
-          return s++, O = c.Equal;
+          return s++, R = c.Equal;
         case d.colon:
-          return s++, O = c.Colon;
+          return s++, R = c.Colon;
         case d.lessThan:
-          if (x(s + 1) === d.slash)
-            return s += 2, O = c.CloseNodeStart;
+          if (A(s + 1) === d.slash)
+            return s += 2, R = c.CloseNodeStart;
           if (
             // --- "<!-- -->", XMLUI comment
-            x(s + 1) === d.exclamation && x(s + 2) === d.minus && x(s + 3) === d.minus
+            A(s + 1) === d.exclamation && A(s + 2) === d.minus && A(s + 3) === d.minus
           ) {
             for (s += 4; s < o; ) {
-              if (x(s) === d.minus && x(s + 1) === d.minus && x(s + 2) === d.greaterThan)
-                return s += 3, O = c.CommentTrivia;
-              s += le(x(s));
+              if (A(s) === d.minus && A(s + 1) === d.minus && A(s + 2) === d.greaterThan)
+                return s += 3, R = c.CommentTrivia;
+              s += se(A(s));
             }
-            return f(Mr, 4), O = c.Unknown;
+            return f(Fr, 4), R = c.Unknown;
           } else if (
             // --- <![CDATA[ section
-            x(s + 1) === d.exclamation && x(s + 2) === d.openBracket && x(s + 3) === d.C && x(s + 4) === d.D && x(s + 5) === d.A && x(s + 6) === d.T && x(s + 7) === d.A && x(s + 8) === d.openBracket
+            A(s + 1) === d.exclamation && A(s + 2) === d.openBracket && A(s + 3) === d.C && A(s + 4) === d.D && A(s + 5) === d.A && A(s + 6) === d.T && A(s + 7) === d.A && A(s + 8) === d.openBracket
           ) {
             for (s += 9; s < o; ) {
-              if (x(s) === d.closeBracket && x(s + 1) === d.closeBracket && x(s + 2) === d.greaterThan)
-                return s += 3, O = c.CData;
-              s += le(x(s));
+              if (A(s) === d.closeBracket && A(s + 1) === d.closeBracket && A(s + 2) === d.greaterThan)
+                return s += 3, R = c.CData;
+              s += se(A(s));
             }
-            return f(Fr, 9), O = c.CData;
+            return f($r, 9), R = c.CData;
           } else if (
             // --- <script>
-            x(s + 1) === d.s && x(s + 2) === d.c && x(s + 3) === d.r && x(s + 4) === d.i && x(s + 5) === d.p && x(s + 6) === d.t && x(s + 7) === d.greaterThan
+            A(s + 1) === d.s && A(s + 2) === d.c && A(s + 3) === d.r && A(s + 4) === d.i && A(s + 5) === d.p && A(s + 6) === d.t && A(s + 7) === d.greaterThan
           ) {
             for (s += 8; s < o; ) {
-              if (x(s) === d.lessThan && x(s + 1) === d.slash && x(s + 2) === d.s && x(s + 3) === d.c && x(s + 4) === d.r && x(s + 5) === d.i && x(s + 6) === d.p && x(s + 7) === d.t && x(s + 8) === d.greaterThan)
-                return s += 9, O = c.Script;
-              s += le(x(s));
+              if (A(s) === d.lessThan && A(s + 1) === d.slash && A(s + 2) === d.s && A(s + 3) === d.c && A(s + 4) === d.r && A(s + 5) === d.i && A(s + 6) === d.p && A(s + 7) === d.t && A(s + 8) === d.greaterThan)
+                return s += 9, R = c.Script;
+              s += se(A(s));
             }
-            return f($r, 9), O = c.Script;
+            return f(qr, 9), R = c.Script;
           }
-          return s++, O = c.OpenNodeStart;
+          return s++, R = c.OpenNodeStart;
         case d.slash:
-          return x(s + 1) === d.greaterThan ? (s += 2, O = c.NodeClose) : (s++, f(Pe, 1), O = c.Unknown);
+          return A(s + 1) === d.greaterThan ? (s += 2, R = c.NodeClose) : (s++, f(We, 1), R = c.Unknown);
         case d.greaterThan:
-          return s++, O = c.NodeEnd;
+          return s++, R = c.NodeEnd;
         default:
-          const p = re(k);
+          const p = V(k);
           if (p)
-            return O = p;
-          if (Ke(k)) {
-            s += le(k);
+            return R = p;
+          if (Ce(k)) {
+            s += se(k);
             continue;
-          } else if (zr(k)) {
-            s += le(k);
+          } else if (Yr(k)) {
+            s += se(k);
             continue;
           }
-          const T = le(k);
-          return s += T, f(Pe, T), O = c.Unknown;
+          const x = se(k);
+          return s += x, f(We, x), R = c.Unknown;
       }
     }
   }
-  function R() {
-    const k = s, p = V();
-    return wr(p) ? p : (ee(k), null);
+  function I() {
+    const k = s, p = C();
+    return vr(p) ? p : (q(k), null);
   }
   function m() {
     return c.Unknown;
@@ -3731,49 +3731,49 @@ function qr(e, n, r, t, l) {
   function H() {
     return a;
   }
-  function x(k) {
+  function A(k) {
     return a.charCodeAt(k);
   }
-  function Q(k) {
-    return X(a, k);
+  function z(k) {
+    return j(a, k);
   }
-  function X(k, p) {
+  function j(k, p) {
     return k.codePointAt(p) ?? 0;
   }
-  function F(k, p, T) {
-    a = k || "", o = T === void 0 ? a.length : p + T, ee(p || 0);
+  function Q(k, p, x) {
+    a = k || "", o = x === void 0 ? a.length : p + x, q(p || 0);
   }
-  function z(k) {
+  function X(k) {
     r = k;
   }
-  function ee(k) {
-    s = k, u = k, w = k, O = c.Unknown, h = void 0;
+  function q(k) {
+    s = k, u = k, v = k, R = c.Unknown, h = void 0;
   }
-  function J() {
-    ee(u);
+  function Ee() {
+    q(u);
   }
-  function re(k) {
+  function V(k) {
     let p = k;
-    if (Hr(p)) {
-      for (s += le(p); s < o && Qr(p = Q(s)); )
-        s += le(p);
-      return h = a.substring(w, s), Z();
+    if (Qr(p)) {
+      for (s += se(p); s < o && zr(p = z(s)); )
+        s += se(p);
+      return h = a.substring(v, s), ne();
     }
   }
-  function Z() {
-    return O = c.Identifier;
+  function ne() {
+    return R = c.Identifier;
   }
   function E() {
-    const k = x(s);
+    const k = A(s);
     s++;
-    let p = "", T = s;
+    let p = "", x = s;
     for (; ; ) {
       if (s >= o) {
-        p += a.substring(T, s), f(yr, 1);
+        p += a.substring(x, s), f(Mr, 1);
         break;
       }
-      if (x(s) === k) {
-        p += a.substring(T, s), s++;
+      if (A(s) === k) {
+        p += a.substring(x, s), s++;
         break;
       }
       s++;
@@ -3784,154 +3784,155 @@ function qr(e, n, r, t, l) {
     r && r(k, p);
   }
 }
-function le(e) {
+function se(e) {
   return e >= 65536 ? 2 : e === d.EOF ? 0 : 1;
 }
-function Pn(e) {
+function Bn(e) {
   return e >= d.A && e <= d.Z || e >= d.a && e <= d.z;
 }
-function Xr(e) {
-  return Pn(e) || Gr(e) || e === d._;
-}
 function Gr(e) {
-  return e >= d._0 && e <= d._9;
+  return Bn(e) || Hr(e) || e === d._;
 }
 function Hr(e) {
-  return Pn(e) || e === d.$ || e === d._;
+  return e >= d._0 && e <= d._9;
 }
 function Qr(e) {
-  return Xr(e) || e === d.$ || e === d.minus || e === d.dot;
+  return Bn(e) || e === d.$ || e === d._;
 }
-function Ke(e) {
+function zr(e) {
+  return Gr(e) || e === d.$ || e === d.minus || e === d.dot;
+}
+function Ce(e) {
   return e === d.space || e === d.tab || e === d.verticalTab || e === d.formFeed || e === d.nonBreakingSpace || e === d.nextLine || e === d.ogham || e >= d.enQuad && e <= d.zeroWidthSpace || e === d.narrowNoBreakSpace || e === d.mathematicalSpace || e === d.ideographicSpace || e === d.byteOrderMark;
 }
-function zr(e) {
+function Yr(e) {
   return e === d.lineFeed || e === d.carriageReturn || e === d.lineSeparator || e === d.paragraphSeparator;
 }
-const Yr = [c.CData, c.Script, c.OpenNodeStart], me = [
+const Jr = [c.CData, c.Script, c.OpenNodeStart], Ae = [
   c.OpenNodeStart,
   c.NodeEnd,
   c.NodeClose,
   c.CloseNodeStart,
   c.CData,
   c.Script
-], Ce = [c.Identifier, ...me], Jr = [
+], je = [c.Identifier, ...Ae], Zr = [
   c.TextNode,
   c.StringLiteral,
   c.CData,
   c.Script,
   c.OpenNodeStart,
   c.CloseNodeStart
-], Zr = [
+], Kr = [
   c.NodeEnd,
   c.OpenNodeStart,
   c.CloseNodeStart,
   c.CData,
   c.Script
 ];
-function Nt(e) {
+ee.unexpectedCloseTag, ee.expCloseStartWithName, ee.expCloseStart, ee.tagNameMismatch, ee.expEnd, ee.expTagName, ee.expTagOpen, ee.expEndOrClose, ee.expTagNameAfterNamespace, ee.expTagNameAfterCloseStart;
+function St(e) {
   return {
-    parse: () => Kr(e),
+    parse: () => Cr(e),
     getText: (n, r = !0) => e.substring(r ? n.pos ?? n.start ?? 0 : n.start ?? n.pos ?? 0, n.end)
   };
 }
-function Kr(e) {
+function Cr(e) {
   const n = [], r = [];
   let t, l = { children: [] }, a;
-  const o = qr(!1, e, function(g, _) {
+  const o = Xr(!1, e, function(_, g) {
     a = {
-      message: g,
-      prefixLength: _
+      message: _,
+      prefixLength: g
     };
   });
-  return { node: O(), errors: n };
-  function w(g, _ = !0) {
-    return e.substring(_ ? g.pos : g.start, g.end);
+  return { node: R(), errors: n };
+  function v(_, g = !0) {
+    return e.substring(g ? _.pos : _.start, _.end);
   }
-  function O() {
+  function R() {
     for (; ; )
-      switch (E().kind) {
+      switch (f().kind) {
         case c.EndOfFileToken:
-          return k(), je(c.ContentListNode, l.children);
+          return p(), Ve(c.ContentListNode, l.children);
         case c.CData:
         case c.Script:
-          k();
+          p();
           break;
         case c.OpenNodeStart:
-          y();
+          M();
           break;
         default:
-          const _ = z(Yr);
-          F($.unexpectedCloseTag, _.pos, _.end);
+          const g = q(Jr);
+          X(F.unexpectedCloseTag, g.pos, g.end);
           break;
       }
   }
   function h() {
-    p();
+    x();
     e: for (; ; )
-      switch (E().kind) {
+      switch (f().kind) {
         case c.TextNode:
         case c.StringLiteral:
         case c.CData:
         case c.Script:
-          k();
+          p();
           break;
         case c.OpenNodeStart:
-          y();
+          M();
           break;
         case c.CloseNodeStart:
         case c.EndOfFileToken:
           break e;
         default:
-          const _ = z(Jr);
-          F($.expTagOpen, _.pos, _.end);
+          const g = q(Zr);
+          X(F.expTagOpen, g.pos, g.end);
           break;
       }
-    l.children && l.children.length > 0 ? T(c.ContentListNode) : v();
-  }
-  function y() {
-    p(), f(c.OpenNodeStart);
-    let g = !0, _ = null;
-    if (re(c.Identifier)) {
-      const S = N();
-      g = S.errInName, _ = S.node;
+    l.children && l.children.length > 0 ? w(c.ContentListNode) : U();
+  }
+  function M() {
+    x(), k(c.OpenNodeStart);
+    let _ = !0, g = null;
+    if (ne(c.Identifier)) {
+      const L = S();
+      _ = L.errInName, g = L.node;
     } else {
-      const S = z(me);
-      S ? F($.expTagName, S.pos, S.end) : X($.expTagName);
+      const L = q(Ae);
+      L ? X(F.expTagName, L.pos, L.end) : Q(F.expTagName);
     }
-    switch (g || V(), Z().kind) {
+    switch (_ || C(), E().kind) {
       case c.NodeClose: {
-        k(), T(c.ElementNode);
+        p(), w(c.ElementNode);
         return;
       }
       case c.NodeEnd: {
-        k(), h(), H(_, g), T(c.ElementNode);
+        p(), h(), H(g, _), w(c.ElementNode);
         return;
       }
       default: {
-        T(c.ElementNode), X($.expEndOrClose);
+        w(c.ElementNode), Q(F.expEndOrClose);
         return;
       }
     }
   }
-  function N() {
-    p();
-    const g = f(c.Identifier);
-    if (J(c.Colon) && !J(c.Identifier)) {
-      const _ = T(c.TagNameNode), S = w(g);
-      return F(
-        $.expTagNameAfterNamespace(S),
-        _.pos,
-        _.end
-      ), z([c.Identifier, ...me]), { node: _, errInName: !0 };
+  function S() {
+    x();
+    const _ = k(c.Identifier);
+    if (V(c.Colon) && !V(c.Identifier)) {
+      const g = w(c.TagNameNode), L = v(_);
+      return X(
+        F.expTagNameAfterNamespace(L),
+        g.pos,
+        g.end
+      ), q([c.Identifier, ...Ae]), { node: g, errInName: !0 };
     } else
-      return { node: T(c.TagNameNode), errInName: !1 };
+      return { node: w(c.TagNameNode), errInName: !1 };
   }
-  function V() {
-    p();
-    const g = [];
+  function C() {
+    x();
+    const _ = [];
     e: for (; ; )
-      switch (Z().kind) {
+      switch (E().kind) {
         case c.EndOfFileToken:
         case c.OpenNodeStart:
         case c.NodeEnd:
@@ -3941,288 +3942,325 @@ function Kr(e) {
         case c.Script:
           break e;
         default:
-          R(g);
+          I(_);
       }
-    l.children.length === 0 ? v() : T(c.AttributeListNode);
+    l.children.length === 0 ? U() : w(c.AttributeListNode);
   }
-  function R(g) {
-    if (p(), re(c.Identifier))
-      m(g);
+  function I(_) {
+    if (x(), ne(c.Identifier))
+      m(_);
     else {
-      const _ = z(Ce);
-      _ ? (re(c.Equal) ? F($.expAttrNameBeforeEq, _.pos, _.end) : F($.expAttrName, _.pos, _.end), T(c.AttributeNode)) : (v(), X($.expAttrName));
+      const g = q(je);
+      g ? (ne(c.Equal) ? X(F.expAttrNameBeforeEq, g.pos, g.end) : X(F.expAttrName, g.pos, g.end), w(c.AttributeNode)) : (U(), Q(F.expAttrName));
       return;
     }
-    if (J(c.Equal) && !J(c.StringLiteral)) {
-      const _ = z(Ce);
-      _ ? F($.expAttrStr, _.pos, _.end) : X($.expAttrStr);
+    if (V(c.Equal) && !V(c.StringLiteral)) {
+      const g = q(je);
+      g ? X(F.expAttrStr, g.pos, g.end) : Q(F.expAttrStr);
     }
-    T(c.AttributeNode);
+    w(c.AttributeNode);
   }
-  function m(g) {
-    let _ = Z(), S;
-    if (p(), f(c.Identifier), J(c.Colon))
-      if (re(c.Identifier))
-        S = _, _ = f(c.Identifier);
+  function m(_) {
+    let g = E(), L;
+    if (x(), k(c.Identifier), V(c.Colon))
+      if (ne(c.Identifier))
+        L = g, g = k(c.Identifier);
       else {
-        const D = w(_), A = z([
+        const T = v(g), N = q([
           c.Equal,
           c.Identifier,
-          ...me
+          ...Ae
         ]);
-        A ? F($.expAttrNameAfterNamespace(D), A.pos, A.end) : X($.expAttrNameAfterNamespace(D));
+        N ? X(F.expAttrNameAfterNamespace(T), N.pos, N.end) : Q(F.expAttrNameAfterNamespace(T));
       }
-    Q(g, { nsIdent: S, nameIdent: _ }), T(c.AttributeKeyNode);
-  }
-  function H(g, _) {
-    if (J(c.CloseNodeStart)) {
-      if (re(c.Identifier)) {
-        const S = x();
-        if (!_ && g !== null && !Pr(g, S, w)) {
-          const A = $.tagNameMismatch(w(g), w(S));
-          F(A, S.pos, S.end);
+    z(_, { nsIdent: L, nameIdent: g }), w(c.AttributeKeyNode);
+  }
+  function H(_, g) {
+    if (V(c.CloseNodeStart)) {
+      if (ne(c.Identifier)) {
+        const L = A();
+        if (!g && _ !== null && !Br(_, L, v)) {
+          const N = F.tagNameMismatch(v(_), v(L));
+          X(N, L.pos, L.end);
         }
       } else {
-        const S = z(Zr);
-        S ? F($.expTagNameAfterCloseStart, S.pos, S.end) : X($.expTagNameAfterCloseStart);
+        const L = q(Kr);
+        L ? X(F.expTagNameAfterCloseStart, L.pos, L.end) : Q(F.expTagNameAfterCloseStart);
       }
-      J(c.NodeEnd) || X($.expEnd);
+      V(c.NodeEnd) || Q(F.expEnd);
     } else
-      g ? F(
-        $.expCloseStartWithName(w(g)),
-        g.pos,
-        g.end
-      ) : X($.expCloseStart);
-  }
-  function x() {
-    p();
-    const g = f(c.Identifier);
-    if (J(c.Colon) && !J(c.Identifier)) {
-      const _ = T(c.TagNameNode);
-      return F(
-        $.expTagNameAfterNamespace(w(g)),
+      _ ? X(
+        F.expCloseStartWithName(v(_)),
         _.pos,
         _.end
-      ), z(me), _;
+      ) : Q(F.expCloseStart);
+  }
+  function A() {
+    x();
+    const _ = k(c.Identifier);
+    if (V(c.Colon) && !V(c.Identifier)) {
+      const g = w(c.TagNameNode);
+      return X(
+        F.expTagNameAfterNamespace(v(_)),
+        g.pos,
+        g.end
+      ), q(Ae), g;
     } else
-      return T(c.TagNameNode);
-  }
-  function Q(g, { nameIdent: _, nsIdent: S }) {
-    const D = w(_), A = S && w(S), I = ({ ns: U, name: de }) => de === D && U === A, P = g.findIndex(I) !== -1, M = "A" <= D[0] && D[0] <= "Z", G = P || M;
-    P && F($.duplAttr(D), _.pos, _.end), !S && M && F($.uppercaseAttr(D), _.pos, _.end), G || g.push({ name: D, ns: A });
+      return w(c.TagNameNode);
+  }
+  function z(_, { nameIdent: g, nsIdent: L }) {
+    const T = v(g), N = L && v(L), b = ({ ns: le, name: ke }) => ke === T && le === N, y = _.findIndex(b) !== -1, G = "A" <= T[0] && T[0] <= "Z", P = y || G;
+    y && X(F.duplAttr(T), g.pos, g.end), !L && G && X(F.uppercaseAttr(T), g.pos, g.end), P || _.push({ name: T, ns: N });
+  }
+  function j(_, g, L) {
+    let T, N, b;
+    for (N = _, T = 0; N >= 0 && !(e[N] === `
+` && (T++, T > L)); )
+      N--;
+    b = N + 1;
+    let y;
+    for (N = g, T = 0; N < e.length; )
+      if (e[N] === `
+`) {
+        if (T++, T > L)
+          break;
+        N++;
+      } else if (e[N] === "\r" && e[N + 1] === `
+`) {
+        if (T++, T > L)
+          break;
+        N += 2;
+      } else
+        N++;
+    return y = N, { contextPos: b, contextEnd: y };
   }
-  function X({ code: g, message: _, category: S }) {
-    const { pos: D, end: A } = Z();
+  function Q({ code: _, message: g, category: L }) {
+    const { pos: T, end: N } = E(), { contextPos: b, contextEnd: y } = j(T, N, 1);
     n.push({
-      category: S,
-      code: g,
-      message: _,
-      pos: D,
-      end: A
+      category: L,
+      code: _,
+      message: g,
+      pos: T,
+      end: N,
+      contextPos: b,
+      contextEnd: y
     });
   }
-  function F({ code: g, message: _, category: S }, D, A) {
+  function X({ code: _, message: g, category: L }, T, N) {
+    const { contextPos: b, contextEnd: y } = j(T, N, 1);
     n.push({
-      category: S,
-      code: g,
-      message: _,
-      pos: D,
-      end: A
+      category: L,
+      code: _,
+      message: g,
+      pos: T,
+      end: N,
+      contextPos: b,
+      contextEnd: y
     });
   }
-  function z(g) {
-    return p(), ee(g), l.children.length === 0 ? (v(), null) : T(c.ErrorNode);
+  function q(_) {
+    return x(), Ee(_), l.children.length === 0 ? (U(), null) : w(c.ErrorNode);
   }
-  function ee(g) {
-    for (let _ = Z(); _.kind !== c.EndOfFileToken && !g.includes(_.kind); k(), _ = Z())
+  function Ee(_) {
+    for (let g = E(); g.kind !== c.EndOfFileToken && !_.includes(g.kind); p(), g = E())
       ;
   }
-  function J(g) {
-    const _ = re(g);
-    return _ && k(), _;
-  }
-  function re(g) {
-    return Z().kind === g;
-  }
-  function Z(g = !1) {
-    return t !== void 0 || (t = b(g)), t;
-  }
-  function E() {
-    const g = Z(!0);
-    if (g.kind === c.EndOfFileToken || g.kind === c.OpenNodeStart || g.kind === c.Script || g.kind === c.CData || g.kind === c.CloseNodeStart)
-      return g;
-    const _ = g.triviaBefore, S = (_ == null ? void 0 : _.length) ?? 0;
-    let D = 0, A = [], I = -1;
-    for (; D < S; ++D)
-      if (_[D].kind === c.CommentTrivia)
-        A.push(_[D]);
+  function V(_) {
+    const g = ne(_);
+    return g && p(), g;
+  }
+  function ne(_) {
+    return E().kind === _;
+  }
+  function E(_ = !1) {
+    return t !== void 0 || (t = D(_)), t;
+  }
+  function f() {
+    const _ = E(!0);
+    if (_.kind === c.EndOfFileToken || _.kind === c.OpenNodeStart || _.kind === c.Script || _.kind === c.CData || _.kind === c.CloseNodeStart)
+      return _;
+    const g = _.triviaBefore, L = (g == null ? void 0 : g.length) ?? 0;
+    let T = 0, N = [], b = -1;
+    for (; T < L; ++T)
+      if (g[T].kind === c.CommentTrivia)
+        N.push(g[T]);
       else {
-        I = D;
+        b = T;
         break;
       }
-    let P = -1;
-    for (; D < S; ++D)
-      if (_[D].kind === c.CommentTrivia) {
-        P = D;
+    let y = -1;
+    for (; T < L; ++T)
+      if (g[T].kind === c.CommentTrivia) {
+        y = T;
         break;
       }
-    let M = !1;
-    if (g.kind === c.StringLiteral) {
-      const xe = g.end, Ae = b(!0);
-      M = Ae.kind === c.CData || Ae.kind === c.CloseNodeStart || Ae.kind === c.Script || Ae.kind === c.OpenNodeStart, o.resetTokenState(xe);
+    let G = !1;
+    if (_.kind === c.StringLiteral) {
+      const Le = _.end, Oe = D(!0);
+      G = Oe.kind === c.CData || Oe.kind === c.CloseNodeStart || Oe.kind === c.Script || Oe.kind === c.OpenNodeStart, o.resetTokenState(Le);
     }
-    let G;
-    M ? G = g.pos : A.length > 0 ? G = A[A.length - 1].end : I !== -1 ? G = _[I].pos : G = g.start;
-    let U;
-    A.length > 0 && (U = A, A[0].pos);
-    let de = c.TextNode, Se = -1;
-    if (P !== -1)
-      Se = _[P].pos, o.resetTokenState(Se);
-    else if (M)
-      de = c.StringLiteral, Se = g.end;
+    let P;
+    G ? P = _.pos : N.length > 0 ? P = N[N.length - 1].end : b !== -1 ? P = g[b].pos : P = _.start;
+    let le;
+    N.length > 0 && (le = N, N[0].pos);
+    let ke = c.TextNode, me = -1;
+    if (y !== -1)
+      me = g[y].pos, o.resetTokenState(me);
+    else if (G)
+      ke = c.StringLiteral, me = _.end;
     else {
       for (; ; ) {
-        const xe = o.peekChar();
-        if (xe === null || xe === d.lessThan)
+        const Le = o.peekChar();
+        if (Le === null || Le === d.lessThan)
           break;
         o.scanChar();
       }
-      Se = o.getTokenEnd();
+      me = o.getTokenEnd();
     }
-    return t = new j(de, G, Se, U), t;
+    return t = new K(ke, P, me, le), t;
   }
-  function f(g) {
-    const _ = k();
-    if (_.kind !== g)
+  function k(_) {
+    const g = p();
+    if (g.kind !== _)
       throw new Error(
-        `expected ${Fe(g)}, bumped a ${Fe(_.kind)}`
+        `expected ${qe(_)}, bumped a ${qe(g.kind)}`
       );
-    return _;
+    return g;
   }
-  function k() {
+  function p() {
     if (t) {
       l.children.push(t);
-      const _ = t;
-      return t = void 0, _;
+      const g = t;
+      return t = void 0, g;
     }
-    const g = b(!1);
-    return l.children.push(g), g;
+    const _ = D(!1);
+    return l.children.push(_), _;
   }
-  function p() {
+  function x() {
     r.push(l), l = {
       children: []
     };
   }
-  function T(g) {
-    const _ = je(g, l.children), S = r[r.length - 1];
-    return S.children.push(_), l = S, r.pop(), _;
+  function w(_) {
+    const g = Ve(_, l.children), L = r[r.length - 1];
+    return L.children.push(g), l = L, r.pop(), g;
   }
-  function b(g) {
-    let _, S = [], D = null;
+  function D(_) {
+    let g, L = [], T = null;
     for (; ; ) {
-      if (_ = o.scan(), D === null && (D = o.getTokenStart()), a !== void 0) {
-        let A;
-        a.message.code === $e.invalidChar ? A = $.invalidChar(o.getTokenText()) : A = a.message;
-        const I = o.getTokenStart(), P = S.length > 0 ? S : void 0;
-        if (S = [], g && A.code === $e.invalidChar)
-          return a = void 0, new j(_, I, o.getTokenEnd(), P);
-        const M = I + a.prefixLength, G = new j(_, I, M, P);
-        return o.resetTokenState(M), p(), l.children.push(G), F(A, I, M), T(c.ErrorNode), a = void 0, b(g);
+      if (g = o.scan(), T === null && (T = o.getTokenStart()), a !== void 0) {
+        let N;
+        a.message.code === ee.invalidChar ? N = F.invalidChar(o.getTokenText()) : N = a.message;
+        const b = o.getTokenStart(), y = L.length > 0 ? L : void 0;
+        if (L = [], _ && N.code === ee.invalidChar)
+          return a = void 0, new K(g, b, o.getTokenEnd(), y);
+        const G = b + a.prefixLength, P = new K(g, b, G, y);
+        o.resetTokenState(G), x(), l.children.push(P);
+        const { contextPos: le, contextEnd: ke } = j(b, G, 0);
+        return n.push({
+          category: N.category,
+          code: N.code,
+          message: N.message,
+          pos: b,
+          end: G,
+          contextPos: le,
+          contextEnd: ke
+        }), w(c.ErrorNode), a = void 0, D(_);
       }
-      switch (_) {
+      switch (g) {
         case c.CommentTrivia:
         case c.NewLineTrivia:
         case c.WhitespaceTrivia:
-          S.push(new j(_, o.getTokenStart(), o.getTokenEnd()));
+          L.push(new K(g, o.getTokenStart(), o.getTokenEnd()));
           break;
         default:
-          return new j(
-            _,
+          return new K(
+            g,
             o.getTokenStart(),
             o.getTokenEnd(),
-            S.length > 0 ? S : void 0
+            L.length > 0 ? L : void 0
           );
       }
     }
   }
-  function v() {
-    const g = r[r.length - 1];
-    g.children.push(...l.children), l = g, r.pop();
+  function U() {
+    const _ = r[r.length - 1];
+    _.children.push(...l.children), l = _, r.pop();
   }
 }
-function je(e, n) {
+function Ve(e, n) {
   const r = n[0], t = n[n.length - 1];
-  return new j(e, r.pos, t.end, void 0, n);
+  return new K(e, r.pos, t.end, void 0, n);
 }
-function L(e, n, r, t, l, a) {
+function O(e, n, r, t, l, a) {
   if (n.cancel)
     return n;
   if (n.skipChildren = !1, Array.isArray(e)) {
     for (const s of e)
-      n = L(s, n, r, t, l, a);
+      n = O(s, n, r, t, l, a);
     return n;
   }
   switch (e.type) {
-    case Re: {
+    case we: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.stmts)
-          if (n = L(s, n, r, t, e, "statements"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "statements"), n.cancel) return n;
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case ge:
+    case Ne:
       return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
-    case an:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "expression"), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case Lr:
+    case on:
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "expression"), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+    case Or:
       return n;
-    case on: {
+    case cn: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.decls)
-          if (n = L(s, n, r, t, e, "declarations"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "declarations"), n.cancel) return n;
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case cn: {
+    case un: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.decls)
-          if (n = L(s, n, r, t, e, "declarations"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "declarations"), n.cancel) return n;
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case qe: {
+    case Xe: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.decls)
-          if (n = L(s, n, r, t, e, "declarations"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "declarations"), n.cancel) return n;
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case un:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.cond, n, r, t, e, "condition"), n.cancel || (e.thenB && (n = L(e.thenB, n, r, t, e, "thenBranch")), n.cancel) || (e.elseB && (n = L(e.elseB, n, r, t, e, "elseBranch")), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
     case fn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.expr && (n = L(e.expr, n, r, t, e, "expression")), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.cond, n, r, t, e, "condition"), n.cancel || (e.thenB && (n = O(e.thenB, n, r, t, e, "thenBranch")), n.cancel) || (e.elseB && (n = O(e.elseB, n, r, t, e, "elseBranch")), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
     case hn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.expr && (n = O(e.expr, n, r, t, e, "expression")), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
     case dn:
       return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
     case pn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.cond, n, r, t, e, "condition"), n.cancel || (n = L(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
     case En:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.body, n, r, t, e, "body"), n.cancel || (n = L(e.cond, n, r, t, e, "condition"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.cond, n, r, t, e, "condition"), n.cancel || (n = O(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
     case kn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.init && (n = L(e.init, n, r, t, e, "init")), n.cancel || (e.cond && (n = L(e.cond, n, r, t, e, "condition")), n.cancel) || (e.upd && (n = L(e.upd, n, r, t, e, "update")), n.cancel) || (n = L(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case _e:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "expression"), n.cancel || (n = L(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case Te:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "expression"), n.cancel || (n = L(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.body, n, r, t, e, "body"), n.cancel || (n = O(e.cond, n, r, t, e, "condition"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
     case gn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "expression"), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.init && (n = O(e.init, n, r, t, e, "init")), n.cancel || (e.cond && (n = O(e.cond, n, r, t, e, "condition")), n.cancel) || (e.upd && (n = O(e.upd, n, r, t, e, "update")), n.cancel) || (n = O(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+    case Se:
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "expression"), n.cancel || (n = O(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+    case xe:
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "expression"), n.cancel || (n = O(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
     case _n:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.tryB && (n = L(e.tryB, n, r, t, e, "tryBlock")), n.cancel || (e.catchB && (n = L(e.catchB, n, r, t, e, "catchBlock")), n.cancel) || (e.finallyB && (n = L(
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "expression"), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
+    case Nn:
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.tryB && (n = O(e.tryB, n, r, t, e, "tryBlock")), n.cancel || (e.catchB && (n = O(e.catchB, n, r, t, e, "catchBlock")), n.cancel) || (e.finallyB && (n = O(
         e.finallyB,
         n,
         r,
@@ -4230,12 +4268,12 @@ function L(e, n, r, t, l, a) {
         e,
         "finallyBlock"
       )), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case Nn: {
+    case Sn: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
-        if (n = L(e.expr, n, r, t, e, "expression"), n.cancel) return n;
+        if (n = O(e.expr, n, r, t, e, "expression"), n.cancel) return n;
         for (const s of e.cases) {
-          if (s.caseE && (n = L(
+          if (s.caseE && (n = O(
             s.caseE,
             n,
             r,
@@ -4245,7 +4283,7 @@ function L(e, n, r, t, l, a) {
           )), n.cancel) return n;
           if (s.stmts !== void 0) {
             for (const o of s.stmts)
-              if (n = L(
+              if (n = O(
                 o,
                 n,
                 r,
@@ -4258,205 +4296,205 @@ function L(e, n, r, t, l, a) {
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case be: {
+    case Pe: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.args)
-          if (n = L(s, n, r, t, e, "arg"), n.cancel) return n;
-        if (n = L(e.stmt, n, r, t, e, "statement"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "arg"), n.cancel) return n;
+        if (n = O(e.stmt, n, r, t, e, "statement"), n.cancel) return n;
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case Sn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case Tn:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
     case Y:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.left, n, r, t, e, "left"), n.cancel || (n = L(e.right, n, r, t, e, "right"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case ce: {
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.left, n, r, t, e, "left"), n.cancel || (n = O(e.right, n, r, t, e, "right"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case ue: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.exprs)
-          if (n = L(s, n, r, t, e, "expression"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "expression"), n.cancel) return n;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case Tn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.cond, n, r, t, e, "condition"), n.cancel || (n = L(e.thenE, n, r, t, e, "consequent"), n.cancel) || (n = L(e.elseE, n, r, t, e, "alternate"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case mn: {
+    case mn:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.cond, n, r, t, e, "condition"), n.cancel || (n = O(e.thenE, n, r, t, e, "consequent"), n.cancel) || (n = O(e.elseE, n, r, t, e, "alternate"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case xn: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.arguments)
-          if (n = L(s, n, r, t, e, "argument"), n.cancel) return n;
-        if (n = L(e.obj, n, r, t, e, "object"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "argument"), n.cancel) return n;
+        if (n = O(e.obj, n, r, t, e, "object"), n.cancel) return n;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case xn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.obj, n, r, t, e, "object"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
     case An:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.obj, n, r, t, e, "object"), n.cancel || (n = L(e.member, n, r, t, e, "member"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case q:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.obj, n, r, t, e, "object"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case Ln:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.obj, n, r, t, e, "object"), n.cancel || (n = O(e.member, n, r, t, e, "member"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case $:
       return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n;
-    case C:
+    case Z:
       return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n;
-    case ue: {
+    case fe: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.items)
-          if (n = L(s, n, r, t, e, "item"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "item"), n.cancel) return n;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case fe: {
+    case he: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.props)
           if (Array.isArray(s)) {
             const [o, u] = s;
-            if (n = L(o, n, r, t, e, "propKey"), n.cancel || (n = L(u, n, r, t, e, "propValue"), n.cancel)) return n;
-          } else if (n = L(s, n, r, t, e, "prop"), n.cancel) return n;
+            if (n = O(o, n, r, t, e, "propKey"), n.cancel || (n = O(u, n, r, t, e, "propValue"), n.cancel)) return n;
+          } else if (n = O(s, n, r, t, e, "prop"), n.cancel) return n;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case he:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case On:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "operand"), n.cancel || (n = L(e.leftValue, n, r, t, e, "leftValue"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case Ne:
+    case de:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case Rn:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "operand"), n.cancel || (n = O(e.leftValue, n, r, t, e, "leftValue"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case Te:
       return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n;
-    case ve: {
+    case De: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         for (const s of e.args)
-          if (n = L(s, n, r, t, e, "arg"), n.cancel) return n;
-        if (n = L(e.statement, n, r, t, e, "statement"), n.cancel) return n;
+          if (n = O(s, n, r, t, e, "arg"), n.cancel) return n;
+        if (n = O(e.statement, n, r, t, e, "statement"), n.cancel) return n;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case Rn:
     case In:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = L(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case ye: {
+    case wn:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = O(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case Fe: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         if (e.aDestr !== void 0) {
           for (const s of e.aDestr)
-            if (n = L(s, n, r, t, e), n.cancel) return n;
+            if (n = O(s, n, r, t, e), n.cancel) return n;
         }
         if (e.oDestr !== void 0) {
           for (const s of e.oDestr)
-            if (n = L(s, n, r, t, e), n.cancel) return n;
+            if (n = O(s, n, r, t, e), n.cancel) return n;
         }
-        if (e.expr && (n = L(e.expr, n, r, t, e, "expression")), n.cancel) return n;
+        if (e.expr && (n = O(e.expr, n, r, t, e, "expression")), n.cancel) return n;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case Ie:
-    case ae:
+    case ve:
+    case oe:
     case ie: {
       if (n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
         if (e.aDestr !== void 0) {
           for (const s of e.aDestr)
-            if (n = L(s, n, r, t, e), n.cancel) return n;
+            if (n = O(s, n, r, t, e), n.cancel) return n;
         }
         if (e.oDestr !== void 0) {
           for (const s of e.oDestr)
-            if (n = L(s, n, r, t, e), n.cancel) return n;
+            if (n = O(s, n, r, t, e), n.cancel) return n;
         }
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case wn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.expr && (n = L(e.expr, n, r, t, e, "expression")), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case Ln:
-      return n;
     case vn:
+      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.expr && (n = O(e.expr, n, r, t, e, "expression")), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case On:
+      return n;
+    case bn:
       return n;
     default:
       return n;
   }
 }
-function Cr(e) {
+function jr(e) {
   return e.type !== "ScriptModule";
 }
-function jr(e, n) {
+function Vr(e, n) {
   const r = /* @__PURE__ */ new Map(), t = {}, l = a(e, n);
   return !l || Object.keys(t).length > 0 ? t : l;
   function a(s, o) {
     if (r.has(s))
       return r.get(s);
-    const u = new Me(o);
-    let w = [];
+    const u = new $e(o);
+    let v = [];
     try {
-      w = u.parseStatements();
+      v = u.parseStatements();
     } catch {
       return t[s] = u.errors, null;
     }
-    const O = u.current;
-    if (O.type !== i.Eof)
+    const R = u.current;
+    if (R.type !== i.Eof)
       return t[s] ?? (t[s] = []), t[s].push({
         code: "W002",
-        text: we.W002.replace(/\{(\d+)}/g, () => O.text),
-        position: O.startLine,
-        line: O.startLine,
-        column: O.startColumn
+        text: be.W002.replace(/\{(\d+)}/g, () => R.text),
+        position: R.startLine,
+        line: R.startLine,
+        column: R.startColumn
       }), null;
-    const h = [], y = {};
-    w.filter((R) => R.type === be).forEach((R) => {
-      const m = R;
-      if (y[m.id.name]) {
-        V("W020", R, m.id.name);
+    const h = [], M = {};
+    v.filter((I) => I.type === Pe).forEach((I) => {
+      const m = I;
+      if (M[m.id.name]) {
+        C("W020", I, m.id.name);
         return;
       }
-      y[m.id.name] = m;
+      M[m.id.name] = m;
     });
-    const N = {
+    const S = {
       type: "ScriptModule",
       name: s,
-      functions: y,
-      statements: w,
+      functions: M,
+      statements: v,
       sources: /* @__PURE__ */ new Map()
     };
-    if (r.set(s, N), h.length > 0)
+    if (r.set(s, S), h.length > 0)
       return t[s] = h, null;
-    return N;
-    function V(R, m, ...H) {
-      var Q, X, F;
-      let x = we[R];
+    return S;
+    function C(I, m, ...H) {
+      var z, j, Q;
+      let A = be[I];
       H && H.forEach(
-        (z, ee) => x = x.replaceAll(`{${ee}}`, H[ee].toString())
+        (X, q) => A = A.replaceAll(`{${q}}`, H[q].toString())
       ), h.push({
-        code: R,
-        text: we[R].replace(/\{(\d+)}/g, (z, ee) => H[ee]),
-        position: (Q = m.startToken) == null ? void 0 : Q.startPosition,
-        line: (X = m.startToken) == null ? void 0 : X.startLine,
-        column: (F = m.startToken) == null ? void 0 : F.startColumn
+        code: I,
+        text: be[I].replace(/\{(\d+)}/g, (X, q) => H[q]),
+        position: (z = m.startToken) == null ? void 0 : z.startPosition,
+        line: (j = m.startToken) == null ? void 0 : j.startLine,
+        column: (Q = m.startToken) == null ? void 0 : Q.startColumn
       });
     }
   }
 }
-const Be = "__PARSED__";
-function Vr(e, n) {
+const Ue = "__PARSED__";
+function et(e, n) {
   const r = {
     vars: {},
     moduleErrors: {},
     functions: {}
-  }, t = {}, l = jr(e, n);
-  if (Cr(l))
+  }, t = {}, l = Vr(e, n);
+  if (jr(l))
     return { ...r, moduleErrors: l };
   return l.statements.forEach((s) => {
     switch (s.type) {
-      case qe:
+      case Xe:
         s.decls.forEach((o) => {
           if (o.id.name in r.vars)
             throw new Error(`Duplicated var declaration: '${o.id.name}'`);
           r.vars[o.id.name] = {
-            [Be]: !0,
+            [Ue]: !0,
             tree: o.expr
           };
         });
         break;
-      case be:
+      case Pe:
         a(s);
         break;
       default:
@@ -4469,7 +4507,7 @@ function Vr(e, n) {
     if (s.id.name in r.functions)
       throw new Error(`Duplicated function declaration: '${s.id.name}'`);
     const o = {
-      type: ve,
+      type: De,
       args: s.args.slice(),
       statement: s.stmt
       // closureContext: obtainClosures({
@@ -4480,15 +4518,15 @@ function Vr(e, n) {
       // }),
     };
     t[s.id.name] = {
-      [Be]: !0,
+      [Ue]: !0,
       tree: o
     }, r.functions[s.id.name] = {
-      [Be]: !0,
+      [Ue]: !0,
       tree: o
     };
   }
 }
-function St(e) {
+function Tt(e) {
   if (!e) return;
   const n = {
     data: null,
@@ -4502,15 +4540,15 @@ function St(e) {
   });
   function r(t) {
     const l = (a, s, o) => (a && s && (delete s.startToken, delete s.endToken), o);
-    L(t.tree, n, l, l);
+    O(t.tree, n, l, l);
   }
 }
-class De extends Error {
+class Be extends Error {
   constructor(n, r) {
-    super(`${r ? `${r}: ` : ""}${n}`), this.code = r, Object.setPrototypeOf(this, De.prototype);
+    super(`${r ? `${r}: ` : ""}${n}`), this.code = r, Object.setPrototypeOf(this, Be.prototype);
   }
 }
-const et = {
+const nt = {
   U001: "Unexpected token: {0}.",
   U002: "A component definition can have exactly one XMLUI element.",
   U003: "A '<' token expected.",
@@ -4555,7 +4593,7 @@ const et = {
   T027: "Cannot resolve namespace '{0}'. It was not defined in any of the ancestor components.",
   T028: "Incorrect namespace value '{0}'. {1}",
   T029: "Incorrect scheme specified before ':' (colon) in namespace {0}. Delete it to get the default '{1}'."
-}, Ve = "Component", We = /^[A-Z]/, en = /^on[A-Z]/, nt = ["name", "value"], rt = 9, Ue = "component-ns", tt = "app-ns", it = "#app-ns", lt = "core-ns", st = "#xmlui-core-ns", oe = {
+}, en = "Component", ye = /^[A-Z]/, nn = /^on[A-Z]/, rt = ["name", "value"], tt = 9, Me = "component-ns", it = "app-ns", lt = "#app-ns", st = "core-ns", at = "#xmlui-core-ns", ce = {
   property: "property",
   event: "event",
   variable: "variable",
@@ -4565,14 +4603,14 @@ const et = {
   item: "item",
   field: "field"
 };
-let at = 0;
-function Tt(e, n, r) {
-  const t = (E) => E.text ?? n(E), l = ut(e), a = X(l), s = [], o = [];
+let ot = 0;
+function mt(e, n, r) {
+  const t = (E) => E.text ?? n(E), l = ft(e), a = j(l), s = [], o = [];
   return u(s, a);
   function u(E, f) {
-    const k = sn(f, t, o);
-    if (k === Ve)
-      return O(f);
+    const k = an(f, t, o);
+    if (k === en)
+      return R(f);
     let p = {
       type: k,
       debug: {
@@ -4585,9 +4623,9 @@ function Tt(e, n, r) {
     };
     return h(E, p, f), p;
   }
-  function w(E, f) {
-    const k = sn(f, t, o);
-    k === Ve && B("T006");
+  function v(E, f) {
+    const k = an(f, t, o);
+    k === en && B("T006");
     let p = {
       type: k,
       debug: {
@@ -4600,39 +4638,39 @@ function Tt(e, n, r) {
     };
     return h(E, p, f), p;
   }
-  function O(E) {
-    const f = Ee(E).map(x), k = f.find((U) => U.name === "name");
-    k || B("T003"), We.test(k.value) || B("T004");
-    const p = f.find((U) => U.name === "codeBehind");
-    let T;
-    const b = f.filter((U) => U.startSegment === "method");
-    b.length > 0 && (T = {}, b.forEach((U) => {
-      T[U.name] = U.value;
+  function R(E) {
+    const f = ge(E).map(A), k = f.find((P) => P.name === "name");
+    k || B("T003"), ye.test(k.value) || B("T004");
+    const p = f.find((P) => P.name === "codeBehind");
+    let x;
+    const w = f.filter((P) => P.startSegment === "method");
+    w.length > 0 && (x = {}, w.forEach((P) => {
+      x[P.name] = P.value;
     }));
-    let v;
-    const g = f.filter((U) => U.startSegment === "var");
-    g.length > 0 && (v = {}, g.forEach((U) => {
-      v[U.name] = U.value;
+    let D;
+    const U = f.filter((P) => P.startSegment === "var");
+    U.length > 0 && (D = {}, U.forEach((P) => {
+      D[P.name] = P.value;
     }));
-    const _ = ke(E), S = _.filter(
-      (U) => U.kind === c.ElementNode && !(se(U, t) in oe)
+    const _ = _e(E), g = _.filter(
+      (P) => P.kind === c.ElementNode && !(ae(P, t) in ce)
     );
-    S.length === 0 && S.push(nn(""));
-    const D = [], A = [];
-    for (let U of _)
-      if (U.kind === c.ElementNode) {
-        const de = se(U, t);
-        de === oe.variable ? A.push(U) : de in oe && D.push(U);
+    g.length === 0 && g.push(rn(""));
+    const L = [], T = [];
+    for (let P of _)
+      if (P.kind === c.ElementNode) {
+        const le = ae(P, t);
+        le === ce.variable ? T.push(P) : le in ce && L.push(P);
       }
-    let I;
-    S.length > 1 || A.length > 0 ? I = rn([...A, ...S]) : I = S[0], o.push(/* @__PURE__ */ new Map()), f.filter((U) => U.namespace === "xmlns").forEach((U) => {
-      ln(o, I, U.unsegmentedName, U.value);
+    let N;
+    g.length > 1 || T.length > 0 ? N = tn([...T, ...g]) : N = g[0], o.push(/* @__PURE__ */ new Map()), f.filter((P) => P.namespace === "xmlns").forEach((P) => {
+      sn(o, N, P.unsegmentedName, P.value);
     });
-    let P = w(s, I);
+    let b = v(s, N);
     o.pop();
-    const M = {
+    const y = {
       name: k.value,
-      component: P,
+      component: b,
       debug: {
         source: {
           start: E.start,
@@ -4641,55 +4679,55 @@ function Tt(e, n, r) {
         }
       }
     };
-    T && (M.api = T), v && (P.vars = { ...P.vars, ...v }), p && (M.codeBehind = p.value), P.debug = {
+    x && (y.api = x), D && (b.vars = { ...b.vars, ...D }), p && (y.codeBehind = p.value), b.debug = {
       source: {
-        start: I.start,
-        end: I.end,
+        start: N.start,
+        end: N.end,
         fileId: r
       }
     };
-    const G = tn(E, D);
-    return h(s, M, G), M;
+    const G = ln(E, L);
+    return h(s, y, G), y;
   }
   function h(E, f, k) {
     var _;
-    const p = !ne(f), T = Ee(k);
-    if (o.push(/* @__PURE__ */ new Map()), T.forEach((S) => {
-      y(f, S);
-    }), ke(k).forEach((S) => {
-      if (S.kind === c.Script) {
-        Ee(S).length > 0 && B("T022");
-        const A = t(S), I = A.slice(
-          A.indexOf(">") + 1,
-          A.lastIndexOf("</")
+    const p = !re(f), x = ge(k);
+    if (o.push(/* @__PURE__ */ new Map()), x.forEach((g) => {
+      M(f, g);
+    }), _e(k).forEach((g) => {
+      if (g.kind === c.Script) {
+        ge(g).length > 0 && B("T022");
+        const T = t(g), N = T.slice(
+          T.indexOf(">") + 1,
+          T.lastIndexOf("</")
         );
         f.script ?? (f.script = ""), f.script.length > 0 && (f.script += `
-`), f.script += I;
+`), f.script += N;
         return;
       }
-      if (S.kind === c.TextNode && !p) {
-        f.children = Oe(f.children, t(S));
+      if (g.kind === c.TextNode && !p) {
+        f.children = Ie(f.children, t(g));
         return;
       }
-      const D = se(S, t);
-      if (!(p && S.kind === c.ElementNode && !(D in oe))) {
-        if (!(D in oe) && !p) {
-          const A = w(E, S);
-          A && (f.children ? typeof f.children == "string" ? f.children = [f.children, A] : Array.isArray(f.children) && f.children.push(A) : f.children = [A]);
+      const L = ae(g, t);
+      if (!(p && g.kind === c.ElementNode && !(L in ce))) {
+        if (!(L in ce) && !p) {
+          const T = v(E, g);
+          T && (f.children ? typeof f.children == "string" ? f.children = [f.children, T] : Array.isArray(f.children) && f.children.push(T) : f.children = [T]);
           return;
         }
-        switch (D) {
+        switch (L) {
           case "property":
             m(
               E,
               f,
-              S,
-              (A) => {
-                var I;
-                return ne(f) ? (I = f.props) == null ? void 0 : I[A] : void 0;
+              g,
+              (T) => {
+                var N;
+                return re(f) ? (N = f.props) == null ? void 0 : N[T] : void 0;
               },
-              (A, I) => {
-                ne(f) && (f.props ?? (f.props = {}), f.props[A] = I);
+              (T, N) => {
+                re(f) && (f.props ?? (f.props = {}), f.props[T] = N);
               }
             );
             return;
@@ -4697,295 +4735,295 @@ function Tt(e, n, r) {
             m(
               E,
               f,
-              S,
-              (A) => {
-                var I;
-                return ne(f) ? (I = f.events) == null ? void 0 : I[A] : void 0;
+              g,
+              (T) => {
+                var N;
+                return re(f) ? (N = f.events) == null ? void 0 : N[T] : void 0;
               },
-              (A, I) => {
-                ne(f) && (f.events ?? (f.events = {}), f.events[A] = Z(I));
+              (T, N) => {
+                re(f) && (f.events ?? (f.events = {}), f.events[T] = ne(N));
               },
-              (A) => {
-                en.test(A) && B("T008", A);
+              (T) => {
+                nn.test(T) && B("T008", T);
               }
             );
             return;
-          case oe.variable:
+          case ce.variable:
             m(
               E,
               f,
-              S,
-              (A) => {
-                var I;
-                return ne(f) ? (I = f.vars) == null ? void 0 : I[A] : void 0;
+              g,
+              (T) => {
+                var N;
+                return re(f) ? (N = f.vars) == null ? void 0 : N[T] : void 0;
               },
-              (A, I) => {
-                ne(f) && (f.vars ?? (f.vars = {}), f.vars[A] = I);
+              (T, N) => {
+                re(f) && (f.vars ?? (f.vars = {}), f.vars[T] = N);
               }
             );
             return;
           case "loaders":
-            R(E, f, S);
+            I(E, f, g);
             return;
           case "uses":
-            H(f, S);
+            H(f, g);
             return;
           case "method":
             m(
               E,
               f,
-              S,
-              (A) => {
-                var I;
-                return ne(f) ? (I = f.api) == null ? void 0 : I[A] : void 0;
+              g,
+              (T) => {
+                var N;
+                return re(f) ? (N = f.api) == null ? void 0 : N[T] : void 0;
               },
-              (A, I) => {
-                f.api ?? (f.api = {}), f.api[A] = I;
+              (T, N) => {
+                f.api ?? (f.api = {}), f.api[T] = N;
               }
             );
             return;
           default:
-            B("T009", D);
+            B("T009", L);
             return;
         }
       }
     }), o.pop(), !f.script || f.script.trim().length === 0)
       return;
-    const v = new Me(f.script);
+    const D = new $e(f.script);
     try {
-      v.parseStatements(), f.scriptCollected = Vr("Main", f.script);
-    } catch (S) {
-      v.errors && v.errors.length > 0 ? f.scriptError = v.errors : f.scriptError = S;
+      D.parseStatements(), f.scriptCollected = et("Main", f.script);
+    } catch (g) {
+      D.errors && D.errors.length > 0 ? f.scriptError = D.errors : f.scriptError = g;
     }
-    const g = ((_ = f.scriptCollected) == null ? void 0 : _.moduleErrors) ?? {};
-    Object.keys(g).length > 0 && (f.scriptError = g);
+    const U = ((_ = f.scriptCollected) == null ? void 0 : _.moduleErrors) ?? {};
+    Object.keys(U).length > 0 && (f.scriptError = U);
   }
-  function y(E, f) {
-    const { namespace: k, startSegment: p, name: T, value: b, unsegmentedName: v } = x(f);
+  function M(E, f) {
+    const { namespace: k, startSegment: p, name: x, value: w, unsegmentedName: D } = A(f);
     if (k === "xmlns")
-      return ln(o, E, v, b);
-    if (!ne(E)) {
+      return sn(o, E, D, w);
+    if (!re(E)) {
       if (p && p !== "method" && p !== "var") {
         B("T021");
         return;
       }
-      if (T === "name" && !p || T === "codeBehind" && !p)
+      if (x === "name" && !p || x === "codeBehind" && !p)
         return;
-      !p && T && B("T021", T);
+      !p && x && B("T021", x);
       return;
     }
-    switch (T) {
+    switch (x) {
       case "id":
-        E.uid = b;
+        E.uid = w;
         return;
       case "testId":
-        E.testId = b;
+        E.testId = w;
         return;
       case "when":
-        E.when = b;
+        E.when = w;
         return;
       default:
         if (p === "var")
-          E.vars ?? (E.vars = {}), E.vars[T] = b;
+          E.vars ?? (E.vars = {}), E.vars[x] = w;
         else if (p === "method")
-          E.api ?? (E.api = {}), E.api[T] = b;
+          E.api ?? (E.api = {}), E.api[x] = w;
         else if (p === "event")
-          E.events ?? (E.events = {}), E.events[T] = Z(b);
-        else if (en.test(T)) {
+          E.events ?? (E.events = {}), E.events[x] = ne(w);
+        else if (nn.test(x)) {
           E.events ?? (E.events = {});
-          const _ = T[2].toLowerCase() + T.substring(3);
-          E.events[_] = Z(b);
+          const _ = x[2].toLowerCase() + x.substring(3);
+          E.events[_] = ne(w);
         } else
-          E.props ?? (E.props = {}), E.props[T] = b;
+          E.props ?? (E.props = {}), E.props[x] = w;
         return;
     }
   }
-  function N(E, f) {
+  function S(E, f) {
     let k = null;
     if (!f) return k;
     let p = null;
-    return f.forEach((T) => {
-      if (T.kind === c.TextNode) {
-        k = Oe(k, t(T));
+    return f.forEach((x) => {
+      if (x.kind === c.TextNode) {
+        k = Ie(k, t(x));
         return;
       }
-      if (T.kind !== c.ElementNode) return;
-      const b = se(T, t);
-      if (b !== "field" && b !== "item") {
+      if (x.kind !== c.ElementNode) return;
+      const w = ae(x, t);
+      if (w !== "field" && w !== "item") {
         B("T016");
         return;
       }
-      if (b === "field") {
+      if (w === "field") {
         if (!p)
-          p = b, k = {};
-        else if (p !== b) {
+          p = w, k = {};
+        else if (p !== w) {
           B("T017");
           return;
         }
-      } else if (b === "item") {
+      } else if (w === "item") {
         if (!p)
-          p = b, k = [];
-        else if (p !== b) {
+          p = w, k = [];
+        else if (p !== w) {
           B("T017");
           return;
         }
       }
-      let v = V(E, T, b === "field");
-      if (!v)
+      let D = C(E, x, w === "field");
+      if (!D)
         return null;
-      p === "field" ? k[v.name] = v.value : k.push(v.value);
+      p === "field" ? k[D.name] = D.value : k.push(D.value);
     }), k;
   }
-  function V(E, f, k = !0) {
-    const p = se(f, t), T = ke(f), b = T.filter(
-      (P) => P.kind === c.ElementNode && We.test(se(P, t))
-    ), v = T.filter(
-      (P) => P.kind === c.ElementNode && !We.test(se(P, t))
-    ), g = Ee(f).map(x), _ = g.filter((P) => nt.indexOf(P.name) >= 0);
-    if (g.length > _.length)
+  function C(E, f, k = !0) {
+    const p = ae(f, t), x = _e(f), w = x.filter(
+      (b) => b.kind === c.ElementNode && ye.test(ae(b, t))
+    ), D = x.filter(
+      (b) => b.kind === c.ElementNode && !ye.test(ae(b, t))
+    ), U = ge(f).map(A), _ = U.filter((b) => rt.indexOf(b.name) >= 0);
+    if (U.length > _.length)
       return B("T011", p), null;
-    const S = _.find((P) => P.name === "name");
+    const g = _.find((b) => b.name === "name");
     if (k) {
-      if (!(S != null && S.value))
+      if (!(g != null && g.value))
         return B("T012", p), null;
-    } else if (S)
+    } else if (g)
       return B("T018", p), null;
-    const D = S == null ? void 0 : S.value, A = _.find((P) => P.name === "value");
-    if (A && A.value === void 0)
+    const L = g == null ? void 0 : g.value, T = _.find((b) => b.name === "value");
+    if (T && T.value === void 0)
       return B("T019", p), null;
-    if (D && b.length >= 1) {
-      if (v.length > 0)
+    if (L && w.length >= 1) {
+      if (D.length > 0)
         return B("T020"), null;
-      const P = b.map((M) => w(E, M));
+      const b = w.map((y) => v(E, y));
       return {
-        name: D,
-        value: P.length === 1 ? P[0] : P
+        name: L,
+        value: b.length === 1 ? b[0] : b
       };
     }
-    let I = A == null ? void 0 : A.value;
-    return I === null ? null : typeof I == "string" ? { name: D, value: I } : { name: D, value: N(E, T) };
+    let N = T == null ? void 0 : T.value;
+    return N === null ? null : typeof N == "string" ? { name: L, value: N } : { name: L, value: S(E, x) };
   }
-  function R(E, f, k) {
-    var b;
-    if (!ne(f)) {
+  function I(E, f, k) {
+    var w;
+    if (!re(f)) {
       B("T009", "loaders");
       return;
     }
-    const p = ke(k);
-    if (p.length === 0 && (f.loaders ?? (f.loaders = [])), (b = k.children) == null ? void 0 : b.some((v) => v.kind === c.AttributeListNode)) {
+    const p = _e(k);
+    if (p.length === 0 && (f.loaders ?? (f.loaders = [])), (w = k.children) == null ? void 0 : w.some((D) => D.kind === c.AttributeListNode)) {
       B("T014", "attributes");
       return;
     }
-    p.forEach((v) => {
-      if (v.kind === c.TextNode) {
+    p.forEach((D) => {
+      if (D.kind === c.TextNode) {
         B("T010", "loader");
         return;
       }
-      const g = w(E, v);
-      if (!g.uid) {
+      const U = v(E, D);
+      if (!U.uid) {
         B("T013");
         return;
       }
-      if (g.vars) {
+      if (U.vars) {
         B("T014", "vars");
         return;
       }
-      if (g.loaders) {
+      if (U.loaders) {
         B("T014", "loaders");
         return;
       }
-      if (g.uses) {
+      if (U.uses) {
         B("T014", "uses");
         return;
       }
-      f.loaders ?? (f.loaders = []), f.loaders.push(g);
+      f.loaders ?? (f.loaders = []), f.loaders.push(U);
     });
   }
-  function m(E, f, k, p, T, b) {
-    const v = V(E, k);
-    if (!v)
+  function m(E, f, k, p, x, w) {
+    const D = C(E, k);
+    if (!D)
       return;
-    b == null || b((v == null ? void 0 : v.name) ?? "");
-    const g = v.name, _ = v.value;
-    if ((v == null ? void 0 : v.value) !== void 0)
-      T(g, Oe(p(g), _));
+    w == null || w((D == null ? void 0 : D.name) ?? "");
+    const U = D.name, _ = D.value;
+    if ((D == null ? void 0 : D.value) !== void 0)
+      x(U, Ie(p(U), _));
     else {
-      const S = ke(k), D = N(E, S);
-      let A = p(g);
-      A = Oe(A, D), T(g, A);
+      const g = _e(k), L = S(E, g);
+      let T = p(U);
+      T = Ie(T, L), x(U, T);
     }
   }
   function H(E, f) {
-    if (!ne(E)) {
+    if (!re(E)) {
       B("T009", "uses");
       return;
     }
-    const k = Ee(f).map(x), p = k.find((T) => T.name === "value");
+    const k = ge(f).map(A), p = k.find((x) => x.name === "value");
     if (!(p != null && p.value) || k.length !== 1) {
       B("T015", "uses");
       return;
     }
-    E.uses ?? (E.uses = p.value.split(",").map((T) => T.trim()));
+    E.uses ?? (E.uses = p.value.split(",").map((x) => x.trim()));
   }
-  function x(E) {
+  function A(E) {
     let f = E.children[0];
     const k = f.children.length === 3;
     let p;
     k && (p = t(f.children[0]));
-    let T = t(f.children[f.children.length - 1]);
-    const b = T.split(".");
-    b.length > 2 && B("T007", E, f);
-    let v, g;
-    b.length === 2 ? (g = b[0], v = b[1], v.trim() === "" && B("T007", E, v)) : v = T;
-    const _ = t(E.children[2]), S = _.substring(1, _.length - 1);
-    return { namespace: p, startSegment: g, name: v, value: S, unsegmentedName: T };
+    let x = t(f.children[f.children.length - 1]);
+    const w = x.split(".");
+    w.length > 2 && B("T007", E, f);
+    let D, U;
+    w.length === 2 ? (U = w[0], D = w[1], D.trim() === "" && B("T007", E, D)) : D = x;
+    const _ = t(E.children[2]), g = _.substring(1, _.length - 1);
+    return { namespace: p, startSegment: U, name: D, value: g, unsegmentedName: x };
   }
-  function Q(E) {
+  function z(E) {
     for (let f of E) {
-      const k = f.children[f.children.length - 1], p = J(t(k));
+      const k = f.children[f.children.length - 1], p = Ee(t(k));
       p !== null && (k.text = p);
     }
   }
-  function X(E) {
-    const f = ke(E), k = se(E, t), T = !(k in oe) || k === "property", b = k !== "event" && k !== "method", v = Ee(E);
-    ct(v), Q(v), ee(f), re(f, b);
-    let g = !1, _ = !1;
-    for (let I = 0; I < f.length; ++I) {
-      const P = f[I];
-      let M;
-      if (P.kind == c.Script) {
+  function j(E) {
+    const f = _e(E), k = ae(E, t), x = !(k in ce) || k === "property", w = k !== "event" && k !== "method", D = ge(E);
+    ut(D), z(D), q(f), V(f, w);
+    let U = !1, _ = !1;
+    for (let N = 0; N < f.length; ++N) {
+      const b = f[N];
+      let y;
+      if (b.kind == c.Script) {
         _ = !0;
         continue;
       }
-      if (P.kind === c.ElementNode) {
-        M = X(P), f[I] = M;
+      if (b.kind === c.ElementNode) {
+        y = j(b), f[N] = y;
         continue;
       }
-      let G = t(P);
-      P.kind === c.StringLiteral ? G = G.slice(1, -1) : P.kind === c.CData ? g = !0 : (P.kind, c.TextNode), T ? g ? M = ot(G) : M = nn(G) : M = {
+      let G = t(b);
+      b.kind === c.StringLiteral ? G = G.slice(1, -1) : b.kind === c.CData ? U = !0 : (b.kind, c.TextNode), x ? U ? y = ct(G) : y = rn(G) : y = {
         kind: c.TextNode,
         text: G
-      }, f[I] = M;
+      }, f[N] = y;
     }
-    const S = [], D = [];
-    let A = !1;
-    for (const I of f) {
-      if (I.kind === c.ElementNode) {
-        if ((se(I, t) ?? void 0) in oe) {
-          S.push(I);
+    const g = [], L = [];
+    let T = !1;
+    for (const N of f) {
+      if (N.kind === c.ElementNode) {
+        if ((ae(N, t) ?? void 0) in ce) {
+          g.push(N);
           continue;
         }
-        A = !0;
+        T = !0;
       }
-      D.push(I);
+      L.push(N);
     }
-    if (_ && A) {
-      const I = rn(D);
-      return S.push(I), tn(E, S);
+    if (_ && T) {
+      const N = tn(L);
+      return g.push(N), ln(E, g);
     }
     return E;
   }
-  function F(E) {
+  function Q(E) {
     for (let f = 0; f < E.length; ++f)
       if (E[f].kind === c.StringLiteral || E[f].kind === c.TextNode) {
         const k = /[\f\n\r\t\v\u0020\u1680\u2000-\u200a\u2028\u2029\u202f\u205f\u3000\ufeff]+/g;
@@ -4995,18 +5033,18 @@ function Tt(e, n, r) {
         );
       }
   }
-  function z(E) {
+  function X(E) {
     for (let f = 0; f < E.length; ++f)
-      E[f].kind === c.CData && (E[f].text = t(E[f]).slice(rt, -3));
+      E[f].kind === c.CData && (E[f].text = t(E[f]).slice(tt, -3));
   }
-  function ee(E) {
+  function q(E) {
     for (let f of E)
       if (f.kind === c.StringLiteral || f.kind === c.TextNode) {
-        const k = J(t(f));
+        const k = Ee(t(f));
         k !== null && (f.text = k);
       }
   }
-  function J(E) {
+  function Ee(E) {
     let f = "", k = 0;
     for (let p = 0; p < E.length; ++p)
       if (E.charCodeAt(p) === d.ampersand)
@@ -5036,52 +5074,52 @@ function Tt(e, n, r) {
         }
     return k === 0 ? null : (f += E.substring(k), f);
   }
-  function re(E, f) {
-    f && F(E), z(E);
+  function V(E, f) {
+    f && Q(E), X(E);
     for (let k = E.length - 1; k > 0; --k) {
-      const p = E[k - 1], T = E[k];
-      p.kind === c.StringLiteral && T.kind === c.CData ? (E[k - 1] = {
+      const p = E[k - 1], x = E[k];
+      p.kind === c.StringLiteral && x.kind === c.CData ? (E[k - 1] = {
         kind: c.CData,
-        text: t(p).slice(1, -1) + t(T)
-      }, E.pop()) : p.kind === c.CData && T.kind === c.StringLiteral ? (E[k - 1] = {
+        text: t(p).slice(1, -1) + t(x)
+      }, E.pop()) : p.kind === c.CData && x.kind === c.StringLiteral ? (E[k - 1] = {
         kind: c.CData,
-        text: t(p) + t(T).slice(1, -1)
-      }, E.pop()) : p.kind === c.CData && T.kind === c.TextNode ? (E[k - 1] = {
+        text: t(p) + t(x).slice(1, -1)
+      }, E.pop()) : p.kind === c.CData && x.kind === c.TextNode ? (E[k - 1] = {
         kind: c.CData,
-        text: t(p) + t(T)
-      }, E.pop()) : p.kind === c.CData && T.kind === c.CData ? (E[k - 1] = {
+        text: t(p) + t(x)
+      }, E.pop()) : p.kind === c.CData && x.kind === c.CData ? (E[k - 1] = {
         kind: c.CData,
-        text: t(p) + t(T)
-      }, E.pop()) : p.kind === c.TextNode && T.kind === c.TextNode ? (t(p).endsWith(" ") && t(T).startsWith(" ") && (p.text = t(p).trimEnd()), E[k - 1] = {
+        text: t(p) + t(x)
+      }, E.pop()) : p.kind === c.TextNode && x.kind === c.TextNode ? (t(p).endsWith(" ") && t(x).startsWith(" ") && (p.text = t(p).trimEnd()), E[k - 1] = {
         kind: c.TextNode,
-        text: t(p) + t(T)
-      }, E.pop()) : p.kind === c.TextNode && T.kind === c.CData && (E[k - 1] = {
+        text: t(p) + t(x)
+      }, E.pop()) : p.kind === c.TextNode && x.kind === c.CData && (E[k - 1] = {
         kind: c.CData,
-        text: t(p) + t(T)
+        text: t(p) + t(x)
       }, E.pop());
     }
   }
-  function Z(E) {
+  function ne(E) {
     if (typeof E != "string")
       return E;
-    const f = new Me(E);
+    const f = new $e(E);
     try {
       return {
         __PARSED: !0,
         statements: f.parseStatements(),
-        parseId: ++at,
+        parseId: ++ot,
         // TODO: retrieve the event source code only in dev mode
         source: E
       };
     } catch {
       if (f.errors.length > 0) {
         const k = f.errors[0];
-        throw new De(`${k.text} [${k.line}: ${k.column}]`, k.code);
+        throw new Be(`${k.text} [${k.line}: ${k.column}]`, k.code);
       }
     }
   }
 }
-function ot(e) {
+function ct(e) {
   return {
     kind: c.ElementNode,
     children: [
@@ -5110,7 +5148,7 @@ function ot(e) {
     ]
   };
 }
-function nn(e) {
+function rn(e) {
   return {
     kind: c.ElementNode,
     children: [
@@ -5140,8 +5178,8 @@ function nn(e) {
   };
 }
 function B(e, ...n) {
-  let r = et[e] ?? "Unknown error";
-  throw n && n.forEach((l, a) => r = t(r, `{${a}}`, l.toString())), new De(r, e);
+  let r = nt[e] ?? "Unknown error";
+  throw n && n.forEach((l, a) => r = t(r, `{${a}}`, l.toString())), new Be(r, e);
   function t(l, a, s) {
     do
       l = l.replace(a, s);
@@ -5149,13 +5187,13 @@ function B(e, ...n) {
     return l;
   }
 }
-function ne(e) {
+function re(e) {
   return e.type;
 }
-function Oe(e, n) {
+function Ie(e, n) {
   return e ? Array.isArray(e) ? typeof e == "string" ? [e, n] : (e.push(n), e) : [e, n] : n;
 }
-function rn(e) {
+function tn(e) {
   const n = {
     kind: c.TagNameNode,
     children: [{ kind: c.Identifier, text: "Fragment" }]
@@ -5176,23 +5214,23 @@ function rn(e) {
     ]
   };
 }
-function Ee(e) {
+function ge(e) {
   var n, r;
   return ((r = (n = e.children) == null ? void 0 : n.find((t) => t.kind === c.AttributeListNode)) == null ? void 0 : r.children) ?? [];
 }
-function ke(e) {
+function _e(e) {
   var n, r;
   return ((r = (n = e.children) == null ? void 0 : n.find((t) => t.kind === c.ContentListNode)) == null ? void 0 : r.children) ?? [];
 }
-function tn(e, n) {
+function ln(e, n) {
   var l;
   const r = (l = e.children) == null ? void 0 : l.findIndex((a) => a.kind === c.ContentListNode);
   if (r === void 0 || r === -1)
     return e;
   const t = e.children[r];
-  return new j(e.kind, e.pos ?? 0, e.end ?? 0, e.triviaBefore, [
+  return new K(e.kind, e.pos ?? 0, e.end ?? 0, e.triviaBefore, [
     ...e.children.slice(0, r),
-    new j(
+    new K(
       t.kind,
       t.pos ?? 0,
       t.end ?? 0,
@@ -5202,7 +5240,7 @@ function tn(e, n) {
     ...e.children.slice(r)
   ]);
 }
-function ct(e) {
+function ut(e) {
   var n;
   for (let r of e)
     if (((n = r.children) == null ? void 0 : n.length) === 1) {
@@ -5215,27 +5253,27 @@ function ct(e) {
       r.children.push(t, l);
     }
 }
-function ln(e, n, r, t) {
+function sn(e, n, r, t) {
   let l = t.split(":");
   if (l.length > 2)
     return B("T028", t, "Namespace cannot contain multiple ':' (colon).");
   let a = t;
   if (l.length === 2) {
-    if (l[0] != Ue)
-      return B("T029", t, Ue);
+    if (l[0] != Me)
+      return B("T029", t, Me);
     a = l[1];
   }
   if (a.includes("#"))
     return B("T028", a, "Namespace cannot contain character '#'.");
   switch (a) {
-    case Ue:
+    case Me:
       a = r;
       break;
-    case tt:
-      a = it;
+    case it:
+      a = lt;
       break;
-    case lt:
-      a = st;
+    case st:
+      a = at;
       break;
   }
   const s = e[e.length - 1];
@@ -5243,16 +5281,16 @@ function ln(e, n, r, t) {
     return B("T025", r);
   s.set(r, a);
 }
-function ut(e, n) {
+function ft(e, n) {
   e.children.length !== 2 && B("T001");
   const r = e.children[0];
   return r.kind !== c.ElementNode && B("T001"), r;
 }
-function se(e, n) {
+function ae(e, n) {
   const r = e.children.find((l) => l.kind === c.TagNameNode).children;
   return n(r.at(-1));
 }
-function sn(e, n, r) {
+function an(e, n, r) {
   const t = e.children.find((o) => o.kind === c.TagNameNode).children, l = n(t.at(-1));
   if (t.length === 1)
     return l;
@@ -5263,88 +5301,88 @@ function sn(e, n, r) {
     ;
   return s === void 0 && B("T027", a), s + "." + l;
 }
-function mt(e) {
+function xt(e) {
   return e[2].toLowerCase() + e.substring(3);
 }
 export {
-  dn as $,
-  dt as A,
-  Br as B,
+  pn as $,
+  pt as A,
+  Wr as B,
   d as C,
-  Dn as D,
-  $e as E,
-  Me as F,
-  An as G,
-  xn as H,
-  q as I,
-  Rn as J,
-  be as K,
-  ve as L,
-  Le as M,
-  j as N,
-  ge as O,
-  De as P,
-  Nn as Q,
-  _n as R,
+  Pn as D,
+  ee as E,
+  $e as F,
+  Ln as G,
+  An as H,
+  $ as I,
+  In as J,
+  Pe as K,
+  De as L,
+  Re as M,
+  K as N,
+  Ne as O,
+  Be as P,
+  Sn as Q,
+  Nn as R,
   c as S,
-  gt as T,
-  We as U,
-  gn as V,
-  Te as W,
-  _e as X,
-  kn as Y,
-  an as Z,
-  hn as _,
-  $ as a,
-  En as a0,
-  pn as a1,
-  fn as a2,
-  un as a3,
-  cn as a4,
-  on as a5,
-  Lr as a6,
-  Re as a7,
-  qe as a8,
-  On as a9,
-  C as aa,
-  he as ab,
-  mn as ac,
-  In as ad,
-  Tn as ae,
+  _t as T,
+  ye as U,
+  _n as V,
+  xe as W,
+  Se as X,
+  gn as Y,
+  on as Z,
+  dn as _,
+  F as a,
+  kn as a0,
+  En as a1,
+  hn as a2,
+  fn as a3,
+  un as a4,
+  cn as a5,
+  Or as a6,
+  we as a7,
+  Xe as a8,
+  Rn as a9,
+  Z as aa,
+  de as ab,
+  xn as ac,
+  wn as ad,
+  mn as ae,
   Y as af,
-  Sn as ag,
-  fe as ah,
-  ue as ai,
-  ce as aj,
-  Ln as ak,
-  ye as al,
-  Ie as am,
-  Be as an,
-  Vr as ao,
-  St as ap,
-  Pe as b,
-  yr as c,
-  _t as d,
-  Mr as e,
-  Fr as f,
-  $r as g,
-  Nt as h,
-  et as i,
-  qr as j,
-  Hr as k,
-  wr as l,
-  vr as m,
-  Fe as n,
-  ht as o,
-  Kr as p,
-  pt as q,
-  Et as r,
-  kt as s,
-  Ve as t,
-  en as u,
-  st as v,
-  Tt as w,
-  mt as x,
-  Dr as y,
-  Pr as z
+  Tn as ag,
+  he as ah,
+  fe as ai,
+  ue as aj,
+  On as ak,
+  Fe as al,
+  ve as am,
+  Ue as an,
+  et as ao,
+  Tt as ap,
+  We as b,
+  Mr as c,
+  Nt as d,
+  Fr as e,
+  $r as f,
+  qr as g,
+  St as h,
+  nt as i,
+  Xr as j,
+  Qr as k,
+  vr as l,
+  br as m,
+  qe as n,
+  dt as o,
+  Cr as p,
+  Et as q,
+  kt as r,
+  gt as s,
+  en as t,
+  nn as u,
+  at as v,
+  mt as w,
+  xt as x,
+  Pr as y,
+  Br as z
 };