@foris/avocado-not-front 1.12.0 → 2.0.1

package/dist/code-block-QI2IAROF-C_F85uim-MNaL7yo9.js

@@ -1,2805 +0,0 @@
-import { O as Pe, w as A, L as On, _ as Dn, l as Tn, j as Wn } from "./mermaid-NA5CF7SZ-BDJrKfjz-Cq0tva8U.js";
-import { memo as jn, useMemo as cn, useContext as zn, useState as Vn, useEffect as Hn } from "react";
-import "react-dom";
-var Xn = Object.defineProperty, Zn = Object.getPrototypeOf, qn = Reflect.get, Qn = (e, n, t) => n in e ? Xn(e, n, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[n] = t, pn = (e, n, t) => (Qn(e, typeof n != "symbol" ? n + "" : n, t), t), Re = (e, n, t) => {
-  if (!n.has(e))
-    throw TypeError("Cannot " + t);
-}, E = (e, n, t) => (Re(e, n, "read from private field"), t ? t.call(e) : n.get(e)), Z = (e, n, t) => {
-  if (n.has(e))
-    throw TypeError("Cannot add the same private member more than once");
-  n instanceof WeakSet ? n.add(e) : n.set(e, t);
-}, L = (e, n, t, r) => (Re(e, n, "write to private field"), n.set(e, t), t), Te = (e, n, t) => (Re(e, n, "access private method"), t), Kn = (e, n, t) => qn(Zn(e), t, n);
-function te(e) {
-  if ([...e].length !== 1)
-    throw new Error(`Expected "${e}" to be a single code point`);
-  return e.codePointAt(0);
-}
-function Yn(e, n, t) {
-  return e.has(n) || e.set(n, t), e.get(n);
-}
-const Fe = /* @__PURE__ */ new Set(["alnum", "alpha", "ascii", "blank", "cntrl", "digit", "graph", "lower", "print", "punct", "space", "upper", "word", "xdigit"]), x = String.raw;
-function re(e, n) {
-  if (e == null)
-    throw new Error(n ?? "Value expected");
-  return e;
-}
-const dn = x`\[\^?`, fn = `c.? | C(?:-.?)?|${x`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x20\w]*\})?`}|${x`x[89A-Fa-f]\p{AHex}(?:\\x[89A-Fa-f]\p{AHex})*`}|${x`u(?:\p{AHex}{4})? | x\{[^\}]*\}? | x\p{AHex}{0,2}`}|${x`o\{[^\}]*\}?`}|${x`\d{1,3}`}`, Ue = /[?*+][?+]?|\{(?:\d+(?:,\d*)?|,\d+)\}\??/, le = new RegExp(x`
-  \\ (?:
-    ${fn}
-    | [gk]<[^>]*>?
-    | [gk]'[^']*'?
-    | .
-  )
-  | \( (?:
-    \? (?:
-      [:=!>({]
-      | <[=!]
-      | <[^>]*>
-      | '[^']*'
-      | ~\|?
-      | #(?:[^)\\]|\\.?)*
-      | [^:)]*[:)]
-    )?
-    | \*[^\)]*\)?
-  )?
-  | (?:${Ue.source})+
-  | ${dn}
-  | .
-`.replace(/\s+/g, ""), "gsu"), ye = new RegExp(x`
-  \\ (?:
-    ${fn}
-    | .
-  )
-  | \[:(?:\^?\p{Alpha}+|\^):\]
-  | ${dn}
-  | &&
-  | .
-`.replace(/\s+/g, ""), "gsu");
-function Jn(e, n = {}) {
-  const t = { flags: "", ...n, rules: { captureGroup: !1, singleline: !1, ...n.rules } };
-  if (typeof e != "string")
-    throw new Error("String expected as pattern");
-  const r = yt(t.flags), a = [r.extended], o = { captureGroup: t.rules.captureGroup, getCurrentModX() {
-    return a.at(-1);
-  }, numOpenGroups: 0, popModX() {
-    a.pop();
-  }, pushModX(c) {
-    a.push(c);
-  }, replaceCurrentModX(c) {
-    a[a.length - 1] = c;
-  }, singleline: t.rules.singleline };
-  let s = [], i;
-  for (le.lastIndex = 0; i = le.exec(e); ) {
-    const c = et(o, e, i[0], le.lastIndex);
-    c.tokens ? s.push(...c.tokens) : c.token && s.push(c.token), c.lastIndex !== void 0 && (le.lastIndex = c.lastIndex);
-  }
-  const u = [];
-  let l = 0;
-  s.filter((c) => c.type === "GroupOpen").forEach((c) => {
-    c.kind === "capturing" ? c.number = ++l : c.raw === "(" && u.push(c);
-  }), l || u.forEach((c, d) => {
-    c.kind = "capturing", c.number = d + 1;
-  });
-  const p = l || u.length;
-  return { tokens: s.map((c) => c.type === "EscapedNumber" ? Ct(c, p) : c).flat(), flags: r };
-}
-function et(e, n, t, r) {
-  const [a, o] = t;
-  if (t === "[" || t === "[^") {
-    const s = nt(n, t, r);
-    return { tokens: s.tokens, lastIndex: s.lastIndex };
-  }
-  if (a === "\\") {
-    if ("AbBGyYzZ".includes(o))
-      return { token: We(t, t) };
-    if (/^\\g[<']/.test(t)) {
-      if (!/^\\g(?:<[^>]+>|'[^']+')$/.test(t))
-        throw new Error(`Invalid group name "${t}"`);
-      return { token: pt(t) };
-    }
-    if (/^\\k[<']/.test(t)) {
-      if (!/^\\k(?:<[^>]+>|'[^']+')$/.test(t))
-        throw new Error(`Invalid group name "${t}"`);
-      return { token: hn(t) };
-    }
-    if (o === "K")
-      return { token: wn("keep", t) };
-    if (o === "N" || o === "R")
-      return { token: V("newline", t, { negate: o === "N" }) };
-    if (o === "O")
-      return { token: V("any", t) };
-    if (o === "X")
-      return { token: V("text_segment", t) };
-    const s = gn(t, { inCharClass: !1 });
-    return Array.isArray(s) ? { tokens: s } : { token: s };
-  }
-  if (a === "(") {
-    if (o === "*")
-      return { token: ht(t) };
-    if (t === "(?{")
-      throw new Error(`Unsupported callout "${t}"`);
-    if (t.startsWith("(?#")) {
-      if (n[r] !== ")")
-        throw new Error('Unclosed comment group "(?#"');
-      return { lastIndex: r + 1 };
-    }
-    if (/^\(\?[-imx]+[:)]$/.test(t))
-      return { token: gt(t, e) };
-    if (e.pushModX(e.getCurrentModX()), e.numOpenGroups++, t === "(" && !e.captureGroup || t === "(?:")
-      return { token: ee("group", t) };
-    if (t === "(?>")
-      return { token: ee("atomic", t) };
-    if (t === "(?=" || t === "(?!" || t === "(?<=" || t === "(?<!")
-      return { token: ee(t[2] === "<" ? "lookbehind" : "lookahead", t, { negate: t.endsWith("!") }) };
-    if (t === "(" && e.captureGroup || t.startsWith("(?<") && t.endsWith(">") || t.startsWith("(?'") && t.endsWith("'"))
-      return { token: ee("capturing", t, { ...t !== "(" && { name: t.slice(3, -1) } }) };
-    if (t.startsWith("(?~")) {
-      if (t === "(?~|")
-        throw new Error(`Unsupported absence function kind "${t}"`);
-      return { token: ee("absence_repeater", t) };
-    }
-    throw t === "(?(" ? new Error(`Unsupported conditional "${t}"`) : new Error(`Invalid or unsupported group option "${t}"`);
-  }
-  if (t === ")") {
-    if (e.popModX(), e.numOpenGroups--, e.numOpenGroups < 0)
-      throw new Error('Unmatched ")"');
-    return { token: ut(t) };
-  }
-  if (e.getCurrentModX()) {
-    if (t === "#") {
-      const s = n.indexOf(`
-`, r);
-      return { lastIndex: s === -1 ? n.length : s };
-    }
-    if (/^\s$/.test(t)) {
-      const s = /\s+/y;
-      return s.lastIndex = r, { lastIndex: s.exec(n) ? s.lastIndex : r };
-    }
-  }
-  if (t === ".")
-    return { token: V("dot", t) };
-  if (t === "^" || t === "$") {
-    const s = e.singleline ? { "^": x`\A`, $: x`\Z` }[t] : t;
-    return { token: We(s, t) };
-  }
-  return t === "|" ? { token: rt(t) } : Ue.test(t) ? { tokens: xt(t) } : { token: F(te(t), t) };
-}
-function nt(e, n, t) {
-  const r = [je(n[1] === "^", n)];
-  let a = 1, o;
-  for (ye.lastIndex = t; o = ye.exec(e); ) {
-    const s = o[0];
-    if (s[0] === "[" && s[1] !== ":")
-      a++, r.push(je(s[1] === "^", s));
-    else if (s === "]") {
-      if (r.at(-1).type === "CharacterClassOpen")
-        r.push(F(93, s));
-      else if (a--, r.push(ot(s)), !a)
-        break;
-    } else {
-      const i = tt(s);
-      Array.isArray(i) ? r.push(...i) : r.push(i);
-    }
-  }
-  return { tokens: r, lastIndex: ye.lastIndex || e.length };
-}
-function tt(e) {
-  if (e[0] === "\\")
-    return gn(e, { inCharClass: !0 });
-  if (e[0] === "[") {
-    const n = /\[:(?<negate>\^?)(?<name>[a-z]+):\]/.exec(e);
-    if (!n || !Fe.has(n.groups.name))
-      throw new Error(`Invalid POSIX class "${e}"`);
-    return V("posix", e, { value: n.groups.name, negate: !!n.groups.negate });
-  }
-  return e === "-" ? at(e) : e === "&&" ? st(e) : F(te(e), e);
-}
-function gn(e, { inCharClass: n }) {
-  const t = e[1];
-  if (t === "c" || t === "C")
-    return ft(e);
-  if ("dDhHsSwW".includes(t))
-    return wt(e);
-  if (e.startsWith(x`\o{`))
-    throw new Error(`Incomplete, invalid, or unsupported octal code point "${e}"`);
-  if (/^\\[pP]\{/.test(e)) {
-    if (e.length === 3)
-      throw new Error(`Incomplete or invalid Unicode property "${e}"`);
-    return mt(e);
-  }
-  if (new RegExp("^\\\\x[89A-Fa-f]\\p{AHex}", "u").test(e))
-    try {
-      const r = e.split(/\\x/).slice(1).map((s) => parseInt(s, 16)), a = new TextDecoder("utf-8", { ignoreBOM: !0, fatal: !0 }).decode(new Uint8Array(r)), o = new TextEncoder();
-      return [...a].map((s) => {
-        const i = [...o.encode(s)].map((u) => `\\x${u.toString(16)}`).join("");
-        return F(te(s), i);
-      });
-    } catch {
-      throw new Error(`Multibyte code "${e}" incomplete or invalid in Oniguruma`);
-    }
-  if (t === "u" || t === "x")
-    return F(bt(e), e);
-  if (ze.has(t))
-    return F(ze.get(t), e);
-  if (/\d/.test(t))
-    return it(n, e);
-  if (e === "\\")
-    throw new Error(x`Incomplete escape "\"`);
-  if (t === "M")
-    throw new Error(`Unsupported meta "${e}"`);
-  if ([...e].length === 2)
-    return F(e.codePointAt(1), e);
-  throw new Error(`Unexpected escape "${e}"`);
-}
-function rt(e) {
-  return { type: "Alternator", raw: e };
-}
-function We(e, n) {
-  return { type: "Assertion", kind: e, raw: n };
-}
-function hn(e) {
-  return { type: "Backreference", raw: e };
-}
-function F(e, n) {
-  return { type: "Character", value: e, raw: n };
-}
-function ot(e) {
-  return { type: "CharacterClassClose", raw: e };
-}
-function at(e) {
-  return { type: "CharacterClassHyphen", raw: e };
-}
-function st(e) {
-  return { type: "CharacterClassIntersector", raw: e };
-}
-function je(e, n) {
-  return { type: "CharacterClassOpen", negate: e, raw: n };
-}
-function V(e, n, t = {}) {
-  return { type: "CharacterSet", kind: e, ...t, raw: n };
-}
-function wn(e, n, t = {}) {
-  return e === "keep" ? { type: "Directive", kind: e, raw: n } : { type: "Directive", kind: e, flags: re(t.flags), raw: n };
-}
-function it(e, n) {
-  return { type: "EscapedNumber", inCharClass: e, raw: n };
-}
-function ut(e) {
-  return { type: "GroupClose", raw: e };
-}
-function ee(e, n, t = {}) {
-  return { type: "GroupOpen", kind: e, ...t, raw: n };
-}
-function lt(e, n, t, r) {
-  return { type: "NamedCallout", kind: e, tag: n, arguments: t, raw: r };
-}
-function ct(e, n, t, r) {
-  return { type: "Quantifier", kind: e, min: n, max: t, raw: r };
-}
-function pt(e) {
-  return { type: "Subroutine", raw: e };
-}
-const dt = /* @__PURE__ */ new Set(["COUNT", "CMP", "ERROR", "FAIL", "MAX", "MISMATCH", "SKIP", "TOTAL_COUNT"]), ze = /* @__PURE__ */ new Map([["a", 7], ["b", 8], ["e", 27], ["f", 12], ["n", 10], ["r", 13], ["t", 9], ["v", 11]]);
-function ft(e) {
-  const n = e[1] === "c" ? e[2] : e[3];
-  if (!n || !/[A-Za-z]/.test(n))
-    throw new Error(`Unsupported control character "${e}"`);
-  return F(te(n.toUpperCase()) - 64, e);
-}
-function gt(e, n) {
-  let { on: t, off: r } = /^\(\?(?<on>[imx]*)(?:-(?<off>[-imx]*))?/.exec(e).groups;
-  r ?? (r = "");
-  const a = (n.getCurrentModX() || t.includes("x")) && !r.includes("x"), o = He(t), s = He(r), i = {};
-  if (o && (i.enable = o), s && (i.disable = s), e.endsWith(")"))
-    return n.replaceCurrentModX(a), wn("flags", e, { flags: i });
-  if (e.endsWith(":"))
-    return n.pushModX(a), n.numOpenGroups++, ee("group", e, { ...(o || s) && { flags: i } });
-  throw new Error(`Unexpected flag modifier "${e}"`);
-}
-function ht(e) {
-  const n = /\(\*(?<name>[A-Za-z_]\w*)?(?:\[(?<tag>(?:[A-Za-z_]\w*)?)\])?(?:\{(?<args>[^}]*)\})?\)/.exec(e);
-  if (!n)
-    throw new Error(`Incomplete or invalid named callout "${e}"`);
-  const { name: t, tag: r, args: a } = n.groups;
-  if (!t)
-    throw new Error(`Invalid named callout "${e}"`);
-  if (r === "")
-    throw new Error(`Named callout tag with empty value not allowed "${e}"`);
-  const o = a ? a.split(",").filter((p) => p !== "").map((p) => /^[+-]?\d+$/.test(p) ? +p : p) : [], [s, i, u] = o, l = dt.has(t) ? t.toLowerCase() : "custom";
-  switch (l) {
-    case "fail":
-    case "mismatch":
-    case "skip":
-      if (o.length > 0)
-        throw new Error(`Named callout arguments not allowed "${o}"`);
-      break;
-    case "error":
-      if (o.length > 1)
-        throw new Error(`Named callout allows only one argument "${o}"`);
-      if (typeof s == "string")
-        throw new Error(`Named callout argument must be a number "${s}"`);
-      break;
-    case "max":
-      if (!o.length || o.length > 2)
-        throw new Error(`Named callout must have one or two arguments "${o}"`);
-      if (typeof s == "string" && !/^[A-Za-z_]\w*$/.test(s))
-        throw new Error(`Named callout argument one must be a tag or number "${s}"`);
-      if (o.length === 2 && (typeof i == "number" || !/^[<>X]$/.test(i)))
-        throw new Error(`Named callout optional argument two must be '<', '>', or 'X' "${i}"`);
-      break;
-    case "count":
-    case "total_count":
-      if (o.length > 1)
-        throw new Error(`Named callout allows only one argument "${o}"`);
-      if (o.length === 1 && (typeof s == "number" || !/^[<>X]$/.test(s)))
-        throw new Error(`Named callout optional argument must be '<', '>', or 'X' "${s}"`);
-      break;
-    case "cmp":
-      if (o.length !== 3)
-        throw new Error(`Named callout must have three arguments "${o}"`);
-      if (typeof s == "string" && !/^[A-Za-z_]\w*$/.test(s))
-        throw new Error(`Named callout argument one must be a tag or number "${s}"`);
-      if (typeof i == "number" || !/^(?:[<>!=]=|[<>])$/.test(i))
-        throw new Error(`Named callout argument two must be '==', '!=', '>', '<', '>=', or '<=' "${i}"`);
-      if (typeof u == "string" && !/^[A-Za-z_]\w*$/.test(u))
-        throw new Error(`Named callout argument three must be a tag or number "${u}"`);
-      break;
-    case "custom":
-      throw new Error(`Undefined callout name "${t}"`);
-    default:
-      throw new Error(`Unexpected named callout kind "${l}"`);
-  }
-  return lt(l, r ?? null, (a == null ? void 0 : a.split(",")) ?? null, e);
-}
-function Ve(e) {
-  let n = null, t, r;
-  if (e[0] === "{") {
-    const { minStr: a, maxStr: o } = /^\{(?<minStr>\d*)(?:,(?<maxStr>\d*))?/.exec(e).groups, s = 1e5;
-    if (+a > s || o && +o > s)
-      throw new Error("Quantifier value unsupported in Oniguruma");
-    if (t = +a, r = o === void 0 ? +a : o === "" ? 1 / 0 : +o, t > r && (n = "possessive", [t, r] = [r, t]), e.endsWith("?")) {
-      if (n === "possessive")
-        throw new Error('Unsupported possessive interval quantifier chain with "?"');
-      n = "lazy";
-    } else
-      n || (n = "greedy");
-  } else
-    t = e[0] === "+" ? 1 : 0, r = e[0] === "?" ? 1 : 1 / 0, n = e[1] === "+" ? "possessive" : e[1] === "?" ? "lazy" : "greedy";
-  return ct(n, t, r, e);
-}
-function wt(e) {
-  const n = e[1].toLowerCase();
-  return V({ d: "digit", h: "hex", s: "space", w: "word" }[n], e, { negate: e[1] !== n });
-}
-function mt(e) {
-  const { p: n, neg: t, value: r } = /^\\(?<p>[pP])\{(?<neg>\^?)(?<value>[^}]+)/.exec(e).groups;
-  return V("property", e, { value: r, negate: n === "P" && !t || n === "p" && !!t });
-}
-function He(e) {
-  const n = {};
-  return e.includes("i") && (n.ignoreCase = !0), e.includes("m") && (n.dotAll = !0), e.includes("x") && (n.extended = !0), Object.keys(n).length ? n : null;
-}
-function yt(e) {
-  const n = { ignoreCase: !1, dotAll: !1, extended: !1, digitIsAscii: !1, posixIsAscii: !1, spaceIsAscii: !1, wordIsAscii: !1, textSegmentMode: null };
-  for (let t = 0; t < e.length; t++) {
-    const r = e[t];
-    if (!"imxDPSWy".includes(r))
-      throw new Error(`Invalid flag "${r}"`);
-    if (r === "y") {
-      if (!/^y{[gw]}/.test(e.slice(t)))
-        throw new Error('Invalid or unspecified flag "y" mode');
-      n.textSegmentMode = e[t + 2] === "g" ? "grapheme" : "word", t += 3;
-      continue;
-    }
-    n[{ i: "ignoreCase", m: "dotAll", x: "extended", D: "digitIsAscii", P: "posixIsAscii", S: "spaceIsAscii", W: "wordIsAscii" }[r]] = !0;
-  }
-  return n;
-}
-function bt(e) {
-  if (new RegExp("^(?:\\\\u(?!\\p{AHex}{4})|\\\\x(?!\\p{AHex}{1,2}|\\{\\p{AHex}{1,8}\\}))", "u").test(e))
-    throw new Error(`Incomplete or invalid escape "${e}"`);
-  const n = e[2] === "{" ? new RegExp("^\\\\x\\{\\s*(?<hex>\\p{AHex}+)", "u").exec(e).groups.hex : e.slice(2);
-  return parseInt(n, 16);
-}
-function Ct(e, n) {
-  const { raw: t, inCharClass: r } = e, a = t.slice(1);
-  if (!r && (a !== "0" && a.length === 1 || a[0] !== "0" && +a <= n))
-    return [hn(t)];
-  const o = [], s = a.match(/^[0-7]+|\d/g);
-  for (let i = 0; i < s.length; i++) {
-    const u = s[i];
-    let l;
-    if (i === 0 && u !== "8" && u !== "9") {
-      if (l = parseInt(u, 8), l > 127)
-        throw new Error(x`Octal encoded byte above 177 unsupported "${t}"`);
-    } else
-      l = te(u);
-    o.push(F(l, (i === 0 ? "\\" : "") + u));
-  }
-  return o;
-}
-function xt(e) {
-  const n = [], t = new RegExp(Ue, "gy");
-  let r;
-  for (; r = t.exec(e); ) {
-    const a = r[0];
-    if (a[0] === "{") {
-      const o = /^\{(?<min>\d+),(?<max>\d+)\}\??$/.exec(a);
-      if (o) {
-        const { min: s, max: i } = o.groups;
-        if (+s > +i && a.endsWith("?")) {
-          t.lastIndex--, n.push(Ve(a.slice(0, -1)));
-          continue;
-        }
-      }
-    }
-    n.push(Ve(a));
-  }
-  return n;
-}
-function mn(e, n) {
-  if (!Array.isArray(e.body))
-    throw new Error("Expected node with body array");
-  if (e.body.length !== 1)
-    return !1;
-  const t = e.body[0];
-  return !n || Object.keys(n).every((r) => n[r] === t[r]);
-}
-function kt(e) {
-  return Et.has(e.type);
-}
-const Et = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
-function yn(e, n = {}) {
-  const t = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...n, rules: { captureGroup: !1, singleline: !1, ...n.rules } }, r = Jn(e, { flags: t.flags, rules: { captureGroup: t.rules.captureGroup, singleline: t.rules.singleline } }), a = (d, g) => {
-    const f = r.tokens[o.nextIndex];
-    switch (o.parent = d, o.nextIndex++, f.type) {
-      case "Alternator":
-        return H();
-      case "Assertion":
-        return $t(f);
-      case "Backreference":
-        return vt(f, o);
-      case "Character":
-        return he(f.value, { useLastValid: !!g.isCheckingRangeEnd });
-      case "CharacterClassHyphen":
-        return At(f, o, g);
-      case "CharacterClassOpen":
-        return It(f, o, g);
-      case "CharacterSet":
-        return St(f, o);
-      case "Directive":
-        return Rt(f.kind, { flags: f.flags });
-      case "GroupOpen":
-        return _t(f, o, g);
-      case "NamedCallout":
-        return Ut(f.kind, f.tag, f.arguments);
-      case "Quantifier":
-        return Nt(f, o);
-      case "Subroutine":
-        return Mt(f, o);
-      default:
-        throw new Error(`Unexpected token type "${f.type}"`);
-    }
-  }, o = { capturingGroups: [], hasNumberedRef: !1, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: t.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: t.skipBackrefValidation, skipLookbehindValidation: t.skipLookbehindValidation, skipPropertyNameValidation: t.skipPropertyNameValidation, subroutines: [], tokens: r.tokens, unicodePropertyMap: t.unicodePropertyMap, walk: a }, s = Gt(Ft(r.flags));
-  let i = s.body[0];
-  for (; o.nextIndex < r.tokens.length; ) {
-    const d = a(i, {});
-    d.type === "Alternative" ? (s.body.push(d), i = d) : i.body.push(d);
-  }
-  const { capturingGroups: u, hasNumberedRef: l, namedGroupsByName: p, subroutines: c } = o;
-  if (l && p.size && !t.rules.captureGroup)
-    throw new Error("Numbered backref/subroutine not allowed when using named capture");
-  for (const { ref: d } of c)
-    if (typeof d == "number") {
-      if (d > u.length)
-        throw new Error("Subroutine uses a group number that's not defined");
-      d && (u[d - 1].isSubroutined = !0);
-    } else if (p.has(d)) {
-      if (p.get(d).length > 1)
-        throw new Error(x`Subroutine uses a duplicate group name "\g<${d}>"`);
-      p.get(d)[0].isSubroutined = !0;
-    } else
-      throw new Error(x`Subroutine uses a group name that's not defined "\g<${d}>"`);
-  return s;
-}
-function $t({ kind: e }) {
-  return Se(re({ "^": "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" }[e], `Unexpected assertion kind "${e}"`), { negate: e === x`\B` || e === x`\Y` });
-}
-function vt({ raw: e }, n) {
-  const t = /^\\k[<']/.test(e), r = t ? e.slice(3, -1) : e.slice(1), a = (o, s = !1) => {
-    const i = n.capturingGroups.length;
-    let u = !1;
-    if (o > i)
-      if (n.skipBackrefValidation)
-        u = !0;
-      else
-        throw new Error(`Not enough capturing groups defined to the left "${e}"`);
-    return n.hasNumberedRef = !0, _e(s ? i + 1 - o : o, { orphan: u });
-  };
-  if (t) {
-    const o = /^(?<sign>-?)0*(?<num>[1-9]\d*)$/.exec(r);
-    if (o)
-      return a(+o.groups.num, !!o.groups.sign);
-    if (/[-+]/.test(r))
-      throw new Error(`Invalid backref name "${e}"`);
-    if (!n.namedGroupsByName.has(r))
-      throw new Error(`Group name not defined to the left "${e}"`);
-    return _e(r);
-  }
-  return a(+r);
-}
-function At(e, n, t) {
-  const { tokens: r, walk: a } = n, o = n.parent, s = o.body.at(-1), i = r[n.nextIndex];
-  if (!t.isCheckingRangeEnd && s && s.type !== "CharacterClass" && s.type !== "CharacterClassRange" && i && i.type !== "CharacterClassOpen" && i.type !== "CharacterClassClose" && i.type !== "CharacterClassIntersector") {
-    const u = a(o, { ...t, isCheckingRangeEnd: !0 });
-    if (s.type === "Character" && u.type === "Character")
-      return o.body.pop(), Pt(s, u);
-    throw new Error("Invalid character class range");
-  }
-  return he(te("-"));
-}
-function It({ negate: e }, n, t) {
-  const { tokens: r, walk: a } = n, o = r[n.nextIndex], s = [fe()];
-  let i = qe(o);
-  for (; i.type !== "CharacterClassClose"; ) {
-    if (i.type === "CharacterClassIntersector")
-      s.push(fe()), n.nextIndex++;
-    else {
-      const l = s.at(-1);
-      l.body.push(a(l, t));
-    }
-    i = qe(r[n.nextIndex], o);
-  }
-  const u = fe({ negate: e });
-  return s.length === 1 ? u.body = s[0].body : (u.kind = "intersection", u.body = s.map((l) => l.body.length === 1 ? l.body[0] : l)), n.nextIndex++, u;
-}
-function St({ kind: e, negate: n, value: t }, r) {
-  const { normalizeUnknownPropertyNames: a, skipPropertyNameValidation: o, unicodePropertyMap: s } = r;
-  if (e === "property") {
-    const i = we(t);
-    if (Fe.has(i) && !(s != null && s.has(i)))
-      e = "posix", t = i;
-    else
-      return ne(t, { negate: n, normalizeUnknownPropertyNames: a, skipPropertyNameValidation: o, unicodePropertyMap: s });
-  }
-  return e === "posix" ? Bt(t, { negate: n }) : Ne(e, { negate: n });
-}
-function _t(e, n, t) {
-  const { tokens: r, capturingGroups: a, namedGroupsByName: o, skipLookbehindValidation: s, walk: i } = n, u = Ot(e), l = u.type === "AbsenceFunction", p = Ze(u), c = p && u.negate;
-  if (u.type === "CapturingGroup" && (a.push(u), u.name && Yn(o, u.name, []).push(u)), l && t.isInAbsenceFunction)
-    throw new Error("Nested absence function not supported by Oniguruma");
-  let d = Qe(r[n.nextIndex]);
-  for (; d.type !== "GroupClose"; ) {
-    if (d.type === "Alternator")
-      u.body.push(H()), n.nextIndex++;
-    else {
-      const g = u.body.at(-1), f = i(g, { ...t, isInAbsenceFunction: t.isInAbsenceFunction || l, isInLookbehind: t.isInLookbehind || p, isInNegLookbehind: t.isInNegLookbehind || c });
-      if (g.body.push(f), (p || t.isInLookbehind) && !s) {
-        const w = "Lookbehind includes a pattern not allowed by Oniguruma";
-        if (c || t.isInNegLookbehind) {
-          if (Xe(f) || f.type === "CapturingGroup")
-            throw new Error(w);
-        } else if (Xe(f) || Ze(f) && f.negate)
-          throw new Error(w);
-      }
-    }
-    d = Qe(r[n.nextIndex]);
-  }
-  return n.nextIndex++, u;
-}
-function Nt({ kind: e, min: n, max: t }, r) {
-  const a = r.parent, o = a.body.at(-1);
-  if (!o || !kt(o))
-    throw new Error("Quantifier requires a repeatable token");
-  const s = Cn(e, n, t, o);
-  return a.body.pop(), s;
-}
-function Mt({ raw: e }, n) {
-  const { capturingGroups: t, subroutines: r } = n;
-  let a = e.slice(3, -1);
-  const o = /^(?<sign>[-+]?)0*(?<num>[1-9]\d*)$/.exec(a);
-  if (o) {
-    const i = +o.groups.num, u = t.length;
-    if (n.hasNumberedRef = !0, a = { "": i, "+": u + i, "-": u + 1 - i }[o.groups.sign], a < 1)
-      throw new Error("Invalid subroutine number");
-  } else
-    a === "0" && (a = 0);
-  const s = xn(a);
-  return r.push(s), s;
-}
-function Lt(e, n) {
-  return { type: "AbsenceFunction", kind: e, body: ue(void 0) };
-}
-function H(e) {
-  return { type: "Alternative", body: kn(e == null ? void 0 : e.body) };
-}
-function Se(e, n) {
-  const t = { type: "Assertion", kind: e };
-  return (e === "word_boundary" || e === "text_segment_boundary") && (t.negate = !!(n != null && n.negate)), t;
-}
-function _e(e, n) {
-  const t = !!(n != null && n.orphan);
-  return { type: "Backreference", ref: e, ...t && { orphan: t } };
-}
-function bn(e, n) {
-  const t = { name: void 0, isSubroutined: !1, ...n };
-  if (t.name !== void 0 && !Dt(t.name))
-    throw new Error(`Group name "${t.name}" invalid in Oniguruma`);
-  return { type: "CapturingGroup", number: e, ...t.name && { name: t.name }, ...t.isSubroutined && { isSubroutined: t.isSubroutined }, body: ue(n == null ? void 0 : n.body) };
-}
-function he(e, n) {
-  const t = { useLastValid: !1, ...n };
-  if (e > 1114111) {
-    const r = e.toString(16);
-    if (t.useLastValid)
-      e = 1114111;
-    else
-      throw e > 1310719 ? new Error(`Invalid code point out of range "\\x{${r}}"`) : new Error(`Invalid code point out of range in JS "\\x{${r}}"`);
-  }
-  return { type: "Character", value: e };
-}
-function fe(e) {
-  const n = { kind: "union", negate: !1, ...e };
-  return { type: "CharacterClass", kind: n.kind, negate: n.negate, body: kn(e == null ? void 0 : e.body) };
-}
-function Pt(e, n) {
-  if (n.value < e.value)
-    throw new Error("Character class range out of order");
-  return { type: "CharacterClassRange", min: e, max: n };
-}
-function Ne(e, n) {
-  const t = !!(n != null && n.negate), r = { type: "CharacterSet", kind: e };
-  return (e === "digit" || e === "hex" || e === "newline" || e === "space" || e === "word") && (r.negate = t), (e === "text_segment" || e === "newline" && !t) && (r.variableLength = !0), r;
-}
-function Rt(e, n = {}) {
-  if (e === "keep")
-    return { type: "Directive", kind: e };
-  if (e === "flags")
-    return { type: "Directive", kind: e, flags: re(n.flags) };
-  throw new Error(`Unexpected directive kind "${e}"`);
-}
-function Ft(e) {
-  return { type: "Flags", ...e };
-}
-function N(e) {
-  const n = e == null ? void 0 : e.atomic, t = e == null ? void 0 : e.flags;
-  if (n && t)
-    throw new Error("Atomic group cannot have flags");
-  return { type: "Group", ...n && { atomic: n }, ...t && { flags: t }, body: ue(e == null ? void 0 : e.body) };
-}
-function z(e) {
-  const n = { behind: !1, negate: !1, ...e };
-  return { type: "LookaroundAssertion", kind: n.behind ? "lookbehind" : "lookahead", negate: n.negate, body: ue(e == null ? void 0 : e.body) };
-}
-function Ut(e, n, t) {
-  return { type: "NamedCallout", kind: e, tag: n, arguments: t };
-}
-function Bt(e, n) {
-  const t = !!(n != null && n.negate);
-  if (!Fe.has(e))
-    throw new Error(`Invalid POSIX class "${e}"`);
-  return { type: "CharacterSet", kind: "posix", value: e, negate: t };
-}
-function Cn(e, n, t, r) {
-  if (n > t)
-    throw new Error("Invalid reversed quantifier range");
-  return { type: "Quantifier", kind: e, min: n, max: t, body: r };
-}
-function Gt(e, n) {
-  return { type: "Regex", body: ue(void 0), flags: e };
-}
-function xn(e) {
-  return { type: "Subroutine", ref: e };
-}
-function ne(e, n) {
-  var t;
-  const r = { negate: !1, normalizeUnknownPropertyNames: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...n };
-  let a = (t = r.unicodePropertyMap) == null ? void 0 : t.get(we(e));
-  if (!a) {
-    if (r.normalizeUnknownPropertyNames)
-      a = Tt(e);
-    else if (r.unicodePropertyMap && !r.skipPropertyNameValidation)
-      throw new Error(x`Invalid Unicode property "\p{${e}}"`);
-  }
-  return { type: "CharacterSet", kind: "property", value: a ?? e, negate: r.negate };
-}
-function Ot({ flags: e, kind: n, name: t, negate: r, number: a }) {
-  switch (n) {
-    case "absence_repeater":
-      return Lt("repeater");
-    case "atomic":
-      return N({ atomic: !0 });
-    case "capturing":
-      return bn(a, { name: t });
-    case "group":
-      return N({ flags: e });
-    case "lookahead":
-    case "lookbehind":
-      return z({ behind: n === "lookbehind", negate: r });
-    default:
-      throw new Error(`Unexpected group kind "${n}"`);
-  }
-}
-function ue(e) {
-  if (e === void 0)
-    e = [H()];
-  else if (!Array.isArray(e) || !e.length || !e.every((n) => n.type === "Alternative"))
-    throw new Error("Invalid body; expected array of one or more Alternative nodes");
-  return e;
-}
-function kn(e) {
-  if (e === void 0)
-    e = [];
-  else if (!Array.isArray(e) || !e.every((n) => !!n.type))
-    throw new Error("Invalid body; expected array of nodes");
-  return e;
-}
-function Xe(e) {
-  return e.type === "LookaroundAssertion" && e.kind === "lookahead";
-}
-function Ze(e) {
-  return e.type === "LookaroundAssertion" && e.kind === "lookbehind";
-}
-function Dt(e) {
-  return /^[\p{Alpha}\p{Pc}][^)]*$/u.test(e);
-}
-function Tt(e) {
-  return e.trim().replace(/[- _]+/g, "_").replace(/[A-Z][a-z]+(?=[A-Z])/g, "$&_").replace(/[A-Za-z]+/g, (n) => n[0].toUpperCase() + n.slice(1).toLowerCase());
-}
-function we(e) {
-  return e.replace(/[- _]+/g, "").toLowerCase();
-}
-function qe(e, n) {
-  return re(e, `${(n == null ? void 0 : n.type) === "Character" && n.value === 93 ? "Empty" : "Unclosed"} character class`);
-}
-function Qe(e) {
-  return re(e, "Unclosed group");
-}
-function se(e, n, t = null) {
-  function r(o, s) {
-    for (let i = 0; i < o.length; i++) {
-      const u = a(o[i], s, i, o);
-      i = Math.max(-1, i + u);
-    }
-  }
-  function a(o, s = null, i = null, u = null) {
-    var l, p;
-    let c = 0, d = !1;
-    const g = { node: o, parent: s, key: i, container: u, root: e, remove() {
-      ce(u).splice(Math.max(0, q(i) + c), 1), c--, d = !0;
-    }, removeAllNextSiblings() {
-      return ce(u).splice(q(i) + 1);
-    }, removeAllPrevSiblings() {
-      const y = q(i) + c;
-      return c -= y, ce(u).splice(0, Math.max(0, y));
-    }, replaceWith(y, k = {}) {
-      const S = !!k.traverse;
-      u ? u[Math.max(0, q(i) + c)] = y : re(s, "Can't replace root node")[i] = y, S && a(y, s, i, u), d = !0;
-    }, replaceWithMultiple(y, k = {}) {
-      const S = !!k.traverse;
-      if (ce(u).splice(Math.max(0, q(i) + c), 1, ...y), c += y.length - 1, S) {
-        let D = 0;
-        for (let _ = 0; _ < y.length; _++)
-          D += a(y[_], s, q(i) + _ + D, u);
-      }
-      d = !0;
-    }, skip() {
-      d = !0;
-    } }, { type: f } = o, w = n["*"], m = n[f], M = typeof w == "function" ? w : w == null ? void 0 : w.enter, $ = typeof m == "function" ? m : m == null ? void 0 : m.enter;
-    if (M == null || M(g, t), $ == null || $(g, t), !d)
-      switch (f) {
-        case "AbsenceFunction":
-        case "CapturingGroup":
-        case "Group":
-          r(o.body, o);
-          break;
-        case "Alternative":
-        case "CharacterClass":
-          r(o.body, o);
-          break;
-        case "Assertion":
-        case "Backreference":
-        case "Character":
-        case "CharacterSet":
-        case "Directive":
-        case "Flags":
-        case "NamedCallout":
-        case "Subroutine":
-          break;
-        case "CharacterClassRange":
-          a(o.min, o, "min"), a(o.max, o, "max");
-          break;
-        case "LookaroundAssertion":
-          r(o.body, o);
-          break;
-        case "Quantifier":
-          a(o.body, o, "body");
-          break;
-        case "Regex":
-          r(o.body, o), a(o.flags, o, "flags");
-          break;
-        default:
-          throw new Error(`Unexpected node type "${f}"`);
-      }
-    return (l = m == null ? void 0 : m.exit) == null || l.call(m, g, t), (p = w == null ? void 0 : w.exit) == null || p.call(w, g, t), c;
-  }
-  return a(e), e;
-}
-function ce(e) {
-  if (!Array.isArray(e))
-    throw new Error("Container expected");
-  return e;
-}
-function q(e) {
-  if (typeof e != "number")
-    throw new Error("Numeric key expected");
-  return e;
-}
-const Wt = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
-function jt(e, n) {
-  for (let t = 0; t < e.length; t++)
-    e[t] >= n && e[t]++;
-}
-function zt(e, n, t, r) {
-  return e.slice(0, n) + r + e.slice(n + t.length);
-}
-const I = Object.freeze({
-  DEFAULT: "DEFAULT",
-  CHAR_CLASS: "CHAR_CLASS"
-});
-function Be(e, n, t, r) {
-  const a = new RegExp(String.raw`${n}|(?<$skip>\[\^?|\\?.)`, "gsu"), o = [!1];
-  let s = 0, i = "";
-  for (const u of e.matchAll(a)) {
-    const { 0: l, groups: { $skip: p } } = u;
-    if (!p && (!r || r === I.DEFAULT == !s)) {
-      t instanceof Function ? i += t(u, {
-        context: s ? I.CHAR_CLASS : I.DEFAULT,
-        negated: o[o.length - 1]
-      }) : i += t;
-      continue;
-    }
-    l[0] === "[" ? (s++, o.push(l[1] === "^")) : l === "]" && s && (s--, o.pop()), i += l;
-  }
-  return i;
-}
-function En(e, n, t, r) {
-  Be(e, n, t, r);
-}
-function Vt(e, n, t = 0, r) {
-  if (!new RegExp(n, "su").test(e))
-    return null;
-  const a = new RegExp(`${n}|(?<$skip>\\\\?.)`, "gsu");
-  a.lastIndex = t;
-  let o = 0, s;
-  for (; s = a.exec(e); ) {
-    const { 0: i, groups: { $skip: u } } = s;
-    if (!u && (!r || r === I.DEFAULT == !o))
-      return s;
-    i === "[" ? o++ : i === "]" && o && o--, a.lastIndex == s.index && a.lastIndex++;
-  }
-  return null;
-}
-function pe(e, n, t) {
-  return !!Vt(e, n, 0, t);
-}
-function Ht(e, n) {
-  const t = /\\?./gsu;
-  t.lastIndex = n;
-  let r = e.length, a = 0, o = 1, s;
-  for (; s = t.exec(e); ) {
-    const [i] = s;
-    if (i === "[")
-      a++;
-    else if (a)
-      i === "]" && a--;
-    else if (i === "(")
-      o++;
-    else if (i === ")" && (o--, !o)) {
-      r = s.index;
-      break;
-    }
-  }
-  return e.slice(n, r);
-}
-const Ke = new RegExp(String.raw`(?<noncapturingStart>${Wt})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
-function Xt(e, n) {
-  const t = (n == null ? void 0 : n.hiddenCaptures) ?? [];
-  let r = (n == null ? void 0 : n.captureTransfers) ?? /* @__PURE__ */ new Map();
-  if (!/\(\?>/.test(e))
-    return {
-      pattern: e,
-      captureTransfers: r,
-      hiddenCaptures: t
-    };
-  const a = "(?>", o = "(?:(?=(", s = [0], i = [];
-  let u = 0, l = 0, p = NaN, c;
-  do {
-    c = !1;
-    let d = 0, g = 0, f = !1, w;
-    for (Ke.lastIndex = Number.isNaN(p) ? 0 : p + o.length; w = Ke.exec(e); ) {
-      const { 0: m, index: M, groups: { capturingStart: $, noncapturingStart: y } } = w;
-      if (m === "[")
-        d++;
-      else if (d)
-        m === "]" && d--;
-      else if (m === a && !f)
-        p = M, f = !0;
-      else if (f && y)
-        g++;
-      else if ($)
-        f ? g++ : (u++, s.push(u + l));
-      else if (m === ")" && f) {
-        if (!g) {
-          l++;
-          const k = u + l;
-          if (e = `${e.slice(0, p)}${o}${e.slice(p + a.length, M)}))<$$${k}>)${e.slice(M + 1)}`, c = !0, i.push(k), jt(t, k), r.size) {
-            const S = /* @__PURE__ */ new Map();
-            r.forEach((D, _) => {
-              S.set(
-                _ >= k ? _ + 1 : _,
-                D.map((X) => X >= k ? X + 1 : X)
-              );
-            }), r = S;
-          }
-          break;
-        }
-        g--;
-      }
-    }
-  } while (c);
-  return t.push(...i), e = Be(
-    e,
-    String.raw`\\(?<backrefNum>[1-9]\d*)|<\$\$(?<wrappedBackrefNum>\d+)>`,
-    ({ 0: d, groups: { backrefNum: g, wrappedBackrefNum: f } }) => {
-      if (g) {
-        const w = +g;
-        if (w > s.length - 1)
-          throw new Error(`Backref "${d}" greater than number of captures`);
-        return `\\${s[w]}`;
-      }
-      return `\\${f}`;
-    },
-    I.DEFAULT
-  ), {
-    pattern: e,
-    captureTransfers: r,
-    hiddenCaptures: t
-  };
-}
-const $n = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, be = new RegExp(String.raw`
-\\(?: \d+
-  | c[A-Za-z]
-  | [gk]<[^>]+>
-  | [pPu]\{[^\}]+\}
-  | u[A-Fa-f\d]{4}
-  | x[A-Fa-f\d]{2}
-  )
-| \((?: \? (?: [:=!>]
-  | <(?:[=!]|[^>]+>)
-  | [A-Za-z\-]+:
-  | \(DEFINE\)
-  ))?
-| (?<qBase>${$n})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
-| \\?.
-`.replace(/\s+/g, ""), "gsu");
-function Zt(e) {
-  if (!new RegExp(`${$n}\\+`).test(e))
-    return {
-      pattern: e
-    };
-  const n = [];
-  let t = null, r = null, a = "", o = 0, s;
-  for (be.lastIndex = 0; s = be.exec(e); ) {
-    const { 0: i, index: u, groups: { qBase: l, qMod: p, invalidQ: c } } = s;
-    if (i === "[")
-      o || (r = u), o++;
-    else if (i === "]")
-      o ? o-- : r = null;
-    else if (!o)
-      if (p === "+" && a && !a.startsWith("(")) {
-        if (c)
-          throw new Error(`Invalid quantifier "${i}"`);
-        let d = -1;
-        if (/^\{\d+\}$/.test(l))
-          e = zt(e, u + l.length, p, "");
-        else {
-          if (a === ")" || a === "]") {
-            const g = a === ")" ? t : r;
-            if (g === null)
-              throw new Error(`Invalid unmatched "${a}"`);
-            e = `${e.slice(0, g)}(?>${e.slice(g, u)}${l})${e.slice(u + i.length)}`;
-          } else
-            e = `${e.slice(0, u - a.length)}(?>${a}${l})${e.slice(u + i.length)}`;
-          d += 4;
-        }
-        be.lastIndex += d;
-      } else
-        i[0] === "(" ? n.push(u) : i === ")" && (t = n.length ? n.pop() : null);
-    a = i;
-  }
-  return {
-    pattern: e
-  };
-}
-const v = String.raw, qt = v`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, Me = v`\(\?R=(?<rDepth>[^\)]+)\)|${qt}`, me = v`\(\?<(?![=!])(?<captureName>[^>]+)>`, vn = v`${me}|(?<unnamed>\()(?!\?)`, T = new RegExp(v`${me}|${Me}|\(\?|\\?.`, "gsu"), Ce = "Cannot use multiple overlapping recursions";
-function Qt(e, n) {
-  const { hiddenCaptures: t, mode: r } = {
-    hiddenCaptures: [],
-    mode: "plugin",
-    ...n
-  };
-  let a = (n == null ? void 0 : n.captureTransfers) ?? /* @__PURE__ */ new Map();
-  if (!new RegExp(Me, "su").test(e))
-    return {
-      pattern: e,
-      captureTransfers: a,
-      hiddenCaptures: t
-    };
-  if (r === "plugin" && pe(e, v`\(\?\(DEFINE\)`, I.DEFAULT))
-    throw new Error("DEFINE groups cannot be used with recursion");
-  const o = [], s = pe(e, v`\\[1-9]`, I.DEFAULT), i = /* @__PURE__ */ new Map(), u = [];
-  let l = !1, p = 0, c = 0, d;
-  for (T.lastIndex = 0; d = T.exec(e); ) {
-    const { 0: g, groups: { captureName: f, rDepth: w, gRNameOrNum: m, gRDepth: M } } = d;
-    if (g === "[")
-      p++;
-    else if (p)
-      g === "]" && p--;
-    else if (w) {
-      if (Ye(w), l)
-        throw new Error(Ce);
-      if (s)
-        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 global recursion`
-        );
-      const $ = e.slice(0, d.index), y = e.slice(T.lastIndex);
-      if (pe(y, Me, I.DEFAULT))
-        throw new Error(Ce);
-      const k = +w - 1;
-      e = Je(
-        $,
-        y,
-        k,
-        !1,
-        t,
-        o,
-        c
-      ), a = nn(
-        a,
-        $,
-        k,
-        o.length,
-        0,
-        c
-      );
-      break;
-    } else if (m) {
-      Ye(M);
-      let $ = !1;
-      for (const oe of u)
-        if (oe.name === m || oe.num === +m) {
-          if ($ = !0, oe.hasRecursedWithin)
-            throw new Error(Ce);
-          break;
-        }
-      if (!$)
-        throw new Error(v`Recursive \g cannot be used outside the referenced group "${r === "external" ? m : v`\g<${m}&R=${M}>`}"`);
-      const y = i.get(m), k = Ht(e, y);
-      if (s && pe(k, v`${me}|\((?!\?)`, I.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 S = e.slice(y, d.index), D = k.slice(S.length + g.length), _ = o.length, X = +M - 1, De = Je(
-        S,
-        D,
-        X,
-        !0,
-        t,
-        o,
-        c
-      );
-      a = nn(
-        a,
-        S,
-        X,
-        o.length - _,
-        _,
-        c
-      );
-      const Bn = e.slice(0, y), Gn = e.slice(y + k.length);
-      e = `${Bn}${De}${Gn}`, T.lastIndex += De.length - g.length - S.length - D.length, u.forEach((oe) => oe.hasRecursedWithin = !0), l = !0;
-    } else if (f)
-      c++, i.set(String(c), T.lastIndex), i.set(f, T.lastIndex), u.push({
-        num: c,
-        name: f
-      });
-    else if (g[0] === "(") {
-      const $ = g === "(";
-      $ && (c++, i.set(String(c), T.lastIndex)), u.push($ ? { num: c } : {});
-    } else
-      g === ")" && u.pop();
-  }
-  return t.push(...o), {
-    pattern: e,
-    captureTransfers: a,
-    hiddenCaptures: t
-  };
-}
-function Ye(e) {
-  const n = `Max depth must be integer between 2 and 100; used ${e}`;
-  if (!/^[1-9]\d*$/.test(e))
-    throw new Error(n);
-  if (e = +e, e < 2 || e > 100)
-    throw new Error(n);
-}
-function Je(e, n, t, r, a, o, s) {
-  const i = /* @__PURE__ */ new Set();
-  r && En(e + n, me, ({ groups: { captureName: l } }) => {
-    i.add(l);
-  }, I.DEFAULT);
-  const u = [
-    t,
-    r ? i : null,
-    a,
-    o,
-    s
-  ];
-  return `${e}${en(`(?:${e}`, "forward", ...u)}(?:)${en(`${n})`, "backward", ...u)}${n}`;
-}
-function en(e, n, t, r, a, o, s) {
-  const i = (l) => n === "forward" ? l + 2 : t - l + 2 - 1;
-  let u = "";
-  for (let l = 0; l < t; l++) {
-    const p = i(l);
-    u += Be(
-      e,
-      v`${vn}|\\k<(?<backref>[^>]+)>`,
-      ({ 0: c, groups: { captureName: d, unnamed: g, backref: f } }) => {
-        if (f && r && !r.has(f))
-          return c;
-        const w = `_$${p}`;
-        if (g || d) {
-          const m = s + o.length + 1;
-          return o.push(m), Kt(a, m), g ? c : `(?<${d}${w}>`;
-        }
-        return v`\k<${f}${w}>`;
-      },
-      I.DEFAULT
-    );
-  }
-  return u;
-}
-function Kt(e, n) {
-  for (let t = 0; t < e.length; t++)
-    e[t] >= n && e[t]++;
-}
-function nn(e, n, t, r, a, o) {
-  if (e.size && r) {
-    let s = 0;
-    En(n, vn, () => s++, I.DEFAULT);
-    const i = o - s + a, u = /* @__PURE__ */ new Map();
-    return e.forEach((l, p) => {
-      const c = (r - s * t) / t, d = s * t, g = p > i + s ? p + r : p, f = [];
-      for (const w of l)
-        if (w <= i)
-          f.push(w);
-        else if (w > i + s + c)
-          f.push(w + r);
-        else if (w <= i + s)
-          for (let m = 0; m <= t; m++)
-            f.push(w + s * m);
-        else
-          for (let m = 0; m <= t; m++)
-            f.push(w + d + c * m);
-      u.set(g, f);
-    }), u;
-  }
-  return e;
-}
-var C = String.fromCodePoint, h = String.raw, U = {
-  flagGroups: (() => {
-    try {
-      new RegExp("(?i:)");
-    } catch {
-      return !1;
-    }
-    return !0;
-  })(),
-  unicodeSets: (() => {
-    try {
-      new RegExp("[[]]", "v");
-    } catch {
-      return !1;
-    }
-    return !0;
-  })()
-};
-U.bugFlagVLiteralHyphenIsRange = U.unicodeSets ? (() => {
-  try {
-    new RegExp(h`[\d\-a]`, "v");
-  } catch {
-    return !0;
-  }
-  return !1;
-})() : !1;
-U.bugNestedClassIgnoresNegation = U.unicodeSets && new RegExp("[[^a]]", "v").test("a");
-function ge(e, { enable: n, disable: t }) {
-  return {
-    dotAll: !(t != null && t.dotAll) && !!(n != null && n.dotAll || e.dotAll),
-    ignoreCase: !(t != null && t.ignoreCase) && !!(n != null && n.ignoreCase || e.ignoreCase)
-  };
-}
-function ie(e, n, t) {
-  return e.has(n) || e.set(n, t), e.get(n);
-}
-function Le(e, n) {
-  return tn[e] >= tn[n];
-}
-function Yt(e, n) {
-  if (e == null)
-    throw new Error(n ?? "Value expected");
-  return e;
-}
-var tn = {
-  ES2025: 2025,
-  ES2024: 2024,
-  ES2018: 2018
-}, Jt = (
-  /** @type {const} */
-  {
-    auto: "auto",
-    ES2025: "ES2025",
-    ES2024: "ES2024",
-    ES2018: "ES2018"
-  }
-);
-function An(e = {}) {
-  if ({}.toString.call(e) !== "[object Object]")
-    throw new Error("Unexpected options");
-  if (e.target !== void 0 && !Jt[e.target])
-    throw new Error(`Unexpected target "${e.target}"`);
-  const n = {
-    // Sets the level of emulation rigor/strictness.
-    accuracy: "default",
-    // Disables advanced emulation that relies on returning a `RegExp` subclass, resulting in
-    // certain patterns not being emulatable.
-    avoidSubclass: !1,
-    // Oniguruma flags; a string with `i`, `m`, `x`, `D`, `S`, `W`, `y{g}` in any order (all
-    // optional). Oniguruma's `m` is equivalent to JavaScript's `s` (`dotAll`).
-    flags: "",
-    // Include JavaScript flag `g` (`global`) in the result.
-    global: !1,
-    // Include JavaScript flag `d` (`hasIndices`) in the result.
-    hasIndices: !1,
-    // Delay regex construction until first use if the transpiled pattern is at least this length.
-    lazyCompileLength: 1 / 0,
-    // JavaScript version used for generated regexes. Using `auto` detects the best value based on
-    // your environment. Later targets allow faster processing, simpler generated source, and
-    // support for additional features.
-    target: "auto",
-    // Disables minifications that simplify the pattern without changing the meaning.
-    verbose: !1,
-    ...e,
-    // Advanced options that override standard behavior, error checking, and flags when enabled.
-    rules: {
-      // Useful with TextMate grammars that merge backreferences across patterns.
-      allowOrphanBackrefs: !1,
-      // Use ASCII `\b` and `\B`, which increases search performance of generated regexes.
-      asciiWordBoundaries: !1,
-      // Allow unnamed captures and numbered calls (backreferences and subroutines) when using
-      // named capture. This is Oniguruma option `ONIG_OPTION_CAPTURE_GROUP`; on by default in
-      // `vscode-oniguruma`.
-      captureGroup: !1,
-      // Change the recursion depth limit from Oniguruma's `20` to an integer `2`–`20`.
-      recursionLimit: 20,
-      // `^` as `\A`; `$` as`\Z`. Improves search performance of generated regexes without changing
-      // the meaning if searching line by line. This is Oniguruma option `ONIG_OPTION_SINGLELINE`.
-      singleline: !1,
-      ...e.rules
-    }
-  };
-  return n.target === "auto" && (n.target = U.flagGroups ? "ES2025" : U.unicodeSets ? "ES2024" : "ES2018"), n;
-}
-var er = "[	-\r ]", nr = /* @__PURE__ */ new Set([
-  C(304),
-  // İ
-  C(305)
-  // ı
-]), P = h`[\p{L}\p{M}\p{N}\p{Pc}]`;
-function In(e) {
-  if (nr.has(e))
-    return [e];
-  const n = /* @__PURE__ */ new Set(), t = e.toLowerCase(), r = t.toUpperCase(), a = or.get(t), o = tr.get(t), s = rr.get(t);
-  return [...r].length === 1 && n.add(r), s && n.add(s), a && n.add(a), n.add(t), o && n.add(o), [...n];
-}
-var Ge = /* @__PURE__ */ new Map(
-  `C Other
-Cc Control cntrl
-Cf Format
-Cn Unassigned
-Co Private_Use
-Cs Surrogate
-L Letter
-LC Cased_Letter
-Ll Lowercase_Letter
-Lm Modifier_Letter
-Lo Other_Letter
-Lt Titlecase_Letter
-Lu Uppercase_Letter
-M Mark Combining_Mark
-Mc Spacing_Mark
-Me Enclosing_Mark
-Mn Nonspacing_Mark
-N Number
-Nd Decimal_Number digit
-Nl Letter_Number
-No Other_Number
-P Punctuation punct
-Pc Connector_Punctuation
-Pd Dash_Punctuation
-Pe Close_Punctuation
-Pf Final_Punctuation
-Pi Initial_Punctuation
-Po Other_Punctuation
-Ps Open_Punctuation
-S Symbol
-Sc Currency_Symbol
-Sk Modifier_Symbol
-Sm Math_Symbol
-So Other_Symbol
-Z Separator
-Zl Line_Separator
-Zp Paragraph_Separator
-Zs Space_Separator
-ASCII
-ASCII_Hex_Digit AHex
-Alphabetic Alpha
-Any
-Assigned
-Bidi_Control Bidi_C
-Bidi_Mirrored Bidi_M
-Case_Ignorable CI
-Cased
-Changes_When_Casefolded CWCF
-Changes_When_Casemapped CWCM
-Changes_When_Lowercased CWL
-Changes_When_NFKC_Casefolded CWKCF
-Changes_When_Titlecased CWT
-Changes_When_Uppercased CWU
-Dash
-Default_Ignorable_Code_Point DI
-Deprecated Dep
-Diacritic Dia
-Emoji
-Emoji_Component EComp
-Emoji_Modifier EMod
-Emoji_Modifier_Base EBase
-Emoji_Presentation EPres
-Extended_Pictographic ExtPict
-Extender Ext
-Grapheme_Base Gr_Base
-Grapheme_Extend Gr_Ext
-Hex_Digit Hex
-IDS_Binary_Operator IDSB
-IDS_Trinary_Operator IDST
-ID_Continue IDC
-ID_Start IDS
-Ideographic Ideo
-Join_Control Join_C
-Logical_Order_Exception LOE
-Lowercase Lower
-Math
-Noncharacter_Code_Point NChar
-Pattern_Syntax Pat_Syn
-Pattern_White_Space Pat_WS
-Quotation_Mark QMark
-Radical
-Regional_Indicator RI
-Sentence_Terminal STerm
-Soft_Dotted SD
-Terminal_Punctuation Term
-Unified_Ideograph UIdeo
-Uppercase Upper
-Variation_Selector VS
-White_Space space
-XID_Continue XIDC
-XID_Start XIDS`.split(/\s/).map((e) => [we(e), e])
-), tr = /* @__PURE__ */ new Map([
-  ["s", C(383)],
-  // s, ſ
-  [C(383), "s"]
-  // ſ, s
-]), rr = /* @__PURE__ */ new Map([
-  [C(223), C(7838)],
-  // ß, ẞ
-  [C(107), C(8490)],
-  // k, K (Kelvin)
-  [C(229), C(8491)],
-  // å, Å (Angstrom)
-  [C(969), C(8486)]
-  // ω, Ω (Ohm)
-]), or = new Map([
-  G(453),
-  G(456),
-  G(459),
-  G(498),
-  ...xe(8072, 8079),
-  ...xe(8088, 8095),
-  ...xe(8104, 8111),
-  G(8124),
-  G(8140),
-  G(8188)
-]), ar = /* @__PURE__ */ new Map([
-  ["alnum", h`[\p{Alpha}\p{Nd}]`],
-  ["alpha", h`\p{Alpha}`],
-  ["ascii", h`\p{ASCII}`],
-  ["blank", h`[\p{Zs}\t]`],
-  ["cntrl", h`\p{Cc}`],
-  ["digit", h`\p{Nd}`],
-  ["graph", h`[\P{space}&&\P{Cc}&&\P{Cn}&&\P{Cs}]`],
-  ["lower", h`\p{Lower}`],
-  ["print", h`[[\P{space}&&\P{Cc}&&\P{Cn}&&\P{Cs}]\p{Zs}]`],
-  ["punct", h`[\p{P}\p{S}]`],
-  // Updated value from Onig 6.9.9; changed from Unicode `\p{punct}`
-  ["space", h`\p{space}`],
-  ["upper", h`\p{Upper}`],
-  ["word", h`[\p{Alpha}\p{M}\p{Nd}\p{Pc}]`],
-  ["xdigit", h`\p{AHex}`]
-]);
-function sr(e, n) {
-  const t = [];
-  for (let r = e; r <= n; r++)
-    t.push(r);
-  return t;
-}
-function G(e) {
-  const n = C(e);
-  return [n.toLowerCase(), n];
-}
-function xe(e, n) {
-  return sr(e, n).map((t) => G(t));
-}
-var Sn = /* @__PURE__ */ new Set([
-  "Lower",
-  "Lowercase",
-  "Upper",
-  "Uppercase",
-  "Ll",
-  "Lowercase_Letter",
-  "Lt",
-  "Titlecase_Letter",
-  "Lu",
-  "Uppercase_Letter"
-  // The `Changes_When_*` properties (and their aliases) could be included, but they're very rare.
-  // Some other properties include a handful of chars with specific cases only, but these chars are
-  // generally extreme edge cases and using such properties case insensitively generally produces
-  // undesired behavior anyway
-]);
-function ir(e, n) {
-  const t = {
-    // A couple edge cases exist where options `accuracy` and `bestEffortTarget` are used:
-    // - `CharacterSet` kind `text_segment` (`\X`): An exact representation would require heavy
-    //   Unicode data; a best-effort approximation requires knowing the target.
-    // - `CharacterSet` kind `posix` with values `graph` and `print`: Their complex Unicode
-    //   representations would be hard to change to ASCII versions after the fact in the generator
-    //   based on `target`/`accuracy`, so produce the appropriate structure here.
-    accuracy: "default",
-    asciiWordBoundaries: !1,
-    avoidSubclass: !1,
-    bestEffortTarget: "ES2025",
-    ...n
-  };
-  _n(e);
-  const r = {
-    accuracy: t.accuracy,
-    asciiWordBoundaries: t.asciiWordBoundaries,
-    avoidSubclass: t.avoidSubclass,
-    flagDirectivesByAlt: /* @__PURE__ */ new Map(),
-    jsGroupNameMap: /* @__PURE__ */ new Map(),
-    minTargetEs2024: Le(t.bestEffortTarget, "ES2024"),
-    passedLookbehind: !1,
-    strategy: null,
-    // Subroutines can appear before the groups they ref, so collect reffed nodes for a second pass 
-    subroutineRefMap: /* @__PURE__ */ new Map(),
-    supportedGNodes: /* @__PURE__ */ new Set(),
-    digitIsAscii: e.flags.digitIsAscii,
-    spaceIsAscii: e.flags.spaceIsAscii,
-    wordIsAscii: e.flags.wordIsAscii
-  };
-  se(e, ur, r);
-  const a = {
-    dotAll: e.flags.dotAll,
-    ignoreCase: e.flags.ignoreCase
-  }, o = {
-    currentFlags: a,
-    prevFlags: null,
-    globalFlags: a,
-    groupOriginByCopy: /* @__PURE__ */ new Map(),
-    groupsByName: /* @__PURE__ */ new Map(),
-    multiplexCapturesToLeftByRef: /* @__PURE__ */ new Map(),
-    openRefs: /* @__PURE__ */ new Map(),
-    reffedNodesByReferencer: /* @__PURE__ */ new Map(),
-    subroutineRefMap: r.subroutineRefMap
-  };
-  se(e, lr, o);
-  const s = {
-    groupsByName: o.groupsByName,
-    highestOrphanBackref: 0,
-    numCapturesToLeft: 0,
-    reffedNodesByReferencer: o.reffedNodesByReferencer
-  };
-  return se(e, cr, s), e._originMap = o.groupOriginByCopy, e._strategy = r.strategy, e;
-}
-var ur = {
-  AbsenceFunction({ node: e, parent: n, replaceWith: t }) {
-    const { body: r, kind: a } = e;
-    if (a === "repeater") {
-      const o = N();
-      o.body[0].body.push(
-        // Insert own alts as `body`
-        z({ negate: !0, body: r }),
-        ne("Any")
-      );
-      const s = N();
-      s.body[0].body.push(
-        Cn("greedy", 0, 1 / 0, o)
-      ), t(b(s, n), { traverse: !0 });
-    } else
-      throw new Error('Unsupported absence function "(?~|"');
-  },
-  Alternative: {
-    enter({ node: e, parent: n, key: t }, { flagDirectivesByAlt: r }) {
-      const a = e.body.filter((o) => o.kind === "flags");
-      for (let o = t + 1; o < n.body.length; o++) {
-        const s = n.body[o];
-        ie(r, s, []).push(...a);
-      }
-    },
-    exit({ node: e }, { flagDirectivesByAlt: n }) {
-      var t;
-      if ((t = n.get(e)) != null && t.length) {
-        const r = Mn(n.get(e));
-        if (r) {
-          const a = N({ flags: r });
-          a.body[0].body = e.body, e.body = [b(a, e)];
-        }
-      }
-    }
-  },
-  Assertion({ node: e, parent: n, key: t, container: r, root: a, remove: o, replaceWith: s }, i) {
-    const { kind: u, negate: l } = e, { asciiWordBoundaries: p, avoidSubclass: c, supportedGNodes: d, wordIsAscii: g } = i;
-    if (u === "text_segment_boundary")
-      throw new Error(`Unsupported text segment boundary "\\${l ? "Y" : "y"}"`);
-    if (u === "line_end")
-      s(b(z({ body: [
-        H({ body: [Se("string_end")] }),
-        H({ body: [he(10)] })
-        // `\n`
-      ] }), n));
-    else if (u === "line_start")
-      s(b(R(h`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), n));
-    else if (u === "search_start")
-      if (d.has(e))
-        a.flags.sticky = !0, o();
-      else {
-        const f = r[t - 1];
-        if (f && wr(f))
-          s(b(z({ negate: !0 }), n));
-        else {
-          if (c)
-            throw new Error(h`Uses "\G" in a way that requires a subclass`);
-          s(O(Se("string_start"), n)), i.strategy = "clip_search";
-        }
-      }
-    else if (!(u === "string_end" || u === "string_start"))
-      if (u === "string_end_newline")
-        s(b(R(h`(?=\n?\z)`), n));
-      else if (u === "word_boundary") {
-        if (!g && !p) {
-          const f = `(?:(?<=${P})(?!${P})|(?<!${P})(?=${P}))`, w = `(?:(?<=${P})(?=${P})|(?<!${P})(?!${P}))`;
-          s(b(R(l ? w : f), n));
-        }
-      } else
-        throw new Error(`Unexpected assertion kind "${u}"`);
-  },
-  Backreference({ node: e }, { jsGroupNameMap: n }) {
-    let { ref: t } = e;
-    typeof t == "string" && !Ee(t) && (t = ke(t, n), e.ref = t);
-  },
-  CapturingGroup({ node: e }, { jsGroupNameMap: n, subroutineRefMap: t }) {
-    let { name: r } = e;
-    r && !Ee(r) && (r = ke(r, n), e.name = r), t.set(e.number, e), r && t.set(r, e);
-  },
-  CharacterClassRange({ node: e, parent: n, replaceWith: t }) {
-    if (n.kind === "intersection") {
-      const r = fe({ body: [e] });
-      t(b(r, n), { traverse: !0 });
-    }
-  },
-  CharacterSet({ node: e, parent: n, replaceWith: t }, { accuracy: r, minTargetEs2024: a, digitIsAscii: o, spaceIsAscii: s, wordIsAscii: i }) {
-    const { kind: u, negate: l, value: p } = e;
-    if (o && (u === "digit" || p === "digit")) {
-      t(O(Ne("digit", { negate: l }), n));
-      return;
-    }
-    if (s && (u === "space" || p === "space")) {
-      t(b($e(R(er), l), n));
-      return;
-    }
-    if (i && (u === "word" || p === "word")) {
-      t(O(Ne("word", { negate: l }), n));
-      return;
-    }
-    if (u === "any")
-      t(O(ne("Any"), n));
-    else if (u === "digit")
-      t(O(ne("Nd", { negate: l }), n));
-    else if (u !== "dot")
-      if (u === "text_segment") {
-        if (r === "strict")
-          throw new Error(h`Use of "\X" requires non-strict accuracy`);
-        const c = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", d = h`\p{RI}{2}|${c}(?:\u200D${c})*`;
-        t(b(R(
-          // Close approximation of an extended grapheme cluster; see <unicode.org/reports/tr29/>
-          h`(?>\r\n|${a ? h`\p{RGI_Emoji}` : d}|\P{M}\p{M}*)`,
-          // Allow JS property `RGI_Emoji` through
-          { skipPropertyNameValidation: !0 }
-        ), n));
-      } else if (u === "hex")
-        t(O(ne("AHex", { negate: l }), n));
-      else if (u === "newline")
-        t(b(R(l ? `[^
-]` : `(?>\r
-?|[
-\v\f…\u2028\u2029])`), n));
-      else if (u === "posix")
-        if (!a && (p === "graph" || p === "print")) {
-          if (r === "strict")
-            throw new Error(`POSIX class "${p}" requires min target ES2024 or non-strict accuracy`);
-          let c = {
-            graph: "!-~",
-            print: " -~"
-          }[p];
-          l && (c = `\0-${C(c.codePointAt(0) - 1)}${C(c.codePointAt(2) + 1)}-􏿿`), t(b(R(`[${c}]`), n));
-        } else
-          t(b($e(R(ar.get(p)), l), n));
-      else if (u === "property")
-        Ge.has(we(p)) || (e.key = "sc");
-      else if (u === "space")
-        t(O(ne("space", { negate: l }), n));
-      else if (u === "word")
-        t(b($e(R(P), l), n));
-      else
-        throw new Error(`Unexpected character set kind "${u}"`);
-  },
-  Directive({ node: e, parent: n, root: t, remove: r, replaceWith: a, removeAllPrevSiblings: o, removeAllNextSiblings: s }) {
-    const { kind: i, flags: u } = e;
-    if (i === "flags")
-      if (!u.enable && !u.disable)
-        r();
-      else {
-        const l = N({ flags: u });
-        l.body[0].body = s(), a(b(l, n), { traverse: !0 });
-      }
-    else if (i === "keep") {
-      const l = t.body[0], p = t.body.length === 1 && // Not emulatable if within a `CapturingGroup`
-      mn(l, { type: "Group" }) && l.body[0].body.length === 1 ? l.body[0] : t;
-      if (n.parent !== p || p.body.length > 1)
-        throw new Error(h`Uses "\K" in a way that's unsupported`);
-      const c = z({ behind: !0 });
-      c.body[0].body = o(), a(b(c, n));
-    } else
-      throw new Error(`Unexpected directive kind "${i}"`);
-  },
-  Flags({ node: e, parent: n }) {
-    if (e.posixIsAscii)
-      throw new Error('Unsupported flag "P"');
-    if (e.textSegmentMode === "word")
-      throw new Error('Unsupported flag "y{w}"');
-    [
-      "digitIsAscii",
-      // Flag D
-      "extended",
-      // Flag x
-      "posixIsAscii",
-      // Flag P
-      "spaceIsAscii",
-      // Flag S
-      "wordIsAscii",
-      // Flag W
-      "textSegmentMode"
-      // Flag y{g} or y{w}
-    ].forEach((t) => delete e[t]), Object.assign(e, {
-      // JS flag g; no Onig equiv
-      global: !1,
-      // JS flag d; no Onig equiv
-      hasIndices: !1,
-      // JS flag m; no Onig equiv but its behavior is always on in Onig. Onig's only line break
-      // char is line feed, unlike JS, so this flag isn't used since it would produce inaccurate
-      // results (also allows `^` and `$` to be used in the generator for string start and end)
-      multiline: !1,
-      // JS flag y; no Onig equiv, but used for `\G` emulation
-      sticky: e.sticky ?? !1
-      // Note: Regex+ doesn't allow explicitly adding flags it handles implicitly, so leave out
-      // properties `unicode` (JS flag u) and `unicodeSets` (JS flag v). Keep the existing values
-      // for `ignoreCase` (flag i) and `dotAll` (JS flag s, but Onig flag m)
-    }), n.options = {
-      disable: {
-        // Onig uses different rules for flag x than Regex+, so disable the implicit flag
-        x: !0,
-        // Onig has no flag to control "named capture only" mode but contextually applies its
-        // behavior when named capturing is used, so disable Regex+'s implicit flag for it
-        n: !0
-      },
-      force: {
-        // Always add flag v because we're generating an AST that relies on it (it enables JS
-        // support for Onig features nested classes, intersection, Unicode properties, etc.).
-        // However, the generator might disable flag v based on its `target` option
-        v: !0
-      }
-    };
-  },
-  Group({ node: e }) {
-    if (!e.flags)
-      return;
-    const { enable: n, disable: t } = e.flags;
-    n != null && n.extended && delete n.extended, t != null && t.extended && delete t.extended, n != null && n.dotAll && t != null && t.dotAll && delete n.dotAll, n != null && n.ignoreCase && t != null && t.ignoreCase && delete n.ignoreCase, n && !Object.keys(n).length && delete e.flags.enable, t && !Object.keys(t).length && delete e.flags.disable, !e.flags.enable && !e.flags.disable && delete e.flags;
-  },
-  LookaroundAssertion({ node: e }, n) {
-    const { kind: t } = e;
-    t === "lookbehind" && (n.passedLookbehind = !0);
-  },
-  NamedCallout({ node: e, parent: n, replaceWith: t }) {
-    const { kind: r } = e;
-    if (r === "fail")
-      t(b(z({ negate: !0 }), n));
-    else
-      throw new Error(`Unsupported named callout "(*${r.toUpperCase()}"`);
-  },
-  Quantifier({ node: e }) {
-    if (e.body.type === "Quantifier") {
-      const n = N();
-      n.body[0].body.push(e.body), e.body = b(n, e);
-    }
-  },
-  Regex: {
-    enter({ node: e }, { supportedGNodes: n }) {
-      const t = [];
-      let r = !1, a = !1;
-      for (const o of e.body)
-        if (o.body.length === 1 && o.body[0].kind === "search_start")
-          o.body.pop();
-        else {
-          const s = Pn(o.body);
-          s ? (r = !0, Array.isArray(s) ? t.push(...s) : t.push(s)) : a = !0;
-        }
-      r && !a && t.forEach((o) => n.add(o));
-    },
-    exit(e, { accuracy: n, passedLookbehind: t, strategy: r }) {
-      if (n === "strict" && t && r)
-        throw new Error(h`Uses "\G" in a way that requires non-strict accuracy`);
-    }
-  },
-  Subroutine({ node: e }, { jsGroupNameMap: n }) {
-    let { ref: t } = e;
-    typeof t == "string" && !Ee(t) && (t = ke(t, n), e.ref = t);
-  }
-}, lr = {
-  Backreference({ node: e }, { multiplexCapturesToLeftByRef: n, reffedNodesByReferencer: t }) {
-    const { orphan: r, ref: a } = e;
-    r || t.set(e, [...n.get(a).map(({ node: o }) => o)]);
-  },
-  CapturingGroup: {
-    enter({
-      node: e,
-      parent: n,
-      replaceWith: t,
-      skip: r
-    }, {
-      groupOriginByCopy: a,
-      groupsByName: o,
-      multiplexCapturesToLeftByRef: s,
-      openRefs: i,
-      reffedNodesByReferencer: u
-    }) {
-      const l = a.get(e);
-      if (l && i.has(e.number)) {
-        const c = O(rn(e.number), n);
-        u.set(c, i.get(e.number)), t(c);
-        return;
-      }
-      i.set(e.number, e), s.set(e.number, []), e.name && ie(s, e.name, []);
-      const p = s.get(e.name ?? e.number);
-      for (let c = 0; c < p.length; c++) {
-        const d = p[c];
-        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
-          l === d.node || l && l === d.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
-          // group that refers to this group
-          e === d.origin
-        ) {
-          p.splice(c, 1);
-          break;
-        }
-      }
-      if (s.get(e.number).push({ node: e, origin: l }), e.name && s.get(e.name).push({ node: e, origin: l }), e.name) {
-        const c = ie(o, e.name, /* @__PURE__ */ new Map());
-        let d = !1;
-        if (l)
-          d = !0;
-        else
-          for (const g of c.values())
-            if (!g.hasDuplicateNameToRemove) {
-              d = !0;
-              break;
-            }
-        o.get(e.name).set(e, { node: e, hasDuplicateNameToRemove: d });
-      }
-    },
-    exit({ node: e }, { openRefs: n }) {
-      n.delete(e.number);
-    }
-  },
-  Group: {
-    enter({ node: e }, n) {
-      n.prevFlags = n.currentFlags, e.flags && (n.currentFlags = ge(n.currentFlags, e.flags));
-    },
-    exit(e, n) {
-      n.currentFlags = n.prevFlags;
-    }
-  },
-  Subroutine({ node: e, parent: n, replaceWith: t }, r) {
-    const { isRecursive: a, ref: o } = e;
-    if (a) {
-      let p = n;
-      for (; (p = p.parent) && !(p.type === "CapturingGroup" && (p.name === o || p.number === o)); )
-        ;
-      r.reffedNodesByReferencer.set(e, p);
-      return;
-    }
-    const s = r.subroutineRefMap.get(o), i = o === 0, u = i ? rn(0) : (
-      // The reffed group might itself contain subroutines, which are expanded during sub-traversal
-      Nn(s, r.groupOriginByCopy, null)
-    );
-    let l = u;
-    if (!i) {
-      const p = Mn(fr(
-        s,
-        (d) => d.type === "Group" && !!d.flags
-      )), c = p ? ge(r.globalFlags, p) : r.globalFlags;
-      pr(c, r.currentFlags) || (l = N({
-        flags: gr(c)
-      }), l.body[0].body.push(u));
-    }
-    t(b(l, n), { traverse: !i });
-  }
-}, cr = {
-  Backreference({ node: e, parent: n, replaceWith: t }, r) {
-    if (e.orphan) {
-      r.highestOrphanBackref = Math.max(r.highestOrphanBackref, e.ref);
-      return;
-    }
-    const a = r.reffedNodesByReferencer.get(e).filter((o) => dr(o, e));
-    if (!a.length)
-      t(b(z({ negate: !0 }), n));
-    else if (a.length > 1) {
-      const o = N({
-        atomic: !0,
-        body: a.reverse().map((s) => H({
-          body: [_e(s.number)]
-        }))
-      });
-      t(b(o, n));
-    } else
-      e.ref = a[0].number;
-  },
-  CapturingGroup({ node: e }, n) {
-    e.number = ++n.numCapturesToLeft, e.name && n.groupsByName.get(e.name).get(e).hasDuplicateNameToRemove && delete e.name;
-  },
-  Regex: {
-    exit({ node: e }, n) {
-      const t = Math.max(n.highestOrphanBackref - n.numCapturesToLeft, 0);
-      for (let r = 0; r < t; r++) {
-        const a = bn();
-        e.body.at(-1).body.push(a);
-      }
-    }
-  },
-  Subroutine({ node: e }, n) {
-    !e.isRecursive || e.ref === 0 || (e.ref = n.reffedNodesByReferencer.get(e).number);
-  }
-};
-function _n(e) {
-  se(e, {
-    "*"({ node: n, parent: t }) {
-      n.parent = t;
-    }
-  });
-}
-function pr(e, n) {
-  return e.dotAll === n.dotAll && e.ignoreCase === n.ignoreCase;
-}
-function dr(e, n) {
-  let t = n;
-  do {
-    if (t.type === "Regex")
-      return !1;
-    if (t.type === "Alternative")
-      continue;
-    if (t === e)
-      return !1;
-    const r = Ln(t.parent);
-    for (const a of r) {
-      if (a === t)
-        break;
-      if (a === e || Rn(a, e))
-        return !0;
-    }
-  } while (t = t.parent);
-  throw new Error("Unexpected path");
-}
-function Nn(e, n, t, r) {
-  const a = Array.isArray(e) ? [] : {};
-  for (const [o, s] of Object.entries(e))
-    o === "parent" ? a.parent = Array.isArray(t) ? r : t : s && typeof s == "object" ? a[o] = Nn(s, n, a, t) : (o === "type" && s === "CapturingGroup" && n.set(a, n.get(e) ?? e), a[o] = s);
-  return a;
-}
-function rn(e) {
-  const n = xn(e);
-  return n.isRecursive = !0, n;
-}
-function fr(e, n) {
-  const t = [];
-  for (; e = e.parent; )
-    (!n || n(e)) && t.push(e);
-  return t;
-}
-function ke(e, n) {
-  if (n.has(e))
-    return n.get(e);
-  const t = `$${n.size}_${e.replace(/^[^$_\p{IDS}]|[^$\u200C\u200D\p{IDC}]/ug, "_")}`;
-  return n.set(e, t), t;
-}
-function Mn(e) {
-  const n = ["dotAll", "ignoreCase"], t = { enable: {}, disable: {} };
-  return e.forEach(({ flags: r }) => {
-    n.forEach((a) => {
-      var o, s;
-      (o = r.enable) != null && o[a] && (delete t.disable[a], t.enable[a] = !0), (s = r.disable) != null && s[a] && (t.disable[a] = !0);
-    });
-  }), Object.keys(t.enable).length || delete t.enable, Object.keys(t.disable).length || delete t.disable, t.enable || t.disable ? t : null;
-}
-function gr({ dotAll: e, ignoreCase: n }) {
-  const t = {};
-  return (e || n) && (t.enable = {}, e && (t.enable.dotAll = !0), n && (t.enable.ignoreCase = !0)), (!e || !n) && (t.disable = {}, !e && (t.disable.dotAll = !0), !n && (t.disable.ignoreCase = !0)), t;
-}
-function Ln(e) {
-  if (!e)
-    throw new Error("Node expected");
-  const { body: n } = e;
-  return Array.isArray(n) ? n : n ? [n] : null;
-}
-function Pn(e) {
-  const n = e.find((t) => t.kind === "search_start" || mr(t, { negate: !1 }) || !hr(t));
-  if (!n)
-    return null;
-  if (n.kind === "search_start")
-    return n;
-  if (n.type === "LookaroundAssertion")
-    return n.body[0].body[0];
-  if (n.type === "CapturingGroup" || n.type === "Group") {
-    const t = [];
-    for (const r of n.body) {
-      const a = Pn(r.body);
-      if (!a)
-        return null;
-      Array.isArray(a) ? t.push(...a) : t.push(a);
-    }
-    return t;
-  }
-  return null;
-}
-function Rn(e, n) {
-  const t = Ln(e) ?? [];
-  for (const r of t)
-    if (r === n || Rn(r, n))
-      return !0;
-  return !1;
-}
-function hr({ type: e }) {
-  return e === "Assertion" || e === "Directive" || e === "LookaroundAssertion";
-}
-function wr(e) {
-  const n = [
-    "Character",
-    "CharacterClass",
-    "CharacterSet"
-  ];
-  return n.includes(e.type) || e.type === "Quantifier" && e.min && n.includes(e.body.type);
-}
-function mr(e, n) {
-  const t = {
-    negate: null,
-    ...n
-  };
-  return e.type === "LookaroundAssertion" && (t.negate === null || e.negate === t.negate) && e.body.length === 1 && mn(e.body[0], {
-    type: "Assertion",
-    kind: "search_start"
-  });
-}
-function Ee(e) {
-  return /^[$_\p{IDS}][$\u200C\u200D\p{IDC}]*$/u.test(e);
-}
-function R(e, n) {
-  const t = yn(e, {
-    ...n,
-    // Providing a custom set of Unicode property names avoids converting some JS Unicode
-    // properties (ex: `\p{Alpha}`) to Onig POSIX classes
-    unicodePropertyMap: Ge
-  }).body;
-  return t.length > 1 || t[0].body.length > 1 ? N({ body: t }) : t[0].body[0];
-}
-function $e(e, n) {
-  return e.negate = n, e;
-}
-function O(e, n) {
-  return e.parent = n, e;
-}
-function b(e, n) {
-  return _n(e), e.parent = n, e;
-}
-function yr(e, n) {
-  const t = An(n), r = Le(t.target, "ES2024"), a = Le(t.target, "ES2025"), o = t.rules.recursionLimit;
-  if (!Number.isInteger(o) || o < 2 || o > 20)
-    throw new Error("Invalid recursionLimit; use 2-20");
-  let s = null, i = null;
-  if (!a) {
-    const g = [e.flags.ignoreCase];
-    se(e, br, {
-      getCurrentModI: () => g.at(-1),
-      popModI() {
-        g.pop();
-      },
-      pushModI(f) {
-        g.push(f);
-      },
-      setHasCasedChar() {
-        g.at(-1) ? s = !0 : i = !0;
-      }
-    });
-  }
-  const u = {
-    dotAll: e.flags.dotAll,
-    // - Turn global flag i on if a case insensitive node was used and no case sensitive nodes were
-    //   used (to avoid unnecessary node expansion).
-    // - Turn global flag i off if a case sensitive node was used (since case sensitivity can't be
-    //   forced without the use of ES2025 flag groups)
-    ignoreCase: !!((e.flags.ignoreCase || s) && !i)
-  };
-  let l = e;
-  const p = {
-    accuracy: t.accuracy,
-    appliedGlobalFlags: u,
-    captureMap: /* @__PURE__ */ new Map(),
-    currentFlags: {
-      dotAll: e.flags.dotAll,
-      ignoreCase: e.flags.ignoreCase
-    },
-    inCharClass: !1,
-    lastNode: l,
-    originMap: e._originMap,
-    recursionLimit: o,
-    useAppliedIgnoreCase: !!(!a && s && i),
-    useFlagMods: a,
-    useFlagV: r,
-    verbose: t.verbose
-  };
-  function c(g) {
-    return p.lastNode = l, l = g, Yt(Cr[g.type], `Unexpected node type "${g.type}"`)(g, p, c);
-  }
-  const d = {
-    pattern: e.body.map(c).join("|"),
-    // Could reset `lastNode` at this point via `lastNode = ast`, but it isn't needed by flags
-    flags: c(e.flags),
-    options: { ...e.options }
-  };
-  return r || (delete d.options.force.v, d.options.disable.v = !0, d.options.unicodeSetsPlugin = null), d._captureTransfers = /* @__PURE__ */ new Map(), d._hiddenCaptures = [], p.captureMap.forEach((g, f) => {
-    g.hidden && d._hiddenCaptures.push(f), g.transferTo && ie(d._captureTransfers, g.transferTo, []).push(f);
-  }), d;
-}
-var br = {
-  "*": {
-    enter({ node: e }, n) {
-      if (an(e)) {
-        const t = n.getCurrentModI();
-        n.pushModI(
-          e.flags ? ge({ ignoreCase: t }, e.flags).ignoreCase : t
-        );
-      }
-    },
-    exit({ node: e }, n) {
-      an(e) && n.popModI();
-    }
-  },
-  Backreference(e, n) {
-    n.setHasCasedChar();
-  },
-  Character({ node: e }, n) {
-    Oe(C(e.value)) && n.setHasCasedChar();
-  },
-  CharacterClassRange({ node: e, skip: n }, t) {
-    n(), Fn(e, { firstOnly: !0 }).length && t.setHasCasedChar();
-  },
-  CharacterSet({ node: e }, n) {
-    e.kind === "property" && Sn.has(e.value) && n.setHasCasedChar();
-  }
-}, Cr = {
-  /**
-  @param {AlternativeNode} node
-  */
-  Alternative({ body: e }, n, t) {
-    return e.map(t).join("");
-  },
-  /**
-  @param {AssertionNode} node
-  */
-  Assertion({ kind: e, negate: n }) {
-    if (e === "string_end")
-      return "$";
-    if (e === "string_start")
-      return "^";
-    if (e === "word_boundary")
-      return n ? h`\B` : h`\b`;
-    throw new Error(`Unexpected assertion kind "${e}"`);
-  },
-  /**
-  @param {BackreferenceNode} node
-  */
-  Backreference({ ref: e }, n) {
-    if (typeof e != "number")
-      throw new Error("Unexpected named backref in transformed AST");
-    if (!n.useFlagMods && n.accuracy === "strict" && n.currentFlags.ignoreCase && !n.captureMap.get(e).ignoreCase)
-      throw new Error("Use of case-insensitive backref to case-sensitive group requires target ES2025 or non-strict accuracy");
-    return "\\" + e;
-  },
-  /**
-  @param {CapturingGroupNode} node
-  */
-  CapturingGroup(e, n, t) {
-    const { body: r, name: a, number: o } = e, s = { ignoreCase: n.currentFlags.ignoreCase }, i = n.originMap.get(e);
-    return i && (s.hidden = !0, o > i.number && (s.transferTo = i.number)), n.captureMap.set(o, s), `(${a ? `?<${a}>` : ""}${r.map(t).join("|")})`;
-  },
-  /**
-  @param {CharacterNode} node
-  */
-  Character({ value: e }, n) {
-    const t = C(e), r = Q(e, {
-      escDigit: n.lastNode.type === "Backreference",
-      inCharClass: n.inCharClass,
-      useFlagV: n.useFlagV
-    });
-    if (r !== t)
-      return r;
-    if (n.useAppliedIgnoreCase && n.currentFlags.ignoreCase && Oe(t)) {
-      const a = In(t);
-      return n.inCharClass ? a.join("") : a.length > 1 ? `[${a.join("")}]` : a[0];
-    }
-    return t;
-  },
-  /**
-  @param {CharacterClassNode} node
-  */
-  CharacterClass(e, n, t) {
-    const { kind: r, negate: a, parent: o } = e;
-    let { body: s } = e;
-    if (r === "intersection" && !n.useFlagV)
-      throw new Error("Use of character class intersection requires min target ES2024");
-    U.bugFlagVLiteralHyphenIsRange && n.useFlagV && s.some(sn) && (s = [he(45), ...s.filter((l) => !sn(l))]);
-    const i = () => `[${a ? "^" : ""}${s.map(t).join(r === "intersection" ? "&&" : "")}]`;
-    if (!n.inCharClass) {
-      if (
-        // Already established `kind !== 'intersection'` if `!state.useFlagV`; don't check again
-        (!n.useFlagV || U.bugNestedClassIgnoresNegation) && !a
-      ) {
-        const p = s.filter(
-          (c) => c.type === "CharacterClass" && c.kind === "union" && c.negate
-        );
-        if (p.length) {
-          const c = N(), d = c.body[0];
-          return c.parent = o, d.parent = c, s = s.filter((g) => !p.includes(g)), e.body = s, s.length ? (e.parent = d, d.body.push(e)) : c.body.pop(), p.forEach((g) => {
-            const f = H({ body: [g] });
-            g.parent = f, f.parent = c, c.body.push(f);
-          }), t(c);
-        }
-      }
-      n.inCharClass = !0;
-      const l = i();
-      return n.inCharClass = !1, l;
-    }
-    const u = s[0];
-    if (
-      // Already established that the parent is a char class via `inCharClass`; don't check again
-      r === "union" && !a && u && // Allows many nested classes to work with `target` ES2018 which doesn't support nesting
-      ((!n.useFlagV || !n.verbose) && o.kind === "union" && !(U.bugFlagVLiteralHyphenIsRange && n.useFlagV) || !n.verbose && o.kind === "intersection" && // JS doesn't allow intersection with union or ranges
-      s.length === 1 && u.type !== "CharacterClassRange")
-    )
-      return s.map(t).join("");
-    if (!n.useFlagV && o.type === "CharacterClass")
-      throw new Error("Uses nested character class in a way that requires min target ES2024");
-    return i();
-  },
-  /**
-  @param {CharacterClassRangeNode} node
-  */
-  CharacterClassRange(e, n) {
-    const t = e.min.value, r = e.max.value, a = {
-      escDigit: !1,
-      inCharClass: !0,
-      useFlagV: n.useFlagV
-    }, o = Q(t, a), s = Q(r, a), i = /* @__PURE__ */ new Set();
-    if (n.useAppliedIgnoreCase && n.currentFlags.ignoreCase) {
-      const u = Fn(e);
-      vr(u).forEach((l) => {
-        i.add(
-          Array.isArray(l) ? `${Q(l[0], a)}-${Q(l[1], a)}` : Q(l, a)
-        );
-      });
-    }
-    return `${o}-${s}${[...i].join("")}`;
-  },
-  /**
-  @param {CharacterSetNode} node
-  */
-  CharacterSet({ kind: e, negate: n, value: t, key: r }, a) {
-    if (e === "dot")
-      return a.currentFlags.dotAll ? a.appliedGlobalFlags.dotAll || a.useFlagMods ? "." : "[^]" : (
-        // Onig's only line break char is line feed, unlike JS
-        h`[^\n]`
-      );
-    if (e === "digit")
-      return n ? h`\D` : h`\d`;
-    if (e === "property") {
-      if (a.useAppliedIgnoreCase && a.currentFlags.ignoreCase && Sn.has(t))
-        throw new Error(`Unicode property "${t}" can't be case-insensitive when other chars have specific case`);
-      return `${n ? h`\P` : h`\p`}{${r ? `${r}=` : ""}${t}}`;
-    }
-    if (e === "word")
-      return n ? h`\W` : h`\w`;
-    throw new Error(`Unexpected character set kind "${e}"`);
-  },
-  /**
-  @param {FlagsNode} node
-  */
-  Flags(e, n) {
-    return (
-      // The transformer should never turn on the properties for flags d, g, m since Onig doesn't
-      // have equivs. Flag m is never used since Onig uses different line break chars than JS
-      // (node.hasIndices ? 'd' : '') +
-      // (node.global ? 'g' : '') +
-      // (node.multiline ? 'm' : '') +
-      (n.appliedGlobalFlags.ignoreCase ? "i" : "") + (e.dotAll ? "s" : "") + (e.sticky ? "y" : "")
-    );
-  },
-  /**
-  @param {GroupNode} node
-  */
-  Group({ atomic: e, body: n, flags: t, parent: r }, a, o) {
-    const s = a.currentFlags;
-    t && (a.currentFlags = ge(s, t));
-    const i = n.map(o).join("|"), u = !a.verbose && n.length === 1 && // Single alt
-    r.type !== "Quantifier" && !e && (!a.useFlagMods || !t) ? i : `(?${Ar(e, t, a.useFlagMods)}${i})`;
-    return a.currentFlags = s, u;
-  },
-  /**
-  @param {LookaroundAssertionNode} node
-  */
-  LookaroundAssertion({ body: e, kind: n, negate: t }, r, a) {
-    return `(?${`${n === "lookahead" ? "" : "<"}${t ? "!" : "="}`}${e.map(a).join("|")})`;
-  },
-  /**
-  @param {QuantifierNode} node
-  */
-  Quantifier(e, n, t) {
-    return t(e.body) + Ir(e);
-  },
-  /**
-  @param {SubroutineNode & {isRecursive: true}} node
-  */
-  Subroutine({ isRecursive: e, ref: n }, t) {
-    if (!e)
-      throw new Error("Unexpected non-recursive subroutine in transformed AST");
-    const r = t.recursionLimit;
-    return n === 0 ? `(?R=${r})` : h`\g<${n}&R=${r}>`;
-  }
-}, xr = /* @__PURE__ */ new Set([
-  "$",
-  "(",
-  ")",
-  "*",
-  "+",
-  ".",
-  "?",
-  "[",
-  "\\",
-  "]",
-  "^",
-  "{",
-  "|",
-  "}"
-]), kr = /* @__PURE__ */ new Set([
-  "-",
-  "\\",
-  "]",
-  "^",
-  // 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
-  "["
-]), Er = /* @__PURE__ */ new Set([
-  "(",
-  ")",
-  "-",
-  "/",
-  "[",
-  "\\",
-  "]",
-  "^",
-  "{",
-  "|",
-  "}",
-  // Double punctuators; also includes already-listed `-` and `^`
-  "!",
-  "#",
-  "$",
-  "%",
-  "&",
-  "*",
-  "+",
-  ",",
-  ".",
-  ":",
-  ";",
-  "<",
-  "=",
-  ">",
-  "?",
-  "@",
-  "`",
-  "~"
-]), on = /* @__PURE__ */ new Map([
-  [9, h`\t`],
-  // horizontal tab
-  [10, h`\n`],
-  // line feed
-  [11, h`\v`],
-  // vertical tab
-  [12, h`\f`],
-  // form feed
-  [13, h`\r`],
-  // carriage return
-  [8232, h`\u2028`],
-  // line separator
-  [8233, h`\u2029`],
-  // paragraph separator
-  [65279, h`\uFEFF`]
-  // ZWNBSP/BOM
-]), $r = new RegExp("^\\p{Cased}$", "u");
-function Oe(e) {
-  return $r.test(e);
-}
-function Fn(e, n) {
-  const t = !!(n != null && n.firstOnly), r = e.min.value, a = e.max.value, o = [];
-  if (r < 65 && (a === 65535 || a >= 131071) || r === 65536 && a >= 131071)
-    return o;
-  for (let s = r; s <= a; s++) {
-    const i = C(s);
-    if (!Oe(i))
-      continue;
-    const u = In(i).filter((l) => {
-      const p = l.codePointAt(0);
-      return p < r || p > a;
-    });
-    if (u.length && (o.push(...u), t))
-      break;
-  }
-  return o;
-}
-function Q(e, { escDigit: n, inCharClass: t, useFlagV: r }) {
-  if (on.has(e))
-    return on.get(e);
-  if (
-    // Control chars, etc.; condition modeled on the Chrome developer console's display for strings
-    e < 32 || e > 126 && e < 160 || // Unicode planes 4-16; unassigned, special purpose, and private use area
-    e > 262143 || // Avoid corrupting a preceding backref by immediately following it with a literal digit
-    n && Sr(e)
-  )
-    return e > 255 ? `\\u{${e.toString(16).toUpperCase()}}` : `\\x${e.toString(16).toUpperCase().padStart(2, "0")}`;
-  const a = t ? r ? Er : kr : xr, o = C(e);
-  return (a.has(o) ? "\\" : "") + o;
-}
-function vr(e) {
-  const n = e.map((a) => a.codePointAt(0)).sort((a, o) => a - o), t = [];
-  let r = null;
-  for (let a = 0; a < n.length; a++)
-    n[a + 1] === n[a] + 1 ? r ?? (r = n[a]) : r === null ? t.push(n[a]) : (t.push([r, n[a]]), r = null);
-  return t;
-}
-function Ar(e, n, t) {
-  if (e)
-    return ">";
-  let r = "";
-  if (n && t) {
-    const { enable: a, disable: o } = n;
-    r = (a != null && a.ignoreCase ? "i" : "") + (a != null && a.dotAll ? "s" : "") + (o ? "-" : "") + (o != null && o.ignoreCase ? "i" : "") + (o != null && o.dotAll ? "s" : "");
-  }
-  return `${r}:`;
-}
-function Ir({ kind: e, max: n, min: t }) {
-  let r;
-  return !t && n === 1 ? r = "?" : !t && n === 1 / 0 ? r = "*" : t === 1 && n === 1 / 0 ? r = "+" : t === n ? r = `{${t}}` : r = `{${t},${n === 1 / 0 ? "" : n}}`, r + {
-    greedy: "",
-    lazy: "?",
-    possessive: "+"
-  }[e];
-}
-function an({ type: e }) {
-  return e === "CapturingGroup" || e === "Group" || e === "LookaroundAssertion";
-}
-function Sr(e) {
-  return e > 47 && e < 58;
-}
-function sn({ type: e, value: n }) {
-  return e === "Character" && n === 45;
-}
-var W, B, K, j, Y, de, ve, ae, _r = (ae = class extends RegExp {
-  /**
-  @overload
-  @param {string} pattern
-  @param {string} [flags]
-  @param {EmulatedRegExpOptions} [options]
-  */
-  /**
-  @overload
-  @param {EmulatedRegExp} pattern
-  @param {string} [flags]
-  */
-  constructor(e, n, t) {
-    var r = (...o) => (super(...o), /**
-    Adds support for hidden and transfer captures.
-    @param {string} str
-    @returns
-    */
-    Z(this, de), /**
-    @type {Map<number, {
-      hidden?: true;
-      transferTo?: number;
-    }>}
-    */
-    Z(this, W, /* @__PURE__ */ new Map()), /**
-    @type {RegExp | EmulatedRegExp | null}
-    */
-    Z(this, B, null), /**
-    @type {string}
-    */
-    Z(this, K, void 0), /**
-    @type {Map<number, string>?}
-    */
-    Z(this, j, null), /**
-    @type {string?}
-    */
-    Z(this, Y, null), /**
-    Can be used to serialize the instance.
-    @type {EmulatedRegExpOptions}
-    */
-    pn(this, "rawOptions", {}), this);
-    const a = !!(t != null && t.lazyCompile);
-    if (e instanceof RegExp) {
-      if (t)
-        throw new Error("Cannot provide options when copying a regexp");
-      const o = e;
-      r(o, n), L(this, K, o.source), o instanceof ae && (L(this, W, E(o, W)), L(this, j, E(o, j)), L(this, Y, E(o, Y)), this.rawOptions = o.rawOptions);
-    } else {
-      const o = {
-        hiddenCaptures: [],
-        strategy: null,
-        transfers: [],
-        ...t
-      };
-      r(a ? "" : e, n), L(this, K, e), L(this, W, Mr(o.hiddenCaptures, o.transfers)), L(this, Y, o.strategy), this.rawOptions = t ?? {};
-    }
-    a || L(this, B, this);
-  }
-  // Override the getter with one that works with lazy-compiled regexes
-  get source() {
-    return E(this, K) || "(?:)";
-  }
-  /**
-  Called internally by all String/RegExp methods that use regexes.
-  @override
-  @param {string} str
-  @returns {RegExpExecArray?}
-  */
-  exec(e) {
-    if (!E(this, B)) {
-      const { lazyCompile: r, ...a } = this.rawOptions;
-      L(this, B, new ae(E(this, K), this.flags, a));
-    }
-    const n = this.global || this.sticky, t = this.lastIndex;
-    if (E(this, Y) === "clip_search" && n && t) {
-      this.lastIndex = 0;
-      const r = Te(this, de, ve).call(this, e.slice(t));
-      return r && (Nr(r, t, e, this.hasIndices), this.lastIndex += t), r;
-    }
-    return Te(this, de, ve).call(this, e);
-  }
-}, W = /* @__PURE__ */ new WeakMap(), B = /* @__PURE__ */ new WeakMap(), K = /* @__PURE__ */ new WeakMap(), j = /* @__PURE__ */ new WeakMap(), Y = /* @__PURE__ */ new WeakMap(), de = /* @__PURE__ */ new WeakSet(), ve = function(e) {
-  E(this, B).lastIndex = this.lastIndex;
-  const n = Kn(ae.prototype, this, "exec").call(E(this, B), e);
-  if (this.lastIndex = E(this, B).lastIndex, !n || !E(this, W).size)
-    return n;
-  const t = [...n];
-  n.length = 1;
-  let r;
-  this.hasIndices && (r = [...n.indices], n.indices.length = 1);
-  const a = [0];
-  for (let o = 1; o < t.length; o++) {
-    const { hidden: s, transferTo: i } = E(this, W).get(o) ?? {};
-    if (s ? a.push(null) : (a.push(n.length), n.push(t[o]), this.hasIndices && n.indices.push(r[o])), i && t[o] !== void 0) {
-      const u = a[i];
-      if (!u)
-        throw new Error(`Invalid capture transfer to "${u}"`);
-      if (n[u] = t[o], this.hasIndices && (n.indices[u] = r[o]), n.groups) {
-        E(this, j) || L(this, j, Lr(this.source));
-        const l = E(this, j).get(i);
-        l && (n.groups[l] = t[o], this.hasIndices && (n.indices.groups[l] = r[o]));
-      }
-    }
-  }
-  return n;
-}, ae);
-function Nr(e, n, t, r) {
-  if (e.index += n, e.input = t, r) {
-    const a = e.indices;
-    for (let s = 0; s < a.length; s++) {
-      const i = a[s];
-      i && (a[s] = [i[0] + n, i[1] + n]);
-    }
-    const o = a.groups;
-    o && Object.keys(o).forEach((s) => {
-      const i = o[s];
-      i && (o[s] = [i[0] + n, i[1] + n]);
-    });
-  }
-}
-function Mr(e, n) {
-  const t = /* @__PURE__ */ new Map();
-  for (const r of e)
-    t.set(r, {
-      hidden: !0
-    });
-  for (const [r, a] of n)
-    for (const o of a)
-      ie(t, o, {}).transferTo = r;
-  return t;
-}
-function Lr(e) {
-  const n = /(?<capture>\((?:\?<(?![=!])(?<name>[^>]+)>|(?!\?)))|\\?./gsu, t = /* @__PURE__ */ new Map();
-  let r = 0, a = 0, o;
-  for (; o = n.exec(e); ) {
-    const { 0: s, groups: { capture: i, name: u } } = o;
-    s === "[" ? r++ : r ? s === "]" && r-- : i && (a++, u && t.set(a, u));
-  }
-  return t;
-}
-function Pr(e, n) {
-  const t = Rr(e, n);
-  return t.options ? new _r(t.pattern, t.flags, t.options) : new RegExp(t.pattern, t.flags);
-}
-function Rr(e, n) {
-  const t = An(n), r = yn(e, {
-    flags: t.flags,
-    normalizeUnknownPropertyNames: !0,
-    rules: {
-      captureGroup: t.rules.captureGroup,
-      singleline: t.rules.singleline
-    },
-    skipBackrefValidation: t.rules.allowOrphanBackrefs,
-    unicodePropertyMap: Ge
-  }), a = ir(r, {
-    accuracy: t.accuracy,
-    asciiWordBoundaries: t.rules.asciiWordBoundaries,
-    avoidSubclass: t.avoidSubclass,
-    bestEffortTarget: t.target
-  }), o = yr(a, t), s = Qt(o.pattern, {
-    captureTransfers: o._captureTransfers,
-    hiddenCaptures: o._hiddenCaptures,
-    mode: "external"
-  }), i = Zt(s.pattern), u = Xt(i.pattern, {
-    captureTransfers: s.captureTransfers,
-    hiddenCaptures: s.hiddenCaptures
-  }), l = {
-    pattern: u.pattern,
-    flags: `${t.hasIndices ? "d" : ""}${t.global ? "g" : ""}${o.flags}${o.options.disable.v ? "u" : "v"}`
-  };
-  if (t.avoidSubclass) {
-    if (t.lazyCompileLength !== 1 / 0)
-      throw new Error("Lazy compilation requires subclass");
-  } else {
-    const p = u.hiddenCaptures.sort((f, w) => f - w), c = Array.from(u.captureTransfers), d = a._strategy, g = l.pattern.length >= t.lazyCompileLength;
-    (p.length || c.length || d || g) && (l.options = {
-      ...p.length && { hiddenCaptures: p },
-      ...c.length && { transfers: c },
-      ...d && { strategy: d },
-      ...g && { lazyCompile: g }
-    });
-  }
-  return l;
-}
-const un = 4294967295;
-class Fr {
-  constructor(n, t = {}) {
-    pn(this, "regexps"), this.patterns = n, this.options = t;
-    const {
-      forgiving: r = !1,
-      cache: a,
-      regexConstructor: o
-    } = t;
-    if (!o)
-      throw new Error("Option `regexConstructor` is not provided");
-    this.regexps = n.map((s) => {
-      if (typeof s != "string")
-        return s;
-      const i = a == null ? void 0 : a.get(s);
-      if (i) {
-        if (i instanceof RegExp)
-          return i;
-        if (r)
-          return null;
-        throw i;
-      }
-      try {
-        const u = o(s);
-        return a == null || a.set(s, u), u;
-      } catch (u) {
-        if (a == null || a.set(s, u), r)
-          return null;
-        throw u;
-      }
-    });
-  }
-  findNextMatchSync(n, t, r) {
-    const a = typeof n == "string" ? n : n.content, o = [];
-    function s(i, u, l = 0) {
-      return {
-        index: i,
-        captureIndices: u.indices.map((p) => p == null ? {
-          start: un,
-          end: un,
-          length: 0
-        } : {
-          start: p[0] + l,
-          end: p[1] + l,
-          length: p[1] - p[0]
-        })
-      };
-    }
-    for (let i = 0; i < this.regexps.length; i++) {
-      const u = this.regexps[i];
-      if (u)
-        try {
-          u.lastIndex = t;
-          const l = u.exec(a);
-          if (!l)
-            continue;
-          if (l.index === t)
-            return s(i, l, 0);
-          o.push([i, l, 0]);
-        } catch (l) {
-          if (this.options.forgiving)
-            continue;
-          throw l;
-        }
-    }
-    if (o.length) {
-      const i = Math.min(...o.map((u) => u[1].index));
-      for (const [u, l, p] of o)
-        if (l.index === i)
-          return s(u, l, p);
-    }
-    return null;
-  }
-}
-function Ur(e, n) {
-  return Pr(
-    e,
-    {
-      global: !0,
-      hasIndices: !0,
-      // This has no benefit for the standard JS engine, but it avoids a perf penalty for
-      // precompiled grammars when constructing extremely long patterns that aren't always used
-      lazyCompileLength: 3e3,
-      rules: {
-        // Needed since TextMate grammars merge backrefs across patterns
-        allowOrphanBackrefs: !0,
-        // Improves search performance for generated regexes
-        asciiWordBoundaries: !0,
-        // Follow `vscode-oniguruma` which enables this Oniguruma option by default
-        captureGroup: !0,
-        // Oniguruma uses depth limit `20`; lowered here to keep regexes shorter and maybe
-        // sometimes faster, but can be increased if issues reported due to low limit
-        recursionLimit: 5,
-        // Oniguruma option for `^`->`\A`, `$`->`\Z`; improves search performance without any
-        // change in meaning since TM grammars search line by line
-        singleline: !0
-      },
-      ...n
-    }
-  );
-}
-function Br(e = {}) {
-  const n = Object.assign(
-    {
-      target: "auto",
-      cache: /* @__PURE__ */ new Map()
-    },
-    e
-  );
-  return n.regexConstructor || (n.regexConstructor = (t) => Ur(t, { target: n.target })), {
-    createScanner(t) {
-      return new Fr(t, n);
-    },
-    createString(t) {
-      return {
-        content: t
-      };
-    }
-  };
-}
-var Gr = Pe("block", "before:content-[counter(line)]", "before:inline-block", "before:[counter-increment:line]", "before:w-4", "before:mr-4", "before:text-[13px]", "before:text-right", "before:text-muted-foreground/50", "before:font-mono", "before:select-none"), Or = jn(({ children: e, result: n, language: t, className: r, ...a }) => {
-  let o = cn(() => ({ backgroundColor: n.bg, color: n.fg }), [n.bg, n.fg]);
-  return A.jsx("pre", { className: Pe(r, "p-4 text-sm dark:bg-(--shiki-dark-bg)!"), "data-language": t, "data-streamdown": "code-block-body", style: o, ...a, children: A.jsx("code", { className: "[counter-increment:line_0] [counter-reset:line]", children: n.tokens.map((s, i) => A.jsx("span", { className: Gr, children: s.map((u, l) => A.jsx("span", { className: "dark:bg-(--shiki-dark-bg)! dark:text-(--shiki-dark)!", style: { color: u.color, backgroundColor: u.bgColor, ...u.htmlStyle }, ...u.htmlAttrs, children: u.content }, l)) }, i)) }) });
-}, (e, n) => e.result === n.result && e.language === n.language && e.className === n.className), Dr = ({ className: e, language: n, style: t, ...r }) => A.jsx("div", { className: Pe("my-4 w-full overflow-hidden rounded-xl border border-border", e), "data-language": n, "data-streamdown": "code-block", style: { contentVisibility: "auto", containIntrinsicSize: "auto 200px", ...t }, ...r }), Tr = ({ language: e, children: n }) => A.jsxs("div", { className: "flex items-center justify-between bg-muted/80 p-3 text-muted-foreground text-xs", "data-language": e, "data-streamdown": "code-block-header", children: [A.jsx("span", { className: "ml-1 font-mono lowercase", children: e }), A.jsx("div", { className: "flex items-center gap-2", children: n })] }), Wr = Br({ forgiving: !0 }), Ae = /* @__PURE__ */ new Map(), Ie = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), jr = (e, n) => `${e}-${n[0]}-${n[1]}`, zr = (e, n, t) => {
-  let r = e.slice(0, 100), a = e.length > 100 ? e.slice(-100) : "";
-  return `${n}:${t[0]}:${t[1]}:${e.length}:${r}:${a}`;
-}, Un = (e) => Object.hasOwn(Wn, e), Vr = (e, n) => {
-  let t = Un(e) ? e : "text", r = jr(t, n);
-  if (Ae.has(r))
-    return Ae.get(r);
-  let a = Tn({ themes: n, langs: [t], engine: Wr });
-  return Ae.set(r, a), a;
-}, ln = (e, n, t, r) => {
-  let a = Un(n) ? n : "text", o = zr(e, a, t);
-  return Ie.has(o) ? Ie.get(o) : (r && (J.has(o) || J.set(o, /* @__PURE__ */ new Set()), J.get(o).add(r)), Vr(a, t).then((s) => {
-    let i = s.codeToTokens(e, { lang: a, themes: { light: t[0], dark: t[1] } });
-    Ie.set(o, i);
-    let u = J.get(o);
-    if (u) {
-      for (let l of u)
-        l(i);
-      J.delete(o);
-    }
-  }).catch((s) => {
-    console.error("Failed to highlight code:", s), J.delete(o);
-  }), null);
-}, qr = ({ code: e, language: n, className: t, children: r, ...a }) => {
-  let { shikiTheme: o } = zn(On), s = cn(() => ({ bg: "transparent", fg: "inherit", tokens: e.split(`
-`).map((l) => [{ content: l, color: "inherit", bgColor: "transparent", htmlStyle: {}, offset: 0 }]) }), [e]), [i, u] = Vn(s);
-  return Hn(() => {
-    let l = ln(e, n, o);
-    if (l) {
-      u(l);
-      return;
-    }
-    ln(e, n, o, (p) => {
-      u(p);
-    });
-  }, [e, n, o]), A.jsx(Dn.Provider, { value: { code: e }, children: A.jsxs(Dr, { language: n, children: [A.jsx(Tr, { language: n, children: r }), A.jsx(Or, { className: t, language: n, result: i, ...a })] }) });
-};
-export {
-  qr as CodeBlock
-};