zudoku 0.53.1 → 0.53.3

package/lib/{SyntaxHighlight-CrjhGEwT.js → SyntaxHighlight-CZgjJ7-f.js}

@@ -5,11 +5,11 @@ import { c as as } from "./cn-wvCW-ho6.js";
 import { g as is, i as ls } from "./invariant-DAFpPywt.js";
 import { C as us } from "./CodeBlock-DAKxs_Tu.js";
 import { EmbeddedCodeBlock as cs } from "./ui/EmbeddedCodeBlock.js";
-function Qc() {
-}
 function eh() {
 }
-function th(t) {
+function th() {
+}
+function nh(t) {
   const e = [], n = String(t || "");
   let r = n.indexOf(","), o = 0, s = !1;
   for (; !s; ) {
@@ -36,7 +36,7 @@ function Ct(t) {
 function Nn(t) {
   return t.replace(ds, "") === "";
 }
-let Ve = class {
+let qe = class {
   /**
    * @param {SchemaType['property']} property
    *   Property.
@@ -51,14 +51,14 @@ let Ve = class {
     this.normal = n, this.property = e, r && (this.space = r);
   }
 };
-Ve.prototype.normal = {};
-Ve.prototype.property = {};
-Ve.prototype.space = void 0;
+qe.prototype.normal = {};
+qe.prototype.property = {};
+qe.prototype.space = void 0;
 function Nr(t, e) {
   const n = {}, r = {};
   for (const o of t)
     Object.assign(n, o.property), Object.assign(r, o.normal);
-  return new Ve(n, r, e);
+  return new qe(n, r, e);
 }
 function zt(t) {
   return t.toLowerCase();
@@ -89,7 +89,7 @@ W.prototype.property = "";
 W.prototype.spaceSeparated = !1;
 W.prototype.space = void 0;
 let gs = 0;
-const x = ye(), $ = ye(), Pr = ye(), b = ye(), I = ye(), xe = ye(), V = ye();
+const x = ye(), $ = ye(), Pr = ye(), b = ye(), I = ye(), xe = ye(), q = ye();
 function ye() {
   return 2 ** ++gs;
 }
@@ -97,7 +97,7 @@ const Ht = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   boolean: x,
   booleanish: $,
-  commaOrSpaceSeparated: V,
+  commaOrSpaceSeparated: q,
   commaSeparated: xe,
   number: b,
   overloadedBoolean: Pr,
@@ -144,7 +144,7 @@ function Ie(t) {
     );
     t.mustUseProperty && t.mustUseProperty.includes(r) && (s.mustUseProperty = !0), e[r] = s, n[zt(r)] = r, n[zt(s.attribute)] = r;
   }
-  return new Ve(e, n, t.space);
+  return new qe(e, n, t.space);
 }
 const Lr = Ie({
   properties: {
@@ -746,7 +746,7 @@ const ms = Ie({
     timelineBegin: "timelinebegin"
   },
   properties: {
-    about: V,
+    about: q,
     accentHeight: b,
     accumulate: null,
     additive: null,
@@ -858,7 +858,7 @@ const ms = Ie({
     k2: b,
     k3: b,
     k4: b,
-    kernelMatrix: V,
+    kernelMatrix: q,
     kernelUnitLength: null,
     keyPoints: null,
     // SEMI_COLON_SEPARATED
@@ -1015,21 +1015,21 @@ const ms = Ie({
     preserveAspectRatio: null,
     primitiveUnits: null,
     propagate: null,
-    property: V,
+    property: q,
     r: null,
     radius: null,
     referrerPolicy: null,
     refX: null,
     refY: null,
-    rel: V,
-    rev: V,
+    rel: q,
+    rev: q,
     renderingIntent: null,
     repeatCount: null,
     repeatDur: null,
-    requiredExtensions: V,
-    requiredFeatures: V,
-    requiredFonts: V,
-    requiredFormats: V,
+    requiredExtensions: q,
+    requiredFeatures: q,
+    requiredFonts: q,
+    requiredFormats: q,
     resource: null,
     restart: null,
     result: null,
@@ -1057,7 +1057,7 @@ const ms = Ie({
     strikethroughThickness: b,
     string: null,
     stroke: null,
-    strokeDashArray: V,
+    strokeDashArray: q,
     strokeDashOffset: null,
     strokeLineCap: null,
     strokeLineJoin: null,
@@ -1071,7 +1071,7 @@ const ms = Ie({
     syncMaster: null,
     syncTolerance: null,
     syncToleranceDefault: null,
-    systemLanguage: V,
+    systemLanguage: q,
     tabIndex: b,
     tableValues: null,
     target: null,
@@ -1085,7 +1085,7 @@ const ms = Ie({
     title: null,
     transformBehavior: null,
     type: null,
-    typeOf: V,
+    typeOf: q,
     to: null,
     transform: null,
     transformOrigin: null,
@@ -1199,7 +1199,7 @@ function ks(t) {
   return t.charAt(1).toUpperCase();
 }
 const vs = Nr([Lr, ms, Mr, Or, Dr], "html"), pn = Nr([Lr, ys, Mr, Or, Dr], "svg");
-function sh(t) {
+function ah(t) {
   const e = String(t || "").trim();
   return e ? e.split(/[ \t\n\r\f]+/g) : [];
 }
@@ -1211,40 +1211,40 @@ function xs() {
   if ($n) return Rt;
   $n = 1;
   var t = /\/\*[^*]*\*+([^/*][^*]*\*+)*\//g, e = /\n/g, n = /^\s*/, r = /^(\*?[-#/*\\\w]+(\[[0-9a-z_-]+\])?)\s*/, o = /^:\s*/, s = /^((?:'(?:\\'|.)*?'|"(?:\\"|.)*?"|\([^)]*?\)|[^};])+)/, a = /^[;\s]*/, i = /^\s+|\s+$/g, l = `
-`, u = "/", c = "*", h = "", d = "comment", f = "declaration";
-  Rt = function(m, g) {
-    if (typeof m != "string")
+`, u = "/", c = "*", h = "", f = "comment", d = "declaration";
+  Rt = function(g, C) {
+    if (typeof g != "string")
       throw new TypeError("First argument must be a string");
-    if (!m) return [];
-    g = g || {};
-    var C = 1, y = 1;
+    if (!g) return [];
+    C = C || {};
+    var y = 1, m = 1;
     function _(R) {
       var k = R.match(e);
-      k && (C += k.length);
+      k && (y += k.length);
       var G = R.lastIndexOf(l);
-      y = ~G ? R.length - G : y + R.length;
+      m = ~G ? R.length - G : m + R.length;
     }
     function S() {
-      var R = { line: C, column: y };
+      var R = { line: y, column: m };
       return function(k) {
         return k.position = new A(R), j(), k;
       };
     }
     function A(R) {
-      this.start = R, this.end = { line: C, column: y }, this.source = g.source;
+      this.start = R, this.end = { line: y, column: m }, this.source = C.source;
     }
-    A.prototype.content = m;
+    A.prototype.content = g;
     function D(R) {
       var k = new Error(
-        g.source + ":" + C + ":" + y + ": " + R
+        C.source + ":" + y + ":" + m + ": " + R
       );
-      if (k.reason = R, k.filename = g.source, k.line = C, k.column = y, k.source = m, !g.silent) throw k;
+      if (k.reason = R, k.filename = C.source, k.line = y, k.column = m, k.source = g, !C.silent) throw k;
     }
     function P(R) {
-      var k = R.exec(m);
+      var k = R.exec(g);
       if (k) {
         var G = k[0];
-        return _(G), m = m.slice(G.length), k;
+        return _(G), g = g.slice(G.length), k;
       }
     }
     function j() {
@@ -1258,14 +1258,14 @@ function xs() {
     }
     function ee() {
       var R = S();
-      if (!(u != m.charAt(0) || c != m.charAt(1))) {
-        for (var k = 2; h != m.charAt(k) && (c != m.charAt(k) || u != m.charAt(k + 1)); )
+      if (!(u != g.charAt(0) || c != g.charAt(1))) {
+        for (var k = 2; h != g.charAt(k) && (c != g.charAt(k) || u != g.charAt(k + 1)); )
           ++k;
-        if (k += 2, h === m.charAt(k - 1))
+        if (k += 2, h === g.charAt(k - 1))
           return D("End of comment missing");
-        var G = m.slice(2, k - 2);
-        return y += 2, _(G), m = m.slice(k), y += 2, R({
-          type: d,
+        var G = g.slice(2, k - 2);
+        return m += 2, _(G), g = g.slice(k), m += 2, R({
+          type: f,
           comment: G
         });
       }
@@ -1275,7 +1275,7 @@ function xs() {
       if (k) {
         if (ee(), !P(o)) return D("property missing ':'");
         var G = P(s), Te = R({
-          type: f,
+          type: d,
           property: p(k[0].replace(t, h)),
           value: G ? p(G[0].replace(t, h)) : h
         });
@@ -1291,8 +1291,8 @@ function xs() {
     }
     return j(), te();
   };
-  function p(m) {
-    return m ? m.replace(i, h) : h;
+  function p(g) {
+    return g ? g.replace(i, h) : h;
   }
   return Rt;
 }
@@ -1363,7 +1363,7 @@ function Br(t) {
       };
   }
 }
-function ah(t) {
+function ih(t) {
   const e = Fr(t), n = Ps(t);
   if (e && n)
     return { start: e, end: n };
@@ -1526,7 +1526,7 @@ function Gs(t, e, n) {
   const r = t.schema;
   let o = r;
   e.tagName.toLowerCase() === "svg" && r.space === "html" && (o = pn, t.schema = o), t.ancestors.push(e);
-  const s = Hr(t, e.tagName, !1), a = qs(t, e);
+  const s = Hr(t, e.tagName, !1), a = Vs(t, e);
   let i = gn(t, e);
   return Ms.has(e.tagName) && (i = i.filter(function(l) {
     return typeof l == "string" ? !Ct(l) : !0;
@@ -1552,7 +1552,7 @@ function js(t, e, n) {
   const r = t.schema;
   let o = r;
   e.name === "svg" && r.space === "html" && (o = pn, t.schema = o), t.ancestors.push(e);
-  const s = e.name === null ? t.Fragment : Hr(t, e.name, !0), a = Vs(t, e), i = gn(t, e);
+  const s = e.name === null ? t.Fragment : Hr(t, e.name, !0), a = qs(t, e), i = gn(t, e);
   return zr(t, a, s, e), dn(a, i), t.ancestors.pop(), t.schema = r, t.create(e, s, a, n);
 }
 function Us(t, e, n) {
@@ -1596,7 +1596,7 @@ function Ws(t, e) {
     );
   }
 }
-function qs(t, e) {
+function Vs(t, e) {
   const n = {};
   let r, o;
   for (o in e.properties)
@@ -1616,7 +1616,7 @@ function qs(t, e) {
   }
   return n;
 }
-function Vs(t, e) {
+function qs(t, e) {
   const n = {};
   for (const r of e.attributes)
     if (r.type === "mdxJsxExpressionAttribute")
@@ -1836,7 +1836,7 @@ function na() {
 function ra(t) {
   return t !== null && typeof t == "object" && "type" in t;
 }
-const qr = [], oa = !0, Fn = !1, sa = "skip";
+const Vr = [], oa = !0, Fn = !1, sa = "skip";
 function aa(t, e, n, r) {
   let o;
   typeof e == "function" && typeof n != "function" ? (r = n, n = e) : o = e;
@@ -1848,43 +1848,43 @@ function aa(t, e, n, r) {
       l && typeof l == "object" ? l : {}
     );
     if (typeof h.type == "string") {
-      const f = (
+      const d = (
         // `hast`
         typeof h.tagName == "string" ? h.tagName : (
           // `xast`
           typeof h.name == "string" ? h.name : void 0
         )
       );
-      Object.defineProperty(d, "name", {
-        value: "node (" + (l.type + (f ? "<" + f + ">" : "")) + ")"
+      Object.defineProperty(f, "name", {
+        value: "node (" + (l.type + (d ? "<" + d + ">" : "")) + ")"
       });
     }
-    return d;
-    function d() {
-      let f = qr, p, m, g;
-      if ((!e || s(l, u, c[c.length - 1] || void 0)) && (f = ia(n(l, c)), f[0] === Fn))
-        return f;
+    return f;
+    function f() {
+      let d = Vr, p, g, C;
+      if ((!e || s(l, u, c[c.length - 1] || void 0)) && (d = ia(n(l, c)), d[0] === Fn))
+        return d;
       if ("children" in l && l.children) {
-        const C = (
+        const y = (
           /** @type {UnistParent} */
           l
         );
-        if (C.children && f[0] !== sa)
-          for (m = (r ? C.children.length : -1) + a, g = c.concat(C); m > -1 && m < C.children.length; ) {
-            const y = C.children[m];
-            if (p = i(y, m, g)(), p[0] === Fn)
+        if (y.children && d[0] !== sa)
+          for (g = (r ? y.children.length : -1) + a, C = c.concat(y); g > -1 && g < y.children.length; ) {
+            const m = y.children[g];
+            if (p = i(m, g, C)(), p[0] === Fn)
               return p;
-            m = typeof p[1] == "number" ? p[1] : m + a;
+            g = typeof p[1] == "number" ? p[1] : g + a;
           }
       }
-      return f;
+      return d;
     }
   }
 }
 function ia(t) {
-  return Array.isArray(t) ? t : typeof t == "number" ? [oa, t] : t == null ? qr : [t];
+  return Array.isArray(t) ? t : typeof t == "number" ? [oa, t] : t == null ? Vr : [t];
 }
-function Vr(t, e, n, r) {
+function qr(t, e, n, r) {
   let o, s, a;
   typeof e == "function" && typeof n != "function" ? (s = void 0, a = e, o = n) : (s = e, a = n, o = r), aa(t, s, i, o);
   function i(l, u) {
@@ -2151,8 +2151,8 @@ function ga(t) {
     if (typeof a.settings.fontStyle == "string") {
       l = 0;
       let h = a.settings.fontStyle.split(" ");
-      for (let d = 0, f = h.length; d < f; d++)
-        switch (h[d]) {
+      for (let f = 0, d = h.length; f < d; f++)
+        switch (h[f]) {
           case "italic":
             l = l | 1;
             break;
@@ -2171,11 +2171,11 @@ function ga(t) {
     typeof a.settings.foreground == "string" && Un(a.settings.foreground) && (u = a.settings.foreground);
     let c = null;
     typeof a.settings.background == "string" && Un(a.settings.background) && (c = a.settings.background);
-    for (let h = 0, d = i.length; h < d; h++) {
-      let p = i[h].trim().split(" "), m = p[p.length - 1], g = null;
-      p.length > 1 && (g = p.slice(0, p.length - 1), g.reverse()), n[r++] = new ma(
-        m,
+    for (let h = 0, f = i.length; h < f; h++) {
+      let p = i[h].trim().split(" "), g = p[p.length - 1], C = null;
+      p.length > 1 && (C = p.slice(0, p.length - 1), C.reverse()), n[r++] = new ma(
         g,
+        C,
         o,
         l,
         u,
@@ -2200,7 +2200,7 @@ function ya(t, e) {
     let l = t.shift();
     l.fontStyle !== -1 && (n = l.fontStyle), l.foreground !== null && (r = l.foreground), l.background !== null && (o = l.background);
   }
-  let s = new ba(e), a = new eo(n, s.getId(r), s.getId(o)), i = new Ca(new qt(0, null, -1, 0, 0), []);
+  let s = new ba(e), a = new eo(n, s.getId(r), s.getId(o)), i = new Ca(new Vt(0, null, -1, 0, 0), []);
   for (let l = 0, u = t.length; l < u; l++) {
     let c = t[l];
     i.insert(0, c.scope, c.parentScopes, c.fontStyle, s.getId(c.foreground), s.getId(c.background));
@@ -2234,7 +2234,7 @@ var ba = class {
   getColorMap() {
     return this._id2color.slice(0);
   }
-}, wa = Object.freeze([]), qt = class to {
+}, wa = Object.freeze([]), Vt = class to {
   scopeDepth;
   parentScopes;
   fontStyle;
@@ -2255,7 +2255,7 @@ var ba = class {
   acceptOverwrite(e, n, r, o) {
     this.scopeDepth > e ? console.log("how did this happen?") : this.scopeDepth = e, n !== -1 && (this.fontStyle = n), r !== 0 && (this.foreground = r), o !== 0 && (this.background = o);
   }
-}, Ca = class Vt {
+}, Ca = class qt {
   constructor(e, n = [], r = {}) {
     this._mainRule = e, this._children = r, this._rulesWithParentScopes = n;
   }
@@ -2279,7 +2279,7 @@ var ba = class {
         return this._children[o].match(s);
     }
     const n = this._rulesWithParentScopes.concat(this._mainRule);
-    return n.sort(Vt._cmpBySpecificity), n;
+    return n.sort(qt._cmpBySpecificity), n;
   }
   insert(e, n, r, o, s, a) {
     if (n === "") {
@@ -2289,7 +2289,7 @@ var ba = class {
     let i = n.indexOf("."), l, u;
     i === -1 ? (l = n, u = "") : (l = n.substring(0, i), u = n.substring(i + 1));
     let c;
-    this._children.hasOwnProperty(l) ? c = this._children[l] : (c = new Vt(this._mainRule.clone(), qt.cloneArr(this._rulesWithParentScopes)), this._children[l] = c), c.insert(e + 1, u, r, o, s, a);
+    this._children.hasOwnProperty(l) ? c = this._children[l] : (c = new qt(this._mainRule.clone(), Vt.cloneArr(this._rulesWithParentScopes)), this._children[l] = c), c.insert(e + 1, u, r, o, s, a);
   }
   _doInsertHere(e, n, r, o, s) {
     if (n === null) {
@@ -2303,7 +2303,7 @@ var ba = class {
         return;
       }
     }
-    r === -1 && (r = this._mainRule.fontStyle), o === 0 && (o = this._mainRule.foreground), s === 0 && (s = this._mainRule.background), this._rulesWithParentScopes.push(new qt(e, n, r, o, s));
+    r === -1 && (r = this._mainRule.fontStyle), o === 0 && (o = this._mainRule.foreground), s === 0 && (s = this._mainRule.background), this._rulesWithParentScopes.push(new Vt(e, n, r, o, s));
   }
 }, Re = class K {
   static toBinaryStr(e) {
@@ -2342,8 +2342,8 @@ var ba = class {
    * A value of `0`, `NotSet` or `null` indicates that the corresponding field should be left as is.
    */
   static set(e, n, r, o, s, a, i) {
-    let l = K.getLanguageId(e), u = K.getTokenType(e), c = K.containsBalancedBrackets(e) ? 1 : 0, h = K.getFontStyle(e), d = K.getForeground(e), f = K.getBackground(e);
-    return n !== 0 && (l = n), r !== 8 && (u = r), o !== null && (c = o ? 1 : 0), s !== -1 && (h = s), a !== 0 && (d = a), i !== 0 && (f = i), (l << 0 | u << 8 | c << 10 | h << 11 | d << 15 | f << 24) >>> 0;
+    let l = K.getLanguageId(e), u = K.getTokenType(e), c = K.containsBalancedBrackets(e) ? 1 : 0, h = K.getFontStyle(e), f = K.getForeground(e), d = K.getBackground(e);
+    return n !== 0 && (l = n), r !== 8 && (u = r), o !== null && (c = o ? 1 : 0), s !== -1 && (h = s), a !== 0 && (f = a), i !== 0 && (d = i), (l << 0 | u << 8 | c << 10 | h << 11 | f << 15 | d << 24) >>> 0;
   }
 };
 function lt(t, e) {
@@ -2848,13 +2848,13 @@ var Xe = class {
               break;
             case 3:
             case 4:
-              const h = u.scopeName, d = u.kind === 4 ? u.ruleName : null, f = n.getExternalGrammar(h, r);
-              if (f)
-                if (d) {
-                  let p = f.repository[d];
-                  p && (l = U.getCompiledRuleId(p, n, f.repository));
+              const h = u.scopeName, f = u.kind === 4 ? u.ruleName : null, d = n.getExternalGrammar(h, r);
+              if (d)
+                if (f) {
+                  let p = d.repository[f];
+                  p && (l = U.getCompiledRuleId(p, n, d.repository));
                 } else
-                  l = U.getCompiledRuleId(f.repository.$self, n, f.repository);
+                  l = U.getCompiledRuleId(d.repository.$self, n, d.repository);
               break;
           }
         } else
@@ -2954,7 +2954,7 @@ var Xe = class {
   compile(t) {
     if (!this._cached) {
       let e = this._items.map((n) => n.source);
-      this._cached = new qn(t, e, this._items.map((n) => n.ruleId));
+      this._cached = new Vn(t, e, this._items.map((n) => n.ruleId));
     }
     return this._cached;
   }
@@ -2963,9 +2963,9 @@ var Xe = class {
   }
   _resolveAnchors(t, e, n) {
     let r = this._items.map((o) => o.resolveAnchors(e, n));
-    return new qn(t, r, this._items.map((o) => o.ruleId));
+    return new Vn(t, r, this._items.map((o) => o.ruleId));
   }
-}, qn = class {
+}, Vn = class {
   constructor(t, e, n) {
     this.regExps = e, this.rules = n, this.scanner = t.createOnigScanner(e);
   }
@@ -3062,7 +3062,7 @@ var Xe = class {
   }
 };
 typeof process < "u" && process.env.VSCODE_TEXTMATE_DEBUG;
-var Vn = class {
+var qn = class {
   constructor(t, e) {
     this.stack = t, this.stoppedEarly = e;
   }
@@ -3071,7 +3071,7 @@ function io(t, e, n, r, o, s, a, i) {
   const l = e.content.length;
   let u = !1, c = -1;
   if (a) {
-    const f = Da(
+    const d = Da(
       t,
       e,
       n,
@@ -3079,17 +3079,17 @@ function io(t, e, n, r, o, s, a, i) {
       o,
       s
     );
-    o = f.stack, r = f.linePos, n = f.isFirstLine, c = f.anchorPosition;
+    o = d.stack, r = d.linePos, n = d.isFirstLine, c = d.anchorPosition;
   }
   const h = Date.now();
   for (; !u; ) {
     if (i !== 0 && Date.now() - h > i)
-      return new Vn(o, !0);
-    d();
+      return new qn(o, !0);
+    f();
   }
-  return new Vn(o, !1);
-  function d() {
-    const f = Ga(
+  return new qn(o, !1);
+  function f() {
+    const d = Ga(
       t,
       e,
       n,
@@ -3097,44 +3097,44 @@ function io(t, e, n, r, o, s, a, i) {
       o,
       c
     );
-    if (!f) {
+    if (!d) {
       s.produce(o, l), u = !0;
       return;
     }
-    const p = f.captureIndices, m = f.matchedRuleId, g = p && p.length > 0 ? p[0].end > r : !1;
-    if (m === La) {
-      const C = o.getRule(t);
+    const p = d.captureIndices, g = d.matchedRuleId, C = p && p.length > 0 ? p[0].end > r : !1;
+    if (g === La) {
+      const y = o.getRule(t);
       s.produce(o, p[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
         t,
         e,
         n,
         o,
         s,
-        C.endCaptures,
+        y.endCaptures,
         p
       ), s.produce(o, p[0].end);
-      const y = o;
-      if (o = o.parent, c = y.getAnchorPos(), !g && y.getEnterPos() === r) {
-        o = y, s.produce(o, l), u = !0;
+      const m = o;
+      if (o = o.parent, c = m.getAnchorPos(), !C && m.getEnterPos() === r) {
+        o = m, s.produce(o, l), u = !0;
         return;
       }
     } else {
-      const C = t.getRule(m);
+      const y = t.getRule(g);
       s.produce(o, p[0].start);
-      const y = o, _ = C.getName(e.content, p), S = o.contentNameScopesList.pushAttributed(
+      const m = o, _ = y.getName(e.content, p), S = o.contentNameScopesList.pushAttributed(
         _,
         t
       );
       if (o = o.push(
-        m,
+        g,
         r,
         c,
         p[0].end === l,
         null,
         S,
         S
-      ), C instanceof Kt) {
-        const A = C;
+      ), y instanceof Kt) {
+        const A = y;
         Ge(
           t,
           e,
@@ -3156,12 +3156,12 @@ function io(t, e, n, r, o, s, a, i) {
             e.content,
             p
           )
-        )), !g && y.hasSameRuleAs(o)) {
+        )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
           return;
         }
-      } else if (C instanceof ct) {
-        const A = C;
+      } else if (y instanceof ct) {
+        const A = y;
         Ge(
           t,
           e,
@@ -3183,7 +3183,7 @@ function io(t, e, n, r, o, s, a, i) {
             e.content,
             p
           )
-        )), !g && y.hasSameRuleAs(o)) {
+        )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
           return;
         }
@@ -3193,9 +3193,9 @@ function io(t, e, n, r, o, s, a, i) {
         n,
         o,
         s,
-        C.captures,
+        y.captures,
         p
-      ), s.produce(o, p[0].end), o = o.pop(), !g) {
+      ), s.produce(o, p[0].end), o = o.pop(), !C) {
         o = o.safePop(), s.produce(o, l), u = !0;
         return;
       }
@@ -3250,15 +3250,15 @@ function Fa(t, e, n, r, o, s) {
 function Ba(t, e, n, r, o, s, a) {
   let i = Number.MAX_VALUE, l = null, u, c = 0;
   const h = s.contentNameScopesList.getScopeNames();
-  for (let d = 0, f = t.length; d < f; d++) {
-    const p = t[d];
+  for (let f = 0, d = t.length; f < d; f++) {
+    const p = t[f];
     if (!p.matcher(h))
       continue;
-    const m = e.getRule(p.ruleId), { ruleScanner: g, findOptions: C } = lo(m, e, null, r, o === a), y = g.findNextMatchSync(n, o, C);
-    if (!y)
+    const g = e.getRule(p.ruleId), { ruleScanner: C, findOptions: y } = lo(g, e, null, r, o === a), m = C.findNextMatchSync(n, o, y);
+    if (!m)
       continue;
-    const _ = y.captureIndices[0].start;
-    if (!(_ >= i) && (i = _, l = y.captureIndices, u = y.ruleId, c = p.priority, i === o))
+    const _ = m.captureIndices[0].start;
+    if (!(_ >= i) && (i = _, l = m.captureIndices, u = m.ruleId, c = p.priority, i === o))
       break;
   }
   return l ? {
@@ -3286,23 +3286,23 @@ function Ge(t, e, n, r, o, s, a) {
     return;
   const i = e.content, l = Math.min(s.length, a.length), u = [], c = a[0].end;
   for (let h = 0; h < l; h++) {
-    const d = s[h];
-    if (d === null)
+    const f = s[h];
+    if (f === null)
       continue;
-    const f = a[h];
-    if (f.length === 0)
+    const d = a[h];
+    if (d.length === 0)
       continue;
-    if (f.start > c)
+    if (d.start > c)
       break;
-    for (; u.length > 0 && u[u.length - 1].endPos <= f.start; )
+    for (; u.length > 0 && u[u.length - 1].endPos <= d.start; )
       o.produceFromScopes(u[u.length - 1].scopes, u[u.length - 1].endPos), u.pop();
-    if (u.length > 0 ? o.produceFromScopes(u[u.length - 1].scopes, f.start) : o.produce(r, f.start), d.retokenizeCapturedWithRuleId) {
-      const m = d.getName(i, a), g = r.contentNameScopesList.pushAttributed(m, t), C = d.getContentName(i, a), y = g.pushAttributed(C, t), _ = r.push(d.retokenizeCapturedWithRuleId, f.start, -1, !1, null, g, y), S = t.createOnigString(i.substring(0, f.end));
+    if (u.length > 0 ? o.produceFromScopes(u[u.length - 1].scopes, d.start) : o.produce(r, d.start), f.retokenizeCapturedWithRuleId) {
+      const g = f.getName(i, a), C = r.contentNameScopesList.pushAttributed(g, t), y = f.getContentName(i, a), m = C.pushAttributed(y, t), _ = r.push(f.retokenizeCapturedWithRuleId, d.start, -1, !1, null, C, m), S = t.createOnigString(i.substring(0, d.end));
       io(
         t,
         S,
-        n && f.start === 0,
-        f.start,
+        n && d.start === 0,
+        d.start,
         _,
         o,
         !1,
@@ -3311,10 +3311,10 @@ function Ge(t, e, n, r, o, s, a) {
       ), no(S);
       continue;
     }
-    const p = d.getName(i, a);
+    const p = f.getName(i, a);
     if (p !== null) {
-      const g = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(p, t);
-      u.push(new Ua(g, f.end));
+      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(p, t);
+      u.push(new Ua(C, d.end));
     }
   }
   for (; u.length > 0; )
@@ -3497,16 +3497,16 @@ var Wa = class {
         c.fontStyle,
         c.foregroundId,
         c.backgroundId
-      ), d = this.getRule(this._rootId).getName(
+      ), f = this.getRule(this._rootId).getName(
         null,
         null
       );
-      let f;
-      d ? f = Fe.createRootAndLookUpScopeName(
-        d,
+      let d;
+      f ? d = Fe.createRootAndLookUpScopeName(
+        f,
         h,
         this
-      ) : f = Fe.createRoot(
+      ) : d = Fe.createRoot(
         "unknown",
         h
       ), e = new Jt(
@@ -3516,14 +3516,14 @@ var Wa = class {
         -1,
         !1,
         null,
-        f,
-        f
+        d,
+        d
       );
     } else
       o = !1, e.reset();
     t = t + `
 `;
-    const s = this.createOnigString(t), a = s.content.length, i = new Va(
+    const s = this.createOnigString(t), a = s.content.length, i = new qa(
       n,
       t,
       this._tokenTypeMatchers,
@@ -3804,7 +3804,7 @@ var Fe = class ne {
       Fe.fromExtension(r, n.contentNameScopesList)
     );
   }
-}, qa = class {
+}, Va = class {
   balancedBracketScopes;
   unbalancedBracketScopes;
   allowAny = !1;
@@ -3830,7 +3830,7 @@ var Fe = class ne {
         return !0;
     return this.allowAny;
   }
-}, Va = class {
+}, qa = class {
   constructor(t, e, n, r) {
     this.balancedBracketSelectors = r, this._emitBinaryTokens = t, this._tokenTypeOverrides = n, this._lineText = null, this._tokens = [], this._binaryTokens = [], this._lastTokenEndIndex = 0;
   }
@@ -4015,7 +4015,7 @@ var Fe = class ne {
       n,
       r.embeddedLanguages,
       r.tokenTypes,
-      new qa(
+      new Va(
         r.balancedBracketSelectors || [],
         r.unbalancedBracketSelectors || []
       )
@@ -4095,7 +4095,7 @@ function uo(t, e) {
 function Qt(t) {
   return t.toLowerCase();
 }
-class q {
+class V {
   /**
    * @param {string} property
    *   Property.
@@ -4108,18 +4108,18 @@ class q {
     this.attribute = n, this.property = e;
   }
 }
-q.prototype.attribute = "";
-q.prototype.booleanish = !1;
-q.prototype.boolean = !1;
-q.prototype.commaOrSpaceSeparated = !1;
-q.prototype.commaSeparated = !1;
-q.prototype.defined = !1;
-q.prototype.mustUseProperty = !1;
-q.prototype.number = !1;
-q.prototype.overloadedBoolean = !1;
-q.prototype.property = "";
-q.prototype.spaceSeparated = !1;
-q.prototype.space = void 0;
+V.prototype.attribute = "";
+V.prototype.booleanish = !1;
+V.prototype.boolean = !1;
+V.prototype.commaOrSpaceSeparated = !1;
+V.prototype.commaSeparated = !1;
+V.prototype.defined = !1;
+V.prototype.mustUseProperty = !1;
+V.prototype.number = !1;
+V.prototype.overloadedBoolean = !1;
+V.prototype.property = "";
+V.prototype.spaceSeparated = !1;
+V.prototype.space = void 0;
 let Ya = 0;
 const E = be(), T = be(), en = be(), w = be(), N = be(), Ee = be(), X = be();
 function be() {
@@ -4138,7 +4138,7 @@ const tn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   /** @type {ReadonlyArray<keyof typeof types>} */
   Object.keys(tn)
 );
-class yn extends q {
+class yn extends V {
   /**
    * @constructor
    * @param {string} property
@@ -5188,7 +5188,7 @@ const Ja = Ne({
 }), Qa = /[A-Z]/g, Jn = /-[a-z]/g, ei = /^data[-\w.:]+$/i;
 function ti(t, e) {
   const n = Qt(e);
-  let r = e, o = q;
+  let r = e, o = V;
   if (n in t.normal)
     return t.property[t.normal[n]];
   if (n.length > 4 && n.slice(0, 4) === "data" && ei.test(e)) {
@@ -5840,18 +5840,18 @@ const Qe = {
     ['\0"&'.split(""), "\0\"&'`".split("")]
   ]
 };
-function qi(t, e, n, r) {
+function Vi(t, e, n, r) {
   const o = r.schema, s = o.space === "svg" ? !1 : r.settings.omitOptionalTags;
   let a = o.space === "svg" ? r.settings.closeEmptyElements : r.settings.voids.includes(t.tagName.toLowerCase());
   const i = [];
   let l;
   o.space === "html" && t.tagName === "svg" && (r.schema = yo);
-  const u = Vi(r, t.properties), c = r.all(
+  const u = qi(r, t.properties), c = r.all(
     o.space === "html" && t.tagName === "template" ? t.content : t
   );
   return r.schema = o, c && (a = !1), (u || !s || !Bi(t, e, n)) && (i.push("<", t.tagName, u ? " " + u : ""), a && (o.space === "svg" || r.settings.closeSelfClosing) && (l = u.charAt(u.length - 1), (!r.settings.tightSelfClosing || l === "/" || l && l !== '"' && l !== "'") && i.push(" "), i.push("/")), i.push(">")), i.push(c), !a && (!s || !bn(t, e, n)) && i.push("</" + t.tagName + ">"), i.join("");
 }
-function Vi(t, e) {
+function qi(t, e) {
   const n = [];
   let r = -1, o;
   if (e) {
@@ -5914,7 +5914,7 @@ function Ji(t, e, n, r) {
 const Zi = la("type", {
   invalid: Qi,
   unknown: el,
-  handlers: { comment: vi, doctype: xi, element: qi, raw: Yi, root: Ji, text: So }
+  handlers: { comment: vi, doctype: xi, element: Vi, raw: Yi, root: Ji, text: So }
 });
 function Qi(t) {
   throw new Error("Expected node, not `" + t + "`");
@@ -6046,8 +6046,8 @@ function ul(t) {
     posToIndex: r
   };
 }
-const _n = "light-dark()";
-function cl(t, e) {
+const _n = "light-dark()", cl = ["color", "background-color"];
+function hl(t, e) {
   let n = 0;
   const r = [];
   for (const o of e)
@@ -6062,39 +6062,38 @@ function cl(t, e) {
     offset: t.offset + n
   }), r;
 }
-function hl(t, e) {
+function pl(t, e) {
   const n = Array.from(e instanceof Set ? e : new Set(e)).sort((r, o) => r - o);
   return n.length ? t.map((r) => r.flatMap((o) => {
     const s = n.filter((a) => o.offset < a && a < o.offset + o.content.length).map((a) => a - o.offset).sort((a, i) => a - i);
-    return s.length ? cl(o, s) : o;
+    return s.length ? hl(o, s) : o;
   })) : t;
 }
-function pl(t, e, n, r) {
-  const o = {
+function fl(t, e, n, r, o = "css-vars") {
+  const s = {
     content: t.content,
     explanation: t.explanation,
     offset: t.offset
-  }, s = e.map((l) => ft(t.variants[l])), a = new Set(s.flatMap((l) => Object.keys(l))), i = {};
-  return s.forEach((l, u) => {
-    for (const c of a) {
-      const h = l[c] || "inherit";
-      if (u === 0 && r)
-        if (r === _n && s.length > 1) {
-          const d = e.findIndex((y) => y === "light"), f = e.findIndex((y) => y === "dark");
-          if (d === -1 || f === -1)
+  }, a = e.map((c) => ft(t.variants[c])), i = new Set(a.flatMap((c) => Object.keys(c))), l = {}, u = (c, h) => {
+    const f = h === "color" ? "" : h === "background-color" ? "-bg" : `-${h}`;
+    return n + e[c] + (h === "color" ? "" : f);
+  };
+  return a.forEach((c, h) => {
+    for (const f of i) {
+      const d = c[f] || "inherit";
+      if (h === 0 && r && cl.includes(f))
+        if (r === _n && a.length > 1) {
+          const p = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
+          if (p === -1 || g === -1)
             throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-          const p = s[d][c] || "inherit", m = s[f][c] || "inherit";
-          i[c] = `light-dark(${p}, ${m})`;
-          const g = c === "color" ? "" : c === "background-color" ? "-bg" : `-${c}`, C = n + e[u] + (c === "color" ? "" : g);
-          i[C] = h;
+          const C = a[p][f] || "inherit", y = a[g][f] || "inherit";
+          l[f] = `light-dark(${C}, ${y})`, o === "css-vars" && (l[u(h, f)] = d);
         } else
-          i[c] = h;
-      else {
-        const d = c === "color" ? "" : c === "background-color" ? "-bg" : `-${c}`, f = n + e[u] + (c === "color" ? "" : d);
-        i[f] = h;
-      }
+          l[f] = d;
+      else
+        o === "css-vars" && (l[u(h, f)] = d);
     }
-  }), o.htmlStyle = i, o;
+  }), s.htmlStyle = l, s;
 }
 function ft(t) {
   const e = {};
@@ -6156,7 +6155,7 @@ class Pe {
     return this._stacks[e];
   }
   getScopes(e = this.theme) {
-    return fl(this._stacks[e]);
+    return dl(this._stacks[e]);
   }
   toJSON() {
     return {
@@ -6167,7 +6166,7 @@ class Pe {
     };
   }
 }
-function fl(t) {
+function dl(t) {
   const e = [], n = /* @__PURE__ */ new Set();
   function r(o) {
     if (n.has(o))
@@ -6178,12 +6177,12 @@ function fl(t) {
   }
   return r(t), e;
 }
-function dl(t, e) {
+function gl(t, e) {
   if (!(t instanceof Pe))
     throw new F("Invalid grammar state");
   return t.getInternalStack(e);
 }
-function gl() {
+function ml() {
   const t = /* @__PURE__ */ new WeakMap();
   function e(n) {
     if (!t.has(n.meta)) {
@@ -6212,7 +6211,7 @@ function gl() {
         start: r(a.start),
         end: r(a.end)
       }));
-      ml(s), t.set(n.meta, {
+      yl(s), t.set(n.meta, {
         decorations: s,
         converter: o,
         source: n.source
@@ -6226,7 +6225,7 @@ function gl() {
       if (!this.options.decorations?.length)
         return;
       const o = e(this).decorations.flatMap((a) => [a.start.offset, a.end.offset]);
-      return hl(n, o);
+      return pl(n, o);
     },
     code(n) {
       if (!this.options.decorations?.length)
@@ -6234,59 +6233,59 @@ function gl() {
       const r = e(this), o = Array.from(n.children).filter((c) => c.type === "element" && c.tagName === "span");
       if (o.length !== r.converter.lines.length)
         throw new F(`Number of lines in code element (${o.length}) does not match the number of lines in the source (${r.converter.lines.length}). Failed to apply decorations.`);
-      function s(c, h, d, f) {
+      function s(c, h, f, d) {
         const p = o[c];
-        let m = "", g = -1, C = -1;
-        if (h === 0 && (g = 0), d === 0 && (C = 0), d === Number.POSITIVE_INFINITY && (C = p.children.length), g === -1 || C === -1)
+        let g = "", C = -1, y = -1;
+        if (h === 0 && (C = 0), f === 0 && (y = 0), f === Number.POSITIVE_INFINITY && (y = p.children.length), C === -1 || y === -1)
           for (let _ = 0; _ < p.children.length; _++)
-            m += Ao(p.children[_]), g === -1 && m.length === h && (g = _ + 1), C === -1 && m.length === d && (C = _ + 1);
-        if (g === -1)
-          throw new F(`Failed to find start index for decoration ${JSON.stringify(f.start)}`);
+            g += Ao(p.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === f && (y = _ + 1);
         if (C === -1)
-          throw new F(`Failed to find end index for decoration ${JSON.stringify(f.end)}`);
-        const y = p.children.slice(g, C);
-        if (!f.alwaysWrap && y.length === p.children.length)
-          i(p, f, "line");
-        else if (!f.alwaysWrap && y.length === 1 && y[0].type === "element")
-          i(y[0], f, "token");
+          throw new F(`Failed to find start index for decoration ${JSON.stringify(d.start)}`);
+        if (y === -1)
+          throw new F(`Failed to find end index for decoration ${JSON.stringify(d.end)}`);
+        const m = p.children.slice(C, y);
+        if (!d.alwaysWrap && m.length === p.children.length)
+          i(p, d, "line");
+        else if (!d.alwaysWrap && m.length === 1 && m[0].type === "element")
+          i(m[0], d, "token");
         else {
           const _ = {
             type: "element",
             tagName: "span",
             properties: {},
-            children: y
+            children: m
           };
-          i(_, f, "wrapper"), p.children.splice(g, y.length, _);
+          i(_, d, "wrapper"), p.children.splice(C, m.length, _);
         }
       }
       function a(c, h) {
         o[c] = i(o[c], h, "line");
       }
-      function i(c, h, d) {
-        const f = h.properties || {}, p = h.transform || ((m) => m);
+      function i(c, h, f) {
+        const d = h.properties || {}, p = h.transform || ((g) => g);
         return c.tagName = h.tagName || "span", c.properties = {
           ...c.properties,
-          ...f,
+          ...d,
           class: c.properties.class
-        }, h.properties?.class && xo(c, h.properties.class), c = p(c, d) || c, c;
+        }, h.properties?.class && xo(c, h.properties.class), c = p(c, f) || c, c;
       }
       const l = [], u = r.decorations.sort((c, h) => h.start.offset - c.start.offset || c.end.offset - h.end.offset);
       for (const c of u) {
-        const { start: h, end: d } = c;
-        if (h.line === d.line)
-          s(h.line, h.character, d.character, c);
-        else if (h.line < d.line) {
+        const { start: h, end: f } = c;
+        if (h.line === f.line)
+          s(h.line, h.character, f.character, c);
+        else if (h.line < f.line) {
           s(h.line, h.character, Number.POSITIVE_INFINITY, c);
-          for (let f = h.line + 1; f < d.line; f++)
-            l.unshift(() => a(f, c));
-          s(d.line, 0, d.character, c);
+          for (let d = h.line + 1; d < f.line; d++)
+            l.unshift(() => a(d, c));
+          s(f.line, 0, f.character, c);
         }
       }
       l.forEach((c) => c());
     }
   };
 }
-function ml(t) {
+function yl(t) {
   for (let e = 0; e < t.length; e++) {
     const n = t[e];
     if (n.start.offset > n.end.offset)
@@ -6304,13 +6303,13 @@ function ml(t) {
 function Ao(t) {
   return t.type === "text" ? t.value : t.type === "element" ? t.children.map(Ao).join("") : "";
 }
-const yl = [
-  /* @__PURE__ */ gl()
+const bl = [
+  /* @__PURE__ */ ml()
 ];
 function dt(t) {
   return [
     ...t.transformers || [],
-    ...yl
+    ...bl
   ];
 }
 var de = [
@@ -6339,7 +6338,7 @@ var de = [
   8: "hidden",
   9: "strikethrough"
 };
-function bl(t, e) {
+function wl(t, e) {
   const n = t.indexOf("\x1B", e);
   if (n !== -1 && t[n + 1] === "[") {
     const r = t.indexOf("m", n);
@@ -6368,7 +6367,7 @@ function tr(t) {
       return { type: "table", index: Number(n) };
   }
 }
-function wl(t) {
+function Cl(t) {
   const e = [];
   for (; t.length > 0; ) {
     const n = t.shift();
@@ -6436,21 +6435,21 @@ function wl(t) {
   }
   return e;
 }
-function Cl() {
+function _l() {
   let t = null, e = null, n = /* @__PURE__ */ new Set();
   return {
     parse(r) {
       const o = [];
       let s = 0;
       do {
-        const a = bl(r, s), i = a.sequence ? r.substring(s, a.startPosition) : r.substring(s);
+        const a = wl(r, s), i = a.sequence ? r.substring(s, a.startPosition) : r.substring(s);
         if (i.length > 0 && o.push({
           value: i,
           foreground: t,
           background: e,
           decorations: new Set(n)
         }), a.sequence) {
-          const l = wl(a.sequence);
+          const l = Cl(a.sequence);
           for (const u of l)
             u.type === "resetAll" ? (t = null, e = null, n.clear()) : u.type === "resetForegroundColor" ? t = null : u.type === "resetBackgroundColor" ? e = null : u.type === "resetDecoration" && n.delete(u.value);
           for (const u of l)
@@ -6462,7 +6461,7 @@ function Cl() {
     }
   };
 }
-var _l = {
+var Sl = {
   black: "#000000",
   red: "#bb0000",
   green: "#00bb00",
@@ -6480,7 +6479,7 @@ var _l = {
   brightCyan: "#55ffff",
   brightWhite: "#ffffff"
 };
-function Sl(t = _l) {
+function kl(t = Sl) {
   function e(i) {
     return t[i];
   }
@@ -6521,19 +6520,19 @@ function Sl(t = _l) {
     value: a
   };
 }
-function kl(t, e, n) {
-  const r = pt(t, n), o = St(e), s = Sl(
+function vl(t, e, n) {
+  const r = pt(t, n), o = St(e), s = kl(
     Object.fromEntries(
       de.map((i) => [
         i,
         t.colors?.[`terminal.ansi${i[0].toUpperCase()}${i.substring(1)}`]
       ])
     )
-  ), a = Cl();
+  ), a = _l();
   return o.map(
     (i) => a.parse(i[0]).map((l) => {
       let u, c;
-      l.decorations.has("reverse") ? (u = l.background ? s.value(l.background) : t.bg, c = l.foreground ? s.value(l.foreground) : t.fg) : (u = l.foreground ? s.value(l.foreground) : t.fg, c = l.background ? s.value(l.background) : void 0), u = ue(u, r), c = ue(c, r), l.decorations.has("dim") && (u = vl(u));
+      l.decorations.has("reverse") ? (u = l.background ? s.value(l.background) : t.bg, c = l.foreground ? s.value(l.foreground) : t.fg) : (u = l.foreground ? s.value(l.foreground) : t.fg, c = l.background ? s.value(l.background) : void 0), u = ue(u, r), c = ue(c, r), l.decorations.has("dim") && (u = xl(u));
       let h = z.None;
       return l.decorations.has("bold") && (h |= z.Bold), l.decorations.has("italic") && (h |= z.Italic), l.decorations.has("underline") && (h |= z.Underline), l.decorations.has("strikethrough") && (h |= z.Strikethrough), {
         content: l.value,
@@ -6546,7 +6545,7 @@ function kl(t, e, n) {
     })
   );
 }
-function vl(t) {
+function xl(t) {
   const e = t.match(/#([0-9a-f]{3})([0-9a-f]{3})?([0-9a-f]{2})?/);
   if (e)
     if (e[3]) {
@@ -6565,7 +6564,7 @@ function Sn(t, e, n = {}) {
     return St(e).map((l) => [{ content: l[0], offset: l[1] }]);
   const { theme: s, colorMap: a } = t.setTheme(o);
   if (r === "ansi")
-    return kl(s, e, n);
+    return vl(s, e, n);
   const i = t.getLanguage(r);
   if (n.grammarState) {
     if (n.grammarState.lang !== i.name)
@@ -6573,9 +6572,9 @@ function Sn(t, e, n = {}) {
     if (!n.grammarState.themes.includes(s.name))
       throw new F(`Grammar state themes "${n.grammarState.themes}" do not contain highlight theme "${s.name}"`);
   }
-  return El(e, i, s, a, n);
+  return Al(e, i, s, a, n);
 }
-function xl(...t) {
+function El(...t) {
   if (t.length === 2)
     return We(t[1]);
   const [e, n, r = {}] = t, {
@@ -6593,7 +6592,7 @@ function xl(...t) {
     a.name
   );
 }
-function El(t, e, n, r, o) {
+function Al(t, e, n, r, o) {
   const s = gt(t, e, n, r, o), a = new Pe(
     gt(t, e, n, r, o).stateStack,
     e.name,
@@ -6606,7 +6605,7 @@ function gt(t, e, n, r, o) {
     tokenizeMaxLineLength: a = 0,
     tokenizeTimeLimit: i = 500
   } = o, l = St(t);
-  let u = o.grammarState ? dl(o.grammarState, n.name) ?? Zt : o.grammarContextCode != null ? gt(
+  let u = o.grammarState ? gl(o.grammarState, n.name) ?? Zt : o.grammarContextCode != null ? gt(
     o.grammarContextCode,
     e,
     n,
@@ -6618,8 +6617,8 @@ function gt(t, e, n, r, o) {
     }
   ).stateStack : Zt, c = [];
   const h = [];
-  for (let d = 0, f = l.length; d < f; d++) {
-    const [p, m] = l[d];
+  for (let f = 0, d = l.length; f < d; f++) {
+    const [p, g] = l[f];
     if (p === "") {
       c = [], h.push([]);
       continue;
@@ -6627,14 +6626,14 @@ function gt(t, e, n, r, o) {
     if (a > 0 && p.length >= a) {
       c = [], h.push([{
         content: p,
-        offset: m,
+        offset: g,
         color: "",
         fontStyle: 0
       }]);
       continue;
     }
-    let g, C, y;
-    o.includeExplanation && (g = e.tokenizeLine(p, u, i), C = g.tokens, y = 0);
+    let C, y, m;
+    o.includeExplanation && (C = e.tokenizeLine(p, u, i), y = C.tokens, m = 0);
     const _ = e.tokenizeLine2(p, u, i), S = _.tokens.length / 2;
     for (let A = 0; A < S; A++) {
       const D = _.tokens[2 * A], P = A + 1 < S ? _.tokens[2 * A + 2] : p.length;
@@ -6645,7 +6644,7 @@ function gt(t, e, n, r, o) {
         s
       ), ee = Re.getFontStyle(j), ce = {
         content: p.substring(D, P),
-        offset: m + D,
+        offset: g + D,
         color: Z,
         fontStyle: ee
       };
@@ -6672,19 +6671,19 @@ function gt(t, e, n, r, o) {
         ce.explanation = [];
         let R = 0;
         for (; D + R < P; ) {
-          const k = C[y], G = p.substring(
+          const k = y[m], G = p.substring(
             k.startIndex,
             k.endIndex
           );
           R += G.length, ce.explanation.push({
             content: G,
-            scopes: o.includeExplanation === "scopeName" ? Al(
+            scopes: o.includeExplanation === "scopeName" ? Rl(
               k.scopes
-            ) : Rl(
+            ) : Il(
               te,
               k.scopes
             )
-          }), y += 1;
+          }), m += 1;
         }
       }
       c.push(ce);
@@ -6696,16 +6695,16 @@ function gt(t, e, n, r, o) {
     stateStack: u
   };
 }
-function Al(t) {
+function Rl(t) {
   return t.map((e) => ({ scopeName: e }));
 }
-function Rl(t, e) {
+function Il(t, e) {
   const n = [];
   for (let r = 0, o = e.length; r < o; r++) {
     const s = e[r];
     n[r] = {
       scopeName: s,
-      themeMatches: Nl(t, s, e.slice(0, r))
+      themeMatches: Pl(t, s, e.slice(0, r))
     };
   }
   return n;
@@ -6713,7 +6712,7 @@ function Rl(t, e) {
 function nr(t, e) {
   return t === e || e.substring(0, t.length) === t && e[t.length] === ".";
 }
-function Il(t, e, n) {
+function Nl(t, e, n) {
   if (!nr(t[t.length - 1], e))
     return !1;
   let r = t.length - 2, o = n.length - 1;
@@ -6721,11 +6720,11 @@ function Il(t, e, n) {
     nr(t[r], n[o]) && (r -= 1), o -= 1;
   return r === -1;
 }
-function Nl(t, e, n) {
+function Pl(t, e, n) {
   const r = [];
   for (const { selectors: o, settings: s } of t)
     for (const a of o)
-      if (Il(a, e, n)) {
+      if (Nl(a, e, n)) {
         r.push(s);
         break;
       }
@@ -6742,24 +6741,24 @@ function Ro(t, e, n) {
       state: c,
       theme: h
     };
-  }), s = Pl(
+  }), s = Ll(
     ...o.map((l) => l.tokens)
   ), a = s[0].map(
     (l, u) => l.map((c, h) => {
-      const d = {
+      const f = {
         content: c.content,
         variants: {},
         offset: c.offset
       };
-      return "includeExplanation" in n && n.includeExplanation && (d.explanation = c.explanation), s.forEach((f, p) => {
+      return "includeExplanation" in n && n.includeExplanation && (f.explanation = c.explanation), s.forEach((d, p) => {
         const {
-          content: m,
-          explanation: g,
-          offset: C,
-          ...y
-        } = f[u][h];
-        d.variants[r[p].color] = y;
-      }), d;
+          content: g,
+          explanation: C,
+          offset: y,
+          ...m
+        } = d[u][h];
+        f.variants[r[p].color] = m;
+      }), f;
     })
   ), i = o[0].state ? new Pe(
     Object.fromEntries(o.map((l) => [l.theme, l.state?.getInternalStack(l.theme)])),
@@ -6767,7 +6766,7 @@ function Ro(t, e, n) {
   ) : void 0;
   return i && kt(a, i), a;
 }
-function Pl(...t) {
+function Ll(...t) {
   const e = t.map(() => []), n = t.length;
   for (let r = 0; r < t[0].length; r++) {
     const o = t.map((l) => l[r]), s = e.map(() => []);
@@ -6795,21 +6794,22 @@ function mt(t, e, n) {
   if ("themes" in n) {
     const {
       defaultColor: u = "light",
-      cssVariablePrefix: c = "--shiki-"
-    } = n, h = Object.entries(n.themes).filter((g) => g[1]).map((g) => ({ color: g[0], theme: g[1] })).sort((g, C) => g.color === u ? -1 : C.color === u ? 1 : 0);
-    if (h.length === 0)
+      cssVariablePrefix: c = "--shiki-",
+      colorsRendering: h = "css-vars"
+    } = n, f = Object.entries(n.themes).filter((y) => y[1]).map((y) => ({ color: y[0], theme: y[1] })).sort((y, m) => y.color === u ? -1 : m.color === u ? 1 : 0);
+    if (f.length === 0)
       throw new F("`themes` option must not be empty");
     const d = Ro(
       t,
       e,
       n
     );
-    if (l = We(d), u && _n !== u && !h.find((g) => g.color === u))
+    if (l = We(d), u && _n !== u && !f.find((y) => y.color === u))
       throw new F(`\`themes\` option must contain the defaultColor key \`${u}\``);
-    const f = h.map((g) => t.getTheme(g.theme)), p = h.map((g) => g.color);
-    s = d.map((g) => g.map((C) => pl(C, p, c, u))), l && kt(s, l);
-    const m = h.map((g) => pt(g.theme, n));
-    o = rr(h, f, m, c, u, "fg"), r = rr(h, f, m, c, u, "bg"), a = `shiki-themes ${f.map((g) => g.name).join(" ")}`, i = u ? void 0 : [o, r].join(";");
+    const p = f.map((y) => t.getTheme(y.theme)), g = f.map((y) => y.color);
+    s = d.map((y) => y.map((m) => fl(m, g, c, u, h))), l && kt(s, l);
+    const C = f.map((y) => pt(y.theme, n));
+    o = rr(f, p, C, c, u, "fg", h), r = rr(f, p, C, c, u, "bg", h), a = `shiki-themes ${p.map((y) => y.name).join(" ")}`, i = u ? void 0 : [o, r].join(";");
   } else if ("theme" in n) {
     const u = pt(n.theme, n);
     s = Sn(
@@ -6830,21 +6830,21 @@ function mt(t, e, n) {
     grammarState: l
   };
 }
-function rr(t, e, n, r, o, s) {
-  return t.map((a, i) => {
-    const l = ue(e[i][s], n[i]) || "inherit", u = `${r + a.color}${s === "bg" ? "-bg" : ""}:${l}`;
-    if (i === 0 && o) {
+function rr(t, e, n, r, o, s, a) {
+  return t.map((i, l) => {
+    const u = ue(e[l][s], n[l]) || "inherit", c = `${r + i.color}${s === "bg" ? "-bg" : ""}:${u}`;
+    if (l === 0 && o) {
       if (o === _n && t.length > 1) {
-        const c = t.findIndex((p) => p.color === "light"), h = t.findIndex((p) => p.color === "dark");
-        if (c === -1 || h === -1)
+        const h = t.findIndex((g) => g.color === "light"), f = t.findIndex((g) => g.color === "dark");
+        if (h === -1 || f === -1)
           throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-        const d = ue(e[c][s], n[c]) || "inherit", f = ue(e[h][s], n[h]) || "inherit";
-        return `light-dark(${d}, ${f});${u}`;
+        const d = ue(e[h][s], n[h]) || "inherit", p = ue(e[f][s], n[f]) || "inherit";
+        return `light-dark(${d}, ${p});${c}`;
       }
-      return l;
+      return u;
     }
-    return u;
-  }).join(";");
+    return a === "css-vars" ? c : null;
+  }).filter((i) => !!i).join(";");
 }
 function yt(t, e, n, r = {
   meta: {},
@@ -6865,18 +6865,18 @@ function yt(t, e, n, r = {
   } = mt(t, o, n);
   const {
     mergeWhitespaces: h = !0,
-    mergeSameStyleTokens: d = !1
+    mergeSameStyleTokens: f = !1
   } = n;
-  h === !0 ? s = $l(s) : h === "never" && (s = Tl(s)), d && (s = Ml(s));
-  const f = {
+  h === !0 ? s = Tl(s) : h === "never" && (s = Ml(s)), f && (s = Ol(s));
+  const d = {
     ...r,
     get source() {
       return o;
     }
   };
   for (const p of dt(n))
-    s = p.tokens?.call(f, s) || s;
-  return Ll(
+    s = p.tokens?.call(d, s) || s;
+  return $l(
     s,
     {
       ...n,
@@ -6885,11 +6885,11 @@ function yt(t, e, n, r = {
       themeName: l,
       rootStyle: u
     },
-    f,
+    d,
     c
   );
 }
-function Ll(t, e, n, r = We(t)) {
+function $l(t, e, n, r = We(t)) {
   const o = dt(e), s = [], a = {
     type: "root",
     children: []
@@ -6919,7 +6919,7 @@ function Ll(t, e, n, r = We(t)) {
     properties: {},
     children: s
   };
-  const h = [], d = {
+  const h = [], f = {
     ...n,
     structure: i,
     addClassToHast: xo,
@@ -6945,49 +6945,49 @@ function Ll(t, e, n, r = We(t)) {
       return h;
     }
   };
-  if (t.forEach((p, m) => {
-    m && (i === "inline" ? a.children.push({ type: "element", tagName: "br", properties: {}, children: [] }) : i === "classic" && s.push({ type: "text", value: `
+  if (t.forEach((p, g) => {
+    g && (i === "inline" ? a.children.push({ type: "element", tagName: "br", properties: {}, children: [] }) : i === "classic" && s.push({ type: "text", value: `
 ` }));
-    let g = {
+    let C = {
       type: "element",
       tagName: "span",
       properties: { class: "line" },
       children: []
-    }, C = 0;
-    for (const y of p) {
+    }, y = 0;
+    for (const m of p) {
       let _ = {
         type: "element",
         tagName: "span",
         properties: {
-          ...y.htmlAttrs
+          ...m.htmlAttrs
         },
-        children: [{ type: "text", value: y.content }]
+        children: [{ type: "text", value: m.content }]
       };
-      const S = rn(y.htmlStyle || ft(y));
+      const S = rn(m.htmlStyle || ft(m));
       S && (_.properties.style = S);
       for (const A of o)
-        _ = A?.span?.call(d, _, m + 1, C, g, y) || _;
-      i === "inline" ? a.children.push(_) : i === "classic" && g.children.push(_), C += y.content.length;
+        _ = A?.span?.call(f, _, g + 1, y, C, m) || _;
+      i === "inline" ? a.children.push(_) : i === "classic" && C.children.push(_), y += m.content.length;
     }
     if (i === "classic") {
-      for (const y of o)
-        g = y?.line?.call(d, g, m + 1) || g;
-      h.push(g), s.push(g);
+      for (const m of o)
+        C = m?.line?.call(f, C, g + 1) || C;
+      h.push(C), s.push(C);
     }
   }), i === "classic") {
     for (const p of o)
-      c = p?.code?.call(d, c) || c;
+      c = p?.code?.call(f, c) || c;
     u.children.push(c);
     for (const p of o)
-      u = p?.pre?.call(d, u) || u;
+      u = p?.pre?.call(f, u) || u;
     a.children.push(u);
   }
-  let f = a;
+  let d = a;
   for (const p of o)
-    f = p?.root?.call(d, f) || f;
-  return r && kt(f, r), f;
+    d = p?.root?.call(f, d) || d;
+  return r && kt(d, r), d;
 }
-function $l(t) {
+function Tl(t) {
   return t.map((e) => {
     const n = [];
     let r = "", o = 0;
@@ -7007,7 +7007,7 @@ function $l(t) {
     }), n;
   });
 }
-function Tl(t) {
+function Ml(t) {
   return t.map((e) => e.flatMap((n) => {
     if (n.content.match(/^\s+$/))
       return n;
@@ -7031,7 +7031,7 @@ function Tl(t) {
     }), i;
   }));
 }
-function Ml(t) {
+function Ol(t) {
   return t.map((e) => {
     const n = [];
     for (const r of e) {
@@ -7045,15 +7045,15 @@ function Ml(t) {
     return n;
   });
 }
-const Ol = ol;
-function Dl(t, e, n) {
+const Dl = ol;
+function Gl(t, e, n) {
   const r = {
     meta: {},
     options: n,
     codeToHast: (s, a) => yt(t, s, a),
     codeToTokens: (s, a) => mt(t, s, a)
   };
-  let o = Ol(yt(t, e, n, r));
+  let o = Dl(yt(t, e, n, r));
   for (const s of dt(n))
     o = s.postprocess?.call(r, o, n) || o;
   return o;
@@ -7129,16 +7129,16 @@ async function No(t) {
     )
   )).filter((n) => !!n);
 }
-let Gl = 3;
-function Fl(t, e = 3) {
-  e > Gl || console.trace(`[SHIKI DEPRECATE]: ${t}`);
+let Fl = 3;
+function Bl(t, e = 3) {
+  e > Fl || console.trace(`[SHIKI DEPRECATE]: ${t}`);
 }
 class ve extends Error {
   constructor(e) {
     super(e), this.name = "ShikiError";
   }
 }
-class Bl extends Ka {
+class jl extends Ka {
   constructor(e, n, r, o = {}) {
     super(e), this._resolver = e, this._themes = n, this._langs = r, this._alias = o, this._themes.map((s) => this.loadTheme(s)), this.loadLanguages(this._langs);
   }
@@ -7225,7 +7225,7 @@ class Bl extends Ka {
         this._langGraph.set(n, this._langMap.get(n));
   }
 }
-class jl {
+class Ul {
   _langs = /* @__PURE__ */ new Map();
   _scopeToLang = /* @__PURE__ */ new Map();
   _injections = /* @__PURE__ */ new Map();
@@ -7263,33 +7263,33 @@ class jl {
   }
 }
 let De = 0;
-function Ul(t) {
+function zl(t) {
   De += 1, t.warnings !== !1 && De >= 10 && De % 10 === 0 && console.warn(`[Shiki] ${De} instances have been created. Shiki is supposed to be used as a singleton, consider refactoring your code to cache your highlighter instance; Or call \`highlighter.dispose()\` to release unused instances.`);
   let e = !1;
   if (!t.engine)
     throw new ve("`engine` option is required for synchronous mode");
-  const n = (t.langs || []).flat(1), r = (t.themes || []).flat(1).map(kn), o = new jl(t.engine, n), s = new Bl(o, r, n, t.langAlias);
+  const n = (t.langs || []).flat(1), r = (t.themes || []).flat(1).map(kn), o = new Ul(t.engine, n), s = new jl(o, r, n, t.langAlias);
   let a;
-  function i(y) {
-    g();
-    const _ = s.getGrammar(typeof y == "string" ? y : y.name);
+  function i(m) {
+    C();
+    const _ = s.getGrammar(typeof m == "string" ? m : m.name);
     if (!_)
-      throw new ve(`Language \`${y}\` not found, you may need to load it first`);
+      throw new ve(`Language \`${m}\` not found, you may need to load it first`);
     return _;
   }
-  function l(y) {
-    if (y === "none")
+  function l(m) {
+    if (m === "none")
       return { bg: "", fg: "", name: "none", settings: [], type: "dark" };
-    g();
-    const _ = s.getTheme(y);
+    C();
+    const _ = s.getTheme(m);
     if (!_)
-      throw new ve(`Theme \`${y}\` not found, you may need to load it first`);
+      throw new ve(`Theme \`${m}\` not found, you may need to load it first`);
     return _;
   }
-  function u(y) {
-    g();
-    const _ = l(y);
-    a !== y && (s.setTheme(_), a = y);
+  function u(m) {
+    C();
+    const _ = l(m);
+    a !== m && (s.setTheme(_), a = m);
     const S = s.getColorMap();
     return {
       theme: _,
@@ -7297,30 +7297,30 @@ function Ul(t) {
     };
   }
   function c() {
-    return g(), s.getLoadedThemes();
+    return C(), s.getLoadedThemes();
   }
   function h() {
-    return g(), s.getLoadedLanguages();
+    return C(), s.getLoadedLanguages();
   }
-  function d(...y) {
-    g(), s.loadLanguages(y.flat(1));
+  function f(...m) {
+    C(), s.loadLanguages(m.flat(1));
   }
-  async function f(...y) {
-    return d(await Io(y));
+  async function d(...m) {
+    return f(await Io(m));
   }
-  function p(...y) {
-    g();
-    for (const _ of y.flat(1))
+  function p(...m) {
+    C();
+    for (const _ of m.flat(1))
       s.loadTheme(_);
   }
-  async function m(...y) {
-    return g(), p(await No(y));
+  async function g(...m) {
+    return C(), p(await No(m));
   }
-  function g() {
+  function C() {
     if (e)
       throw new ve("Shiki instance has been disposed");
   }
-  function C() {
+  function y() {
     e || (e = !0, s.dispose(), De -= 1);
   }
   return {
@@ -7329,16 +7329,16 @@ function Ul(t) {
     getLanguage: i,
     getLoadedThemes: c,
     getLoadedLanguages: h,
-    loadLanguage: f,
-    loadLanguageSync: d,
-    loadTheme: m,
+    loadLanguage: d,
+    loadLanguageSync: f,
+    loadTheme: g,
     loadThemeSync: p,
-    dispose: C,
-    [Symbol.dispose]: C
+    dispose: y,
+    [Symbol.dispose]: y
   };
 }
-async function zl(t) {
-  t.engine || Fl("`engine` option is required. Use `createOnigurumaEngine` or `createJavaScriptRegexEngine` to create an engine.");
+async function Hl(t) {
+  t.engine || Bl("`engine` option is required. Use `createOnigurumaEngine` or `createJavaScriptRegexEngine` to create an engine.");
   const [
     e,
     n,
@@ -7348,22 +7348,22 @@ async function zl(t) {
     Io(t.langs || []),
     t.engine
   ]);
-  return Ul({
+  return zl({
     ...t,
     themes: e,
     langs: n,
     engine: r
   });
 }
-async function Hl(t) {
-  const e = await zl(t);
+async function Wl(t) {
+  const e = await Hl(t);
   return {
-    getLastGrammarState: (...n) => xl(e, ...n),
+    getLastGrammarState: (...n) => El(e, ...n),
     codeToTokensBase: (n, r) => Sn(e, n, r),
     codeToTokensWithThemes: (n, r) => Ro(e, n, r),
     codeToTokens: (n, r) => mt(e, n, r),
     codeToHast: (n, r) => yt(e, n, r),
-    codeToHtml: (n, r) => Dl(e, n, r),
+    codeToHtml: (n, r) => Gl(e, n, r),
     getBundledLanguages: () => ({}),
     getBundledThemes: () => ({}),
     ...e,
@@ -7373,14 +7373,14 @@ async function Hl(t) {
 function Po(t) {
   return "children" in t ? Lo(t) : "value" in t ? t.value : "";
 }
-function Wl(t) {
+function Vl(t) {
   return t.type === "text" ? t.value : "children" in t ? Lo(t) : "";
 }
 function Lo(t) {
   let e = -1;
   const n = [];
   for (; ++e < t.children.length; )
-    n[e] = Wl(t.children[e]);
+    n[e] = Vl(t.children[e]);
   return n.join("");
 }
 const ql = {
@@ -7393,7 +7393,7 @@ const ql = {
         lang: r.at(2)
       };
   }
-}, ir = "language-", Vl = (t, e) => {
+}, ir = "language-", Xl = (t, e) => {
   const n = e.children[0];
   if (!n || n.type !== "element" || n.tagName !== "code" || !n.properties)
     return;
@@ -7406,8 +7406,8 @@ const ql = {
     code: Po(n),
     meta: n.data?.meta ?? n.properties.metastring?.toString() ?? ""
   };
-}, Xl = "language-";
-function Kl(t, e) {
+}, Kl = "language-";
+function Yl(t, e) {
   const {
     addLanguageClass: n = !1,
     parseMetaString: r,
@@ -7420,17 +7420,17 @@ function Kl(t, e) {
     lazy: c = !1,
     ...h
   } = e;
-  function d(f, p, m = "", g = {}) {
-    const C = `${f}:${m}:${p}`, y = o?.get(C);
-    if (y)
-      return y;
+  function f(d, p, g = "", C = {}) {
+    const y = `${d}:${g}:${p}`, m = o?.get(y);
+    if (m)
+      return m;
     const _ = {
       ...h,
-      lang: f,
+      lang: d,
       meta: {
         ...h.meta,
-        ...g,
-        __raw: m
+        ...C,
+        __raw: g
       }
     };
     n && (_.transformers = [
@@ -7438,14 +7438,14 @@ function Kl(t, e) {
       {
         name: "rehype-shiki:code-language-class",
         code(S) {
-          return this.addClassToHast(S, `${Xl}${f}`), S;
+          return this.addClassToHast(S, `${Kl}${d}`), S;
         }
       }
     ]), l && p.endsWith(`
 `) && (p = p.slice(0, -1));
     try {
       const S = t.codeToHast(p, _);
-      return o?.set(C, S), S;
+      return o?.set(y, S), S;
     } catch (S) {
       if (i)
         i(S);
@@ -7453,32 +7453,32 @@ function Kl(t, e) {
         throw S;
     }
   }
-  return (f) => {
+  return (d) => {
     const p = [];
-    if (Vr(f, "element", (m, g, C) => {
-      let y;
-      if (!C || g == null)
+    if (qr(d, "element", (g, C, y) => {
+      let m;
+      if (!y || C == null)
         return;
-      if (m.tagName === "pre")
-        y = Vl;
-      else if (m.tagName === "code" && u)
-        y = ql[u];
+      if (g.tagName === "pre")
+        m = Xl;
+      else if (g.tagName === "code" && u)
+        m = ql[u];
       else
         return;
-      const _ = y(f, m);
+      const _ = m(d, g);
       if (!_)
         return;
       let S, A = !1;
       if (_.lang ? t.getLoadedLanguages().includes(_.lang) || vo(_.lang) ? S = _.lang : c ? (A = !0, S = _.lang) : a && (S = a) : S = s, !S)
         return;
-      const D = _.meta ? r?.(_.meta, m, f) : void 0, P = (j) => {
-        const Z = d(j, _.code, _.meta, D ?? {});
+      const D = _.meta ? r?.(_.meta, g, d) : void 0, P = (j) => {
+        const Z = f(j, _.code, _.meta, D ?? {});
         if (Z) {
           if (_.type === "inline") {
             const ee = Z.children[0];
             ee.type === "element" && ee.tagName === "pre" && (ee.tagName = "span");
           }
-          C.children[g] = Z;
+          y.children[C] = Z;
         }
       };
       if (A)
@@ -7495,14 +7495,14 @@ function Kl(t, e) {
         P(S);
       return "skip";
     }), p.length > 0) {
-      async function m() {
+      async function g() {
         await Promise.all(p);
       }
-      return m();
+      return g();
     }
   };
 }
-function Yl(t) {
+function Jl(t) {
   if (!t)
     return null;
   const e = t.match(/\{([\d,-]+)\}/);
@@ -7512,7 +7512,7 @@ function Yl(t) {
   }) : null;
 }
 const lr = Symbol("highlighted-lines");
-function Jl(t = {}) {
+function Zl(t = {}) {
   const {
     className: e = "highlighted"
   } = t;
@@ -7522,14 +7522,14 @@ function Jl(t = {}) {
       if (!this.options.meta?.__raw)
         return;
       const o = this.meta;
-      return o[lr] ??= Yl(this.options.meta.__raw), (o[lr] ?? []).includes(r) && this.addClassToHast(n, e), n;
+      return o[lr] ??= Jl(this.options.meta.__raw), (o[lr] ?? []).includes(r) && this.addClassToHast(n, e), n;
     }
   };
 }
-function Zl(t) {
+function Ql(t) {
   return t ? Array.from(t.matchAll(/\/((?:\\.|[^/])+)\//g)).map((n) => n[1].replace(/\\(.)/g, "$1")) : [];
 }
-function Ql(t = {}) {
+function eu(t = {}) {
   const {
     className: e = "highlighted-word"
   } = t;
@@ -7538,10 +7538,10 @@ function Ql(t = {}) {
     preprocess(n, r) {
       if (!this.options.meta?.__raw)
         return;
-      const o = Zl(this.options.meta.__raw);
+      const o = Ql(this.options.meta.__raw);
       r.decorations ||= [];
       for (const s of o) {
-        const a = eu(n, s);
+        const a = tu(n, s);
         for (const i of a)
           r.decorations.push({
             start: i,
@@ -7554,7 +7554,7 @@ function Ql(t = {}) {
     }
   };
 }
-function eu(t, e) {
+function tu(t, e) {
   const n = [];
   let r = 0;
   for (; ; ) {
@@ -7569,7 +7569,7 @@ function Le(t) {
   if ([...t].length !== 1) throw new Error(`Expected "${t}" to be a single code point`);
   return t.codePointAt(0);
 }
-function tu(t, e, n) {
+function nu(t, e, n) {
   return t.has(e) || t.set(e, n), t.get(e);
 }
 const vn = /* @__PURE__ */ new Set(["alnum", "alpha", "ascii", "blank", "cntrl", "digit", "graph", "lower", "print", "punct", "space", "upper", "word", "xdigit"]), B = String.raw;
@@ -7609,10 +7609,10 @@ const $o = B`\[\^?`, To = `c.? | C(?:-.?)?|${B`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x
   | &&
   | .
 `.replace(/\s+/g, ""), "gsu");
-function nu(t, e = {}) {
+function ru(t, e = {}) {
   const n = { flags: "", ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } };
   if (typeof t != "string") throw new Error("String expected as pattern");
-  const r = _u(n.flags), o = [r.extended], s = { captureGroup: n.rules.captureGroup, getCurrentModX() {
+  const r = Su(n.flags), o = [r.extended], s = { captureGroup: n.rules.captureGroup, getCurrentModX() {
     return o.at(-1);
   }, numOpenGroups: 0, popModX() {
     o.pop();
@@ -7623,30 +7623,30 @@ function nu(t, e = {}) {
   }, singleline: n.rules.singleline };
   let a = [], i;
   for (et.lastIndex = 0; i = et.exec(t); ) {
-    const h = ru(s, t, i[0], et.lastIndex);
+    const h = ou(s, t, i[0], et.lastIndex);
     h.tokens ? a.push(...h.tokens) : h.token && a.push(h.token), h.lastIndex !== void 0 && (et.lastIndex = h.lastIndex);
   }
   const l = [];
   let u = 0;
   a.filter((h) => h.type === "GroupOpen").forEach((h) => {
     h.kind === "capturing" ? h.number = ++u : h.raw === "(" && l.push(h);
-  }), u || l.forEach((h, d) => {
-    h.kind = "capturing", h.number = d + 1;
+  }), u || l.forEach((h, f) => {
+    h.kind = "capturing", h.number = f + 1;
   });
   const c = u || l.length;
-  return { tokens: a.map((h) => h.type === "EscapedNumber" ? ku(h, c) : h).flat(), flags: r };
+  return { tokens: a.map((h) => h.type === "EscapedNumber" ? vu(h, c) : h).flat(), flags: r };
 }
-function ru(t, e, n, r) {
+function ou(t, e, n, r) {
   const [o, s] = n;
   if (n === "[" || n === "[^") {
-    const a = ou(e, n, r);
+    const a = su(e, n, r);
     return { tokens: a.tokens, lastIndex: a.lastIndex };
   }
   if (o === "\\") {
     if ("AbBGyYzZ".includes(s)) return { token: ur(n, n) };
     if (/^\\g[<']/.test(n)) {
       if (!/^\\g(?:<[^>]+>|'[^']+')$/.test(n)) throw new Error(`Invalid group name "${n}"`);
-      return { token: du(n) };
+      return { token: gu(n) };
     }
     if (/^\\k[<']/.test(n)) {
       if (!/^\\k(?:<[^>]+>|'[^']+')$/.test(n)) throw new Error(`Invalid group name "${n}"`);
@@ -7660,13 +7660,13 @@ function ru(t, e, n, r) {
     return Array.isArray(a) ? { tokens: a } : { token: a };
   }
   if (o === "(") {
-    if (s === "*") return { token: bu(n) };
+    if (s === "*") return { token: wu(n) };
     if (n === "(?{") throw new Error(`Unsupported callout "${n}"`);
     if (n.startsWith("(?#")) {
       if (e[r] !== ")") throw new Error('Unclosed comment group "(?#"');
       return { lastIndex: r + 1 };
     }
-    if (/^\(\?[-imx]+[:)]$/.test(n)) return { token: yu(n, t) };
+    if (/^\(\?[-imx]+[:)]$/.test(n)) return { token: bu(n, t) };
     if (t.pushModX(t.getCurrentModX()), t.numOpenGroups++, n === "(" && !t.captureGroup || n === "(?:") return { token: Se("group", n) };
     if (n === "(?>") return { token: Se("atomic", n) };
     if (n === "(?=" || n === "(?!" || n === "(?<=" || n === "(?<!") return { token: Se(n[2] === "<" ? "lookbehind" : "lookahead", n, { negate: n.endsWith("!") }) };
@@ -7679,7 +7679,7 @@ function ru(t, e, n, r) {
   }
   if (n === ")") {
     if (t.popModX(), t.numOpenGroups--, t.numOpenGroups < 0) throw new Error('Unmatched ")"');
-    return { token: hu(n) };
+    return { token: pu(n) };
   }
   if (t.getCurrentModX()) {
     if (n === "#") {
@@ -7697,9 +7697,9 @@ function ru(t, e, n, r) {
     const a = t.singleline ? { "^": B`\A`, $: B`\Z` }[n] : n;
     return { token: ur(a, n) };
   }
-  return n === "|" ? { token: au(n) } : xn.test(n) ? { tokens: vu(n) } : { token: se(Le(n), n) };
+  return n === "|" ? { token: iu(n) } : xn.test(n) ? { tokens: xu(n) } : { token: se(Le(n), n) };
 }
-function ou(t, e, n) {
+function su(t, e, n) {
   const r = [cr(e[1] === "^", e)];
   let o = 1, s;
   for (Ot.lastIndex = n; s = Ot.exec(t); ) {
@@ -7707,31 +7707,31 @@ function ou(t, e, n) {
     if (a[0] === "[" && a[1] !== ":") o++, r.push(cr(a[1] === "^", a));
     else if (a === "]") {
       if (r.at(-1).type === "CharacterClassOpen") r.push(se(93, a));
-      else if (o--, r.push(iu(a)), !o) break;
+      else if (o--, r.push(lu(a)), !o) break;
     } else {
-      const i = su(a);
+      const i = au(a);
       Array.isArray(i) ? r.push(...i) : r.push(i);
     }
   }
   return { tokens: r, lastIndex: Ot.lastIndex || t.length };
 }
-function su(t) {
+function au(t) {
   if (t[0] === "\\") return Mo(t, { inCharClass: !0 });
   if (t[0] === "[") {
     const e = /\[:(?<negate>\^?)(?<name>[a-z]+):\]/.exec(t);
     if (!e || !vn.has(e.groups.name)) throw new Error(`Invalid POSIX class "${t}"`);
     return ge("posix", t, { value: e.groups.name, negate: !!e.groups.negate });
   }
-  return t === "-" ? lu(t) : t === "&&" ? uu(t) : se(Le(t), t);
+  return t === "-" ? uu(t) : t === "&&" ? cu(t) : se(Le(t), t);
 }
 function Mo(t, { inCharClass: e }) {
   const n = t[1];
-  if (n === "c" || n === "C") return mu(t);
-  if ("dDhHsSwW".includes(n)) return wu(t);
+  if (n === "c" || n === "C") return yu(t);
+  if ("dDhHsSwW".includes(n)) return Cu(t);
   if (t.startsWith(B`\o{`)) throw new Error(`Incomplete, invalid, or unsupported octal code point "${t}"`);
   if (/^\\[pP]\{/.test(t)) {
     if (t.length === 3) throw new Error(`Incomplete or invalid Unicode property "${t}"`);
-    return Cu(t);
+    return _u(t);
   }
   if (/^\\x[89A-Fa-f]\p{AHex}/u.test(t)) try {
     const r = t.split(/\\x/).slice(1).map((a) => parseInt(a, 16)), o = new TextDecoder("utf-8", { ignoreBOM: !0, fatal: !0 }).decode(new Uint8Array(r)), s = new TextEncoder();
@@ -7742,15 +7742,15 @@ function Mo(t, { inCharClass: e }) {
   } catch {
     throw new Error(`Multibyte code "${t}" incomplete or invalid in Oniguruma`);
   }
-  if (n === "u" || n === "x") return se(Su(t), t);
+  if (n === "u" || n === "x") return se(ku(t), t);
   if (hr.has(n)) return se(hr.get(n), t);
-  if (/\d/.test(n)) return cu(e, t);
+  if (/\d/.test(n)) return hu(e, t);
   if (t === "\\") throw new Error(B`Incomplete escape "\"`);
   if (n === "M") throw new Error(`Unsupported meta "${t}"`);
   if ([...t].length === 2) return se(t.codePointAt(1), t);
   throw new Error(`Unexpected escape "${t}"`);
 }
-function au(t) {
+function iu(t) {
   return { type: "Alternator", raw: t };
 }
 function ur(t, e) {
@@ -7762,13 +7762,13 @@ function Oo(t) {
 function se(t, e) {
   return { type: "Character", value: t, raw: e };
 }
-function iu(t) {
+function lu(t) {
   return { type: "CharacterClassClose", raw: t };
 }
-function lu(t) {
+function uu(t) {
   return { type: "CharacterClassHyphen", raw: t };
 }
-function uu(t) {
+function cu(t) {
   return { type: "CharacterClassIntersector", raw: t };
 }
 function cr(t, e) {
@@ -7780,31 +7780,31 @@ function ge(t, e, n = {}) {
 function Do(t, e, n = {}) {
   return t === "keep" ? { type: "Directive", kind: t, raw: e } : { type: "Directive", kind: t, flags: $e(n.flags), raw: e };
 }
-function cu(t, e) {
+function hu(t, e) {
   return { type: "EscapedNumber", inCharClass: t, raw: e };
 }
-function hu(t) {
+function pu(t) {
   return { type: "GroupClose", raw: t };
 }
 function Se(t, e, n = {}) {
   return { type: "GroupOpen", kind: t, ...n, raw: e };
 }
-function pu(t, e, n, r) {
+function fu(t, e, n, r) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n, raw: r };
 }
-function fu(t, e, n, r) {
+function du(t, e, n, r) {
   return { type: "Quantifier", kind: t, min: e, max: n, raw: r };
 }
-function du(t) {
+function gu(t) {
   return { type: "Subroutine", raw: t };
 }
-const gu = /* @__PURE__ */ new Set(["COUNT", "CMP", "ERROR", "FAIL", "MAX", "MISMATCH", "SKIP", "TOTAL_COUNT"]), hr = /* @__PURE__ */ new Map([["a", 7], ["b", 8], ["e", 27], ["f", 12], ["n", 10], ["r", 13], ["t", 9], ["v", 11]]);
-function mu(t) {
+const mu = /* @__PURE__ */ new Set(["COUNT", "CMP", "ERROR", "FAIL", "MAX", "MISMATCH", "SKIP", "TOTAL_COUNT"]), hr = /* @__PURE__ */ new Map([["a", 7], ["b", 8], ["e", 27], ["f", 12], ["n", 10], ["r", 13], ["t", 9], ["v", 11]]);
+function yu(t) {
   const e = t[1] === "c" ? t[2] : t[3];
   if (!e || !/[A-Za-z]/.test(e)) throw new Error(`Unsupported control character "${t}"`);
   return se(Le(e.toUpperCase()) - 64, t);
 }
-function yu(t, e) {
+function bu(t, e) {
   let { on: n, off: r } = /^\(\?(?<on>[imx]*)(?:-(?<off>[-imx]*))?/.exec(t).groups;
   r ??= "";
   const o = (e.getCurrentModX() || n.includes("x")) && !r.includes("x"), s = fr(n), a = fr(r), i = {};
@@ -7812,13 +7812,13 @@ function yu(t, e) {
   if (t.endsWith(":")) return e.pushModX(o), e.numOpenGroups++, Se("group", t, { ...(s || a) && { flags: i } });
   throw new Error(`Unexpected flag modifier "${t}"`);
 }
-function bu(t) {
+function wu(t) {
   const e = /\(\*(?<name>[A-Za-z_]\w*)?(?:\[(?<tag>(?:[A-Za-z_]\w*)?)\])?(?:\{(?<args>[^}]*)\})?\)/.exec(t);
   if (!e) throw new Error(`Incomplete or invalid named callout "${t}"`);
   const { name: n, tag: r, args: o } = e.groups;
   if (!n) throw new Error(`Invalid named callout "${t}"`);
   if (r === "") throw new Error(`Named callout tag with empty value not allowed "${t}"`);
-  const s = o ? o.split(",").filter((c) => c !== "").map((c) => /^[+-]?\d+$/.test(c) ? +c : c) : [], [a, i, l] = s, u = gu.has(n) ? n.toLowerCase() : "custom";
+  const s = o ? o.split(",").filter((c) => c !== "").map((c) => /^[+-]?\d+$/.test(c) ? +c : c) : [], [a, i, l] = s, u = mu.has(n) ? n.toLowerCase() : "custom";
   switch (u) {
     case "fail":
     case "mismatch":
@@ -7850,7 +7850,7 @@ function bu(t) {
     default:
       throw new Error(`Unexpected named callout kind "${u}"`);
   }
-  return pu(u, r ?? null, o?.split(",") ?? null, t);
+  return fu(u, r ?? null, o?.split(",") ?? null, t);
 }
 function pr(t) {
   let e = null, n, r;
@@ -7862,13 +7862,13 @@ function pr(t) {
       e = "lazy";
     } else e || (e = "greedy");
   } else n = t[0] === "+" ? 1 : 0, r = t[0] === "?" ? 1 : 1 / 0, e = t[1] === "+" ? "possessive" : t[1] === "?" ? "lazy" : "greedy";
-  return fu(e, n, r, t);
+  return du(e, n, r, t);
 }
-function wu(t) {
+function Cu(t) {
   const e = t[1].toLowerCase();
   return ge({ d: "digit", h: "hex", s: "space", w: "word" }[e], t, { negate: t[1] !== e });
 }
-function Cu(t) {
+function _u(t) {
   const { p: e, neg: n, value: r } = /^\\(?<p>[pP])\{(?<neg>\^?)(?<value>[^}]+)/.exec(t).groups;
   return ge("property", t, { value: r, negate: e === "P" && !n || e === "p" && !!n });
 }
@@ -7876,7 +7876,7 @@ function fr(t) {
   const e = {};
   return t.includes("i") && (e.ignoreCase = !0), t.includes("m") && (e.dotAll = !0), t.includes("x") && (e.extended = !0), Object.keys(e).length ? e : null;
 }
-function _u(t) {
+function Su(t) {
   const e = { ignoreCase: !1, dotAll: !1, extended: !1, digitIsAscii: !1, posixIsAscii: !1, spaceIsAscii: !1, wordIsAscii: !1, textSegmentMode: null };
   for (let n = 0; n < t.length; n++) {
     const r = t[n];
@@ -7890,12 +7890,12 @@ function _u(t) {
   }
   return e;
 }
-function Su(t) {
+function ku(t) {
   if (/^(?:\\u(?!\p{AHex}{4})|\\x(?!\p{AHex}{1,2}|\{\p{AHex}{1,8}\}))/u.test(t)) throw new Error(`Incomplete or invalid escape "${t}"`);
   const e = t[2] === "{" ? /^\\x\{\s*(?<hex>\p{AHex}+)/u.exec(t).groups.hex : t.slice(2);
   return parseInt(e, 16);
 }
-function ku(t, e) {
+function vu(t, e) {
   const { raw: n, inCharClass: r } = t, o = n.slice(1);
   if (!r && (o !== "0" && o.length === 1 || o[0] !== "0" && +o <= e)) return [Oo(n)];
   const s = [], a = o.match(/^[0-7]+|\d/g);
@@ -7909,7 +7909,7 @@ function ku(t, e) {
   }
   return s;
 }
-function vu(t) {
+function xu(t) {
   const e = [], n = new RegExp(xn, "gy");
   let r;
   for (; r = n.exec(t); ) {
@@ -7934,62 +7934,62 @@ function Go(t, e) {
   const n = t.body[0];
   return !e || Object.keys(e).every((r) => e[r] === n[r]);
 }
-function xu(t) {
-  return Eu.has(t.type);
+function Eu(t) {
+  return Au.has(t.type);
 }
-const Eu = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
+const Au = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
 function Fo(t, e = {}) {
-  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = nu(t, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), o = (d, f) => {
+  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = ru(t, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), o = (f, d) => {
     const p = r.tokens[s.nextIndex];
-    switch (s.parent = d, s.nextIndex++, p.type) {
+    switch (s.parent = f, s.nextIndex++, p.type) {
       case "Alternator":
         return me();
       case "Assertion":
-        return Au(p);
+        return Ru(p);
       case "Backreference":
-        return Ru(p, s);
+        return Iu(p, s);
       case "Character":
-        return vt(p.value, { useLastValid: !!f.isCheckingRangeEnd });
+        return vt(p.value, { useLastValid: !!d.isCheckingRangeEnd });
       case "CharacterClassHyphen":
-        return Iu(p, s, f);
+        return Nu(p, s, d);
       case "CharacterClassOpen":
-        return Nu(p, s, f);
+        return Pu(p, s, d);
       case "CharacterSet":
-        return Pu(p, s);
+        return Lu(p, s);
       case "Directive":
-        return Du(p.kind, { flags: p.flags });
+        return Gu(p.kind, { flags: p.flags });
       case "GroupOpen":
-        return Lu(p, s, f);
+        return $u(p, s, d);
       case "NamedCallout":
-        return Fu(p.kind, p.tag, p.arguments);
+        return Bu(p.kind, p.tag, p.arguments);
       case "Quantifier":
-        return $u(p, s);
-      case "Subroutine":
         return Tu(p, s);
+      case "Subroutine":
+        return Mu(p, s);
       default:
         throw new Error(`Unexpected token type "${p.type}"`);
     }
-  }, s = { capturingGroups: [], hasNumberedRef: !1, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: n.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: n.skipBackrefValidation, skipLookbehindValidation: n.skipLookbehindValidation, skipPropertyNameValidation: n.skipPropertyNameValidation, subroutines: [], tokens: r.tokens, unicodePropertyMap: n.unicodePropertyMap, walk: o }, a = ju(Gu(r.flags));
+  }, s = { capturingGroups: [], hasNumberedRef: !1, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: n.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: n.skipBackrefValidation, skipLookbehindValidation: n.skipLookbehindValidation, skipPropertyNameValidation: n.skipPropertyNameValidation, subroutines: [], tokens: r.tokens, unicodePropertyMap: n.unicodePropertyMap, walk: o }, a = Uu(Fu(r.flags));
   let i = a.body[0];
   for (; s.nextIndex < r.tokens.length; ) {
-    const d = o(i, {});
-    d.type === "Alternative" ? (a.body.push(d), i = d) : i.body.push(d);
+    const f = o(i, {});
+    f.type === "Alternative" ? (a.body.push(f), i = f) : i.body.push(f);
   }
   const { capturingGroups: l, hasNumberedRef: u, namedGroupsByName: c, subroutines: h } = s;
   if (u && c.size && !n.rules.captureGroup) throw new Error("Numbered backref/subroutine not allowed when using named capture");
-  for (const { ref: d } of h) if (typeof d == "number") {
-    if (d > l.length) throw new Error("Subroutine uses a group number that's not defined");
-    d && (l[d - 1].isSubroutined = !0);
-  } else if (c.has(d)) {
-    if (c.get(d).length > 1) throw new Error(B`Subroutine uses a duplicate group name "\g<${d}>"`);
-    c.get(d)[0].isSubroutined = !0;
-  } else throw new Error(B`Subroutine uses a group name that's not defined "\g<${d}>"`);
+  for (const { ref: f } of h) if (typeof f == "number") {
+    if (f > l.length) throw new Error("Subroutine uses a group number that's not defined");
+    f && (l[f - 1].isSubroutined = !0);
+  } else if (c.has(f)) {
+    if (c.get(f).length > 1) throw new Error(B`Subroutine uses a duplicate group name "\g<${f}>"`);
+    c.get(f)[0].isSubroutined = !0;
+  } else throw new Error(B`Subroutine uses a group name that's not defined "\g<${f}>"`);
   return a;
 }
-function Au({ kind: t }) {
+function Ru({ kind: t }) {
   return on($e({ "^": "line_start", $: "line_end", "\\A": "string_start", "\\b": "word_boundary", "\\B": "word_boundary", "\\G": "search_start", "\\y": "text_segment_boundary", "\\Y": "text_segment_boundary", "\\z": "string_end", "\\Z": "string_end_newline" }[t], `Unexpected assertion kind "${t}"`), { negate: t === B`\B` || t === B`\Y` });
 }
-function Ru({ raw: t }, e) {
+function Iu({ raw: t }, e) {
   const n = /^\\k[<']/.test(t), r = n ? t.slice(3, -1) : t.slice(1), o = (s, a = !1) => {
     const i = e.capturingGroups.length;
     let l = !1;
@@ -8006,16 +8006,16 @@ function Ru({ raw: t }, e) {
   }
   return o(+r);
 }
-function Iu(t, e, n) {
+function Nu(t, e, n) {
   const { tokens: r, walk: o } = e, s = e.parent, a = s.body.at(-1), i = r[e.nextIndex];
   if (!n.isCheckingRangeEnd && a && a.type !== "CharacterClass" && a.type !== "CharacterClassRange" && i && i.type !== "CharacterClassOpen" && i.type !== "CharacterClassClose" && i.type !== "CharacterClassIntersector") {
     const l = o(s, { ...n, isCheckingRangeEnd: !0 });
-    if (a.type === "Character" && l.type === "Character") return s.body.pop(), Ou(a, l);
+    if (a.type === "Character" && l.type === "Character") return s.body.pop(), Du(a, l);
     throw new Error("Invalid character class range");
   }
   return vt(Le("-"));
 }
-function Nu({ negate: t }, e, n) {
+function Pu({ negate: t }, e, n) {
   const { tokens: r, walk: o } = e, s = r[e.nextIndex], a = [st()];
   let i = mr(s);
   for (; i.type !== "CharacterClassClose"; ) {
@@ -8029,41 +8029,41 @@ function Nu({ negate: t }, e, n) {
   const l = st({ negate: t });
   return a.length === 1 ? l.body = a[0].body : (l.kind = "intersection", l.body = a.map((u) => u.body.length === 1 ? u.body[0] : u)), e.nextIndex++, l;
 }
-function Pu({ kind: t, negate: e, value: n }, r) {
+function Lu({ kind: t, negate: e, value: n }, r) {
   const { normalizeUnknownPropertyNames: o, skipPropertyNameValidation: s, unicodePropertyMap: a } = r;
   if (t === "property") {
     const i = xt(n);
     if (vn.has(i) && !a?.has(i)) t = "posix", n = i;
     else return ke(n, { negate: e, normalizeUnknownPropertyNames: o, skipPropertyNameValidation: s, unicodePropertyMap: a });
   }
-  return t === "posix" ? Bu(n, { negate: e }) : an(t, { negate: e });
+  return t === "posix" ? ju(n, { negate: e }) : an(t, { negate: e });
 }
-function Lu(t, e, n) {
-  const { tokens: r, capturingGroups: o, namedGroupsByName: s, skipLookbehindValidation: a, walk: i } = e, l = Uu(t), u = l.type === "AbsenceFunction", c = gr(l), h = c && l.negate;
-  if (l.type === "CapturingGroup" && (o.push(l), l.name && tu(s, l.name, []).push(l)), u && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
-  let d = yr(r[e.nextIndex]);
-  for (; d.type !== "GroupClose"; ) {
-    if (d.type === "Alternator") l.body.push(me()), e.nextIndex++;
+function $u(t, e, n) {
+  const { tokens: r, capturingGroups: o, namedGroupsByName: s, skipLookbehindValidation: a, walk: i } = e, l = zu(t), u = l.type === "AbsenceFunction", c = gr(l), h = c && l.negate;
+  if (l.type === "CapturingGroup" && (o.push(l), l.name && nu(s, l.name, []).push(l)), u && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
+  let f = yr(r[e.nextIndex]);
+  for (; f.type !== "GroupClose"; ) {
+    if (f.type === "Alternator") l.body.push(me()), e.nextIndex++;
     else {
-      const f = l.body.at(-1), p = i(f, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || u, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || h });
-      if (f.body.push(p), (c || n.isInLookbehind) && !a) {
-        const m = "Lookbehind includes a pattern not allowed by Oniguruma";
+      const d = l.body.at(-1), p = i(d, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || u, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || h });
+      if (d.body.push(p), (c || n.isInLookbehind) && !a) {
+        const g = "Lookbehind includes a pattern not allowed by Oniguruma";
         if (h || n.isInNegLookbehind) {
-          if (dr(p) || p.type === "CapturingGroup") throw new Error(m);
-        } else if (dr(p) || gr(p) && p.negate) throw new Error(m);
+          if (dr(p) || p.type === "CapturingGroup") throw new Error(g);
+        } else if (dr(p) || gr(p) && p.negate) throw new Error(g);
       }
     }
-    d = yr(r[e.nextIndex]);
+    f = yr(r[e.nextIndex]);
   }
   return e.nextIndex++, l;
 }
-function $u({ kind: t, min: e, max: n }, r) {
+function Tu({ kind: t, min: e, max: n }, r) {
   const o = r.parent, s = o.body.at(-1);
-  if (!s || !xu(s)) throw new Error("Quantifier requires a repeatable token");
+  if (!s || !Eu(s)) throw new Error("Quantifier requires a repeatable token");
   const a = jo(t, e, n, s);
   return o.body.pop(), a;
 }
-function Tu({ raw: t }, e) {
+function Mu({ raw: t }, e) {
   const { capturingGroups: n, subroutines: r } = e;
   let o = t.slice(3, -1);
   const s = /^(?<sign>[-+]?)0*(?<num>[1-9]\d*)$/.exec(o);
@@ -8074,7 +8074,7 @@ function Tu({ raw: t }, e) {
   const a = Uo(o);
   return r.push(a), a;
 }
-function Mu(t, e) {
+function Ou(t, e) {
   return { type: "AbsenceFunction", kind: t, body: Ye(e?.body) };
 }
 function me(t) {
@@ -8090,7 +8090,7 @@ function sn(t, e) {
 }
 function Bo(t, e) {
   const n = { name: void 0, isSubroutined: !1, ...e };
-  if (n.name !== void 0 && !zu(n.name)) throw new Error(`Group name "${n.name}" invalid in Oniguruma`);
+  if (n.name !== void 0 && !Hu(n.name)) throw new Error(`Group name "${n.name}" invalid in Oniguruma`);
   return { type: "CapturingGroup", number: t, ...n.name && { name: n.name }, ...n.isSubroutined && { isSubroutined: n.isSubroutined }, body: Ye(e?.body) };
 }
 function vt(t, e) {
@@ -8106,7 +8106,7 @@ function st(t) {
   const e = { kind: "union", negate: !1, ...t };
   return { type: "CharacterClass", kind: e.kind, negate: e.negate, body: zo(t?.body) };
 }
-function Ou(t, e) {
+function Du(t, e) {
   if (e.value < t.value) throw new Error("Character class range out of order");
   return { type: "CharacterClassRange", min: t, max: e };
 }
@@ -8114,12 +8114,12 @@ function an(t, e) {
   const n = !!e?.negate, r = { type: "CharacterSet", kind: t };
   return (t === "digit" || t === "hex" || t === "newline" || t === "space" || t === "word") && (r.negate = n), (t === "text_segment" || t === "newline" && !n) && (r.variableLength = !0), r;
 }
-function Du(t, e = {}) {
+function Gu(t, e = {}) {
   if (t === "keep") return { type: "Directive", kind: t };
   if (t === "flags") return { type: "Directive", kind: t, flags: $e(e.flags) };
   throw new Error(`Unexpected directive kind "${t}"`);
 }
-function Gu(t) {
+function Fu(t) {
   return { type: "Flags", ...t };
 }
 function Q(t) {
@@ -8131,10 +8131,10 @@ function fe(t) {
   const e = { behind: !1, negate: !1, ...t };
   return { type: "LookaroundAssertion", kind: e.behind ? "lookbehind" : "lookahead", negate: e.negate, body: Ye(t?.body) };
 }
-function Fu(t, e, n) {
+function Bu(t, e, n) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n };
 }
-function Bu(t, e) {
+function ju(t, e) {
   const n = !!e?.negate;
   if (!vn.has(t)) throw new Error(`Invalid POSIX class "${t}"`);
   return { type: "CharacterSet", kind: "posix", value: t, negate: n };
@@ -8143,7 +8143,7 @@ function jo(t, e, n, r) {
   if (e > n) throw new Error("Invalid reversed quantifier range");
   return { type: "Quantifier", kind: t, min: e, max: n, body: r };
 }
-function ju(t, e) {
+function Uu(t, e) {
   return { type: "Regex", body: Ye(e?.body), flags: t };
 }
 function Uo(t) {
@@ -8153,15 +8153,15 @@ function ke(t, e) {
   const n = { negate: !1, normalizeUnknownPropertyNames: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e };
   let r = n.unicodePropertyMap?.get(xt(t));
   if (!r) {
-    if (n.normalizeUnknownPropertyNames) r = Hu(t);
+    if (n.normalizeUnknownPropertyNames) r = Wu(t);
     else if (n.unicodePropertyMap && !n.skipPropertyNameValidation) throw new Error(B`Invalid Unicode property "\p{${t}}"`);
   }
   return { type: "CharacterSet", kind: "property", value: r ?? t, negate: n.negate };
 }
-function Uu({ flags: t, kind: e, name: n, negate: r, number: o }) {
+function zu({ flags: t, kind: e, name: n, negate: r, number: o }) {
   switch (e) {
     case "absence_repeater":
-      return Mu("repeater");
+      return Ou("repeater");
     case "atomic":
       return Q({ atomic: !0 });
     case "capturing":
@@ -8191,10 +8191,10 @@ function dr(t) {
 function gr(t) {
   return t.type === "LookaroundAssertion" && t.kind === "lookbehind";
 }
-function zu(t) {
+function Hu(t) {
   return /^[\p{Alpha}\p{Pc}][^)]*$/u.test(t);
 }
-function Hu(t) {
+function Wu(t) {
   return t.trim().replace(/[- _]+/g, "_").replace(/[A-Z][a-z]+(?=[A-Z])/g, "$&_").replace(/[A-Za-z]+/g, (e) => e[0].toUpperCase() + e.slice(1).toLowerCase());
 }
 function xt(t) {
@@ -8220,22 +8220,22 @@ function Be(t, e, n = null) {
     }, removeAllNextSiblings() {
       return tt(l).splice(Ce(i) + 1);
     }, removeAllPrevSiblings() {
-      const C = Ce(i) + u;
-      return u -= C, tt(l).splice(0, Math.max(0, C));
-    }, replaceWith(C, y = {}) {
-      const _ = !!y.traverse;
-      l ? l[Math.max(0, Ce(i) + u)] = C : $e(a, "Can't replace root node")[i] = C, _ && o(C, a, i, l), c = !0;
-    }, replaceWithMultiple(C, y = {}) {
-      const _ = !!y.traverse;
-      if (tt(l).splice(Math.max(0, Ce(i) + u), 1, ...C), u += C.length - 1, _) {
+      const y = Ce(i) + u;
+      return u -= y, tt(l).splice(0, Math.max(0, y));
+    }, replaceWith(y, m = {}) {
+      const _ = !!m.traverse;
+      l ? l[Math.max(0, Ce(i) + u)] = y : $e(a, "Can't replace root node")[i] = y, _ && o(y, a, i, l), c = !0;
+    }, replaceWithMultiple(y, m = {}) {
+      const _ = !!m.traverse;
+      if (tt(l).splice(Math.max(0, Ce(i) + u), 1, ...y), u += y.length - 1, _) {
         let S = 0;
-        for (let A = 0; A < C.length; A++) S += o(C[A], a, Ce(i) + A + S, l);
+        for (let A = 0; A < y.length; A++) S += o(y[A], a, Ce(i) + A + S, l);
       }
       c = !0;
     }, skip() {
       c = !0;
-    } }, { type: d } = s, f = e["*"], p = e[d], m = typeof f == "function" ? f : f?.enter, g = typeof p == "function" ? p : p?.enter;
-    if (m?.(h, n), g?.(h, n), !c) switch (d) {
+    } }, { type: f } = s, d = e["*"], p = e[f], g = typeof d == "function" ? d : d?.enter, C = typeof p == "function" ? p : p?.enter;
+    if (g?.(h, n), C?.(h, n), !c) switch (f) {
       case "AbsenceFunction":
       case "CapturingGroup":
       case "Group":
@@ -8267,9 +8267,9 @@ function Be(t, e, n = null) {
         r(s.body, s), o(s.flags, s, "flags");
         break;
       default:
-        throw new Error(`Unexpected node type "${d}"`);
+        throw new Error(`Unexpected node type "${f}"`);
     }
-    return p?.exit?.(h, n), f?.exit?.(h, n), u;
+    return p?.exit?.(h, n), d?.exit?.(h, n), u;
   }
   return o(t), t;
 }
@@ -8281,12 +8281,12 @@ function Ce(t) {
   if (typeof t != "number") throw new Error("Numeric key expected");
   return t;
 }
-const Wu = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
+const Vu = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
 function qu(t, e) {
   for (let n = 0; n < t.length; n++)
     t[n] >= e && t[n]++;
 }
-function Vu(t, e, n, r) {
+function Xu(t, e, n, r) {
   return t.slice(0, e) + r + t.slice(e + n.length);
 }
 const J = Object.freeze({
@@ -8312,7 +8312,7 @@ function En(t, e, n, r) {
 function Ho(t, e, n, r) {
   En(t, e, n, r);
 }
-function Xu(t, e, n = 0, r) {
+function Ku(t, e, n = 0, r) {
   if (!new RegExp(e, "su").test(t))
     return null;
   const o = new RegExp(`${e}|(?<$skip>\\\\?.)`, "gsu");
@@ -8327,9 +8327,9 @@ function Xu(t, e, n = 0, r) {
   return null;
 }
 function nt(t, e, n) {
-  return !!Xu(t, e, 0, n);
+  return !!Ku(t, e, 0, n);
 }
-function Ku(t, e) {
+function Yu(t, e) {
   const n = /\\?./gsu;
   n.lastIndex = e;
   let r = t.length, o = 0, s = 1, a;
@@ -8348,8 +8348,8 @@ function Ku(t, e) {
   }
   return t.slice(e, r);
 }
-const br = new RegExp(String.raw`(?<noncapturingStart>${Wu})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
-function Yu(t, e) {
+const br = new RegExp(String.raw`(?<noncapturingStart>${Vu})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
+function Ju(t, e) {
   const n = e?.hiddenCaptures ?? [];
   let r = e?.captureTransfers ?? /* @__PURE__ */ new Map();
   if (!/\(\?>/.test(t))
@@ -8362,24 +8362,24 @@ function Yu(t, e) {
   let l = 0, u = 0, c = NaN, h;
   do {
     h = !1;
-    let d = 0, f = 0, p = !1, m;
-    for (br.lastIndex = Number.isNaN(c) ? 0 : c + s.length; m = br.exec(t); ) {
-      const { 0: g, index: C, groups: { capturingStart: y, noncapturingStart: _ } } = m;
-      if (g === "[")
-        d++;
-      else if (d)
-        g === "]" && d--;
-      else if (g === o && !p)
-        c = C, p = !0;
-      else if (p && _)
+    let f = 0, d = 0, p = !1, g;
+    for (br.lastIndex = Number.isNaN(c) ? 0 : c + s.length; g = br.exec(t); ) {
+      const { 0: C, index: y, groups: { capturingStart: m, noncapturingStart: _ } } = g;
+      if (C === "[")
         f++;
-      else if (y)
-        p ? f++ : (l++, a.push(l + u));
-      else if (g === ")" && p) {
-        if (!f) {
+      else if (f)
+        C === "]" && f--;
+      else if (C === o && !p)
+        c = y, p = !0;
+      else if (p && _)
+        d++;
+      else if (m)
+        p ? d++ : (l++, a.push(l + u));
+      else if (C === ")" && p) {
+        if (!d) {
           u++;
           const S = l + u;
-          if (t = `${t.slice(0, c)}${s}${t.slice(c + o.length, C)}))<$$${S}>)${t.slice(C + 1)}`, h = !0, i.push(S), qu(n, S), r.size) {
+          if (t = `${t.slice(0, c)}${s}${t.slice(c + o.length, y)}))<$$${S}>)${t.slice(y + 1)}`, h = !0, i.push(S), qu(n, S), r.size) {
             const A = /* @__PURE__ */ new Map();
             r.forEach((D, P) => {
               A.set(
@@ -8390,19 +8390,19 @@ function Yu(t, e) {
           }
           break;
         }
-        f--;
+        d--;
       }
     }
   } while (h);
   return n.push(...i), t = En(
     t,
     String.raw`\\(?<backrefNum>[1-9]\d*)|<\$\$(?<wrappedBackrefNum>\d+)>`,
-    ({ 0: d, groups: { backrefNum: f, wrappedBackrefNum: p } }) => {
-      if (f) {
-        const m = +f;
-        if (m > a.length - 1)
-          throw new Error(`Backref "${d}" greater than number of captures`);
-        return `\\${a[m]}`;
+    ({ 0: f, groups: { backrefNum: d, wrappedBackrefNum: p } }) => {
+      if (d) {
+        const g = +d;
+        if (g > a.length - 1)
+          throw new Error(`Backref "${f}" greater than number of captures`);
+        return `\\${a[g]}`;
       }
       return `\\${p}`;
     },
@@ -8429,7 +8429,7 @@ const Wo = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, Dt = new RegExp(String.raw`
 | (?<qBase>${Wo})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
 | \\?.
 `.replace(/\s+/g, ""), "gsu");
-function Ju(t) {
+function Zu(t) {
   if (!new RegExp(`${Wo}\\+`).test(t))
     return {
       pattern: t
@@ -8446,20 +8446,20 @@ function Ju(t) {
       if (c === "+" && o && !o.startsWith("(")) {
         if (h)
           throw new Error(`Invalid quantifier "${i}"`);
-        let d = -1;
+        let f = -1;
         if (/^\{\d+\}$/.test(u))
-          t = Vu(t, l + u.length, c, "");
+          t = Xu(t, l + u.length, c, "");
         else {
           if (o === ")" || o === "]") {
-            const f = o === ")" ? n : r;
-            if (f === null)
+            const d = o === ")" ? n : r;
+            if (d === null)
               throw new Error(`Invalid unmatched "${o}"`);
-            t = `${t.slice(0, f)}(?>${t.slice(f, l)}${u})${t.slice(l + i.length)}`;
+            t = `${t.slice(0, d)}(?>${t.slice(d, l)}${u})${t.slice(l + i.length)}`;
           } else
             t = `${t.slice(0, l - o.length)}(?>${o}${u})${t.slice(l + i.length)}`;
-          d += 4;
+          f += 4;
         }
-        Dt.lastIndex += d;
+        Dt.lastIndex += f;
       } else i[0] === "(" ? e.push(l) : i === ")" && (n = e.length ? e.pop() : null);
     o = i;
   }
@@ -8467,8 +8467,8 @@ function Ju(t) {
     pattern: t
   };
 }
-const Y = String.raw, Zu = Y`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, ln = Y`\(\?R=(?<rDepth>[^\)]+)\)|${Zu}`, Et = Y`\(\?<(?![=!])(?<captureName>[^>]+)>`, qo = Y`${Et}|(?<unnamed>\()(?!\?)`, he = new RegExp(Y`${Et}|${ln}|\(\?|\\?.`, "gsu"), Gt = "Cannot use multiple overlapping recursions";
-function Qu(t, e) {
+const Y = String.raw, Qu = Y`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, ln = Y`\(\?R=(?<rDepth>[^\)]+)\)|${Qu}`, Et = Y`\(\?<(?![=!])(?<captureName>[^>]+)>`, Vo = Y`${Et}|(?<unnamed>\()(?!\?)`, he = new RegExp(Y`${Et}|${ln}|\(\?|\\?.`, "gsu"), Gt = "Cannot use multiple overlapping recursions";
+function ec(t, e) {
   const { hiddenCaptures: n, mode: r } = {
     hiddenCaptures: [],
     mode: "plugin",
@@ -8484,15 +8484,15 @@ function Qu(t, e) {
   if (r === "plugin" && nt(t, Y`\(\?\(DEFINE\)`, J.DEFAULT))
     throw new Error("DEFINE groups cannot be used with recursion");
   const s = [], a = nt(t, Y`\\[1-9]`, J.DEFAULT), i = /* @__PURE__ */ new Map(), l = [];
-  let u = !1, c = 0, h = 0, d;
-  for (he.lastIndex = 0; d = he.exec(t); ) {
-    const { 0: f, groups: { captureName: p, rDepth: m, gRNameOrNum: g, gRDepth: C } } = d;
-    if (f === "[")
+  let u = !1, c = 0, h = 0, f;
+  for (he.lastIndex = 0; f = he.exec(t); ) {
+    const { 0: d, groups: { captureName: p, rDepth: g, gRNameOrNum: C, gRDepth: y } } = f;
+    if (d === "[")
       c++;
     else if (c)
-      f === "]" && c--;
-    else if (m) {
-      if (wr(m), u)
+      d === "]" && c--;
+    else if (g) {
+      if (wr(g), u)
         throw new Error(Gt);
       if (a)
         throw new Error(
@@ -8500,12 +8500,12 @@ function Qu(t, e) {
           // gone through conversion from named to numbered, so avoid a misleading error
           `${r === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with global recursion`
         );
-      const y = t.slice(0, d.index), _ = t.slice(he.lastIndex);
+      const m = t.slice(0, f.index), _ = t.slice(he.lastIndex);
       if (nt(_, ln, J.DEFAULT))
         throw new Error(Gt);
-      const S = +m - 1;
+      const S = +g - 1;
       t = Cr(
-        y,
+        m,
         _,
         S,
         !1,
@@ -8514,32 +8514,32 @@ function Qu(t, e) {
         h
       ), o = Sr(
         o,
-        y,
+        m,
         S,
         s.length,
         0,
         h
       );
       break;
-    } else if (g) {
-      wr(C);
-      let y = !1;
+    } else if (C) {
+      wr(y);
+      let m = !1;
       for (const te of l)
-        if (te.name === g || te.num === +g) {
-          if (y = !0, te.hasRecursedWithin)
+        if (te.name === C || te.num === +C) {
+          if (m = !0, te.hasRecursedWithin)
             throw new Error(Gt);
           break;
         }
-      if (!y)
-        throw new Error(Y`Recursive \g cannot be used outside the referenced group "${r === "external" ? g : Y`\g<${g}&R=${C}>`}"`);
-      const _ = i.get(g), S = Ku(t, _);
+      if (!m)
+        throw new Error(Y`Recursive \g cannot be used outside the referenced group "${r === "external" ? C : Y`\g<${C}&R=${y}>`}"`);
+      const _ = i.get(C), S = Yu(t, _);
       if (a && nt(S, Y`${Et}|\((?!\?)`, J.DEFAULT))
         throw new Error(
           // When used in `external` mode by transpilers other than Regex+, backrefs might have
           // gone through conversion from named to numbered, so avoid a misleading error
           `${r === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with recursion of capturing groups`
         );
-      const A = t.slice(_, d.index), D = S.slice(A.length + f.length), P = s.length, j = +C - 1, Z = Cr(
+      const A = t.slice(_, f.index), D = S.slice(A.length + d.length), P = s.length, j = +y - 1, Z = Cr(
         A,
         D,
         j,
@@ -8557,16 +8557,16 @@ function Qu(t, e) {
         h
       );
       const ee = t.slice(0, _), ce = t.slice(_ + S.length);
-      t = `${ee}${Z}${ce}`, he.lastIndex += Z.length - f.length - A.length - D.length, l.forEach((te) => te.hasRecursedWithin = !0), u = !0;
+      t = `${ee}${Z}${ce}`, he.lastIndex += Z.length - d.length - A.length - D.length, l.forEach((te) => te.hasRecursedWithin = !0), u = !0;
     } else if (p)
       h++, i.set(String(h), he.lastIndex), i.set(p, he.lastIndex), l.push({
         num: h,
         name: p
       });
-    else if (f[0] === "(") {
-      const y = f === "(";
-      y && (h++, i.set(String(h), he.lastIndex)), l.push(y ? { num: h } : {});
-    } else f === ")" && l.pop();
+    else if (d[0] === "(") {
+      const m = d === "(";
+      m && (h++, i.set(String(h), he.lastIndex)), l.push(m ? { num: h } : {});
+    } else d === ")" && l.pop();
   }
   return n.push(...s), {
     pattern: t,
@@ -8602,45 +8602,45 @@ function _r(t, e, n, r, o, s, a) {
     const h = l(c);
     u += En(
       t,
-      Y`${qo}|\\k<(?<backref>[^>]+)>`,
-      ({ 0: d, groups: { captureName: f, unnamed: p, backref: m } }) => {
-        if (m && r && !r.has(m))
-          return d;
-        const g = `_$${h}`;
-        if (p || f) {
-          const C = a + s.length + 1;
-          return s.push(C), ec(o, C), p ? d : `(?<${f}${g}>`;
+      Y`${Vo}|\\k<(?<backref>[^>]+)>`,
+      ({ 0: f, groups: { captureName: d, unnamed: p, backref: g } }) => {
+        if (g && r && !r.has(g))
+          return f;
+        const C = `_$${h}`;
+        if (p || d) {
+          const y = a + s.length + 1;
+          return s.push(y), tc(o, y), p ? f : `(?<${d}${C}>`;
         }
-        return Y`\k<${m}${g}>`;
+        return Y`\k<${g}${C}>`;
       },
       J.DEFAULT
     );
   }
   return u;
 }
-function ec(t, e) {
+function tc(t, e) {
   for (let n = 0; n < t.length; n++)
     t[n] >= e && t[n]++;
 }
 function Sr(t, e, n, r, o, s) {
   if (t.size && r) {
     let a = 0;
-    Ho(e, qo, () => a++, J.DEFAULT);
+    Ho(e, Vo, () => a++, J.DEFAULT);
     const i = s - a + o, l = /* @__PURE__ */ new Map();
     return t.forEach((u, c) => {
-      const h = (r - a * n) / n, d = a * n, f = c > i + a ? c + r : c, p = [];
-      for (const m of u)
-        if (m <= i)
-          p.push(m);
-        else if (m > i + a + h)
-          p.push(m + r);
-        else if (m <= i + a)
-          for (let g = 0; g <= n; g++)
-            p.push(m + a * g);
+      const h = (r - a * n) / n, f = a * n, d = c > i + a ? c + r : c, p = [];
+      for (const g of u)
+        if (g <= i)
+          p.push(g);
+        else if (g > i + a + h)
+          p.push(g + r);
+        else if (g <= i + a)
+          for (let C = 0; C <= n; C++)
+            p.push(g + a * C);
         else
-          for (let g = 0; g <= n; g++)
-            p.push(m + d + h * g);
-      l.set(f, p);
+          for (let C = 0; C <= n; C++)
+            p.push(g + f + h * C);
+      l.set(d, p);
     }), l;
   }
   return t;
@@ -8678,13 +8678,13 @@ function bt(t, { enable: e, disable: n }) {
     ignoreCase: !n?.ignoreCase && !!(e?.ignoreCase || t.ignoreCase)
   };
 }
-function qe(t, e, n) {
+function Ve(t, e, n) {
   return t.has(e) || t.set(e, n), t.get(e);
 }
 function un(t, e) {
   return kr[t] >= kr[e];
 }
-function tc(t, e) {
+function nc(t, e) {
   if (t == null)
     throw new Error(e ?? "Value expected");
   return t;
@@ -8693,7 +8693,7 @@ var kr = {
   ES2025: 2025,
   ES2024: 2024,
   ES2018: 2018
-}, nc = (
+}, rc = (
   /** @type {const} */
   {
     auto: "auto",
@@ -8702,10 +8702,10 @@ var kr = {
     ES2018: "ES2018"
   }
 );
-function Vo(t = {}) {
+function qo(t = {}) {
   if ({}.toString.call(t) !== "[object Object]")
     throw new Error("Unexpected options");
-  if (t.target !== void 0 && !nc[t.target])
+  if (t.target !== void 0 && !rc[t.target])
     throw new Error(`Unexpected target "${t.target}"`);
   const e = {
     // Sets the level of emulation rigor/strictness.
@@ -8749,16 +8749,16 @@ function Vo(t = {}) {
   };
   return e.target === "auto" && (e.target = ae.flagGroups ? "ES2025" : ae.unicodeSets ? "ES2024" : "ES2018"), e;
 }
-var rc = "[	-\r ]", oc = /* @__PURE__ */ new Set([
+var oc = "[	-\r ]", sc = /* @__PURE__ */ new Set([
   M(304),
   // İ
   M(305)
   // ı
 ]), re = v`[\p{L}\p{M}\p{N}\p{Pc}]`;
 function Xo(t) {
-  if (oc.has(t))
+  if (sc.has(t))
     return [t];
-  const e = /* @__PURE__ */ new Set(), n = t.toLowerCase(), r = n.toUpperCase(), o = ic.get(n), s = sc.get(n), a = ac.get(n);
+  const e = /* @__PURE__ */ new Set(), n = t.toLowerCase(), r = n.toUpperCase(), o = lc.get(n), s = ac.get(n), a = ic.get(n);
   return [...r].length === 1 && e.add(r), a && e.add(a), o && e.add(o), e.add(n), s && e.add(s), [...e];
 }
 var An = /* @__PURE__ */ new Map(
@@ -8853,12 +8853,12 @@ Variation_Selector VS
 White_Space space
 XID_Continue XIDC
 XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
-), sc = /* @__PURE__ */ new Map([
+), ac = /* @__PURE__ */ new Map([
   ["s", M(383)],
   // s, ſ
   [M(383), "s"]
   // ſ, s
-]), ac = /* @__PURE__ */ new Map([
+]), ic = /* @__PURE__ */ new Map([
   [M(223), M(7838)],
   // ß, ẞ
   [M(107), M(8490)],
@@ -8867,7 +8867,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   // å, Å (Angstrom)
   [M(969), M(8486)]
   // ω, Ω (Ohm)
-]), ic = new Map([
+]), lc = new Map([
   ie(453),
   ie(456),
   ie(459),
@@ -8878,7 +8878,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   ie(8124),
   ie(8140),
   ie(8188)
-]), lc = /* @__PURE__ */ new Map([
+]), uc = /* @__PURE__ */ new Map([
   ["alnum", v`[\p{Alpha}\p{Nd}]`],
   ["alpha", v`\p{Alpha}`],
   ["ascii", v`\p{ASCII}`],
@@ -8895,7 +8895,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   ["word", v`[\p{Alpha}\p{M}\p{Nd}\p{Pc}]`],
   ["xdigit", v`\p{AHex}`]
 ]);
-function uc(t, e) {
+function cc(t, e) {
   const n = [];
   for (let r = t; r <= e; r++)
     n.push(r);
@@ -8906,7 +8906,7 @@ function ie(t) {
   return [e.toLowerCase(), e];
 }
 function Ft(t, e) {
-  return uc(t, e).map((n) => ie(n));
+  return cc(t, e).map((n) => ie(n));
 }
 var Ko = /* @__PURE__ */ new Set([
   "Lower",
@@ -8924,7 +8924,7 @@ var Ko = /* @__PURE__ */ new Set([
   // generally extreme edge cases and using such properties case insensitively generally produces
   // undesired behavior anyway
 ]);
-function cc(t, e) {
+function hc(t, e) {
   const n = {
     // A couple edge cases exist where options `accuracy` and `bestEffortTarget` are used:
     // - `CharacterSet` kind `text_segment` (`\X`): An exact representation would require heavy
@@ -8955,7 +8955,7 @@ function cc(t, e) {
     spaceIsAscii: t.flags.spaceIsAscii,
     wordIsAscii: t.flags.wordIsAscii
   };
-  Be(t, hc, r);
+  Be(t, pc, r);
   const o = {
     dotAll: t.flags.dotAll,
     ignoreCase: t.flags.ignoreCase
@@ -8970,16 +8970,16 @@ function cc(t, e) {
     reffedNodesByReferencer: /* @__PURE__ */ new Map(),
     subroutineRefMap: r.subroutineRefMap
   };
-  Be(t, pc, s);
+  Be(t, fc, s);
   const a = {
     groupsByName: s.groupsByName,
     highestOrphanBackref: 0,
     numCapturesToLeft: 0,
     reffedNodesByReferencer: s.reffedNodesByReferencer
   };
-  return Be(t, fc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
+  return Be(t, dc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
 }
-var hc = {
+var pc = {
   AbsenceFunction({ node: t, parent: e, replaceWith: n }) {
     const { body: r, kind: o } = t;
     if (o === "repeater") {
@@ -9001,7 +9001,7 @@ var hc = {
       const o = t.body.filter((s) => s.kind === "flags");
       for (let s = n + 1; s < e.body.length; s++) {
         const a = e.body[s];
-        qe(r, a, []).push(...o);
+        Ve(r, a, []).push(...o);
       }
     },
     exit({ node: t }, { flagDirectivesByAlt: e }) {
@@ -9015,7 +9015,7 @@ var hc = {
     }
   },
   Assertion({ node: t, parent: e, key: n, container: r, root: o, remove: s, replaceWith: a }, i) {
-    const { kind: l, negate: u } = t, { asciiWordBoundaries: c, avoidSubclass: h, supportedGNodes: d, wordIsAscii: f } = i;
+    const { kind: l, negate: u } = t, { asciiWordBoundaries: c, avoidSubclass: h, supportedGNodes: f, wordIsAscii: d } = i;
     if (l === "text_segment_boundary")
       throw new Error(`Unsupported text segment boundary "\\${u ? "Y" : "y"}"`);
     if (l === "line_end")
@@ -9027,11 +9027,11 @@ var hc = {
     else if (l === "line_start")
       a(L(oe(v`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), e));
     else if (l === "search_start")
-      if (d.has(t))
+      if (f.has(t))
         o.flags.sticky = !0, s();
       else {
         const p = r[n - 1];
-        if (p && wc(p))
+        if (p && Cc(p))
           a(L(fe({ negate: !0 }), e));
         else {
           if (h)
@@ -9042,9 +9042,9 @@ var hc = {
     else if (!(l === "string_end" || l === "string_start")) if (l === "string_end_newline")
       a(L(oe(v`(?=\n?\z)`), e));
     else if (l === "word_boundary") {
-      if (!f && !c) {
-        const p = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, m = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
-        a(L(oe(u ? m : p), e));
+      if (!d && !c) {
+        const p = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
+        a(L(oe(u ? g : p), e));
       }
     } else
       throw new Error(`Unexpected assertion kind "${l}"`);
@@ -9070,7 +9070,7 @@ var hc = {
       return;
     }
     if (a && (l === "space" || c === "space")) {
-      n(L(Ut(oe(rc), u), e));
+      n(L(Ut(oe(oc), u), e));
       return;
     }
     if (i && (l === "word" || c === "word")) {
@@ -9084,10 +9084,10 @@ var hc = {
     else if (l !== "dot") if (l === "text_segment") {
       if (r === "strict")
         throw new Error(v`Use of "\X" requires non-strict accuracy`);
-      const h = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", d = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
+      const h = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", f = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
       n(L(oe(
         // Close approximation of an extended grapheme cluster; see: <unicode.org/reports/tr29/>
-        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : d}|\P{M}\p{M}*)`,
+        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : f}|\P{M}\p{M}*)`,
         // Allow JS property `RGI_Emoji` through
         { skipPropertyNameValidation: !0 }
       ), e));
@@ -9108,7 +9108,7 @@ var hc = {
         }[c];
         u && (h = `\0-${M(h.codePointAt(0) - 1)}${M(h.codePointAt(2) + 1)}-􏿿`), n(L(oe(`[${h}]`), e));
       } else
-        n(L(Ut(oe(lc.get(c)), u), e));
+        n(L(Ut(oe(uc.get(c)), u), e));
     else if (l === "property")
       An.has(xt(c)) || (t.key = "sc");
     else if (l === "space")
@@ -9132,8 +9132,8 @@ var hc = {
       Go(u, { type: "Group" }) && u.body[0].body.length === 1 ? u.body[0] : n;
       if (e.parent !== h || h.body.length > 1)
         throw new Error(v`Uses "\K" in a way that's unsupported`);
-      const d = fe({ behind: !0 });
-      d.body[0].body = s(), o(L(d, e));
+      const f = fe({ behind: !0 });
+      f.body[0].body = s(), o(L(f, e));
     } else
       throw new Error(`Unexpected directive kind "${i}"`);
   },
@@ -9230,7 +9230,7 @@ var hc = {
     let { ref: n } = t;
     typeof n == "string" && !jt(n) && (n = Bt(n, e), t.ref = n);
   }
-}, pc = {
+}, fc = {
   Backreference({ node: t }, { multiplexCapturesToLeftByRef: e, reffedNodesByReferencer: n }) {
     const { orphan: r, ref: o } = t;
     r || n.set(t, [...e.get(o).map(({ node: s }) => s)]);
@@ -9254,33 +9254,33 @@ var hc = {
         l.set(h, i.get(t.number)), n(h);
         return;
       }
-      i.set(t.number, t), a.set(t.number, []), t.name && qe(a, t.name, []);
+      i.set(t.number, t), a.set(t.number, []), t.name && Ve(a, t.name, []);
       const c = a.get(t.name ?? t.number);
       for (let h = 0; h < c.length; h++) {
-        const d = c[h];
+        const f = c[h];
         if (
           // This group is from subroutine expansion, and there's a multiplex value from either the
           // origin node or a prior subroutine expansion group with the same origin
-          u === d.node || u && u === d.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
+          u === f.node || u && u === f.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
           // group that refers to this group
-          t === d.origin
+          t === f.origin
         ) {
           c.splice(h, 1);
           break;
         }
       }
       if (a.get(t.number).push({ node: t, origin: u }), t.name && a.get(t.name).push({ node: t, origin: u }), t.name) {
-        const h = qe(s, t.name, /* @__PURE__ */ new Map());
-        let d = !1;
+        const h = Ve(s, t.name, /* @__PURE__ */ new Map());
+        let f = !1;
         if (u)
-          d = !0;
+          f = !0;
         else
-          for (const f of h.values())
-            if (!f.hasDuplicateNameToRemove) {
-              d = !0;
+          for (const d of h.values())
+            if (!d.hasDuplicateNameToRemove) {
+              f = !0;
               break;
             }
-        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: d });
+        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: f });
       }
     },
     exit({ node: t }, { openRefs: e }) {
@@ -9310,23 +9310,23 @@ var hc = {
     );
     let u = l;
     if (!i) {
-      const c = Zo(mc(
+      const c = Zo(yc(
         a,
-        (d) => d.type === "Group" && !!d.flags
+        (f) => f.type === "Group" && !!f.flags
       )), h = c ? bt(r.globalFlags, c) : r.globalFlags;
-      dc(h, r.currentFlags) || (u = Q({
-        flags: yc(h)
+      gc(h, r.currentFlags) || (u = Q({
+        flags: bc(h)
       }), u.body[0].body.push(l));
     }
     n(L(u, e), { traverse: !i });
   }
-}, fc = {
+}, dc = {
   Backreference({ node: t, parent: e, replaceWith: n }, r) {
     if (t.orphan) {
       r.highestOrphanBackref = Math.max(r.highestOrphanBackref, t.ref);
       return;
     }
-    const s = r.reffedNodesByReferencer.get(t).filter((a) => gc(a, t));
+    const s = r.reffedNodesByReferencer.get(t).filter((a) => mc(a, t));
     if (!s.length)
       n(L(fe({ negate: !0 }), e));
     else if (s.length > 1) {
@@ -9363,10 +9363,10 @@ function Yo(t) {
     }
   });
 }
-function dc(t, e) {
+function gc(t, e) {
   return t.dotAll === e.dotAll && t.ignoreCase === e.ignoreCase;
 }
-function gc(t, e) {
+function mc(t, e) {
   let n = e;
   do {
     if (n.type === "Regex")
@@ -9395,7 +9395,7 @@ function vr(t) {
   const e = Uo(t);
   return e.isRecursive = !0, e;
 }
-function mc(t, e) {
+function yc(t, e) {
   const n = [];
   for (; t = t.parent; )
     (!e || e(t)) && n.push(t);
@@ -9415,7 +9415,7 @@ function Zo(t) {
     });
   }), Object.keys(n.enable).length || delete n.enable, Object.keys(n.disable).length || delete n.disable, n.enable || n.disable ? n : null;
 }
-function yc({ dotAll: t, ignoreCase: e }) {
+function bc({ dotAll: t, ignoreCase: e }) {
   const n = {};
   return (t || e) && (n.enable = {}, t && (n.enable.dotAll = !0), e && (n.enable.ignoreCase = !0)), (!t || !e) && (n.disable = {}, !t && (n.disable.dotAll = !0), !e && (n.disable.ignoreCase = !0)), n;
 }
@@ -9426,7 +9426,7 @@ function Qo(t) {
   return Array.isArray(e) ? e : e ? [e] : null;
 }
 function es(t) {
-  const e = t.find((n) => n.kind === "search_start" || Cc(n, { negate: !1 }) || !bc(n));
+  const e = t.find((n) => n.kind === "search_start" || _c(n, { negate: !1 }) || !wc(n));
   if (!e)
     return null;
   if (e.kind === "search_start")
@@ -9452,10 +9452,10 @@ function ts(t, e) {
       return !0;
   return !1;
 }
-function bc({ type: t }) {
+function wc({ type: t }) {
   return t === "Assertion" || t === "Directive" || t === "LookaroundAssertion";
 }
-function wc(t) {
+function Cc(t) {
   const e = [
     "Character",
     "CharacterClass",
@@ -9463,7 +9463,7 @@ function wc(t) {
   ];
   return e.includes(t.type) || t.type === "Quantifier" && t.min && e.includes(t.body.type);
 }
-function Cc(t, e) {
+function _c(t, e) {
   const n = {
     negate: null,
     ...e
@@ -9494,23 +9494,23 @@ function le(t, e) {
 function L(t, e) {
   return Yo(t), t.parent = e, t;
 }
-function _c(t, e) {
-  const n = Vo(e), r = un(n.target, "ES2024"), o = un(n.target, "ES2025"), s = n.rules.recursionLimit;
+function Sc(t, e) {
+  const n = qo(e), r = un(n.target, "ES2024"), o = un(n.target, "ES2025"), s = n.rules.recursionLimit;
   if (!Number.isInteger(s) || s < 2 || s > 20)
     throw new Error("Invalid recursionLimit; use 2-20");
   let a = null, i = null;
   if (!o) {
-    const f = [t.flags.ignoreCase];
-    Be(t, Sc, {
-      getCurrentModI: () => f.at(-1),
+    const d = [t.flags.ignoreCase];
+    Be(t, kc, {
+      getCurrentModI: () => d.at(-1),
       popModI() {
-        f.pop();
+        d.pop();
       },
       pushModI(p) {
-        f.push(p);
+        d.push(p);
       },
       setHasCasedChar() {
-        f.at(-1) ? a = !0 : i = !0;
+        d.at(-1) ? a = !0 : i = !0;
       }
     });
   }
@@ -9540,20 +9540,20 @@ function _c(t, e) {
     useFlagV: r,
     verbose: n.verbose
   };
-  function h(f) {
-    return c.lastNode = u, u = f, tc(kc[f.type], `Unexpected node type "${f.type}"`)(f, c, h);
+  function h(d) {
+    return c.lastNode = u, u = d, nc(vc[d.type], `Unexpected node type "${d.type}"`)(d, c, h);
   }
-  const d = {
+  const f = {
     pattern: t.body.map(h).join("|"),
     // Could reset `lastNode` at this point via `lastNode = ast`, but it isn't needed by flags
     flags: h(t.flags),
     options: { ...t.options }
   };
-  return r || (delete d.options.force.v, d.options.disable.v = !0, d.options.unicodeSetsPlugin = null), d._captureTransfers = /* @__PURE__ */ new Map(), d._hiddenCaptures = [], c.captureMap.forEach((f, p) => {
-    f.hidden && d._hiddenCaptures.push(p), f.transferTo && qe(d._captureTransfers, f.transferTo, []).push(p);
-  }), d;
+  return r || (delete f.options.force.v, f.options.disable.v = !0, f.options.unicodeSetsPlugin = null), f._captureTransfers = /* @__PURE__ */ new Map(), f._hiddenCaptures = [], c.captureMap.forEach((d, p) => {
+    d.hidden && f._hiddenCaptures.push(p), d.transferTo && Ve(f._captureTransfers, d.transferTo, []).push(p);
+  }), f;
 }
-var Sc = {
+var kc = {
   "*": {
     enter({ node: t }, e) {
       if (Er(t)) {
@@ -9579,7 +9579,7 @@ var Sc = {
   CharacterSet({ node: t }, e) {
     t.kind === "property" && Ko.has(t.value) && e.setHasCasedChar();
   }
-}, kc = {
+}, vc = {
   /**
   @param {AlternativeNode} node
   */
@@ -9651,10 +9651,10 @@ var Sc = {
           (h) => h.type === "CharacterClass" && h.kind === "union" && h.negate
         );
         if (c.length) {
-          const h = Q(), d = h.body[0];
-          return h.parent = s, d.parent = h, a = a.filter((f) => !c.includes(f)), t.body = a, a.length ? (t.parent = d, d.body.push(t)) : h.body.pop(), c.forEach((f) => {
-            const p = me({ body: [f] });
-            f.parent = p, p.parent = h, h.body.push(p);
+          const h = Q(), f = h.body[0];
+          return h.parent = s, f.parent = h, a = a.filter((d) => !c.includes(d)), t.body = a, a.length ? (t.parent = f, f.body.push(t)) : h.body.pop(), c.forEach((d) => {
+            const p = me({ body: [d] });
+            d.parent = p, p.parent = h, h.body.push(p);
           }), n(h);
         }
       }
@@ -9685,7 +9685,7 @@ var Sc = {
     }, s = _e(n, o), a = _e(r, o), i = /* @__PURE__ */ new Set();
     if (e.useAppliedIgnoreCase && e.currentFlags.ignoreCase) {
       const l = ns(t);
-      Rc(l).forEach((c) => {
+      Ic(l).forEach((c) => {
         i.add(
           Array.isArray(c) ? `${_e(c[0], o)}-${_e(c[1], o)}` : _e(c, o)
         );
@@ -9733,7 +9733,7 @@ var Sc = {
     const a = o.currentFlags;
     n && (o.currentFlags = bt(a, n));
     const i = e.map(s).join("|"), l = !o.verbose && e.length === 1 && // Single alt
-    r.type !== "Quantifier" && !t && (!o.useFlagMods || !n) ? i : `(?${Ic(t, n, o.useFlagMods)}${i})`;
+    r.type !== "Quantifier" && !t && (!o.useFlagMods || !n) ? i : `(?${Nc(t, n, o.useFlagMods)}${i})`;
     return o.currentFlags = a, l;
   },
   /**
@@ -9746,7 +9746,7 @@ var Sc = {
   @param {QuantifierNode} node
   */
   Quantifier(t, e, n) {
-    return n(t.body) + Nc(t);
+    return n(t.body) + Pc(t);
   },
   /**
   @param {SubroutineNode & {isRecursive: true}} node
@@ -9757,7 +9757,7 @@ var Sc = {
     const r = n.recursionLimit;
     return e === 0 ? `(?R=${r})` : v`\g<${e}&R=${r}>`;
   }
-}, vc = /* @__PURE__ */ new Set([
+}, xc = /* @__PURE__ */ new Set([
   "$",
   "(",
   ")",
@@ -9772,7 +9772,7 @@ var Sc = {
   "{",
   "|",
   "}"
-]), xc = /* @__PURE__ */ new Set([
+]), Ec = /* @__PURE__ */ new Set([
   "-",
   "\\",
   "]",
@@ -9780,7 +9780,7 @@ var Sc = {
   // Literal `[` doesn't require escaping with flag u, but this can help work around regex source
   // linters and regex syntax processors that expect unescaped `[` to create a nested class
   "["
-]), Ec = /* @__PURE__ */ new Set([
+]), Ac = /* @__PURE__ */ new Set([
   "(",
   ")",
   "-",
@@ -9828,9 +9828,9 @@ var Sc = {
   // paragraph separator
   [65279, v`\uFEFF`]
   // ZWNBSP/BOM
-]), Ac = /^\p{Cased}$/u;
+]), Rc = /^\p{Cased}$/u;
 function Rn(t) {
-  return Ac.test(t);
+  return Rc.test(t);
 }
 function ns(t, e) {
   const n = !!e?.firstOnly, r = t.min.value, o = t.max.value, s = [];
@@ -9856,20 +9856,20 @@ function _e(t, { escDigit: e, inCharClass: n, useFlagV: r }) {
     // Control chars, etc.; condition modeled on the Chrome developer console's display for strings
     t < 32 || t > 126 && t < 160 || // Unicode planes 4-16; unassigned, special purpose, and private use area
     t > 262143 || // Avoid corrupting a preceding backref by immediately following it with a literal digit
-    e && Pc(t)
+    e && Lc(t)
   )
     return t > 255 ? `\\u{${t.toString(16).toUpperCase()}}` : `\\x${t.toString(16).toUpperCase().padStart(2, "0")}`;
-  const o = n ? r ? Ec : xc : vc, s = M(t);
+  const o = n ? r ? Ac : Ec : xc, s = M(t);
   return (o.has(s) ? "\\" : "") + s;
 }
-function Rc(t) {
+function Ic(t) {
   const e = t.map((o) => o.codePointAt(0)).sort((o, s) => o - s), n = [];
   let r = null;
   for (let o = 0; o < e.length; o++)
     e[o + 1] === e[o] + 1 ? r ??= e[o] : r === null ? n.push(e[o]) : (n.push([r, e[o]]), r = null);
   return n;
 }
-function Ic(t, e, n) {
+function Nc(t, e, n) {
   if (t)
     return ">";
   let r = "";
@@ -9879,7 +9879,7 @@ function Ic(t, e, n) {
   }
   return `${r}:`;
 }
-function Nc({ kind: t, max: e, min: n }) {
+function Pc({ kind: t, max: e, min: n }) {
   let r;
   return !n && e === 1 ? r = "?" : !n && e === 1 / 0 ? r = "*" : n === 1 && e === 1 / 0 ? r = "+" : n === e ? r = `{${n}}` : r = `{${n},${e === 1 / 0 ? "" : e}}`, r + {
     greedy: "",
@@ -9890,13 +9890,13 @@ function Nc({ kind: t, max: e, min: n }) {
 function Er({ type: t }) {
   return t === "CapturingGroup" || t === "Group" || t === "LookaroundAssertion";
 }
-function Pc(t) {
+function Lc(t) {
   return t > 47 && t < 58;
 }
 function Ar({ type: t, value: e }) {
   return t === "Character" && e === 45;
 }
-var Lc = class cn extends RegExp {
+var $c = class cn extends RegExp {
   /**
   @type {Map<number, {
     hidden?: true;
@@ -9954,7 +9954,7 @@ var Lc = class cn extends RegExp {
         transfers: [],
         ...r
       };
-      super(o ? "" : e, n), this.#r = e, this.#t = Tc(s.hiddenCaptures, s.transfers), this.#o = s.strategy, this.rawOptions = r ?? {};
+      super(o ? "" : e, n), this.#r = e, this.#t = Mc(s.hiddenCaptures, s.transfers), this.#o = s.strategy, this.rawOptions = r ?? {};
     }
     o || (this.#e = this);
   }
@@ -9973,7 +9973,7 @@ var Lc = class cn extends RegExp {
     if (this.#o === "clip_search" && n && r) {
       this.lastIndex = 0;
       const o = this.#s(e.slice(r));
-      return o && ($c(o, r, e, this.hasIndices), this.lastIndex += r), o;
+      return o && (Tc(o, r, e, this.hasIndices), this.lastIndex += r), o;
     }
     return this.#s(e);
   }
@@ -9999,7 +9999,7 @@ var Lc = class cn extends RegExp {
         if (!u)
           throw new Error(`Invalid capture transfer to "${u}"`);
         if (n[u] = r[a], this.hasIndices && (n.indices[u] = o[a]), n.groups) {
-          this.#n || (this.#n = Mc(this.source));
+          this.#n || (this.#n = Oc(this.source));
           const c = this.#n.get(l);
           c && (n.groups[c] = r[a], this.hasIndices && (n.indices.groups[c] = o[a]));
         }
@@ -10008,7 +10008,7 @@ var Lc = class cn extends RegExp {
     return n;
   }
 };
-function $c(t, e, n, r) {
+function Tc(t, e, n, r) {
   if (t.index += e, t.input = n, r) {
     const o = t.indices;
     for (let a = 0; a < o.length; a++) {
@@ -10022,7 +10022,7 @@ function $c(t, e, n, r) {
     });
   }
 }
-function Tc(t, e) {
+function Mc(t, e) {
   const n = /* @__PURE__ */ new Map();
   for (const r of t)
     n.set(r, {
@@ -10030,10 +10030,10 @@ function Tc(t, e) {
     });
   for (const [r, o] of e)
     for (const s of o)
-      qe(n, s, {}).transferTo = r;
+      Ve(n, s, {}).transferTo = r;
   return n;
 }
-function Mc(t) {
+function Oc(t) {
   const e = /(?<capture>\((?:\?<(?![=!])(?<name>[^>]+)>|(?!\?)))|\\?./gsu, n = /* @__PURE__ */ new Map();
   let r = 0, o = 0, s;
   for (; s = e.exec(t); ) {
@@ -10042,12 +10042,12 @@ function Mc(t) {
   }
   return n;
 }
-function Oc(t, e) {
-  const n = Dc(t, e);
-  return n.options ? new Lc(n.pattern, n.flags, n.options) : new RegExp(n.pattern, n.flags);
-}
 function Dc(t, e) {
-  const n = Vo(e), r = Fo(t, {
+  const n = Gc(t, e);
+  return n.options ? new $c(n.pattern, n.flags, n.options) : new RegExp(n.pattern, n.flags);
+}
+function Gc(t, e) {
+  const n = qo(e), r = Fo(t, {
     flags: n.flags,
     normalizeUnknownPropertyNames: !0,
     rules: {
@@ -10056,16 +10056,16 @@ function Dc(t, e) {
     },
     skipBackrefValidation: n.rules.allowOrphanBackrefs,
     unicodePropertyMap: An
-  }), o = cc(r, {
+  }), o = hc(r, {
     accuracy: n.accuracy,
     asciiWordBoundaries: n.rules.asciiWordBoundaries,
     avoidSubclass: n.avoidSubclass,
     bestEffortTarget: n.target
-  }), s = _c(o, n), a = Qu(s.pattern, {
+  }), s = Sc(o, n), a = ec(s.pattern, {
     captureTransfers: s._captureTransfers,
     hiddenCaptures: s._hiddenCaptures,
     mode: "external"
-  }), i = Ju(a.pattern), l = Yu(i.pattern, {
+  }), i = Zu(a.pattern), l = Ju(i.pattern, {
     captureTransfers: a.captureTransfers,
     hiddenCaptures: a.hiddenCaptures
   }), u = {
@@ -10076,18 +10076,18 @@ function Dc(t, e) {
     if (n.lazyCompileLength !== 1 / 0)
       throw new Error("Lazy compilation requires subclass");
   } else {
-    const c = l.hiddenCaptures.sort((p, m) => p - m), h = Array.from(l.captureTransfers), d = o._strategy, f = u.pattern.length >= n.lazyCompileLength;
-    (c.length || h.length || d || f) && (u.options = {
+    const c = l.hiddenCaptures.sort((p, g) => p - g), h = Array.from(l.captureTransfers), f = o._strategy, d = u.pattern.length >= n.lazyCompileLength;
+    (c.length || h.length || f || d) && (u.options = {
       ...c.length && { hiddenCaptures: c },
       ...h.length && { transfers: h },
-      ...d && { strategy: d },
-      ...f && { lazyCompile: f }
+      ...f && { strategy: f },
+      ...d && { lazyCompile: d }
     });
   }
   return u;
 }
 const Rr = 4294967295;
-class Gc {
+class Fc {
   constructor(e, n = {}) {
     this.patterns = e, this.options = n;
     const {
@@ -10161,8 +10161,8 @@ class Gc {
     return null;
   }
 }
-function Fc(t, e) {
-  return Oc(
+function Bc(t, e) {
+  return Dc(
     t,
     {
       global: !0,
@@ -10188,7 +10188,7 @@ function Fc(t, e) {
     }
   );
 }
-function Bc(t = {}) {
+function jc(t = {}) {
   const e = Object.assign(
     {
       target: "auto",
@@ -10196,9 +10196,9 @@ function Bc(t = {}) {
     },
     t
   );
-  return e.regexConstructor ||= (n) => Fc(n, { target: e.target }), {
+  return e.regexConstructor ||= (n) => Bc(n, { target: e.target }), {
     createScanner(n) {
-      return new Gc(n, e);
+      return new Fc(n, e);
     },
     createString(n) {
       return {
@@ -10207,8 +10207,8 @@ function Bc(t = {}) {
     }
   };
 }
-const jc = Bc({ forgiving: !0 }), Uc = await Hl({
-  engine: jc,
+const Uc = jc({ forgiving: !0 }), zc = await Wl({
+  engine: Uc,
   langAlias: {
     markup: "html",
     svg: "xml",
@@ -10226,7 +10226,7 @@ const jc = Bc({ forgiving: !0 }), Uc = await Hl({
   defaultColor: !1,
   inline: "tailing-curly-colon",
   addLanguageClass: !0,
-  transformers: [Jl(), Ql()],
+  transformers: [Zl(), eu()],
   parseMetaString: (t) => {
     const e = t.matchAll(
       /([a-z0-9]+)(?:=(["'])(.*?)\2|=(.*?)(?:\s|$)|(?:\s|$))/gi
@@ -10238,8 +10238,8 @@ const jc = Bc({ forgiving: !0 }), Uc = await Hl({
       })
     );
   }
-}, zc = () => (t) => {
-  Vr(t, "element", (e, n, r) => {
+}, Hc = () => (t) => {
+  qr(t, "element", (e, n, r) => {
     if (e.tagName !== "code") return;
     const o = r?.type === "element" && r.tagName === "pre";
     e.properties.inline = JSON.stringify(!o), o && (e.properties = {
@@ -10248,28 +10248,28 @@ const jc = Bc({ forgiving: !0 }), Uc = await Hl({
       class: as(e.properties.class, r.properties.class)
     }, r.properties = {});
   });
-}, uh = (t) => [
+}, ch = (t) => [
   [
-    Kl,
-    Uc,
+    Yl,
+    zc,
     {
       ...wt,
       themes: t ?? wt.themes
     }
   ],
-  zc
-], Hc = (t, e, n = "text", r = wt.themes) => {
+  Hc
+], Wc = (t, e, n = "text", r = wt.themes) => {
   const o = t.codeToHast(e, {
     lang: n,
     ...wt,
     themes: r
   });
   return Ds(o, { Fragment: rs, jsx: at.jsx, jsxs: at.jsxs });
-}, Wc = os(
+}, Vc = os(
   ({ code: t, children: e, embedded: n, ...r }) => {
     const { syntaxHighlighting: o } = ss().options;
     ls(o?.highlighter, "Highlighter not found");
-    const s = Hc(
+    const s = Wc(
       o.highlighter,
       t ?? e,
       r.language,
@@ -10278,29 +10278,29 @@ const jc = Bc({ forgiving: !0 }), Uc = await Hl({
     return n ? /* @__PURE__ */ at.jsx(cs, { ...r, children: s }) : /* @__PURE__ */ at.jsx(us, { ...r, children: s });
   }
 );
-Wc.displayName = "SyntaxHighlight";
+Vc.displayName = "SyntaxHighlight";
 export {
   Fn as E,
-  Wc as S,
+  Vc as S,
   H as V,
   Ps as a,
-  ah as b,
-  sh as c,
-  th as d,
+  ih as b,
+  ah as c,
+  nh as d,
   Ir as e,
   Gr as f,
   ua as g,
-  Hc as h,
+  Wc as h,
   Wr as i,
   aa as j,
   jn as k,
-  uh as l,
-  Qc as o,
+  ch as l,
+  eh as o,
   Fr as p,
   Ls as s,
   Ds as t,
-  eh as u,
-  Vr as v,
+  th as u,
+  qr as v,
   la as z
 };
-//# sourceMappingURL=SyntaxHighlight-CrjhGEwT.js.map
+//# sourceMappingURL=SyntaxHighlight-CZgjJ7-f.js.map