zudoku 0.0.0-f42e3678 → 0.0.0-f46233e4

package/lib/{SyntaxHighlight-BMKR4pl6.js → SyntaxHighlight-BvPom2Ah.js}

@@ -1,15 +1,15 @@
-import { j as at } from "./jsx-runtime-C5mzlN2N.js";
+import { j as at } from "./jsx-runtime-BzflLqGi.js";
 import { Fragment as rs, memo as os } from "react";
-import { c as ss } from "./ZudokuContext-CLl5w57E.js";
+import { a as ss } from "./ZudokuContext-CgNnmIdS.js";
 import { c as as } from "./cn-dYga0KKN.js";
 import { g as is, i as ls } from "./invariant-Bm-FVUQE.js";
-import { C as us } from "./CodeBlock-B-G0eKtw.js";
+import { C as us } from "./CodeBlock-CanTUJLl.js";
 import { EmbeddedCodeBlock as cs } from "./ui/EmbeddedCodeBlock.js";
-function eh() {
-}
 function th() {
 }
-function nh(t) {
+function nh() {
+}
+function rh(t) {
   const e = [], n = String(t || "");
   let r = n.indexOf(","), o = 0, s = !1;
   for (; !s; ) {
@@ -25,9 +25,9 @@ function Ir(t, e) {
     (n.padRight ? " " : "") + "," + (n.padLeft === !1 ? "" : " ")
   ).trim();
 }
-const hs = /^[$_\p{ID_Start}][$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, ps = /^[$_\p{ID_Start}][-$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, fs = {};
+const hs = /^[$_\p{ID_Start}][$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, fs = /^[$_\p{ID_Start}][-$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, ps = {};
 function In(t, e) {
-  return (fs.jsx ? ps : hs).test(t);
+  return (ps.jsx ? fs : hs).test(t);
 }
 const ds = /[ \t\n\f\r]/g;
 function Ct(t) {
@@ -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(), q = ye();
+const x = ye(), $ = ye(), Lr = ye(), b = ye(), I = ye(), xe = ye(), q = ye();
 function ye() {
   return 2 ** ++gs;
 }
@@ -100,7 +100,7 @@ const Ht = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   commaOrSpaceSeparated: q,
   commaSeparated: xe,
   number: b,
-  overloadedBoolean: Pr,
+  overloadedBoolean: Lr,
   spaceSeparated: I
 }, Symbol.toStringTag, { value: "Module" })), At = (
   /** @type {ReadonlyArray<keyof typeof types>} */
@@ -122,15 +122,15 @@ let hn = class extends W {
    */
   constructor(e, n, r, o) {
     let s = -1;
-    if (super(e, n), Pn(this, "space", o), typeof r == "number")
+    if (super(e, n), Ln(this, "space", o), typeof r == "number")
       for (; ++s < At.length; ) {
         const a = At[s];
-        Pn(this, At[s], (r & Ht[a]) === Ht[a]);
+        Ln(this, At[s], (r & Ht[a]) === Ht[a]);
       }
   }
 };
 hn.prototype.defined = !0;
-function Pn(t, e, n) {
+function Ln(t, e, n) {
   n && (t[e] = n);
 }
 function Ie(t) {
@@ -146,7 +146,7 @@ function Ie(t) {
   }
   return new qe(e, n, t.space);
 }
-const Lr = Ie({
+const Pr = Ie({
   properties: {
     ariaActiveDescendant: null,
     ariaAtomic: $,
@@ -256,7 +256,7 @@ const ms = Ie({
     dir: null,
     dirName: null,
     disabled: x,
-    download: Pr,
+    download: Lr,
     draggable: $,
     encType: null,
     enterKeyHint: null,
@@ -1171,7 +1171,7 @@ const ms = Ie({
   xLinkTitle: "xlinkTitle",
   xLinkType: "xlinkType",
   xmlnsXLink: "xmlnsXlink"
-}, ws = /[A-Z]/g, Ln = /-[a-z]/g, Cs = /^data[-\w.:]+$/i;
+}, ws = /[A-Z]/g, Pn = /-[a-z]/g, Cs = /^data[-\w.:]+$/i;
 function _s(t, e) {
   const n = zt(e);
   let r = e, o = W;
@@ -1179,11 +1179,11 @@ function _s(t, e) {
     return t.property[t.normal[n]];
   if (n.length > 4 && n.slice(0, 4) === "data" && Cs.test(e)) {
     if (e.charAt(4) === "-") {
-      const s = e.slice(5).replace(Ln, ks);
+      const s = e.slice(5).replace(Pn, ks);
       r = "data" + s.charAt(0).toUpperCase() + s.slice(1);
     } else {
       const s = e.slice(4);
-      if (!Ln.test(s)) {
+      if (!Pn.test(s)) {
         let a = s.replace(ws, Ss);
         a.charAt(0) !== "-" && (a = "-" + a), e = "data" + a;
       }
@@ -1198,8 +1198,8 @@ function Ss(t) {
 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 ah(t) {
+const vs = Nr([Pr, ms, Mr, Or, Dr], "html"), fn = Nr([Pr, ys, Mr, Or, Dr], "svg");
+function ih(t) {
   const e = String(t || "").trim();
   return e ? e.split(/[ \t\n\r\f]+/g) : [];
 }
@@ -1211,7 +1211,7 @@ 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 = "", f = "comment", d = "declaration";
+`, u = "/", c = "*", h = "", p = "comment", d = "declaration";
   Rt = function(g, C) {
     if (typeof g != "string")
       throw new TypeError("First argument must be a string");
@@ -1240,7 +1240,7 @@ function xs() {
       );
       if (k.reason = R, k.filename = C.source, k.line = y, k.column = m, k.source = g, !C.silent) throw k;
     }
-    function P(R) {
+    function L(R) {
       var k = R.exec(g);
       if (k) {
         var G = k[0];
@@ -1248,7 +1248,7 @@ function xs() {
       }
     }
     function j() {
-      P(n);
+      L(n);
     }
     function Z(R) {
       var k;
@@ -1265,21 +1265,21 @@ function xs() {
           return D("End of comment missing");
         var G = g.slice(2, k - 2);
         return m += 2, _(G), g = g.slice(k), m += 2, R({
-          type: f,
+          type: p,
           comment: G
         });
       }
     }
     function ce() {
-      var R = S(), k = P(r);
+      var R = S(), k = L(r);
       if (k) {
-        if (ee(), !P(o)) return D("property missing ':'");
-        var G = P(s), Te = R({
+        if (ee(), !L(o)) return D("property missing ':'");
+        var G = L(s), Te = R({
           type: d,
-          property: p(k[0].replace(t, h)),
-          value: G ? p(G[0].replace(t, h)) : h
+          property: f(k[0].replace(t, h)),
+          value: G ? f(G[0].replace(t, h)) : h
         });
-        return P(a), Te;
+        return L(a), Te;
       }
     }
     function te() {
@@ -1291,7 +1291,7 @@ function xs() {
     }
     return j(), te();
   };
-  function p(g) {
+  function f(g) {
     return g ? g.replace(i, h) : h;
   }
   return Rt;
@@ -1350,7 +1350,7 @@ function Rs() {
   return r.default = r, Oe = r, Oe;
 }
 var Is = Rs();
-const Ns = /* @__PURE__ */ is(Is), Ps = Br("end"), Fr = Br("start");
+const Ns = /* @__PURE__ */ is(Is), Ls = Br("end"), Fr = Br("start");
 function Br(t) {
   return e;
   function e(n) {
@@ -1363,12 +1363,12 @@ function Br(t) {
       };
   }
 }
-function ih(t) {
-  const e = Fr(t), n = Ps(t);
+function lh(t) {
+  const e = Fr(t), n = Ls(t);
   if (e && n)
     return { start: e, end: n };
 }
-function Ls(t) {
+function Ps(t) {
   return !t || typeof t != "object" ? "" : "position" in t || "type" in t ? Dn(t.position) : "start" in t || "end" in t ? Dn(t) : "line" in t || "column" in t ? Wt(t) : "";
 }
 function Wt(t) {
@@ -1451,7 +1451,7 @@ class H extends Error {
       l && (s.place = l.position);
     }
     const i = s.place && "start" in s.place ? s.place.start : s.place;
-    this.ancestors = s.ancestors || void 0, this.cause = s.cause || void 0, this.column = i ? i.column : void 0, this.fatal = void 0, this.file, this.message = o, this.line = i ? i.line : void 0, this.name = Ls(s.place) || "1:1", this.place = s.place || void 0, this.reason = this.message, this.ruleId = s.ruleId || void 0, this.source = s.source || void 0, this.stack = a && s.cause && typeof s.cause.stack == "string" ? s.cause.stack : "", this.actual, this.expected, this.note, this.url;
+    this.ancestors = s.ancestors || void 0, this.cause = s.cause || void 0, this.column = i ? i.column : void 0, this.fatal = void 0, this.file, this.message = o, this.line = i ? i.line : void 0, this.name = Ps(s.place) || "1:1", this.place = s.place || void 0, this.reason = this.message, this.ruleId = s.ruleId || void 0, this.source = s.source || void 0, this.stack = a && s.cause && typeof s.cause.stack == "string" ? s.cause.stack : "", this.actual, this.expected, this.note, this.url;
   }
 }
 H.prototype.file = "";
@@ -1467,7 +1467,7 @@ H.prototype.fatal = void 0;
 H.prototype.place = void 0;
 H.prototype.ruleId = void 0;
 H.prototype.source = void 0;
-const fn = {}.hasOwnProperty, $s = /* @__PURE__ */ new Map(), Ts = /[A-Z]/g, Ms = /* @__PURE__ */ new Set(["table", "tbody", "thead", "tfoot", "tr"]), Os = /* @__PURE__ */ new Set(["td", "th"]), jr = "https://github.com/syntax-tree/hast-util-to-jsx-runtime";
+const pn = {}.hasOwnProperty, $s = /* @__PURE__ */ new Map(), Ts = /[A-Z]/g, Ms = /* @__PURE__ */ new Set(["table", "tbody", "thead", "tfoot", "tr"]), Os = /* @__PURE__ */ new Set(["td", "th"]), jr = "https://github.com/syntax-tree/hast-util-to-jsx-runtime";
 function Ds(t, e) {
   if (!e || e.Fragment === void 0)
     throw new TypeError("Expected `Fragment` in options");
@@ -1497,7 +1497,7 @@ function Ds(t, e) {
     ignoreInvalidStyle: e.ignoreInvalidStyle || !1,
     passKeys: e.passKeys !== !1,
     passNode: e.passNode || !1,
-    schema: e.space === "svg" ? pn : vs,
+    schema: e.space === "svg" ? fn : vs,
     stylePropertyNameCase: e.stylePropertyNameCase || "dom",
     tableCellAlignToStyle: e.tableCellAlignToStyle !== !1
   }, s = Ur(o, t, void 0);
@@ -1525,7 +1525,7 @@ function Ur(t, e, n) {
 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);
+  e.tagName.toLowerCase() === "svg" && r.space === "html" && (o = fn, t.schema = o), t.ancestors.push(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) {
@@ -1551,7 +1551,7 @@ function Bs(t, e) {
 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);
+  e.name === "svg" && r.space === "html" && (o = fn, t.schema = o), t.ancestors.push(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);
 }
@@ -1600,7 +1600,7 @@ function Vs(t, e) {
   const n = {};
   let r, o;
   for (o in e.properties)
-    if (o !== "children" && fn.call(e.properties, o)) {
+    if (o !== "children" && pn.call(e.properties, o)) {
       const s = Xs(t, o, e.properties[o]);
       if (s) {
         const [a, i] = s;
@@ -1723,7 +1723,7 @@ function Hr(t, e, n) {
       /** @type {string | number} */
       r.value
     );
-    return fn.call(t.components, o) ? t.components[o] : o;
+    return pn.call(t.components, o) ? t.components[o] : o;
   }
   if (t.evaluater)
     return t.evaluater.evaluateExpression(r);
@@ -1745,7 +1745,7 @@ function Ys(t) {
   const e = {};
   let n;
   for (n in t)
-    fn.call(t, n) && (e[Js(n)] = t[n]);
+    pn.call(t, n) && (e[Js(n)] = t[n]);
   return e;
 }
 function Js(t) {
@@ -1770,7 +1770,7 @@ const Wr = (
    * @param {Test} [test]
    * @returns {Check}
    */
-  function(t) {
+  (function(t) {
     if (t == null)
       return na;
     if (typeof t == "function")
@@ -1780,7 +1780,7 @@ const Wr = (
     if (typeof t == "string")
       return ta(t);
     throw new Error("Expected function, string, or object as test");
-  }
+  })
 );
 function Qs(t) {
   const e = [];
@@ -1855,13 +1855,13 @@ function aa(t, e, n, r) {
           typeof h.name == "string" ? h.name : void 0
         )
       );
-      Object.defineProperty(f, "name", {
+      Object.defineProperty(p, "name", {
         value: "node (" + (l.type + (d ? "<" + d + ">" : "")) + ")"
       });
     }
-    return f;
-    function f() {
-      let d = Vr, p, g, C;
+    return p;
+    function p() {
+      let d = Vr, f, 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) {
@@ -1872,9 +1872,9 @@ function aa(t, e, n, r) {
         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;
-            g = typeof p[1] == "number" ? p[1] : g + a;
+            if (f = i(m, g, C)(), f[0] === Fn)
+              return f;
+            g = typeof f[1] == "number" ? f[1] : g + a;
           }
       }
       return d;
@@ -1947,7 +1947,7 @@ function ca(t) {
   return mn(t);
 }
 function mn(t) {
-  return Array.isArray(t) ? ha(t) : t instanceof RegExp ? t : typeof t == "object" ? pa(t) : t;
+  return Array.isArray(t) ? ha(t) : t instanceof RegExp ? t : typeof t == "object" ? fa(t) : t;
 }
 function ha(t) {
   let e = [];
@@ -1955,7 +1955,7 @@ function ha(t) {
     e[n] = mn(t[n]);
   return e;
 }
-function pa(t) {
+function fa(t) {
   let e = {};
   for (let n in t)
     e[n] = mn(t[n]);
@@ -2056,7 +2056,7 @@ var Qr = class {
     if (t === null)
       return this._defaults;
     const e = t.scopeName, r = this._cachedMatchRoot.get(e).find(
-      (o) => fa(t.parent, o.parentScopes)
+      (o) => pa(t.parent, o.parentScopes)
     );
     return r ? new eo(
       r.fontStyle,
@@ -2103,7 +2103,7 @@ var Qr = class {
     return r === e ? n.reverse() : void 0;
   }
 };
-function fa(t, e) {
+function pa(t, e) {
   if (e.length === 0)
     return !0;
   for (let n = 0; n < e.length; n++) {
@@ -2151,8 +2151,8 @@ function ga(t) {
     if (typeof a.settings.fontStyle == "string") {
       l = 0;
       let h = a.settings.fontStyle.split(" ");
-      for (let f = 0, d = h.length; f < d; f++)
-        switch (h[f]) {
+      for (let p = 0, d = h.length; p < d; p++)
+        switch (h[p]) {
           case "italic":
             l = l | 1;
             break;
@@ -2171,9 +2171,9 @@ 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, 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(
+    for (let h = 0, p = i.length; h < p; h++) {
+      let f = i[h].trim().split(" "), g = f[f.length - 1], C = null;
+      f.length > 1 && (C = f.slice(0, f.length - 1), C.reverse()), n[r++] = new ma(
         g,
         C,
         o,
@@ -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), 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;
+    let l = K.getLanguageId(e), u = K.getTokenType(e), c = K.containsBalancedBrackets(e) ? 1 : 0, h = K.getFontStyle(e), p = 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 && (p = a), i !== 0 && (d = i), (l << 0 | u << 8 | c << 10 | h << 11 | p << 15 | d << 24) >>> 0;
   }
 };
 function lt(t, e) {
@@ -2579,7 +2579,7 @@ function ro(t) {
     return new Na(n, r);
   }
 }
-var Pa = /\\(\d+)/, Hn = /\\(\d+)/g, La = -1, oo = -2;
+var La = /\\(\d+)/, Hn = /\\(\d+)/g, Pa = -1, oo = -2;
 var Xe = class {
   $location;
   id;
@@ -2848,11 +2848,11 @@ var Xe = class {
               break;
             case 3:
             case 4:
-              const h = u.scopeName, f = u.kind === 4 ? u.ruleName : null, d = n.getExternalGrammar(h, r);
+              const h = u.scopeName, p = 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));
+                if (p) {
+                  let f = d.repository[p];
+                  f && (l = U.getCompiledRuleId(f, n, d.repository));
                 } else
                   l = U.getCompiledRuleId(d.repository.$self, n, d.repository);
               break;
@@ -2890,7 +2890,7 @@ var Xe = class {
       this.hasAnchor = a, o === 0 ? this.source = e : (s.push(e.substring(o, r)), this.source = s.join(""));
     } else
       this.hasAnchor = !1, this.source = e;
-    this.hasAnchor ? this._anchorCache = this._buildAnchorCache() : this._anchorCache = null, this.ruleId = n, typeof this.source == "string" ? this.hasBackReferences = Pa.test(this.source) : this.hasBackReferences = !1;
+    this.hasAnchor ? this._anchorCache = this._buildAnchorCache() : this._anchorCache = null, this.ruleId = n, typeof this.source == "string" ? this.hasBackReferences = La.test(this.source) : this.hasBackReferences = !1;
   }
   clone() {
     return new ao(this.source, this.ruleId);
@@ -2987,7 +2987,7 @@ var Xe = class {
       captureIndices: r.captureIndices
     } : null;
   }
-}, Pt = class {
+}, Lt = class {
   constructor(t, e) {
     this.languageId = t, this.tokenType = e;
   }
@@ -2995,7 +2995,7 @@ var Xe = class {
   _defaultAttributes;
   _embeddedLanguagesMatcher;
   constructor(e, n) {
-    this._defaultAttributes = new Pt(
+    this._defaultAttributes = new Lt(
       e,
       8
       /* NotSet */
@@ -3007,10 +3007,10 @@ var Xe = class {
   getBasicScopeAttributes(e) {
     return e === null ? Yt._NULL_SCOPE_METADATA : this._getBasicScopeAttributes.get(e);
   }
-  static _NULL_SCOPE_METADATA = new Pt(0, 0);
+  static _NULL_SCOPE_METADATA = new Lt(0, 0);
   _getBasicScopeAttributes = new Qr((e) => {
     const n = this._scopeToLanguage(e), r = this._toStandardTokenType(e);
-    return new Pt(n, r);
+    return new Lt(n, r);
   });
   /**
    * Given a produced TM scope, return the language that token describes or null if unknown.
@@ -3085,10 +3085,10 @@ function io(t, e, n, r, o, s, a, i) {
   for (; !u; ) {
     if (i !== 0 && Date.now() - h > i)
       return new qn(o, !0);
-    f();
+    p();
   }
   return new qn(o, !1);
-  function f() {
+  function p() {
     const d = Ga(
       t,
       e,
@@ -3101,18 +3101,18 @@ function io(t, e, n, r, o, s, a, i) {
       s.produce(o, l), u = !0;
       return;
     }
-    const p = d.captureIndices, g = d.matchedRuleId, C = p && p.length > 0 ? p[0].end > r : !1;
-    if (g === La) {
+    const f = d.captureIndices, g = d.matchedRuleId, C = f && f.length > 0 ? f[0].end > r : !1;
+    if (g === Pa) {
       const y = o.getRule(t);
-      s.produce(o, p[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
+      s.produce(o, f[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
         t,
         e,
         n,
         o,
         s,
         y.endCaptures,
-        p
-      ), s.produce(o, p[0].end);
+        f
+      ), s.produce(o, f[0].end);
       const m = o;
       if (o = o.parent, c = m.getAnchorPos(), !C && m.getEnterPos() === r) {
         o = m, s.produce(o, l), u = !0;
@@ -3120,8 +3120,8 @@ function io(t, e, n, r, o, s, a, i) {
       }
     } else {
       const y = t.getRule(g);
-      s.produce(o, p[0].start);
-      const m = o, _ = y.getName(e.content, p), S = o.contentNameScopesList.pushAttributed(
+      s.produce(o, f[0].start);
+      const m = o, _ = y.getName(e.content, f), S = o.contentNameScopesList.pushAttributed(
         _,
         t
       );
@@ -3129,7 +3129,7 @@ function io(t, e, n, r, o, s, a, i) {
         g,
         r,
         c,
-        p[0].end === l,
+        f[0].end === l,
         null,
         S,
         S
@@ -3142,19 +3142,19 @@ function io(t, e, n, r, o, s, a, i) {
           o,
           s,
           A.beginCaptures,
-          p
-        ), s.produce(o, p[0].end), c = p[0].end;
+          f
+        ), s.produce(o, f[0].end), c = f[0].end;
         const D = A.getContentName(
           e.content,
-          p
-        ), P = S.pushAttributed(
+          f
+        ), L = S.pushAttributed(
           D,
           t
         );
-        if (o = o.withContentNameScopesList(P), A.endHasBackReferences && (o = o.withEndRule(
+        if (o = o.withContentNameScopesList(L), A.endHasBackReferences && (o = o.withEndRule(
           A.getEndWithResolvedBackReferences(
             e.content,
-            p
+            f
           )
         )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
@@ -3169,19 +3169,19 @@ function io(t, e, n, r, o, s, a, i) {
           o,
           s,
           A.beginCaptures,
-          p
-        ), s.produce(o, p[0].end), c = p[0].end;
+          f
+        ), s.produce(o, f[0].end), c = f[0].end;
         const D = A.getContentName(
           e.content,
-          p
-        ), P = S.pushAttributed(
+          f
+        ), L = S.pushAttributed(
           D,
           t
         );
-        if (o = o.withContentNameScopesList(P), A.whileHasBackReferences && (o = o.withEndRule(
+        if (o = o.withContentNameScopesList(L), A.whileHasBackReferences && (o = o.withEndRule(
           A.getWhileWithResolvedBackReferences(
             e.content,
-            p
+            f
           )
         )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
@@ -3194,13 +3194,13 @@ function io(t, e, n, r, o, s, a, i) {
         o,
         s,
         y.captures,
-        p
-      ), s.produce(o, p[0].end), o = o.pop(), !C) {
+        f
+      ), s.produce(o, f[0].end), o = o.pop(), !C) {
         o = o.safePop(), s.produce(o, l), u = !0;
         return;
       }
     }
-    p[0].end > r && (r = p[0].end, n = !1);
+    f[0].end > r && (r = f[0].end, n = !1);
   }
 }
 function Da(t, e, n, r, o, s) {
@@ -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 f = 0, d = t.length; f < d; f++) {
-    const p = t[f];
-    if (!p.matcher(h))
+  for (let p = 0, d = t.length; p < d; p++) {
+    const f = t[p];
+    if (!f.matcher(h))
       continue;
-    const g = e.getRule(p.ruleId), { ruleScanner: C, findOptions: y } = lo(g, e, null, r, o === a), m = C.findNextMatchSync(n, o, y);
+    const g = e.getRule(f.ruleId), { ruleScanner: C, findOptions: y } = lo(g, e, null, r, o === a), m = C.findNextMatchSync(n, o, y);
     if (!m)
       continue;
     const _ = m.captureIndices[0].start;
-    if (!(_ >= i) && (i = _, l = m.captureIndices, u = m.ruleId, c = p.priority, i === o))
+    if (!(_ >= i) && (i = _, l = m.captureIndices, u = m.ruleId, c = f.priority, i === o))
       break;
   }
   return l ? {
@@ -3286,8 +3286,8 @@ 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 f = s[h];
-    if (f === null)
+    const p = s[h];
+    if (p === null)
       continue;
     const d = a[h];
     if (d.length === 0)
@@ -3296,8 +3296,8 @@ function Ge(t, e, n, r, o, s, a) {
       break;
     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, 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));
+    if (u.length > 0 ? o.produceFromScopes(u[u.length - 1].scopes, d.start) : o.produce(r, d.start), p.retokenizeCapturedWithRuleId) {
+      const g = p.getName(i, a), C = r.contentNameScopesList.pushAttributed(g, t), y = p.getContentName(i, a), m = C.pushAttributed(y, t), _ = r.push(p.retokenizeCapturedWithRuleId, d.start, -1, !1, null, C, m), S = t.createOnigString(i.substring(0, d.end));
       io(
         t,
         S,
@@ -3311,9 +3311,9 @@ function Ge(t, e, n, r, o, s, a) {
       ), no(S);
       continue;
     }
-    const p = f.getName(i, a);
-    if (p !== null) {
-      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(p, t);
+    const f = p.getName(i, a);
+    if (f !== null) {
+      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(f, t);
       u.push(new Ua(C, d.end));
     }
   }
@@ -3497,13 +3497,13 @@ var Wa = class {
         c.fontStyle,
         c.foregroundId,
         c.backgroundId
-      ), f = this.getRule(this._rootId).getName(
+      ), p = this.getRule(this._rootId).getName(
         null,
         null
       );
       let d;
-      f ? d = Fe.createRootAndLookUpScopeName(
-        f,
+      p ? d = Fe.createRootAndLookUpScopeName(
+        p,
         h,
         this
       ) : d = Fe.createRoot(
@@ -3644,7 +3644,7 @@ var Fe = class ne {
       }), r = r.parent;
     return r === e ? n.reverse() : void 0;
   }
-}, Jt = class pe {
+}, Jt = class fe {
   /**
    * Invariant:
    * ```
@@ -3661,7 +3661,7 @@ var Fe = class ne {
   }
   _stackElementBrand = void 0;
   // TODO remove me
-  static NULL = new pe(
+  static NULL = new fe(
     null,
     0,
     0,
@@ -3688,7 +3688,7 @@ var Fe = class ne {
    */
   depth;
   equals(e) {
-    return e === null ? !1 : pe._equals(this, e);
+    return e === null ? !1 : fe._equals(this, e);
   }
   static _equals(e, n) {
     return e === n ? !0 : this._structuralEquals(e, n) ? Fe.equals(e.contentNameScopesList, n.contentNameScopesList) : !1;
@@ -3713,7 +3713,7 @@ var Fe = class ne {
       e._enterPos = -1, e._anchorPos = -1, e = e.parent;
   }
   reset() {
-    pe._reset(this);
+    fe._reset(this);
   }
   pop() {
     return this.parent;
@@ -3722,7 +3722,7 @@ var Fe = class ne {
     return this.parent ? this.parent : this;
   }
   push(e, n, r, o, s, a, i) {
-    return new pe(
+    return new fe(
       this,
       e,
       n,
@@ -3761,7 +3761,7 @@ var Fe = class ne {
     );
   }
   withEndRule(e) {
-    return this.endRule === e ? this : new pe(
+    return this.endRule === e ? this : new fe(
       this.parent,
       this.ruleId,
       this._enterPos,
@@ -3793,7 +3793,7 @@ var Fe = class ne {
   }
   static pushFrame(e, n) {
     const r = Fe.fromExtension(e?.nameScopesList ?? null, n.nameScopesList);
-    return new pe(
+    return new fe(
       e,
       n.ruleId,
       n.enterPos ?? -1,
@@ -4134,7 +4134,7 @@ const tn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   number: w,
   overloadedBoolean: en,
   spaceSeparated: N
-}, Symbol.toStringTag, { value: "Module" })), Lt = (
+}, Symbol.toStringTag, { value: "Module" })), Pt = (
   /** @type {ReadonlyArray<keyof typeof types>} */
   Object.keys(tn)
 );
@@ -4155,9 +4155,9 @@ class yn extends V {
   constructor(e, n, r, o) {
     let s = -1;
     if (super(e, n), Yn(this, "space", o), typeof r == "number")
-      for (; ++s < Lt.length; ) {
-        const a = Lt[s];
-        Yn(this, Lt[s], (r & tn[a]) === tn[a]);
+      for (; ++s < Pt.length; ) {
+        const a = Pt[s];
+        Yn(this, Pt[s], (r & tn[a]) === tn[a]);
       }
   }
 }
@@ -4237,7 +4237,7 @@ const co = Ne({
 function ho(t, e) {
   return e in t ? t[e] : e;
 }
-function po(t, e) {
+function fo(t, e) {
   return ho(t, e.toLowerCase());
 }
 const Ja = Ne({
@@ -4600,7 +4600,7 @@ const Ja = Ne({
     unselectable: null
   },
   space: "html",
-  transform: po
+  transform: fo
 }), Za = Ne({
   attributes: {
     accentHeight: "accent-height",
@@ -5160,7 +5160,7 @@ const Ja = Ne({
   },
   space: "svg",
   transform: ho
-}), fo = Ne({
+}), po = Ne({
   properties: {
     xLinkActuate: null,
     xLinkArcRole: null,
@@ -5178,7 +5178,7 @@ const Ja = Ne({
   attributes: { xmlnsxlink: "xmlns:xlink" },
   properties: { xmlnsXLink: null, xmlns: null },
   space: "xmlns",
-  transform: po
+  transform: fo
 }), mo = Ne({
   properties: { xmlBase: null, xmlLang: null, xmlSpace: null },
   space: "xml",
@@ -5212,7 +5212,7 @@ function ni(t) {
 function ri(t) {
   return t.charAt(1).toUpperCase();
 }
-const oi = uo([co, Ja, fo, go, mo], "html"), yo = uo([co, Za, fo, go, mo], "svg"), si = /["&'<>`]/g, ai = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g, ii = (
+const oi = uo([co, Ja, po, go, mo], "html"), yo = uo([co, Za, po, go, mo], "svg"), si = /["&'<>`]/g, ai = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g, ii = (
   // eslint-disable-next-line no-control-regex, unicorn/no-hex-escape
   /[\x01-\t\v\f\x0E-\x1F\x7F\x81\x8D\x8F\x90\x9D\xA0-\uFFFF]/g
 ), li = /[|\\{}()[\]^$+*?.]/g, Zn = /* @__PURE__ */ new WeakMap();
@@ -5249,10 +5249,10 @@ function hi(t) {
     e.push(t[n].replace(li, "\\$&"));
   return new RegExp("(?:" + e.join("|") + ")", "g");
 }
-const pi = /[\dA-Fa-f]/;
-function fi(t, e, n) {
+const fi = /[\dA-Fa-f]/;
+function pi(t, e, n) {
   const r = "&#x" + t.toString(16).toUpperCase();
-  return n && e && !pi.test(String.fromCharCode(e)) ? r : r + ";";
+  return n && e && !fi.test(String.fromCharCode(e)) ? r : r + ";";
 }
 const di = /\d/;
 function gi(t, e, n) {
@@ -5642,7 +5642,7 @@ function wi(t, e, n, r) {
   return "";
 }
 function Ci(t, e, n) {
-  let r = fi(t, e, n.omitOptionalSemicolons), o;
+  let r = pi(t, e, n.omitOptionalSemicolons), o;
   if ((n.useNamedReferences || n.useShortestReferences) && (o = wi(
     t,
     e,
@@ -5701,10 +5701,10 @@ const bn = _o({
   caption: Tt,
   colgroup: Tt,
   dd: $i,
-  dt: Li,
+  dt: Pi,
   head: Tt,
   html: Ri,
-  li: Pi,
+  li: Li,
   optgroup: Ti,
   option: Mi,
   p: Ni,
@@ -5734,11 +5734,11 @@ function Ni(t, e, n) {
   return r ? r.type === "element" && (r.tagName === "address" || r.tagName === "article" || r.tagName === "aside" || r.tagName === "blockquote" || r.tagName === "details" || r.tagName === "div" || r.tagName === "dl" || r.tagName === "fieldset" || r.tagName === "figcaption" || r.tagName === "figure" || r.tagName === "footer" || r.tagName === "form" || r.tagName === "h1" || r.tagName === "h2" || r.tagName === "h3" || r.tagName === "h4" || r.tagName === "h5" || r.tagName === "h6" || r.tagName === "header" || r.tagName === "hgroup" || r.tagName === "hr" || r.tagName === "main" || r.tagName === "menu" || r.tagName === "nav" || r.tagName === "ol" || r.tagName === "p" || r.tagName === "pre" || r.tagName === "section" || r.tagName === "table" || r.tagName === "ul") : !n || // Confusing parent.
   !(n.type === "element" && (n.tagName === "a" || n.tagName === "audio" || n.tagName === "del" || n.tagName === "ins" || n.tagName === "map" || n.tagName === "noscript" || n.tagName === "video"));
 }
-function Pi(t, e, n) {
+function Li(t, e, n) {
   const r = O(n, e);
   return !r || r.type === "element" && r.tagName === "li";
 }
-function Li(t, e, n) {
+function Pi(t, e, n) {
   const r = O(n, e);
   return !!(r && r.type === "element" && (r.tagName === "dt" || r.tagName === "dd"));
 }
@@ -5972,7 +5972,7 @@ function al(t) {
     e[r] = this.one(n[r], r, t);
   return e.join("");
 }
-function pt(t, e) {
+function ft(t, e) {
   const n = typeof t == "string" ? {} : { ...t.colorReplacements }, r = typeof t == "string" ? t : t.name;
   for (const [o, s] of Object.entries(e?.colorReplacements || {}))
     typeof s == "string" ? n[o] = s : o === r && Object.assign(n, s);
@@ -6062,40 +6062,40 @@ function hl(t, e) {
     offset: t.offset + n
   }), r;
 }
-function pl(t, e) {
+function fl(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 ? hl(o, s) : o;
   })) : t;
 }
-function fl(t, e, n, r, o = "css-vars") {
+function pl(t, e, n, r, o = "css-vars") {
   const s = {
     content: t.content,
     explanation: t.explanation,
     offset: t.offset
-  }, 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);
+  }, a = e.map((c) => pt(t.variants[c])), i = new Set(a.flatMap((c) => Object.keys(c))), l = {}, u = (c, h) => {
+    const p = h === "color" ? "" : h === "background-color" ? "-bg" : `-${h}`;
+    return n + e[c] + (h === "color" ? "" : p);
   };
   return a.forEach((c, h) => {
-    for (const f of i) {
-      const d = c[f] || "inherit";
-      if (h === 0 && r && cl.includes(f))
+    for (const p of i) {
+      const d = c[p] || "inherit";
+      if (h === 0 && r && cl.includes(p))
         if (r === _n && a.length > 1) {
-          const p = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
-          if (p === -1 || g === -1)
+          const f = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
+          if (f === -1 || g === -1)
             throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-          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);
+          const C = a[f][p] || "inherit", y = a[g][p] || "inherit";
+          l[p] = `light-dark(${C}, ${y})`, o === "css-vars" && (l[u(h, p)] = d);
         } else
-          l[f] = d;
+          l[p] = d;
       else
-        o === "css-vars" && (l[u(h, f)] = d);
+        o === "css-vars" && (l[u(h, p)] = d);
     }
   }), s.htmlStyle = l, s;
 }
-function ft(t) {
+function pt(t) {
   const e = {};
   if (t.color && (e.color = t.color), t.bgColor && (e["background-color"] = t.bgColor), t.fontStyle) {
     t.fontStyle & z.Italic && (e["font-style"] = "italic"), t.fontStyle & z.Bold && (e["font-weight"] = "bold");
@@ -6114,7 +6114,7 @@ function kt(t, e) {
 function We(t) {
   return Eo.get(t);
 }
-class Pe {
+class Le {
   /**
    * Theme to Stack mapping
    */
@@ -6133,7 +6133,7 @@ class Pe {
    * Static method to create a initial grammar state.
    */
   static initial(e, n) {
-    return new Pe(
+    return new Le(
       Object.fromEntries(il(n).map((r) => [r, Zt])),
       e
     );
@@ -6178,7 +6178,7 @@ function dl(t) {
   return r(t), e;
 }
 function gl(t, e) {
-  if (!(t instanceof Pe))
+  if (!(t instanceof Le))
     throw new F("Invalid grammar state");
   return t.getInternalStack(e);
 }
@@ -6198,11 +6198,13 @@ function ml() {
           const i = o.lines[a.line];
           if (i === void 0)
             throw new F(`Invalid decoration position ${JSON.stringify(a)}. Lines length: ${o.lines.length}`);
-          if (a.character < 0 || a.character > i.length)
+          let l = a.character;
+          if (l < 0 && (l = i.length + l), l < 0 || l > i.length)
             throw new F(`Invalid decoration position ${JSON.stringify(a)}. Line ${a.line} length: ${i.length}`);
           return {
             ...a,
-            offset: o.posToIndex(a.line, a.character)
+            character: l,
+            offset: o.posToIndex(a.line, l)
           };
         }
       };
@@ -6225,7 +6227,7 @@ function ml() {
       if (!this.options.decorations?.length)
         return;
       const o = e(this).decorations.flatMap((a) => [a.start.offset, a.end.offset]);
-      return pl(n, o);
+      return fl(n, o);
     },
     code(n) {
       if (!this.options.decorations?.length)
@@ -6233,19 +6235,19 @@ function ml() {
       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, f, d) {
-        const p = o[c];
+      function s(c, h, p, d) {
+        const f = o[c];
         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; _++)
-            g += Ao(p.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === f && (y = _ + 1);
+        if (h === 0 && (C = 0), p === 0 && (y = 0), p === Number.POSITIVE_INFINITY && (y = f.children.length), C === -1 || y === -1)
+          for (let _ = 0; _ < f.children.length; _++)
+            g += Ao(f.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === p && (y = _ + 1);
         if (C === -1)
           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");
+        const m = f.children.slice(C, y);
+        if (!d.alwaysWrap && m.length === f.children.length)
+          i(f, d, "line");
         else if (!d.alwaysWrap && m.length === 1 && m[0].type === "element")
           i(m[0], d, "token");
         else {
@@ -6255,30 +6257,30 @@ function ml() {
             properties: {},
             children: m
           };
-          i(_, d, "wrapper"), p.children.splice(C, m.length, _);
+          i(_, d, "wrapper"), f.children.splice(C, m.length, _);
         }
       }
       function a(c, h) {
         o[c] = i(o[c], h, "line");
       }
-      function i(c, h, f) {
-        const d = h.properties || {}, p = h.transform || ((g) => g);
+      function i(c, h, p) {
+        const d = h.properties || {}, f = h.transform || ((g) => g);
         return c.tagName = h.tagName || "span", c.properties = {
           ...c.properties,
           ...d,
           class: c.properties.class
-        }, h.properties?.class && xo(c, h.properties.class), c = p(c, f) || c, c;
+        }, h.properties?.class && xo(c, h.properties.class), c = f(c, p) || 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: f } = c;
-        if (h.line === f.line)
-          s(h.line, h.character, f.character, c);
-        else if (h.line < f.line) {
+        const { start: h, end: p } = c;
+        if (h.line === p.line)
+          s(h.line, h.character, p.character, c);
+        else if (h.line < p.line) {
           s(h.line, h.character, Number.POSITIVE_INFINITY, c);
-          for (let d = h.line + 1; d < f.line; d++)
+          for (let d = h.line + 1; d < p.line; d++)
             l.unshift(() => a(d, c));
-          s(f.line, 0, f.character, c);
+          s(p.line, 0, p.character, c);
         }
       }
       l.forEach((c) => c());
@@ -6293,7 +6295,7 @@ function yl(t) {
     for (let r = e + 1; r < t.length; r++) {
       const o = t[r], s = n.start.offset <= o.start.offset && o.start.offset < n.end.offset, a = n.start.offset < o.end.offset && o.end.offset <= n.end.offset, i = o.start.offset <= n.start.offset && n.start.offset < o.end.offset, l = o.start.offset < n.end.offset && n.end.offset <= o.end.offset;
       if (s || a || i || l) {
-        if (s && a || i && l)
+        if (s && a || i && l || i && n.start.offset === n.end.offset || a && o.start.offset === o.end.offset)
           continue;
         throw new F(`Decorations ${JSON.stringify(n.start)} and ${JSON.stringify(o.start)} intersect.`);
       }
@@ -6307,11 +6309,29 @@ const bl = [
   /* @__PURE__ */ ml()
 ];
 function dt(t) {
+  const e = wl(t.transformers || []);
   return [
-    ...t.transformers || [],
+    ...e.pre,
+    ...e.normal,
+    ...e.post,
     ...bl
   ];
 }
+function wl(t) {
+  const e = [], n = [], r = [];
+  for (const o of t)
+    switch (o.enforce) {
+      case "pre":
+        e.push(o);
+        break;
+      case "post":
+        n.push(o);
+        break;
+      default:
+        r.push(o);
+    }
+  return { pre: e, post: n, normal: r };
+}
 var de = [
   "black",
   "red",
@@ -6338,7 +6358,7 @@ var de = [
   8: "hidden",
   9: "strikethrough"
 };
-function wl(t, e) {
+function Cl(t, e) {
   const n = t.indexOf("\x1B", e);
   if (n !== -1 && t[n + 1] === "[") {
     const r = t.indexOf("m", n);
@@ -6367,7 +6387,7 @@ function tr(t) {
       return { type: "table", index: Number(n) };
   }
 }
-function Cl(t) {
+function _l(t) {
   const e = [];
   for (; t.length > 0; ) {
     const n = t.shift();
@@ -6435,21 +6455,21 @@ function Cl(t) {
   }
   return e;
 }
-function _l() {
+function Sl() {
   let t = null, e = null, n = /* @__PURE__ */ new Set();
   return {
     parse(r) {
       const o = [];
       let s = 0;
       do {
-        const a = wl(r, s), i = a.sequence ? r.substring(s, a.startPosition) : r.substring(s);
+        const a = Cl(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 = Cl(a.sequence);
+          const l = _l(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)
@@ -6461,7 +6481,7 @@ function _l() {
     }
   };
 }
-var Sl = {
+var kl = {
   black: "#000000",
   red: "#bb0000",
   green: "#00bb00",
@@ -6479,7 +6499,7 @@ var Sl = {
   brightCyan: "#55ffff",
   brightWhite: "#ffffff"
 };
-function kl(t = Sl) {
+function vl(t = kl) {
   function e(i) {
     return t[i];
   }
@@ -6520,19 +6540,19 @@ function kl(t = Sl) {
     value: a
   };
 }
-function vl(t, e, n) {
-  const r = pt(t, n), o = St(e), s = kl(
+function xl(t, e, n) {
+  const r = ft(t, n), o = St(e), s = vl(
     Object.fromEntries(
       de.map((i) => [
         i,
         t.colors?.[`terminal.ansi${i[0].toUpperCase()}${i.substring(1)}`]
       ])
     )
-  ), a = _l();
+  ), a = Sl();
   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 = xl(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 = El(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,
@@ -6545,7 +6565,7 @@ function vl(t, e, n) {
     })
   );
 }
-function xl(t) {
+function El(t) {
   const e = t.match(/#([0-9a-f]{3})([0-9a-f]{3})?([0-9a-f]{2})?/);
   if (e)
     if (e[3]) {
@@ -6564,7 +6584,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 vl(s, e, n);
+    return xl(s, e, n);
   const i = t.getLanguage(r);
   if (n.grammarState) {
     if (n.grammarState.lang !== i.name)
@@ -6572,9 +6592,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 Al(e, i, s, a, n);
+  return Rl(e, i, s, a, n);
 }
-function El(...t) {
+function Al(...t) {
   if (t.length === 2)
     return We(t[1]);
   const [e, n, r = {}] = t, {
@@ -6586,14 +6606,14 @@ function El(...t) {
   if (o === "ansi")
     throw new F("ANSI language does not have grammar state");
   const { theme: a, colorMap: i } = e.setTheme(s), l = e.getLanguage(o);
-  return new Pe(
+  return new Le(
     gt(n, l, a, i, r).stateStack,
     l.name,
     a.name
   );
 }
-function Al(t, e, n, r, o) {
-  const s = gt(t, e, n, r, o), a = new Pe(
+function Rl(t, e, n, r, o) {
+  const s = gt(t, e, n, r, o), a = new Le(
     gt(t, e, n, r, o).stateStack,
     e.name,
     n.name
@@ -6601,7 +6621,7 @@ function Al(t, e, n, r, o) {
   return kt(s.tokens, a), s.tokens;
 }
 function gt(t, e, n, r, o) {
-  const s = pt(n, o), {
+  const s = ft(n, o), {
     tokenizeMaxLineLength: a = 0,
     tokenizeTimeLimit: i = 500
   } = o, l = St(t);
@@ -6617,15 +6637,15 @@ function gt(t, e, n, r, o) {
     }
   ).stateStack : Zt, c = [];
   const h = [];
-  for (let f = 0, d = l.length; f < d; f++) {
-    const [p, g] = l[f];
-    if (p === "") {
+  for (let p = 0, d = l.length; p < d; p++) {
+    const [f, g] = l[p];
+    if (f === "") {
       c = [], h.push([]);
       continue;
     }
-    if (a > 0 && p.length >= a) {
+    if (a > 0 && f.length >= a) {
       c = [], h.push([{
-        content: p,
+        content: f,
         offset: g,
         color: "",
         fontStyle: 0
@@ -6633,17 +6653,17 @@ function gt(t, e, n, r, o) {
       continue;
     }
     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;
+    o.includeExplanation && (C = e.tokenizeLine(f, u, i), y = C.tokens, m = 0);
+    const _ = e.tokenizeLine2(f, 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;
-      if (D === P)
+      const D = _.tokens[2 * A], L = A + 1 < S ? _.tokens[2 * A + 2] : f.length;
+      if (D === L)
         continue;
       const j = _.tokens[2 * A + 1], Z = ue(
         r[Re.getForeground(j)],
         s
       ), ee = Re.getFontStyle(j), ce = {
-        content: p.substring(D, P),
+        content: f.substring(D, L),
         offset: g + D,
         color: Z,
         fontStyle: ee
@@ -6670,16 +6690,16 @@ function gt(t, e, n, r, o) {
           }
         ce.explanation = [];
         let R = 0;
-        for (; D + R < P; ) {
-          const k = y[m], G = p.substring(
+        for (; D + R < L; ) {
+          const k = y[m], G = f.substring(
             k.startIndex,
             k.endIndex
           );
           R += G.length, ce.explanation.push({
             content: G,
-            scopes: o.includeExplanation === "scopeName" ? Rl(
+            scopes: o.includeExplanation === "scopeName" ? Il(
               k.scopes
-            ) : Il(
+            ) : Nl(
               te,
               k.scopes
             )
@@ -6695,10 +6715,10 @@ function gt(t, e, n, r, o) {
     stateStack: u
   };
 }
-function Rl(t) {
+function Il(t) {
   return t.map((e) => ({ scopeName: e }));
 }
-function Il(t, e) {
+function Nl(t, e) {
   const n = [];
   for (let r = 0, o = e.length; r < o; r++) {
     const s = e[r];
@@ -6712,7 +6732,7 @@ function Il(t, e) {
 function nr(t, e) {
   return t === e || e.substring(0, t.length) === t && e[t.length] === ".";
 }
-function Nl(t, e, n) {
+function Ll(t, e, n) {
   if (!nr(t[t.length - 1], e))
     return !1;
   let r = t.length - 2, o = n.length - 1;
@@ -6724,7 +6744,7 @@ function Pl(t, e, n) {
   const r = [];
   for (const { selectors: o, settings: s } of t)
     for (const a of o)
-      if (Nl(a, e, n)) {
+      if (Ll(a, e, n)) {
         r.push(s);
         break;
       }
@@ -6741,32 +6761,32 @@ function Ro(t, e, n) {
       state: c,
       theme: h
     };
-  }), s = Ll(
+  }), s = $l(
     ...o.map((l) => l.tokens)
   ), a = s[0].map(
     (l, u) => l.map((c, h) => {
-      const f = {
+      const p = {
         content: c.content,
         variants: {},
         offset: c.offset
       };
-      return "includeExplanation" in n && n.includeExplanation && (f.explanation = c.explanation), s.forEach((d, p) => {
+      return "includeExplanation" in n && n.includeExplanation && (p.explanation = c.explanation), s.forEach((d, f) => {
         const {
           content: g,
           explanation: C,
           offset: y,
           ...m
         } = d[u][h];
-        f.variants[r[p].color] = m;
-      }), f;
+        p.variants[r[f].color] = m;
+      }), p;
     })
-  ), i = o[0].state ? new Pe(
+  ), i = o[0].state ? new Le(
     Object.fromEntries(o.map((l) => [l.theme, l.state?.getInternalStack(l.theme)])),
     o[0].state.lang
   ) : void 0;
   return i && kt(a, i), a;
 }
-function Ll(...t) {
+function $l(...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(() => []);
@@ -6796,22 +6816,22 @@ function mt(t, e, n) {
       defaultColor: u = "light",
       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)
+    } = n, p = 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 (p.length === 0)
       throw new F("`themes` option must not be empty");
     const d = Ro(
       t,
       e,
       n
     );
-    if (l = We(d), u && _n !== u && !f.find((y) => y.color === u))
+    if (l = We(d), u && _n !== u && !p.find((y) => y.color === u))
       throw new F(`\`themes\` option must contain the defaultColor key \`${u}\``);
-    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(";");
+    const f = p.map((y) => t.getTheme(y.theme)), g = p.map((y) => y.color);
+    s = d.map((y) => y.map((m) => pl(m, g, c, u, h))), l && kt(s, l);
+    const C = p.map((y) => ft(y.theme, n));
+    o = rr(p, f, C, c, u, "fg", h), r = rr(p, f, C, c, u, "bg", h), a = `shiki-themes ${f.map((y) => y.name).join(" ")}`, i = u ? void 0 : [o, r].join(";");
   } else if ("theme" in n) {
-    const u = pt(n.theme, n);
+    const u = ft(n.theme, n);
     s = Sn(
       t,
       e,
@@ -6835,11 +6855,11 @@ function rr(t, e, n, r, o, s, a) {
     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 h = t.findIndex((g) => g.color === "light"), f = t.findIndex((g) => g.color === "dark");
-        if (h === -1 || f === -1)
+        const h = t.findIndex((g) => g.color === "light"), p = t.findIndex((g) => g.color === "dark");
+        if (h === -1 || p === -1)
           throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-        const d = ue(e[h][s], n[h]) || "inherit", p = ue(e[f][s], n[f]) || "inherit";
-        return `light-dark(${d}, ${p});${c}`;
+        const d = ue(e[h][s], n[h]) || "inherit", f = ue(e[p][s], n[p]) || "inherit";
+        return `light-dark(${d}, ${f});${c}`;
       }
       return u;
     }
@@ -6853,8 +6873,8 @@ function yt(t, e, n, r = {
   codeToTokens: (o, s) => mt(t, o, s)
 }) {
   let o = e;
-  for (const p of dt(n))
-    o = p.preprocess?.call(r, o, n) || o;
+  for (const f of dt(n))
+    o = f.preprocess?.call(r, o, n) || o;
   let {
     tokens: s,
     fg: a,
@@ -6865,18 +6885,18 @@ function yt(t, e, n, r = {
   } = mt(t, o, n);
   const {
     mergeWhitespaces: h = !0,
-    mergeSameStyleTokens: f = !1
+    mergeSameStyleTokens: p = !1
   } = n;
-  h === !0 ? s = Tl(s) : h === "never" && (s = Ml(s)), f && (s = Ol(s));
+  h === !0 ? s = Ml(s) : h === "never" && (s = Ol(s)), p && (s = Dl(s));
   const d = {
     ...r,
     get source() {
       return o;
     }
   };
-  for (const p of dt(n))
-    s = p.tokens?.call(d, s) || s;
-  return $l(
+  for (const f of dt(n))
+    s = f.tokens?.call(d, s) || s;
+  return Tl(
     s,
     {
       ...n,
@@ -6889,7 +6909,7 @@ function yt(t, e, n, r = {
     c
   );
 }
-function $l(t, e, n, r = We(t)) {
+function Tl(t, e, n, r = We(t)) {
   const o = dt(e), s = [], a = {
     type: "root",
     children: []
@@ -6909,7 +6929,7 @@ function $l(t, e, n, r = We(t)) {
       ...Object.fromEntries(
         Array.from(
           Object.entries(e.meta || {})
-        ).filter(([p]) => !p.startsWith("_"))
+        ).filter(([f]) => !f.startsWith("_"))
       )
     },
     children: []
@@ -6919,7 +6939,7 @@ function $l(t, e, n, r = We(t)) {
     properties: {},
     children: s
   };
-  const h = [], f = {
+  const h = [], p = {
     ...n,
     structure: i,
     addClassToHast: xo,
@@ -6945,7 +6965,7 @@ function $l(t, e, n, r = We(t)) {
       return h;
     }
   };
-  if (t.forEach((p, g) => {
+  if (t.forEach((f, g) => {
     g && (i === "inline" ? a.children.push({ type: "element", tagName: "br", properties: {}, children: [] }) : i === "classic" && s.push({ type: "text", value: `
 ` }));
     let C = {
@@ -6954,7 +6974,7 @@ function $l(t, e, n, r = We(t)) {
       properties: { class: "line" },
       children: []
     }, y = 0;
-    for (const m of p) {
+    for (const m of f) {
       let _ = {
         type: "element",
         tagName: "span",
@@ -6963,31 +6983,31 @@ function $l(t, e, n, r = We(t)) {
         },
         children: [{ type: "text", value: m.content }]
       };
-      const S = rn(m.htmlStyle || ft(m));
+      const S = rn(m.htmlStyle || pt(m));
       S && (_.properties.style = S);
       for (const A of o)
-        _ = A?.span?.call(f, _, g + 1, y, C, m) || _;
+        _ = A?.span?.call(p, _, g + 1, y, C, m) || _;
       i === "inline" ? a.children.push(_) : i === "classic" && C.children.push(_), y += m.content.length;
     }
     if (i === "classic") {
       for (const m of o)
-        C = m?.line?.call(f, C, g + 1) || C;
+        C = m?.line?.call(p, C, g + 1) || C;
       h.push(C), s.push(C);
     }
   }), i === "classic") {
-    for (const p of o)
-      c = p?.code?.call(f, c) || c;
+    for (const f of o)
+      c = f?.code?.call(p, c) || c;
     u.children.push(c);
-    for (const p of o)
-      u = p?.pre?.call(f, u) || u;
+    for (const f of o)
+      u = f?.pre?.call(p, u) || u;
     a.children.push(u);
   }
   let d = a;
-  for (const p of o)
-    d = p?.root?.call(f, d) || d;
+  for (const f of o)
+    d = f?.root?.call(p, d) || d;
   return r && kt(d, r), d;
 }
-function Tl(t) {
+function Ml(t) {
   return t.map((e) => {
     const n = [];
     let r = "", o = 0;
@@ -7007,7 +7027,7 @@ function Tl(t) {
     }), n;
   });
 }
-function Ml(t) {
+function Ol(t) {
   return t.map((e) => e.flatMap((n) => {
     if (n.content.match(/^\s+$/))
       return n;
@@ -7031,7 +7051,7 @@ function Ml(t) {
     }), i;
   }));
 }
-function Ol(t) {
+function Dl(t) {
   return t.map((e) => {
     const n = [];
     for (const r of e) {
@@ -7039,21 +7059,21 @@ function Ol(t) {
         n.push({ ...r });
         continue;
       }
-      const o = n[n.length - 1], s = rn(o.htmlStyle || ft(o)), a = rn(r.htmlStyle || ft(r)), i = o.fontStyle && (o.fontStyle & z.Underline || o.fontStyle & z.Strikethrough), l = r.fontStyle && (r.fontStyle & z.Underline || r.fontStyle & z.Strikethrough);
+      const o = n[n.length - 1], s = rn(o.htmlStyle || pt(o)), a = rn(r.htmlStyle || pt(r)), i = o.fontStyle && (o.fontStyle & z.Underline || o.fontStyle & z.Strikethrough), l = r.fontStyle && (r.fontStyle & z.Underline || r.fontStyle & z.Strikethrough);
       !i && !l && s === a ? o.content += r.content : n.push({ ...r });
     }
     return n;
   });
 }
-const Dl = ol;
-function Gl(t, e, n) {
+const Gl = ol;
+function Fl(t, e, n) {
   const r = {
     meta: {},
     options: n,
     codeToHast: (s, a) => yt(t, s, a),
     codeToTokens: (s, a) => mt(t, s, a)
   };
-  let o = Dl(yt(t, e, n, r));
+  let o = Gl(yt(t, e, n, r));
   for (const s of dt(n))
     o = s.postprocess?.call(r, o, n) || o;
   return o;
@@ -7129,16 +7149,16 @@ async function No(t) {
     )
   )).filter((n) => !!n);
 }
-let Fl = 3;
-function Bl(t, e = 3) {
-  e > Fl || console.trace(`[SHIKI DEPRECATE]: ${t}`);
+let Bl = 3;
+function jl(t, e = 3) {
+  e > Bl || console.trace(`[SHIKI DEPRECATE]: ${t}`);
 }
 class ve extends Error {
   constructor(e) {
     super(e), this.name = "ShikiError";
   }
 }
-class jl extends Ka {
+class Ul 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 +7245,7 @@ class jl extends Ka {
         this._langGraph.set(n, this._langMap.get(n));
   }
 }
-class Ul {
+class zl {
   _langs = /* @__PURE__ */ new Map();
   _scopeToLang = /* @__PURE__ */ new Map();
   _injections = /* @__PURE__ */ new Map();
@@ -7263,12 +7283,12 @@ class Ul {
   }
 }
 let De = 0;
-function zl(t) {
+function Hl(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 Ul(t.engine, n), s = new jl(o, r, n, t.langAlias);
+  const n = (t.langs || []).flat(1), r = (t.themes || []).flat(1).map(kn), o = new zl(t.engine, n), s = new Ul(o, r, n, t.langAlias);
   let a;
   function i(m) {
     C();
@@ -7302,19 +7322,19 @@ function zl(t) {
   function h() {
     return C(), s.getLoadedLanguages();
   }
-  function f(...m) {
+  function p(...m) {
     C(), s.loadLanguages(m.flat(1));
   }
   async function d(...m) {
-    return f(await Io(m));
+    return p(await Io(m));
   }
-  function p(...m) {
+  function f(...m) {
     C();
     for (const _ of m.flat(1))
       s.loadTheme(_);
   }
   async function g(...m) {
-    return C(), p(await No(m));
+    return C(), f(await No(m));
   }
   function C() {
     if (e)
@@ -7330,15 +7350,15 @@ function zl(t) {
     getLoadedThemes: c,
     getLoadedLanguages: h,
     loadLanguage: d,
-    loadLanguageSync: f,
+    loadLanguageSync: p,
     loadTheme: g,
-    loadThemeSync: p,
+    loadThemeSync: f,
     dispose: y,
     [Symbol.dispose]: y
   };
 }
-async function Hl(t) {
-  t.engine || Bl("`engine` option is required. Use `createOnigurumaEngine` or `createJavaScriptRegexEngine` to create an engine.");
+async function Wl(t) {
+  t.engine || jl("`engine` option is required. Use `createOnigurumaEngine` or `createJavaScriptRegexEngine` to create an engine.");
   const [
     e,
     n,
@@ -7348,44 +7368,44 @@ async function Hl(t) {
     Io(t.langs || []),
     t.engine
   ]);
-  return zl({
+  return Hl({
     ...t,
     themes: e,
     langs: n,
     engine: r
   });
 }
-async function Wl(t) {
-  const e = await Hl(t);
+async function Vl(t) {
+  const e = await Wl(t);
   return {
-    getLastGrammarState: (...n) => El(e, ...n),
+    getLastGrammarState: (...n) => Al(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) => Gl(e, n, r),
+    codeToHtml: (n, r) => Fl(e, n, r),
     getBundledLanguages: () => ({}),
     getBundledThemes: () => ({}),
     ...e,
     getInternalContext: () => e
   };
 }
-function Po(t) {
-  return "children" in t ? Lo(t) : "value" in t ? t.value : "";
+function Lo(t) {
+  return "children" in t ? Po(t) : "value" in t ? t.value : "";
 }
-function Vl(t) {
-  return t.type === "text" ? t.value : "children" in t ? Lo(t) : "";
+function ql(t) {
+  return t.type === "text" ? t.value : "children" in t ? Po(t) : "";
 }
-function Lo(t) {
+function Po(t) {
   let e = -1;
   const n = [];
   for (; ++e < t.children.length; )
-    n[e] = Vl(t.children[e]);
+    n[e] = ql(t.children[e]);
   return n.join("");
 }
-const ql = {
+const Xl = {
   "tailing-curly-colon": (t, e) => {
-    const n = Po(e), r = n.match(/(.+)\{:([\w-]+)\}$/);
+    const n = Lo(e), r = n.match(/(.+)\{:([\w-]+)\}$/);
     if (r)
       return {
         type: "inline",
@@ -7393,7 +7413,7 @@ const ql = {
         lang: r.at(2)
       };
   }
-}, ir = "language-", Xl = (t, e) => {
+}, ir = "language-", Kl = (t, e) => {
   const n = e.children[0];
   if (!n || n.type !== "element" || n.tagName !== "code" || !n.properties)
     return;
@@ -7403,11 +7423,11 @@ const ql = {
   return {
     type: "pre",
     lang: typeof o == "string" ? o.slice(ir.length) : void 0,
-    code: Po(n),
+    code: Lo(n),
     meta: n.data?.meta ?? n.properties.metastring?.toString() ?? ""
   };
-}, Kl = "language-";
-function Yl(t, e) {
+}, Yl = "language-";
+function Jl(t, e) {
   const {
     addLanguageClass: n = !1,
     parseMetaString: r,
@@ -7420,8 +7440,8 @@ function Yl(t, e) {
     lazy: c = !1,
     ...h
   } = e;
-  function f(d, p, g = "", C = {}) {
-    const y = `${d}:${g}:${p}`, m = o?.get(y);
+  function p(d, f, g = "", C = {}) {
+    const y = `${d}:${g}:${f}`, m = o?.get(y);
     if (m)
       return m;
     const _ = {
@@ -7438,13 +7458,13 @@ function Yl(t, e) {
       {
         name: "rehype-shiki:code-language-class",
         code(S) {
-          return this.addClassToHast(S, `${Kl}${d}`), S;
+          return this.addClassToHast(S, `${Yl}${d}`), S;
         }
       }
-    ]), l && p.endsWith(`
-`) && (p = p.slice(0, -1));
+    ]), l && f.endsWith(`
+`) && (f = f.slice(0, -1));
     try {
-      const S = t.codeToHast(p, _);
+      const S = t.codeToHast(f, _);
       return o?.set(y, S), S;
     } catch (S) {
       if (i)
@@ -7454,15 +7474,15 @@ function Yl(t, e) {
     }
   }
   return (d) => {
-    const p = [];
+    const f = [];
     if (qr(d, "element", (g, C, y) => {
       let m;
       if (!y || C == null)
         return;
       if (g.tagName === "pre")
-        m = Xl;
+        m = Kl;
       else if (g.tagName === "code" && u)
-        m = ql[u];
+        m = Xl[u];
       else
         return;
       const _ = m(d, g);
@@ -7471,8 +7491,8 @@ function Yl(t, e) {
       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, g, d) : void 0, P = (j) => {
-        const Z = f(j, _.code, _.meta, D ?? {});
+      const D = _.meta ? r?.(_.meta, g, d) : void 0, L = (j) => {
+        const Z = p(j, _.code, _.meta, D ?? {});
         if (Z) {
           if (_.type === "inline") {
             const ee = Z.children[0];
@@ -7483,26 +7503,26 @@ function Yl(t, e) {
       };
       if (A)
         try {
-          p.push(t.loadLanguage(S).then(() => P(S)));
+          f.push(t.loadLanguage(S).then(() => L(S)));
         } catch (j) {
           if (a)
-            return P(a);
+            return L(a);
           if (i)
             i(j);
           else throw j;
         }
       else
-        P(S);
+        L(S);
       return "skip";
-    }), p.length > 0) {
+    }), f.length > 0) {
       async function g() {
-        await Promise.all(p);
+        await Promise.all(f);
       }
       return g();
     }
   };
 }
-function Jl(t) {
+function Zl(t) {
   if (!t)
     return null;
   const e = t.match(/\{([\d,-]+)\}/);
@@ -7512,7 +7532,7 @@ function Jl(t) {
   }) : null;
 }
 const lr = Symbol("highlighted-lines");
-function Zl(t = {}) {
+function Ql(t = {}) {
   const {
     className: e = "highlighted"
   } = t;
@@ -7522,14 +7542,14 @@ function Zl(t = {}) {
       if (!this.options.meta?.__raw)
         return;
       const o = this.meta;
-      return o[lr] ??= Jl(this.options.meta.__raw), (o[lr] ?? []).includes(r) && this.addClassToHast(n, e), n;
+      return o[lr] ??= Zl(this.options.meta.__raw), (o[lr] ?? []).includes(r) && this.addClassToHast(n, e), n;
     }
   };
 }
-function Ql(t) {
+function eu(t) {
   return t ? Array.from(t.matchAll(/\/((?:\\.|[^/])+)\//g)).map((n) => n[1].replace(/\\(.)/g, "$1")) : [];
 }
-function eu(t = {}) {
+function tu(t = {}) {
   const {
     className: e = "highlighted-word"
   } = t;
@@ -7538,10 +7558,10 @@ function eu(t = {}) {
     preprocess(n, r) {
       if (!this.options.meta?.__raw)
         return;
-      const o = Ql(this.options.meta.__raw);
+      const o = eu(this.options.meta.__raw);
       r.decorations ||= [];
       for (const s of o) {
-        const a = tu(n, s);
+        const a = nu(n, s);
         for (const i of a)
           r.decorations.push({
             start: i,
@@ -7554,7 +7574,7 @@ function eu(t = {}) {
     }
   };
 }
-function tu(t, e) {
+function nu(t, e) {
   const n = [];
   let r = 0;
   for (; ; ) {
@@ -7565,11 +7585,11 @@ function tu(t, e) {
   }
   return n;
 }
-function Le(t) {
+function Pe(t) {
   if ([...t].length !== 1) throw new Error(`Expected "${t}" to be a single code point`);
   return t.codePointAt(0);
 }
-function nu(t, e, n) {
+function ru(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 +7629,10 @@ const $o = B`\[\^?`, To = `c.? | C(?:-.?)?|${B`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x
   | &&
   | .
 `.replace(/\s+/g, ""), "gsu");
-function ru(t, e = {}) {
+function ou(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 = Su(n.flags), o = [r.extended], s = { captureGroup: n.rules.captureGroup, getCurrentModX() {
+  const r = ku(n.flags), o = [r.extended], s = { captureGroup: n.rules.captureGroup, getCurrentModX() {
     return o.at(-1);
   }, numOpenGroups: 0, popModX() {
     o.pop();
@@ -7623,30 +7643,30 @@ function ru(t, e = {}) {
   }, singleline: n.rules.singleline };
   let a = [], i;
   for (et.lastIndex = 0; i = et.exec(t); ) {
-    const h = ou(s, t, i[0], et.lastIndex);
+    const h = su(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, f) => {
-    h.kind = "capturing", h.number = f + 1;
+  }), u || l.forEach((h, p) => {
+    h.kind = "capturing", h.number = p + 1;
   });
   const c = u || l.length;
-  return { tokens: a.map((h) => h.type === "EscapedNumber" ? vu(h, c) : h).flat(), flags: r };
+  return { tokens: a.map((h) => h.type === "EscapedNumber" ? xu(h, c) : h).flat(), flags: r };
 }
-function ou(t, e, n, r) {
+function su(t, e, n, r) {
   const [o, s] = n;
   if (n === "[" || n === "[^") {
-    const a = su(e, n, r);
+    const a = au(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: gu(n) };
+      return { token: mu(n) };
     }
     if (/^\\k[<']/.test(n)) {
       if (!/^\\k(?:<[^>]+>|'[^']+')$/.test(n)) throw new Error(`Invalid group name "${n}"`);
@@ -7660,13 +7680,13 @@ function ou(t, e, n, r) {
     return Array.isArray(a) ? { tokens: a } : { token: a };
   }
   if (o === "(") {
-    if (s === "*") return { token: wu(n) };
+    if (s === "*") return { token: Cu(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: bu(n, t) };
+    if (/^\(\?[-imx]+[:)]$/.test(n)) return { token: wu(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("!") }) };
@@ -7697,9 +7717,9 @@ function ou(t, e, n, r) {
     const a = t.singleline ? { "^": B`\A`, $: B`\Z` }[n] : n;
     return { token: ur(a, n) };
   }
-  return n === "|" ? { token: iu(n) } : xn.test(n) ? { tokens: xu(n) } : { token: se(Le(n), n) };
+  return n === "|" ? { token: lu(n) } : xn.test(n) ? { tokens: Eu(n) } : { token: se(Pe(n), n) };
 }
-function su(t, e, n) {
+function au(t, e, n) {
   const r = [cr(e[1] === "^", e)];
   let o = 1, s;
   for (Ot.lastIndex = n; s = Ot.exec(t); ) {
@@ -7707,50 +7727,50 @@ function su(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(lu(a)), !o) break;
+      else if (o--, r.push(uu(a)), !o) break;
     } else {
-      const i = au(a);
+      const i = iu(a);
       Array.isArray(i) ? r.push(...i) : r.push(i);
     }
   }
   return { tokens: r, lastIndex: Ot.lastIndex || t.length };
 }
-function au(t) {
+function iu(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 === "-" ? uu(t) : t === "&&" ? cu(t) : se(Le(t), t);
+  return t === "-" ? cu(t) : t === "&&" ? hu(t) : se(Pe(t), t);
 }
 function Mo(t, { inCharClass: e }) {
   const n = t[1];
-  if (n === "c" || n === "C") return yu(t);
-  if ("dDhHsSwW".includes(n)) return Cu(t);
+  if (n === "c" || n === "C") return bu(t);
+  if ("dDhHsSwW".includes(n)) return _u(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 _u(t);
+    return Su(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();
     return [...o].map((a) => {
       const i = [...s.encode(a)].map((l) => `\\x${l.toString(16)}`).join("");
-      return se(Le(a), i);
+      return se(Pe(a), i);
     });
   } catch {
     throw new Error(`Multibyte code "${t}" incomplete or invalid in Oniguruma`);
   }
-  if (n === "u" || n === "x") return se(ku(t), t);
+  if (n === "u" || n === "x") return se(vu(t), t);
   if (hr.has(n)) return se(hr.get(n), t);
-  if (/\d/.test(n)) return hu(e, t);
+  if (/\d/.test(n)) return fu(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 iu(t) {
+function lu(t) {
   return { type: "Alternator", raw: t };
 }
 function ur(t, e) {
@@ -7762,13 +7782,13 @@ function Oo(t) {
 function se(t, e) {
   return { type: "Character", value: t, raw: e };
 }
-function lu(t) {
+function uu(t) {
   return { type: "CharacterClassClose", raw: t };
 }
-function uu(t) {
+function cu(t) {
   return { type: "CharacterClassHyphen", raw: t };
 }
-function cu(t) {
+function hu(t) {
   return { type: "CharacterClassIntersector", raw: t };
 }
 function cr(t, e) {
@@ -7780,7 +7800,7 @@ 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 hu(t, e) {
+function fu(t, e) {
   return { type: "EscapedNumber", inCharClass: t, raw: e };
 }
 function pu(t) {
@@ -7789,36 +7809,36 @@ function pu(t) {
 function Se(t, e, n = {}) {
   return { type: "GroupOpen", kind: t, ...n, raw: e };
 }
-function fu(t, e, n, r) {
+function du(t, e, n, r) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n, raw: r };
 }
-function du(t, e, n, r) {
+function gu(t, e, n, r) {
   return { type: "Quantifier", kind: t, min: e, max: n, raw: r };
 }
-function gu(t) {
+function mu(t) {
   return { type: "Subroutine", raw: 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 yu = /* @__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 bu(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);
+  return se(Pe(e.toUpperCase()) - 64, t);
 }
-function bu(t, e) {
+function wu(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 = {};
+  const o = (e.getCurrentModX() || n.includes("x")) && !r.includes("x"), s = pr(n), a = pr(r), i = {};
   if (s && (i.enable = s), a && (i.disable = a), t.endsWith(")")) return e.replaceCurrentModX(o), Do("flags", t, { flags: i });
   if (t.endsWith(":")) return e.pushModX(o), e.numOpenGroups++, Se("group", t, { ...(s || a) && { flags: i } });
   throw new Error(`Unexpected flag modifier "${t}"`);
 }
-function wu(t) {
+function Cu(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 = mu.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 = yu.has(n) ? n.toLowerCase() : "custom";
   switch (u) {
     case "fail":
     case "mismatch":
@@ -7850,9 +7870,9 @@ function wu(t) {
     default:
       throw new Error(`Unexpected named callout kind "${u}"`);
   }
-  return fu(u, r ?? null, o?.split(",") ?? null, t);
+  return du(u, r ?? null, o?.split(",") ?? null, t);
 }
-function pr(t) {
+function fr(t) {
   let e = null, n, r;
   if (t[0] === "{") {
     const { minStr: o, maxStr: s } = /^\{(?<minStr>\d*)(?:,(?<maxStr>\d*))?/.exec(t).groups, a = 1e5;
@@ -7862,21 +7882,21 @@ 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 du(e, n, r, t);
+  return gu(e, n, r, t);
 }
-function Cu(t) {
+function _u(t) {
   const e = t[1].toLowerCase();
   return ge({ d: "digit", h: "hex", s: "space", w: "word" }[e], t, { negate: t[1] !== e });
 }
-function _u(t) {
+function Su(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 });
 }
-function fr(t) {
+function pr(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 Su(t) {
+function ku(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 +7910,12 @@ function Su(t) {
   }
   return e;
 }
-function ku(t) {
+function vu(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 vu(t, e) {
+function xu(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);
@@ -7904,12 +7924,12 @@ function vu(t, e) {
     let u;
     if (i === 0 && l !== "8" && l !== "9") {
       if (u = parseInt(l, 8), u > 127) throw new Error(B`Octal encoded byte above 177 unsupported "${n}"`);
-    } else u = Le(l);
+    } else u = Pe(l);
     s.push(se(u, (i === 0 ? "\\" : "") + l));
   }
   return s;
 }
-function xu(t) {
+function Eu(t) {
   const e = [], n = new RegExp(xn, "gy");
   let r;
   for (; r = n.exec(t); ) {
@@ -7919,12 +7939,12 @@ function xu(t) {
       if (s) {
         const { min: a, max: i } = s.groups;
         if (+a > +i && o.endsWith("?")) {
-          n.lastIndex--, e.push(pr(o.slice(0, -1)));
+          n.lastIndex--, e.push(fr(o.slice(0, -1)));
           continue;
         }
       }
     }
-    e.push(pr(o));
+    e.push(fr(o));
   }
   return e;
 }
@@ -7934,62 +7954,62 @@ function Go(t, e) {
   const n = t.body[0];
   return !e || Object.keys(e).every((r) => e[r] === n[r]);
 }
-function Eu(t) {
-  return Au.has(t.type);
+function Au(t) {
+  return Ru.has(t.type);
 }
-const Au = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
+const Ru = /* @__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 = 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 = f, s.nextIndex++, p.type) {
+  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = ou(t, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), o = (p, d) => {
+    const f = r.tokens[s.nextIndex];
+    switch (s.parent = p, s.nextIndex++, f.type) {
       case "Alternator":
         return me();
       case "Assertion":
-        return Ru(p);
+        return Iu(f);
       case "Backreference":
-        return Iu(p, s);
+        return Nu(f, s);
       case "Character":
-        return vt(p.value, { useLastValid: !!d.isCheckingRangeEnd });
+        return vt(f.value, { useLastValid: !!d.isCheckingRangeEnd });
       case "CharacterClassHyphen":
-        return Nu(p, s, d);
+        return Lu(f, s, d);
       case "CharacterClassOpen":
-        return Pu(p, s, d);
+        return Pu(f, s, d);
       case "CharacterSet":
-        return Lu(p, s);
+        return $u(f, s);
       case "Directive":
-        return Gu(p.kind, { flags: p.flags });
+        return Fu(f.kind, { flags: f.flags });
       case "GroupOpen":
-        return $u(p, s, d);
+        return Tu(f, s, d);
       case "NamedCallout":
-        return Bu(p.kind, p.tag, p.arguments);
+        return ju(f.kind, f.tag, f.arguments);
       case "Quantifier":
-        return Tu(p, s);
+        return Mu(f, s);
       case "Subroutine":
-        return Mu(p, s);
+        return Ou(f, s);
       default:
-        throw new Error(`Unexpected token type "${p.type}"`);
+        throw new Error(`Unexpected token type "${f.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 = Uu(Fu(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 = zu(Bu(r.flags));
   let i = a.body[0];
   for (; s.nextIndex < r.tokens.length; ) {
-    const f = o(i, {});
-    f.type === "Alternative" ? (a.body.push(f), i = f) : i.body.push(f);
+    const p = o(i, {});
+    p.type === "Alternative" ? (a.body.push(p), i = p) : i.body.push(p);
   }
   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: 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}>"`);
+  for (const { ref: p } of h) if (typeof p == "number") {
+    if (p > l.length) throw new Error("Subroutine uses a group number that's not defined");
+    p && (l[p - 1].isSubroutined = !0);
+  } else if (c.has(p)) {
+    if (c.get(p).length > 1) throw new Error(B`Subroutine uses a duplicate group name "\g<${p}>"`);
+    c.get(p)[0].isSubroutined = !0;
+  } else throw new Error(B`Subroutine uses a group name that's not defined "\g<${p}>"`);
   return a;
 }
-function Ru({ kind: t }) {
+function Iu({ 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 Iu({ raw: t }, e) {
+function Nu({ 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,14 +8026,14 @@ function Iu({ raw: t }, e) {
   }
   return o(+r);
 }
-function Nu(t, e, n) {
+function Lu(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(), Du(a, l);
+    if (a.type === "Character" && l.type === "Character") return s.body.pop(), Gu(a, l);
     throw new Error("Invalid character class range");
   }
-  return vt(Le("-"));
+  return vt(Pe("-"));
 }
 function Pu({ negate: t }, e, n) {
   const { tokens: r, walk: o } = e, s = r[e.nextIndex], a = [st()];
@@ -8029,41 +8049,41 @@ function Pu({ 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 Lu({ kind: t, negate: e, value: n }, r) {
+function $u({ 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" ? ju(n, { negate: e }) : an(t, { negate: e });
+  return t === "posix" ? Uu(n, { negate: e }) : an(t, { negate: e });
 }
-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++;
+function Tu(t, e, n) {
+  const { tokens: r, capturingGroups: o, namedGroupsByName: s, skipLookbehindValidation: a, walk: i } = e, l = Hu(t), u = l.type === "AbsenceFunction", c = gr(l), h = c && l.negate;
+  if (l.type === "CapturingGroup" && (o.push(l), l.name && ru(s, l.name, []).push(l)), u && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
+  let p = yr(r[e.nextIndex]);
+  for (; p.type !== "GroupClose"; ) {
+    if (p.type === "Alternator") l.body.push(me()), e.nextIndex++;
     else {
-      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 d = l.body.at(-1), f = i(d, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || u, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || h });
+      if (d.body.push(f), (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(g);
-        } else if (dr(p) || gr(p) && p.negate) throw new Error(g);
+          if (dr(f) || f.type === "CapturingGroup") throw new Error(g);
+        } else if (dr(f) || gr(f) && f.negate) throw new Error(g);
       }
     }
-    f = yr(r[e.nextIndex]);
+    p = yr(r[e.nextIndex]);
   }
   return e.nextIndex++, l;
 }
-function Tu({ kind: t, min: e, max: n }, r) {
+function Mu({ kind: t, min: e, max: n }, r) {
   const o = r.parent, s = o.body.at(-1);
-  if (!s || !Eu(s)) throw new Error("Quantifier requires a repeatable token");
+  if (!s || !Au(s)) throw new Error("Quantifier requires a repeatable token");
   const a = jo(t, e, n, s);
   return o.body.pop(), a;
 }
-function Mu({ raw: t }, e) {
+function Ou({ 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 +8094,7 @@ function Mu({ raw: t }, e) {
   const a = Uo(o);
   return r.push(a), a;
 }
-function Ou(t, e) {
+function Du(t, e) {
   return { type: "AbsenceFunction", kind: t, body: Ye(e?.body) };
 }
 function me(t) {
@@ -8090,7 +8110,7 @@ function sn(t, e) {
 }
 function Bo(t, e) {
   const n = { name: void 0, isSubroutined: !1, ...e };
-  if (n.name !== void 0 && !Hu(n.name)) throw new Error(`Group name "${n.name}" invalid in Oniguruma`);
+  if (n.name !== void 0 && !Wu(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 +8126,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 Du(t, e) {
+function Gu(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 +8134,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 Gu(t, e = {}) {
+function Fu(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 Fu(t) {
+function Bu(t) {
   return { type: "Flags", ...t };
 }
 function Q(t) {
@@ -8127,14 +8147,14 @@ function Q(t) {
   if (e && n) throw new Error("Atomic group cannot have flags");
   return { type: "Group", ...e && { atomic: e }, ...n && { flags: n }, body: Ye(t?.body) };
 }
-function fe(t) {
+function pe(t) {
   const e = { behind: !1, negate: !1, ...t };
   return { type: "LookaroundAssertion", kind: e.behind ? "lookbehind" : "lookahead", negate: e.negate, body: Ye(t?.body) };
 }
-function Bu(t, e, n) {
+function ju(t, e, n) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n };
 }
-function ju(t, e) {
+function Uu(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 +8163,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 Uu(t, e) {
+function zu(t, e) {
   return { type: "Regex", body: Ye(e?.body), flags: t };
 }
 function Uo(t) {
@@ -8153,15 +8173,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 = Wu(t);
+    if (n.normalizeUnknownPropertyNames) r = Vu(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 zu({ flags: t, kind: e, name: n, negate: r, number: o }) {
+function Hu({ flags: t, kind: e, name: n, negate: r, number: o }) {
   switch (e) {
     case "absence_repeater":
-      return Ou("repeater");
+      return Du("repeater");
     case "atomic":
       return Q({ atomic: !0 });
     case "capturing":
@@ -8170,7 +8190,7 @@ function zu({ flags: t, kind: e, name: n, negate: r, number: o }) {
       return Q({ flags: t });
     case "lookahead":
     case "lookbehind":
-      return fe({ behind: e === "lookbehind", negate: r });
+      return pe({ behind: e === "lookbehind", negate: r });
     default:
       throw new Error(`Unexpected group kind "${e}"`);
   }
@@ -8191,10 +8211,10 @@ function dr(t) {
 function gr(t) {
   return t.type === "LookaroundAssertion" && t.kind === "lookbehind";
 }
-function Hu(t) {
+function Wu(t) {
   return /^[\p{Alpha}\p{Pc}][^)]*$/u.test(t);
 }
-function Wu(t) {
+function Vu(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) {
@@ -8234,8 +8254,8 @@ function Be(t, e, n = null) {
       c = !0;
     }, skip() {
       c = !0;
-    } }, { 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) {
+    } }, { type: p } = s, d = e["*"], f = e[p], g = typeof d == "function" ? d : d?.enter, C = typeof f == "function" ? f : f?.enter;
+    if (g?.(h, n), C?.(h, n), !c) switch (p) {
       case "AbsenceFunction":
       case "CapturingGroup":
       case "Group":
@@ -8267,9 +8287,9 @@ function Be(t, e, n = null) {
         r(s.body, s), o(s.flags, s, "flags");
         break;
       default:
-        throw new Error(`Unexpected node type "${f}"`);
+        throw new Error(`Unexpected node type "${p}"`);
     }
-    return p?.exit?.(h, n), d?.exit?.(h, n), u;
+    return f?.exit?.(h, n), d?.exit?.(h, n), u;
   }
   return o(t), t;
 }
@@ -8281,12 +8301,12 @@ function Ce(t) {
   if (typeof t != "number") throw new Error("Numeric key expected");
   return t;
 }
-const Vu = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
-function qu(t, e) {
+const qu = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
+function Xu(t, e) {
   for (let n = 0; n < t.length; n++)
     t[n] >= e && t[n]++;
 }
-function Xu(t, e, n, r) {
+function Ku(t, e, n, r) {
   return t.slice(0, e) + r + t.slice(e + n.length);
 }
 const J = Object.freeze({
@@ -8312,7 +8332,7 @@ function En(t, e, n, r) {
 function Ho(t, e, n, r) {
   En(t, e, n, r);
 }
-function Ku(t, e, n = 0, r) {
+function Yu(t, e, n = 0, r) {
   if (!new RegExp(e, "su").test(t))
     return null;
   const o = new RegExp(`${e}|(?<$skip>\\\\?.)`, "gsu");
@@ -8327,9 +8347,9 @@ function Ku(t, e, n = 0, r) {
   return null;
 }
 function nt(t, e, n) {
-  return !!Ku(t, e, 0, n);
+  return !!Yu(t, e, 0, n);
 }
-function Yu(t, e) {
+function Ju(t, e) {
   const n = /\\?./gsu;
   n.lastIndex = e;
   let r = t.length, o = 0, s = 1, a;
@@ -8348,8 +8368,8 @@ function Yu(t, e) {
   }
   return t.slice(e, r);
 }
-const br = new RegExp(String.raw`(?<noncapturingStart>${Vu})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
-function Ju(t, e) {
+const br = new RegExp(String.raw`(?<noncapturingStart>${qu})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
+function Zu(t, e) {
   const n = e?.hiddenCaptures ?? [];
   let r = e?.captureTransfers ?? /* @__PURE__ */ new Map();
   if (!/\(\?>/.test(t))
@@ -8362,28 +8382,28 @@ function Ju(t, e) {
   let l = 0, u = 0, c = NaN, h;
   do {
     h = !1;
-    let f = 0, d = 0, p = !1, g;
+    let p = 0, d = 0, f = !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 (f)
-        C === "]" && f--;
-      else if (C === o && !p)
-        c = y, p = !0;
-      else if (p && _)
+        p++;
+      else if (p)
+        C === "]" && p--;
+      else if (C === o && !f)
+        c = y, f = !0;
+      else if (f && _)
         d++;
       else if (m)
-        p ? d++ : (l++, a.push(l + u));
-      else if (C === ")" && p) {
+        f ? d++ : (l++, a.push(l + u));
+      else if (C === ")" && f) {
         if (!d) {
           u++;
           const S = l + u;
-          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) {
+          if (t = `${t.slice(0, c)}${s}${t.slice(c + o.length, y)}))<$$${S}>)${t.slice(y + 1)}`, h = !0, i.push(S), Xu(n, S), r.size) {
             const A = /* @__PURE__ */ new Map();
-            r.forEach((D, P) => {
+            r.forEach((D, L) => {
               A.set(
-                P >= S ? P + 1 : P,
+                L >= S ? L + 1 : L,
                 D.map((j) => j >= S ? j + 1 : j)
               );
             }), r = A;
@@ -8397,14 +8417,14 @@ function Ju(t, e) {
   return n.push(...i), t = En(
     t,
     String.raw`\\(?<backrefNum>[1-9]\d*)|<\$\$(?<wrappedBackrefNum>\d+)>`,
-    ({ 0: f, groups: { backrefNum: d, wrappedBackrefNum: p } }) => {
+    ({ 0: p, groups: { backrefNum: d, wrappedBackrefNum: f } }) => {
       if (d) {
         const g = +d;
         if (g > a.length - 1)
-          throw new Error(`Backref "${f}" greater than number of captures`);
+          throw new Error(`Backref "${p}" greater than number of captures`);
         return `\\${a[g]}`;
       }
-      return `\\${p}`;
+      return `\\${f}`;
     },
     J.DEFAULT
   ), {
@@ -8429,7 +8449,7 @@ const Wo = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, Dt = new RegExp(String.raw`
 | (?<qBase>${Wo})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
 | \\?.
 `.replace(/\s+/g, ""), "gsu");
-function Zu(t) {
+function Qu(t) {
   if (!new RegExp(`${Wo}\\+`).test(t))
     return {
       pattern: t
@@ -8446,9 +8466,9 @@ function Zu(t) {
       if (c === "+" && o && !o.startsWith("(")) {
         if (h)
           throw new Error(`Invalid quantifier "${i}"`);
-        let f = -1;
+        let p = -1;
         if (/^\{\d+\}$/.test(u))
-          t = Xu(t, l + u.length, c, "");
+          t = Ku(t, l + u.length, c, "");
         else {
           if (o === ")" || o === "]") {
             const d = o === ")" ? n : r;
@@ -8457,9 +8477,9 @@ function Zu(t) {
             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)}`;
-          f += 4;
+          p += 4;
         }
-        Dt.lastIndex += f;
+        Dt.lastIndex += p;
       } else i[0] === "(" ? e.push(l) : i === ")" && (n = e.length ? e.pop() : null);
     o = i;
   }
@@ -8467,8 +8487,8 @@ function Zu(t) {
     pattern: t
   };
 }
-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 Y = String.raw, ec = Y`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, ln = Y`\(\?R=(?<rDepth>[^\)]+)\)|${ec}`, Et = Y`\(\?<(?![=!])(?<captureName>[^>]+)>`, Vo = Y`${Et}|(?<unnamed>\()(?!\?)`, he = new RegExp(Y`${Et}|${ln}|\(\?|\\?.`, "gsu"), Gt = "Cannot use multiple overlapping recursions";
+function tc(t, e) {
   const { hiddenCaptures: n, mode: r } = {
     hiddenCaptures: [],
     mode: "plugin",
@@ -8484,9 +8504,9 @@ function ec(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, f;
-  for (he.lastIndex = 0; f = he.exec(t); ) {
-    const { 0: d, groups: { captureName: p, rDepth: g, gRNameOrNum: C, gRDepth: y } } = f;
+  let u = !1, c = 0, h = 0, p;
+  for (he.lastIndex = 0; p = he.exec(t); ) {
+    const { 0: d, groups: { captureName: f, rDepth: g, gRNameOrNum: C, gRDepth: y } } = p;
     if (d === "[")
       c++;
     else if (c)
@@ -8500,7 +8520,7 @@ function ec(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 m = t.slice(0, f.index), _ = t.slice(he.lastIndex);
+      const m = t.slice(0, p.index), _ = t.slice(he.lastIndex);
       if (nt(_, ln, J.DEFAULT))
         throw new Error(Gt);
       const S = +g - 1;
@@ -8532,14 +8552,14 @@ function ec(t, e) {
         }
       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, _);
+      const _ = i.get(C), S = Ju(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(_, f.index), D = S.slice(A.length + d.length), P = s.length, j = +y - 1, Z = Cr(
+      const A = t.slice(_, p.index), D = S.slice(A.length + d.length), L = s.length, j = +y - 1, Z = Cr(
         A,
         D,
         j,
@@ -8552,16 +8572,16 @@ function ec(t, e) {
         o,
         A,
         j,
-        s.length - P,
-        P,
+        s.length - L,
+        L,
         h
       );
       const ee = t.slice(0, _), ce = t.slice(_ + S.length);
       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({
+    } else if (f)
+      h++, i.set(String(h), he.lastIndex), i.set(f, he.lastIndex), l.push({
         num: h,
-        name: p
+        name: f
       });
     else if (d[0] === "(") {
       const m = d === "(";
@@ -8603,13 +8623,13 @@ function _r(t, e, n, r, o, s, a) {
     u += En(
       t,
       Y`${Vo}|\\k<(?<backref>[^>]+)>`,
-      ({ 0: f, groups: { captureName: d, unnamed: p, backref: g } }) => {
+      ({ 0: p, groups: { captureName: d, unnamed: f, backref: g } }) => {
         if (g && r && !r.has(g))
-          return f;
+          return p;
         const C = `_$${h}`;
-        if (p || d) {
+        if (f || d) {
           const y = a + s.length + 1;
-          return s.push(y), tc(o, y), p ? f : `(?<${d}${C}>`;
+          return s.push(y), nc(o, y), f ? p : `(?<${d}${C}>`;
         }
         return Y`\k<${g}${C}>`;
       },
@@ -8618,7 +8638,7 @@ function _r(t, e, n, r, o, s, a) {
   }
   return u;
 }
-function tc(t, e) {
+function nc(t, e) {
   for (let n = 0; n < t.length; n++)
     t[n] >= e && t[n]++;
 }
@@ -8628,19 +8648,19 @@ function Sr(t, e, n, r, o, s) {
     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, f = a * n, d = c > i + a ? c + r : c, p = [];
+      const h = (r - a * n) / n, p = a * n, d = c > i + a ? c + r : c, f = [];
       for (const g of u)
         if (g <= i)
-          p.push(g);
+          f.push(g);
         else if (g > i + a + h)
-          p.push(g + r);
+          f.push(g + r);
         else if (g <= i + a)
           for (let C = 0; C <= n; C++)
-            p.push(g + a * C);
+            f.push(g + a * C);
         else
           for (let C = 0; C <= n; C++)
-            p.push(g + f + h * C);
-      l.set(d, p);
+            f.push(g + p + h * C);
+      l.set(d, f);
     }), l;
   }
   return t;
@@ -8684,7 +8704,7 @@ function Ve(t, e, n) {
 function un(t, e) {
   return kr[t] >= kr[e];
 }
-function nc(t, e) {
+function rc(t, e) {
   if (t == null)
     throw new Error(e ?? "Value expected");
   return t;
@@ -8693,7 +8713,7 @@ var kr = {
   ES2025: 2025,
   ES2024: 2024,
   ES2018: 2018
-}, rc = (
+}, oc = (
   /** @type {const} */
   {
     auto: "auto",
@@ -8705,7 +8725,7 @@ var kr = {
 function qo(t = {}) {
   if ({}.toString.call(t) !== "[object Object]")
     throw new Error("Unexpected options");
-  if (t.target !== void 0 && !rc[t.target])
+  if (t.target !== void 0 && !oc[t.target])
     throw new Error(`Unexpected target "${t.target}"`);
   const e = {
     // Sets the level of emulation rigor/strictness.
@@ -8749,16 +8769,16 @@ function qo(t = {}) {
   };
   return e.target === "auto" && (e.target = ae.flagGroups ? "ES2025" : ae.unicodeSets ? "ES2024" : "ES2018"), e;
 }
-var oc = "[	-\r ]", sc = /* @__PURE__ */ new Set([
+var sc = "[	-\r ]", ac = /* @__PURE__ */ new Set([
   M(304),
   // İ
   M(305)
   // ı
 ]), re = v`[\p{L}\p{M}\p{N}\p{Pc}]`;
 function Xo(t) {
-  if (sc.has(t))
+  if (ac.has(t))
     return [t];
-  const e = /* @__PURE__ */ new Set(), n = t.toLowerCase(), r = n.toUpperCase(), o = lc.get(n), s = ac.get(n), a = ic.get(n);
+  const e = /* @__PURE__ */ new Set(), n = t.toLowerCase(), r = n.toUpperCase(), o = uc.get(n), s = ic.get(n), a = lc.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 +8873,12 @@ Variation_Selector VS
 White_Space space
 XID_Continue XIDC
 XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
-), ac = /* @__PURE__ */ new Map([
+), ic = /* @__PURE__ */ new Map([
   ["s", M(383)],
   // s, ſ
   [M(383), "s"]
   // ſ, s
-]), ic = /* @__PURE__ */ new Map([
+]), lc = /* @__PURE__ */ new Map([
   [M(223), M(7838)],
   // ß, ẞ
   [M(107), M(8490)],
@@ -8867,7 +8887,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   // å, Å (Angstrom)
   [M(969), M(8486)]
   // ω, Ω (Ohm)
-]), lc = new Map([
+]), uc = new Map([
   ie(453),
   ie(456),
   ie(459),
@@ -8878,7 +8898,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   ie(8124),
   ie(8140),
   ie(8188)
-]), uc = /* @__PURE__ */ new Map([
+]), cc = /* @__PURE__ */ new Map([
   ["alnum", v`[\p{Alpha}\p{Nd}]`],
   ["alpha", v`\p{Alpha}`],
   ["ascii", v`\p{ASCII}`],
@@ -8895,7 +8915,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 cc(t, e) {
+function hc(t, e) {
   const n = [];
   for (let r = t; r <= e; r++)
     n.push(r);
@@ -8906,7 +8926,7 @@ function ie(t) {
   return [e.toLowerCase(), e];
 }
 function Ft(t, e) {
-  return cc(t, e).map((n) => ie(n));
+  return hc(t, e).map((n) => ie(n));
 }
 var Ko = /* @__PURE__ */ new Set([
   "Lower",
@@ -8924,7 +8944,7 @@ var Ko = /* @__PURE__ */ new Set([
   // generally extreme edge cases and using such properties case insensitively generally produces
   // undesired behavior anyway
 ]);
-function hc(t, e) {
+function fc(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
@@ -8970,14 +8990,14 @@ function hc(t, e) {
     reffedNodesByReferencer: /* @__PURE__ */ new Map(),
     subroutineRefMap: r.subroutineRefMap
   };
-  Be(t, fc, s);
+  Be(t, dc, s);
   const a = {
     groupsByName: s.groupsByName,
     highestOrphanBackref: 0,
     numCapturesToLeft: 0,
     reffedNodesByReferencer: s.reffedNodesByReferencer
   };
-  return Be(t, dc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
+  return Be(t, gc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
 }
 var pc = {
   AbsenceFunction({ node: t, parent: e, replaceWith: n }) {
@@ -8986,13 +9006,13 @@ var pc = {
       const s = Q();
       s.body[0].body.push(
         // Insert own alts as `body`
-        fe({ negate: !0, body: r }),
+        pe({ negate: !0, body: r }),
         ke("Any")
       );
       const a = Q();
       a.body[0].body.push(
         jo("greedy", 0, 1 / 0, s)
-      ), n(L(a, e), { traverse: !0 });
+      ), n(P(a, e), { traverse: !0 });
     } else
       throw new Error('Unsupported absence function "(?~|"');
   },
@@ -9009,30 +9029,30 @@ var pc = {
         const n = Zo(e.get(t));
         if (n) {
           const r = Q({ flags: n });
-          r.body[0].body = t.body, t.body = [L(r, t)];
+          r.body[0].body = t.body, t.body = [P(r, t)];
         }
       }
     }
   },
   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: f, wordIsAscii: d } = i;
+    const { kind: l, negate: u } = t, { asciiWordBoundaries: c, avoidSubclass: h, supportedGNodes: p, wordIsAscii: d } = i;
     if (l === "text_segment_boundary")
       throw new Error(`Unsupported text segment boundary "\\${u ? "Y" : "y"}"`);
     if (l === "line_end")
-      a(L(fe({ body: [
+      a(P(pe({ body: [
         me({ body: [on("string_end")] }),
         me({ body: [vt(10)] })
         // `\n`
       ] }), e));
     else if (l === "line_start")
-      a(L(oe(v`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), e));
+      a(P(oe(v`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), e));
     else if (l === "search_start")
-      if (f.has(t))
+      if (p.has(t))
         o.flags.sticky = !0, s();
       else {
-        const p = r[n - 1];
-        if (p && Cc(p))
-          a(L(fe({ negate: !0 }), e));
+        const f = r[n - 1];
+        if (f && _c(f))
+          a(P(pe({ negate: !0 }), e));
         else {
           if (h)
             throw new Error(v`Uses "\G" in a way that requires a subclass`);
@@ -9040,11 +9060,11 @@ var pc = {
         }
       }
     else if (!(l === "string_end" || l === "string_start")) if (l === "string_end_newline")
-      a(L(oe(v`(?=\n?\z)`), e));
+      a(P(oe(v`(?=\n?\z)`), e));
     else if (l === "word_boundary") {
       if (!d && !c) {
-        const p = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
-        a(L(oe(u ? g : p), e));
+        const f = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
+        a(P(oe(u ? g : f), e));
       }
     } else
       throw new Error(`Unexpected assertion kind "${l}"`);
@@ -9060,7 +9080,7 @@ var pc = {
   CharacterClassRange({ node: t, parent: e, replaceWith: n }) {
     if (e.kind === "intersection") {
       const r = st({ body: [t] });
-      n(L(r, e), { traverse: !0 });
+      n(P(r, e), { traverse: !0 });
     }
   },
   CharacterSet({ node: t, parent: e, replaceWith: n }, { accuracy: r, minTargetEs2024: o, digitIsAscii: s, spaceIsAscii: a, wordIsAscii: i }) {
@@ -9070,7 +9090,7 @@ var pc = {
       return;
     }
     if (a && (l === "space" || c === "space")) {
-      n(L(Ut(oe(oc), u), e));
+      n(P(Ut(oe(sc), u), e));
       return;
     }
     if (i && (l === "word" || c === "word")) {
@@ -9084,17 +9104,17 @@ var pc = {
     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})?", f = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
-      n(L(oe(
+      const h = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", p = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
+      n(P(oe(
         // Close approximation of an extended grapheme cluster; see: <unicode.org/reports/tr29/>
-        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : f}|\P{M}\p{M}*)`,
+        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : p}|\P{M}\p{M}*)`,
         // Allow JS property `RGI_Emoji` through
         { skipPropertyNameValidation: !0 }
       ), e));
     } else if (l === "hex")
       n(le(ke("AHex", { negate: u }), e));
     else if (l === "newline")
-      n(L(oe(u ? `[^
+      n(P(oe(u ? `[^
 ]` : `(?>\r
 ?|[
 \v\f…\u2028\u2029])`), e));
@@ -9106,15 +9126,15 @@ var pc = {
           graph: "!-~",
           print: " -~"
         }[c];
-        u && (h = `\0-${M(h.codePointAt(0) - 1)}${M(h.codePointAt(2) + 1)}-􏿿`), n(L(oe(`[${h}]`), e));
+        u && (h = `\0-${M(h.codePointAt(0) - 1)}${M(h.codePointAt(2) + 1)}-􏿿`), n(P(oe(`[${h}]`), e));
       } else
-        n(L(Ut(oe(uc.get(c)), u), e));
+        n(P(Ut(oe(cc.get(c)), u), e));
     else if (l === "property")
       An.has(xt(c)) || (t.key = "sc");
     else if (l === "space")
       n(le(ke("space", { negate: u }), e));
     else if (l === "word")
-      n(L(Ut(oe(re), u), e));
+      n(P(Ut(oe(re), u), e));
     else
       throw new Error(`Unexpected character set kind "${l}"`);
   },
@@ -9125,15 +9145,15 @@ var pc = {
         r();
       else {
         const u = Q({ flags: l });
-        u.body[0].body = a(), o(L(u, e), { traverse: !0 });
+        u.body[0].body = a(), o(P(u, e), { traverse: !0 });
       }
     else if (i === "keep") {
       const u = n.body[0], h = n.body.length === 1 && // Not emulatable if within a `CapturingGroup`
       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 f = fe({ behind: !0 });
-      f.body[0].body = s(), o(L(f, e));
+      const p = pe({ behind: !0 });
+      p.body[0].body = s(), o(P(p, e));
     } else
       throw new Error(`Unexpected directive kind "${i}"`);
   },
@@ -9198,14 +9218,14 @@ var pc = {
   NamedCallout({ node: t, parent: e, replaceWith: n }) {
     const { kind: r } = t;
     if (r === "fail")
-      n(L(fe({ negate: !0 }), e));
+      n(P(pe({ negate: !0 }), e));
     else
       throw new Error(`Unsupported named callout "(*${r.toUpperCase()}"`);
   },
   Quantifier({ node: t }) {
     if (t.body.type === "Quantifier") {
       const e = Q();
-      e.body[0].body.push(t.body), t.body = L(e, t);
+      e.body[0].body.push(t.body), t.body = P(e, t);
     }
   },
   Regex: {
@@ -9230,7 +9250,7 @@ var pc = {
     let { ref: n } = t;
     typeof n == "string" && !jt(n) && (n = Bt(n, e), t.ref = n);
   }
-}, fc = {
+}, dc = {
   Backreference({ node: t }, { multiplexCapturesToLeftByRef: e, reffedNodesByReferencer: n }) {
     const { orphan: r, ref: o } = t;
     r || n.set(t, [...e.get(o).map(({ node: s }) => s)]);
@@ -9257,13 +9277,13 @@ var pc = {
       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 f = c[h];
+        const p = 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 === f.node || u && u === f.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
+          u === p.node || u && u === p.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
           // group that refers to this group
-          t === f.origin
+          t === p.origin
         ) {
           c.splice(h, 1);
           break;
@@ -9271,16 +9291,16 @@ var pc = {
       }
       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 = Ve(s, t.name, /* @__PURE__ */ new Map());
-        let f = !1;
+        let p = !1;
         if (u)
-          f = !0;
+          p = !0;
         else
           for (const d of h.values())
             if (!d.hasDuplicateNameToRemove) {
-              f = !0;
+              p = !0;
               break;
             }
-        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: f });
+        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: p });
       }
     },
     exit({ node: t }, { openRefs: e }) {
@@ -9310,25 +9330,25 @@ var pc = {
     );
     let u = l;
     if (!i) {
-      const c = Zo(yc(
+      const c = Zo(bc(
         a,
-        (f) => f.type === "Group" && !!f.flags
+        (p) => p.type === "Group" && !!p.flags
       )), h = c ? bt(r.globalFlags, c) : r.globalFlags;
-      gc(h, r.currentFlags) || (u = Q({
-        flags: bc(h)
+      mc(h, r.currentFlags) || (u = Q({
+        flags: wc(h)
       }), u.body[0].body.push(l));
     }
-    n(L(u, e), { traverse: !i });
+    n(P(u, e), { traverse: !i });
   }
-}, dc = {
+}, gc = {
   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) => mc(a, t));
+    const s = r.reffedNodesByReferencer.get(t).filter((a) => yc(a, t));
     if (!s.length)
-      n(L(fe({ negate: !0 }), e));
+      n(P(pe({ negate: !0 }), e));
     else if (s.length > 1) {
       const a = Q({
         atomic: !0,
@@ -9336,7 +9356,7 @@ var pc = {
           body: [sn(i.number)]
         }))
       });
-      n(L(a, e));
+      n(P(a, e));
     } else
       t.ref = s[0].number;
   },
@@ -9363,10 +9383,10 @@ function Yo(t) {
     }
   });
 }
-function gc(t, e) {
+function mc(t, e) {
   return t.dotAll === e.dotAll && t.ignoreCase === e.ignoreCase;
 }
-function mc(t, e) {
+function yc(t, e) {
   let n = e;
   do {
     if (n.type === "Regex")
@@ -9395,7 +9415,7 @@ function vr(t) {
   const e = Uo(t);
   return e.isRecursive = !0, e;
 }
-function yc(t, e) {
+function bc(t, e) {
   const n = [];
   for (; t = t.parent; )
     (!e || e(t)) && n.push(t);
@@ -9415,7 +9435,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 bc({ dotAll: t, ignoreCase: e }) {
+function wc({ 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 +9446,7 @@ function Qo(t) {
   return Array.isArray(e) ? e : e ? [e] : null;
 }
 function es(t) {
-  const e = t.find((n) => n.kind === "search_start" || _c(n, { negate: !1 }) || !wc(n));
+  const e = t.find((n) => n.kind === "search_start" || Sc(n, { negate: !1 }) || !Cc(n));
   if (!e)
     return null;
   if (e.kind === "search_start")
@@ -9452,10 +9472,10 @@ function ts(t, e) {
       return !0;
   return !1;
 }
-function wc({ type: t }) {
+function Cc({ type: t }) {
   return t === "Assertion" || t === "Directive" || t === "LookaroundAssertion";
 }
-function Cc(t) {
+function _c(t) {
   const e = [
     "Character",
     "CharacterClass",
@@ -9463,7 +9483,7 @@ function Cc(t) {
   ];
   return e.includes(t.type) || t.type === "Quantifier" && t.min && e.includes(t.body.type);
 }
-function _c(t, e) {
+function Sc(t, e) {
   const n = {
     negate: null,
     ...e
@@ -9491,23 +9511,23 @@ function Ut(t, e) {
 function le(t, e) {
   return t.parent = e, t;
 }
-function L(t, e) {
+function P(t, e) {
   return Yo(t), t.parent = e, t;
 }
-function Sc(t, e) {
+function kc(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 d = [t.flags.ignoreCase];
-    Be(t, kc, {
+    Be(t, vc, {
       getCurrentModI: () => d.at(-1),
       popModI() {
         d.pop();
       },
-      pushModI(p) {
-        d.push(p);
+      pushModI(f) {
+        d.push(f);
       },
       setHasCasedChar() {
         d.at(-1) ? a = !0 : i = !0;
@@ -9541,19 +9561,19 @@ function Sc(t, e) {
     verbose: n.verbose
   };
   function h(d) {
-    return c.lastNode = u, u = d, nc(vc[d.type], `Unexpected node type "${d.type}"`)(d, c, h);
+    return c.lastNode = u, u = d, rc(xc[d.type], `Unexpected node type "${d.type}"`)(d, c, h);
   }
-  const f = {
+  const p = {
     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 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;
+  return r || (delete p.options.force.v, p.options.disable.v = !0, p.options.unicodeSetsPlugin = null), p._captureTransfers = /* @__PURE__ */ new Map(), p._hiddenCaptures = [], c.captureMap.forEach((d, f) => {
+    d.hidden && p._hiddenCaptures.push(f), d.transferTo && Ve(p._captureTransfers, d.transferTo, []).push(f);
+  }), p;
 }
-var kc = {
+var vc = {
   "*": {
     enter({ node: t }, e) {
       if (Er(t)) {
@@ -9579,7 +9599,7 @@ var kc = {
   CharacterSet({ node: t }, e) {
     t.kind === "property" && Ko.has(t.value) && e.setHasCasedChar();
   }
-}, vc = {
+}, xc = {
   /**
   @param {AlternativeNode} node
   */
@@ -9651,10 +9671,10 @@ var kc = {
           (h) => h.type === "CharacterClass" && h.kind === "union" && h.negate
         );
         if (c.length) {
-          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);
+          const h = Q(), p = h.body[0];
+          return h.parent = s, p.parent = h, a = a.filter((d) => !c.includes(d)), t.body = a, a.length ? (t.parent = p, p.body.push(t)) : h.body.pop(), c.forEach((d) => {
+            const f = me({ body: [d] });
+            d.parent = f, f.parent = h, h.body.push(f);
           }), n(h);
         }
       }
@@ -9685,7 +9705,7 @@ var kc = {
     }, s = _e(n, o), a = _e(r, o), i = /* @__PURE__ */ new Set();
     if (e.useAppliedIgnoreCase && e.currentFlags.ignoreCase) {
       const l = ns(t);
-      Ic(l).forEach((c) => {
+      Nc(l).forEach((c) => {
         i.add(
           Array.isArray(c) ? `${_e(c[0], o)}-${_e(c[1], o)}` : _e(c, o)
         );
@@ -9733,7 +9753,7 @@ var kc = {
     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 : `(?${Nc(t, n, o.useFlagMods)}${i})`;
+    r.type !== "Quantifier" && !t && (!o.useFlagMods || !n) ? i : `(?${Lc(t, n, o.useFlagMods)}${i})`;
     return o.currentFlags = a, l;
   },
   /**
@@ -9757,7 +9777,7 @@ var kc = {
     const r = n.recursionLimit;
     return e === 0 ? `(?R=${r})` : v`\g<${e}&R=${r}>`;
   }
-}, xc = /* @__PURE__ */ new Set([
+}, Ec = /* @__PURE__ */ new Set([
   "$",
   "(",
   ")",
@@ -9772,7 +9792,7 @@ var kc = {
   "{",
   "|",
   "}"
-]), Ec = /* @__PURE__ */ new Set([
+]), Ac = /* @__PURE__ */ new Set([
   "-",
   "\\",
   "]",
@@ -9780,7 +9800,7 @@ var kc = {
   // 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
   "["
-]), Ac = /* @__PURE__ */ new Set([
+]), Rc = /* @__PURE__ */ new Set([
   "(",
   ")",
   "-",
@@ -9828,9 +9848,9 @@ var kc = {
   // paragraph separator
   [65279, v`\uFEFF`]
   // ZWNBSP/BOM
-]), Rc = /^\p{Cased}$/u;
+]), Ic = /^\p{Cased}$/u;
 function Rn(t) {
-  return Rc.test(t);
+  return Ic.test(t);
 }
 function ns(t, e) {
   const n = !!e?.firstOnly, r = t.min.value, o = t.max.value, s = [];
@@ -9856,20 +9876,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 && Lc(t)
+    e && $c(t)
   )
     return t > 255 ? `\\u{${t.toString(16).toUpperCase()}}` : `\\x${t.toString(16).toUpperCase().padStart(2, "0")}`;
-  const o = n ? r ? Ac : Ec : xc, s = M(t);
+  const o = n ? r ? Rc : Ac : Ec, s = M(t);
   return (o.has(s) ? "\\" : "") + s;
 }
-function Ic(t) {
+function Nc(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 Nc(t, e, n) {
+function Lc(t, e, n) {
   if (t)
     return ">";
   let r = "";
@@ -9890,13 +9910,13 @@ function Pc({ kind: t, max: e, min: n }) {
 function Er({ type: t }) {
   return t === "CapturingGroup" || t === "Group" || t === "LookaroundAssertion";
 }
-function Lc(t) {
+function $c(t) {
   return t > 47 && t < 58;
 }
 function Ar({ type: t, value: e }) {
   return t === "Character" && e === 45;
 }
-var $c = class cn extends RegExp {
+var Tc = class cn extends RegExp {
   /**
   @type {Map<number, {
     hidden?: true;
@@ -9954,7 +9974,7 @@ var $c = class cn extends RegExp {
         transfers: [],
         ...r
       };
-      super(o ? "" : e, n), this.#r = e, this.#t = Mc(s.hiddenCaptures, s.transfers), this.#o = s.strategy, this.rawOptions = r ?? {};
+      super(o ? "" : e, n), this.#r = e, this.#t = Oc(s.hiddenCaptures, s.transfers), this.#o = s.strategy, this.rawOptions = r ?? {};
     }
     o || (this.#e = this);
   }
@@ -9973,7 +9993,7 @@ var $c = class cn extends RegExp {
     if (this.#o === "clip_search" && n && r) {
       this.lastIndex = 0;
       const o = this.#s(e.slice(r));
-      return o && (Tc(o, r, e, this.hasIndices), this.lastIndex += r), o;
+      return o && (Mc(o, r, e, this.hasIndices), this.lastIndex += r), o;
     }
     return this.#s(e);
   }
@@ -9999,7 +10019,7 @@ var $c = 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 = Oc(this.source));
+          this.#n || (this.#n = Dc(this.source));
           const c = this.#n.get(l);
           c && (n.groups[c] = r[a], this.hasIndices && (n.indices.groups[c] = o[a]));
         }
@@ -10008,7 +10028,7 @@ var $c = class cn extends RegExp {
     return n;
   }
 };
-function Tc(t, e, n, r) {
+function Mc(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 +10042,7 @@ function Tc(t, e, n, r) {
     });
   }
 }
-function Mc(t, e) {
+function Oc(t, e) {
   const n = /* @__PURE__ */ new Map();
   for (const r of t)
     n.set(r, {
@@ -10033,7 +10053,7 @@ function Mc(t, e) {
       Ve(n, s, {}).transferTo = r;
   return n;
 }
-function Oc(t) {
+function Dc(t) {
   const e = /(?<capture>\((?:\?<(?![=!])(?<name>[^>]+)>|(?!\?)))|\\?./gsu, n = /* @__PURE__ */ new Map();
   let r = 0, o = 0, s;
   for (; s = e.exec(t); ) {
@@ -10042,11 +10062,11 @@ function Oc(t) {
   }
   return n;
 }
-function Dc(t, e) {
-  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 = Fc(t, e);
+  return n.options ? new Tc(n.pattern, n.flags, n.options) : new RegExp(n.pattern, n.flags);
+}
+function Fc(t, e) {
   const n = qo(e), r = Fo(t, {
     flags: n.flags,
     normalizeUnknownPropertyNames: !0,
@@ -10056,16 +10076,16 @@ function Gc(t, e) {
     },
     skipBackrefValidation: n.rules.allowOrphanBackrefs,
     unicodePropertyMap: An
-  }), o = hc(r, {
+  }), o = fc(r, {
     accuracy: n.accuracy,
     asciiWordBoundaries: n.rules.asciiWordBoundaries,
     avoidSubclass: n.avoidSubclass,
     bestEffortTarget: n.target
-  }), s = Sc(o, n), a = ec(s.pattern, {
+  }), s = kc(o, n), a = tc(s.pattern, {
     captureTransfers: s._captureTransfers,
     hiddenCaptures: s._hiddenCaptures,
     mode: "external"
-  }), i = Zu(a.pattern), l = Ju(i.pattern, {
+  }), i = Qu(a.pattern), l = Zu(i.pattern, {
     captureTransfers: a.captureTransfers,
     hiddenCaptures: a.hiddenCaptures
   }), u = {
@@ -10076,18 +10096,18 @@ function Gc(t, e) {
     if (n.lazyCompileLength !== 1 / 0)
       throw new Error("Lazy compilation requires subclass");
   } else {
-    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 = {
+    const c = l.hiddenCaptures.sort((f, g) => f - g), h = Array.from(l.captureTransfers), p = o._strategy, d = u.pattern.length >= n.lazyCompileLength;
+    (c.length || h.length || p || d) && (u.options = {
       ...c.length && { hiddenCaptures: c },
       ...h.length && { transfers: h },
-      ...f && { strategy: f },
+      ...p && { strategy: p },
       ...d && { lazyCompile: d }
     });
   }
   return u;
 }
 const Rr = 4294967295;
-class Fc {
+class Bc {
   constructor(e, n = {}) {
     this.patterns = e, this.options = n;
     const {
@@ -10161,8 +10181,8 @@ class Fc {
     return null;
   }
 }
-function Bc(t, e) {
-  return Dc(
+function jc(t, e) {
+  return Gc(
     t,
     {
       global: !0,
@@ -10188,7 +10208,7 @@ function Bc(t, e) {
     }
   );
 }
-function jc(t = {}) {
+function Uc(t = {}) {
   const e = Object.assign(
     {
       target: "auto",
@@ -10196,9 +10216,9 @@ function jc(t = {}) {
     },
     t
   );
-  return e.regexConstructor ||= (n) => Bc(n, { target: e.target }), {
+  return e.regexConstructor ||= (n) => jc(n, { target: e.target }), {
     createScanner(n) {
-      return new Fc(n, e);
+      return new Bc(n, e);
     },
     createString(n) {
       return {
@@ -10207,8 +10227,8 @@ function jc(t = {}) {
     }
   };
 }
-const Uc = jc({ forgiving: !0 }), zc = await Wl({
-  engine: Uc,
+const zc = Uc({ forgiving: !0 }), Hc = await Vl({
+  engine: zc,
   langAlias: {
     markup: "html",
     svg: "xml",
@@ -10224,9 +10244,11 @@ const Uc = jc({ forgiving: !0 }), zc = await Wl({
     dark: "github-dark"
   },
   defaultColor: !1,
+  defaultLanguage: "text",
+  fallbackLanguage: "text",
   inline: "tailing-curly-colon",
   addLanguageClass: !0,
-  transformers: [Zl(), eu()],
+  transformers: [Ql(), tu()],
   parseMetaString: (t) => {
     const e = t.matchAll(
       /([a-z0-9]+)(?:=(["'])(.*?)\2|=(.*?)(?:\s|$)|(?:\s|$))/gi
@@ -10238,7 +10260,7 @@ const Uc = jc({ forgiving: !0 }), zc = await Wl({
       })
     );
   }
-}, Hc = () => (t) => {
+}, Wc = () => (t) => {
   qr(t, "element", (e, n, r) => {
     if (e.tagName !== "code") return;
     const o = r?.type === "element" && r.tagName === "pre";
@@ -10248,28 +10270,25 @@ const Uc = jc({ forgiving: !0 }), zc = await Wl({
       class: as(e.properties.class, r.properties.class)
     }, r.properties = {});
   });
-}, ch = (t) => [
+}, hh = (t = wt.themes, e = Hc) => [
   [
-    Yl,
-    zc,
-    {
-      ...wt,
-      themes: t ?? wt.themes
-    }
+    Jl,
+    e,
+    { ...wt, themes: t }
   ],
-  Hc
-], Wc = (t, e, n = "text", r = wt.themes) => {
+  Wc
+], Vc = (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 });
-}, Vc = os(
+}, qc = os(
   ({ code: t, children: e, embedded: n, ...r }) => {
     const { syntaxHighlighting: o } = ss().options;
     ls(o?.highlighter, "Highlighter not found");
-    const s = Wc(
+    const s = Vc(
       o.highlighter,
       t ?? e,
       r.language,
@@ -10278,29 +10297,29 @@ const Uc = jc({ forgiving: !0 }), zc = await Wl({
     return n ? /* @__PURE__ */ at.jsx(cs, { ...r, children: s }) : /* @__PURE__ */ at.jsx(us, { ...r, children: s });
   }
 );
-Vc.displayName = "SyntaxHighlight";
+qc.displayName = "SyntaxHighlight";
 export {
   Fn as E,
-  Vc as S,
+  qc as S,
   H as V,
-  Ps as a,
-  ih as b,
-  ah as c,
-  nh as d,
+  Ls as a,
+  lh as b,
+  ih as c,
+  rh as d,
   Ir as e,
   Gr as f,
   ua as g,
-  Wc as h,
+  Vc as h,
   Wr as i,
   aa as j,
   jn as k,
-  ch as l,
-  eh as o,
+  hh as l,
+  th as o,
   Fr as p,
-  Ls as s,
+  Ps as s,
   Ds as t,
-  th as u,
+  nh as u,
   qr as v,
   la as z
 };
-//# sourceMappingURL=SyntaxHighlight-BMKR4pl6.js.map
+//# sourceMappingURL=SyntaxHighlight-BvPom2Ah.js.map