zudoku 0.55.1 → 0.57.0

package/lib/{SyntaxHighlight-BD_Z_Csq.js → SyntaxHighlight-GR0eix_L.js}

@@ -1,9 +1,9 @@
 import { j as at } from "./jsx-runtime-C5mzlN2N.js";
 import { Fragment as rs, memo as os } from "react";
-import { c as ss } from "./ZudokuContext-Coxa0DfE.js";
+import { d as ss } from "./ZudokuContext-BuJD7yIX.js";
 import { c as as } from "./cn-dYga0KKN.js";
 import { g as is, i as ls } from "./invariant-Bm-FVUQE.js";
-import { C as us } from "./CodeBlock-CVT6z0PP.js";
+import { C as us } from "./CodeBlock-yJjjRwj-.js";
 import { EmbeddedCodeBlock as cs } from "./ui/EmbeddedCodeBlock.js";
 function eh() {
 }
@@ -25,9 +25,9 @@ function Ir(t, e) {
     (n.padRight ? " " : "") + "," + (n.padLeft === !1 ? "" : " ")
   ).trim();
 }
-const hs = /^[$_\p{ID_Start}][$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, ps = /^[$_\p{ID_Start}][-$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, fs = {};
+const hs = /^[$_\p{ID_Start}][$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, fs = /^[$_\p{ID_Start}][-$_\u{200C}\u{200D}\p{ID_Continue}]*$/u, ps = {};
 function In(t, e) {
-  return (fs.jsx ? ps : hs).test(t);
+  return (ps.jsx ? fs : hs).test(t);
 }
 const ds = /[ \t\n\f\r]/g;
 function Ct(t) {
@@ -1198,7 +1198,7 @@ function Ss(t) {
 function ks(t) {
   return t.charAt(1).toUpperCase();
 }
-const vs = Nr([Pr, ms, Mr, Or, Dr], "html"), pn = Nr([Pr, ys, Mr, Or, Dr], "svg");
+const vs = Nr([Pr, ms, Mr, Or, Dr], "html"), fn = Nr([Pr, ys, Mr, Or, Dr], "svg");
 function ah(t) {
   const e = String(t || "").trim();
   return e ? e.split(/[ \t\n\r\f]+/g) : [];
@@ -1211,7 +1211,7 @@ function xs() {
   if ($n) return Rt;
   $n = 1;
   var t = /\/\*[^*]*\*+([^/*][^*]*\*+)*\//g, e = /\n/g, n = /^\s*/, r = /^(\*?[-#/*\\\w]+(\[[0-9a-z_-]+\])?)\s*/, o = /^:\s*/, s = /^((?:'(?:\\'|.)*?'|"(?:\\"|.)*?"|\([^)]*?\)|[^};])+)/, a = /^[;\s]*/, i = /^\s+|\s+$/g, l = `
-`, u = "/", c = "*", h = "", f = "comment", d = "declaration";
+`, u = "/", c = "*", h = "", p = "comment", d = "declaration";
   Rt = function(g, C) {
     if (typeof g != "string")
       throw new TypeError("First argument must be a string");
@@ -1265,7 +1265,7 @@ function xs() {
           return D("End of comment missing");
         var G = g.slice(2, k - 2);
         return m += 2, _(G), g = g.slice(k), m += 2, R({
-          type: f,
+          type: p,
           comment: G
         });
       }
@@ -1276,8 +1276,8 @@ function xs() {
         if (ee(), !L(o)) return D("property missing ':'");
         var G = L(s), Te = R({
           type: d,
-          property: p(k[0].replace(t, h)),
-          value: G ? p(G[0].replace(t, h)) : h
+          property: f(k[0].replace(t, h)),
+          value: G ? f(G[0].replace(t, h)) : h
         });
         return L(a), Te;
       }
@@ -1291,7 +1291,7 @@ function xs() {
     }
     return j(), te();
   };
-  function p(g) {
+  function f(g) {
     return g ? g.replace(i, h) : h;
   }
   return Rt;
@@ -1467,7 +1467,7 @@ H.prototype.fatal = void 0;
 H.prototype.place = void 0;
 H.prototype.ruleId = void 0;
 H.prototype.source = void 0;
-const fn = {}.hasOwnProperty, $s = /* @__PURE__ */ new Map(), Ts = /[A-Z]/g, Ms = /* @__PURE__ */ new Set(["table", "tbody", "thead", "tfoot", "tr"]), Os = /* @__PURE__ */ new Set(["td", "th"]), jr = "https://github.com/syntax-tree/hast-util-to-jsx-runtime";
+const pn = {}.hasOwnProperty, $s = /* @__PURE__ */ new Map(), Ts = /[A-Z]/g, Ms = /* @__PURE__ */ new Set(["table", "tbody", "thead", "tfoot", "tr"]), Os = /* @__PURE__ */ new Set(["td", "th"]), jr = "https://github.com/syntax-tree/hast-util-to-jsx-runtime";
 function Ds(t, e) {
   if (!e || e.Fragment === void 0)
     throw new TypeError("Expected `Fragment` in options");
@@ -1497,7 +1497,7 @@ function Ds(t, e) {
     ignoreInvalidStyle: e.ignoreInvalidStyle || !1,
     passKeys: e.passKeys !== !1,
     passNode: e.passNode || !1,
-    schema: e.space === "svg" ? pn : vs,
+    schema: e.space === "svg" ? fn : vs,
     stylePropertyNameCase: e.stylePropertyNameCase || "dom",
     tableCellAlignToStyle: e.tableCellAlignToStyle !== !1
   }, s = Ur(o, t, void 0);
@@ -1525,7 +1525,7 @@ function Ur(t, e, n) {
 function Gs(t, e, n) {
   const r = t.schema;
   let o = r;
-  e.tagName.toLowerCase() === "svg" && r.space === "html" && (o = pn, t.schema = o), t.ancestors.push(e);
+  e.tagName.toLowerCase() === "svg" && r.space === "html" && (o = fn, t.schema = o), t.ancestors.push(e);
   const s = Hr(t, e.tagName, !1), a = Vs(t, e);
   let i = gn(t, e);
   return Ms.has(e.tagName) && (i = i.filter(function(l) {
@@ -1551,7 +1551,7 @@ function Bs(t, e) {
 function js(t, e, n) {
   const r = t.schema;
   let o = r;
-  e.name === "svg" && r.space === "html" && (o = pn, t.schema = o), t.ancestors.push(e);
+  e.name === "svg" && r.space === "html" && (o = fn, t.schema = o), t.ancestors.push(e);
   const s = e.name === null ? t.Fragment : Hr(t, e.name, !0), a = qs(t, e), i = gn(t, e);
   return zr(t, a, s, e), dn(a, i), t.ancestors.pop(), t.schema = r, t.create(e, s, a, n);
 }
@@ -1600,7 +1600,7 @@ function Vs(t, e) {
   const n = {};
   let r, o;
   for (o in e.properties)
-    if (o !== "children" && fn.call(e.properties, o)) {
+    if (o !== "children" && pn.call(e.properties, o)) {
       const s = Xs(t, o, e.properties[o]);
       if (s) {
         const [a, i] = s;
@@ -1723,7 +1723,7 @@ function Hr(t, e, n) {
       /** @type {string | number} */
       r.value
     );
-    return fn.call(t.components, o) ? t.components[o] : o;
+    return pn.call(t.components, o) ? t.components[o] : o;
   }
   if (t.evaluater)
     return t.evaluater.evaluateExpression(r);
@@ -1745,7 +1745,7 @@ function Ys(t) {
   const e = {};
   let n;
   for (n in t)
-    fn.call(t, n) && (e[Js(n)] = t[n]);
+    pn.call(t, n) && (e[Js(n)] = t[n]);
   return e;
 }
 function Js(t) {
@@ -1855,13 +1855,13 @@ function aa(t, e, n, r) {
           typeof h.name == "string" ? h.name : void 0
         )
       );
-      Object.defineProperty(f, "name", {
+      Object.defineProperty(p, "name", {
         value: "node (" + (l.type + (d ? "<" + d + ">" : "")) + ")"
       });
     }
-    return f;
-    function f() {
-      let d = Vr, p, g, C;
+    return p;
+    function p() {
+      let d = Vr, f, g, C;
       if ((!e || s(l, u, c[c.length - 1] || void 0)) && (d = ia(n(l, c)), d[0] === Fn))
         return d;
       if ("children" in l && l.children) {
@@ -1872,9 +1872,9 @@ function aa(t, e, n, r) {
         if (y.children && d[0] !== sa)
           for (g = (r ? y.children.length : -1) + a, C = c.concat(y); g > -1 && g < y.children.length; ) {
             const m = y.children[g];
-            if (p = i(m, g, C)(), p[0] === Fn)
-              return p;
-            g = typeof p[1] == "number" ? p[1] : g + a;
+            if (f = i(m, g, C)(), f[0] === Fn)
+              return f;
+            g = typeof f[1] == "number" ? f[1] : g + a;
           }
       }
       return d;
@@ -1947,7 +1947,7 @@ function ca(t) {
   return mn(t);
 }
 function mn(t) {
-  return Array.isArray(t) ? ha(t) : t instanceof RegExp ? t : typeof t == "object" ? pa(t) : t;
+  return Array.isArray(t) ? ha(t) : t instanceof RegExp ? t : typeof t == "object" ? fa(t) : t;
 }
 function ha(t) {
   let e = [];
@@ -1955,7 +1955,7 @@ function ha(t) {
     e[n] = mn(t[n]);
   return e;
 }
-function pa(t) {
+function fa(t) {
   let e = {};
   for (let n in t)
     e[n] = mn(t[n]);
@@ -2056,7 +2056,7 @@ var Qr = class {
     if (t === null)
       return this._defaults;
     const e = t.scopeName, r = this._cachedMatchRoot.get(e).find(
-      (o) => fa(t.parent, o.parentScopes)
+      (o) => pa(t.parent, o.parentScopes)
     );
     return r ? new eo(
       r.fontStyle,
@@ -2103,7 +2103,7 @@ var Qr = class {
     return r === e ? n.reverse() : void 0;
   }
 };
-function fa(t, e) {
+function pa(t, e) {
   if (e.length === 0)
     return !0;
   for (let n = 0; n < e.length; n++) {
@@ -2151,8 +2151,8 @@ function ga(t) {
     if (typeof a.settings.fontStyle == "string") {
       l = 0;
       let h = a.settings.fontStyle.split(" ");
-      for (let f = 0, d = h.length; f < d; f++)
-        switch (h[f]) {
+      for (let p = 0, d = h.length; p < d; p++)
+        switch (h[p]) {
           case "italic":
             l = l | 1;
             break;
@@ -2171,9 +2171,9 @@ function ga(t) {
     typeof a.settings.foreground == "string" && Un(a.settings.foreground) && (u = a.settings.foreground);
     let c = null;
     typeof a.settings.background == "string" && Un(a.settings.background) && (c = a.settings.background);
-    for (let h = 0, f = i.length; h < f; h++) {
-      let p = i[h].trim().split(" "), g = p[p.length - 1], C = null;
-      p.length > 1 && (C = p.slice(0, p.length - 1), C.reverse()), n[r++] = new ma(
+    for (let h = 0, p = i.length; h < p; h++) {
+      let f = i[h].trim().split(" "), g = f[f.length - 1], C = null;
+      f.length > 1 && (C = f.slice(0, f.length - 1), C.reverse()), n[r++] = new ma(
         g,
         C,
         o,
@@ -2342,8 +2342,8 @@ var ba = class {
    * A value of `0`, `NotSet` or `null` indicates that the corresponding field should be left as is.
    */
   static set(e, n, r, o, s, a, i) {
-    let l = K.getLanguageId(e), u = K.getTokenType(e), c = K.containsBalancedBrackets(e) ? 1 : 0, h = K.getFontStyle(e), f = K.getForeground(e), d = K.getBackground(e);
-    return n !== 0 && (l = n), r !== 8 && (u = r), o !== null && (c = o ? 1 : 0), s !== -1 && (h = s), a !== 0 && (f = a), i !== 0 && (d = i), (l << 0 | u << 8 | c << 10 | h << 11 | f << 15 | d << 24) >>> 0;
+    let l = K.getLanguageId(e), u = K.getTokenType(e), c = K.containsBalancedBrackets(e) ? 1 : 0, h = K.getFontStyle(e), p = K.getForeground(e), d = K.getBackground(e);
+    return n !== 0 && (l = n), r !== 8 && (u = r), o !== null && (c = o ? 1 : 0), s !== -1 && (h = s), a !== 0 && (p = a), i !== 0 && (d = i), (l << 0 | u << 8 | c << 10 | h << 11 | p << 15 | d << 24) >>> 0;
   }
 };
 function lt(t, e) {
@@ -2848,11 +2848,11 @@ var Xe = class {
               break;
             case 3:
             case 4:
-              const h = u.scopeName, f = u.kind === 4 ? u.ruleName : null, d = n.getExternalGrammar(h, r);
+              const h = u.scopeName, p = u.kind === 4 ? u.ruleName : null, d = n.getExternalGrammar(h, r);
               if (d)
-                if (f) {
-                  let p = d.repository[f];
-                  p && (l = U.getCompiledRuleId(p, n, d.repository));
+                if (p) {
+                  let f = d.repository[p];
+                  f && (l = U.getCompiledRuleId(f, n, d.repository));
                 } else
                   l = U.getCompiledRuleId(d.repository.$self, n, d.repository);
               break;
@@ -3085,10 +3085,10 @@ function io(t, e, n, r, o, s, a, i) {
   for (; !u; ) {
     if (i !== 0 && Date.now() - h > i)
       return new qn(o, !0);
-    f();
+    p();
   }
   return new qn(o, !1);
-  function f() {
+  function p() {
     const d = Ga(
       t,
       e,
@@ -3101,18 +3101,18 @@ function io(t, e, n, r, o, s, a, i) {
       s.produce(o, l), u = !0;
       return;
     }
-    const p = d.captureIndices, g = d.matchedRuleId, C = p && p.length > 0 ? p[0].end > r : !1;
+    const f = d.captureIndices, g = d.matchedRuleId, C = f && f.length > 0 ? f[0].end > r : !1;
     if (g === Pa) {
       const y = o.getRule(t);
-      s.produce(o, p[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
+      s.produce(o, f[0].start), o = o.withContentNameScopesList(o.nameScopesList), Ge(
         t,
         e,
         n,
         o,
         s,
         y.endCaptures,
-        p
-      ), s.produce(o, p[0].end);
+        f
+      ), s.produce(o, f[0].end);
       const m = o;
       if (o = o.parent, c = m.getAnchorPos(), !C && m.getEnterPos() === r) {
         o = m, s.produce(o, l), u = !0;
@@ -3120,8 +3120,8 @@ function io(t, e, n, r, o, s, a, i) {
       }
     } else {
       const y = t.getRule(g);
-      s.produce(o, p[0].start);
-      const m = o, _ = y.getName(e.content, p), S = o.contentNameScopesList.pushAttributed(
+      s.produce(o, f[0].start);
+      const m = o, _ = y.getName(e.content, f), S = o.contentNameScopesList.pushAttributed(
         _,
         t
       );
@@ -3129,7 +3129,7 @@ function io(t, e, n, r, o, s, a, i) {
         g,
         r,
         c,
-        p[0].end === l,
+        f[0].end === l,
         null,
         S,
         S
@@ -3142,11 +3142,11 @@ function io(t, e, n, r, o, s, a, i) {
           o,
           s,
           A.beginCaptures,
-          p
-        ), s.produce(o, p[0].end), c = p[0].end;
+          f
+        ), s.produce(o, f[0].end), c = f[0].end;
         const D = A.getContentName(
           e.content,
-          p
+          f
         ), L = S.pushAttributed(
           D,
           t
@@ -3154,7 +3154,7 @@ function io(t, e, n, r, o, s, a, i) {
         if (o = o.withContentNameScopesList(L), A.endHasBackReferences && (o = o.withEndRule(
           A.getEndWithResolvedBackReferences(
             e.content,
-            p
+            f
           )
         )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
@@ -3169,11 +3169,11 @@ function io(t, e, n, r, o, s, a, i) {
           o,
           s,
           A.beginCaptures,
-          p
-        ), s.produce(o, p[0].end), c = p[0].end;
+          f
+        ), s.produce(o, f[0].end), c = f[0].end;
         const D = A.getContentName(
           e.content,
-          p
+          f
         ), L = S.pushAttributed(
           D,
           t
@@ -3181,7 +3181,7 @@ function io(t, e, n, r, o, s, a, i) {
         if (o = o.withContentNameScopesList(L), A.whileHasBackReferences && (o = o.withEndRule(
           A.getWhileWithResolvedBackReferences(
             e.content,
-            p
+            f
           )
         )), !C && m.hasSameRuleAs(o)) {
           o = o.pop(), s.produce(o, l), u = !0;
@@ -3194,13 +3194,13 @@ function io(t, e, n, r, o, s, a, i) {
         o,
         s,
         y.captures,
-        p
-      ), s.produce(o, p[0].end), o = o.pop(), !C) {
+        f
+      ), s.produce(o, f[0].end), o = o.pop(), !C) {
         o = o.safePop(), s.produce(o, l), u = !0;
         return;
       }
     }
-    p[0].end > r && (r = p[0].end, n = !1);
+    f[0].end > r && (r = f[0].end, n = !1);
   }
 }
 function Da(t, e, n, r, o, s) {
@@ -3250,15 +3250,15 @@ function Fa(t, e, n, r, o, s) {
 function Ba(t, e, n, r, o, s, a) {
   let i = Number.MAX_VALUE, l = null, u, c = 0;
   const h = s.contentNameScopesList.getScopeNames();
-  for (let f = 0, d = t.length; f < d; f++) {
-    const p = t[f];
-    if (!p.matcher(h))
+  for (let p = 0, d = t.length; p < d; p++) {
+    const f = t[p];
+    if (!f.matcher(h))
       continue;
-    const g = e.getRule(p.ruleId), { ruleScanner: C, findOptions: y } = lo(g, e, null, r, o === a), m = C.findNextMatchSync(n, o, y);
+    const g = e.getRule(f.ruleId), { ruleScanner: C, findOptions: y } = lo(g, e, null, r, o === a), m = C.findNextMatchSync(n, o, y);
     if (!m)
       continue;
     const _ = m.captureIndices[0].start;
-    if (!(_ >= i) && (i = _, l = m.captureIndices, u = m.ruleId, c = p.priority, i === o))
+    if (!(_ >= i) && (i = _, l = m.captureIndices, u = m.ruleId, c = f.priority, i === o))
       break;
   }
   return l ? {
@@ -3286,8 +3286,8 @@ function Ge(t, e, n, r, o, s, a) {
     return;
   const i = e.content, l = Math.min(s.length, a.length), u = [], c = a[0].end;
   for (let h = 0; h < l; h++) {
-    const f = s[h];
-    if (f === null)
+    const p = s[h];
+    if (p === null)
       continue;
     const d = a[h];
     if (d.length === 0)
@@ -3296,8 +3296,8 @@ function Ge(t, e, n, r, o, s, a) {
       break;
     for (; u.length > 0 && u[u.length - 1].endPos <= d.start; )
       o.produceFromScopes(u[u.length - 1].scopes, u[u.length - 1].endPos), u.pop();
-    if (u.length > 0 ? o.produceFromScopes(u[u.length - 1].scopes, d.start) : o.produce(r, d.start), f.retokenizeCapturedWithRuleId) {
-      const g = f.getName(i, a), C = r.contentNameScopesList.pushAttributed(g, t), y = f.getContentName(i, a), m = C.pushAttributed(y, t), _ = r.push(f.retokenizeCapturedWithRuleId, d.start, -1, !1, null, C, m), S = t.createOnigString(i.substring(0, d.end));
+    if (u.length > 0 ? o.produceFromScopes(u[u.length - 1].scopes, d.start) : o.produce(r, d.start), p.retokenizeCapturedWithRuleId) {
+      const g = p.getName(i, a), C = r.contentNameScopesList.pushAttributed(g, t), y = p.getContentName(i, a), m = C.pushAttributed(y, t), _ = r.push(p.retokenizeCapturedWithRuleId, d.start, -1, !1, null, C, m), S = t.createOnigString(i.substring(0, d.end));
       io(
         t,
         S,
@@ -3311,9 +3311,9 @@ function Ge(t, e, n, r, o, s, a) {
       ), no(S);
       continue;
     }
-    const p = f.getName(i, a);
-    if (p !== null) {
-      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(p, t);
+    const f = p.getName(i, a);
+    if (f !== null) {
+      const C = (u.length > 0 ? u[u.length - 1].scopes : r.contentNameScopesList).pushAttributed(f, t);
       u.push(new Ua(C, d.end));
     }
   }
@@ -3497,13 +3497,13 @@ var Wa = class {
         c.fontStyle,
         c.foregroundId,
         c.backgroundId
-      ), f = this.getRule(this._rootId).getName(
+      ), p = this.getRule(this._rootId).getName(
         null,
         null
       );
       let d;
-      f ? d = Fe.createRootAndLookUpScopeName(
-        f,
+      p ? d = Fe.createRootAndLookUpScopeName(
+        p,
         h,
         this
       ) : d = Fe.createRoot(
@@ -3644,7 +3644,7 @@ var Fe = class ne {
       }), r = r.parent;
     return r === e ? n.reverse() : void 0;
   }
-}, Jt = class pe {
+}, Jt = class fe {
   /**
    * Invariant:
    * ```
@@ -3661,7 +3661,7 @@ var Fe = class ne {
   }
   _stackElementBrand = void 0;
   // TODO remove me
-  static NULL = new pe(
+  static NULL = new fe(
     null,
     0,
     0,
@@ -3688,7 +3688,7 @@ var Fe = class ne {
    */
   depth;
   equals(e) {
-    return e === null ? !1 : pe._equals(this, e);
+    return e === null ? !1 : fe._equals(this, e);
   }
   static _equals(e, n) {
     return e === n ? !0 : this._structuralEquals(e, n) ? Fe.equals(e.contentNameScopesList, n.contentNameScopesList) : !1;
@@ -3713,7 +3713,7 @@ var Fe = class ne {
       e._enterPos = -1, e._anchorPos = -1, e = e.parent;
   }
   reset() {
-    pe._reset(this);
+    fe._reset(this);
   }
   pop() {
     return this.parent;
@@ -3722,7 +3722,7 @@ var Fe = class ne {
     return this.parent ? this.parent : this;
   }
   push(e, n, r, o, s, a, i) {
-    return new pe(
+    return new fe(
       this,
       e,
       n,
@@ -3761,7 +3761,7 @@ var Fe = class ne {
     );
   }
   withEndRule(e) {
-    return this.endRule === e ? this : new pe(
+    return this.endRule === e ? this : new fe(
       this.parent,
       this.ruleId,
       this._enterPos,
@@ -3793,7 +3793,7 @@ var Fe = class ne {
   }
   static pushFrame(e, n) {
     const r = Fe.fromExtension(e?.nameScopesList ?? null, n.nameScopesList);
-    return new pe(
+    return new fe(
       e,
       n.ruleId,
       n.enterPos ?? -1,
@@ -4237,7 +4237,7 @@ const co = Ne({
 function ho(t, e) {
   return e in t ? t[e] : e;
 }
-function po(t, e) {
+function fo(t, e) {
   return ho(t, e.toLowerCase());
 }
 const Ja = Ne({
@@ -4600,7 +4600,7 @@ const Ja = Ne({
     unselectable: null
   },
   space: "html",
-  transform: po
+  transform: fo
 }), Za = Ne({
   attributes: {
     accentHeight: "accent-height",
@@ -5160,7 +5160,7 @@ const Ja = Ne({
   },
   space: "svg",
   transform: ho
-}), fo = Ne({
+}), po = Ne({
   properties: {
     xLinkActuate: null,
     xLinkArcRole: null,
@@ -5178,7 +5178,7 @@ const Ja = Ne({
   attributes: { xmlnsxlink: "xmlns:xlink" },
   properties: { xmlnsXLink: null, xmlns: null },
   space: "xmlns",
-  transform: po
+  transform: fo
 }), mo = Ne({
   properties: { xmlBase: null, xmlLang: null, xmlSpace: null },
   space: "xml",
@@ -5212,7 +5212,7 @@ function ni(t) {
 function ri(t) {
   return t.charAt(1).toUpperCase();
 }
-const oi = uo([co, Ja, fo, go, mo], "html"), yo = uo([co, Za, fo, go, mo], "svg"), si = /["&'<>`]/g, ai = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g, ii = (
+const oi = uo([co, Ja, po, go, mo], "html"), yo = uo([co, Za, po, go, mo], "svg"), si = /["&'<>`]/g, ai = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g, ii = (
   // eslint-disable-next-line no-control-regex, unicorn/no-hex-escape
   /[\x01-\t\v\f\x0E-\x1F\x7F\x81\x8D\x8F\x90\x9D\xA0-\uFFFF]/g
 ), li = /[|\\{}()[\]^$+*?.]/g, Zn = /* @__PURE__ */ new WeakMap();
@@ -5249,10 +5249,10 @@ function hi(t) {
     e.push(t[n].replace(li, "\\$&"));
   return new RegExp("(?:" + e.join("|") + ")", "g");
 }
-const pi = /[\dA-Fa-f]/;
-function fi(t, e, n) {
+const fi = /[\dA-Fa-f]/;
+function pi(t, e, n) {
   const r = "&#x" + t.toString(16).toUpperCase();
-  return n && e && !pi.test(String.fromCharCode(e)) ? r : r + ";";
+  return n && e && !fi.test(String.fromCharCode(e)) ? r : r + ";";
 }
 const di = /\d/;
 function gi(t, e, n) {
@@ -5642,7 +5642,7 @@ function wi(t, e, n, r) {
   return "";
 }
 function Ci(t, e, n) {
-  let r = fi(t, e, n.omitOptionalSemicolons), o;
+  let r = pi(t, e, n.omitOptionalSemicolons), o;
   if ((n.useNamedReferences || n.useShortestReferences) && (o = wi(
     t,
     e,
@@ -5972,7 +5972,7 @@ function al(t) {
     e[r] = this.one(n[r], r, t);
   return e.join("");
 }
-function pt(t, e) {
+function ft(t, e) {
   const n = typeof t == "string" ? {} : { ...t.colorReplacements }, r = typeof t == "string" ? t : t.name;
   for (const [o, s] of Object.entries(e?.colorReplacements || {}))
     typeof s == "string" ? n[o] = s : o === r && Object.assign(n, s);
@@ -6062,40 +6062,40 @@ function hl(t, e) {
     offset: t.offset + n
   }), r;
 }
-function pl(t, e) {
+function fl(t, e) {
   const n = Array.from(e instanceof Set ? e : new Set(e)).sort((r, o) => r - o);
   return n.length ? t.map((r) => r.flatMap((o) => {
     const s = n.filter((a) => o.offset < a && a < o.offset + o.content.length).map((a) => a - o.offset).sort((a, i) => a - i);
     return s.length ? hl(o, s) : o;
   })) : t;
 }
-function fl(t, e, n, r, o = "css-vars") {
+function pl(t, e, n, r, o = "css-vars") {
   const s = {
     content: t.content,
     explanation: t.explanation,
     offset: t.offset
-  }, a = e.map((c) => ft(t.variants[c])), i = new Set(a.flatMap((c) => Object.keys(c))), l = {}, u = (c, h) => {
-    const f = h === "color" ? "" : h === "background-color" ? "-bg" : `-${h}`;
-    return n + e[c] + (h === "color" ? "" : f);
+  }, a = e.map((c) => pt(t.variants[c])), i = new Set(a.flatMap((c) => Object.keys(c))), l = {}, u = (c, h) => {
+    const p = h === "color" ? "" : h === "background-color" ? "-bg" : `-${h}`;
+    return n + e[c] + (h === "color" ? "" : p);
   };
   return a.forEach((c, h) => {
-    for (const f of i) {
-      const d = c[f] || "inherit";
-      if (h === 0 && r && cl.includes(f))
+    for (const p of i) {
+      const d = c[p] || "inherit";
+      if (h === 0 && r && cl.includes(p))
         if (r === _n && a.length > 1) {
-          const p = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
-          if (p === -1 || g === -1)
+          const f = e.findIndex((m) => m === "light"), g = e.findIndex((m) => m === "dark");
+          if (f === -1 || g === -1)
             throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-          const C = a[p][f] || "inherit", y = a[g][f] || "inherit";
-          l[f] = `light-dark(${C}, ${y})`, o === "css-vars" && (l[u(h, f)] = d);
+          const C = a[f][p] || "inherit", y = a[g][p] || "inherit";
+          l[p] = `light-dark(${C}, ${y})`, o === "css-vars" && (l[u(h, p)] = d);
         } else
-          l[f] = d;
+          l[p] = d;
       else
-        o === "css-vars" && (l[u(h, f)] = d);
+        o === "css-vars" && (l[u(h, p)] = d);
     }
   }), s.htmlStyle = l, s;
 }
-function ft(t) {
+function pt(t) {
   const e = {};
   if (t.color && (e.color = t.color), t.bgColor && (e["background-color"] = t.bgColor), t.fontStyle) {
     t.fontStyle & z.Italic && (e["font-style"] = "italic"), t.fontStyle & z.Bold && (e["font-weight"] = "bold");
@@ -6225,7 +6225,7 @@ function ml() {
       if (!this.options.decorations?.length)
         return;
       const o = e(this).decorations.flatMap((a) => [a.start.offset, a.end.offset]);
-      return pl(n, o);
+      return fl(n, o);
     },
     code(n) {
       if (!this.options.decorations?.length)
@@ -6233,19 +6233,19 @@ function ml() {
       const r = e(this), o = Array.from(n.children).filter((c) => c.type === "element" && c.tagName === "span");
       if (o.length !== r.converter.lines.length)
         throw new F(`Number of lines in code element (${o.length}) does not match the number of lines in the source (${r.converter.lines.length}). Failed to apply decorations.`);
-      function s(c, h, f, d) {
-        const p = o[c];
+      function s(c, h, p, d) {
+        const f = o[c];
         let g = "", C = -1, y = -1;
-        if (h === 0 && (C = 0), f === 0 && (y = 0), f === Number.POSITIVE_INFINITY && (y = p.children.length), C === -1 || y === -1)
-          for (let _ = 0; _ < p.children.length; _++)
-            g += Ao(p.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === f && (y = _ + 1);
+        if (h === 0 && (C = 0), p === 0 && (y = 0), p === Number.POSITIVE_INFINITY && (y = f.children.length), C === -1 || y === -1)
+          for (let _ = 0; _ < f.children.length; _++)
+            g += Ao(f.children[_]), C === -1 && g.length === h && (C = _ + 1), y === -1 && g.length === p && (y = _ + 1);
         if (C === -1)
           throw new F(`Failed to find start index for decoration ${JSON.stringify(d.start)}`);
         if (y === -1)
           throw new F(`Failed to find end index for decoration ${JSON.stringify(d.end)}`);
-        const m = p.children.slice(C, y);
-        if (!d.alwaysWrap && m.length === p.children.length)
-          i(p, d, "line");
+        const m = f.children.slice(C, y);
+        if (!d.alwaysWrap && m.length === f.children.length)
+          i(f, d, "line");
         else if (!d.alwaysWrap && m.length === 1 && m[0].type === "element")
           i(m[0], d, "token");
         else {
@@ -6255,30 +6255,30 @@ function ml() {
             properties: {},
             children: m
           };
-          i(_, d, "wrapper"), p.children.splice(C, m.length, _);
+          i(_, d, "wrapper"), f.children.splice(C, m.length, _);
         }
       }
       function a(c, h) {
         o[c] = i(o[c], h, "line");
       }
-      function i(c, h, f) {
-        const d = h.properties || {}, p = h.transform || ((g) => g);
+      function i(c, h, p) {
+        const d = h.properties || {}, f = h.transform || ((g) => g);
         return c.tagName = h.tagName || "span", c.properties = {
           ...c.properties,
           ...d,
           class: c.properties.class
-        }, h.properties?.class && xo(c, h.properties.class), c = p(c, f) || c, c;
+        }, h.properties?.class && xo(c, h.properties.class), c = f(c, p) || c, c;
       }
       const l = [], u = r.decorations.sort((c, h) => h.start.offset - c.start.offset || c.end.offset - h.end.offset);
       for (const c of u) {
-        const { start: h, end: f } = c;
-        if (h.line === f.line)
-          s(h.line, h.character, f.character, c);
-        else if (h.line < f.line) {
+        const { start: h, end: p } = c;
+        if (h.line === p.line)
+          s(h.line, h.character, p.character, c);
+        else if (h.line < p.line) {
           s(h.line, h.character, Number.POSITIVE_INFINITY, c);
-          for (let d = h.line + 1; d < f.line; d++)
+          for (let d = h.line + 1; d < p.line; d++)
             l.unshift(() => a(d, c));
-          s(f.line, 0, f.character, c);
+          s(p.line, 0, p.character, c);
         }
       }
       l.forEach((c) => c());
@@ -6293,7 +6293,7 @@ function yl(t) {
     for (let r = e + 1; r < t.length; r++) {
       const o = t[r], s = n.start.offset <= o.start.offset && o.start.offset < n.end.offset, a = n.start.offset < o.end.offset && o.end.offset <= n.end.offset, i = o.start.offset <= n.start.offset && n.start.offset < o.end.offset, l = o.start.offset < n.end.offset && n.end.offset <= o.end.offset;
       if (s || a || i || l) {
-        if (s && a || i && l)
+        if (s && a || i && l || i && n.start.offset === n.end.offset || a && o.start.offset === o.end.offset)
           continue;
         throw new F(`Decorations ${JSON.stringify(n.start)} and ${JSON.stringify(o.start)} intersect.`);
       }
@@ -6521,7 +6521,7 @@ function kl(t = Sl) {
   };
 }
 function vl(t, e, n) {
-  const r = pt(t, n), o = St(e), s = kl(
+  const r = ft(t, n), o = St(e), s = kl(
     Object.fromEntries(
       de.map((i) => [
         i,
@@ -6601,7 +6601,7 @@ function Al(t, e, n, r, o) {
   return kt(s.tokens, a), s.tokens;
 }
 function gt(t, e, n, r, o) {
-  const s = pt(n, o), {
+  const s = ft(n, o), {
     tokenizeMaxLineLength: a = 0,
     tokenizeTimeLimit: i = 500
   } = o, l = St(t);
@@ -6617,15 +6617,15 @@ function gt(t, e, n, r, o) {
     }
   ).stateStack : Zt, c = [];
   const h = [];
-  for (let f = 0, d = l.length; f < d; f++) {
-    const [p, g] = l[f];
-    if (p === "") {
+  for (let p = 0, d = l.length; p < d; p++) {
+    const [f, g] = l[p];
+    if (f === "") {
       c = [], h.push([]);
       continue;
     }
-    if (a > 0 && p.length >= a) {
+    if (a > 0 && f.length >= a) {
       c = [], h.push([{
-        content: p,
+        content: f,
         offset: g,
         color: "",
         fontStyle: 0
@@ -6633,17 +6633,17 @@ function gt(t, e, n, r, o) {
       continue;
     }
     let C, y, m;
-    o.includeExplanation && (C = e.tokenizeLine(p, u, i), y = C.tokens, m = 0);
-    const _ = e.tokenizeLine2(p, u, i), S = _.tokens.length / 2;
+    o.includeExplanation && (C = e.tokenizeLine(f, u, i), y = C.tokens, m = 0);
+    const _ = e.tokenizeLine2(f, u, i), S = _.tokens.length / 2;
     for (let A = 0; A < S; A++) {
-      const D = _.tokens[2 * A], L = A + 1 < S ? _.tokens[2 * A + 2] : p.length;
+      const D = _.tokens[2 * A], L = A + 1 < S ? _.tokens[2 * A + 2] : f.length;
       if (D === L)
         continue;
       const j = _.tokens[2 * A + 1], Z = ue(
         r[Re.getForeground(j)],
         s
       ), ee = Re.getFontStyle(j), ce = {
-        content: p.substring(D, L),
+        content: f.substring(D, L),
         offset: g + D,
         color: Z,
         fontStyle: ee
@@ -6671,7 +6671,7 @@ function gt(t, e, n, r, o) {
         ce.explanation = [];
         let R = 0;
         for (; D + R < L; ) {
-          const k = y[m], G = p.substring(
+          const k = y[m], G = f.substring(
             k.startIndex,
             k.endIndex
           );
@@ -6745,20 +6745,20 @@ function Ro(t, e, n) {
     ...o.map((l) => l.tokens)
   ), a = s[0].map(
     (l, u) => l.map((c, h) => {
-      const f = {
+      const p = {
         content: c.content,
         variants: {},
         offset: c.offset
       };
-      return "includeExplanation" in n && n.includeExplanation && (f.explanation = c.explanation), s.forEach((d, p) => {
+      return "includeExplanation" in n && n.includeExplanation && (p.explanation = c.explanation), s.forEach((d, f) => {
         const {
           content: g,
           explanation: C,
           offset: y,
           ...m
         } = d[u][h];
-        f.variants[r[p].color] = m;
-      }), f;
+        p.variants[r[f].color] = m;
+      }), p;
     })
   ), i = o[0].state ? new Le(
     Object.fromEntries(o.map((l) => [l.theme, l.state?.getInternalStack(l.theme)])),
@@ -6796,22 +6796,22 @@ function mt(t, e, n) {
       defaultColor: u = "light",
       cssVariablePrefix: c = "--shiki-",
       colorsRendering: h = "css-vars"
-    } = n, f = Object.entries(n.themes).filter((y) => y[1]).map((y) => ({ color: y[0], theme: y[1] })).sort((y, m) => y.color === u ? -1 : m.color === u ? 1 : 0);
-    if (f.length === 0)
+    } = n, p = Object.entries(n.themes).filter((y) => y[1]).map((y) => ({ color: y[0], theme: y[1] })).sort((y, m) => y.color === u ? -1 : m.color === u ? 1 : 0);
+    if (p.length === 0)
       throw new F("`themes` option must not be empty");
     const d = Ro(
       t,
       e,
       n
     );
-    if (l = We(d), u && _n !== u && !f.find((y) => y.color === u))
+    if (l = We(d), u && _n !== u && !p.find((y) => y.color === u))
       throw new F(`\`themes\` option must contain the defaultColor key \`${u}\``);
-    const p = f.map((y) => t.getTheme(y.theme)), g = f.map((y) => y.color);
-    s = d.map((y) => y.map((m) => fl(m, g, c, u, h))), l && kt(s, l);
-    const C = f.map((y) => pt(y.theme, n));
-    o = rr(f, p, C, c, u, "fg", h), r = rr(f, p, C, c, u, "bg", h), a = `shiki-themes ${p.map((y) => y.name).join(" ")}`, i = u ? void 0 : [o, r].join(";");
+    const f = p.map((y) => t.getTheme(y.theme)), g = p.map((y) => y.color);
+    s = d.map((y) => y.map((m) => pl(m, g, c, u, h))), l && kt(s, l);
+    const C = p.map((y) => ft(y.theme, n));
+    o = rr(p, f, C, c, u, "fg", h), r = rr(p, f, C, c, u, "bg", h), a = `shiki-themes ${f.map((y) => y.name).join(" ")}`, i = u ? void 0 : [o, r].join(";");
   } else if ("theme" in n) {
-    const u = pt(n.theme, n);
+    const u = ft(n.theme, n);
     s = Sn(
       t,
       e,
@@ -6835,11 +6835,11 @@ function rr(t, e, n, r, o, s, a) {
     const u = ue(e[l][s], n[l]) || "inherit", c = `${r + i.color}${s === "bg" ? "-bg" : ""}:${u}`;
     if (l === 0 && o) {
       if (o === _n && t.length > 1) {
-        const h = t.findIndex((g) => g.color === "light"), f = t.findIndex((g) => g.color === "dark");
-        if (h === -1 || f === -1)
+        const h = t.findIndex((g) => g.color === "light"), p = t.findIndex((g) => g.color === "dark");
+        if (h === -1 || p === -1)
           throw new F('When using `defaultColor: "light-dark()"`, you must provide both `light` and `dark` themes');
-        const d = ue(e[h][s], n[h]) || "inherit", p = ue(e[f][s], n[f]) || "inherit";
-        return `light-dark(${d}, ${p});${c}`;
+        const d = ue(e[h][s], n[h]) || "inherit", f = ue(e[p][s], n[p]) || "inherit";
+        return `light-dark(${d}, ${f});${c}`;
       }
       return u;
     }
@@ -6853,8 +6853,8 @@ function yt(t, e, n, r = {
   codeToTokens: (o, s) => mt(t, o, s)
 }) {
   let o = e;
-  for (const p of dt(n))
-    o = p.preprocess?.call(r, o, n) || o;
+  for (const f of dt(n))
+    o = f.preprocess?.call(r, o, n) || o;
   let {
     tokens: s,
     fg: a,
@@ -6865,17 +6865,17 @@ function yt(t, e, n, r = {
   } = mt(t, o, n);
   const {
     mergeWhitespaces: h = !0,
-    mergeSameStyleTokens: f = !1
+    mergeSameStyleTokens: p = !1
   } = n;
-  h === !0 ? s = Tl(s) : h === "never" && (s = Ml(s)), f && (s = Ol(s));
+  h === !0 ? s = Tl(s) : h === "never" && (s = Ml(s)), p && (s = Ol(s));
   const d = {
     ...r,
     get source() {
       return o;
     }
   };
-  for (const p of dt(n))
-    s = p.tokens?.call(d, s) || s;
+  for (const f of dt(n))
+    s = f.tokens?.call(d, s) || s;
   return $l(
     s,
     {
@@ -6909,7 +6909,7 @@ function $l(t, e, n, r = We(t)) {
       ...Object.fromEntries(
         Array.from(
           Object.entries(e.meta || {})
-        ).filter(([p]) => !p.startsWith("_"))
+        ).filter(([f]) => !f.startsWith("_"))
       )
     },
     children: []
@@ -6919,7 +6919,7 @@ function $l(t, e, n, r = We(t)) {
     properties: {},
     children: s
   };
-  const h = [], f = {
+  const h = [], p = {
     ...n,
     structure: i,
     addClassToHast: xo,
@@ -6945,7 +6945,7 @@ function $l(t, e, n, r = We(t)) {
       return h;
     }
   };
-  if (t.forEach((p, g) => {
+  if (t.forEach((f, g) => {
     g && (i === "inline" ? a.children.push({ type: "element", tagName: "br", properties: {}, children: [] }) : i === "classic" && s.push({ type: "text", value: `
 ` }));
     let C = {
@@ -6954,7 +6954,7 @@ function $l(t, e, n, r = We(t)) {
       properties: { class: "line" },
       children: []
     }, y = 0;
-    for (const m of p) {
+    for (const m of f) {
       let _ = {
         type: "element",
         tagName: "span",
@@ -6963,28 +6963,28 @@ function $l(t, e, n, r = We(t)) {
         },
         children: [{ type: "text", value: m.content }]
       };
-      const S = rn(m.htmlStyle || ft(m));
+      const S = rn(m.htmlStyle || pt(m));
       S && (_.properties.style = S);
       for (const A of o)
-        _ = A?.span?.call(f, _, g + 1, y, C, m) || _;
+        _ = A?.span?.call(p, _, g + 1, y, C, m) || _;
       i === "inline" ? a.children.push(_) : i === "classic" && C.children.push(_), y += m.content.length;
     }
     if (i === "classic") {
       for (const m of o)
-        C = m?.line?.call(f, C, g + 1) || C;
+        C = m?.line?.call(p, C, g + 1) || C;
       h.push(C), s.push(C);
     }
   }), i === "classic") {
-    for (const p of o)
-      c = p?.code?.call(f, c) || c;
+    for (const f of o)
+      c = f?.code?.call(p, c) || c;
     u.children.push(c);
-    for (const p of o)
-      u = p?.pre?.call(f, u) || u;
+    for (const f of o)
+      u = f?.pre?.call(p, u) || u;
     a.children.push(u);
   }
   let d = a;
-  for (const p of o)
-    d = p?.root?.call(f, d) || d;
+  for (const f of o)
+    d = f?.root?.call(p, d) || d;
   return r && kt(d, r), d;
 }
 function Tl(t) {
@@ -7039,7 +7039,7 @@ function Ol(t) {
         n.push({ ...r });
         continue;
       }
-      const o = n[n.length - 1], s = rn(o.htmlStyle || ft(o)), a = rn(r.htmlStyle || ft(r)), i = o.fontStyle && (o.fontStyle & z.Underline || o.fontStyle & z.Strikethrough), l = r.fontStyle && (r.fontStyle & z.Underline || r.fontStyle & z.Strikethrough);
+      const o = n[n.length - 1], s = rn(o.htmlStyle || pt(o)), a = rn(r.htmlStyle || pt(r)), i = o.fontStyle && (o.fontStyle & z.Underline || o.fontStyle & z.Strikethrough), l = r.fontStyle && (r.fontStyle & z.Underline || r.fontStyle & z.Strikethrough);
       !i && !l && s === a ? o.content += r.content : n.push({ ...r });
     }
     return n;
@@ -7302,19 +7302,19 @@ function zl(t) {
   function h() {
     return C(), s.getLoadedLanguages();
   }
-  function f(...m) {
+  function p(...m) {
     C(), s.loadLanguages(m.flat(1));
   }
   async function d(...m) {
-    return f(await Io(m));
+    return p(await Io(m));
   }
-  function p(...m) {
+  function f(...m) {
     C();
     for (const _ of m.flat(1))
       s.loadTheme(_);
   }
   async function g(...m) {
-    return C(), p(await No(m));
+    return C(), f(await No(m));
   }
   function C() {
     if (e)
@@ -7330,9 +7330,9 @@ function zl(t) {
     getLoadedThemes: c,
     getLoadedLanguages: h,
     loadLanguage: d,
-    loadLanguageSync: f,
+    loadLanguageSync: p,
     loadTheme: g,
-    loadThemeSync: p,
+    loadThemeSync: f,
     dispose: y,
     [Symbol.dispose]: y
   };
@@ -7420,8 +7420,8 @@ function Yl(t, e) {
     lazy: c = !1,
     ...h
   } = e;
-  function f(d, p, g = "", C = {}) {
-    const y = `${d}:${g}:${p}`, m = o?.get(y);
+  function p(d, f, g = "", C = {}) {
+    const y = `${d}:${g}:${f}`, m = o?.get(y);
     if (m)
       return m;
     const _ = {
@@ -7441,10 +7441,10 @@ function Yl(t, e) {
           return this.addClassToHast(S, `${Kl}${d}`), S;
         }
       }
-    ]), l && p.endsWith(`
-`) && (p = p.slice(0, -1));
+    ]), l && f.endsWith(`
+`) && (f = f.slice(0, -1));
     try {
-      const S = t.codeToHast(p, _);
+      const S = t.codeToHast(f, _);
       return o?.set(y, S), S;
     } catch (S) {
       if (i)
@@ -7454,7 +7454,7 @@ function Yl(t, e) {
     }
   }
   return (d) => {
-    const p = [];
+    const f = [];
     if (qr(d, "element", (g, C, y) => {
       let m;
       if (!y || C == null)
@@ -7472,7 +7472,7 @@ function Yl(t, e) {
       if (_.lang ? t.getLoadedLanguages().includes(_.lang) || vo(_.lang) ? S = _.lang : c ? (A = !0, S = _.lang) : a && (S = a) : S = s, !S)
         return;
       const D = _.meta ? r?.(_.meta, g, d) : void 0, L = (j) => {
-        const Z = f(j, _.code, _.meta, D ?? {});
+        const Z = p(j, _.code, _.meta, D ?? {});
         if (Z) {
           if (_.type === "inline") {
             const ee = Z.children[0];
@@ -7483,7 +7483,7 @@ function Yl(t, e) {
       };
       if (A)
         try {
-          p.push(t.loadLanguage(S).then(() => L(S)));
+          f.push(t.loadLanguage(S).then(() => L(S)));
         } catch (j) {
           if (a)
             return L(a);
@@ -7494,9 +7494,9 @@ function Yl(t, e) {
       else
         L(S);
       return "skip";
-    }), p.length > 0) {
+    }), f.length > 0) {
       async function g() {
-        await Promise.all(p);
+        await Promise.all(f);
       }
       return g();
     }
@@ -7630,8 +7630,8 @@ function ru(t, e = {}) {
   let u = 0;
   a.filter((h) => h.type === "GroupOpen").forEach((h) => {
     h.kind === "capturing" ? h.number = ++u : h.raw === "(" && l.push(h);
-  }), u || l.forEach((h, f) => {
-    h.kind = "capturing", h.number = f + 1;
+  }), u || l.forEach((h, p) => {
+    h.kind = "capturing", h.number = p + 1;
   });
   const c = u || l.length;
   return { tokens: a.map((h) => h.type === "EscapedNumber" ? vu(h, c) : h).flat(), flags: r };
@@ -7679,7 +7679,7 @@ function ou(t, e, n, r) {
   }
   if (n === ")") {
     if (t.popModX(), t.numOpenGroups--, t.numOpenGroups < 0) throw new Error('Unmatched ")"');
-    return { token: pu(n) };
+    return { token: fu(n) };
   }
   if (t.getCurrentModX()) {
     if (n === "#") {
@@ -7783,13 +7783,13 @@ function Do(t, e, n = {}) {
 function hu(t, e) {
   return { type: "EscapedNumber", inCharClass: t, raw: e };
 }
-function pu(t) {
+function fu(t) {
   return { type: "GroupClose", raw: t };
 }
 function Se(t, e, n = {}) {
   return { type: "GroupOpen", kind: t, ...n, raw: e };
 }
-function fu(t, e, n, r) {
+function pu(t, e, n, r) {
   return { type: "NamedCallout", kind: t, tag: e, arguments: n, raw: r };
 }
 function du(t, e, n, r) {
@@ -7807,7 +7807,7 @@ function yu(t) {
 function bu(t, e) {
   let { on: n, off: r } = /^\(\?(?<on>[imx]*)(?:-(?<off>[-imx]*))?/.exec(t).groups;
   r ??= "";
-  const o = (e.getCurrentModX() || n.includes("x")) && !r.includes("x"), s = fr(n), a = fr(r), i = {};
+  const o = (e.getCurrentModX() || n.includes("x")) && !r.includes("x"), s = pr(n), a = pr(r), i = {};
   if (s && (i.enable = s), a && (i.disable = a), t.endsWith(")")) return e.replaceCurrentModX(o), Do("flags", t, { flags: i });
   if (t.endsWith(":")) return e.pushModX(o), e.numOpenGroups++, Se("group", t, { ...(s || a) && { flags: i } });
   throw new Error(`Unexpected flag modifier "${t}"`);
@@ -7850,9 +7850,9 @@ function wu(t) {
     default:
       throw new Error(`Unexpected named callout kind "${u}"`);
   }
-  return fu(u, r ?? null, o?.split(",") ?? null, t);
+  return pu(u, r ?? null, o?.split(",") ?? null, t);
 }
-function pr(t) {
+function fr(t) {
   let e = null, n, r;
   if (t[0] === "{") {
     const { minStr: o, maxStr: s } = /^\{(?<minStr>\d*)(?:,(?<maxStr>\d*))?/.exec(t).groups, a = 1e5;
@@ -7872,7 +7872,7 @@ function _u(t) {
   const { p: e, neg: n, value: r } = /^\\(?<p>[pP])\{(?<neg>\^?)(?<value>[^}]+)/.exec(t).groups;
   return ge("property", t, { value: r, negate: e === "P" && !n || e === "p" && !!n });
 }
-function fr(t) {
+function pr(t) {
   const e = {};
   return t.includes("i") && (e.ignoreCase = !0), t.includes("m") && (e.dotAll = !0), t.includes("x") && (e.extended = !0), Object.keys(e).length ? e : null;
 }
@@ -7919,12 +7919,12 @@ function xu(t) {
       if (s) {
         const { min: a, max: i } = s.groups;
         if (+a > +i && o.endsWith("?")) {
-          n.lastIndex--, e.push(pr(o.slice(0, -1)));
+          n.lastIndex--, e.push(fr(o.slice(0, -1)));
           continue;
         }
       }
     }
-    e.push(pr(o));
+    e.push(fr(o));
   }
   return e;
 }
@@ -7939,51 +7939,51 @@ function Eu(t) {
 }
 const Au = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
 function Fo(t, e = {}) {
-  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = ru(t, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), o = (f, d) => {
-    const p = r.tokens[s.nextIndex];
-    switch (s.parent = f, s.nextIndex++, p.type) {
+  const n = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...e, rules: { captureGroup: !1, singleline: !1, ...e.rules } }, r = ru(t, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), o = (p, d) => {
+    const f = r.tokens[s.nextIndex];
+    switch (s.parent = p, s.nextIndex++, f.type) {
       case "Alternator":
         return me();
       case "Assertion":
-        return Ru(p);
+        return Ru(f);
       case "Backreference":
-        return Iu(p, s);
+        return Iu(f, s);
       case "Character":
-        return vt(p.value, { useLastValid: !!d.isCheckingRangeEnd });
+        return vt(f.value, { useLastValid: !!d.isCheckingRangeEnd });
       case "CharacterClassHyphen":
-        return Nu(p, s, d);
+        return Nu(f, s, d);
       case "CharacterClassOpen":
-        return Lu(p, s, d);
+        return Lu(f, s, d);
       case "CharacterSet":
-        return Pu(p, s);
+        return Pu(f, s);
       case "Directive":
-        return Gu(p.kind, { flags: p.flags });
+        return Gu(f.kind, { flags: f.flags });
       case "GroupOpen":
-        return $u(p, s, d);
+        return $u(f, s, d);
       case "NamedCallout":
-        return Bu(p.kind, p.tag, p.arguments);
+        return Bu(f.kind, f.tag, f.arguments);
       case "Quantifier":
-        return Tu(p, s);
+        return Tu(f, s);
       case "Subroutine":
-        return Mu(p, s);
+        return Mu(f, s);
       default:
-        throw new Error(`Unexpected token type "${p.type}"`);
+        throw new Error(`Unexpected token type "${f.type}"`);
     }
   }, s = { capturingGroups: [], hasNumberedRef: !1, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: n.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: n.skipBackrefValidation, skipLookbehindValidation: n.skipLookbehindValidation, skipPropertyNameValidation: n.skipPropertyNameValidation, subroutines: [], tokens: r.tokens, unicodePropertyMap: n.unicodePropertyMap, walk: o }, a = Uu(Fu(r.flags));
   let i = a.body[0];
   for (; s.nextIndex < r.tokens.length; ) {
-    const f = o(i, {});
-    f.type === "Alternative" ? (a.body.push(f), i = f) : i.body.push(f);
+    const p = o(i, {});
+    p.type === "Alternative" ? (a.body.push(p), i = p) : i.body.push(p);
   }
   const { capturingGroups: l, hasNumberedRef: u, namedGroupsByName: c, subroutines: h } = s;
   if (u && c.size && !n.rules.captureGroup) throw new Error("Numbered backref/subroutine not allowed when using named capture");
-  for (const { ref: f } of h) if (typeof f == "number") {
-    if (f > l.length) throw new Error("Subroutine uses a group number that's not defined");
-    f && (l[f - 1].isSubroutined = !0);
-  } else if (c.has(f)) {
-    if (c.get(f).length > 1) throw new Error(B`Subroutine uses a duplicate group name "\g<${f}>"`);
-    c.get(f)[0].isSubroutined = !0;
-  } else throw new Error(B`Subroutine uses a group name that's not defined "\g<${f}>"`);
+  for (const { ref: p } of h) if (typeof p == "number") {
+    if (p > l.length) throw new Error("Subroutine uses a group number that's not defined");
+    p && (l[p - 1].isSubroutined = !0);
+  } else if (c.has(p)) {
+    if (c.get(p).length > 1) throw new Error(B`Subroutine uses a duplicate group name "\g<${p}>"`);
+    c.get(p)[0].isSubroutined = !0;
+  } else throw new Error(B`Subroutine uses a group name that's not defined "\g<${p}>"`);
   return a;
 }
 function Ru({ kind: t }) {
@@ -8041,19 +8041,19 @@ function Pu({ kind: t, negate: e, value: n }, r) {
 function $u(t, e, n) {
   const { tokens: r, capturingGroups: o, namedGroupsByName: s, skipLookbehindValidation: a, walk: i } = e, l = zu(t), u = l.type === "AbsenceFunction", c = gr(l), h = c && l.negate;
   if (l.type === "CapturingGroup" && (o.push(l), l.name && nu(s, l.name, []).push(l)), u && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
-  let f = yr(r[e.nextIndex]);
-  for (; f.type !== "GroupClose"; ) {
-    if (f.type === "Alternator") l.body.push(me()), e.nextIndex++;
+  let p = yr(r[e.nextIndex]);
+  for (; p.type !== "GroupClose"; ) {
+    if (p.type === "Alternator") l.body.push(me()), e.nextIndex++;
     else {
-      const d = l.body.at(-1), p = i(d, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || u, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || h });
-      if (d.body.push(p), (c || n.isInLookbehind) && !a) {
+      const d = l.body.at(-1), f = i(d, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || u, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || h });
+      if (d.body.push(f), (c || n.isInLookbehind) && !a) {
         const g = "Lookbehind includes a pattern not allowed by Oniguruma";
         if (h || n.isInNegLookbehind) {
-          if (dr(p) || p.type === "CapturingGroup") throw new Error(g);
-        } else if (dr(p) || gr(p) && p.negate) throw new Error(g);
+          if (dr(f) || f.type === "CapturingGroup") throw new Error(g);
+        } else if (dr(f) || gr(f) && f.negate) throw new Error(g);
       }
     }
-    f = yr(r[e.nextIndex]);
+    p = yr(r[e.nextIndex]);
   }
   return e.nextIndex++, l;
 }
@@ -8127,7 +8127,7 @@ function Q(t) {
   if (e && n) throw new Error("Atomic group cannot have flags");
   return { type: "Group", ...e && { atomic: e }, ...n && { flags: n }, body: Ye(t?.body) };
 }
-function fe(t) {
+function pe(t) {
   const e = { behind: !1, negate: !1, ...t };
   return { type: "LookaroundAssertion", kind: e.behind ? "lookbehind" : "lookahead", negate: e.negate, body: Ye(t?.body) };
 }
@@ -8170,7 +8170,7 @@ function zu({ flags: t, kind: e, name: n, negate: r, number: o }) {
       return Q({ flags: t });
     case "lookahead":
     case "lookbehind":
-      return fe({ behind: e === "lookbehind", negate: r });
+      return pe({ behind: e === "lookbehind", negate: r });
     default:
       throw new Error(`Unexpected group kind "${e}"`);
   }
@@ -8234,8 +8234,8 @@ function Be(t, e, n = null) {
       c = !0;
     }, skip() {
       c = !0;
-    } }, { type: f } = s, d = e["*"], p = e[f], g = typeof d == "function" ? d : d?.enter, C = typeof p == "function" ? p : p?.enter;
-    if (g?.(h, n), C?.(h, n), !c) switch (f) {
+    } }, { type: p } = s, d = e["*"], f = e[p], g = typeof d == "function" ? d : d?.enter, C = typeof f == "function" ? f : f?.enter;
+    if (g?.(h, n), C?.(h, n), !c) switch (p) {
       case "AbsenceFunction":
       case "CapturingGroup":
       case "Group":
@@ -8267,9 +8267,9 @@ function Be(t, e, n = null) {
         r(s.body, s), o(s.flags, s, "flags");
         break;
       default:
-        throw new Error(`Unexpected node type "${f}"`);
+        throw new Error(`Unexpected node type "${p}"`);
     }
-    return p?.exit?.(h, n), d?.exit?.(h, n), u;
+    return f?.exit?.(h, n), d?.exit?.(h, n), u;
   }
   return o(t), t;
 }
@@ -8362,20 +8362,20 @@ function Ju(t, e) {
   let l = 0, u = 0, c = NaN, h;
   do {
     h = !1;
-    let f = 0, d = 0, p = !1, g;
+    let p = 0, d = 0, f = !1, g;
     for (br.lastIndex = Number.isNaN(c) ? 0 : c + s.length; g = br.exec(t); ) {
       const { 0: C, index: y, groups: { capturingStart: m, noncapturingStart: _ } } = g;
       if (C === "[")
-        f++;
-      else if (f)
-        C === "]" && f--;
-      else if (C === o && !p)
-        c = y, p = !0;
-      else if (p && _)
+        p++;
+      else if (p)
+        C === "]" && p--;
+      else if (C === o && !f)
+        c = y, f = !0;
+      else if (f && _)
         d++;
       else if (m)
-        p ? d++ : (l++, a.push(l + u));
-      else if (C === ")" && p) {
+        f ? d++ : (l++, a.push(l + u));
+      else if (C === ")" && f) {
         if (!d) {
           u++;
           const S = l + u;
@@ -8397,14 +8397,14 @@ function Ju(t, e) {
   return n.push(...i), t = En(
     t,
     String.raw`\\(?<backrefNum>[1-9]\d*)|<\$\$(?<wrappedBackrefNum>\d+)>`,
-    ({ 0: f, groups: { backrefNum: d, wrappedBackrefNum: p } }) => {
+    ({ 0: p, groups: { backrefNum: d, wrappedBackrefNum: f } }) => {
       if (d) {
         const g = +d;
         if (g > a.length - 1)
-          throw new Error(`Backref "${f}" greater than number of captures`);
+          throw new Error(`Backref "${p}" greater than number of captures`);
         return `\\${a[g]}`;
       }
-      return `\\${p}`;
+      return `\\${f}`;
     },
     J.DEFAULT
   ), {
@@ -8446,7 +8446,7 @@ function Zu(t) {
       if (c === "+" && o && !o.startsWith("(")) {
         if (h)
           throw new Error(`Invalid quantifier "${i}"`);
-        let f = -1;
+        let p = -1;
         if (/^\{\d+\}$/.test(u))
           t = Xu(t, l + u.length, c, "");
         else {
@@ -8457,9 +8457,9 @@ function Zu(t) {
             t = `${t.slice(0, d)}(?>${t.slice(d, l)}${u})${t.slice(l + i.length)}`;
           } else
             t = `${t.slice(0, l - o.length)}(?>${o}${u})${t.slice(l + i.length)}`;
-          f += 4;
+          p += 4;
         }
-        Dt.lastIndex += f;
+        Dt.lastIndex += p;
       } else i[0] === "(" ? e.push(l) : i === ")" && (n = e.length ? e.pop() : null);
     o = i;
   }
@@ -8484,9 +8484,9 @@ function ec(t, e) {
   if (r === "plugin" && nt(t, Y`\(\?\(DEFINE\)`, J.DEFAULT))
     throw new Error("DEFINE groups cannot be used with recursion");
   const s = [], a = nt(t, Y`\\[1-9]`, J.DEFAULT), i = /* @__PURE__ */ new Map(), l = [];
-  let u = !1, c = 0, h = 0, f;
-  for (he.lastIndex = 0; f = he.exec(t); ) {
-    const { 0: d, groups: { captureName: p, rDepth: g, gRNameOrNum: C, gRDepth: y } } = f;
+  let u = !1, c = 0, h = 0, p;
+  for (he.lastIndex = 0; p = he.exec(t); ) {
+    const { 0: d, groups: { captureName: f, rDepth: g, gRNameOrNum: C, gRDepth: y } } = p;
     if (d === "[")
       c++;
     else if (c)
@@ -8500,7 +8500,7 @@ function ec(t, e) {
           // gone through conversion from named to numbered, so avoid a misleading error
           `${r === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with global recursion`
         );
-      const m = t.slice(0, f.index), _ = t.slice(he.lastIndex);
+      const m = t.slice(0, p.index), _ = t.slice(he.lastIndex);
       if (nt(_, ln, J.DEFAULT))
         throw new Error(Gt);
       const S = +g - 1;
@@ -8539,7 +8539,7 @@ function ec(t, e) {
           // gone through conversion from named to numbered, so avoid a misleading error
           `${r === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with recursion of capturing groups`
         );
-      const A = t.slice(_, f.index), D = S.slice(A.length + d.length), L = s.length, j = +y - 1, Z = Cr(
+      const A = t.slice(_, p.index), D = S.slice(A.length + d.length), L = s.length, j = +y - 1, Z = Cr(
         A,
         D,
         j,
@@ -8558,10 +8558,10 @@ function ec(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 (p)
-      h++, i.set(String(h), he.lastIndex), i.set(p, he.lastIndex), l.push({
+    } else if (f)
+      h++, i.set(String(h), he.lastIndex), i.set(f, he.lastIndex), l.push({
         num: h,
-        name: p
+        name: f
       });
     else if (d[0] === "(") {
       const m = d === "(";
@@ -8603,13 +8603,13 @@ function _r(t, e, n, r, o, s, a) {
     u += En(
       t,
       Y`${Vo}|\\k<(?<backref>[^>]+)>`,
-      ({ 0: f, groups: { captureName: d, unnamed: p, backref: g } }) => {
+      ({ 0: p, groups: { captureName: d, unnamed: f, backref: g } }) => {
         if (g && r && !r.has(g))
-          return f;
+          return p;
         const C = `_$${h}`;
-        if (p || d) {
+        if (f || d) {
           const y = a + s.length + 1;
-          return s.push(y), tc(o, y), p ? f : `(?<${d}${C}>`;
+          return s.push(y), tc(o, y), f ? p : `(?<${d}${C}>`;
         }
         return Y`\k<${g}${C}>`;
       },
@@ -8628,19 +8628,19 @@ function Sr(t, e, n, r, o, s) {
     Ho(e, Vo, () => a++, J.DEFAULT);
     const i = s - a + o, l = /* @__PURE__ */ new Map();
     return t.forEach((u, c) => {
-      const h = (r - a * n) / n, f = a * n, d = c > i + a ? c + r : c, p = [];
+      const h = (r - a * n) / n, p = a * n, d = c > i + a ? c + r : c, f = [];
       for (const g of u)
         if (g <= i)
-          p.push(g);
+          f.push(g);
         else if (g > i + a + h)
-          p.push(g + r);
+          f.push(g + r);
         else if (g <= i + a)
           for (let C = 0; C <= n; C++)
-            p.push(g + a * C);
+            f.push(g + a * C);
         else
           for (let C = 0; C <= n; C++)
-            p.push(g + f + h * C);
-      l.set(d, p);
+            f.push(g + p + h * C);
+      l.set(d, f);
     }), l;
   }
   return t;
@@ -8955,7 +8955,7 @@ function hc(t, e) {
     spaceIsAscii: t.flags.spaceIsAscii,
     wordIsAscii: t.flags.wordIsAscii
   };
-  Be(t, pc, r);
+  Be(t, fc, r);
   const o = {
     dotAll: t.flags.dotAll,
     ignoreCase: t.flags.ignoreCase
@@ -8970,7 +8970,7 @@ function hc(t, e) {
     reffedNodesByReferencer: /* @__PURE__ */ new Map(),
     subroutineRefMap: r.subroutineRefMap
   };
-  Be(t, fc, s);
+  Be(t, pc, s);
   const a = {
     groupsByName: s.groupsByName,
     highestOrphanBackref: 0,
@@ -8979,14 +8979,14 @@ function hc(t, e) {
   };
   return Be(t, dc, a), t._originMap = s.groupOriginByCopy, t._strategy = r.strategy, t;
 }
-var pc = {
+var fc = {
   AbsenceFunction({ node: t, parent: e, replaceWith: n }) {
     const { body: r, kind: o } = t;
     if (o === "repeater") {
       const s = Q();
       s.body[0].body.push(
         // Insert own alts as `body`
-        fe({ negate: !0, body: r }),
+        pe({ negate: !0, body: r }),
         ke("Any")
       );
       const a = Q();
@@ -9015,11 +9015,11 @@ var pc = {
     }
   },
   Assertion({ node: t, parent: e, key: n, container: r, root: o, remove: s, replaceWith: a }, i) {
-    const { kind: l, negate: u } = t, { asciiWordBoundaries: c, avoidSubclass: h, supportedGNodes: f, wordIsAscii: d } = i;
+    const { kind: l, negate: u } = t, { asciiWordBoundaries: c, avoidSubclass: h, supportedGNodes: p, wordIsAscii: d } = i;
     if (l === "text_segment_boundary")
       throw new Error(`Unsupported text segment boundary "\\${u ? "Y" : "y"}"`);
     if (l === "line_end")
-      a(P(fe({ body: [
+      a(P(pe({ body: [
         me({ body: [on("string_end")] }),
         me({ body: [vt(10)] })
         // `\n`
@@ -9027,12 +9027,12 @@ var pc = {
     else if (l === "line_start")
       a(P(oe(v`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), e));
     else if (l === "search_start")
-      if (f.has(t))
+      if (p.has(t))
         o.flags.sticky = !0, s();
       else {
-        const p = r[n - 1];
-        if (p && Cc(p))
-          a(P(fe({ negate: !0 }), e));
+        const f = r[n - 1];
+        if (f && Cc(f))
+          a(P(pe({ negate: !0 }), e));
         else {
           if (h)
             throw new Error(v`Uses "\G" in a way that requires a subclass`);
@@ -9043,8 +9043,8 @@ var pc = {
       a(P(oe(v`(?=\n?\z)`), e));
     else if (l === "word_boundary") {
       if (!d && !c) {
-        const p = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
-        a(P(oe(u ? g : p), e));
+        const f = `(?:(?<=${re})(?!${re})|(?<!${re})(?=${re}))`, g = `(?:(?<=${re})(?=${re})|(?<!${re})(?!${re}))`;
+        a(P(oe(u ? g : f), e));
       }
     } else
       throw new Error(`Unexpected assertion kind "${l}"`);
@@ -9084,10 +9084,10 @@ var pc = {
     else if (l !== "dot") if (l === "text_segment") {
       if (r === "strict")
         throw new Error(v`Use of "\X" requires non-strict accuracy`);
-      const h = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", f = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
+      const h = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", p = v`\p{RI}{2}|${h}(?:\u200D${h})*`;
       n(P(oe(
         // Close approximation of an extended grapheme cluster; see: <unicode.org/reports/tr29/>
-        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : f}|\P{M}\p{M}*)`,
+        v`(?>\r\n|${o ? v`\p{RGI_Emoji}` : p}|\P{M}\p{M}*)`,
         // Allow JS property `RGI_Emoji` through
         { skipPropertyNameValidation: !0 }
       ), e));
@@ -9132,8 +9132,8 @@ var pc = {
       Go(u, { type: "Group" }) && u.body[0].body.length === 1 ? u.body[0] : n;
       if (e.parent !== h || h.body.length > 1)
         throw new Error(v`Uses "\K" in a way that's unsupported`);
-      const f = fe({ behind: !0 });
-      f.body[0].body = s(), o(P(f, e));
+      const p = pe({ behind: !0 });
+      p.body[0].body = s(), o(P(p, e));
     } else
       throw new Error(`Unexpected directive kind "${i}"`);
   },
@@ -9198,7 +9198,7 @@ var pc = {
   NamedCallout({ node: t, parent: e, replaceWith: n }) {
     const { kind: r } = t;
     if (r === "fail")
-      n(P(fe({ negate: !0 }), e));
+      n(P(pe({ negate: !0 }), e));
     else
       throw new Error(`Unsupported named callout "(*${r.toUpperCase()}"`);
   },
@@ -9230,7 +9230,7 @@ var pc = {
     let { ref: n } = t;
     typeof n == "string" && !jt(n) && (n = Bt(n, e), t.ref = n);
   }
-}, fc = {
+}, pc = {
   Backreference({ node: t }, { multiplexCapturesToLeftByRef: e, reffedNodesByReferencer: n }) {
     const { orphan: r, ref: o } = t;
     r || n.set(t, [...e.get(o).map(({ node: s }) => s)]);
@@ -9257,13 +9257,13 @@ var pc = {
       i.set(t.number, t), a.set(t.number, []), t.name && Ve(a, t.name, []);
       const c = a.get(t.name ?? t.number);
       for (let h = 0; h < c.length; h++) {
-        const f = c[h];
+        const p = c[h];
         if (
           // This group is from subroutine expansion, and there's a multiplex value from either the
           // origin node or a prior subroutine expansion group with the same origin
-          u === f.node || u && u === f.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
+          u === p.node || u && u === p.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
           // group that refers to this group
-          t === f.origin
+          t === p.origin
         ) {
           c.splice(h, 1);
           break;
@@ -9271,16 +9271,16 @@ var pc = {
       }
       if (a.get(t.number).push({ node: t, origin: u }), t.name && a.get(t.name).push({ node: t, origin: u }), t.name) {
         const h = Ve(s, t.name, /* @__PURE__ */ new Map());
-        let f = !1;
+        let p = !1;
         if (u)
-          f = !0;
+          p = !0;
         else
           for (const d of h.values())
             if (!d.hasDuplicateNameToRemove) {
-              f = !0;
+              p = !0;
               break;
             }
-        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: f });
+        s.get(t.name).set(t, { node: t, hasDuplicateNameToRemove: p });
       }
     },
     exit({ node: t }, { openRefs: e }) {
@@ -9312,7 +9312,7 @@ var pc = {
     if (!i) {
       const c = Zo(yc(
         a,
-        (f) => f.type === "Group" && !!f.flags
+        (p) => p.type === "Group" && !!p.flags
       )), h = c ? bt(r.globalFlags, c) : r.globalFlags;
       gc(h, r.currentFlags) || (u = Q({
         flags: bc(h)
@@ -9328,7 +9328,7 @@ var pc = {
     }
     const s = r.reffedNodesByReferencer.get(t).filter((a) => mc(a, t));
     if (!s.length)
-      n(P(fe({ negate: !0 }), e));
+      n(P(pe({ negate: !0 }), e));
     else if (s.length > 1) {
       const a = Q({
         atomic: !0,
@@ -9506,8 +9506,8 @@ function Sc(t, e) {
       popModI() {
         d.pop();
       },
-      pushModI(p) {
-        d.push(p);
+      pushModI(f) {
+        d.push(f);
       },
       setHasCasedChar() {
         d.at(-1) ? a = !0 : i = !0;
@@ -9543,15 +9543,15 @@ function Sc(t, e) {
   function h(d) {
     return c.lastNode = u, u = d, nc(vc[d.type], `Unexpected node type "${d.type}"`)(d, c, h);
   }
-  const f = {
+  const p = {
     pattern: t.body.map(h).join("|"),
     // Could reset `lastNode` at this point via `lastNode = ast`, but it isn't needed by flags
     flags: h(t.flags),
     options: { ...t.options }
   };
-  return r || (delete f.options.force.v, f.options.disable.v = !0, f.options.unicodeSetsPlugin = null), f._captureTransfers = /* @__PURE__ */ new Map(), f._hiddenCaptures = [], c.captureMap.forEach((d, p) => {
-    d.hidden && f._hiddenCaptures.push(p), d.transferTo && Ve(f._captureTransfers, d.transferTo, []).push(p);
-  }), f;
+  return r || (delete p.options.force.v, p.options.disable.v = !0, p.options.unicodeSetsPlugin = null), p._captureTransfers = /* @__PURE__ */ new Map(), p._hiddenCaptures = [], c.captureMap.forEach((d, f) => {
+    d.hidden && p._hiddenCaptures.push(f), d.transferTo && Ve(p._captureTransfers, d.transferTo, []).push(f);
+  }), p;
 }
 var kc = {
   "*": {
@@ -9651,10 +9651,10 @@ var kc = {
           (h) => h.type === "CharacterClass" && h.kind === "union" && h.negate
         );
         if (c.length) {
-          const h = Q(), f = h.body[0];
-          return h.parent = s, f.parent = h, a = a.filter((d) => !c.includes(d)), t.body = a, a.length ? (t.parent = f, f.body.push(t)) : h.body.pop(), c.forEach((d) => {
-            const p = me({ body: [d] });
-            d.parent = p, p.parent = h, h.body.push(p);
+          const h = Q(), p = h.body[0];
+          return h.parent = s, p.parent = h, a = a.filter((d) => !c.includes(d)), t.body = a, a.length ? (t.parent = p, p.body.push(t)) : h.body.pop(), c.forEach((d) => {
+            const f = me({ body: [d] });
+            d.parent = f, f.parent = h, h.body.push(f);
           }), n(h);
         }
       }
@@ -10076,11 +10076,11 @@ function Gc(t, e) {
     if (n.lazyCompileLength !== 1 / 0)
       throw new Error("Lazy compilation requires subclass");
   } else {
-    const c = l.hiddenCaptures.sort((p, g) => p - g), h = Array.from(l.captureTransfers), f = o._strategy, d = u.pattern.length >= n.lazyCompileLength;
-    (c.length || h.length || f || d) && (u.options = {
+    const c = l.hiddenCaptures.sort((f, g) => f - g), h = Array.from(l.captureTransfers), p = o._strategy, d = u.pattern.length >= n.lazyCompileLength;
+    (c.length || h.length || p || d) && (u.options = {
       ...c.length && { hiddenCaptures: c },
       ...h.length && { transfers: h },
-      ...f && { strategy: f },
+      ...p && { strategy: p },
       ...d && { lazyCompile: d }
     });
   }
@@ -10305,4 +10305,4 @@ export {
   qr as v,
   la as z
 };
-//# sourceMappingURL=SyntaxHighlight-BD_Z_Csq.js.map
+//# sourceMappingURL=SyntaxHighlight-GR0eix_L.js.map