xmlui 0.9.44 → 0.9.46

package/dist/lib/{transform-BV--wKhF.mjs → transform-DU7v4c9h.mjs}

@@ -1,6 +1,6 @@
-import { parseRegExpLiteral as Xe } from "@eslint-community/regexpp";
-const ve = 1, ke = 2, on = 3, Wn = 4, cn = 5, un = 6, qe = 7, fn = 8, hn = 9, pn = 10, dn = 11, kn = 12, gn = 13, En = 14, ge = 15, _e = 16, xn = 17, mn = 18, _n = 19, De = 20, Sn = 100, G = 101, le = 102, Nn = 103, An = 104, Ln = 105, wn = 106, M = 107, Tn = 108, Q = 109, se = 110, ae = 111, oe = 112, vn = 113, Ee = 114, be = 115, On = 116, In = 117, bn = 118, Ue = 200, Oe = 201, ee = 202, te = 203, Dn = 204;
-class Ge {
+import { parseRegExpLiteral as Ye } from "@eslint-community/regexpp";
+const be = 1, Ee = 2, hn = 3, Fn = 4, dn = 5, pn = 6, Qe = 7, kn = 8, gn = 9, En = 10, mn = 11, xn = 12, _n = 13, Sn = 14, me = 15, Ne = 16, Nn = 17, An = 18, Ln = 19, We = 20, wn = 100, z = 101, ae = 102, Tn = 103, vn = 104, On = 105, In = 106, M = 107, bn = 108, Y = 109, oe = 110, ce = 111, ue = 112, Dn = 113, xe = 114, Be = 115, Rn = 116, Bn = 117, Wn = 118, Xe = 200, De = 201, ne = 202, ie = 203, Pn = 204;
+class Ze {
   // Creates a stream that uses the specified source code
   constructor(n) {
     this.source = n, this._pos = 0, this._line = 1, this._column = 0;
@@ -40,7 +40,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 ze {
+class Je {
   /**
    * Initializes the tokenizer with the input stream
    * @param input Input source code stream
@@ -65,9 +65,9 @@ class ze {
       throw new Error("Cannot look ahead more than 16 tokens");
     for (; this._ahead.length <= n; ) {
       const t = this.fetch();
-      if (Qe(t))
+      if (Ke(t))
         return t;
-      (r || !r && !He(t)) && this._ahead.push(t);
+      (r || !r && !Ce(t)) && this._ahead.push(t);
     }
     return this._ahead[n];
   }
@@ -84,7 +84,7 @@ class ze {
     }
     for (; ; ) {
       const r = this.fetch();
-      if (Qe(r) || n || !n && !He(r))
+      if (Ke(r) || n || !n && !Ce(r))
         return r;
     }
   }
@@ -119,10 +119,10 @@ class ze {
   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 = "", c = i.Eof, R = r.position, T = r.column, h = null, F = !1, x = this.getStartingPhaseThenReset();
+    let s = null, o = "", c = i.Eof, b = r.position, w = r.column, h = null, F = !1, x = this.getStartingPhaseThenReset();
     for (; ; ) {
       if (h = this.fetchNextChar(), h === null)
-        return v();
+        return T();
       c === i.Eof && (c = i.Unknown);
       e: switch (x) {
         case 0:
@@ -210,14 +210,14 @@ class ze {
               s = h, x = 35;
               break;
             default:
-              Ye(h) ? (F = !0, x = 17, c = i.Identifier) : V(h) ? (x = 27, c = i.DecimalLiteral) : _(i.Unknown);
+              je(h) ? (F = !0, x = 17, c = i.Identifier) : ee(h) ? (x = 27, c = i.DecimalLiteral) : _(i.Unknown);
               break;
           }
           break;
         case 1:
           if (h !== " " && h !== "	" && h !== "\r" && h !== `
 `)
-            return v();
+            return T();
           break;
         case 3:
           h === "*" && (x = 4);
@@ -232,26 +232,26 @@ class ze {
             return _();
           break;
         case 17:
-          if (!Ze(h))
-            return v();
+          if (!Ve(h))
+            return T();
           break;
         case 20:
-          return h === ":" ? _(i.Global) : v();
+          return h === ":" ? _(i.Global) : T();
         case 5:
           if (h === "*")
             x = 3;
           else if (h === "/")
             x = 2, c = i.EolComment;
-          else return h === "=" ? _(i.DivideAssignment) : v();
+          else return h === "=" ? _(i.DivideAssignment) : T();
           break;
         case 51:
-          return h === "+" ? _(i.IncOp) : h === "=" ? _(i.AddAssignment) : v();
+          return h === "+" ? _(i.IncOp) : h === "=" ? _(i.AddAssignment) : T();
         case 52:
-          return h === "-" ? _(i.DecOp) : h === "=" ? _(i.SubtractAssignment) : v();
+          return h === "-" ? _(i.DecOp) : h === "=" ? _(i.SubtractAssignment) : T();
         case 54:
-          return h === "=" ? _(i.RemainderAssignment) : v();
+          return h === "=" ? _(i.RemainderAssignment) : T();
         case 58:
-          return h === "=" ? _(i.BitwiseXorAssignment) : v();
+          return h === "=" ? _(i.BitwiseXorAssignment) : T();
         case 7:
           if (h === "=")
             return _(i.BitwiseOrAssignment);
@@ -259,9 +259,9 @@ class ze {
             x = 59, c = i.LogicalOr;
             break;
           }
-          return v();
+          return T();
         case 59:
-          return h === "=" ? _(i.LogicalOrAssignment) : v();
+          return h === "=" ? _(i.LogicalOrAssignment) : T();
         case 9:
           if (h === "=")
             return _(i.BitwiseAndAssignment);
@@ -269,26 +269,26 @@ class ze {
             x = 57, c = i.LogicalAnd;
             break;
           }
-          return v();
+          return T();
         case 57:
-          return h === "=" ? _(i.LogicalAndAssignment) : v();
+          return h === "=" ? _(i.LogicalAndAssignment) : T();
         case 8:
           if (h === "*") {
             x = 50, c = i.Exponent;
             break;
           } else if (h === "=")
             return _(i.MultiplyAssignment);
-          return v();
+          return T();
         case 50:
-          return h === "=" ? _(i.ExponentAssignment) : v();
+          return h === "=" ? _(i.ExponentAssignment) : T();
         case 22:
           if (h === "?") {
             x = 60, c = i.NullCoalesce;
             break;
           }
-          return h === "." ? _(i.OptionalChaining) : v();
+          return h === "." ? _(i.OptionalChaining) : T();
         case 60:
-          return h === "=" ? _(i.NullCoalesceAssignment) : v();
+          return h === "=" ? _(i.NullCoalesceAssignment) : T();
         case 10:
           if (h === ">")
             return _(i.Arrow);
@@ -296,17 +296,17 @@ class ze {
             x = 11, c = i.Equal;
             break;
           }
-          return v();
+          return T();
         case 11:
-          return h === "=" ? _(i.StrictEqual) : v();
+          return h === "=" ? _(i.StrictEqual) : T();
         case 13:
           if (h === "=") {
             x = 12, c = i.NotEqual;
             break;
           }
-          return v();
+          return T();
         case 12:
-          return h === "=" ? _(i.StrictNotEqual) : v();
+          return h === "=" ? _(i.StrictNotEqual) : T();
         case 14:
           if (h === "=")
             return _(i.LessThanOrEqual);
@@ -314,9 +314,9 @@ class ze {
             x = 55, c = i.ShiftLeft;
             break;
           }
-          return v();
+          return T();
         case 55:
-          return h === "=" ? _(i.ShiftLeftAssignment) : v();
+          return h === "=" ? _(i.ShiftLeftAssignment) : T();
         case 15:
           if (h === "=")
             return _(i.GreaterThanOrEqual);
@@ -324,114 +324,114 @@ class ze {
             x = 16, c = i.SignedShiftRight;
             break;
           }
-          return v();
+          return T();
         case 16:
           if (h === ">") {
             x = 56, c = i.ShiftRight;
             break;
           }
-          return h === "=" ? _(i.SignedShiftRightAssignment) : v();
+          return h === "=" ? _(i.SignedShiftRightAssignment) : T();
         case 56:
-          return h === "=" ? _(i.ShiftRightAssignment) : v();
+          return h === "=" ? _(i.ShiftRightAssignment) : T();
         case 21:
           if (h === "x")
             x = 23, c = i.Unknown;
           else if (h === "b")
             x = 25, c = i.Unknown;
-          else if (V(h) || h === "_")
+          else if (ee(h) || h === "_")
             x = 27;
           else if (h === ".")
             x = 28, c = i.Unknown;
           else if (h === "e" || h === "E")
             x = 30, c = i.Unknown;
           else
-            return v();
+            return T();
           break;
         case 18:
           if (h === ".") {
             x = 19, c = i.Unknown;
             break;
           }
-          if (!V(h))
-            return v();
+          if (!ee(h))
+            return T();
           x = 29, c = i.RealLiteral;
           break;
         case 19:
-          return h === "." ? _(i.Spread) : v();
+          return h === "." ? _(i.Spread) : T();
         case 23:
           if (h === "_")
             break;
-          if (!z(h))
-            return v();
+          if (!H(h))
+            return T();
           x = 24, c = i.HexadecimalLiteral;
           break;
         case 24:
-          if (!z(h) && h !== "_")
-            return v();
+          if (!H(h) && h !== "_")
+            return T();
           break;
         case 25:
           if (h === "_")
             break;
-          if (!Je(h))
-            return v();
+          if (!en(h))
+            return T();
           x = 26, c = i.BinaryLiteral;
           break;
         case 26:
-          if (!Je(h) && h !== "_")
-            return v();
+          if (!en(h) && h !== "_")
+            return T();
           c = i.BinaryLiteral;
           break;
         case 27:
-          if (V(h) || h === "_")
+          if (ee(h) || h === "_")
             break;
-          if (h === "." && (this.input.peek() === null || V(this.input.peek())))
+          if (h === "." && (this.input.peek() === null || ee(this.input.peek())))
             x = 28, c = i.Unknown;
           else if (h === "e" || h === "E")
             x = 30, c = i.Unknown;
           else
-            return v();
+            return T();
           break;
         case 28:
-          if (V(h))
+          if (ee(h))
             x = 29, c = i.RealLiteral;
           else if (h === "e" || h === "E")
             x = 30;
           else
-            return v();
+            return T();
           break;
         case 29:
           if (h === "e" || h === "E")
             x = 30, c = i.Unknown;
-          else if (!V(h) && h !== "_")
-            return v();
+          else if (!ee(h) && h !== "_")
+            return T();
           break;
         case 30:
           if (h === "+" || h === "-")
             x = 31;
-          else if (V(h))
+          else if (ee(h))
             x = 32, c = i.RealLiteral;
           else
-            return v();
+            return T();
           break;
         case 31:
-          if (V(h))
+          if (ee(h))
             x = 32, c = i.RealLiteral;
           else
-            return v();
+            return T();
           break;
         case 32:
-          if (!V(h))
-            return v();
+          if (!ee(h))
+            return T();
           break;
         case 6:
           if (h === "{")
             return _(i.DollarLBrace);
-          x = 17, F = !0, c = i.Identifier, Ze(h) || v();
+          x = 17, F = !0, c = i.Identifier, Ve(h) || T();
           break;
         case 33: {
           x = 34;
-          const U = this.input.ahead(0), J = this.input.ahead(1);
-          if (U === "`" || U === "$" && J === "{")
+          const q = this.input.ahead(0), $ = this.input.ahead(1);
+          if (q === "`" || q === "$" && $ === "{")
             return _(i.StringLiteral);
           break;
         }
@@ -444,16 +444,16 @@ class ze {
               return _(i.Backtick);
             case "$":
               if (this.input.ahead(0) === "{")
-                return H(), this.fetchNextChar(), _(i.DollarLBrace);
+                return Q(), this.fetchNextChar(), _(i.DollarLBrace);
           }
-          const $ = this.input.ahead(0), m = this.input.ahead(1);
-          if ($ === "`" || $ === "$" && m === "{")
+          const G = this.input.ahead(0), S = this.input.ahead(1);
+          if (G === "`" || G === "$" && S === "{")
             return _(i.StringLiteral);
           break;
         case 35:
           if (h === s)
             return _(i.StringLiteral);
-          if (Pn(h))
+          if (Mn(h))
             return _(i.Unknown);
           h === "\\" && (x = 36, c = i.Unknown);
           break;
@@ -485,13 +485,13 @@ class ze {
           }
           break;
         case 37:
-          if (z(h))
+          if (H(h))
             x = 38;
           else
             return _(i.Unknown);
           break;
         case 38:
-          if (z(h))
+          if (H(h))
             x = 35;
           else
             return _(i.Unknown);
@@ -501,31 +501,31 @@ class ze {
             x = 43;
             break;
           }
-          if (z(h))
+          if (H(h))
             x = 40;
           else
             return _(i.Unknown);
           break;
         case 40:
-          if (z(h))
+          if (H(h))
             x = 41;
           else
             return _(i.Unknown);
           break;
         case 41:
-          if (z(h))
+          if (H(h))
             x = 42;
           else
             return _(i.Unknown);
           break;
         case 42:
-          if (z(h))
+          if (H(h))
             x = 35;
           else
             return _(i.Unknown);
           break;
         case 43:
-          if (z(h))
+          if (H(h))
             x = 44;
           else
             return _(i.Unknown);
@@ -533,7 +533,7 @@ class ze {
         case 44:
           if (h === "}")
             x = 35;
-          else if (z(h))
+          else if (H(h))
             x = 45;
           else
             return _(i.Unknown);
@@ -541,7 +541,7 @@ class ze {
         case 45:
           if (h === "}")
             x = 35;
-          else if (z(h))
+          else if (H(h))
             x = 46;
           else
             return _(i.Unknown);
@@ -549,7 +549,7 @@ class ze {
         case 46:
           if (h === "}")
             x = 35;
-          else if (z(h))
+          else if (H(h))
             x = 47;
           else
             return _(i.Unknown);
@@ -557,7 +557,7 @@ class ze {
         case 47:
           if (h === "}")
             x = 35;
-          else if (z(h))
+          else if (H(h))
             x = 48;
           else
             return _(i.Unknown);
@@ -565,7 +565,7 @@ class ze {
         case 48:
           if (h === "}")
             x = 35;
-          else if (z(h))
+          else if (H(h))
             x = 49;
           else
             return _(i.Unknown);
@@ -577,27 +577,27 @@ class ze {
             return _(i.Unknown);
           break;
         default:
-          return v();
+          return T();
       }
-      H();
+      Q();
     }
-    function H() {
-      o += h, n._prefetched = null, n._prefetchedPos = null, n._prefetchedColumn = null, R = r.position, T = r.position;
+    function Q() {
+      o += h, n._prefetched = null, n._prefetchedPos = null, n._prefetchedColumn = null, b = r.position, w = r.position;
     }
-    function v() {
-      return F && (c = y.get(o) ?? (Ye(o[0]) && o[o.length - 1] !== "'" ? i.Identifier : i.Unknown)), {
+    function T() {
+      return F && (c = W.get(o) ?? (je(o[0]) && o[o.length - 1] !== "'" ? i.Identifier : i.Unknown)), {
         text: o,
         type: c,
         startPosition: t,
-        endPosition: R,
+        endPosition: b,
         startLine: l,
         endLine: l,
         startColumn: a,
-        endColumn: T
+        endColumn: w
       };
     }
-    function _($) {
-      return H(), $ !== void 0 && (c = $), v();
+    function _(G) {
+      return Q(), G !== void 0 && (c = G), T();
     }
   }
   getStartingPhaseThenReset() {
@@ -613,7 +613,7 @@ class ze {
   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 = Ye(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, {
@@ -634,7 +634,7 @@ class ze {
         };
       const a = r.substring(0, l);
       try {
-        const s = Xe(a), o = s.raw;
+        const s = Ye(a), o = s.raw;
         for (let c = 1; c < o.length; c++)
           this.fetchNextChar(), this._prefetched = null, this._prefetchedPos = null, this._prefetchedColumn = null;
         return this._ahead.length = 0, {
@@ -652,69 +652,69 @@ class ze {
     }
   }
 }
-const y = /* @__PURE__ */ new Map();
-y.set("typeof", i.Typeof);
-y.set("Infinity", i.Infinity);
-y.set("NaN", i.NaN);
-y.set("true", i.True);
-y.set("false", i.False);
-y.set("undefined", i.Undefined);
-y.set("null", i.Null);
-y.set("in", i.In);
-y.set("let", i.Let);
-y.set("const", i.Const);
-y.set("var", i.Var);
-y.set("if", i.If);
-y.set("else", i.Else);
-y.set("return", i.Return);
-y.set("break", i.Break);
-y.set("continue", i.Continue);
-y.set("do", i.Do);
-y.set("while", i.While);
-y.set("for", i.For);
-y.set("of", i.Of);
-y.set("try", i.Try);
-y.set("catch", i.Catch);
-y.set("finally", i.Finally);
-y.set("throw", i.Throw);
-y.set("switch", i.Switch);
-y.set("case", i.Case);
-y.set("default", i.Default);
-y.set("delete", i.Delete);
-y.set("function", i.Function);
-y.set("as", i.As);
-y.set("from", i.From);
-function Qe(e) {
+const W = /* @__PURE__ */ new Map();
+W.set("typeof", i.Typeof);
+W.set("Infinity", i.Infinity);
+W.set("NaN", i.NaN);
+W.set("true", i.True);
+W.set("false", i.False);
+W.set("undefined", i.Undefined);
+W.set("null", i.Null);
+W.set("in", i.In);
+W.set("let", i.Let);
+W.set("const", i.Const);
+W.set("var", i.Var);
+W.set("if", i.If);
+W.set("else", i.Else);
+W.set("return", i.Return);
+W.set("break", i.Break);
+W.set("continue", i.Continue);
+W.set("do", i.Do);
+W.set("while", i.While);
+W.set("for", i.For);
+W.set("of", i.Of);
+W.set("try", i.Try);
+W.set("catch", i.Catch);
+W.set("finally", i.Finally);
+W.set("throw", i.Throw);
+W.set("switch", i.Switch);
+W.set("case", i.Case);
+W.set("default", i.Default);
+W.set("delete", i.Delete);
+W.set("function", i.Function);
+W.set("as", i.As);
+W.set("from", i.From);
+function Ke(e) {
   return e.type === i.Eof;
 }
-function He(e) {
+function Ce(e) {
   return e.type <= i.Ws;
 }
-function Ye(e) {
+function je(e) {
   return e >= "a" && e <= "z" || e >= "A" && e <= "Z" || e === "_" || e === "$";
 }
-function Ze(e) {
+function Ve(e) {
   return e >= "a" && e <= "z" || e >= "A" && e <= "Z" || e >= "0" && e <= "9" || e === "_" || e === "$";
 }
-function Je(e) {
+function en(e) {
   return e === "0" || e === "1";
 }
-function V(e) {
+function ee(e) {
   return e >= "0" && e <= "9";
 }
-function z(e) {
+function H(e) {
   return e >= "0" && e <= "9" || e >= "A" && e <= "F" || e >= "a" && e <= "f";
 }
-function Pn(e) {
+function Mn(e) {
   return e === "\r" || e === `
 ` || e === "…" || e === "\u2028" || e === "\u2029";
 }
-let yn = class Rn extends Error {
+let qn = class yn extends Error {
   constructor(n, r) {
-    super(n), this.code = r, Object.setPrototypeOf(this, Rn.prototype);
+    super(n), this.code = r, Object.setPrototypeOf(this, yn.prototype);
   }
 };
-const Ie = {
+const Re = {
   W001: "An expression expected",
   W002: "Unexpected token: {0}",
   W003: "An identifier expected",
@@ -746,7 +746,7 @@ const Ie = {
   W029: "An imported module can contain only exported functions",
   W030: "Nested declarations cannot be exported",
   W031: "An identifier in a declaration cannot start with '$'"
-}, ue = {
+}, he = {
   [i.Eof]: {},
   [i.Ws]: {},
   [i.DollarLBrace]: {},
@@ -850,24 +850,24 @@ const Ie = {
   [i.As]: { keywordLike: !0 },
   [i.From]: { keywordLike: !0 }
 };
-let Un = 0;
-function Le() {
-  return ++Un;
+let $n = 0;
+function ve() {
+  return ++$n;
 }
-class Fe {
+class Ge {
   /**
    * Initializes the parser with the specified source code
    * @param source Source code to parse
    */
   constructor(n) {
-    this._parseErrors = [], this._statementLevel = 0, this._lexer = new ze(new Ge(n ?? ""));
+    this._parseErrors = [], this._statementLevel = 0, this._lexer = new Je(new Ze(n ?? ""));
   }
   /**
    * Sets the source code to parse
    * @param source Source code to parse
    */
   setSource(n) {
-    this._lexer = new ze(new Ge(n));
+    this._lexer = new Je(new Ze(n));
   }
   /**
    * The errors raised during the parse phase
@@ -915,7 +915,7 @@ class Fe {
     for (; !this.isEof; ) {
       const r = this.parseStatement();
       if (!r) return null;
-      n.push(r), r.type !== ke && this.skipToken(i.Semicolon);
+      n.push(r), r.type !== Ee && this.skipToken(i.Semicolon);
     }
     return n;
   }
@@ -947,14 +947,14 @@ class Fe {
           return this.parseReturnStatement();
         case i.Break:
           return this._lexer.get(), this.createStatementNode(
-            pn,
+            En,
             {},
             r,
             r
           );
         case i.Continue:
           return this._lexer.get(), this.createStatementNode(
-            dn,
+            mn,
             {},
             r,
             r
@@ -985,7 +985,7 @@ class Fe {
    */
   parseEmptyStatement() {
     const n = this._lexer.get();
-    return this.createStatementNode(ke, {}, n, n);
+    return this.createStatementNode(Ee, {}, n, n);
   }
   /**
    * Parses an expression statement
@@ -997,7 +997,7 @@ class Fe {
   parseExpressionStatement(n = !0) {
     const r = this._lexer.peek(), t = this.getExpression(n);
     return t ? this.createStatementNode(
-      on,
+      hn,
       {
         expr: t
       },
@@ -1050,7 +1050,7 @@ class Fe {
         return this.reportError("W009", s), null;
       if (t.push(
         this.createExpressionNode(
-          Ue,
+          Xe,
           a,
           l,
           r
@@ -1059,7 +1059,7 @@ class Fe {
       this._lexer.get();
     }
     return this.createStatementNode(
-      cn,
+      dn,
       {
         decls: t
       },
@@ -1108,7 +1108,7 @@ class Fe {
       if (s === null) return null;
       if (a.expr = s, r = s.endToken, t.push(
         this.createExpressionNode(
-          Ue,
+          Xe,
           a,
           l,
           r
@@ -1117,7 +1117,7 @@ class Fe {
       this._lexer.get();
     }
     return this.createStatementNode(
-      un,
+      pn,
       {
         decls: t
       },
@@ -1157,7 +1157,7 @@ class Fe {
       if (s === null) return null;
       if (a.expr = s, r = s.endToken, t.push(
         this.createExpressionNode(
-          bn,
+          Wn,
           a,
           l,
           r
@@ -1166,7 +1166,7 @@ class Fe {
       this._lexer.get();
     }
     return this.createStatementNode(
-      qe,
+      Qe,
       {
         decls: t
       },
@@ -1198,7 +1198,7 @@ class Fe {
       }
       l = this._lexer.peek(), (l.type === i.Comma || l.type === i.RBrace) && (n.push(
         this.createExpressionNode(
-          te,
+          ie,
           { id: a, alias: s, aDestr: o, oDestr: c },
           r,
           t
@@ -1226,7 +1226,7 @@ class Fe {
       if (l = this._lexer.peek(), l.type === i.Comma)
         n.push(
           this.createExpressionNode(
-            ee,
+            ne,
             { id: a, aDestr: s, oDestr: o },
             r,
             t
@@ -1235,7 +1235,7 @@ class Fe {
       else if (l.type === i.RSquare) {
         (a || s || o) && n.push(
           this.createExpressionNode(
-            ee,
+            ne,
             { id: a, aDestr: s, oDestr: o },
             r,
             t
@@ -1259,11 +1259,11 @@ class Fe {
     for (; this._lexer.peek().type !== i.RBrace; ) {
       const l = this.parseStatement();
       if (!l) return null;
-      r.push(l), l.type !== ke && this.skipToken(i.Semicolon);
+      r.push(l), l.type !== Ee && this.skipToken(i.Semicolon);
     }
     const t = this._lexer.get();
     return this.createStatementNode(
-      ve,
+      be,
       { stmts: r },
       n,
       t
@@ -1287,14 +1287,14 @@ class Fe {
     if (!l) return null;
     r = l.endToken;
     let a = !0;
-    l.type !== ve && (this._lexer.peek().type === i.Semicolon ? this._lexer.get() : a = !1);
+    l.type !== be && (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(
-      fn,
+      kn,
       {
         cond: t,
         thenB: l,
@@ -1319,7 +1319,7 @@ class Fe {
     this.expectToken(i.RParent, "W006");
     const t = this.parseStatement();
     return t ? this.createStatementNode(
-      kn,
+      xn,
       {
         cond: r,
         body: t
@@ -1338,12 +1338,12 @@ class Fe {
   parseDoWhileStatement() {
     const n = this._lexer.get(), r = this.parseStatement();
     if (!r) return null;
-    r.type !== ve && r.type !== ke && this.expectToken(i.Semicolon), this.expectToken(i.While), this.expectToken(i.LParent, "W014");
+    r.type !== be && r.type !== Ee && 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(
-      gn,
+      _n,
       {
         cond: t,
         body: r
@@ -1362,12 +1362,12 @@ class Fe {
   parseReturnStatement() {
     const n = this._lexer.peek();
     let r = this._lexer.get(), t;
-    if (ue[this._lexer.peek().type].expressionStart) {
+    if (he[this._lexer.peek().type].expressionStart) {
       if (t = this.getExpression(), t === null) return null;
       r = t.endToken;
     }
     return this.createStatementNode(
-      hn,
+      gn,
       {
         expr: t
       },
@@ -1387,26 +1387,26 @@ class Fe {
     let r = this._lexer.peek();
     if (r.type === i.Identifier) {
       if (this._lexer.ahead(1).type === i.In)
-        return this.parseForInOfStatement(n, "none", r, ge);
+        return this.parseForInOfStatement(n, "none", r, me);
       if (this._lexer.ahead(1).type === i.Of)
-        return this.parseForInOfStatement(n, "none", r, _e);
+        return this.parseForInOfStatement(n, "none", r, Ne);
     } else if (r.type === i.Let) {
       const o = this._lexer.ahead(1);
       if (o.type === i.Identifier) {
         const c = this._lexer.ahead(2);
         if (c.type === i.In)
-          return this.parseForInOfStatement(n, "let", o, ge);
+          return this.parseForInOfStatement(n, "let", o, me);
         if (c.type === i.Of)
-          return this.parseForInOfStatement(n, "let", o, _e);
+          return this.parseForInOfStatement(n, "let", o, Ne);
       }
     } else if (r.type === i.Const) {
       const o = this._lexer.ahead(1);
       if (o.type === i.Identifier) {
         const c = this._lexer.ahead(2);
         if (c.type === i.In)
-          return this.parseForInOfStatement(n, "const", o, ge);
+          return this.parseForInOfStatement(n, "const", o, me);
         if (c.type === i.Of)
-          return this.parseForInOfStatement(n, "const", o, _e);
+          return this.parseForInOfStatement(n, "const", o, Ne);
       }
     }
     let t;
@@ -1419,7 +1419,7 @@ class Fe {
       if (t = o, t.decls.some((c) => !c.expr))
         return this.reportError("W011"), null;
       this.expectToken(i.Semicolon);
-    } else if (ue[r.type].expressionStart) {
+    } else if (he[r.type].expressionStart) {
       const o = this.parseExpressionStatement();
       if (o === null)
         return null;
@@ -1439,7 +1439,7 @@ class Fe {
     this.expectToken(i.RParent, "W006");
     const s = this.parseStatement();
     return s ? this.createStatementNode(
-      En,
+      Sn,
       {
         init: t,
         cond: l,
@@ -1471,8 +1471,8 @@ class Fe {
     const a = this.getExpression(!0);
     this.expectToken(i.RParent, "W006");
     const s = this.parseStatement();
-    return s ? l === ge ? this.createStatementNode(
-      ge,
+    return s ? l === me ? this.createStatementNode(
+      me,
       {
         varB: r,
         id: {
@@ -1487,7 +1487,7 @@ class Fe {
       n,
       s.endToken
     ) : this.createStatementNode(
-      _e,
+      Ne,
       {
         varB: r,
         id: {
@@ -1515,7 +1515,7 @@ class Fe {
     this._lexer.get();
     let r;
     return r = this.getExpression(), r === null ? null : this.createStatementNode(
-      xn,
+      Nn,
       {
         expr: r
       },
@@ -1541,7 +1541,7 @@ class Fe {
   parseTryStatement() {
     const n = this._lexer.peek();
     let r = this._lexer.get();
-    const t = this, l = R();
+    const t = this, l = b();
     let a, s, o, c = this._lexer.peek();
     if (c.type === i.Catch) {
       if (this._lexer.get(), c = this._lexer.peek(), c.type === i.LParent) {
@@ -1549,19 +1549,19 @@ class Fe {
           return this.reportError("W003", c), null;
         s = {
           type: M,
-          nodeId: Le(),
+          nodeId: ve(),
           name: c.text,
           startToken: c,
           endToken: c
         }, this._lexer.get(), this.expectToken(i.RParent, "W006");
       }
-      a = R(), r = a.endToken, this._lexer.peek().type === i.Finally && (this._lexer.get(), o = R(), r = o.endToken);
+      a = b(), r = a.endToken, this._lexer.peek().type === i.Finally && (this._lexer.get(), o = b(), r = o.endToken);
     } else if (c.type === i.Finally)
-      this._lexer.get(), o = R(), r = o.endToken;
+      this._lexer.get(), o = b(), r = o.endToken;
     else
       return this.reportError("W013", c), null;
     return this.createStatementNode(
-      mn,
+      An,
       {
         tryB: l,
         catchB: a,
@@ -1571,9 +1571,9 @@ class Fe {
       n,
       r
     );
-    function R() {
-      const T = t._lexer.peek();
-      return T.type !== i.LBrace ? (t.reportError("W012", T), null) : t.parseBlockStatement();
+    function b() {
+      const w = t._lexer.peek();
+      return w.type !== i.LBrace ? (t.reportError("W012", w), null) : t.parseBlockStatement();
     }
   }
   /**
@@ -1610,25 +1610,25 @@ class Fe {
         return this.reportError("W015"), null;
       }
       this.expectToken(i.Colon, "W008");
-      let c = [], R = !1;
-      for (; !R; )
+      let c = [], b = !1;
+      for (; !b; )
         switch (this._lexer.peek().type) {
           case i.Case:
           case i.Default:
           case i.RBrace:
-            R = !0;
+            b = !0;
             break;
           default:
             const h = this.parseStatement();
             if (h === null) {
-              R = !0;
+              b = !0;
               break;
             }
-            c.push(h), h.type !== ke && this.skipToken(i.Semicolon);
+            c.push(h), h.type !== Ee && this.skipToken(i.Semicolon);
         }
       t.push(
         this.createNode(
-          Dn,
+          Pn,
           {
             caseE: o,
             stmts: c
@@ -1639,7 +1639,7 @@ class Fe {
     }
     const a = this._lexer.peek();
     return this.expectToken(i.RBrace, "W004"), this.createStatementNode(
-      _n,
+      Ln,
       {
         expr: r,
         cases: t
@@ -1677,18 +1677,18 @@ class Fe {
     let o;
     const c = [];
     switch (s.type) {
-      case Ee:
+      case xe:
         o = !0;
         break;
       case M:
         o = (s.parenthesized ?? 0) <= 1, c.push(s);
         break;
-      case le:
+      case ae:
         o = s.parenthesized === 1;
-        let T = !1;
+        let w = !1;
         if (o)
           for (const h of s.exprs) {
-            if (T) {
+            if (w) {
               o = !1;
               break;
             }
@@ -1696,22 +1696,22 @@ class Fe {
               case M:
                 o = !h.parenthesized, c.push(h);
                 break;
-              case ae: {
+              case ce: {
                 if (o = !h.parenthesized, o) {
                   const F = this.convertToObjectDestructure(h);
                   F && c.push(F);
                 }
                 break;
               }
-              case se: {
+              case oe: {
                 if (o = !h.parenthesized, o) {
                   const F = this.convertToArrayDestructure(h);
                   F && c.push(F);
                 }
                 break;
               }
-              case oe: {
-                if (T = !0, h.expr.type !== M) {
+              case ue: {
+                if (w = !0, h.expr.type !== M) {
                   o = !1;
                   break;
                 }
@@ -1724,19 +1724,19 @@ class Fe {
             }
           }
         break;
-      case ae:
+      case ce:
         if (o = s.parenthesized === 1, o) {
           const h = this.convertToObjectDestructure(s);
           h && c.push(h);
         }
         break;
-      case se:
+      case oe:
         if (o = s.parenthesized === 1, o) {
           const h = this.convertToArrayDestructure(s);
           h && c.push(h);
         }
         break;
-      case oe:
+      case ue:
         if (s.expr.type !== M) {
           o = !1;
           break;
@@ -1750,16 +1750,16 @@ class Fe {
       return this.reportError("W010", r), null;
     if (this._lexer.peek().type !== i.LBrace)
       return this.reportError("W012", this._lexer.peek()), null;
-    const R = this.parseBlockStatement();
-    return R ? this.createStatementNode(
-      De,
+    const b = this.parseBlockStatement();
+    return b ? this.createStatementNode(
+      We,
       {
         id: { type: M, name: t },
         args: c,
-        stmt: R
+        stmt: b
       },
       r,
-      R.endToken
+      b.endToken
     ) : null;
   }
   // ==========================================================================
@@ -1790,7 +1790,7 @@ class Fe {
       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(Ee, {}, r, r)
+            this.createExpressionNode(xe, {}, r, r)
           );
         else {
           const s = this.parseCondOrSpreadOrAsgnOrArrowExpr();
@@ -1799,7 +1799,7 @@ class Fe {
           r = s.endToken, l.push(s);
         }
     return l.length && (t = this.createExpressionNode(
-      le,
+      ae,
       {
         exprs: l,
         loose: a
@@ -1821,7 +1821,7 @@ class Fe {
       this._lexer.get();
       const l = this.parseNullCoalescingExpr();
       return l ? this.createExpressionNode(
-        oe,
+        ue,
         {
           expr: l
         },
@@ -1832,7 +1832,7 @@ class Fe {
     if (n.type === i.Function) {
       const l = this.parseFunctionDeclaration(!0);
       return l ? this.createExpressionNode(
-        be,
+        Be,
         {
           name: l.id.name,
           args: l.args,
@@ -1854,7 +1854,7 @@ class Fe {
       this.expectToken(i.Colon);
       const a = this.getExpression(!1);
       return this.createExpressionNode(
-        Nn,
+        Tn,
         {
           cond: r,
           thenE: l,
@@ -1864,11 +1864,11 @@ class Fe {
         a.endToken
       );
     }
-    if (ue[t.type].isAssignment) {
+    if (he[t.type].isAssignment) {
       this._lexer.get();
       const l = this.getExpression();
       return l ? this.createExpressionNode(
-        vn,
+        Dn,
         {
           leftValue: r,
           op: t.text,
@@ -1889,13 +1889,13 @@ class Fe {
     let t;
     const l = [];
     switch (r.type) {
-      case Ee:
+      case xe:
         t = !0;
         break;
       case M:
         t = (r.parenthesized ?? 0) <= 1, l.push(r);
         break;
-      case le:
+      case ae:
         t = r.parenthesized === 1;
         let s = !1;
         if (t)
@@ -1908,21 +1908,21 @@ class Fe {
               case M:
                 t = !o.parenthesized, l.push(o);
                 break;
-              case ae: {
+              case ce: {
                 if (t = !o.parenthesized, t) {
                   const c = this.convertToObjectDestructure(o);
                   c && l.push(c);
                 }
                 break;
               }
-              case se: {
+              case oe: {
                 if (t = !o.parenthesized, t) {
                   const c = this.convertToArrayDestructure(o);
                   c && l.push(c);
                 }
                 break;
               }
-              case oe: {
+              case ue: {
                 if (s = !0, o.expr.type !== M) {
                   t = !1;
                   break;
@@ -1936,19 +1936,19 @@ class Fe {
             }
           }
         break;
-      case ae:
+      case ce:
         if (t = r.parenthesized === 1, t) {
           const o = this.convertToObjectDestructure(r);
           o && l.push(o);
         }
         break;
-      case se:
+      case oe:
         if (t = r.parenthesized === 1, t) {
           const o = this.convertToArrayDestructure(r);
           o && l.push(o);
         }
         break;
-      case oe:
+      case ue:
         t = r.expr.type === M, t && l.push(r);
         break;
       default:
@@ -1959,7 +1959,7 @@ class Fe {
     this._lexer.get();
     const a = this.parseStatement(!1);
     return a ? this.createExpressionNode(
-      be,
+      Be,
       {
         args: l,
         statement: a
@@ -1984,7 +1984,7 @@ class Fe {
         return this.reportError("W001"), null;
       let l = t.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: "??",
           left: r,
@@ -2012,7 +2012,7 @@ class Fe {
         return this.reportError("W001"), null;
       let l = t.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: "||",
           left: r,
@@ -2040,7 +2040,7 @@ class Fe {
         return this.reportError("W001"), null;
       let l = t.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: "&&",
           left: r,
@@ -2068,7 +2068,7 @@ class Fe {
         return this.reportError("W001"), null;
       let l = t.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: "|",
           left: r,
@@ -2096,7 +2096,7 @@ class Fe {
         return this.reportError("W001"), null;
       let l = t.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: "^",
           left: r,
@@ -2124,7 +2124,7 @@ class Fe {
         return this.reportError("W001"), null;
       let l = t.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: "&",
           left: r,
@@ -2158,7 +2158,7 @@ class Fe {
         return this.reportError("W001"), null;
       let a = l.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: t.text,
           left: r,
@@ -2193,7 +2193,7 @@ class Fe {
         return this.reportError("W001"), null;
       let a = l.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: t.text,
           left: r,
@@ -2226,7 +2226,7 @@ class Fe {
         return this.reportError("W001"), null;
       let a = l.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: t.text,
           left: r,
@@ -2255,7 +2255,7 @@ class Fe {
         return this.reportError("W001"), null;
       let a = l.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: t.text,
           left: r,
@@ -2284,7 +2284,7 @@ class Fe {
         return this.reportError("W001"), null;
       let a = l.endToken;
       r = this.createExpressionNode(
-        G,
+        z,
         {
           op: t.text,
           left: r,
@@ -2314,7 +2314,7 @@ class Fe {
       let s = a.endToken;
       if (l === 0)
         r = this.createExpressionNode(
-          G,
+          z,
           {
             op: t.text,
             left: r,
@@ -2326,12 +2326,12 @@ class Fe {
       else {
         const o = r;
         r = this.createExpressionNode(
-          G,
+          z,
           {
             op: t.text,
             left: o.left,
             right: {
-              type: G,
+              type: z,
               op: t.text,
               left: o.right,
               right: a
@@ -2353,11 +2353,11 @@ class Fe {
    */
   parseUnaryOrPrefixExpr() {
     const n = this._lexer.peek();
-    if (ue[n.type].canBeUnary) {
+    if (he[n.type].canBeUnary) {
       this._lexer.get();
       const r = this.parseUnaryOrPrefixExpr();
       return r ? this.createExpressionNode(
-        Sn,
+        wn,
         {
           op: n.text,
           expr: r
@@ -2370,7 +2370,7 @@ class Fe {
       this._lexer.get();
       const r = this.parseMemberOrInvocationExpr();
       return r ? this.createExpressionNode(
-        On,
+        Rn,
         {
           op: n.text,
           expr: r
@@ -2400,19 +2400,19 @@ class Fe {
       switch (a.type) {
         case i.LParent: {
           this._lexer.get();
-          let T = [];
+          let w = [];
           if (this._lexer.peek().type !== i.RParent) {
             const F = this.parseExpr();
             if (!F)
               return this.reportError("W001"), null;
-            T = F.type === le ? F.exprs : [F];
+            w = F.type === ae ? F.exprs : [F];
           }
           const h = this._lexer.peek();
           this.expectToken(i.RParent, "W006"), r = this.createExpressionNode(
-            An,
+            vn,
             {
               obj: r,
-              arguments: T
+              arguments: w
             },
             n,
             h
@@ -2423,10 +2423,10 @@ class Fe {
         case i.OptionalChaining:
           this._lexer.get();
           const s = this._lexer.get();
-          if (!ue[s.type].keywordLike)
+          if (!he[s.type].keywordLike)
             return this.reportError("W003"), null;
           r = this.createExpressionNode(
-            Ln,
+            On,
             {
               obj: r,
               member: s.text,
@@ -2441,15 +2441,15 @@ class Fe {
           const c = this.getExpression();
           if (!c)
             return null;
-          const R = this._lexer.peek();
+          const b = this._lexer.peek();
           this.expectToken(i.RSquare, "W005"), r = this.createExpressionNode(
-            wn,
+            In,
             {
               obj: r,
               member: c
             },
             n,
-            R
+            b
           );
           break;
         default:
@@ -2459,7 +2459,7 @@ class Fe {
     } while (!t);
     const l = this._lexer.peek();
     return l.type === i.IncOp || l.type === i.DecOp ? (this._lexer.get(), this.createExpressionNode(
-      In,
+      Bn,
       {
         op: l.text,
         expr: r
@@ -2484,7 +2484,7 @@ class Fe {
         if (this._lexer.get(), this._lexer.peek().type === i.RParent) {
           const l = this._lexer.get();
           return this.createExpressionNode(
-            Ee,
+            xe,
             {},
             n,
             l
@@ -2529,7 +2529,7 @@ class Fe {
       case i.False:
       case i.True:
         return this._lexer.get(), this.createExpressionNode(
-          Q,
+          Y,
           {
             value: n.type === i.True
           },
@@ -2548,7 +2548,7 @@ class Fe {
         return this._lexer.get(), this.parseStringLiteral(n);
       case i.Infinity:
         return this._lexer.get(), this.createExpressionNode(
-          Q,
+          Y,
           {
             value: 1 / 0
           },
@@ -2557,7 +2557,7 @@ class Fe {
         );
       case i.NaN:
         return this._lexer.get(), this.createExpressionNode(
-          Q,
+          Y,
           {
             value: NaN
           },
@@ -2566,7 +2566,7 @@ class Fe {
         );
       case i.Null:
         return this._lexer.get(), this.createExpressionNode(
-          Q,
+          Y,
           {
             value: null
           },
@@ -2575,7 +2575,7 @@ class Fe {
         );
       case i.Undefined:
         return this._lexer.get(), this.createExpressionNode(
-          Q,
+          Y,
           {
             value: void 0
           },
@@ -2616,7 +2616,7 @@ class Fe {
     }
     const t = this._lexer.get();
     return this.createExpressionNode(
-      Tn,
+      bn,
       { segments: r },
       n,
       t
@@ -2630,11 +2630,11 @@ class Fe {
     let r = [];
     if (this._lexer.peek().type !== i.RSquare) {
       const l = this.getExpression();
-      l && (r = l.type === le ? l.exprs : [l]);
+      l && (r = l.type === ae ? l.exprs : [l]);
     }
     const t = this._lexer.peek();
     return this.expectToken(i.RSquare), this.createExpressionNode(
-      se,
+      oe,
       {
         items: r
       },
@@ -2650,14 +2650,14 @@ class Fe {
     let r = [];
     if (this._lexer.peek().type !== i.RBrace)
       for (; this._lexer.peek().type !== i.RBrace; ) {
-        const l = this._lexer.peek(), a = ue[l.type];
+        const l = this._lexer.peek(), a = he[l.type];
         let s;
         if (a.expressionStart)
           if (l.type === i.LSquare) {
             if (this._lexer.get(), s = this.getExpression(), !s)
               return null;
             this.expectToken(i.RSquare, "W005"), s = this.createExpressionNode(
-              le,
+              ae,
               {
                 exprs: [s]
               },
@@ -2666,14 +2666,14 @@ class Fe {
           } else if (a.isPropLiteral) {
             if (s = this.getExpression(!1), !s)
               return null;
-            if (s.type !== M && s.type !== Q && s.type !== oe)
+            if (s.type !== M && s.type !== Y && s.type !== ue)
               return this.reportError("W007"), null;
           } else
             return this.reportError("W007"), null;
         else if (a.keywordLike)
           s = {
             type: M,
-            nodeId: Le(),
+            nodeId: ve(),
             name: l.text,
             startToken: l,
             endToken: l
@@ -2681,22 +2681,22 @@ class Fe {
         else
           return this.reportError("W001"), null;
         const o = s.type;
-        if (o === oe)
+        if (o === ue)
           r.push(s);
         else {
-          if (o === Q) {
-            const T = s.value;
-            if (typeof T != "number" && typeof T != "string")
+          if (o === Y) {
+            const w = s.value;
+            if (typeof w != "number" && typeof w != "string")
               return this.expectToken(i.RBrace, "W007"), null;
           }
-          let R = null;
+          let b = null;
           if (o === M) {
-            const T = this._lexer.peek();
-            (T.type === i.Comma || T.type === i.RBrace) && (R = { ...s });
+            const w = this._lexer.peek();
+            (w.type === i.Comma || w.type === i.RBrace) && (b = { ...s });
           }
-          if (!R && (this.expectToken(i.Colon, "W008"), R = this.getExpression(!1), !R))
+          if (!b && (this.expectToken(i.Colon, "W008"), b = this.getExpression(!1), !b))
             return null;
-          r.push([s, R]);
+          r.push([s, b]);
         }
         const c = this._lexer.peek().type;
         if (c === i.Comma)
@@ -2706,7 +2706,7 @@ class Fe {
       }
     const t = this._lexer.peek();
     return this.expectToken(i.RBrace, "W004"), this.createExpressionNode(
-      ae,
+      ce,
       {
         props: r
       },
@@ -2717,7 +2717,7 @@ class Fe {
   parseRegExpLiteral() {
     const n = this._lexer.peek(), r = this._lexer.getRegEx();
     return r.success ? this.createExpressionNode(
-      Q,
+      Y,
       {
         value: new RegExp(r.pattern, r.flags)
       },
@@ -2770,7 +2770,7 @@ class Fe {
    * @param options Error message options
    */
   reportError(n, r, ...t) {
-    let l = Ie[n] ?? "Unkonwn error";
+    let l = Re[n] ?? "Unkonwn error";
     throw t && t.forEach(
       (s, o) => l = a(l, `{${o}}`, t[o].toString())
     ), r || (r = this._lexer.peek()), this._parseErrors.push({
@@ -2778,7 +2778,7 @@ class Fe {
       text: l,
       line: r.startLine,
       column: r.startColumn
-    }), new yn(l, n);
+    }), new qn(l, n);
     function a(s, o, c) {
       do
         s = s.replace(o, c);
@@ -2812,7 +2812,7 @@ class Fe {
   createExpressionNode(n, r = {}, t, l) {
     return l || (l = this._lexer.peek()), t || (t = l), Object.assign({}, r, {
       type: n,
-      nodeId: Le(),
+      nodeId: ve(),
       startToken: t,
       endToken: l
     });
@@ -2827,7 +2827,7 @@ class Fe {
   createStatementNode(n, r, t, l) {
     return Object.assign({}, r, {
       type: n,
-      nodeId: Le(),
+      nodeId: ve(),
       startToken: t,
       endToken: l
     });
@@ -2840,7 +2840,7 @@ class Fe {
     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(
-      Q,
+      Y,
       {
         value: r
       },
@@ -2856,7 +2856,7 @@ class Fe {
     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(
-      Q,
+      Y,
       {
         value: r
       },
@@ -2872,7 +2872,7 @@ class Fe {
     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(
-      Q,
+      Y,
       {
         value: r
       },
@@ -2887,7 +2887,7 @@ class Fe {
   parseRealLiteral(n) {
     let r = parseFloat(n.text.replace(/[_']/g, ""));
     return this.createExpressionNode(
-      Q,
+      Y,
       {
         value: r
       },
@@ -3011,7 +3011,7 @@ class Fe {
         break;
     }
     return this.createExpressionNode(
-      Q,
+      Y,
       {
         value: l
       },
@@ -3024,8 +3024,8 @@ class Fe {
   }
   convertToArrayDestructure(n) {
     var l;
-    const r = n.type === le ? n.exprs : n.items, t = this.createExpressionNode(
-      Oe,
+    const r = n.type === ae ? n.exprs : n.items, t = this.createExpressionNode(
+      De,
       { aDestr: [] },
       n.startToken,
       n.endToken
@@ -3033,9 +3033,9 @@ class Fe {
     for (const a of r) {
       let s;
       switch (a.type) {
-        case Ee:
+        case xe:
           s = this.createExpressionNode(
-            ee,
+            ne,
             {},
             a.startToken,
             a.endToken
@@ -3043,22 +3043,22 @@ class Fe {
           break;
         case M:
           s = this.createExpressionNode(
-            ee,
+            ne,
             { id: a.name },
             a.startToken,
             a.endToken
           );
           break;
-        case Oe:
+        case De:
           t.aDestr.push(...a.aDestr);
           break;
-        case ee:
+        case ne:
           s = a;
           break;
-        case se: {
+        case oe: {
           const o = this.convertToArrayDestructure(a);
           o && (s = this.createExpressionNode(
-            ee,
+            ne,
             {
               aDestr: o.aDestr
             },
@@ -3067,9 +3067,9 @@ class Fe {
           ));
           break;
         }
-        case te:
+        case ie:
           s = this.createExpressionNode(
-            ee,
+            ne,
             {
               oDestr: a
             },
@@ -3077,10 +3077,10 @@ class Fe {
             a.endToken
           );
           break;
-        case ae: {
+        case ce: {
           const o = this.convertToObjectDestructure(a);
           o && (s = this.createExpressionNode(
-            ee,
+            ne,
             {
               oDestr: o.oDestr
             },
@@ -3099,7 +3099,7 @@ class Fe {
   convertToObjectDestructure(n) {
     var t;
     const r = this.createExpressionNode(
-      Oe,
+      De,
       { oDestr: [] },
       n.startToken,
       n.endToken
@@ -3113,12 +3113,12 @@ class Fe {
       switch (s.type) {
         case M:
           s.name === a.name ? o = this.createExpressionNode(
-            te,
+            ie,
             { id: a.name },
             s.startToken,
             s.endToken
           ) : o = this.createExpressionNode(
-            te,
+            ie,
             {
               id: a.name,
               alias: s.name
@@ -3127,9 +3127,9 @@ class Fe {
             s.endToken
           );
           break;
-        case ee: {
+        case ne: {
           o = this.createExpressionNode(
-            te,
+            ie,
             {
               id: a.name,
               aDestr: s
@@ -3139,10 +3139,10 @@ class Fe {
           );
           break;
         }
-        case se: {
+        case oe: {
           const c = this.convertToArrayDestructure(s);
           c && (o = this.createExpressionNode(
-            te,
+            ie,
             {
               id: a.name,
               aDestr: c.aDestr
@@ -3152,13 +3152,13 @@ class Fe {
           ));
           break;
         }
-        case te:
+        case ie:
           o = s;
           break;
-        case ae: {
+        case ce: {
           const c = this.convertToObjectDestructure(s);
           c && (o = this.createExpressionNode(
-            te,
+            ie,
             {
               id: a.name,
               oDestr: c.oDestr
@@ -3180,75 +3180,79 @@ class Fe {
    */
   isExpressionStart(n) {
     var r;
-    return ((r = ue[n.type]) == null ? void 0 : r.expressionStart) ?? !1;
+    return ((r = he[n.type]) == null ? void 0 : r.expressionStart) ?? !1;
   }
 }
-var p = /* @__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))(p || {}), xe = /* @__PURE__ */ ((e) => (e[e.Error = 1] = "Error", e[e.Warning = 2] = "Warning", e[e.Information = 3] = "Information", e[e.Hint = 4] = "Hint", e))(xe || {}), fe = /* @__PURE__ */ ((e) => (e.onlyOneElem = "U002", e.expTagOpen = "U003", e.expTagIdent = "U004", e.expCloseStart = "U005", e.expEndOrClose = "U006", e.tagNameMismatch = "U007", e.expEnd = "U008", e.expAttrIdent = "U009", e.expEq = "U010", e.expAttrValue = "U011", e.duplAttr = "U012", e.uppercaseAttr = "U013", e.invalidChar = "W001", e.untermStr = "W002", e.untermComment = "W007", e.untermCData = "W008", e.untermScript = "W009", e))(fe || {});
-function Nr(e, n = !0) {
-  const r = xe[e.category];
+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 || {}), _e = /* @__PURE__ */ ((e) => (e[e.Error = 1] = "Error", e[e.Warning = 2] = "Warning", e[e.Information = 3] = "Information", e[e.Hint = 4] = "Hint", e))(_e || {}), de = /* @__PURE__ */ ((e) => (e.onlyOneElem = "U002", e.expTagOpen = "U003", e.expTagName = "U004", e.expCloseStart = "U005", e.expEndOrClose = "U006", e.tagNameMismatch = "U007", e.expEnd = "U008", e.expAttrIdent = "U009", e.expEq = "U010", e.expAttrValue = "U011", e.duplAttr = "U012", e.uppercaseAttr = "U013", e.tagNameExpAfterNamespace = "U014", e.invalidChar = "W001", e.untermStr = "W002", e.untermComment = "W007", e.untermCData = "W008", e.untermScript = "W009", e))(de || {});
+function wr(e, n = !0) {
+  const r = _e[e.category];
   return n ? r.toLowerCase() : r;
 }
-const Be = {
+const ye = {
   code: "W001",
   category: 1,
   message: "Invalid character."
-}, Fn = {
+}, Xn = {
   code: "W002",
   category: 1,
   message: "Unterminated string literal."
-}, Mn = {
+}, Gn = {
   code: "W007",
   category: 1,
   message: "Unterminated comment"
-}, qn = {
+}, zn = {
   code: "W008",
   category: 1,
   message: "Unterminated CDATA section"
-}, $n = {
+}, Qn = {
   code: "W009",
   category: 1,
   message: "Unterminated script section"
-}, Xn = {
+}, Hn = {
   category: 1,
   code: "U008",
   message: "A '>' token expected."
-}, Gn = {
+}, Yn = {
   category: 1,
   code: "U005",
   message: "A '</' token expected."
-}, Ke = {
+}, Ue = {
   category: 1,
   code: "U004",
-  message: "A tag identifier expected."
-}, zn = {
+  message: "A tag name expected."
+}, Zn = {
   category: 1,
   code: "U011",
   message: "An attribute value expected."
-}, Ar = {
+}, Tr = {
   category: 1,
   code: "U010",
   message: "An '=' token expected."
-}, Qn = {
+}, Jn = {
   category: 1,
   code: "U003",
   message: "A '<' token expected."
-}, Hn = {
+}, Fe = {
   category: 1,
   code: "U006",
   message: "A '>' or '/>' token expected."
-}, je = {
+}, nn = {
   category: 1,
   code: "U009",
   message: "An attribute identifier expected."
+}, vr = {
+  category: 1,
+  code: "U014",
+  message: "A tag name expected after a namespaces."
 };
 var u = /* @__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))(u || {});
-function Yn(e) {
+function Kn(e) {
   return e >= 2 && e <= 4;
 }
-function Zn(e) {
+function Cn(e) {
   return e >= 21 && e <= 27;
 }
-function Me(e) {
+function ze(e) {
   switch (e) {
     case 0:
       return "Unknown";
@@ -3307,252 +3311,252 @@ function Me(e) {
     case 23:
       return "AttributeKeyNode";
   }
-  return Jn();
+  return jn();
 }
-function Jn(e) {
+function jn(e) {
   throw new Error("Didn't expect to get here");
 }
-function Kn(e, n, r, t, l) {
-  let a = n ?? "", s, o, c, R, T, h;
-  return Y(a, t, l), {
+function Vn(e, n, r, t, l) {
+  let a = n ?? "", s, o, c, b, w, h;
+  return C(a, t, l), {
     getStartPos: () => c,
     getTokenEnd: () => s,
-    getToken: () => T,
-    getTokenStart: () => R,
-    getTokenText: () => a.substring(R, s),
+    getToken: () => w,
+    getTokenStart: () => b,
+    getTokenText: () => a.substring(b, s),
     getTokenValue: () => h,
-    isIdentifier: () => T === u.Identifier,
+    isIdentifier: () => w === u.Identifier,
     peekChar: F,
     scanChar: x,
-    scan: H,
-    scanTrivia: v,
+    scan: Q,
+    scanTrivia: T,
     scanText: _,
-    getText: $,
-    setText: Y,
-    setOnError: Z,
+    getText: G,
+    setText: C,
+    setOnError: fe,
     resetTokenState: X,
-    back: C
+    back: pe
   };
   function F(g) {
     if (s + (g ?? 0) >= o)
       return null;
-    const d = U(s + (g ?? 0));
-    return isNaN(d) ? null : d;
+    const p = q(s + (g ?? 0));
+    return isNaN(p) ? null : p;
   }
   function x() {
     if (s >= o)
       return null;
-    const g = U(s);
-    return s += ne(g), g;
+    const g = q(s);
+    return s += re(g), g;
   }
-  function H() {
+  function Q() {
     for (c = s; ; ) {
-      if (R = s, s >= o)
-        return T = u.EndOfFileToken;
-      const g = U(s);
+      if (b = s, s >= o)
+        return w = u.EndOfFileToken;
+      const g = q(s);
       switch (g) {
-        case p.lineFeed:
-        case p.carriageReturn:
+        case d.lineFeed:
+        case d.carriageReturn:
           if (e) {
             s++;
             continue;
           } else
-            return g === p.carriageReturn && s + 1 < o && m(s + 1) === p.lineFeed ? s += 2 : s++, T = u.NewLineTrivia;
-        case p.tab:
-        case p.verticalTab:
-        case p.formFeed:
-        case p.space:
-        case p.nonBreakingSpace:
-        case p.ogham:
-        case p.enQuad:
-        case p.emQuad:
-        case p.enSpace:
-        case p.emSpace:
-        case p.threePerEmSpace:
-        case p.fourPerEmSpace:
-        case p.sixPerEmSpace:
-        case p.figureSpace:
-        case p.punctuationSpace:
-        case p.thinSpace:
-        case p.hairSpace:
-        case p.zeroWidthSpace:
-        case p.narrowNoBreakSpace:
-        case p.mathematicalSpace:
-        case p.ideographicSpace:
-        case p.byteOrderMark:
+            return g === d.carriageReturn && s + 1 < o && S(s + 1) === d.lineFeed ? s += 2 : s++, w = u.NewLineTrivia;
+        case d.tab:
+        case d.verticalTab:
+        case d.formFeed:
+        case d.space:
+        case d.nonBreakingSpace:
+        case d.ogham:
+        case d.enQuad:
+        case d.emQuad:
+        case d.enSpace:
+        case d.emSpace:
+        case d.threePerEmSpace:
+        case d.fourPerEmSpace:
+        case d.sixPerEmSpace:
+        case d.figureSpace:
+        case d.punctuationSpace:
+        case d.thinSpace:
+        case d.hairSpace:
+        case d.zeroWidthSpace:
+        case d.narrowNoBreakSpace:
+        case d.mathematicalSpace:
+        case d.ideographicSpace:
+        case d.byteOrderMark:
           if (e) {
             s++;
             continue;
           } else {
-            for (; s < o && Ce(m(s)); )
+            for (; s < o && rn(S(s)); )
               s++;
-            return T = u.WhitespaceTrivia;
+            return w = u.WhitespaceTrivia;
           }
-        case p.doubleQuote:
-        case p.singleQuote:
-        case p.backtick:
-          return h = k(), T = u.StringLiteral;
-        case p.ampersand:
-          return m(s + 1) === p.a && m(s + 2) === p.m && m(s + 3) === p.p && m(s + 4) === p.semicolon ? (s += 5, T = u.AmpersandEntity) : m(s + 1) === p.l && m(s + 2) === p.t && m(s + 3) === p.semicolon ? (s += 4, T = u.LessThanEntity) : m(s + 1) === p.g && m(s + 2) === p.t && m(s + 3) === p.semicolon ? (s += 4, T = u.GreaterThanEntity) : m(s + 1) === p.q && m(s + 2) === p.u && m(s + 3) === p.o && m(s + 4) === p.t && m(s + 5) === p.semicolon ? (s += 6, T = u.DoubleQuoteEntity) : m(s + 1) === p.a && m(s + 2) === p.p && m(s + 3) === p.o && m(s + 4) === p.s && m(s + 5) === p.semicolon ? (s += 6, T = u.SingleQuoteEntity) : (s++, f(Be, 1), T = u.Unknown);
-        case p.equals:
-          return s++, T = u.Equal;
-        case p.colon:
-          return s++, T = u.Colon;
-        case p.lessThan:
-          if (m(s + 1) === p.slash)
-            return s += 2, T = u.CloseNodeStart;
+        case d.doubleQuote:
+        case d.singleQuote:
+        case d.backtick:
+          return h = k(), w = u.StringLiteral;
+        case d.ampersand:
+          return S(s + 1) === d.a && S(s + 2) === d.m && S(s + 3) === d.p && S(s + 4) === d.semicolon ? (s += 5, w = u.AmpersandEntity) : S(s + 1) === d.l && S(s + 2) === d.t && S(s + 3) === d.semicolon ? (s += 4, w = u.LessThanEntity) : S(s + 1) === d.g && S(s + 2) === d.t && S(s + 3) === d.semicolon ? (s += 4, w = u.GreaterThanEntity) : S(s + 1) === d.q && S(s + 2) === d.u && S(s + 3) === d.o && S(s + 4) === d.t && S(s + 5) === d.semicolon ? (s += 6, w = u.DoubleQuoteEntity) : S(s + 1) === d.a && S(s + 2) === d.p && S(s + 3) === d.o && S(s + 4) === d.s && S(s + 5) === d.semicolon ? (s += 6, w = u.SingleQuoteEntity) : (s++, f(ye, 1), w = u.Unknown);
+        case d.equals:
+          return s++, w = u.Equal;
+        case d.colon:
+          return s++, w = u.Colon;
+        case d.lessThan:
+          if (S(s + 1) === d.slash)
+            return s += 2, w = u.CloseNodeStart;
           if (
             // --- "<!-- -->", XMLUI comment
-            m(s + 1) === p.exclamation && m(s + 2) === p.minus && m(s + 3) === p.minus
+            S(s + 1) === d.exclamation && S(s + 2) === d.minus && S(s + 3) === d.minus
           ) {
             for (s += 4; s < o; ) {
-              if (m(s) === p.minus && m(s + 1) === p.minus && m(s + 2) === p.greaterThan)
-                return s += 3, T = u.CommentTrivia;
-              s += ne(m(s));
+              if (S(s) === d.minus && S(s + 1) === d.minus && S(s + 2) === d.greaterThan)
+                return s += 3, w = u.CommentTrivia;
+              s += re(S(s));
             }
-            return f(Mn, 4), T = u.Unknown;
+            return f(Gn, 4), w = u.Unknown;
           } else if (
             // --- <![CDATA[ section
-            m(s + 1) === p.exclamation && m(s + 2) === p.openBracket && m(s + 3) === p.C && m(s + 4) === p.D && m(s + 5) === p.A && m(s + 6) === p.T && m(s + 7) === p.A && m(s + 8) === p.openBracket
+            S(s + 1) === d.exclamation && S(s + 2) === d.openBracket && S(s + 3) === d.C && S(s + 4) === d.D && S(s + 5) === d.A && S(s + 6) === d.T && S(s + 7) === d.A && S(s + 8) === d.openBracket
           ) {
             for (s += 9; s < o; ) {
-              if (m(s) === p.closeBracket && m(s + 1) === p.closeBracket && m(s + 2) === p.greaterThan)
-                return s += 3, T = u.CData;
-              s += ne(m(s));
+              if (S(s) === d.closeBracket && S(s + 1) === d.closeBracket && S(s + 2) === d.greaterThan)
+                return s += 3, w = u.CData;
+              s += re(S(s));
             }
-            return f(qn, 9), T = u.CData;
+            return f(zn, 9), w = u.CData;
           } else if (
             // --- <script>
-            m(s + 1) === p.s && m(s + 2) === p.c && m(s + 3) === p.r && m(s + 4) === p.i && m(s + 5) === p.p && m(s + 6) === p.t && m(s + 7) === p.greaterThan
+            S(s + 1) === d.s && S(s + 2) === d.c && S(s + 3) === d.r && S(s + 4) === d.i && S(s + 5) === d.p && S(s + 6) === d.t && S(s + 7) === d.greaterThan
           ) {
             for (s += 8; s < o; ) {
-              if (m(s) === p.lessThan && m(s + 1) === p.slash && m(s + 2) === p.s && m(s + 3) === p.c && m(s + 4) === p.r && m(s + 5) === p.i && m(s + 6) === p.p && m(s + 7) === p.t && m(s + 8) === p.greaterThan)
-                return s += 9, T = u.Script;
-              s += ne(m(s));
+              if (S(s) === d.lessThan && S(s + 1) === d.slash && S(s + 2) === d.s && S(s + 3) === d.c && S(s + 4) === d.r && S(s + 5) === d.i && S(s + 6) === d.p && S(s + 7) === d.t && S(s + 8) === d.greaterThan)
+                return s += 9, w = u.Script;
+              s += re(S(s));
             }
-            return f($n, 9), T = u.Script;
+            return f(Qn, 9), w = u.Script;
           }
-          return s++, T = u.OpenNodeStart;
-        case p.slash:
-          return m(s + 1) === p.greaterThan ? (s += 2, T = u.NodeClose) : (s++, f(Be, 1), T = u.Unknown);
-        case p.greaterThan:
-          return s++, T = u.NodeEnd;
+          return s++, w = u.OpenNodeStart;
+        case d.slash:
+          return S(s + 1) === d.greaterThan ? (s += 2, w = u.NodeClose) : (s++, f(ye, 1), w = u.Unknown);
+        case d.greaterThan:
+          return s++, w = u.NodeEnd;
         default:
-          const d = he(g);
-          if (d)
-            return T = d;
-          if (Ce(g)) {
-            s += ne(g);
+          const p = Z(g);
+          if (p)
+            return w = p;
+          if (rn(g)) {
+            s += re(g);
             continue;
-          } else if (nr(g)) {
-            s += ne(g);
+          } else if (ir(g)) {
+            s += re(g);
             continue;
           }
-          const A = ne(g);
-          return s += A, f(Be, A), T = u.Unknown;
+          const A = re(g);
+          return s += A, f(ye, A), w = u.Unknown;
       }
     }
   }
-  function v() {
-    const g = s, d = H();
-    return Yn(d) ? d : (X(g), null);
+  function T() {
+    const g = s, p = Q();
+    return Kn(p) ? p : (X(g), null);
   }
   function _() {
     return u.Unknown;
   }
-  function $() {
+  function G() {
     return a;
   }
-  function m(g) {
+  function S(g) {
     return a.charCodeAt(g);
   }
-  function U(g) {
-    return J(a, g);
+  function q(g) {
+    return $(a, g);
   }
-  function J(g, d) {
-    return g.codePointAt(d) ?? 0;
+  function $(g, p) {
+    return g.codePointAt(p) ?? 0;
   }
-  function Y(g, d, A) {
-    a = g || "", o = A === void 0 ? a.length : d + A, X(d || 0);
+  function C(g, p, A) {
+    a = g || "", o = A === void 0 ? a.length : p + A, X(p || 0);
   }
-  function Z(g) {
+  function fe(g) {
     r = g;
   }
   function X(g) {
-    s = g, c = g, R = g, T = u.Unknown, h = void 0;
+    s = g, c = g, b = g, w = u.Unknown, h = void 0;
   }
-  function C() {
+  function pe() {
     X(c);
   }
-  function he(g) {
-    let d = g;
-    if (Vn(d)) {
-      for (s += ne(d); s < o && er(d = U(s)); )
-        s += ne(d);
-      return h = a.substring(R, s), K();
+  function Z(g) {
+    let p = g;
+    if (rr(p)) {
+      for (s += re(p); s < o && tr(p = q(s)); )
+        s += re(p);
+      return h = a.substring(b, s), j();
     }
   }
-  function K() {
-    return T = u.Identifier;
+  function j() {
+    return w = u.Identifier;
   }
   function k() {
-    const g = m(s);
+    const g = S(s);
     s++;
-    let d = "", A = s;
+    let p = "", A = s;
     for (; ; ) {
       if (s >= o) {
-        d += a.substring(A, s), f(Fn, 1);
+        p += a.substring(A, s), f(Xn, 1);
         break;
       }
-      if (m(s) === g) {
-        d += a.substring(A, s), s++;
+      if (S(s) === g) {
+        p += a.substring(A, s), s++;
         break;
       }
       s++;
     }
-    return d;
+    return p;
   }
-  function f(g, d = 0) {
-    r && r(g, d);
+  function f(g, p = 0) {
+    r && r(g, p);
   }
 }
-function ne(e) {
-  return e >= 65536 ? 2 : e === p.EOF ? 0 : 1;
+function re(e) {
+  return e >= 65536 ? 2 : e === d.EOF ? 0 : 1;
 }
-function Bn(e) {
-  return e >= p.A && e <= p.Z || e >= p.a && e <= p.z;
+function Un(e) {
+  return e >= d.A && e <= d.Z || e >= d.a && e <= d.z;
 }
-function jn(e) {
-  return Bn(e) || Cn(e) || e === p._;
+function er(e) {
+  return Un(e) || nr(e) || e === d._;
 }
-function Cn(e) {
-  return e >= p._0 && e <= p._9;
+function nr(e) {
+  return e >= d._0 && e <= d._9;
 }
-function Vn(e) {
-  return Bn(e) || e === p.$ || e === p._;
+function rr(e) {
+  return Un(e) || e === d.$ || e === d._;
 }
-function er(e) {
-  return jn(e) || e === p.$ || e === p.minus || e === p.dot;
+function tr(e) {
+  return er(e) || e === d.$ || e === d.minus || e === d.dot;
 }
-function Ce(e) {
-  return e === p.space || e === p.tab || e === p.verticalTab || e === p.formFeed || e === p.nonBreakingSpace || e === p.nextLine || e === p.ogham || e >= p.enQuad && e <= p.zeroWidthSpace || e === p.narrowNoBreakSpace || e === p.mathematicalSpace || e === p.ideographicSpace || e === p.byteOrderMark;
+function rn(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 nr(e) {
-  return e === p.lineFeed || e === p.carriageReturn || e === p.lineSeparator || e === p.paragraphSeparator;
+function ir(e) {
+  return e === d.lineFeed || e === d.carriageReturn || e === d.lineSeparator || e === d.paragraphSeparator;
 }
-function rr(e, n, r = 0) {
+function lr(e, n, r = 0) {
   var l;
-  const t = `${"  ".repeat(r)} ${Me(e.kind)} @${e.start}..${e.end}`;
-  if (Zn(e.kind))
+  const t = `${"  ".repeat(r)} ${ze(e.kind)} @${e.start}..${e.end}`;
+  if (Cn(e.kind))
     return t + `
-` + ((l = e.children) == null ? void 0 : l.map((a) => rr(a, n, r + 1)).join(`
+` + ((l = e.children) == null ? void 0 : l.map((a) => lr(a, n, r + 1)).join(`
 `));
   {
     let a = n(e);
     return e.kind === u.NewLineTrivia && (a = "*newline*"), t + ` "${a}"`;
   }
 }
-function tr(e, n, r) {
+function sr(e, n, r) {
   var a, s;
   const t = ((a = e.children) == null ? void 0 : a.filter((o) => o.kind !== u.ErrorNode)) ?? [], l = ((s = n.children) == null ? void 0 : s.filter((o) => o.kind !== u.ErrorNode)) ?? [];
   if (t.length !== l.length)
@@ -3562,7 +3566,7 @@ function tr(e, n, r) {
       return !1;
   return !0;
 }
-function Lr(e, n) {
+function Or(e, n) {
   const r = [e];
   let t;
   if (e.start > n || n > e.end)
@@ -3578,83 +3582,83 @@ function Lr(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(lr(o)),
+        chainBeforePos: r.concat(or(o)),
         sharedParents: t,
-        chainAtPos: r.concat(ir(s))
+        chainAtPos: r.concat(ar(s))
       };
     e = s, l.chainAtPos.push(e);
   }
   return l;
 }
-function ir(e) {
+function ar(e) {
   const n = [e];
   for (; e.children !== void 0 && e.children.length > 0; )
     e = e.children[0], n.push(e);
   return n;
 }
-function lr(e) {
+function or(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;
 }
-const we = {
+const Oe = {
   uppercaseAttr: function(e) {
     return {
-      category: xe.Error,
-      code: fe.uppercaseAttr,
+      category: _e.Error,
+      code: de.uppercaseAttr,
       message: `Attribute name '${e}' cannot start with an uppercase letter.`
     };
   },
   duplAttr: function(e) {
     return {
-      category: xe.Error,
-      code: fe.duplAttr,
+      category: _e.Error,
+      code: de.duplAttr,
       message: `Duplicated attribute: '${e}'.`
     };
   },
   tagNameMismatch: function(e, n) {
     return {
-      category: xe.Error,
-      code: fe.tagNameMismatch,
+      category: _e.Error,
+      code: de.tagNameMismatch,
       message: `Opening and closing tag names should match. Opening tag has a name '${e}', but the closing tag name is '${n}'.`
     };
   },
   invalidChar: function(e) {
     return {
-      category: xe.Error,
-      code: fe.invalidChar,
+      category: _e.Error,
+      code: de.invalidChar,
       message: `Invalid character '${e}'.`
     };
   }
 };
 u.CData, u.Script, u.OpenNodeStart;
-function wr(e) {
+function Ir(e) {
   return {
-    parse: () => sr(e),
+    parse: () => cr(e),
     getText: (n, r = !0) => e.substring(r ? n.pos ?? n.start ?? 0 : n.start ?? n.pos ?? 0, n.end)
   };
 }
-function sr(e) {
+function cr(e) {
   const n = [], r = [];
   let t, l = { children: [] }, a;
-  const o = Kn(!1, e, function(E, S) {
+  const o = Vn(!1, e, function(m, E) {
     a = {
-      message: E,
-      prefixLength: S
+      message: m,
+      prefixLength: E
     };
   });
-  function c(E, S = !0) {
-    return e.substring(S ? E.pos : E.start, E.end);
+  function c(m, E = !0) {
+    return e.substring(E ? m.pos : m.start, m.end);
   }
-  function R() {
-    f();
+  function b() {
+    O();
     e: for (; ; ) {
-      const E = he();
-      switch (E.kind) {
+      const m = g();
+      switch (m.kind) {
         case u.TextNode:
         case u.StringLiteral:
-          K(E.kind);
+          p(m.kind);
           break;
         case u.CloseNodeStart:
           break e;
@@ -3665,13 +3669,13 @@ function sr(e) {
           break;
       }
     }
-    l.children && l.children.length > 0 ? g(u.ContentListNode) : I();
+    l.children && l.children.length > 0 ? I(u.ContentListNode) : U();
   }
-  function T() {
+  function w() {
     for (; ; )
-      switch (he().kind) {
+      switch (g().kind) {
         case u.EndOfFileToken:
-          k();
+          A();
           return;
         default:
           h();
@@ -3679,221 +3683,251 @@ function sr(e) {
       }
   }
   function h() {
-    !U(u.CData) && !U(u.Script) && (m(u.OpenNodeStart) ? F() : A(Qn));
+    !$(u.CData) && !$(u.Script) && (q(u.OpenNodeStart) ? F() : pe(Jn));
   }
   function F() {
-    f(), K(u.OpenNodeStart);
-    let E;
-    if (m(u.Identifier) ? E = x() : Z(Ke), H(), U(u.NodeClose)) {
-      g(u.ElementNode);
-      return;
-    } else if (U(u.NodeEnd)) {
-      if (R(), U(u.CloseNodeStart)) {
-        if (m(u.Identifier)) {
-          const S = x();
-          E !== void 0 && !tr(E, S, c) && Z(we.tagNameMismatch(c(E), c(S)));
-        } else
-          Y(Ke, [u.NodeEnd]);
-        U(u.NodeEnd) || Z(Xn);
+    O(), p(u.OpenNodeStart);
+    let m = !1, E;
+    if (q(u.Identifier))
+      E = Q();
+    else {
+      m = !0;
+      const N = fe([u.OpenNodeStart, u.NodeEnd, u.NodeClose, u.CloseNodeStart, u.CData, u.Script]);
+      N ? j(Ue, N.pos, N.end) : Z(Ue);
+    }
+    switch (m || T(), f().kind) {
+      case u.NodeClose: {
+        A(), I(u.ElementNode);
+        return;
+      }
+      case u.NodeEnd: {
+        A(), b(), x(E), I(u.ElementNode);
+        return;
+      }
+      case u.OpenNodeStart:
+      case u.Script:
+      case u.CData: {
+        I(u.ElementNode), Z(Fe);
+        return;
+      }
+      case u.CloseNodeStart: {
+        Z(Fe), x(E), I(u.ElementNode);
+        return;
+      }
+      default:
+        Z(Fe);
+    }
+  }
+  function x(m) {
+    if ($(u.CloseNodeStart)) {
+      if (q(u.Identifier)) {
+        const E = Q();
+        m !== void 0 && !sr(m, E, c) && Z(Oe.tagNameMismatch(c(m), c(E)));
       } else
-        Z(Gn);
-      g(u.ElementNode);
-      return;
+        X(Ue, [u.NodeEnd]);
+      $(u.NodeEnd) || Z(Hn);
     } else
-      Z(Hn);
+      Z(Yn);
   }
-  function x() {
-    return f(), K(u.Identifier), U(u.Colon) && U(u.Identifier), g(u.TagNameNode);
-  }
-  function H() {
-    f();
-    const E = [];
-    for (; !J([u.EndOfFileToken, u.NodeEnd, u.NodeClose]); )
-      v(E);
-    l.children.length === 0 ? I() : g(u.AttributeListNode);
-  }
-  function v(E) {
-    if (f(), m(u.Identifier))
-      _(E);
+  function Q() {
+    return O(), p(u.Identifier), $(u.Colon) && $(u.Identifier), I(u.TagNameNode);
+  }
+  function T() {
+    O();
+    const m = [];
+    for (; !C([u.EndOfFileToken, u.NodeEnd, u.NodeClose]); )
+      _(m);
+    l.children.length === 0 ? U() : I(u.AttributeListNode);
+  }
+  function _(m) {
+    if (O(), q(u.Identifier))
+      G(m);
     else {
-      const S = [u.Equal];
-      if (!Y(je, S))
+      const E = [u.Equal];
+      if (!X(nn, E))
         return;
     }
-    if (U(u.Equal) && !U(u.StringLiteral)) {
-      const S = [u.NodeEnd, u.NodeClose];
-      Y(zn, S);
+    if ($(u.Equal) && !$(u.StringLiteral)) {
+      const E = [u.NodeEnd, u.NodeClose];
+      X(Zn, E);
     }
-    g(u.AttributeNode);
+    I(u.AttributeNode);
   }
-  function _(E) {
-    const S = C();
-    let L;
-    f(), K(u.Identifier), U(u.Colon) && (m(u.Identifier) ? L = K(u.Identifier) : Y(je, [
+  function G(m) {
+    const E = f();
+    let N;
+    O(), p(u.Identifier), $(u.Colon) && (q(u.Identifier) ? N = p(u.Identifier) : X(nn, [
       u.NodeClose,
       u.NodeEnd,
       u.Equal
-    ])), $(E, { nsIdent: L, nameIdent: S }), g(u.AttributeKeyNode);
+    ])), S(m, { nsIdent: N, nameIdent: E }), I(u.AttributeKeyNode);
   }
-  function $(E, { nameIdent: S, nsIdent: L }) {
-    const b = c(S), N = L === void 0 ? void 0 : c(L), O = ({ ns: ce, name: Se }) => Se === b && ce === N, B = E.findIndex(O) !== -1, q = "A" <= b[0] && b[0] <= "Z", W = B || q;
-    B && X(we.duplAttr(b), S.pos, S.end), q && X(we.uppercaseAttr(b), S.pos, S.end), W || E.push({ name: b });
+  function S(m, { nameIdent: E, nsIdent: N }) {
+    const v = c(E), y = N === void 0 ? void 0 : c(N), D = ({ ns: Ae, name: Le }) => Le === v && Ae === y, J = m.findIndex(D) !== -1, V = "A" <= v[0] && v[0] <= "Z", le = J || V;
+    J && j(Oe.duplAttr(v), E.pos, E.end), V && j(Oe.uppercaseAttr(v), E.pos, E.end), le || m.push({ name: v });
   }
-  function m(E) {
-    return C().kind === E;
+  function q(m) {
+    return f().kind === m;
   }
-  function U(E) {
-    const S = m(E);
-    return S && k(), S;
+  function $(m) {
+    const E = q(m);
+    return E && A(), E;
   }
-  function J(E) {
-    return E.includes(C().kind);
+  function C(m) {
+    return m.includes(f().kind);
   }
-  function Y(E, S) {
-    return J(S) || m(u.EndOfFileToken) ? (Z(E), !0) : (f(), Z(E), k(), g(u.ErrorNode), !1);
+  function fe(m) {
+    return O(), k(m), l.children.length === 0 ? (U(), null) : I(u.ErrorNode);
   }
-  function Z({ code: E, message: S, category: L }) {
-    const { pos: b, end: N } = C();
+  function X(m, E) {
+    return C(E) || q(u.EndOfFileToken) ? (Z(m), !0) : (O(), Z(m), A(), I(u.ErrorNode), !1);
+  }
+  function pe(m) {
+    X(m, []);
+  }
+  function Z({ code: m, message: E, category: N }) {
+    const { pos: v, end: y } = f();
     n.push({
-      category: L,
-      code: E,
-      message: S,
-      pos: b,
-      end: N
+      category: N,
+      code: m,
+      message: E,
+      pos: v,
+      end: y
     });
   }
-  function X({ code: E, message: S, category: L }, b, N) {
+  function j({ code: m, message: E, category: N }, v, y) {
     n.push({
-      category: L,
-      code: E,
-      message: S,
-      pos: b,
-      end: N
+      category: N,
+      code: m,
+      message: E,
+      pos: v,
+      end: y
     });
   }
-  function C(E = !1) {
-    return t !== void 0 || (t = d(E)), t;
-  }
-  function he() {
-    const E = C(!0);
-    if (E.kind === u.EndOfFileToken || E.kind === u.OpenNodeStart || E.kind === u.Script || E.kind === u.CData || E.kind === u.CloseNodeStart)
-      return E;
-    const S = E.triviaBefore, L = (S == null ? void 0 : S.length) ?? 0;
-    let b = 0, N = [], O = -1;
-    for (; b < L; ++b)
-      if (S[b].kind === u.CommentTrivia)
-        N.push(S[b]);
+  function k(m) {
+    for (let E = f(); E.kind !== u.EndOfFileToken && !m.includes(E.kind); A(), E = f())
+      ;
+  }
+  function f(m = !1) {
+    return t !== void 0 || (t = P(m)), t;
+  }
+  function g() {
+    const m = f(!0);
+    if (m.kind === u.EndOfFileToken || m.kind === u.OpenNodeStart || m.kind === u.Script || m.kind === u.CData || m.kind === u.CloseNodeStart)
+      return m;
+    const E = m.triviaBefore, N = (E == null ? void 0 : E.length) ?? 0;
+    let v = 0, y = [], D = -1;
+    for (; v < N; ++v)
+      if (E[v].kind === u.CommentTrivia)
+        y.push(E[v]);
       else {
-        O = b;
+        D = v;
         break;
       }
-    let B = -1;
-    for (; b < L; ++b)
-      if (S[b].kind === u.CommentTrivia) {
-        B = b;
+    let J = -1;
+    for (; v < N; ++v)
+      if (E[v].kind === u.CommentTrivia) {
+        J = v;
         break;
       }
-    let q = !1;
-    if (E.kind === u.StringLiteral) {
-      const Ne = E.end, Ae = d(!0);
-      q = Ae.kind === u.CData || Ae.kind === u.CloseNodeStart || Ae.kind === u.Script || Ae.kind === u.OpenNodeStart, o.resetTokenState(Ne);
+    let V = !1;
+    if (m.kind === u.StringLiteral) {
+      const we = m.end, Te = P(!0);
+      V = Te.kind === u.CData || Te.kind === u.CloseNodeStart || Te.kind === u.Script || Te.kind === u.OpenNodeStart, o.resetTokenState(we);
     }
-    let W;
-    q ? W = E.pos : N.length > 0 ? W = N[N.length - 1].end : O !== -1 ? W = S[O].pos : W = E.start;
-    let ce = W, Se;
-    N.length > 0 && (Se = N, ce = N[0].pos);
-    let $e = u.TextNode, me = -1;
-    if (B !== -1)
-      me = S[B].pos, o.resetTokenState(me);
-    else if (q)
-      $e = u.StringLiteral, me = E.end;
+    let le;
+    V ? le = m.pos : y.length > 0 ? le = y[y.length - 1].end : D !== -1 ? le = E[D].pos : le = m.start;
+    let Ae = le, Le;
+    y.length > 0 && (Le = y, Ae = y[0].pos);
+    let He = u.TextNode, Se = -1;
+    if (J !== -1)
+      Se = E[J].pos, o.resetTokenState(Se);
+    else if (V)
+      He = u.StringLiteral, Se = m.end;
     else {
       for (; ; ) {
-        const Ne = o.peekChar();
-        if (Ne === null || Ne === p.lessThan)
+        const we = o.peekChar();
+        if (we === null || we === d.lessThan)
           break;
         o.scanChar();
       }
-      me = o.getTokenEnd();
+      Se = o.getTokenEnd();
     }
-    return t = { kind: $e, start: ce, pos: W, end: me, triviaBefore: Se }, t;
+    return t = { kind: He, start: Ae, pos: le, end: Se, triviaBefore: Le }, t;
   }
-  function K(E) {
-    const S = k();
-    if (S.kind !== E)
+  function p(m) {
+    const E = A();
+    if (E.kind !== m)
       throw new Error(
-        `expected ${Me(E)}, bumped a ${Me(S.kind)}`
+        `expected ${ze(m)}, bumped a ${ze(E.kind)}`
       );
-    return S;
+    return E;
   }
-  function k() {
+  function A() {
     if (t) {
       l.children.push(t);
-      const S = t;
-      return t = void 0, S;
+      const E = t;
+      return t = void 0, E;
     }
-    const E = d(!1);
-    return l.children.push(E), E;
+    const m = P(!1);
+    return l.children.push(m), m;
   }
-  function f() {
+  function O() {
     r.push(l), l = {
       children: []
     };
   }
-  function g(E) {
-    const S = Ve(E, l.children), L = r[r.length - 1];
-    return L.children.push(S), l = L, r.pop(), S;
+  function I(m) {
+    const E = tn(m, l.children), N = r[r.length - 1];
+    return N.children.push(E), l = N, r.pop(), E;
   }
-  function d(E) {
-    let S, L = [], b = null;
+  function P(m) {
+    let E, N = [], v = null;
     for (; ; ) {
-      if (S = o.scan(), b === null && (b = o.getTokenStart()), a !== void 0) {
-        let N;
-        a.message.code === fe.invalidChar ? N = we.invalidChar(o.getTokenText()) : N = a.message;
-        const O = o.getTokenStart(), B = {
-          kind: S,
-          start: b,
-          pos: O,
+      if (E = o.scan(), v === null && (v = o.getTokenStart()), a !== void 0) {
+        let y;
+        a.message.code === de.invalidChar ? y = Oe.invalidChar(o.getTokenText()) : y = a.message;
+        const D = o.getTokenStart(), J = {
+          kind: E,
+          start: v,
+          pos: D,
           end: o.getTokenEnd(),
-          triviaBefore: L.length > 0 ? L : void 0
+          triviaBefore: N.length > 0 ? N : void 0
         };
-        if (L = [], E && N.code === fe.invalidChar)
-          return a = void 0, B;
-        const q = O + a.prefixLength;
-        return B.end = q, o.resetTokenState(q), f(), l.children.push(B), X(N, O, q), g(u.ErrorNode), a = void 0, d(E);
+        if (N = [], m && y.code === de.invalidChar)
+          return a = void 0, J;
+        const V = D + a.prefixLength;
+        return J.end = V, o.resetTokenState(V), O(), l.children.push(J), j(y, D, V), I(u.ErrorNode), a = void 0, P(m);
       }
-      switch (S) {
+      switch (E) {
         case u.CommentTrivia:
         case u.NewLineTrivia:
         case u.WhitespaceTrivia:
-          L.push({
-            kind: S,
-            start: b,
+          N.push({
+            kind: E,
+            start: v,
             pos: o.getTokenStart(),
             end: o.getTokenEnd()
           });
           break;
         default:
           return {
-            kind: S,
-            start: b,
+            kind: E,
+            start: v,
             pos: o.getTokenStart(),
             end: o.getTokenEnd(),
-            triviaBefore: L.length > 0 ? L : void 0
+            triviaBefore: N.length > 0 ? N : void 0
           };
       }
     }
   }
-  function A(E) {
-    Y(E, []);
-  }
-  function I() {
-    const E = r[r.length - 1];
-    E.children.push(...l.children), l = E, r.pop();
+  function U() {
+    const m = r[r.length - 1];
+    m.children.push(...l.children), l = m, r.pop();
   }
-  return T(), { node: Ve(u.ContentListNode, l.children), errors: n };
+  return w(), { node: tn(u.ContentListNode, l.children), errors: n };
 }
-function Ve(e, n) {
+function tn(e, n) {
   const r = n[0], t = n[n.length - 1];
   return {
     kind: e,
@@ -3903,75 +3937,75 @@ function Ve(e, n) {
     children: n
   };
 }
-function w(e, n, r, t, l, a) {
+function L(e, n, r, t, l, a) {
   if (n.cancel)
     return n;
   if (n.skipChildren = !1, Array.isArray(e)) {
     for (const s of e)
-      n = w(s, n, r, t, l, a);
+      n = L(s, n, r, t, l, a);
     return n;
   }
   switch (e.type) {
-    case ve: {
+    case be: {
       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 = w(s, n, r, t, e, "statements"), n.cancel) return n;
+          if (n = L(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 ke:
+    case Ee:
       return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
-    case on:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.expr, n, r, t, e, "expression"), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case Wn:
+    case hn:
+      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 Fn:
       return n;
-    case cn: {
+    case dn: {
       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 = w(s, n, r, t, e, "declarations"), n.cancel) return n;
+          if (n = L(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: {
+    case pn: {
       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 = w(s, n, r, t, e, "declarations"), n.cancel) return n;
+          if (n = L(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 Qe: {
       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 = w(s, n, r, t, e, "declarations"), n.cancel) return n;
+          if (n = L(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 fn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.cond, n, r, t, e, "condition"), n.cancel || (e.thenB && (n = w(e.thenB, n, r, t, e, "thenBranch")), n.cancel) || (e.elseB && (n = w(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.cancel || !n.skipChildren && (e.expr && (n = w(e.expr, n, r, t, e, "expression")), n.cancel) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case pn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
-    case dn:
-      return n = (r == null ? void 0 : r(!0, 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 && (n = w(e.cond, n, r, t, e, "condition"), n.cancel || (n = w(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 = 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 gn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.body, n, r, t, e, "body"), n.cancel || (n = w(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 && (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;
     case En:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.init && (n = w(e.init, n, r, t, e, "init")), n.cancel || (e.cond && (n = w(e.cond, n, r, t, e, "condition")), n.cancel) || (e.upd && (n = w(e.upd, n, r, t, e, "update")), n.cancel) || (n = w(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case ge:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.expr, n, r, t, e, "expression"), n.cancel || (n = w(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 = w(e.expr, n, r, t, e, "expression"), n.cancel || (n = w(e.body, n, r, t, e, "body"), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case xn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(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;
     case mn:
-      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.tryB && (n = w(e.tryB, n, r, t, e, "tryBlock")), n.cancel || (e.catchB && (n = w(e.catchB, n, r, t, e, "catchBlock")), n.cancel) || (e.finallyB && (n = w(
+      return n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n;
+    case xn:
+      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;
+    case _n:
+      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;
+    case Sn:
+      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 me:
+      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 Ne:
+      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 Nn:
+      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 An:
+      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(
         e.finallyB,
         n,
         r,
@@ -3979,12 +4013,12 @@ function w(e, n, r, t, l, a) {
         e,
         "finallyBlock"
       )), n.cancel)) || (n = (r == null ? void 0 : r(!1, e, n, l, a)) || n), n;
-    case _n: {
+    case Ln: {
       if (n = (r == null ? void 0 : r(!0, e, n, l, a)) || n, n.cancel) return n;
       if (!n.skipChildren) {
-        if (n = w(e.expr, n, r, t, e, "expression"), n.cancel) return n;
+        if (n = L(e.expr, n, r, t, e, "expression"), n.cancel) return n;
         for (const s of e.cases) {
-          if (s.caseE && (n = w(
+          if (s.caseE && (n = L(
             s.caseE,
             n,
             r,
@@ -3994,7 +4028,7 @@ function w(e, n, r, t, l, a) {
           )), n.cancel) return n;
           if (s.stmts !== void 0) {
             for (const o of s.stmts)
-              if (n = w(
+              if (n = L(
                 o,
                 n,
                 r,
@@ -4007,154 +4041,154 @@ function w(e, n, r, t, l, a) {
       }
       return n = (r == null ? void 0 : r(!1, e, n, l, a)) || n, n;
     }
-    case De: {
+    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.args)
-          if (n = w(s, n, r, t, e, "arg"), n.cancel) return n;
-        if (n = w(e.stmt, n, r, t, e, "statement"), n.cancel) return n;
+          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;
       }
       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 = w(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case G:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.left, n, r, t, e, "left"), n.cancel || (n = w(e.right, n, r, t, e, "right"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case le: {
+    case wn:
+      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 z:
+      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 ae: {
       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 = w(s, n, r, t, e, "expression"), n.cancel) return n;
+          if (n = L(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 Nn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.cond, n, r, t, e, "condition"), n.cancel || (n = w(e.thenE, n, r, t, e, "consequent"), n.cancel) || (n = w(e.elseE, n, r, t, e, "alternate"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case An: {
+    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 vn: {
       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 = w(s, n, r, t, e, "argument"), n.cancel) return n;
-        if (n = w(e.obj, n, r, t, e, "object"), n.cancel) return n;
+          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;
       }
       return 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 = w(e.obj, n, r, t, e, "object"), n.cancel) || (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 && (n = w(e.obj, n, r, t, e, "object"), n.cancel || (n = w(e.member, n, r, t, e, "member"), 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.obj, n, r, t, e, "object"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
+    case In:
+      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 M:
       return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n;
-    case Q:
+    case Y:
       return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n;
-    case se: {
+    case oe: {
       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 = w(s, n, r, t, e, "item"), n.cancel) return n;
+          if (n = L(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 ae: {
+    case ce: {
       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, c] = s;
-            if (n = w(o, n, r, t, e, "propKey"), n.cancel || (n = w(c, n, r, t, e, "propValue"), n.cancel)) return n;
-          } else if (n = w(s, n, r, t, e, "prop"), n.cancel) return n;
+            if (n = L(o, n, r, t, e, "propKey"), n.cancel || (n = L(c, n, r, t, e, "propValue"), n.cancel)) return n;
+          } else if (n = L(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 oe:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case vn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.expr, n, r, t, e, "operand"), n.cancel || (n = w(e.leftValue, n, r, t, e, "leftValue"), n.cancel)) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case Ee:
+    case ue:
+      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 Dn:
+      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 xe:
       return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n;
-    case be: {
+    case Be: {
       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 = w(s, n, r, t, e, "arg"), n.cancel) return n;
-        if (n = w(e.statement, n, r, t, e, "statement"), n.cancel) return n;
+          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;
       }
       return n = (t == null ? void 0 : t(!1, e, n, l, a)) || n, n;
     }
-    case On:
-    case In:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (n = w(e.expr, n, r, t, e, "operand"), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case Ue: {
+    case Rn:
+    case Bn:
+      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 Xe: {
       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 = w(s, n, r, t, e), n.cancel) return n;
+            if (n = L(s, n, r, t, e), n.cancel) return n;
         }
         if (e.oDestr !== void 0) {
           for (const s of e.oDestr)
-            if (n = w(s, n, r, t, e), n.cancel) return n;
+            if (n = L(s, n, r, t, e), n.cancel) return n;
         }
-        if (e.expr && (n = w(e.expr, n, r, t, e, "expression")), n.cancel) return n;
+        if (e.expr && (n = L(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 Oe:
-    case te:
-    case ee: {
+    case De:
+    case ie:
+    case ne: {
       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 = w(s, n, r, t, e), n.cancel) return n;
+            if (n = L(s, n, r, t, e), n.cancel) return n;
         }
         if (e.oDestr !== void 0) {
           for (const s of e.oDestr)
-            if (n = w(s, n, r, t, e), n.cancel) return n;
+            if (n = L(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 bn:
-      return n = (t == null ? void 0 : t(!0, e, n, l, a)) || n, n.cancel || !n.skipChildren && (e.expr && (n = w(e.expr, n, r, t, e, "expression")), n.cancel) || (n = (t == null ? void 0 : t(!1, e, n, l, a)) || n), n;
-    case Tn:
       return n;
-    case Dn:
+    case Pn:
       return n;
     default:
       return n;
   }
 }
-function ar(e) {
+function ur(e) {
   return e.type !== "ScriptModule";
 }
-function or(e, n) {
+function fr(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 c = new Fe(o);
-    let R = [];
+    const c = new Ge(o);
+    let b = [];
     try {
-      R = c.parseStatements();
+      b = c.parseStatements();
     } catch {
       return t[s] = c.errors, null;
     }
-    const T = c.current;
-    if (T.type !== i.Eof)
+    const w = c.current;
+    if (w.type !== i.Eof)
       return t[s] ?? (t[s] = []), t[s].push({
         code: "W002",
-        text: Ie.W002.replace(/\{(\d+)}/g, () => T.text),
-        position: T.startLine,
-        line: T.startLine,
-        column: T.startColumn
+        text: Re.W002.replace(/\{(\d+)}/g, () => w.text),
+        position: w.startLine,
+        line: w.startLine,
+        column: w.startColumn
       }), null;
     const h = [], F = {};
-    R.filter((v) => v.type === De).forEach((v) => {
-      const _ = v;
+    b.filter((T) => T.type === We).forEach((T) => {
+      const _ = T;
       if (F[_.id.name]) {
-        H("W020", v, _.id.name);
+        Q("W020", T, _.id.name);
         return;
       }
       F[_.id.name] = _;
@@ -4163,49 +4197,49 @@ function or(e, n) {
       type: "ScriptModule",
       name: s,
       functions: F,
-      statements: R,
+      statements: b,
       sources: /* @__PURE__ */ new Map()
     };
     if (r.set(s, x), h.length > 0)
       return t[s] = h, null;
     return x;
-    function H(v, _, ...$) {
-      var U, J, Y;
-      let m = Ie[v];
-      $ && $.forEach(
-        (Z, X) => m = m.replaceAll(`{${X}}`, $[X].toString())
+    function Q(T, _, ...G) {
+      var q, $, C;
+      let S = Re[T];
+      G && G.forEach(
+        (fe, X) => S = S.replaceAll(`{${X}}`, G[X].toString())
       ), h.push({
-        code: v,
-        text: Ie[v].replace(/\{(\d+)}/g, (Z, X) => $[X]),
-        position: (U = _.startToken) == null ? void 0 : U.startPosition,
-        line: (J = _.startToken) == null ? void 0 : J.startLine,
-        column: (Y = _.startToken) == null ? void 0 : Y.startColumn
+        code: T,
+        text: Re[T].replace(/\{(\d+)}/g, (fe, X) => G[X]),
+        position: (q = _.startToken) == null ? void 0 : q.startPosition,
+        line: ($ = _.startToken) == null ? void 0 : $.startLine,
+        column: (C = _.startToken) == null ? void 0 : C.startColumn
       });
     }
   }
 }
-const We = "__PARSED__";
-function cr(e, n) {
+const Me = "__PARSED__";
+function hr(e, n) {
   const r = {
     vars: {},
     moduleErrors: {},
     functions: {}
-  }, t = {}, l = or(e, n);
-  if (ar(l))
+  }, t = {}, l = fr(e, n);
+  if (ur(l))
     return { ...r, moduleErrors: l };
   return l.statements.forEach((s) => {
     switch (s.type) {
-      case qe:
+      case Qe:
         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] = {
-            [We]: !0,
+            [Me]: !0,
             tree: o.expr
           };
         });
         break;
-      case De:
+      case We:
         a(s);
         break;
       default:
@@ -4218,7 +4252,7 @@ function cr(e, n) {
     if (s.id.name in r.functions)
       throw new Error(`Duplicated function declaration: '${s.id.name}'`);
     const o = {
-      type: be,
+      type: Be,
       args: s.args.slice(),
       statement: s.stmt
       // closureContext: obtainClosures({
@@ -4229,15 +4263,15 @@ function cr(e, n) {
       // }),
     };
     t[s.id.name] = {
-      [We]: !0,
+      [Me]: !0,
       tree: o
     }, r.functions[s.id.name] = {
-      [We]: !0,
+      [Me]: !0,
       tree: o
     };
   }
 }
-function Tr(e) {
+function br(e) {
   if (!e) return;
   const n = {
     data: null,
@@ -4251,15 +4285,15 @@ function Tr(e) {
   });
   function r(t) {
     const l = (a, s, o) => (a && s && (delete s.startToken, delete s.endToken), o);
-    w(t.tree, n, l, l);
+    L(t.tree, n, l, l);
   }
 }
-class Re extends Error {
+class Pe extends Error {
   constructor(n, r) {
-    super(`${r ? `${r}: ` : ""}${n}`), this.code = r, Object.setPrototypeOf(this, Re.prototype);
+    super(`${r ? `${r}: ` : ""}${n}`), this.code = r, Object.setPrototypeOf(this, Pe.prototype);
   }
 }
-const ur = {
+const dr = {
   U001: "Unexpected token: {0}.",
   U002: "A component definition can have exactly one XMLUI element.",
   U003: "A '<' token expected.",
@@ -4304,7 +4338,7 @@ const ur = {
   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}'."
-}, en = "Component", Pe = /^[A-Z]/, nn = /^on[A-Z]/, fr = ["name", "value"], hr = 9, ye = "component-ns", pr = "app-ns", dr = "#app-ns", kr = "core-ns", gr = "#xmlui-core-ns", ie = {
+}, ln = "Component", qe = /^[A-Z]/, sn = /^on[A-Z]/, pr = ["name", "value"], kr = 9, $e = "component-ns", gr = "app-ns", Er = "#app-ns", mr = "core-ns", xr = "#xmlui-core-ns", se = {
   property: "property",
   event: "event",
   variable: "variable",
@@ -4314,15 +4348,15 @@ const ur = {
   item: "item",
   field: "field"
 };
-let Er = 0;
-function vr(e, n, r) {
-  const t = (k) => k.text ?? n(k), l = _r(e), a = J(l), s = [], o = [];
+let _r = 0;
+function Dr(e, n, r) {
+  const t = (k) => k.text ?? n(k), l = Ar(e), a = $(l), s = [], o = [];
   return c(s, a);
   function c(k, f) {
-    const g = an(f, t, o);
-    if (g === en)
-      return T(f);
-    let d = {
+    const g = fn(f, t, o);
+    if (g === ln)
+      return w(f);
+    let p = {
       type: g,
       debug: {
         source: {
@@ -4332,12 +4366,12 @@ function vr(e, n, r) {
         }
       }
     };
-    return h(k, d, f), d;
+    return h(k, p, f), p;
   }
-  function R(k, f) {
-    const g = an(f, t, o);
-    g === en && P("T006");
-    let d = {
+  function b(k, f) {
+    const g = fn(f, t, o);
+    g === ln && B("T006");
+    let p = {
       type: g,
       debug: {
         source: {
@@ -4347,40 +4381,40 @@ function vr(e, n, r) {
         }
       }
     };
-    return h(k, d, f), d;
-  }
-  function T(k) {
-    const f = pe(k).map(m), g = f.find((W) => W.name === "name");
-    g || P("T003"), Pe.test(g.value) || P("T004");
-    let d;
-    const A = f.filter((W) => W.startSegment === "method");
-    A.length > 0 && (d = {}, A.forEach((W) => {
-      d[W.name] = W.value;
+    return h(k, p, f), p;
+  }
+  function w(k) {
+    const f = ke(k).map(S), g = f.find((D) => D.name === "name");
+    g || B("T003"), qe.test(g.value) || B("T004");
+    let p;
+    const A = f.filter((D) => D.startSegment === "method");
+    A.length > 0 && (p = {}, A.forEach((D) => {
+      p[D.name] = D.value;
     }));
-    let I;
-    const D = f.filter((W) => W.startSegment === "var");
-    D.length > 0 && (I = {}, D.forEach((W) => {
-      I[W.name] = W.value;
+    let O;
+    const I = f.filter((D) => D.startSegment === "var");
+    I.length > 0 && (O = {}, I.forEach((D) => {
+      O[D.name] = D.value;
     }));
-    const E = de(k), S = E.filter(
-      (W) => W.kind === u.ElementNode && !(re(W, t) in ie)
+    const P = ge(k), U = P.filter(
+      (D) => D.kind === u.ElementNode && !(te(D, t) in se)
     );
-    S.length === 0 && S.push(rn(""));
-    const L = [], b = [];
-    for (let W of E)
-      if (W.kind === u.ElementNode) {
-        const ce = re(W, t);
-        ce === ie.variable ? b.push(W) : ce in ie && L.push(W);
+    U.length === 0 && U.push(an(""));
+    const R = [], m = [];
+    for (let D of P)
+      if (D.kind === u.ElementNode) {
+        const J = te(D, t);
+        J === se.variable ? m.push(D) : J in se && R.push(D);
       }
-    let N;
-    S.length > 1 || b.length > 0 ? N = tn([...b, ...S]) : N = S[0], o.push(/* @__PURE__ */ new Map()), f.filter((W) => W.namespace === "xmlns").forEach((W) => {
-      sn(o, N, W.unsegmentedName, W.value);
+    let E;
+    U.length > 1 || m.length > 0 ? E = on([...m, ...U]) : E = U[0], o.push(/* @__PURE__ */ new Map()), f.filter((D) => D.namespace === "xmlns").forEach((D) => {
+      un(o, E, D.unsegmentedName, D.value);
     });
-    let O = R(s, N);
+    let N = b(s, E);
     o.pop();
-    const B = {
+    const v = {
       name: g.value,
-      component: O,
+      component: N,
       debug: {
         source: {
           start: k.start,
@@ -4389,55 +4423,55 @@ function vr(e, n, r) {
         }
       }
     };
-    d && (B.api = d), I && (O.vars = { ...O.vars, ...I }), O.debug = {
+    p && (v.api = p), O && (N.vars = { ...N.vars, ...O }), N.debug = {
       source: {
-        start: N.start,
-        end: N.end,
+        start: E.start,
+        end: E.end,
         fileId: r
       }
     };
-    const q = ln(k, L);
-    return h(s, B, q), B;
+    const y = cn(k, R);
+    return h(s, v, y), v;
   }
   function h(k, f, g) {
-    var S;
-    const d = !j(f), A = pe(g);
-    if (o.push(/* @__PURE__ */ new Map()), A.forEach((L) => {
-      F(f, L);
-    }), de(g).forEach((L) => {
-      if (L.kind === u.Script) {
-        pe(L).length > 0 && P("T022");
-        const N = t(L), O = N.slice(
-          N.indexOf(">") + 1,
-          N.lastIndexOf("</")
+    var U;
+    const p = !K(f), A = ke(g);
+    if (o.push(/* @__PURE__ */ new Map()), A.forEach((R) => {
+      F(f, R);
+    }), ge(g).forEach((R) => {
+      if (R.kind === u.Script) {
+        ke(R).length > 0 && B("T022");
+        const E = t(R), N = E.slice(
+          E.indexOf(">") + 1,
+          E.lastIndexOf("</")
         );
         f.script ?? (f.script = ""), f.script.length > 0 && (f.script += `
-`), f.script += O;
+`), f.script += N;
         return;
       }
-      if (L.kind === u.TextNode && !d) {
-        f.children = Te(f.children, t(L));
+      if (R.kind === u.TextNode && !p) {
+        f.children = Ie(f.children, t(R));
         return;
       }
-      const b = re(L, t);
-      if (!(d && L.kind === u.ElementNode && !(b in ie))) {
-        if (!(b in ie) && !d) {
-          const N = R(k, L);
-          N && (f.children ? typeof f.children == "string" ? f.children = [f.children, N] : Array.isArray(f.children) && f.children.push(N) : f.children = [N]);
+      const m = te(R, t);
+      if (!(p && R.kind === u.ElementNode && !(m in se))) {
+        if (!(m in se) && !p) {
+          const E = b(k, R);
+          E && (f.children ? typeof f.children == "string" ? f.children = [f.children, E] : Array.isArray(f.children) && f.children.push(E) : f.children = [E]);
           return;
         }
-        switch (b) {
+        switch (m) {
           case "property":
             _(
               k,
               f,
-              L,
-              (N) => {
-                var O;
-                return j(f) ? (O = f.props) == null ? void 0 : O[N] : void 0;
+              R,
+              (E) => {
+                var N;
+                return K(f) ? (N = f.props) == null ? void 0 : N[E] : void 0;
               },
-              (N, O) => {
-                j(f) && (f.props ?? (f.props = {}), f.props[N] = O);
+              (E, N) => {
+                K(f) && (f.props ?? (f.props = {}), f.props[E] = N);
               }
             );
             return;
@@ -4445,295 +4479,295 @@ function vr(e, n, r) {
             _(
               k,
               f,
-              L,
-              (N) => {
-                var O;
-                return j(f) ? (O = f.events) == null ? void 0 : O[N] : void 0;
+              R,
+              (E) => {
+                var N;
+                return K(f) ? (N = f.events) == null ? void 0 : N[E] : void 0;
               },
-              (N, O) => {
-                j(f) && (f.events ?? (f.events = {}), f.events[N] = K(O));
+              (E, N) => {
+                K(f) && (f.events ?? (f.events = {}), f.events[E] = j(N));
               },
-              (N) => {
-                nn.test(N) && P("T008", N);
+              (E) => {
+                sn.test(E) && B("T008", E);
               }
             );
             return;
-          case ie.variable:
+          case se.variable:
             _(
               k,
               f,
-              L,
-              (N) => {
-                var O;
-                return j(f) ? (O = f.vars) == null ? void 0 : O[N] : void 0;
+              R,
+              (E) => {
+                var N;
+                return K(f) ? (N = f.vars) == null ? void 0 : N[E] : void 0;
               },
-              (N, O) => {
-                j(f) && (f.vars ?? (f.vars = {}), f.vars[N] = O);
+              (E, N) => {
+                K(f) && (f.vars ?? (f.vars = {}), f.vars[E] = N);
               }
             );
             return;
           case "loaders":
-            v(k, f, L);
+            T(k, f, R);
             return;
           case "uses":
-            $(f, L);
+            G(f, R);
             return;
           case "method":
             _(
               k,
               f,
-              L,
-              (N) => {
-                var O;
-                return j(f) ? (O = f.api) == null ? void 0 : O[N] : void 0;
+              R,
+              (E) => {
+                var N;
+                return K(f) ? (N = f.api) == null ? void 0 : N[E] : void 0;
               },
-              (N, O) => {
-                f.api ?? (f.api = {}), f.api[N] = O;
+              (E, N) => {
+                f.api ?? (f.api = {}), f.api[E] = N;
               }
             );
             return;
           default:
-            P("T009", b);
+            B("T009", m);
             return;
         }
       }
     }), o.pop(), !f.script || f.script.trim().length === 0)
       return;
-    const D = new Fe(f.script);
+    const I = new Ge(f.script);
     try {
-      D.parseStatements(), f.scriptCollected = cr("Main", f.script);
-    } catch (L) {
-      D.errors && D.errors.length > 0 ? f.scriptError = D.errors : f.scriptError = L;
+      I.parseStatements(), f.scriptCollected = hr("Main", f.script);
+    } catch (R) {
+      I.errors && I.errors.length > 0 ? f.scriptError = I.errors : f.scriptError = R;
     }
-    const E = ((S = f.scriptCollected) == null ? void 0 : S.moduleErrors) ?? {};
-    Object.keys(E).length > 0 && (f.scriptError = E);
+    const P = ((U = f.scriptCollected) == null ? void 0 : U.moduleErrors) ?? {};
+    Object.keys(P).length > 0 && (f.scriptError = P);
   }
   function F(k, f) {
-    const { namespace: g, startSegment: d, name: A, value: I, unsegmentedName: D } = m(f);
+    const { namespace: g, startSegment: p, name: A, value: O, unsegmentedName: I } = S(f);
     if (g === "xmlns")
-      return sn(o, k, D, I);
-    if (!j(k)) {
-      if (d && d !== "method" && d !== "var") {
-        P("T021");
+      return un(o, k, I, O);
+    if (!K(k)) {
+      if (p && p !== "method" && p !== "var") {
+        B("T021");
         return;
       }
-      if (A === "name" && !d)
+      if (A === "name" && !p)
         return;
-      !d && A && P("T021", A);
+      !p && A && B("T021", A);
       return;
     }
     switch (A) {
       case "id":
-        k.uid = I;
+        k.uid = O;
         return;
       case "testId":
-        k.testId = I;
+        k.testId = O;
         return;
       case "when":
-        k.when = I;
+        k.when = O;
         return;
       default:
-        if (d === "var")
-          k.vars ?? (k.vars = {}), k.vars[A] = I;
-        else if (d === "method")
-          k.api ?? (k.api = {}), k.api[A] = I;
-        else if (d === "event")
-          k.events ?? (k.events = {}), k.events[A] = K(I);
-        else if (nn.test(A)) {
+        if (p === "var")
+          k.vars ?? (k.vars = {}), k.vars[A] = O;
+        else if (p === "method")
+          k.api ?? (k.api = {}), k.api[A] = O;
+        else if (p === "event")
+          k.events ?? (k.events = {}), k.events[A] = j(O);
+        else if (sn.test(A)) {
           k.events ?? (k.events = {});
-          const S = A[2].toLowerCase() + A.substring(3);
-          k.events[S] = K(I);
+          const U = A[2].toLowerCase() + A.substring(3);
+          k.events[U] = j(O);
         } else
-          k.props ?? (k.props = {}), k.props[A] = I;
+          k.props ?? (k.props = {}), k.props[A] = O;
         return;
     }
   }
   function x(k, f) {
     let g = null;
     if (!f) return g;
-    let d = null;
+    let p = null;
     return f.forEach((A) => {
       if (A.kind === u.TextNode) {
-        g = Te(g, t(A));
+        g = Ie(g, t(A));
         return;
       }
       if (A.kind !== u.ElementNode) return;
-      const I = re(A, t);
-      if (I !== "field" && I !== "item") {
-        P("T016");
+      const O = te(A, t);
+      if (O !== "field" && O !== "item") {
+        B("T016");
         return;
       }
-      if (I === "field") {
-        if (!d)
-          d = I, g = {};
-        else if (d !== I) {
-          P("T017");
+      if (O === "field") {
+        if (!p)
+          p = O, g = {};
+        else if (p !== O) {
+          B("T017");
           return;
         }
-      } else if (I === "item") {
-        if (!d)
-          d = I, g = [];
-        else if (d !== I) {
-          P("T017");
+      } else if (O === "item") {
+        if (!p)
+          p = O, g = [];
+        else if (p !== O) {
+          B("T017");
           return;
         }
       }
-      let D = H(k, A, I === "field");
-      if (!D)
+      let I = Q(k, A, O === "field");
+      if (!I)
         return null;
-      d === "field" ? g[D.name] = D.value : g.push(D.value);
+      p === "field" ? g[I.name] = I.value : g.push(I.value);
     }), g;
   }
-  function H(k, f, g = !0) {
-    const d = re(f, t), A = de(f), I = A.filter(
-      (B) => B.kind === u.ElementNode && Pe.test(re(B, t))
-    ), D = A.filter(
-      (B) => B.kind === u.ElementNode && !Pe.test(re(B, t))
-    ), E = pe(f).map(m), S = E.filter((B) => fr.indexOf(B.name) >= 0);
-    if (E.length > S.length)
-      return P("T011", d), null;
-    const L = S.find((B) => B.name === "name");
+  function Q(k, f, g = !0) {
+    const p = te(f, t), A = ge(f), O = A.filter(
+      (v) => v.kind === u.ElementNode && qe.test(te(v, t))
+    ), I = A.filter(
+      (v) => v.kind === u.ElementNode && !qe.test(te(v, t))
+    ), P = ke(f).map(S), U = P.filter((v) => pr.indexOf(v.name) >= 0);
+    if (P.length > U.length)
+      return B("T011", p), null;
+    const R = U.find((v) => v.name === "name");
     if (g) {
-      if (!(L != null && L.value))
-        return P("T012", d), null;
-    } else if (L)
-      return P("T018", d), null;
-    const b = L == null ? void 0 : L.value, N = S.find((B) => B.name === "value");
-    if (N && N.value === void 0)
-      return P("T019", d), null;
-    if (b && I.length >= 1) {
-      if (D.length > 0)
-        return P("T020"), null;
-      const B = I.map((q) => R(k, q));
+      if (!(R != null && R.value))
+        return B("T012", p), null;
+    } else if (R)
+      return B("T018", p), null;
+    const m = R == null ? void 0 : R.value, E = U.find((v) => v.name === "value");
+    if (E && E.value === void 0)
+      return B("T019", p), null;
+    if (m && O.length >= 1) {
+      if (I.length > 0)
+        return B("T020"), null;
+      const v = O.map((y) => b(k, y));
       return {
-        name: b,
-        value: B.length === 1 ? B[0] : B
+        name: m,
+        value: v.length === 1 ? v[0] : v
       };
     }
-    let O = N == null ? void 0 : N.value;
-    return O === null ? null : typeof O == "string" ? { name: b, value: O } : { name: b, value: x(k, A) };
+    let N = E == null ? void 0 : E.value;
+    return N === null ? null : typeof N == "string" ? { name: m, value: N } : { name: m, value: x(k, A) };
   }
-  function v(k, f, g) {
-    var I;
-    if (!j(f)) {
-      P("T009", "loaders");
+  function T(k, f, g) {
+    var O;
+    if (!K(f)) {
+      B("T009", "loaders");
       return;
     }
-    const d = de(g);
-    if (d.length === 0 && (f.loaders ?? (f.loaders = [])), (I = g.children) == null ? void 0 : I.some((D) => D.kind === u.AttributeListNode)) {
-      P("T014", "attributes");
+    const p = ge(g);
+    if (p.length === 0 && (f.loaders ?? (f.loaders = [])), (O = g.children) == null ? void 0 : O.some((I) => I.kind === u.AttributeListNode)) {
+      B("T014", "attributes");
       return;
     }
-    d.forEach((D) => {
-      if (D.kind === u.TextNode) {
-        P("T010", "loader");
+    p.forEach((I) => {
+      if (I.kind === u.TextNode) {
+        B("T010", "loader");
         return;
       }
-      const E = R(k, D);
-      if (!E.uid) {
-        P("T013");
+      const P = b(k, I);
+      if (!P.uid) {
+        B("T013");
         return;
       }
-      if (E.vars) {
-        P("T014", "vars");
+      if (P.vars) {
+        B("T014", "vars");
         return;
       }
-      if (E.loaders) {
-        P("T014", "loaders");
+      if (P.loaders) {
+        B("T014", "loaders");
         return;
       }
-      if (E.uses) {
-        P("T014", "uses");
+      if (P.uses) {
+        B("T014", "uses");
         return;
       }
-      f.loaders ?? (f.loaders = []), f.loaders.push(E);
+      f.loaders ?? (f.loaders = []), f.loaders.push(P);
     });
   }
-  function _(k, f, g, d, A, I) {
-    const D = H(k, g);
-    if (!D)
+  function _(k, f, g, p, A, O) {
+    const I = Q(k, g);
+    if (!I)
       return;
-    I == null || I((D == null ? void 0 : D.name) ?? "");
-    const E = D.name, S = D.value;
-    if ((D == null ? void 0 : D.value) !== void 0)
-      A(E, Te(d(E), S));
+    O == null || O((I == null ? void 0 : I.name) ?? "");
+    const P = I.name, U = I.value;
+    if ((I == null ? void 0 : I.value) !== void 0)
+      A(P, Ie(p(P), U));
     else {
-      const L = de(g), b = x(k, L);
-      let N = d(E);
-      N = Te(N, b), A(E, N);
+      const R = ge(g), m = x(k, R);
+      let E = p(P);
+      E = Ie(E, m), A(P, E);
     }
   }
-  function $(k, f) {
-    if (!j(k)) {
-      P("T009", "uses");
+  function G(k, f) {
+    if (!K(k)) {
+      B("T009", "uses");
       return;
     }
-    const g = pe(f).map(m), d = g.find((A) => A.name === "value");
-    if (!(d != null && d.value) || g.length !== 1) {
-      P("T015", "uses");
+    const g = ke(f).map(S), p = g.find((A) => A.name === "value");
+    if (!(p != null && p.value) || g.length !== 1) {
+      B("T015", "uses");
       return;
     }
-    k.uses ?? (k.uses = d.value.split(",").map((A) => A.trim()));
+    k.uses ?? (k.uses = p.value.split(",").map((A) => A.trim()));
   }
-  function m(k) {
+  function S(k) {
     let f = k.children[0];
     const g = f.children.length === 3;
-    let d;
-    g && (d = t(f.children[0]));
+    let p;
+    g && (p = t(f.children[0]));
     let A = t(f.children[f.children.length - 1]);
-    const I = A.split(".");
-    I.length > 2 && P("T007", k, f);
-    let D, E;
-    I.length === 2 ? (E = I[0], D = I[1], D.trim() === "" && P("T007", k, D)) : D = A;
-    const S = t(k.children[2]), L = S.substring(1, S.length - 1);
-    return { namespace: d, startSegment: E, name: D, value: L, unsegmentedName: A };
-  }
-  function U(k) {
+    const O = A.split(".");
+    O.length > 2 && B("T007", k, f);
+    let I, P;
+    O.length === 2 ? (P = O[0], I = O[1], I.trim() === "" && B("T007", k, I)) : I = A;
+    const U = t(k.children[2]), R = U.substring(1, U.length - 1);
+    return { namespace: p, startSegment: P, name: I, value: R, unsegmentedName: A };
+  }
+  function q(k) {
     for (let f of k) {
-      const g = f.children[f.children.length - 1], d = C(t(g));
-      d !== null && (g.text = d);
+      const g = f.children[f.children.length - 1], p = pe(t(g));
+      p !== null && (g.text = p);
     }
   }
-  function J(k) {
-    const f = de(k), g = re(k, t), A = !(g in ie) || g === "property", I = g !== "event" && g !== "method", D = pe(k);
-    mr(D), U(D), X(f), he(f, I);
-    let E = !1, S = !1;
-    for (let O = 0; O < f.length; ++O) {
-      const B = f[O];
-      let q;
-      if (B.kind == u.Script) {
-        S = !0;
+  function $(k) {
+    const f = ge(k), g = te(k, t), A = !(g in se) || g === "property", O = g !== "event" && g !== "method", I = ke(k);
+    Nr(I), q(I), X(f), Z(f, O);
+    let P = !1, U = !1;
+    for (let N = 0; N < f.length; ++N) {
+      const v = f[N];
+      let y;
+      if (v.kind == u.Script) {
+        U = !0;
         continue;
       }
-      if (B.kind === u.ElementNode) {
-        q = J(B), f[O] = q;
+      if (v.kind === u.ElementNode) {
+        y = $(v), f[N] = y;
         continue;
       }
-      let W = t(B);
-      B.kind === u.StringLiteral ? W = W.slice(1, -1) : B.kind === u.CData ? E = !0 : (B.kind, u.TextNode), A ? E ? q = xr(W) : q = rn(W) : q = {
+      let D = t(v);
+      v.kind === u.StringLiteral ? D = D.slice(1, -1) : v.kind === u.CData ? P = !0 : (v.kind, u.TextNode), A ? P ? y = Sr(D) : y = an(D) : y = {
         kind: u.TextNode,
-        text: W
-      }, f[O] = q;
+        text: D
+      }, f[N] = y;
     }
-    const L = [], b = [];
-    let N = !1;
-    for (const O of f) {
-      if (O.kind === u.ElementNode) {
-        if ((re(O, t) ?? void 0) in ie) {
-          L.push(O);
+    const R = [], m = [];
+    let E = !1;
+    for (const N of f) {
+      if (N.kind === u.ElementNode) {
+        if ((te(N, t) ?? void 0) in se) {
+          R.push(N);
           continue;
         }
-        N = !0;
+        E = !0;
       }
-      b.push(O);
+      m.push(N);
     }
-    if (S && N) {
-      const O = tn(b);
-      return L.push(O), ln(k, L);
+    if (U && E) {
+      const N = on(m);
+      return R.push(N), cn(k, R);
     }
     return k;
   }
-  function Y(k) {
+  function C(k) {
     for (let f = 0; f < k.length; ++f)
       if (k[f].kind === u.StringLiteral || k[f].kind === u.TextNode) {
         const g = /[\f\n\r\t\v\u0020\u1680\u2000-\u200a\u2028\u2029\u202f\u205f\u3000\ufeff]+/g;
@@ -4743,93 +4777,93 @@ function vr(e, n, r) {
         );
       }
   }
-  function Z(k) {
+  function fe(k) {
     for (let f = 0; f < k.length; ++f)
-      k[f].kind === u.CData && (k[f].text = t(k[f]).slice(hr, -3));
+      k[f].kind === u.CData && (k[f].text = t(k[f]).slice(kr, -3));
   }
   function X(k) {
     for (let f of k)
       if (f.kind === u.StringLiteral || f.kind === u.TextNode) {
-        const g = C(t(f));
+        const g = pe(t(f));
         g !== null && (f.text = g);
       }
   }
-  function C(k) {
+  function pe(k) {
     let f = "", g = 0;
-    for (let d = 0; d < k.length; ++d)
-      if (k.charCodeAt(d) === p.ampersand)
-        switch (k.charCodeAt(d + 1)) {
-          case p.a:
-            switch (k.charCodeAt(d + 2)) {
-              case p.m:
-                k.charCodeAt(d + 3) === p.p && k.charCodeAt(d + 4) === p.semicolon && (f = f + k.substring(g, d) + "&", d += 4, g = d + 1);
+    for (let p = 0; p < k.length; ++p)
+      if (k.charCodeAt(p) === d.ampersand)
+        switch (k.charCodeAt(p + 1)) {
+          case d.a:
+            switch (k.charCodeAt(p + 2)) {
+              case d.m:
+                k.charCodeAt(p + 3) === d.p && k.charCodeAt(p + 4) === d.semicolon && (f = f + k.substring(g, p) + "&", p += 4, g = p + 1);
                 break;
-              case p.p:
-                k.charCodeAt(d + 3) === p.o && k.charCodeAt(d + 4) === p.s && k.charCodeAt(d + 5) === p.semicolon && (f = f + k.substring(g, d) + "'", d += 5, g = d + 1);
+              case d.p:
+                k.charCodeAt(p + 3) === d.o && k.charCodeAt(p + 4) === d.s && k.charCodeAt(p + 5) === d.semicolon && (f = f + k.substring(g, p) + "'", p += 5, g = p + 1);
                 break;
             }
             break;
-          case p.g:
-            k.charCodeAt(d + 2) === p.t && k.charCodeAt(d + 3) === p.semicolon && (f = f + k.substring(g, d) + ">", d += 3, g = d + 1);
+          case d.g:
+            k.charCodeAt(p + 2) === d.t && k.charCodeAt(p + 3) === d.semicolon && (f = f + k.substring(g, p) + ">", p += 3, g = p + 1);
             break;
-          case p.l:
-            k.charCodeAt(d + 2) === p.t && k.charCodeAt(d + 3) === p.semicolon && (f = f + k.substring(g, d) + "<", d += 3, g = d + 1);
+          case d.l:
+            k.charCodeAt(p + 2) === d.t && k.charCodeAt(p + 3) === d.semicolon && (f = f + k.substring(g, p) + "<", p += 3, g = p + 1);
             break;
-          case p.q:
-            k.charCodeAt(d + 2) === p.u && k.charCodeAt(d + 3) === p.o && k.charCodeAt(d + 4) === p.t && k.charCodeAt(d + 5) === p.semicolon && (f = f + k.substring(g, d) + '"', d += 5, g = d + 1);
+          case d.q:
+            k.charCodeAt(p + 2) === d.u && k.charCodeAt(p + 3) === d.o && k.charCodeAt(p + 4) === d.t && k.charCodeAt(p + 5) === d.semicolon && (f = f + k.substring(g, p) + '"', p += 5, g = p + 1);
             break;
-          case p.n:
-            k.charCodeAt(d + 2) === p.b && k.charCodeAt(d + 3) === p.s && k.charCodeAt(d + 4) === p.p && k.charCodeAt(d + 5) === p.semicolon && (f = f + k.substring(g, d) + " ", d += 5, g = d + 1);
+          case d.n:
+            k.charCodeAt(p + 2) === d.b && k.charCodeAt(p + 3) === d.s && k.charCodeAt(p + 4) === d.p && k.charCodeAt(p + 5) === d.semicolon && (f = f + k.substring(g, p) + " ", p += 5, g = p + 1);
             break;
         }
     return g === 0 ? null : (f += k.substring(g), f);
   }
-  function he(k, f) {
-    f && Y(k), Z(k);
+  function Z(k, f) {
+    f && C(k), fe(k);
     for (let g = k.length - 1; g > 0; --g) {
-      const d = k[g - 1], A = k[g];
-      d.kind === u.StringLiteral && A.kind === u.CData ? (k[g - 1] = {
+      const p = k[g - 1], A = k[g];
+      p.kind === u.StringLiteral && A.kind === u.CData ? (k[g - 1] = {
         kind: u.CData,
-        text: t(d).slice(1, -1) + t(A)
-      }, k.pop()) : d.kind === u.CData && A.kind === u.StringLiteral ? (k[g - 1] = {
+        text: t(p).slice(1, -1) + t(A)
+      }, k.pop()) : p.kind === u.CData && A.kind === u.StringLiteral ? (k[g - 1] = {
         kind: u.CData,
-        text: t(d) + t(A).slice(1, -1)
-      }, k.pop()) : d.kind === u.CData && A.kind === u.TextNode ? (k[g - 1] = {
+        text: t(p) + t(A).slice(1, -1)
+      }, k.pop()) : p.kind === u.CData && A.kind === u.TextNode ? (k[g - 1] = {
         kind: u.CData,
-        text: t(d) + t(A)
-      }, k.pop()) : d.kind === u.CData && A.kind === u.CData ? (k[g - 1] = {
+        text: t(p) + t(A)
+      }, k.pop()) : p.kind === u.CData && A.kind === u.CData ? (k[g - 1] = {
         kind: u.CData,
-        text: t(d) + t(A)
-      }, k.pop()) : d.kind === u.TextNode && A.kind === u.TextNode ? (t(d).endsWith(" ") && t(A).startsWith(" ") && (d.text = t(d).trimEnd()), k[g - 1] = {
+        text: t(p) + t(A)
+      }, k.pop()) : p.kind === u.TextNode && A.kind === u.TextNode ? (t(p).endsWith(" ") && t(A).startsWith(" ") && (p.text = t(p).trimEnd()), k[g - 1] = {
         kind: u.TextNode,
-        text: t(d) + t(A)
-      }, k.pop()) : d.kind === u.TextNode && A.kind === u.CData && (k[g - 1] = {
+        text: t(p) + t(A)
+      }, k.pop()) : p.kind === u.TextNode && A.kind === u.CData && (k[g - 1] = {
         kind: u.CData,
-        text: t(d) + t(A)
+        text: t(p) + t(A)
       }, k.pop());
     }
   }
-  function K(k) {
+  function j(k) {
     if (typeof k != "string")
       return k;
-    const f = new Fe(k);
+    const f = new Ge(k);
     try {
       return {
         __PARSED: !0,
         statements: f.parseStatements(),
-        parseId: ++Er,
+        parseId: ++_r,
         // TODO: retrieve the event source code only in dev mode
         source: k
       };
     } catch {
       if (f.errors.length > 0) {
         const g = f.errors[0];
-        throw new Re(`${g.text} [${g.line}: ${g.column}]`, g.code);
+        throw new Pe(`${g.text} [${g.line}: ${g.column}]`, g.code);
       }
     }
   }
 }
-function xr(e) {
+function Sr(e) {
   return {
     kind: u.ElementNode,
     children: [
@@ -4858,7 +4892,7 @@ function xr(e) {
     ]
   };
 }
-function rn(e) {
+function an(e) {
   return {
     kind: u.ElementNode,
     children: [
@@ -4887,9 +4921,9 @@ function rn(e) {
     ]
   };
 }
-function P(e, ...n) {
-  let r = ur[e] ?? "Unknown error";
-  throw n && n.forEach((l, a) => r = t(r, `{${a}}`, l.toString())), new Re(r, e);
+function B(e, ...n) {
+  let r = dr[e] ?? "Unknown error";
+  throw n && n.forEach((l, a) => r = t(r, `{${a}}`, l.toString())), new Pe(r, e);
   function t(l, a, s) {
     do
       l = l.replace(a, s);
@@ -4897,13 +4931,13 @@ function P(e, ...n) {
     return l;
   }
 }
-function j(e) {
+function K(e) {
   return e.type;
 }
-function Te(e, n) {
+function Ie(e, n) {
   return e ? Array.isArray(e) ? typeof e == "string" ? [e, n] : (e.push(n), e) : [e, n] : n;
 }
-function tn(e) {
+function on(e) {
   const n = {
     kind: u.TagNameNode,
     children: [{ kind: u.Identifier, text: "Fragment" }]
@@ -4924,15 +4958,15 @@ function tn(e) {
     ]
   };
 }
-function pe(e) {
+function ke(e) {
   var n, r;
   return ((r = (n = e.children) == null ? void 0 : n.find((t) => t.kind === u.AttributeListNode)) == null ? void 0 : r.children) ?? [];
 }
-function de(e) {
+function ge(e) {
   var n, r;
   return ((r = (n = e.children) == null ? void 0 : n.find((t) => t.kind === u.ContentListNode)) == null ? void 0 : r.children) ?? [];
 }
-function ln(e, n) {
+function cn(e, n) {
   var t;
   const r = (t = e.children) == null ? void 0 : t.findIndex((l) => l.kind === u.ContentListNode);
   return r === void 0 || r === -1 ? e : {
@@ -4944,7 +4978,7 @@ function ln(e, n) {
     ]
   };
 }
-function mr(e) {
+function Nr(e) {
   var n;
   for (let r of e)
     if (((n = r.children) == null ? void 0 : n.length) === 1) {
@@ -4957,136 +4991,137 @@ function mr(e) {
       r.children.push(t, l);
     }
 }
-function sn(e, n, r, t) {
+function un(e, n, r, t) {
   let l = t.split(":");
   if (l.length > 2)
-    return P("T028", t, "Namespace cannot contain multiple ':' (colon).");
+    return B("T028", t, "Namespace cannot contain multiple ':' (colon).");
   let a = t;
   if (l.length === 2) {
-    if (l[0] != ye)
-      return P("T029", t, ye);
+    if (l[0] != $e)
+      return B("T029", t, $e);
     a = l[1];
   }
   if (a.includes("#"))
-    return P("T028", a, "Namespace cannot contain character '#'.");
+    return B("T028", a, "Namespace cannot contain character '#'.");
   switch (a) {
-    case ye:
+    case $e:
       a = r;
       break;
-    case pr:
-      a = dr;
+    case gr:
+      a = Er;
       break;
-    case kr:
-      a = gr;
+    case mr:
+      a = xr;
       break;
   }
   const s = e[e.length - 1];
   if (s.has(r))
-    return P("T025", r);
+    return B("T025", r);
   s.set(r, a), n.namespaces ?? (n.namespaces = {}), n.namespaces[r] = a;
 }
-function _r(e, n) {
-  e.children.length !== 2 && P("T001");
+function Ar(e, n) {
+  e.children.length !== 2 && B("T001");
   const r = e.children[0];
-  return r.kind !== u.ElementNode && P("T001"), r;
+  return r.kind !== u.ElementNode && B("T001"), r;
 }
-function re(e, n) {
+function te(e, n) {
   const r = e.children.find((l) => l.kind === u.TagNameNode).children;
   return n(r.at(-1));
 }
-function an(e, n, r) {
+function fn(e, n, r) {
   const t = e.children.find((o) => o.kind === u.TagNameNode).children, l = n(t.at(-1));
   if (t.length === 1)
     return l;
   const a = n(t[0]);
-  r.length === 0 && P("T026");
+  r.length === 0 && B("T026");
   let s;
   for (let o = r.length - 1; o >= 0 && (s = r[o].get(a), s === void 0); --o)
     ;
-  return s === void 0 && P("T027", a), s + "." + l;
+  return s === void 0 && B("T027", a), s + "." + l;
 }
-function Or(e) {
+function Rr(e) {
   return e[2].toLowerCase() + e.substring(3);
 }
 export {
-  dn as $,
-  Or as A,
-  rr as B,
-  p as C,
-  xe as D,
-  fe as E,
-  tr as F,
-  Lr as G,
-  Fe as H,
-  Ln as I,
-  M as J,
-  On as K,
-  De as L,
-  be as M,
-  Le as N,
-  ke as O,
-  Re as P,
-  _n as Q,
-  mn as R,
+  En as $,
+  Dr as A,
+  Rr as B,
+  d as C,
+  _e as D,
+  de as E,
+  lr as F,
+  sr as G,
+  Or as H,
+  Ge as I,
+  On as J,
+  M as K,
+  Rn as L,
+  We as M,
+  Be as N,
+  ve as O,
+  Pe as P,
+  Ee as Q,
+  Ln as R,
   u as S,
-  wn as T,
-  Pe as U,
-  xn as V,
-  _e as W,
-  ge as X,
-  En as Y,
-  on as Z,
-  pn as _,
-  Be as a,
-  gn as a0,
-  kn as a1,
-  hn as a2,
-  fn as a3,
-  un as a4,
-  cn as a5,
-  Wn as a6,
-  ve as a7,
-  qe as a8,
-  vn as a9,
-  Q as aa,
-  oe as ab,
-  An as ac,
-  In as ad,
-  Nn as ae,
-  G as af,
-  Sn as ag,
-  ae as ah,
-  se as ai,
-  le as aj,
-  Tn as ak,
-  Ue as al,
-  Oe as am,
-  We as an,
-  cr as ao,
-  Tr as ap,
-  Fn as b,
-  Mn as c,
-  Nr as d,
-  qn as e,
-  $n as f,
-  Xn as g,
-  Gn as h,
-  Ke as i,
-  zn as j,
-  Ar as k,
-  Qn as l,
-  Hn as m,
-  je as n,
-  wr as o,
-  sr as p,
-  ur as q,
-  Kn as r,
+  In as T,
+  qe as U,
+  An as V,
+  Nn as W,
+  Ne as X,
+  me as Y,
+  Sn as Z,
+  hn as _,
+  ye as a,
+  mn as a0,
+  _n as a1,
+  xn as a2,
+  gn as a3,
+  kn as a4,
+  pn as a5,
+  dn as a6,
+  Fn as a7,
+  be as a8,
+  Qe as a9,
+  Dn as aa,
+  Y as ab,
+  ue as ac,
+  vn as ad,
+  Bn as ae,
+  Tn as af,
+  z as ag,
+  wn as ah,
+  ce as ai,
+  oe as aj,
+  ae as ak,
+  bn as al,
+  Xe as am,
+  De as an,
+  Me as ao,
+  hr as ap,
+  br as aq,
+  Xn as b,
+  Gn as c,
+  wr as d,
+  zn as e,
+  Qn as f,
+  Hn as g,
+  Yn as h,
+  Ue as i,
+  Zn as j,
+  Tr as k,
+  Jn as l,
+  Fe as m,
+  nn as n,
+  vr as o,
+  Ir as p,
+  cr as q,
+  dr as r,
   Vn as s,
-  Yn as t,
-  Zn as u,
-  Me as v,
-  en as w,
-  nn as x,
-  gr as y,
-  vr as z
+  rr as t,
+  Kn as u,
+  Cn as v,
+  ze as w,
+  ln as x,
+  sn as y,
+  xr as z
 };