zudoku 0.64.1 → 0.65.0

package/lib/{SyntaxHighlight-zvlnSnHB.js → SyntaxHighlight-C19vH0V_.js}

@@ -5,11 +5,11 @@ import { c as Ir } from "./cn-dYga0KKN.js";
 import { g as ls, i as us } from "./invariant-Bm-FVUQE.js";
 import { CodeBlock as cs } from "./ui/CodeBlock.js";
 import { EmbeddedCodeBlock as hs } from "./ui/EmbeddedCodeBlock.js";
-function rh() {
-}
 function oh() {
 }
-function sh(t) {
+function sh() {
+}
+function ah(t) {
   const e = [], n = String(t || "");
   let r = n.indexOf(","), o = 0, s = !1;
   for (; !s; ) {
@@ -1199,7 +1199,7 @@ function vs(t) {
   return t.charAt(1).toUpperCase();
 }
 const xs = Lr([$r, ys, Or, Dr, Gr], "html"), fn = Lr([$r, bs, Or, Dr, Gr], "svg");
-function uh(t) {
+function ch(t) {
   const e = String(t || "").trim();
   return e ? e.split(/[ \t\n\r\f]+/g) : [];
 }
@@ -1211,7 +1211,7 @@ function Es() {
   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 = "", p = "comment", d = "declaration";
+`, u = "/", c = "*", h = "", f = "comment", d = "declaration";
   Rt = function(g, C) {
     if (typeof g != "string")
       throw new TypeError("First argument must be a string");
@@ -1265,7 +1265,7 @@ function Es() {
           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: p,
+          type: f,
           comment: G
         });
       }
@@ -1276,8 +1276,8 @@ function Es() {
         if (ee(), !L(o)) return D("property missing ':'");
         var G = L(s), Te = R({
           type: d,
-          property: f(k[0].replace(t, h)),
-          value: G ? f(G[0].replace(t, h)) : h
+          property: p(k[0].replace(t, h)),
+          value: G ? p(G[0].replace(t, h)) : h
         });
         return L(a), Te;
       }
@@ -1291,7 +1291,7 @@ function Es() {
     }
     return j(), te();
   };
-  function f(g) {
+  function p(g) {
     return g ? g.replace(i, h) : h;
   }
   return Rt;
@@ -1363,7 +1363,7 @@ function jr(t) {
       };
   }
 }
-function ch(t) {
+function hh(t) {
   const e = Br(t), n = Ps(t);
   if (e && n)
     return { start: e, end: n };
@@ -1855,13 +1855,13 @@ function ia(t, e, n, r) {
           typeof h.name == "string" ? h.name : void 0
         )
       );
-      Object.defineProperty(p, "name", {
+      Object.defineProperty(f, "name", {
         value: "node (" + (l.type + (d ? "<" + d + ">" : "")) + ")"
       });
     }
-    return p;
-    function p() {
-      let d = qr, f, g, C;
+    return f;
+    function f() {
+      let d = qr, p, g, C;
       if ((!e || s(l, u, c[c.length - 1] || void 0)) && (d = la(n(l, c)), d[0] === Fn))
         return d;
       if ("children" in l && l.children) {
@@ -1872,9 +1872,9 @@ function ia(t, e, n, r) {
         if (y.children && d[0] !== aa)
           for (g = (r ? y.children.length : -1) + a, C = c.concat(y); g > -1 && g < y.children.length; ) {
             const m = y.children[g];
-            if (f = i(m, g, C)(), f[0] === Fn)
-              return f;
-            g = typeof f[1] == "number" ? f[1] : g + a;
+            if (p = i(m, g, C)(), p[0] === Fn)
+              return p;
+            g = typeof p[1] == "number" ? p[1] : g + a;
           }
       }
       return d;
@@ -2151,8 +2151,8 @@ function ma(t) {
     if (typeof a.settings.fontStyle == "string") {
       l = 0;
       let h = a.settings.fontStyle.split(" ");
-      for (let p = 0, d = h.length; p < d; p++)
-        switch (h[p]) {
+      for (let f = 0, d = h.length; f < d; f++)
+        switch (h[f]) {
           case "italic":
             l = l | 1;
             break;
@@ -2171,9 +2171,9 @@ function ma(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, 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 ya(
+    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 ya(
         g,
         C,
         o,
@@ -2342,8 +2342,8 @@ var wa = 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), 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;
+    let l = K.getLanguageId(e), u = K.getTokenType(e), c = K.containsBalancedBrackets(e) ? 1 : 0, h = K.getFontStyle(e), f = K.getForeground(e), d = K.getBackground(e);
+    return n !== 0 && (l = n), r !== 8 && (u = r), o !== null && (c = o ? 1 : 0), s !== -1 && (h = s), a !== 0 && (f = a), i !== 0 && (d = i), (l << 0 | u << 8 | c << 10 | h << 11 | f << 15 | d << 24) >>> 0;
   }
 };
 function lt(t, e) {
@@ -2848,11 +2848,11 @@ var Xe = class {
               break;
             case 3:
             case 4:
-              const h = u.scopeName, p = u.kind === 4 ? u.ruleName : null, d = n.getExternalGrammar(h, r);
+              const h = u.scopeName, f = u.kind === 4 ? u.ruleName : null, d = n.getExternalGrammar(h, r);
               if (d)
-                if (p) {
-                  let f = d.repository[p];
-                  f && (l = U.getCompiledRuleId(f, n, d.repository));
+                if (f) {
+                  let p = d.repository[f];
+                  p && (l = U.getCompiledRuleId(p, n, d.repository));
                 } else
                   l = U.getCompiledRuleId(d.repository.$self, n, d.repository);
               break;
@@ -3085,10 +3085,10 @@ function lo(t, e, n, r, o, s, a, i) {
   for (; !u; ) {
     if (i !== 0 && Date.now() - h > i)
       return new qn(o, !0);
-    p();
+    f();
   }
   return new qn(o, !1);
-  function p() {
+  function f() {
     const d = Fa(
       t,
       e,
@@ -3101,18 +3101,18 @@ function lo(t, e, n, r, o, s, a, i) {
       s.produce(o, l), u = !0;
       return;
     }
-    const f = d.captureIndices, g = d.matchedRuleId, C = f && f.length > 0 ? f[0].end > r : !1;
+    const p = d.captureIndices, g = d.matchedRuleId, C = p && p.length > 0 ? p[0].end > r : !1;
     if (g === $a) {
       const y = o.getRule(t);
-      s.produce(o, f[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
+      s.produce(o, p[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
         t,
         e,
         n,
         o,
         s,
         y.endCaptures,
-        f
-      ), s.produce(o, f[0].end);
+        p
+      ), s.produce(o, p[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 lo(t, e, n, r, o, s, a, i) {
       }
     } else {
       const y = t.getRule(g);
-      s.produce(o, f[0].start);
-      const m = o, _ = y.getName(e.content, f), S = o.contentNameScopesList.pushAttributed(
+      s.produce(o, p[0].start);
+      const m = o, _ = y.getName(e.content, p), S = o.contentNameScopesList.pushAttributed(
         _,
         t
       );
@@ -3129,7 +3129,7 @@ function lo(t, e, n, r, o, s, a, i) {
         g,
         r,
         c,
-        f[0].end === l,
+        p[0].end === l,
         null,
         S,
         S
@@ -3142,11 +3142,11 @@ function lo(t, e, n, r, o, s, a, i) {
           o,
           s,
           A.beginCaptures,
-          f
-        ), s.produce(o, f[0].end), c = f[0].end;
+          p
+        ), s.produce(o, p[0].end), c = p[0].end;
         const D = A.getContentName(
           e.content,
-          f
+          p
         ), L = S.pushAttributed(
           D,
           t
@@ -3154,7 +3154,7 @@ function lo(t, e, n, r, o, s, a, i) {
         if (o = o.withContentNameScopesList(L), A.endHasBackReferences && (o = o.withEndRule(
           A.getEndWithResolvedBackReferences(
             e.content,
-            f
+            p
           )
         )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
@@ -3169,11 +3169,11 @@ function lo(t, e, n, r, o, s, a, i) {
           o,
           s,
           A.beginCaptures,
-          f
-        ), s.produce(o, f[0].end), c = f[0].end;
+          p
+        ), s.produce(o, p[0].end), c = p[0].end;
         const D = A.getContentName(
           e.content,
-          f
+          p
         ), L = S.pushAttributed(
           D,
           t
@@ -3181,7 +3181,7 @@ function lo(t, e, n, r, o, s, a, i) {
         if (o = o.withContentNameScopesList(L), A.whileHasBackReferences && (o = o.withEndRule(
           A.getWhileWithResolvedBackReferences(
             e.content,
-            f
+            p
           )
         )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
@@ -3194,13 +3194,13 @@ function lo(t, e, n, r, o, s, a, i) {
         o,
         s,
         y.captures,
-        f
-      ), s.produce(o, f[0].end), o = o.pop(), !C) {
+        p
+      ), s.produce(o, p[0].end), o = o.pop(), !C) {
         o = o.safePop(), s.produce(o, l), u = !0;
         return;
       }
     }
-    f[0].end > r && (r = f[0].end, n = !1);
+    p[0].end > r && (r = p[0].end, n = !1);
   }
 }
 function Ga(t, e, n, r, o, s) {
@@ -3250,15 +3250,15 @@ function Ba(t, e, n, r, o, s) {
 function ja(t, e, n, r, o, s, a) {
   let i = Number.MAX_VALUE, l = null, u, c = 0;
   const h = s.contentNameScopesList.getScopeNames();
-  for (let p = 0, d = t.length; p < d; p++) {
-    const f = t[p];
-    if (!f.matcher(h))
+  for (let f = 0, d = t.length; f < d; f++) {
+    const p = t[f];
+    if (!p.matcher(h))
       continue;
-    const g = e.getRule(f.ruleId), { ruleScanner: C, findOptions: y } = uo(g, e, null, r, o === a), m = C.findNextMatchSync(n, o, y);
+    const g = e.getRule(p.ruleId), { ruleScanner: C, findOptions: y } = uo(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 = f.priority, i === o))
+    if (!(_ >= i) && (i = _, l = m.captureIndices, u = m.ruleId, c = p.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 p = s[h];
-    if (p === null)
+    const f = s[h];
+    if (f === 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), 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));
+    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));
       lo(
         t,
         S,
@@ -3311,9 +3311,9 @@ function Ge(t, e, n, r, o, s, a) {
       ), ro(S);
       continue;
     }
-    const f = p.getName(i, a);
-    if (f !== null) {
-      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(f, t);
+    const p = f.getName(i, a);
+    if (p !== null) {
+      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(p, t);
       u.push(new za(C, d.end));
     }
   }
@@ -3497,13 +3497,13 @@ var Va = class {
         c.fontStyle,
         c.foregroundId,
         c.backgroundId
-      ), p = this.getRule(this._rootId).getName(
+      ), f = this.getRule(this._rootId).getName(
         null,
         null
       );
       let d;
-      p ? d = Fe.createRootAndLookUpScopeName(
-        p,
+      f ? d = Fe.createRootAndLookUpScopeName(
+        f,
         h,
         this
       ) : d = Fe.createRoot(
@@ -6075,23 +6075,23 @@ function dl(t, e, n, r, o = "css-vars") {
     explanation: t.explanation,
     offset: t.offset
   }, 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);
+    const f = h === "color" ? "" : h === "background-color" ? "-bg" : `-${h}`;
+    return n + e[c] + (h === "color" ? "" : f);
   };
   return a.forEach((c, h) => {
-    for (const p of i) {
-      const d = c[p] || "inherit";
-      if (h === 0 && r && hl.includes(p))
+    for (const f of i) {
+      const d = c[f] || "inherit";
+      if (h === 0 && r && hl.includes(f))
         if (r === _n && a.length > 1) {
-          const f = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
-          if (f === -1 || g === -1)
+          const p = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
+          if (p === -1 || g === -1)
             throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-          const C = a[f][p] || "inherit", y = a[g][p] || "inherit";
-          l[p] = `light-dark(${C}, ${y})`, o === "css-vars" && (l[u(h, p)] = d);
+          const C = a[p][f] || "inherit", y = a[g][f] || "inherit";
+          l[f] = `light-dark(${C}, ${y})`, o === "css-vars" && (l[u(h, f)] = d);
         } else
-          l[p] = d;
+          l[f] = d;
       else
-        o === "css-vars" && (l[u(h, p)] = d);
+        o === "css-vars" && (l[u(h, f)] = d);
     }
   }), s.htmlStyle = l, s;
 }
@@ -6235,19 +6235,19 @@ function yl() {
       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, p, d) {
-        const f = o[c];
+      function s(c, h, f, d) {
+        const p = o[c];
         let g = "", C = -1, 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 += Ro(f.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === p && (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 += Ro(p.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === f && (y = _ + 1);
         if (C === -1)
           throw new F(`Failed to find 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 = f.children.slice(C, y);
-        if (!d.alwaysWrap && m.length === f.children.length)
-          i(f, d, "line");
+        const m = p.children.slice(C, y);
+        if (!d.alwaysWrap && m.length === p.children.length)
+          i(p, d, "line");
         else if (!d.alwaysWrap && m.length === 1 && m[0].type === "element")
           i(m[0], d, "token");
         else {
@@ -6257,30 +6257,30 @@ function yl() {
             properties: {},
             children: m
           };
-          i(_, d, "wrapper"), f.children.splice(C, m.length, _);
+          i(_, d, "wrapper"), p.children.splice(C, m.length, _);
         }
       }
       function a(c, h) {
         o[c] = i(o[c], h, "line");
       }
-      function i(c, h, p) {
-        const d = h.properties || {}, f = h.transform || ((g) => g);
+      function i(c, h, f) {
+        const d = h.properties || {}, p = h.transform || ((g) => g);
         return c.tagName = h.tagName || "span", c.properties = {
           ...c.properties,
           ...d,
           class: c.properties.class
-        }, h.properties?.class && Eo(c, h.properties.class), c = f(c, p) || c, c;
+        }, h.properties?.class && Eo(c, h.properties.class), c = p(c, f) || c, c;
       }
       const l = [], u = r.decorations.sort((c, h) => h.start.offset - c.start.offset || c.end.offset - h.end.offset);
       for (const c of u) {
-        const { start: h, end: p } = c;
-        if (h.line === p.line)
-          s(h.line, h.character, p.character, c);
-        else if (h.line < p.line) {
+        const { start: h, end: f } = c;
+        if (h.line === f.line)
+          s(h.line, h.character, f.character, c);
+        else if (h.line < f.line) {
           s(h.line, h.character, Number.POSITIVE_INFINITY, c);
-          for (let d = h.line + 1; d < p.line; d++)
+          for (let d = h.line + 1; d < f.line; d++)
             l.unshift(() => a(d, c));
-          s(p.line, 0, p.character, c);
+          s(f.line, 0, f.character, c);
         }
       }
       l.forEach((c) => c());
@@ -6540,33 +6540,49 @@ function xl(t = vl) {
     value: a
   };
 }
-function El(t, e, n) {
-  const r = ft(t, n), o = St(e), s = xl(
-    Object.fromEntries(
-      de.map((i) => [
-        i,
-        t.colors?.[`terminal.ansi${i[0].toUpperCase()}${i.substring(1)}`]
-      ])
-    )
-  ), a = kl();
+const El = {
+  black: "#000000",
+  red: "#cd3131",
+  green: "#0DBC79",
+  yellow: "#E5E510",
+  blue: "#2472C8",
+  magenta: "#BC3FBC",
+  cyan: "#11A8CD",
+  white: "#E5E5E5",
+  brightBlack: "#666666",
+  brightRed: "#F14C4C",
+  brightGreen: "#23D18B",
+  brightYellow: "#F5F543",
+  brightBlue: "#3B8EEA",
+  brightMagenta: "#D670D6",
+  brightCyan: "#29B8DB",
+  brightWhite: "#FFFFFF"
+};
+function Al(t, e, n) {
+  const r = ft(t, n), o = St(e), s = Object.fromEntries(
+    de.map((l) => {
+      const u = `terminal.ansi${l[0].toUpperCase()}${l.substring(1)}`, c = t.colors?.[u];
+      return [l, c || El[l]];
+    })
+  ), a = xl(s), i = kl();
   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 = Al(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,
-        offset: i[1],
+    (l) => i.parse(l[0]).map((u) => {
+      let c, h;
+      u.decorations.has("reverse") ? (c = u.background ? a.value(u.background) : t.bg, h = u.foreground ? a.value(u.foreground) : t.fg) : (c = u.foreground ? a.value(u.foreground) : t.fg, h = u.background ? a.value(u.background) : void 0), c = ue(c, r), h = ue(h, r), u.decorations.has("dim") && (c = Rl(c));
+      let f = z.None;
+      return u.decorations.has("bold") && (f |= z.Bold), u.decorations.has("italic") && (f |= z.Italic), u.decorations.has("underline") && (f |= z.Underline), u.decorations.has("strikethrough") && (f |= z.Strikethrough), {
+        content: u.value,
+        offset: l[1],
         // TODO: more accurate offset? might need to fork ansi-sequence-parser
-        color: u,
-        bgColor: c,
-        fontStyle: h
+        color: c,
+        bgColor: h,
+        fontStyle: f
       };
     })
   );
 }
-function Al(t) {
-  const e = t.match(/#([0-9a-f]{3})([0-9a-f]{3})?([0-9a-f]{2})?/);
+function Rl(t) {
+  const e = t.match(/#([0-9a-f]{3})([0-9a-f]{3})?([0-9a-f]{2})?/i);
   if (e)
     if (e[3]) {
       const r = Math.round(Number.parseInt(e[3], 16) / 2).toString(16).padStart(2, "0");
@@ -6584,7 +6600,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 El(s, e, n);
+    return Al(s, e, n);
   const i = t.getLanguage(r);
   if (n.grammarState) {
     if (n.grammarState.lang !== i.name)
@@ -6592,9 +6608,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 Il(e, i, s, a, n);
+  return Nl(e, i, s, a, n);
 }
-function Rl(...t) {
+function Il(...t) {
   if (t.length === 2)
     return We(t[1]);
   const [e, n, r = {}] = t, {
@@ -6612,7 +6628,7 @@ function Rl(...t) {
     a.name
   );
 }
-function Il(t, e, n, r, o) {
+function Nl(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,
@@ -6637,15 +6653,15 @@ function gt(t, e, n, r, o) {
     }
   ).stateStack : Zt, c = [];
   const h = [];
-  for (let p = 0, d = l.length; p < d; p++) {
-    const [f, g] = l[p];
-    if (f === "") {
+  for (let f = 0, d = l.length; f < d; f++) {
+    const [p, g] = l[f];
+    if (p === "") {
       c = [], h.push([]);
       continue;
     }
-    if (a > 0 && f.length >= a) {
+    if (a > 0 && p.length >= a) {
       c = [], h.push([{
-        content: f,
+        content: p,
         offset: g,
         color: "",
         fontStyle: 0
@@ -6653,17 +6669,17 @@ function gt(t, e, n, r, o) {
       continue;
     }
     let C, y, m;
-    o.includeExplanation && (C = e.tokenizeLine(f, u, i), y = C.tokens, m = 0);
-    const _ = e.tokenizeLine2(f, u, i), S = _.tokens.length / 2;
+    o.includeExplanation && (C = e.tokenizeLine(p, u, i), y = C.tokens, m = 0);
+    const _ = e.tokenizeLine2(p, u, i), S = _.tokens.length / 2;
     for (let A = 0; A < S; A++) {
-      const D = _.tokens[2 * A], L = A + 1 < S ? _.tokens[2 * A + 2] : f.length;
+      const D = _.tokens[2 * A], L = A + 1 < S ? _.tokens[2 * A + 2] : p.length;
       if (D === L)
         continue;
       const j = _.tokens[2 * A + 1], Z = ue(
         r[Re.getForeground(j)],
         s
       ), ee = Re.getFontStyle(j), ce = {
-        content: f.substring(D, L),
+        content: p.substring(D, L),
         offset: g + D,
         color: Z,
         fontStyle: ee
@@ -6691,15 +6707,15 @@ function gt(t, e, n, r, o) {
         ce.explanation = [];
         let R = 0;
         for (; D + R < L; ) {
-          const k = y[m], G = f.substring(
+          const k = y[m], G = p.substring(
             k.startIndex,
             k.endIndex
           );
           R += G.length, ce.explanation.push({
             content: G,
-            scopes: o.includeExplanation === "scopeName" ? Nl(
+            scopes: o.includeExplanation === "scopeName" ? Ll(
               k.scopes
-            ) : Ll(
+            ) : Pl(
               te,
               k.scopes
             )
@@ -6715,16 +6731,16 @@ function gt(t, e, n, r, o) {
     stateStack: u
   };
 }
-function Nl(t) {
+function Ll(t) {
   return t.map((e) => ({ scopeName: e }));
 }
-function Ll(t, e) {
+function Pl(t, e) {
   const n = [];
   for (let r = 0, o = e.length; r < o; r++) {
     const s = e[r];
     n[r] = {
       scopeName: s,
-      themeMatches: $l(t, s, e.slice(0, r))
+      themeMatches: Tl(t, s, e.slice(0, r))
     };
   }
   return n;
@@ -6732,7 +6748,7 @@ function Ll(t, e) {
 function nr(t, e) {
   return t === e || e.substring(0, t.length) === t && e[t.length] === ".";
 }
-function Pl(t, e, n) {
+function $l(t, e, n) {
   if (!nr(t[t.length - 1], e))
     return !1;
   let r = t.length - 2, o = n.length - 1;
@@ -6740,11 +6756,11 @@ function Pl(t, e, n) {
     nr(t[r], n[o]) && (r -= 1), o -= 1;
   return r === -1;
 }
-function $l(t, e, n) {
+function Tl(t, e, n) {
   const r = [];
   for (const { selectors: o, settings: s } of t)
     for (const a of o)
-      if (Pl(a, e, n)) {
+      if ($l(a, e, n)) {
         r.push(s);
         break;
       }
@@ -6761,24 +6777,24 @@ function Io(t, e, n) {
       state: c,
       theme: h
     };
-  }), s = Tl(
+  }), s = Ml(
     ...o.map((l) => l.tokens)
   ), a = s[0].map(
     (l, u) => l.map((c, h) => {
-      const p = {
+      const f = {
         content: c.content,
         variants: {},
         offset: c.offset
       };
-      return "includeExplanation" in n && n.includeExplanation && (p.explanation = c.explanation), s.forEach((d, f) => {
+      return "includeExplanation" in n && n.includeExplanation && (f.explanation = c.explanation), s.forEach((d, p) => {
         const {
           content: g,
           explanation: C,
           offset: y,
           ...m
         } = d[u][h];
-        p.variants[r[f].color] = m;
-      }), p;
+        f.variants[r[p].color] = m;
+      }), f;
     })
   ), i = o[0].state ? new Le(
     Object.fromEntries(o.map((l) => [l.theme, l.state?.getInternalStack(l.theme)])),
@@ -6786,7 +6802,7 @@ function Io(t, e, n) {
   ) : void 0;
   return i && kt(a, i), a;
 }
-function Tl(...t) {
+function Ml(...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(() => []);
@@ -6816,20 +6832,20 @@ function mt(t, e, n) {
       defaultColor: u = "light",
       cssVariablePrefix: c = "--shiki-",
       colorsRendering: h = "css-vars"
-    } = 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)
+    } = n, f = Object.entries(n.themes).filter((y) => y[1]).map((y) => ({ color: y[0], theme: y[1] })).sort((y, m) => y.color === u ? -1 : m.color === u ? 1 : 0);
+    if (f.length === 0)
       throw new F("`themes` option must not be empty");
     const d = Io(
       t,
       e,
       n
     );
-    if (l = We(d), u && _n !== u && !p.find((y) => y.color === u))
+    if (l = We(d), u && _n !== u && !f.find((y) => y.color === u))
       throw new F(`\`themes\` option must contain the defaultColor key \`${u}\``);
-    const f = p.map((y) => t.getTheme(y.theme)), g = p.map((y) => y.color);
+    const p = f.map((y) => t.getTheme(y.theme)), g = f.map((y) => y.color);
     s = d.map((y) => y.map((m) => dl(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(";");
+    const C = f.map((y) => ft(y.theme, n));
+    o = rr(f, p, C, c, u, "fg", h), r = rr(f, p, C, c, u, "bg", h), a = `shiki-themes ${p.map((y) => y.name).join(" ")}`, i = u ? void 0 : [o, r].join(";");
   } else if ("theme" in n) {
     const u = ft(n.theme, n);
     s = Sn(
@@ -6855,11 +6871,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"), p = t.findIndex((g) => g.color === "dark");
-        if (h === -1 || p === -1)
+        const h = t.findIndex((g) => g.color === "light"), f = t.findIndex((g) => g.color === "dark");
+        if (h === -1 || f === -1)
           throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-        const d = ue(e[h][s], n[h]) || "inherit", f = ue(e[p][s], n[p]) || "inherit";
-        return `light-dark(${d}, ${f});${c}`;
+        const d = ue(e[h][s], n[h]) || "inherit", p = ue(e[f][s], n[f]) || "inherit";
+        return `light-dark(${d}, ${p});${c}`;
       }
       return u;
     }
@@ -6873,8 +6889,8 @@ function yt(t, e, n, r = {
   codeToTokens: (o, s) => mt(t, o, s)
 }) {
   let o = e;
-  for (const f of dt(n))
-    o = f.preprocess?.call(r, o, n) || o;
+  for (const p of dt(n))
+    o = p.preprocess?.call(r, o, n) || o;
   let {
     tokens: s,
     fg: a,
@@ -6885,18 +6901,18 @@ function yt(t, e, n, r = {
   } = mt(t, o, n);
   const {
     mergeWhitespaces: h = !0,
-    mergeSameStyleTokens: p = !1
+    mergeSameStyleTokens: f = !1
   } = n;
-  h === !0 ? s = Ol(s) : h === "never" && (s = Dl(s)), p && (s = Gl(s));
+  h === !0 ? s = Dl(s) : h === "never" && (s = Gl(s)), f && (s = Fl(s));
   const d = {
     ...r,
     get source() {
       return o;
     }
   };
-  for (const f of dt(n))
-    s = f.tokens?.call(d, s) || s;
-  return Ml(
+  for (const p of dt(n))
+    s = p.tokens?.call(d, s) || s;
+  return Ol(
     s,
     {
       ...n,
@@ -6909,7 +6925,7 @@ function yt(t, e, n, r = {
     c
   );
 }
-function Ml(t, e, n, r = We(t)) {
+function Ol(t, e, n, r = We(t)) {
   const o = dt(e), s = [], a = {
     type: "root",
     children: []
@@ -6929,7 +6945,7 @@ function Ml(t, e, n, r = We(t)) {
       ...Object.fromEntries(
         Array.from(
           Object.entries(e.meta || {})
-        ).filter(([f]) => !f.startsWith("_"))
+        ).filter(([p]) => !p.startsWith("_"))
       )
     },
     children: []
@@ -6939,7 +6955,7 @@ function Ml(t, e, n, r = We(t)) {
     properties: {},
     children: s
   };
-  const h = [], p = {
+  const h = [], f = {
     ...n,
     structure: i,
     addClassToHast: Eo,
@@ -6965,7 +6981,7 @@ function Ml(t, e, n, r = We(t)) {
       return h;
     }
   };
-  if (t.forEach((f, g) => {
+  if (t.forEach((p, g) => {
     g && (i === "inline" ? a.children.push({ type: "element", tagName: "br", properties: {}, children: [] }) : i === "classic" && s.push({ type: "text", value: `
 ` }));
     let C = {
@@ -6974,7 +6990,7 @@ function Ml(t, e, n, r = We(t)) {
       properties: { class: "line" },
       children: []
     }, y = 0;
-    for (const m of f) {
+    for (const m of p) {
       let _ = {
         type: "element",
         tagName: "span",
@@ -6986,28 +7002,28 @@ function Ml(t, e, n, r = We(t)) {
       const S = rn(m.htmlStyle || pt(m));
       S && (_.properties.style = S);
       for (const A of o)
-        _ = A?.span?.call(p, _, g + 1, y, C, m) || _;
+        _ = A?.span?.call(f, _, g + 1, y, C, m) || _;
       i === "inline" ? a.children.push(_) : i === "classic" && C.children.push(_), y += m.content.length;
     }
     if (i === "classic") {
       for (const m of o)
-        C = m?.line?.call(p, C, g + 1) || C;
+        C = m?.line?.call(f, C, g + 1) || C;
       h.push(C), s.push(C);
     }
   }), i === "classic") {
-    for (const f of o)
-      c = f?.code?.call(p, c) || c;
+    for (const p of o)
+      c = p?.code?.call(f, c) || c;
     u.children.push(c);
-    for (const f of o)
-      u = f?.pre?.call(p, u) || u;
+    for (const p of o)
+      u = p?.pre?.call(f, u) || u;
     a.children.push(u);
   }
   let d = a;
-  for (const f of o)
-    d = f?.root?.call(p, d) || d;
+  for (const p of o)
+    d = p?.root?.call(f, d) || d;
   return r && kt(d, r), d;
 }
-function Ol(t) {
+function Dl(t) {
   return t.map((e) => {
     const n = [];
     let r = "", o = 0;
@@ -7027,7 +7043,7 @@ function Ol(t) {
     }), n;
   });
 }
-function Dl(t) {
+function Gl(t) {
   return t.map((e) => e.flatMap((n) => {
     if (n.content.match(/^\s+$/))
       return n;
@@ -7051,7 +7067,7 @@ function Dl(t) {
     }), i;
   }));
 }
-function Gl(t) {
+function Fl(t) {
   return t.map((e) => {
     const n = [];
     for (const r of e) {
@@ -7065,15 +7081,15 @@ function Gl(t) {
     return n;
   });
 }
-const Fl = sl;
-function Bl(t, e, n) {
+const Bl = sl;
+function jl(t, e, n) {
   const r = {
     meta: {},
     options: n,
     codeToHast: (s, a) => yt(t, s, a),
     codeToTokens: (s, a) => mt(t, s, a)
   };
-  let o = Fl(yt(t, e, n, r));
+  let o = Bl(yt(t, e, n, r));
   for (const s of dt(n))
     o = s.postprocess?.call(r, o, n) || o;
   return o;
@@ -7149,16 +7165,16 @@ async function Lo(t) {
     )
   )).filter((n) => !!n);
 }
-let jl = 3;
-function Ul(t, e = 3) {
-  e > jl || console.trace(`[SHIKI DEPRECATE]: ${t}`);
+let Ul = 3;
+function zl(t, e = 3) {
+  e > Ul || console.trace(`[SHIKI DEPRECATE]: ${t}`);
 }
 class ve extends Error {
   constructor(e) {
     super(e), this.name = "ShikiError";
   }
 }
-class zl extends Ya {
+class Hl extends Ya {
   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);
   }
@@ -7245,7 +7261,7 @@ class zl extends Ya {
         this._langGraph.set(n, this._langMap.get(n));
   }
 }
-class Hl {
+class Wl {
   _langs = /* @__PURE__ */ new Map();
   _scopeToLang = /* @__PURE__ */ new Map();
   _injections = /* @__PURE__ */ new Map();
@@ -7283,12 +7299,12 @@ class Hl {
   }
 }
 let De = 0;
-function Wl(t) {
+function Vl(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 Hl(t.engine, n), s = new zl(o, r, n, t.langAlias);
+  const n = (t.langs || []).flat(1), r = (t.themes || []).flat(1).map(kn), o = new Wl(t.engine, n), s = new Hl(o, r, n, t.langAlias);
   let a;
   function i(m) {
     C();
@@ -7322,19 +7338,19 @@ function Wl(t) {
   function h() {
     return C(), s.getLoadedLanguages();
   }
-  function p(...m) {
+  function f(...m) {
     C(), s.loadLanguages(m.flat(1));
   }
   async function d(...m) {
-    return p(await No(m));
+    return f(await No(m));
   }
-  function f(...m) {
+  function p(...m) {
     C();
     for (const _ of m.flat(1))
       s.loadTheme(_);
   }
   async function g(...m) {
-    return C(), f(await Lo(m));
+    return C(), p(await Lo(m));
   }
   function C() {
     if (e)
@@ -7350,15 +7366,15 @@ function Wl(t) {
     getLoadedThemes: c,
     getLoadedLanguages: h,
     loadLanguage: d,
-    loadLanguageSync: p,
+    loadLanguageSync: f,
     loadTheme: g,
-    loadThemeSync: f,
+    loadThemeSync: p,
     dispose: y,
     [Symbol.dispose]: y
   };
 }
-async function Vl(t) {
-  t.engine || Ul("`engine` option is required. Use `createOnigurumaEngine` or `createJavaScriptRegexEngine` to create an engine.");
+async function ql(t) {
+  t.engine || zl("`engine` option is required. Use `createOnigurumaEngine` or `createJavaScriptRegexEngine` to create an engine.");
   const [
     e,
     n,
@@ -7368,22 +7384,22 @@ async function Vl(t) {
     No(t.langs || []),
     t.engine
   ]);
-  return Wl({
+  return Vl({
     ...t,
     themes: e,
     langs: n,
     engine: r
   });
 }
-async function ql(t) {
-  const e = await Vl(t);
+async function Xl(t) {
+  const e = await ql(t);
   return {
-    getLastGrammarState: (...n) => Rl(e, ...n),
+    getLastGrammarState: (...n) => Il(e, ...n),
     codeToTokensBase: (n, r) => Sn(e, n, r),
     codeToTokensWithThemes: (n, r) => Io(e, n, r),
     codeToTokens: (n, r) => mt(e, n, r),
     codeToHast: (n, r) => yt(e, n, r),
-    codeToHtml: (n, r) => Bl(e, n, r),
+    codeToHtml: (n, r) => jl(e, n, r),
     getBundledLanguages: () => ({}),
     getBundledThemes: () => ({}),
     ...e,
@@ -7393,17 +7409,17 @@ async function ql(t) {
 function Po(t) {
   return "children" in t ? $o(t) : "value" in t ? t.value : "";
 }
-function Xl(t) {
+function Kl(t) {
   return t.type === "text" ? t.value : "children" in t ? $o(t) : "";
 }
 function $o(t) {
   let e = -1;
   const n = [];
   for (; ++e < t.children.length; )
-    n[e] = Xl(t.children[e]);
+    n[e] = Kl(t.children[e]);
   return n.join("");
 }
-const Kl = {
+const Yl = {
   "tailing-curly-colon": (t, e) => {
     const n = Po(e), r = n.match(/(.+)\{:([\w-]+)\}$/);
     if (r)
@@ -7413,7 +7429,7 @@ const Kl = {
         lang: r.at(2)
       };
   }
-}, ir = "language-", Yl = (t, e) => {
+}, ir = "language-", Jl = (t, e) => {
   const n = e.children[0];
   if (!n || n.type !== "element" || n.tagName !== "code" || !n.properties)
     return;
@@ -7426,8 +7442,8 @@ const Kl = {
     code: Po(n),
     meta: n.data?.meta ?? n.properties.metastring?.toString() ?? ""
   };
-}, Jl = "language-";
-function Zl(t, e) {
+}, Zl = "language-";
+function Ql(t, e) {
   const {
     addLanguageClass: n = !1,
     parseMetaString: r,
@@ -7440,8 +7456,8 @@ function Zl(t, e) {
     lazy: c = !1,
     ...h
   } = e;
-  function p(d, f, g = "", C = {}) {
-    const y = `${d}:${g}:${f}`, m = o?.get(y);
+  function f(d, p, g = "", C = {}) {
+    const y = `${d}:${g}:${p}`, m = o?.get(y);
     if (m)
       return m;
     const _ = {
@@ -7458,13 +7474,13 @@ function Zl(t, e) {
       {
         name: "rehype-shiki:code-language-class",
         code(S) {
-          return this.addClassToHast(S, `${Jl}${d}`), S;
+          return this.addClassToHast(S, `${Zl}${d}`), S;
         }
       }
-    ]), l && f.endsWith(`
-`) && (f = f.slice(0, -1));
+    ]), l && p.endsWith(`
+`) && (p = p.slice(0, -1));
     try {
-      const S = t.codeToHast(f, _);
+      const S = t.codeToHast(p, _);
       return o?.set(y, S), S;
     } catch (S) {
       if (i)
@@ -7474,15 +7490,15 @@ function Zl(t, e) {
     }
   }
   return (d) => {
-    const f = [];
+    const p = [];
     if (Xr(d, "element", (g, C, y) => {
       let m;
       if (!y || C == null)
         return;
       if (g.tagName === "pre")
-        m = Yl;
+        m = Jl;
       else if (g.tagName === "code" && u)
-        m = Kl[u];
+        m = Yl[u];
       else
         return;
       const _ = m(d, g);
@@ -7492,7 +7508,7 @@ function Zl(t, e) {
       if (_.lang ? t.getLoadedLanguages().includes(_.lang) || xo(_.lang) ? S = _.lang : c ? (A = !0, S = _.lang) : a && (S = a) : S = s, !S)
         return;
       const D = _.meta ? r?.(_.meta, g, d) : void 0, L = (j) => {
-        const Z = p(j, _.code, _.meta, D ?? {});
+        const Z = f(j, _.code, _.meta, D ?? {});
         if (Z) {
           if (_.type === "inline") {
             const ee = Z.children[0];
@@ -7503,7 +7519,7 @@ function Zl(t, e) {
       };
       if (A)
         try {
-          f.push(t.loadLanguage(S).then(() => L(S)));
+          p.push(t.loadLanguage(S).then(() => L(S)));
         } catch (j) {
           if (a)
             return L(a);
@@ -7514,15 +7530,15 @@ function Zl(t, e) {
       else
         L(S);
       return "skip";
-    }), f.length > 0) {
+    }), p.length > 0) {
       async function g() {
-        await Promise.all(f);
+        await Promise.all(p);
       }
       return g();
     }
   };
 }
-function Ql(t) {
+function eu(t) {
   if (!t)
     return null;
   const e = t.match(/\{([\d,-]+)\}/);
@@ -7532,7 +7548,7 @@ function Ql(t) {
   }) : null;
 }
 const lr = Symbol("highlighted-lines");
-function eu(t = {}) {
+function tu(t = {}) {
   const {
     className: e = "highlighted"
   } = t;
@@ -7542,14 +7558,14 @@ function eu(t = {}) {
       if (!this.options.meta?.__raw)
         return;
       const o = this.meta;
-      return o[lr] ??= Ql(this.options.meta.__raw), (o[lr] ?? []).includes(r) && this.addClassToHast(n, e), n;
+      return o[lr] ??= eu(this.options.meta.__raw), (o[lr] ?? []).includes(r) && this.addClassToHast(n, e), n;
     }
   };
 }
-function tu(t) {
+function nu(t) {
   return t ? Array.from(t.matchAll(/\/((?:\\.|[^/])+)\//g)).map((n) => n[1].replace(/\\(.)/g, "$1")) : [];
 }
-function nu(t = {}) {
+function ru(t = {}) {
   const {
     className: e = "highlighted-word"
   } = t;
@@ -7558,10 +7574,10 @@ function nu(t = {}) {
     preprocess(n, r) {
       if (!this.options.meta?.__raw)
         return;
-      const o = tu(this.options.meta.__raw);
+      const o = nu(this.options.meta.__raw);
       r.decorations ||= [];
       for (const s of o) {
-        const a = ru(n, s);
+        const a = ou(n, s);
         for (const i of a)
           r.decorations.push({
             start: i,
@@ -7574,7 +7590,7 @@ function nu(t = {}) {
     }
   };
 }
-function ru(t, e) {
+function ou(t, e) {
   const n = [];
   let r = 0;
   for (; ; ) {
@@ -7589,7 +7605,7 @@ function Pe(t) {
   if ([...t].length !== 1) throw new Error(`Expected "${t}" to be a single code point`);
   return t.codePointAt(0);
 }
-function ou(t, e, n) {
+function su(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;
@@ -7629,10 +7645,10 @@ const To = B`\[\^?`, Mo = `c.? | C(?:-.?)?|${B`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x
   | &&
   | .
 `.replace(/\s+/g, ""), "gsu");
-function su(t, e = {}) {
+function au(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 = vu(n.flags), o = [r.extended], s = { captureGroup: n.rules.captureGroup, getCurrentModX() {
+  const r = xu(n.flags), o = [r.extended], s = { captureGroup: n.rules.captureGroup, getCurrentModX() {
     return o.at(-1);
   }, numOpenGroups: 0, popModX() {
     o.pop();
@@ -7643,30 +7659,30 @@ function su(t, e = {}) {
   }, singleline: n.rules.singleline };
   let a = [], i;
   for (et.lastIndex = 0; i = et.exec(t); ) {
-    const h = au(s, t, i[0], et.lastIndex);
+    const h = iu(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, p) => {
-    h.kind = "capturing", h.number = p + 1;
+  }), u || l.forEach((h, f) => {
+    h.kind = "capturing", h.number = f + 1;
   });
   const c = u || l.length;
-  return { tokens: a.map((h) => h.type === "EscapedNumber" ? Eu(h, c) : h).flat(), flags: r };
+  return { tokens: a.map((h) => h.type === "EscapedNumber" ? Au(h, c) : h).flat(), flags: r };
 }
-function au(t, e, n, r) {
+function iu(t, e, n, r) {
   const [o, s] = n;
   if (n === "[" || n === "[^") {
-    const a = iu(e, n, r);
+    const a = lu(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: yu(n) };
+      return { token: bu(n) };
     }
     if (/^\\k[<']/.test(n)) {
       if (!/^\\k(?:<[^>]+>|'[^']+')$/.test(n)) throw new Error(`Invalid group name "${n}"`);
@@ -7680,13 +7696,13 @@ function au(t, e, n, r) {
     return Array.isArray(a) ? { tokens: a } : { token: a };
   }
   if (o === "(") {
-    if (s === "*") return { token: _u(n) };
+    if (s === "*") return { token: Su(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: Cu(n, t) };
+    if (/^\(\?[-imx]+[:)]$/.test(n)) return { token: _u(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("!") }) };
@@ -7699,7 +7715,7 @@ function au(t, e, n, r) {
   }
   if (n === ")") {
     if (t.popModX(), t.numOpenGroups--, t.numOpenGroups < 0) throw new Error('Unmatched ")"');
-    return { token: du(n) };
+    return { token: gu(n) };
   }
   if (t.getCurrentModX()) {
     if (n === "#") {
@@ -7717,9 +7733,9 @@ function au(t, e, n, r) {
     const a = t.singleline ? { "^": B`\A`, $: B`\Z` }[n] : n;
     return { token: ur(a, n) };
   }
-  return n === "|" ? { token: uu(n) } : xn.test(n) ? { tokens: Au(n) } : { token: se(Pe(n), n) };
+  return n === "|" ? { token: cu(n) } : xn.test(n) ? { tokens: Ru(n) } : { token: se(Pe(n), n) };
 }
-function iu(t, e, n) {
+function lu(t, e, n) {
   const r = [cr(e[1] === "^", e)];
   let o = 1, s;
   for (Ot.lastIndex = n; s = Ot.exec(t); ) {
@@ -7727,31 +7743,31 @@ function iu(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(cu(a)), !o) break;
+      else if (o--, r.push(hu(a)), !o) break;
     } else {
-      const i = lu(a);
+      const i = uu(a);
       Array.isArray(i) ? r.push(...i) : r.push(i);
     }
   }
   return { tokens: r, lastIndex: Ot.lastIndex || t.length };
 }
-function lu(t) {
+function uu(t) {
   if (t[0] === "\\") return Oo(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 === "-" ? hu(t) : t === "&&" ? fu(t) : se(Pe(t), t);
+  return t === "-" ? fu(t) : t === "&&" ? pu(t) : se(Pe(t), t);
 }
 function Oo(t, { inCharClass: e }) {
   const n = t[1];
-  if (n === "c" || n === "C") return wu(t);
-  if ("dDhHsSwW".includes(n)) return Su(t);
+  if (n === "c" || n === "C") return Cu(t);
+  if ("dDhHsSwW".includes(n)) return ku(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 ku(t);
+    return vu(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();
@@ -7762,15 +7778,15 @@ function Oo(t, { inCharClass: e }) {
   } catch {
     throw new Error(`Multibyte code "${t}" incomplete or invalid in Oniguruma`);
   }
-  if (n === "u" || n === "x") return se(xu(t), t);
+  if (n === "u" || n === "x") return se(Eu(t), t);
   if (hr.has(n)) return se(hr.get(n), t);
-  if (/\d/.test(n)) return pu(e, t);
+  if (/\d/.test(n)) return du(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 uu(t) {
+function cu(t) {
   return { type: "Alternator", raw: t };
 }
 function ur(t, e) {
@@ -7782,13 +7798,13 @@ function Do(t) {
 function se(t, e) {
   return { type: "Character", value: t, raw: e };
 }
-function cu(t) {
+function hu(t) {
   return { type: "CharacterClassClose", raw: t };
 }
-function hu(t) {
+function fu(t) {
   return { type: "CharacterClassHyphen", raw: t };
 }
-function fu(t) {
+function pu(t) {
   return { type: "CharacterClassIntersector", raw: t };
 }
 function cr(t, e) {
@@ -7800,31 +7816,31 @@ function ge(t, e, n = {}) {
 function Go(t, e, n = {}) {
   return t === "keep" ? { type: "Directive", kind: t, raw: e } : { type: "Directive", kind: t, flags: $e(n.flags), raw: e };
 }
-function pu(t, e) {
+function du(t, e) {
   return { type: "EscapedNumber", inCharClass: t, raw: e };
 }
-function du(t) {
+function gu(t) {
   return { type: "GroupClose", raw: t };
 }
 function Se(t, e, n = {}) {
   return { type: "GroupOpen", kind: t, ...n, raw: e };
 }
-function gu(t, e, n, r) {
+function mu(t, e, n, r) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n, raw: r };
 }
-function mu(t, e, n, r) {
+function yu(t, e, n, r) {
   return { type: "Quantifier", kind: t, min: e, max: n, raw: r };
 }
-function yu(t) {
+function bu(t) {
   return { type: "Subroutine", raw: t };
 }
-const bu = /* @__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 wu(t) {
+const wu = /* @__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 Cu(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(Pe(e.toUpperCase()) - 64, t);
 }
-function Cu(t, e) {
+function _u(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 = pr(n), a = pr(r), i = {};
@@ -7832,13 +7848,13 @@ function Cu(t, e) {
   if (t.endsWith(":")) return e.pushModX(o), e.numOpenGroups++, Se("group", t, { ...(s || a) && { flags: i } });
   throw new Error(`Unexpected flag modifier "${t}"`);
 }
-function _u(t) {
+function Su(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 = bu.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 = wu.has(n) ? n.toLowerCase() : "custom";
   switch (u) {
     case "fail":
     case "mismatch":
@@ -7870,7 +7886,7 @@ function _u(t) {
     default:
       throw new Error(`Unexpected named callout kind "${u}"`);
   }
-  return gu(u, r ?? null, o?.split(",") ?? null, t);
+  return mu(u, r ?? null, o?.split(",") ?? null, t);
 }
 function fr(t) {
   let e = null, n, r;
@@ -7882,13 +7898,13 @@ function fr(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 mu(e, n, r, t);
+  return yu(e, n, r, t);
 }
-function Su(t) {
+function ku(t) {
   const e = t[1].toLowerCase();
   return ge({ d: "digit", h: "hex", s: "space", w: "word" }[e], t, { negate: t[1] !== e });
 }
-function ku(t) {
+function vu(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 });
 }
@@ -7896,7 +7912,7 @@ 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 vu(t) {
+function xu(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];
@@ -7910,12 +7926,12 @@ function vu(t) {
   }
   return e;
 }
-function xu(t) {
+function Eu(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 Eu(t, e) {
+function Au(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 [Do(n)];
   const s = [], a = o.match(/^[0-7]+|\d/g);
@@ -7929,7 +7945,7 @@ function Eu(t, e) {
   }
   return s;
 }
-function Au(t) {
+function Ru(t) {
   const e = [], n = new RegExp(xn, "gy");
   let r;
   for (; r = n.exec(t); ) {
@@ -7954,62 +7970,62 @@ function Fo(t, e) {
   const n = t.body[0];
   return !e || Object.keys(e).every((r) => e[r] === n[r]);
 }
-function Ru(t) {
-  return Iu.has(t.type);
+function Iu(t) {
+  return Nu.has(t.type);
 }
-const Iu = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
+const Nu = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
 function Bo(t, e = {}) {
-  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = su(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) {
+  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = au(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) {
       case "Alternator":
         return me();
       case "Assertion":
-        return Nu(f);
+        return Lu(p);
       case "Backreference":
-        return Lu(f, s);
+        return Pu(p, s);
       case "Character":
-        return vt(f.value, { useLastValid: !!d.isCheckingRangeEnd });
+        return vt(p.value, { useLastValid: !!d.isCheckingRangeEnd });
       case "CharacterClassHyphen":
-        return Pu(f, s, d);
+        return $u(p, s, d);
       case "CharacterClassOpen":
-        return $u(f, s, d);
+        return Tu(p, s, d);
       case "CharacterSet":
-        return Tu(f, s);
+        return Mu(p, s);
       case "Directive":
-        return Bu(f.kind, { flags: f.flags });
+        return ju(p.kind, { flags: p.flags });
       case "GroupOpen":
-        return Mu(f, s, d);
+        return Ou(p, s, d);
       case "NamedCallout":
-        return Uu(f.kind, f.tag, f.arguments);
+        return zu(p.kind, p.tag, p.arguments);
       case "Quantifier":
-        return Ou(f, s);
+        return Du(p, s);
       case "Subroutine":
-        return Du(f, s);
+        return Gu(p, s);
       default:
-        throw new Error(`Unexpected token type "${f.type}"`);
+        throw new Error(`Unexpected token type "${p.type}"`);
     }
-  }, s = { capturingGroups: [], hasNumberedRef: !1, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: n.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: n.skipBackrefValidation, skipLookbehindValidation: n.skipLookbehindValidation, skipPropertyNameValidation: n.skipPropertyNameValidation, subroutines: [], tokens: r.tokens, unicodePropertyMap: n.unicodePropertyMap, walk: o }, a = Hu(ju(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 = Wu(Uu(r.flags));
   let i = a.body[0];
   for (; s.nextIndex < r.tokens.length; ) {
-    const p = o(i, {});
-    p.type === "Alternative" ? (a.body.push(p), i = p) : i.body.push(p);
+    const f = o(i, {});
+    f.type === "Alternative" ? (a.body.push(f), i = f) : i.body.push(f);
   }
   const { capturingGroups: l, hasNumberedRef: u, namedGroupsByName: c, subroutines: h } = s;
   if (u && c.size && !n.rules.captureGroup) throw new Error("Numbered backref/subroutine not allowed when using named capture");
-  for (const { ref: 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}>"`);
+  for (const { ref: f } of h) if (typeof f == "number") {
+    if (f > l.length) throw new Error("Subroutine uses a group number that's not defined");
+    f && (l[f - 1].isSubroutined = !0);
+  } else if (c.has(f)) {
+    if (c.get(f).length > 1) throw new Error(B`Subroutine uses a duplicate group name "\g<${f}>"`);
+    c.get(f)[0].isSubroutined = !0;
+  } else throw new Error(B`Subroutine uses a group name that's not defined "\g<${f}>"`);
   return a;
 }
-function Nu({ kind: t }) {
+function Lu({ 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 Lu({ raw: t }, e) {
+function Pu({ 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;
@@ -8026,16 +8042,16 @@ function Lu({ raw: t }, e) {
   }
   return o(+r);
 }
-function Pu(t, e, n) {
+function $u(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(), Fu(a, l);
+    if (a.type === "Character" && l.type === "Character") return s.body.pop(), Bu(a, l);
     throw new Error("Invalid character class range");
   }
   return vt(Pe("-"));
 }
-function $u({ negate: t }, e, n) {
+function Tu({ negate: t }, e, n) {
   const { tokens: r, walk: o } = e, s = r[e.nextIndex], a = [st()];
   let i = mr(s);
   for (; i.type !== "CharacterClassClose"; ) {
@@ -8049,41 +8065,41 @@ function $u({ 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 Tu({ kind: t, negate: e, value: n }, r) {
+function Mu({ 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" ? zu(n, { negate: e }) : an(t, { negate: e });
+  return t === "posix" ? Hu(n, { negate: e }) : an(t, { negate: e });
 }
-function Mu(t, e, n) {
-  const { tokens: r, capturingGroups: o, namedGroupsByName: s, skipLookbehindValidation: a, walk: i } = e, l = Wu(t), u = l.type === "AbsenceFunction", c = gr(l), h = c && l.negate;
-  if (l.type === "CapturingGroup" && (o.push(l), l.name && ou(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++;
+function Ou(t, e, n) {
+  const { tokens: r, capturingGroups: o, namedGroupsByName: s, skipLookbehindValidation: a, walk: i } = e, l = Vu(t), u = l.type === "AbsenceFunction", c = gr(l), h = c && l.negate;
+  if (l.type === "CapturingGroup" && (o.push(l), l.name && su(s, l.name, []).push(l)), u && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
+  let f = yr(r[e.nextIndex]);
+  for (; f.type !== "GroupClose"; ) {
+    if (f.type === "Alternator") l.body.push(me()), e.nextIndex++;
     else {
-      const 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 d = l.body.at(-1), p = i(d, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || u, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || h });
+      if (d.body.push(p), (c || n.isInLookbehind) && !a) {
         const g = "Lookbehind includes a pattern not allowed by Oniguruma";
         if (h || n.isInNegLookbehind) {
-          if (dr(f) || f.type === "CapturingGroup") throw new Error(g);
-        } else if (dr(f) || gr(f) && f.negate) throw new Error(g);
+          if (dr(p) || p.type === "CapturingGroup") throw new Error(g);
+        } else if (dr(p) || gr(p) && p.negate) throw new Error(g);
       }
     }
-    p = yr(r[e.nextIndex]);
+    f = yr(r[e.nextIndex]);
   }
   return e.nextIndex++, l;
 }
-function Ou({ kind: t, min: e, max: n }, r) {
+function Du({ kind: t, min: e, max: n }, r) {
   const o = r.parent, s = o.body.at(-1);
-  if (!s || !Ru(s)) throw new Error("Quantifier requires a repeatable token");
+  if (!s || !Iu(s)) throw new Error("Quantifier requires a repeatable token");
   const a = Uo(t, e, n, s);
   return o.body.pop(), a;
 }
-function Du({ raw: t }, e) {
+function Gu({ 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);
@@ -8094,7 +8110,7 @@ function Du({ raw: t }, e) {
   const a = zo(o);
   return r.push(a), a;
 }
-function Gu(t, e) {
+function Fu(t, e) {
   return { type: "AbsenceFunction", kind: t, body: Ye(e?.body) };
 }
 function me(t) {
@@ -8110,7 +8126,7 @@ function sn(t, e) {
 }
 function jo(t, e) {
   const n = { name: void 0, isSubroutined: !1, ...e };
-  if (n.name !== void 0 && !Vu(n.name)) throw new Error(`Group name "${n.name}" invalid in Oniguruma`);
+  if (n.name !== void 0 && !qu(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) {
@@ -8126,7 +8142,7 @@ function st(t) {
   const e = { kind: "union", negate: !1, ...t };
   return { type: "CharacterClass", kind: e.kind, negate: e.negate, body: Ho(t?.body) };
 }
-function Fu(t, e) {
+function Bu(t, e) {
   if (e.value < t.value) throw new Error("Character class range out of order");
   return { type: "CharacterClassRange", min: t, max: e };
 }
@@ -8134,12 +8150,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 Bu(t, e = {}) {
+function ju(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 ju(t) {
+function Uu(t) {
   return { type: "Flags", ...t };
 }
 function Q(t) {
@@ -8151,10 +8167,10 @@ 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 Uu(t, e, n) {
+function zu(t, e, n) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n };
 }
-function zu(t, e) {
+function Hu(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 };
@@ -8163,7 +8179,7 @@ function Uo(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 Hu(t, e) {
+function Wu(t, e) {
   return { type: "Regex", body: Ye(e?.body), flags: t };
 }
 function zo(t) {
@@ -8173,15 +8189,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 = qu(t);
+    if (n.normalizeUnknownPropertyNames) r = Xu(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 Wu({ flags: t, kind: e, name: n, negate: r, number: o }) {
+function Vu({ flags: t, kind: e, name: n, negate: r, number: o }) {
   switch (e) {
     case "absence_repeater":
-      return Gu("repeater");
+      return Fu("repeater");
     case "atomic":
       return Q({ atomic: !0 });
     case "capturing":
@@ -8211,10 +8227,10 @@ function dr(t) {
 function gr(t) {
   return t.type === "LookaroundAssertion" && t.kind === "lookbehind";
 }
-function Vu(t) {
+function qu(t) {
   return /^[\p{Alpha}\p{Pc}][^)]*$/u.test(t);
 }
-function qu(t) {
+function Xu(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) {
@@ -8254,8 +8270,8 @@ function Be(t, e, n = null) {
       c = !0;
     }, skip() {
       c = !0;
-    } }, { 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) {
+    } }, { type: f } = s, d = e["*"], p = e[f], g = typeof d == "function" ? d : d?.enter, C = typeof p == "function" ? p : p?.enter;
+    if (g?.(h, n), C?.(h, n), !c) switch (f) {
       case "AbsenceFunction":
       case "CapturingGroup":
       case "Group":
@@ -8287,9 +8303,9 @@ function Be(t, e, n = null) {
         r(s.body, s), o(s.flags, s, "flags");
         break;
       default:
-        throw new Error(`Unexpected node type "${p}"`);
+        throw new Error(`Unexpected node type "${f}"`);
     }
-    return f?.exit?.(h, n), d?.exit?.(h, n), u;
+    return p?.exit?.(h, n), d?.exit?.(h, n), u;
   }
   return o(t), t;
 }
@@ -8301,12 +8317,12 @@ function Ce(t) {
   if (typeof t != "number") throw new Error("Numeric key expected");
   return t;
 }
-const Xu = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
-function Ku(t, e) {
+const Ku = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
+function Yu(t, e) {
   for (let n = 0; n < t.length; n++)
     t[n] >= e && t[n]++;
 }
-function Yu(t, e, n, r) {
+function Ju(t, e, n, r) {
   return t.slice(0, e) + r + t.slice(e + n.length);
 }
 const J = Object.freeze({
@@ -8332,7 +8348,7 @@ function En(t, e, n, r) {
 function Wo(t, e, n, r) {
   En(t, e, n, r);
 }
-function Ju(t, e, n = 0, r) {
+function Zu(t, e, n = 0, r) {
   if (!new RegExp(e, "su").test(t))
     return null;
   const o = new RegExp(`${e}|(?<$skip>\\\\?.)`, "gsu");
@@ -8347,9 +8363,9 @@ function Ju(t, e, n = 0, r) {
   return null;
 }
 function nt(t, e, n) {
-  return !!Ju(t, e, 0, n);
+  return !!Zu(t, e, 0, n);
 }
-function Zu(t, e) {
+function Qu(t, e) {
   const n = /\\?./gsu;
   n.lastIndex = e;
   let r = t.length, o = 0, s = 1, a;
@@ -8368,8 +8384,8 @@ function Zu(t, e) {
   }
   return t.slice(e, r);
 }
-const br = new RegExp(String.raw`(?<noncapturingStart>${Xu})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
-function Qu(t, e) {
+const br = new RegExp(String.raw`(?<noncapturingStart>${Ku})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
+function ec(t, e) {
   const n = e?.hiddenCaptures ?? [];
   let r = e?.captureTransfers ?? /* @__PURE__ */ new Map();
   if (!/\(\?>/.test(t))
@@ -8382,24 +8398,24 @@ function Qu(t, e) {
   let l = 0, u = 0, c = NaN, h;
   do {
     h = !1;
-    let p = 0, d = 0, f = !1, g;
+    let f = 0, d = 0, p = !1, g;
     for (br.lastIndex = Number.isNaN(c) ? 0 : c + s.length; g = br.exec(t); ) {
       const { 0: C, index: y, groups: { capturingStart: m, noncapturingStart: _ } } = g;
       if (C === "[")
-        p++;
-      else if (p)
-        C === "]" && p--;
-      else if (C === o && !f)
-        c = y, f = !0;
-      else if (f && _)
+        f++;
+      else if (f)
+        C === "]" && f--;
+      else if (C === o && !p)
+        c = y, p = !0;
+      else if (p && _)
         d++;
       else if (m)
-        f ? d++ : (l++, a.push(l + u));
-      else if (C === ")" && f) {
+        p ? d++ : (l++, a.push(l + u));
+      else if (C === ")" && p) {
         if (!d) {
           u++;
           const S = l + u;
-          if (t = `${t.slice(0, c)}${s}${t.slice(c + o.length, y)}))<$$${S}>)${t.slice(y + 1)}`, h = !0, i.push(S), Ku(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), Yu(n, S), r.size) {
             const A = /* @__PURE__ */ new Map();
             r.forEach((D, L) => {
               A.set(
@@ -8417,14 +8433,14 @@ function Qu(t, e) {
   return n.push(...i), t = En(
     t,
     String.raw`\\(?<backrefNum>[1-9]\d*)|<\$\$(?<wrappedBackrefNum>\d+)>`,
-    ({ 0: p, groups: { backrefNum: d, wrappedBackrefNum: f } }) => {
+    ({ 0: f, groups: { backrefNum: d, wrappedBackrefNum: p } }) => {
       if (d) {
         const g = +d;
         if (g > a.length - 1)
-          throw new Error(`Backref "${p}" greater than number of captures`);
+          throw new Error(`Backref "${f}" greater than number of captures`);
         return `\\${a[g]}`;
       }
-      return `\\${f}`;
+      return `\\${p}`;
     },
     J.DEFAULT
   ), {
@@ -8449,7 +8465,7 @@ const Vo = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, Dt = new RegExp(String.raw`
 | (?<qBase>${Vo})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
 | \\?.
 `.replace(/\s+/g, ""), "gsu");
-function ec(t) {
+function tc(t) {
   if (!new RegExp(`${Vo}\\+`).test(t))
     return {
       pattern: t
@@ -8466,9 +8482,9 @@ function ec(t) {
       if (c === "+" && o && !o.startsWith("(")) {
         if (h)
           throw new Error(`Invalid quantifier "${i}"`);
-        let p = -1;
+        let f = -1;
         if (/^\{\d+\}$/.test(u))
-          t = Yu(t, l + u.length, c, "");
+          t = Ju(t, l + u.length, c, "");
         else {
           if (o === ")" || o === "]") {
             const d = o === ")" ? n : r;
@@ -8477,9 +8493,9 @@ function ec(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)}`;
-          p += 4;
+          f += 4;
         }
-        Dt.lastIndex += p;
+        Dt.lastIndex += f;
       } else i[0] === "(" ? e.push(l) : i === ")" && (n = e.length ? e.pop() : null);
     o = i;
   }
@@ -8487,8 +8503,8 @@ function ec(t) {
     pattern: t
   };
 }
-const Y = String.raw, tc = Y`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, ln = Y`\(\?R=(?<rDepth>[^\)]+)\)|${tc}`, Et = Y`\(\?<(?![=!])(?<captureName>[^>]+)>`, qo = Y`${Et}|(?<unnamed>\()(?!\?)`, he = new RegExp(Y`${Et}|${ln}|\(\?|\\?.`, "gsu"), Gt = "Cannot use multiple overlapping recursions";
-function nc(t, e) {
+const Y = String.raw, nc = Y`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, ln = Y`\(\?R=(?<rDepth>[^\)]+)\)|${nc}`, Et = Y`\(\?<(?![=!])(?<captureName>[^>]+)>`, qo = Y`${Et}|(?<unnamed>\()(?!\?)`, he = new RegExp(Y`${Et}|${ln}|\(\?|\\?.`, "gsu"), Gt = "Cannot use multiple overlapping recursions";
+function rc(t, e) {
   const { hiddenCaptures: n, mode: r } = {
     hiddenCaptures: [],
     mode: "plugin",
@@ -8504,9 +8520,9 @@ function nc(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, p;
-  for (he.lastIndex = 0; p = he.exec(t); ) {
-    const { 0: d, groups: { captureName: f, rDepth: g, gRNameOrNum: C, gRDepth: y } } = p;
+  let u = !1, c = 0, h = 0, f;
+  for (he.lastIndex = 0; f = he.exec(t); ) {
+    const { 0: d, groups: { captureName: p, rDepth: g, gRNameOrNum: C, gRDepth: y } } = f;
     if (d === "[")
       c++;
     else if (c)
@@ -8520,7 +8536,7 @@ function nc(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, p.index), _ = t.slice(he.lastIndex);
+      const m = t.slice(0, f.index), _ = t.slice(he.lastIndex);
       if (nt(_, ln, J.DEFAULT))
         throw new Error(Gt);
       const S = +g - 1;
@@ -8552,14 +8568,14 @@ function nc(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 = Zu(t, _);
+      const _ = i.get(C), S = Qu(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(_, p.index), D = S.slice(A.length + d.length), L = s.length, j = +y - 1, Z = Cr(
+      const A = t.slice(_, f.index), D = S.slice(A.length + d.length), L = s.length, j = +y - 1, Z = Cr(
         A,
         D,
         j,
@@ -8578,10 +8594,10 @@ function nc(t, e) {
       );
       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 (f)
-      h++, i.set(String(h), he.lastIndex), i.set(f, he.lastIndex), l.push({
+    } else if (p)
+      h++, i.set(String(h), he.lastIndex), i.set(p, he.lastIndex), l.push({
         num: h,
-        name: f
+        name: p
       });
     else if (d[0] === "(") {
       const m = d === "(";
@@ -8623,13 +8639,13 @@ function _r(t, e, n, r, o, s, a) {
     u += En(
       t,
       Y`${qo}|\\k<(?<backref>[^>]+)>`,
-      ({ 0: p, groups: { captureName: d, unnamed: f, backref: g } }) => {
+      ({ 0: f, groups: { captureName: d, unnamed: p, backref: g } }) => {
         if (g && r && !r.has(g))
-          return p;
+          return f;
         const C = `_$${h}`;
-        if (f || d) {
+        if (p || d) {
           const y = a + s.length + 1;
-          return s.push(y), rc(o, y), f ? p : `(?<${d}${C}>`;
+          return s.push(y), oc(o, y), p ? f : `(?<${d}${C}>`;
         }
         return Y`\k<${g}${C}>`;
       },
@@ -8638,7 +8654,7 @@ function _r(t, e, n, r, o, s, a) {
   }
   return u;
 }
-function rc(t, e) {
+function oc(t, e) {
   for (let n = 0; n < t.length; n++)
     t[n] >= e && t[n]++;
 }
@@ -8648,19 +8664,19 @@ function Sr(t, e, n, r, o, s) {
     Wo(e, qo, () => a++, J.DEFAULT);
     const i = s - a + o, l = /* @__PURE__ */ new Map();
     return t.forEach((u, c) => {
-      const h = (r - a * n) / n, p = a * n, d = c > i + a ? c + r : c, f = [];
+      const h = (r - a * n) / n, f = a * n, d = c > i + a ? c + r : c, p = [];
       for (const g of u)
         if (g <= i)
-          f.push(g);
+          p.push(g);
         else if (g > i + a + h)
-          f.push(g + r);
+          p.push(g + r);
         else if (g <= i + a)
           for (let C = 0; C <= n; C++)
-            f.push(g + a * C);
+            p.push(g + a * C);
         else
           for (let C = 0; C <= n; C++)
-            f.push(g + p + h * C);
-      l.set(d, f);
+            p.push(g + f + h * C);
+      l.set(d, p);
     }), l;
   }
   return t;
@@ -8704,7 +8720,7 @@ function Ve(t, e, n) {
 function un(t, e) {
   return kr[t] >= kr[e];
 }
-function oc(t, e) {
+function sc(t, e) {
   if (t == null)
     throw new Error(e ?? "Value expected");
   return t;
@@ -8713,7 +8729,7 @@ var kr = {
   ES2025: 2025,
   ES2024: 2024,
   ES2018: 2018
-}, sc = (
+}, ac = (
   /** @type {const} */
   {
     auto: "auto",
@@ -8725,7 +8741,7 @@ var kr = {
 function Xo(t = {}) {
   if ({}.toString.call(t) !== "[object Object]")
     throw new Error("Unexpected options");
-  if (t.target !== void 0 && !sc[t.target])
+  if (t.target !== void 0 && !ac[t.target])
     throw new Error(`Unexpected target "${t.target}"`);
   const e = {
     // Sets the level of emulation rigor/strictness.
@@ -8769,16 +8785,16 @@ function Xo(t = {}) {
   };
   return e.target === "auto" && (e.target = ae.flagGroups ? "ES2025" : ae.unicodeSets ? "ES2024" : "ES2018"), e;
 }
-var ac = "[	-\r ]", ic = /* @__PURE__ */ new Set([
+var ic = "[	-\r ]", lc = /* @__PURE__ */ new Set([
   M(304),
   // İ
   M(305)
   // ı
 ]), re = v`[\p{L}\p{M}\p{N}\p{Pc}]`;
 function Ko(t) {
-  if (ic.has(t))
+  if (lc.has(t))
     return [t];
-  const e = /* @__PURE__ */ new Set(), n = t.toLowerCase(), r = n.toUpperCase(), o = cc.get(n), s = lc.get(n), a = uc.get(n);
+  const e = /* @__PURE__ */ new Set(), n = t.toLowerCase(), r = n.toUpperCase(), o = hc.get(n), s = uc.get(n), a = cc.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(
@@ -8873,12 +8889,12 @@ Variation_Selector VS
 White_Space space
 XID_Continue XIDC
 XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
-), lc = /* @__PURE__ */ new Map([
+), uc = /* @__PURE__ */ new Map([
   ["s", M(383)],
   // s, ſ
   [M(383), "s"]
   // ſ, s
-]), uc = /* @__PURE__ */ new Map([
+]), cc = /* @__PURE__ */ new Map([
   [M(223), M(7838)],
   // ß, ẞ
   [M(107), M(8490)],
@@ -8887,7 +8903,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   // å, Å (Angstrom)
   [M(969), M(8486)]
   // ω, Ω (Ohm)
-]), cc = new Map([
+]), hc = new Map([
   ie(453),
   ie(456),
   ie(459),
@@ -8898,7 +8914,7 @@ XID_Start XIDS`.split(/\s/).map((t) => [xt(t), t])
   ie(8124),
   ie(8140),
   ie(8188)
-]), hc = /* @__PURE__ */ new Map([
+]), fc = /* @__PURE__ */ new Map([
   ["alnum", v`[\p{Alpha}\p{Nd}]`],
   ["alpha", v`\p{Alpha}`],
   ["ascii", v`\p{ASCII}`],
@@ -8915,7 +8931,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 fc(t, e) {
+function pc(t, e) {
   const n = [];
   for (let r = t; r <= e; r++)
     n.push(r);
@@ -8926,7 +8942,7 @@ function ie(t) {
   return [e.toLowerCase(), e];
 }
 function Ft(t, e) {
-  return fc(t, e).map((n) => ie(n));
+  return pc(t, e).map((n) => ie(n));
 }
 var Yo = /* @__PURE__ */ new Set([
   "Lower",
@@ -8944,7 +8960,7 @@ var Yo = /* @__PURE__ */ new Set([
   // generally extreme edge cases and using such properties case insensitively generally produces
   // undesired behavior anyway
 ]);
-function pc(t, e) {
+function dc(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
@@ -8975,7 +8991,7 @@ function pc(t, e) {
     spaceIsAscii: t.flags.spaceIsAscii,
     wordIsAscii: t.flags.wordIsAscii
   };
-  Be(t, dc, r);
+  Be(t, gc, r);
   const o = {
     dotAll: t.flags.dotAll,
     ignoreCase: t.flags.ignoreCase
@@ -8990,16 +9006,16 @@ function pc(t, e) {
     reffedNodesByReferencer: /* @__PURE__ */ new Map(),
     subroutineRefMap: r.subroutineRefMap
   };
-  Be(t, gc, s);
+  Be(t, mc, s);
   const a = {
     groupsByName: s.groupsByName,
     highestOrphanBackref: 0,
     numCapturesToLeft: 0,
     reffedNodesByReferencer: s.reffedNodesByReferencer
   };
-  return Be(t, mc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
+  return Be(t, yc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
 }
-var dc = {
+var gc = {
   AbsenceFunction({ node: t, parent: e, replaceWith: n }) {
     const { body: r, kind: o } = t;
     if (o === "repeater") {
@@ -9035,7 +9051,7 @@ var dc = {
     }
   },
   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: p, wordIsAscii: d } = i;
+    const { kind: l, negate: u } = t, { asciiWordBoundaries: c, avoidSubclass: h, supportedGNodes: f, wordIsAscii: d } = i;
     if (l === "text_segment_boundary")
       throw new Error(`Unsupported text segment boundary "\\${u ? "Y" : "y"}"`);
     if (l === "line_end")
@@ -9047,11 +9063,11 @@ var dc = {
     else if (l === "line_start")
       a(P(oe(v`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), e));
     else if (l === "search_start")
-      if (p.has(t))
+      if (f.has(t))
         o.flags.sticky = !0, s();
       else {
-        const f = r[n - 1];
-        if (f && Sc(f))
+        const p = r[n - 1];
+        if (p && kc(p))
           a(P(pe({ negate: !0 }), e));
         else {
           if (h)
@@ -9063,8 +9079,8 @@ var dc = {
       a(P(oe(v`(?=\n?\z)`), e));
     else if (l === "word_boundary") {
       if (!d && !c) {
-        const f = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
-        a(P(oe(u ? g : f), e));
+        const p = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
+        a(P(oe(u ? g : p), e));
       }
     } else
       throw new Error(`Unexpected assertion kind "${l}"`);
@@ -9090,7 +9106,7 @@ var dc = {
       return;
     }
     if (a && (l === "space" || c === "space")) {
-      n(P(Ut(oe(ac), u), e));
+      n(P(Ut(oe(ic), u), e));
       return;
     }
     if (i && (l === "word" || c === "word")) {
@@ -9104,10 +9120,10 @@ var dc = {
     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})?", p = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
+      const h = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", f = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
       n(P(oe(
         // Close approximation of an extended grapheme cluster; see: <unicode.org/reports/tr29/>
-        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : p}|\P{M}\p{M}*)`,
+        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : f}|\P{M}\p{M}*)`,
         // Allow JS property `RGI_Emoji` through
         { skipPropertyNameValidation: !0 }
       ), e));
@@ -9128,7 +9144,7 @@ var dc = {
         }[c];
         u && (h = `\0-${M(h.codePointAt(0) - 1)}${M(h.codePointAt(2) + 1)}-􏿿`), n(P(oe(`[${h}]`), e));
       } else
-        n(P(Ut(oe(hc.get(c)), u), e));
+        n(P(Ut(oe(fc.get(c)), u), e));
     else if (l === "property")
       An.has(xt(c)) || (t.key = "sc");
     else if (l === "space")
@@ -9152,8 +9168,8 @@ var dc = {
       Fo(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 p = pe({ behind: !0 });
-      p.body[0].body = s(), o(P(p, e));
+      const f = pe({ behind: !0 });
+      f.body[0].body = s(), o(P(f, e));
     } else
       throw new Error(`Unexpected directive kind "${i}"`);
   },
@@ -9250,7 +9266,7 @@ var dc = {
     let { ref: n } = t;
     typeof n == "string" && !jt(n) && (n = Bt(n, e), t.ref = n);
   }
-}, gc = {
+}, mc = {
   Backreference({ node: t }, { multiplexCapturesToLeftByRef: e, reffedNodesByReferencer: n }) {
     const { orphan: r, ref: o } = t;
     r || n.set(t, [...e.get(o).map(({ node: s }) => s)]);
@@ -9277,13 +9293,13 @@ var dc = {
       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 p = c[h];
+        const f = c[h];
         if (
           // This group is from subroutine expansion, and there's a multiplex value from either the
           // origin node or a prior subroutine expansion group with the same origin
-          u === p.node || u && u === p.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
+          u === f.node || u && u === f.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
           // group that refers to this group
-          t === p.origin
+          t === f.origin
         ) {
           c.splice(h, 1);
           break;
@@ -9291,16 +9307,16 @@ var dc = {
       }
       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 p = !1;
+        let f = !1;
         if (u)
-          p = !0;
+          f = !0;
         else
           for (const d of h.values())
             if (!d.hasDuplicateNameToRemove) {
-              p = !0;
+              f = !0;
               break;
             }
-        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: p });
+        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: f });
       }
     },
     exit({ node: t }, { openRefs: e }) {
@@ -9330,23 +9346,23 @@ var dc = {
     );
     let u = l;
     if (!i) {
-      const c = Qo(wc(
+      const c = Qo(Cc(
         a,
-        (p) => p.type === "Group" && !!p.flags
+        (f) => f.type === "Group" && !!f.flags
       )), h = c ? bt(r.globalFlags, c) : r.globalFlags;
-      yc(h, r.currentFlags) || (u = Q({
-        flags: Cc(h)
+      bc(h, r.currentFlags) || (u = Q({
+        flags: _c(h)
       }), u.body[0].body.push(l));
     }
     n(P(u, e), { traverse: !i });
   }
-}, mc = {
+}, yc = {
   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) => bc(a, t));
+    const s = r.reffedNodesByReferencer.get(t).filter((a) => wc(a, t));
     if (!s.length)
       n(P(pe({ negate: !0 }), e));
     else if (s.length > 1) {
@@ -9383,10 +9399,10 @@ function Jo(t) {
     }
   });
 }
-function yc(t, e) {
+function bc(t, e) {
   return t.dotAll === e.dotAll && t.ignoreCase === e.ignoreCase;
 }
-function bc(t, e) {
+function wc(t, e) {
   let n = e;
   do {
     if (n.type === "Regex")
@@ -9415,7 +9431,7 @@ function vr(t) {
   const e = zo(t);
   return e.isRecursive = !0, e;
 }
-function wc(t, e) {
+function Cc(t, e) {
   const n = [];
   for (; t = t.parent; )
     (!e || e(t)) && n.push(t);
@@ -9435,7 +9451,7 @@ function Qo(t) {
     });
   }), Object.keys(n.enable).length || delete n.enable, Object.keys(n.disable).length || delete n.disable, n.enable || n.disable ? n : null;
 }
-function Cc({ dotAll: t, ignoreCase: e }) {
+function _c({ 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;
 }
@@ -9446,7 +9462,7 @@ function es(t) {
   return Array.isArray(e) ? e : e ? [e] : null;
 }
 function ts(t) {
-  const e = t.find((n) => n.kind === "search_start" || kc(n, { negate: !1 }) || !_c(n));
+  const e = t.find((n) => n.kind === "search_start" || vc(n, { negate: !1 }) || !Sc(n));
   if (!e)
     return null;
   if (e.kind === "search_start")
@@ -9472,10 +9488,10 @@ function ns(t, e) {
       return !0;
   return !1;
 }
-function _c({ type: t }) {
+function Sc({ type: t }) {
   return t === "Assertion" || t === "Directive" || t === "LookaroundAssertion";
 }
-function Sc(t) {
+function kc(t) {
   const e = [
     "Character",
     "CharacterClass",
@@ -9483,7 +9499,7 @@ function Sc(t) {
   ];
   return e.includes(t.type) || t.type === "Quantifier" && t.min && e.includes(t.body.type);
 }
-function kc(t, e) {
+function vc(t, e) {
   const n = {
     negate: null,
     ...e
@@ -9514,20 +9530,20 @@ function le(t, e) {
 function P(t, e) {
   return Jo(t), t.parent = e, t;
 }
-function vc(t, e) {
+function xc(t, e) {
   const n = Xo(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, xc, {
+    Be(t, Ec, {
       getCurrentModI: () => d.at(-1),
       popModI() {
         d.pop();
       },
-      pushModI(f) {
-        d.push(f);
+      pushModI(p) {
+        d.push(p);
       },
       setHasCasedChar() {
         d.at(-1) ? a = !0 : i = !0;
@@ -9561,19 +9577,19 @@ function vc(t, e) {
     verbose: n.verbose
   };
   function h(d) {
-    return c.lastNode = u, u = d, oc(Ec[d.type], `Unexpected node type "${d.type}"`)(d, c, h);
+    return c.lastNode = u, u = d, sc(Ac[d.type], `Unexpected node type "${d.type}"`)(d, c, h);
   }
-  const p = {
+  const f = {
     pattern: t.body.map(h).join("|"),
     // Could reset `lastNode` at this point via `lastNode = ast`, but it isn't needed by flags
     flags: h(t.flags),
     options: { ...t.options }
   };
-  return r || (delete 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;
+  return r || (delete f.options.force.v, f.options.disable.v = !0, f.options.unicodeSetsPlugin = null), f._captureTransfers = /* @__PURE__ */ new Map(), f._hiddenCaptures = [], c.captureMap.forEach((d, p) => {
+    d.hidden && f._hiddenCaptures.push(p), d.transferTo && Ve(f._captureTransfers, d.transferTo, []).push(p);
+  }), f;
 }
-var xc = {
+var Ec = {
   "*": {
     enter({ node: t }, e) {
       if (Er(t)) {
@@ -9599,7 +9615,7 @@ var xc = {
   CharacterSet({ node: t }, e) {
     t.kind === "property" && Yo.has(t.value) && e.setHasCasedChar();
   }
-}, Ec = {
+}, Ac = {
   /**
   @param {AlternativeNode} node
   */
@@ -9671,10 +9687,10 @@ var xc = {
           (h) => h.type === "CharacterClass" && h.kind === "union" && h.negate
         );
         if (c.length) {
-          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);
+          const h = Q(), f = h.body[0];
+          return h.parent = s, f.parent = h, a = a.filter((d) => !c.includes(d)), t.body = a, a.length ? (t.parent = f, f.body.push(t)) : h.body.pop(), c.forEach((d) => {
+            const p = me({ body: [d] });
+            d.parent = p, p.parent = h, h.body.push(p);
           }), n(h);
         }
       }
@@ -9705,7 +9721,7 @@ var xc = {
     }, s = _e(n, o), a = _e(r, o), i = /* @__PURE__ */ new Set();
     if (e.useAppliedIgnoreCase && e.currentFlags.ignoreCase) {
       const l = rs(t);
-      Lc(l).forEach((c) => {
+      Pc(l).forEach((c) => {
         i.add(
           Array.isArray(c) ? `${_e(c[0], o)}-${_e(c[1], o)}` : _e(c, o)
         );
@@ -9753,7 +9769,7 @@ var xc = {
     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 : `(?${Pc(t, n, o.useFlagMods)}${i})`;
+    r.type !== "Quantifier" && !t && (!o.useFlagMods || !n) ? i : `(?${$c(t, n, o.useFlagMods)}${i})`;
     return o.currentFlags = a, l;
   },
   /**
@@ -9766,7 +9782,7 @@ var xc = {
   @param {QuantifierNode} node
   */
   Quantifier(t, e, n) {
-    return n(t.body) + $c(t);
+    return n(t.body) + Tc(t);
   },
   /**
   @param {SubroutineNode & {isRecursive: true}} node
@@ -9777,7 +9793,7 @@ var xc = {
     const r = n.recursionLimit;
     return e === 0 ? `(?R=${r})` : v`\g<${e}&R=${r}>`;
   }
-}, Ac = /* @__PURE__ */ new Set([
+}, Rc = /* @__PURE__ */ new Set([
   "$",
   "(",
   ")",
@@ -9792,7 +9808,7 @@ var xc = {
   "{",
   "|",
   "}"
-]), Rc = /* @__PURE__ */ new Set([
+]), Ic = /* @__PURE__ */ new Set([
   "-",
   "\\",
   "]",
@@ -9800,7 +9816,7 @@ var xc = {
   // 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
   "["
-]), Ic = /* @__PURE__ */ new Set([
+]), Nc = /* @__PURE__ */ new Set([
   "(",
   ")",
   "-",
@@ -9848,9 +9864,9 @@ var xc = {
   // paragraph separator
   [65279, v`\uFEFF`]
   // ZWNBSP/BOM
-]), Nc = /^\p{Cased}$/u;
+]), Lc = /^\p{Cased}$/u;
 function Rn(t) {
-  return Nc.test(t);
+  return Lc.test(t);
 }
 function rs(t, e) {
   const n = !!e?.firstOnly, r = t.min.value, o = t.max.value, s = [];
@@ -9876,20 +9892,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 && Tc(t)
+    e && Mc(t)
   )
     return t > 255 ? `\\u{${t.toString(16).toUpperCase()}}` : `\\x${t.toString(16).toUpperCase().padStart(2, "0")}`;
-  const o = n ? r ? Ic : Rc : Ac, s = M(t);
+  const o = n ? r ? Nc : Ic : Rc, s = M(t);
   return (o.has(s) ? "\\" : "") + s;
 }
-function Lc(t) {
+function Pc(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 Pc(t, e, n) {
+function $c(t, e, n) {
   if (t)
     return ">";
   let r = "";
@@ -9899,7 +9915,7 @@ function Pc(t, e, n) {
   }
   return `${r}:`;
 }
-function $c({ kind: t, max: e, min: n }) {
+function Tc({ kind: t, max: e, min: n }) {
   let r;
   return !n && e === 1 ? r = "?" : !n && e === 1 / 0 ? r = "*" : n === 1 && e === 1 / 0 ? r = "+" : n === e ? r = `{${n}}` : r = `{${n},${e === 1 / 0 ? "" : e}}`, r + {
     greedy: "",
@@ -9910,13 +9926,13 @@ function $c({ kind: t, max: e, min: n }) {
 function Er({ type: t }) {
   return t === "CapturingGroup" || t === "Group" || t === "LookaroundAssertion";
 }
-function Tc(t) {
+function Mc(t) {
   return t > 47 && t < 58;
 }
 function Ar({ type: t, value: e }) {
   return t === "Character" && e === 45;
 }
-var Mc = class cn extends RegExp {
+var Oc = class cn extends RegExp {
   /**
   @type {Map<number, {
     hidden?: true;
@@ -9974,7 +9990,7 @@ var Mc = class cn extends RegExp {
         transfers: [],
         ...r
       };
-      super(o ? "" : e, n), this.#r = e, this.#t = Dc(s.hiddenCaptures, s.transfers), this.#o = s.strategy, this.rawOptions = r ?? {};
+      super(o ? "" : e, n), this.#r = e, this.#t = Gc(s.hiddenCaptures, s.transfers), this.#o = s.strategy, this.rawOptions = r ?? {};
     }
     o || (this.#e = this);
   }
@@ -9993,7 +10009,7 @@ var Mc = class cn extends RegExp {
     if (this.#o === "clip_search" && n && r) {
       this.lastIndex = 0;
       const o = this.#s(e.slice(r));
-      return o && (Oc(o, r, e, this.hasIndices), this.lastIndex += r), o;
+      return o && (Dc(o, r, e, this.hasIndices), this.lastIndex += r), o;
     }
     return this.#s(e);
   }
@@ -10019,7 +10035,7 @@ var Mc = 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 = Gc(this.source));
+          this.#n || (this.#n = Fc(this.source));
           const c = this.#n.get(l);
           c && (n.groups[c] = r[a], this.hasIndices && (n.indices.groups[c] = o[a]));
         }
@@ -10028,7 +10044,7 @@ var Mc = class cn extends RegExp {
     return n;
   }
 };
-function Oc(t, e, n, r) {
+function Dc(t, e, n, r) {
   if (t.index += e, t.input = n, r) {
     const o = t.indices;
     for (let a = 0; a < o.length; a++) {
@@ -10042,7 +10058,7 @@ function Oc(t, e, n, r) {
     });
   }
 }
-function Dc(t, e) {
+function Gc(t, e) {
   const n = /* @__PURE__ */ new Map();
   for (const r of t)
     n.set(r, {
@@ -10053,7 +10069,7 @@ function Dc(t, e) {
       Ve(n, s, {}).transferTo = r;
   return n;
 }
-function Gc(t) {
+function Fc(t) {
   const e = /(?<capture>\((?:\?<(?![=!])(?<name>[^>]+)>|(?!\?)))|\\?./gsu, n = /* @__PURE__ */ new Map();
   let r = 0, o = 0, s;
   for (; s = e.exec(t); ) {
@@ -10062,11 +10078,11 @@ function Gc(t) {
   }
   return n;
 }
-function Fc(t, e) {
-  const n = Bc(t, e);
-  return n.options ? new Mc(n.pattern, n.flags, n.options) : new RegExp(n.pattern, n.flags);
-}
 function Bc(t, e) {
+  const n = jc(t, e);
+  return n.options ? new Oc(n.pattern, n.flags, n.options) : new RegExp(n.pattern, n.flags);
+}
+function jc(t, e) {
   const n = Xo(e), r = Bo(t, {
     flags: n.flags,
     normalizeUnknownPropertyNames: !0,
@@ -10076,16 +10092,16 @@ function Bc(t, e) {
     },
     skipBackrefValidation: n.rules.allowOrphanBackrefs,
     unicodePropertyMap: An
-  }), o = pc(r, {
+  }), o = dc(r, {
     accuracy: n.accuracy,
     asciiWordBoundaries: n.rules.asciiWordBoundaries,
     avoidSubclass: n.avoidSubclass,
     bestEffortTarget: n.target
-  }), s = vc(o, n), a = nc(s.pattern, {
+  }), s = xc(o, n), a = rc(s.pattern, {
     captureTransfers: s._captureTransfers,
     hiddenCaptures: s._hiddenCaptures,
     mode: "external"
-  }), i = ec(a.pattern), l = Qu(i.pattern, {
+  }), i = tc(a.pattern), l = ec(i.pattern, {
     captureTransfers: a.captureTransfers,
     hiddenCaptures: a.hiddenCaptures
   }), u = {
@@ -10096,18 +10112,18 @@ function Bc(t, e) {
     if (n.lazyCompileLength !== 1 / 0)
       throw new Error("Lazy compilation requires subclass");
   } else {
-    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 = {
+    const c = l.hiddenCaptures.sort((p, g) => p - g), h = Array.from(l.captureTransfers), f = o._strategy, d = u.pattern.length >= n.lazyCompileLength;
+    (c.length || h.length || f || d) && (u.options = {
       ...c.length && { hiddenCaptures: c },
       ...h.length && { transfers: h },
-      ...p && { strategy: p },
+      ...f && { strategy: f },
       ...d && { lazyCompile: d }
     });
   }
   return u;
 }
 const Rr = 4294967295;
-class jc {
+class Uc {
   constructor(e, n = {}) {
     this.patterns = e, this.options = n;
     const {
@@ -10181,8 +10197,8 @@ class jc {
     return null;
   }
 }
-function Uc(t, e) {
-  return Fc(
+function zc(t, e) {
+  return Bc(
     t,
     {
       global: !0,
@@ -10208,7 +10224,7 @@ function Uc(t, e) {
     }
   );
 }
-function zc(t = {}) {
+function Hc(t = {}) {
   const e = Object.assign(
     {
       target: "auto",
@@ -10216,9 +10232,9 @@ function zc(t = {}) {
     },
     t
   );
-  return e.regexConstructor ||= (n) => Uc(n, { target: e.target }), {
+  return e.regexConstructor ||= (n) => zc(n, { target: e.target }), {
     createScanner(n) {
-      return new jc(n, e);
+      return new Uc(n, e);
     },
     createString(n) {
       return {
@@ -10227,8 +10243,8 @@ function zc(t = {}) {
     }
   };
 }
-const Hc = "overflow-x-auto scrollbar not-inline", Wc = zc({ forgiving: !0 }), Vc = await ql({
-  engine: Wc,
+const Wc = "overflow-x-auto scrollbar not-inline", Vc = Hc({ forgiving: !0 }), qc = await Xl({
+  engine: Vc,
   langAlias: {
     markup: "html",
     svg: "xml",
@@ -10248,7 +10264,7 @@ const Hc = "overflow-x-auto scrollbar not-inline", Wc = zc({ forgiving: !0 }), V
   fallbackLanguage: "text",
   inline: "tailing-curly-colon",
   addLanguageClass: !0,
-  transformers: [eu(), nu()],
+  transformers: [tu(), ru()],
   parseMetaString: (t) => {
     const e = t.matchAll(
       /([a-z0-9]+)(?:=(["'])(.*?)\2|=(.*?)(?:\s|$)|(?:\s|$))/gi
@@ -10260,7 +10276,7 @@ const Hc = "overflow-x-auto scrollbar not-inline", Wc = zc({ forgiving: !0 }), V
       })
     );
   }
-}, qc = () => (t) => {
+}, Xc = () => (t) => {
   Xr(t, "element", (e, n, r) => {
     if (e.tagName !== "code") return;
     const o = r?.type === "element" && r.tagName === "pre";
@@ -10270,14 +10286,14 @@ const Hc = "overflow-x-auto scrollbar not-inline", Wc = zc({ forgiving: !0 }), V
       class: Ir(e.properties.class, r.properties.class)
     }, r.properties = {});
   });
-}, ph = (t = wt.themes, e = Vc) => [
+}, dh = (t = wt.themes, e = qc) => [
   [
-    Zl,
+    Ql,
     e,
     { ...wt, themes: t }
   ],
-  qc
-], Xc = (t, e, n = "text", r = wt.themes) => {
+  Xc
+], Kc = (t, e, n = "text", r = wt.themes) => {
   const o = t.codeToHast(e, {
     lang: n,
     ...wt,
@@ -10290,15 +10306,15 @@ const Hc = "overflow-x-auto scrollbar not-inline", Wc = zc({ forgiving: !0 }), V
     components: {
       code: (s) => os("code", {
         ...s,
-        className: Ir(s.className, Hc)
+        className: Ir(s.className, Wc)
       })
     }
   });
-}, Kc = as(
+}, Yc = as(
   ({ code: t, children: e, embedded: n, ...r }) => {
     const { syntaxHighlighting: o } = is().options;
     us(o?.highlighter, "Highlighter not found");
-    const s = Xc(
+    const s = Kc(
       o.highlighter,
       t ?? e,
       r.language,
@@ -10307,30 +10323,30 @@ const Hc = "overflow-x-auto scrollbar not-inline", Wc = zc({ forgiving: !0 }), V
     return n ? /* @__PURE__ */ at.jsx(hs, { ...r, children: s }) : /* @__PURE__ */ at.jsx(cs, { ...r, children: s });
   }
 );
-Kc.displayName = "SyntaxHighlight";
+Yc.displayName = "SyntaxHighlight";
 export {
   Fn as E,
-  Hc as H,
-  Kc as S,
+  Wc as H,
+  Yc as S,
   H as V,
   Ps as a,
-  ch as b,
-  uh as c,
-  sh as d,
+  hh as b,
+  ch as c,
+  ah as d,
   Nr as e,
   Fr as f,
   Vr as g,
   ca as h,
   ia as i,
   jn as j,
-  ph as k,
-  Xc as l,
-  rh as o,
+  dh as k,
+  Kc as l,
+  oh as o,
   Br as p,
   $s as s,
   Gs as t,
-  oh as u,
+  sh as u,
   Xr as v,
   ua as z
 };
-//# sourceMappingURL=SyntaxHighlight-zvlnSnHB.js.map
+//# sourceMappingURL=SyntaxHighlight-C19vH0V_.js.map