@kitnai/chat 0.1.0 → 0.3.0

package/dist/engine-javascript-vq0WuIJl.js

@@ -1,94 +1,6 @@
-var Fr = Object.defineProperty;
-var Gr = Object.getPrototypeOf;
-var Pr = Reflect.get;
-var De = (e) => {
-  throw TypeError(e);
-};
-var Rr = (e, r, t) => r in e ? Fr(e, r, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[r] = t;
-var se = (e, r, t) => Rr(e, typeof r != "symbol" ? r + "" : r, t), ye = (e, r, t) => r.has(e) || De("Cannot " + t);
-var E = (e, r, t) => (ye(e, r, "read from private field"), t ? t.call(e) : r.get(e)), z = (e, r, t) => r.has(e) ? De("Cannot add the same private member more than once") : r instanceof WeakSet ? r.add(e) : r.set(e, t), M = (e, r, t, n) => (ye(e, r, "write to private field"), n ? n.call(e, t) : r.set(e, t), t), Ce = (e, r, t) => (ye(e, r, "access private method"), t);
-var Te = (e, r, t) => Pr(Gr(e), t, r);
-var ar = class {
-  constructor(e, r = {}) {
-    se(this, "patterns");
-    se(this, "options");
-    se(this, "regexps");
-    this.patterns = e, this.options = r;
-    const { forgiving: t = !1, cache: n, regexConstructor: s } = r;
-    if (!s) throw new Error("Option `regexConstructor` is not provided");
-    this.regexps = e.map((o) => {
-      if (typeof o != "string") return o;
-      const a = n == null ? void 0 : n.get(o);
-      if (a) {
-        if (a instanceof RegExp) return a;
-        if (t) return null;
-        throw a;
-      }
-      try {
-        const i = s(o);
-        return n == null || n.set(o, i), i;
-      } catch (i) {
-        if (n == null || n.set(o, i), t) return null;
-        throw i;
-      }
-    });
-  }
-  findNextMatchSync(e, r, t) {
-    const n = typeof e == "string" ? e : e.content, s = [];
-    function o(a, i, u = 0) {
-      return {
-        index: a,
-        captureIndices: i.indices.map((c) => c == null ? {
-          start: 4294967295,
-          end: 4294967295,
-          length: 0
-        } : {
-          start: c[0] + u,
-          end: c[1] + u,
-          length: c[1] - c[0]
-        })
-      };
-    }
-    for (let a = 0; a < this.regexps.length; a++) {
-      const i = this.regexps[a];
-      if (i)
-        try {
-          i.lastIndex = r;
-          const u = i.exec(n);
-          if (!u) continue;
-          if (u.index === r) return o(a, u, 0);
-          s.push([
-            a,
-            u,
-            0
-          ]);
-        } catch (u) {
-          if (this.options.forgiving) continue;
-          throw u;
-        }
-    }
-    if (s.length) {
-      const a = Math.min(...s.map((i) => i[1].index));
-      for (const [i, u, c] of s) if (u.index === a) return o(i, u, c);
-    }
-    return null;
-  }
-};
-function re(e) {
-  if ([...e].length !== 1) throw new Error(`Expected "${e}" to be a single code point`);
-  return e.codePointAt(0);
-}
-function Ur(e, r, t) {
-  return e.has(r) || e.set(r, t), e.get(r);
-}
-const Fe = /* @__PURE__ */ new Set(["alnum", "alpha", "ascii", "blank", "cntrl", "digit", "graph", "lower", "print", "punct", "space", "upper", "word", "xdigit"]), x = String.raw;
-function te(e, r) {
-  if (e == null) throw new Error(r ?? "Value expected");
-  return e;
-}
-const ir = x`\[\^?`, ur = `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}`}`, Ge = /[?*+][?+]?|\{(?:\d+(?:,\d*)?|,\d+)\}\??/, ce = new RegExp(x`
+var Pn=Object.defineProperty,Fn=Object.getPrototypeOf,Un=Reflect.get,De=e=>{throw TypeError(e)},Bn=(e,n,t)=>n in e?Pn(e,n,{enumerable:!0,configurable:!0,writable:!0,value:t}):e[n]=t,ie=(e,n,t)=>Bn(e,typeof n!="symbol"?n+"":n,t),me=(e,n,t)=>n.has(e)||De("Cannot "+t),E=(e,n,t)=>(me(e,n,"read from private field"),t?t.call(e):n.get(e)),X=(e,n,t)=>n.has(e)?De("Cannot add the same private member more than once"):n instanceof WeakSet?n.add(e):n.set(e,t),L=(e,n,t,r)=>(me(e,n,"write to private field"),r?r.call(e,t):n.set(e,t),t),Oe=(e,n,t)=>(me(e,n,"access private method"),t),Gn=(e,n,t)=>Un(Fn(e),t,n),be=class{constructor(e,n={}){ie(this,"patterns"),ie(this,"options"),ie(this,"regexps"),this.patterns=e,this.options=n;const{forgiving:t=!1,cache:r,regexConstructor:a}=n;if(!a)throw new Error("Option `regexConstructor` is not provided");this.regexps=e.map(o=>{if(typeof o!="string")return o;const s=r?.get(o);if(s){if(s instanceof RegExp)return s;if(t)return null;throw s}try{const i=a(o);return r?.set(o,i),i}catch(i){if(r?.set(o,i),t)return null;throw i}})}findNextMatchSync(e,n,t){const r=typeof e=="string"?e:e.content,a=[];function o(s,i,u=0){return{index:s,captureIndices:i.indices.map(c=>c==null?{start:4294967295,end:4294967295,length:0}:{start:c[0]+u,end:c[1]+u,length:c[1]-c[0]})}}for(let s=0;s<this.regexps.length;s++){const i=this.regexps[s];if(i)try{i.lastIndex=n;const u=i.exec(r);if(!u)continue;if(u.index===n)return o(s,u,0);a.push([s,u,0])}catch(u){if(this.options.forgiving)continue;throw u}}if(a.length){const s=Math.min(...a.map(i=>i[1].index));for(const[i,u,c]of a)if(u.index===s)return o(i,u,c)}return null}};function Z(e){if([...e].length!==1)throw new Error(`Expected "${e}" to be a single code point`);return e.codePointAt(0)}function Dn(e,n,t){return e.has(n)||e.set(n,t),e.get(n)}const Ce=new Set(["alnum","alpha","ascii","blank","cntrl","digit","graph","lower","print","punct","space","upper","word","xdigit"]),x=String.raw;function Q(e,n){if(e==null)throw new Error(n??"Value expected");return e}const Te=x`\[\^?`,We=`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}`}`,xe=/[?*+][?+]?|\{(?:\d+(?:,\d*)?|,\d+)\}\??/,ue=new RegExp(x`
   \\ (?:
-    ${ur}
+    ${We}
     | [gk]<[^>]*>?
     | [gk]'[^']*'?
     | .
@@ -105,823 +17,20 @@ const ir = x`\[\^?`, ur = `c.? | C(?:-.?)?|${x`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x
     )?
     | \*[^\)]*\)?
   )?
-  | (?:${Ge.source})+
-  | ${ir}
+  | (?:${xe.source})+
+  | ${Te}
   | .
-`.replace(/\s+/g, ""), "gsu"), be = new RegExp(x`
+`.replace(/\s+/g,""),"gsu"),ke=new RegExp(x`
   \\ (?:
-    ${ur}
+    ${We}
     | .
   )
   | \[:(?:\^?\p{Alpha}+|\^):\]
-  | ${ir}
+  | ${Te}
   | &&
   | .
-`.replace(/\s+/g, ""), "gsu");
-function Or(e, r = {}) {
-  const t = { flags: "", ...r, rules: { captureGroup: !1, singleline: !1, ...r.rules } };
-  if (typeof e != "string") throw new Error("String expected as pattern");
-  const n = nt(t.flags), s = [n.extended], o = { captureGroup: t.rules.captureGroup, getCurrentModX() {
-    return s.at(-1);
-  }, numOpenGroups: 0, popModX() {
-    s.pop();
-  }, pushModX(l) {
-    s.push(l);
-  }, replaceCurrentModX(l) {
-    s[s.length - 1] = l;
-  }, singleline: t.rules.singleline };
-  let a = [], i;
-  for (ce.lastIndex = 0; i = ce.exec(e); ) {
-    const l = Dr(o, e, i[0], ce.lastIndex);
-    l.tokens ? a.push(...l.tokens) : l.token && a.push(l.token), l.lastIndex !== void 0 && (ce.lastIndex = l.lastIndex);
-  }
-  const u = [];
-  let c = 0;
-  a.filter((l) => l.type === "GroupOpen").forEach((l) => {
-    l.kind === "capturing" ? l.number = ++c : l.raw === "(" && u.push(l);
-  }), c || u.forEach((l, f) => {
-    l.kind = "capturing", l.number = f + 1;
-  });
-  const p = c || u.length;
-  return { tokens: a.map((l) => l.type === "EscapedNumber" ? ot(l, p) : l).flat(), flags: n };
-}
-function Dr(e, r, t, n) {
-  const [s, o] = t;
-  if (t === "[" || t === "[^") {
-    const a = Tr(r, t, n);
-    return { tokens: a.tokens, lastIndex: a.lastIndex };
-  }
-  if (s === "\\") {
-    if ("AbBGyYzZ".includes(o)) return { token: Be(t, t) };
-    if (/^\\g[<']/.test(t)) {
-      if (!/^\\g(?:<[^>]+>|'[^']+')$/.test(t)) throw new Error(`Invalid group name "${t}"`);
-      return { token: qr(t) };
-    }
-    if (/^\\k[<']/.test(t)) {
-      if (!/^\\k(?:<[^>]+>|'[^']+')$/.test(t)) throw new Error(`Invalid group name "${t}"`);
-      return { token: lr(t) };
-    }
-    if (o === "K") return { token: pr("keep", t) };
-    if (o === "N" || o === "R") return { token: j("newline", t, { negate: o === "N" }) };
-    if (o === "O") return { token: j("any", t) };
-    if (o === "X") return { token: j("text_segment", t) };
-    const a = cr(t, { inCharClass: !1 });
-    return Array.isArray(a) ? { tokens: a } : { token: a };
-  }
-  if (s === "(") {
-    if (o === "*") return { token: et(t) };
-    if (t === "(?{") throw new Error(`Unsupported callout "${t}"`);
-    if (t.startsWith("(?#")) {
-      if (r[n] !== ")") throw new Error('Unclosed comment group "(?#"');
-      return { lastIndex: n + 1 };
-    }
-    if (/^\(\?[-imx]+[:)]$/.test(t)) return { token: Yr(t, e) };
-    if (e.pushModX(e.getCurrentModX()), e.numOpenGroups++, t === "(" && !e.captureGroup || t === "(?:") return { token: Y("group", t) };
-    if (t === "(?>") return { token: Y("atomic", t) };
-    if (t === "(?=" || t === "(?!" || t === "(?<=" || t === "(?<!") return { token: Y(t[2] === "<" ? "lookbehind" : "lookahead", t, { negate: t.endsWith("!") }) };
-    if (t === "(" && e.captureGroup || t.startsWith("(?<") && t.endsWith(">") || t.startsWith("(?'") && t.endsWith("'")) return { token: Y("capturing", t, { ...t !== "(" && { name: t.slice(3, -1) } }) };
-    if (t.startsWith("(?~")) {
-      if (t === "(?~|") throw new Error(`Unsupported absence function kind "${t}"`);
-      return { token: Y("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: Xr(t) };
-  }
-  if (e.getCurrentModX()) {
-    if (t === "#") {
-      const a = r.indexOf(`
-`, n);
-      return { lastIndex: a === -1 ? r.length : a };
-    }
-    if (/^\s$/.test(t)) {
-      const a = /\s+/y;
-      return a.lastIndex = n, { lastIndex: a.exec(r) ? a.lastIndex : n };
-    }
-  }
-  if (t === ".") return { token: j("dot", t) };
-  if (t === "^" || t === "$") {
-    const a = e.singleline ? { "^": x`\A`, $: x`\Z` }[t] : t;
-    return { token: Be(a, t) };
-  }
-  return t === "|" ? { token: Vr(t) } : Ge.test(t) ? { tokens: at(t) } : { token: R(re(t), t) };
-}
-function Tr(e, r, t) {
-  const n = [Ve(r[1] === "^", r)];
-  let s = 1, o;
-  for (be.lastIndex = t; o = be.exec(e); ) {
-    const a = o[0];
-    if (a[0] === "[" && a[1] !== ":") s++, n.push(Ve(a[1] === "^", a));
-    else if (a === "]") {
-      if (n.at(-1).type === "CharacterClassOpen") n.push(R(93, a));
-      else if (s--, n.push(zr(a)), !s) break;
-    } else {
-      const i = Br(a);
-      Array.isArray(i) ? n.push(...i) : n.push(i);
-    }
-  }
-  return { tokens: n, lastIndex: be.lastIndex || e.length };
-}
-function Br(e) {
-  if (e[0] === "\\") return cr(e, { inCharClass: !0 });
-  if (e[0] === "[") {
-    const r = /\[:(?<negate>\^?)(?<name>[a-z]+):\]/.exec(e);
-    if (!r || !Fe.has(r.groups.name)) throw new Error(`Invalid POSIX class "${e}"`);
-    return j("posix", e, { value: r.groups.name, negate: !!r.groups.negate });
-  }
-  return e === "-" ? Wr(e) : e === "&&" ? Hr(e) : R(re(e), e);
-}
-function cr(e, { inCharClass: r }) {
-  const t = e[1];
-  if (t === "c" || t === "C") return Kr(e);
-  if ("dDhHsSwW".includes(t)) return rt(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 tt(e);
-  }
-  if (new RegExp("^\\\\x[89A-Fa-f]\\p{AHex}", "u").test(e)) try {
-    const n = e.split(/\\x/).slice(1).map((a) => parseInt(a, 16)), s = new TextDecoder("utf-8", { ignoreBOM: !0, fatal: !0 }).decode(new Uint8Array(n)), o = new TextEncoder();
-    return [...s].map((a) => {
-      const i = [...o.encode(a)].map((u) => `\\x${u.toString(16)}`).join("");
-      return R(re(a), i);
-    });
-  } catch {
-    throw new Error(`Multibyte code "${e}" incomplete or invalid in Oniguruma`);
-  }
-  if (t === "u" || t === "x") return R(st(e), e);
-  if (ze.has(t)) return R(ze.get(t), e);
-  if (/\d/.test(t)) return jr(r, e);
-  if (e === "\\") throw new Error(x`Incomplete escape "\"`);
-  if (t === "M") throw new Error(`Unsupported meta "${e}"`);
-  if ([...e].length === 2) return R(e.codePointAt(1), e);
-  throw new Error(`Unexpected escape "${e}"`);
-}
-function Vr(e) {
-  return { type: "Alternator", raw: e };
-}
-function Be(e, r) {
-  return { type: "Assertion", kind: e, raw: r };
-}
-function lr(e) {
-  return { type: "Backreference", raw: e };
-}
-function R(e, r) {
-  return { type: "Character", value: e, raw: r };
-}
-function zr(e) {
-  return { type: "CharacterClassClose", raw: e };
-}
-function Wr(e) {
-  return { type: "CharacterClassHyphen", raw: e };
-}
-function Hr(e) {
-  return { type: "CharacterClassIntersector", raw: e };
-}
-function Ve(e, r) {
-  return { type: "CharacterClassOpen", negate: e, raw: r };
-}
-function j(e, r, t = {}) {
-  return { type: "CharacterSet", kind: e, ...t, raw: r };
-}
-function pr(e, r, t = {}) {
-  return e === "keep" ? { type: "Directive", kind: e, raw: r } : { type: "Directive", kind: e, flags: te(t.flags), raw: r };
-}
-function jr(e, r) {
-  return { type: "EscapedNumber", inCharClass: e, raw: r };
-}
-function Xr(e) {
-  return { type: "GroupClose", raw: e };
-}
-function Y(e, r, t = {}) {
-  return { type: "GroupOpen", kind: e, ...t, raw: r };
-}
-function Zr(e, r, t, n) {
-  return { type: "NamedCallout", kind: e, tag: r, arguments: t, raw: n };
-}
-function Qr(e, r, t, n) {
-  return { type: "Quantifier", kind: e, min: r, max: t, raw: n };
-}
-function qr(e) {
-  return { type: "Subroutine", raw: e };
-}
-const Jr = /* @__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 Kr(e) {
-  const r = e[1] === "c" ? e[2] : e[3];
-  if (!r || !/[A-Za-z]/.test(r)) throw new Error(`Unsupported control character "${e}"`);
-  return R(re(r.toUpperCase()) - 64, e);
-}
-function Yr(e, r) {
-  let { on: t, off: n } = /^\(\?(?<on>[imx]*)(?:-(?<off>[-imx]*))?/.exec(e).groups;
-  n ?? (n = "");
-  const s = (r.getCurrentModX() || t.includes("x")) && !n.includes("x"), o = He(t), a = He(n), i = {};
-  if (o && (i.enable = o), a && (i.disable = a), e.endsWith(")")) return r.replaceCurrentModX(s), pr("flags", e, { flags: i });
-  if (e.endsWith(":")) return r.pushModX(s), r.numOpenGroups++, Y("group", e, { ...(o || a) && { flags: i } });
-  throw new Error(`Unexpected flag modifier "${e}"`);
-}
-function et(e) {
-  const r = /\(\*(?<name>[A-Za-z_]\w*)?(?:\[(?<tag>(?:[A-Za-z_]\w*)?)\])?(?:\{(?<args>[^}]*)\})?\)/.exec(e);
-  if (!r) throw new Error(`Incomplete or invalid named callout "${e}"`);
-  const { name: t, tag: n, args: s } = r.groups;
-  if (!t) throw new Error(`Invalid named callout "${e}"`);
-  if (n === "") throw new Error(`Named callout tag with empty value not allowed "${e}"`);
-  const o = s ? s.split(",").filter((p) => p !== "").map((p) => /^[+-]?\d+$/.test(p) ? +p : p) : [], [a, i, u] = o, c = Jr.has(t) ? t.toLowerCase() : "custom";
-  switch (c) {
-    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 a == "string") throw new Error(`Named callout argument must be a number "${a}"`);
-      break;
-    case "max":
-      if (!o.length || o.length > 2) throw new Error(`Named callout must have one or two arguments "${o}"`);
-      if (typeof a == "string" && !/^[A-Za-z_]\w*$/.test(a)) throw new Error(`Named callout argument one must be a tag or number "${a}"`);
-      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 a == "number" || !/^[<>X]$/.test(a))) throw new Error(`Named callout optional argument must be '<', '>', or 'X' "${a}"`);
-      break;
-    case "cmp":
-      if (o.length !== 3) throw new Error(`Named callout must have three arguments "${o}"`);
-      if (typeof a == "string" && !/^[A-Za-z_]\w*$/.test(a)) throw new Error(`Named callout argument one must be a tag or number "${a}"`);
-      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 "${c}"`);
-  }
-  return Zr(c, n ?? null, (s == null ? void 0 : s.split(",")) ?? null, e);
-}
-function We(e) {
-  let r = null, t, n;
-  if (e[0] === "{") {
-    const { minStr: s, maxStr: o } = /^\{(?<minStr>\d*)(?:,(?<maxStr>\d*))?/.exec(e).groups, a = 1e5;
-    if (+s > a || o && +o > a) throw new Error("Quantifier value unsupported in Oniguruma");
-    if (t = +s, n = o === void 0 ? +s : o === "" ? 1 / 0 : +o, t > n && (r = "possessive", [t, n] = [n, t]), e.endsWith("?")) {
-      if (r === "possessive") throw new Error('Unsupported possessive interval quantifier chain with "?"');
-      r = "lazy";
-    } else r || (r = "greedy");
-  } else t = e[0] === "+" ? 1 : 0, n = e[0] === "?" ? 1 : 1 / 0, r = e[1] === "+" ? "possessive" : e[1] === "?" ? "lazy" : "greedy";
-  return Qr(r, t, n, e);
-}
-function rt(e) {
-  const r = e[1].toLowerCase();
-  return j({ d: "digit", h: "hex", s: "space", w: "word" }[r], e, { negate: e[1] !== r });
-}
-function tt(e) {
-  const { p: r, neg: t, value: n } = /^\\(?<p>[pP])\{(?<neg>\^?)(?<value>[^}]+)/.exec(e).groups;
-  return j("property", e, { value: n, negate: r === "P" && !t || r === "p" && !!t });
-}
-function He(e) {
-  const r = {};
-  return e.includes("i") && (r.ignoreCase = !0), e.includes("m") && (r.dotAll = !0), e.includes("x") && (r.extended = !0), Object.keys(r).length ? r : null;
-}
-function nt(e) {
-  const r = { 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 n = e[t];
-    if (!"imxDPSWy".includes(n)) throw new Error(`Invalid flag "${n}"`);
-    if (n === "y") {
-      if (!/^y{[gw]}/.test(e.slice(t))) throw new Error('Invalid or unspecified flag "y" mode');
-      r.textSegmentMode = e[t + 2] === "g" ? "grapheme" : "word", t += 3;
-      continue;
-    }
-    r[{ i: "ignoreCase", m: "dotAll", x: "extended", D: "digitIsAscii", P: "posixIsAscii", S: "spaceIsAscii", W: "wordIsAscii" }[n]] = !0;
-  }
-  return r;
-}
-function st(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 r = e[2] === "{" ? new RegExp("^\\\\x\\{\\s*(?<hex>\\p{AHex}+)", "u").exec(e).groups.hex : e.slice(2);
-  return parseInt(r, 16);
-}
-function ot(e, r) {
-  const { raw: t, inCharClass: n } = e, s = t.slice(1);
-  if (!n && (s !== "0" && s.length === 1 || s[0] !== "0" && +s <= r)) return [lr(t)];
-  const o = [], a = s.match(/^[0-7]+|\d/g);
-  for (let i = 0; i < a.length; i++) {
-    const u = a[i];
-    let c;
-    if (i === 0 && u !== "8" && u !== "9") {
-      if (c = parseInt(u, 8), c > 127) throw new Error(x`Octal encoded byte above 177 unsupported "${t}"`);
-    } else c = re(u);
-    o.push(R(c, (i === 0 ? "\\" : "") + u));
-  }
-  return o;
-}
-function at(e) {
-  const r = [], t = new RegExp(Ge, "gy");
-  let n;
-  for (; n = t.exec(e); ) {
-    const s = n[0];
-    if (s[0] === "{") {
-      const o = /^\{(?<min>\d+),(?<max>\d+)\}\??$/.exec(s);
-      if (o) {
-        const { min: a, max: i } = o.groups;
-        if (+a > +i && s.endsWith("?")) {
-          t.lastIndex--, r.push(We(s.slice(0, -1)));
-          continue;
-        }
-      }
-    }
-    r.push(We(s));
-  }
-  return r;
-}
-function fr(e, r) {
-  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 !r || Object.keys(r).every((n) => r[n] === t[n]);
-}
-function it(e) {
-  return ut.has(e.type);
-}
-const ut = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
-function dr(e, r = {}) {
-  const t = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...r, rules: { captureGroup: !1, singleline: !1, ...r.rules } }, n = Or(e, { flags: t.flags, rules: { captureGroup: t.rules.captureGroup, singleline: t.rules.singleline } }), s = (f, g) => {
-    const d = n.tokens[o.nextIndex];
-    switch (o.parent = f, o.nextIndex++, d.type) {
-      case "Alternator":
-        return Q();
-      case "Assertion":
-        return ct(d);
-      case "Backreference":
-        return lt(d, o);
-      case "Character":
-        return ge(d.value, { useLastValid: !!g.isCheckingRangeEnd });
-      case "CharacterClassHyphen":
-        return pt(d, o, g);
-      case "CharacterClassOpen":
-        return ft(d, o, g);
-      case "CharacterSet":
-        return dt(d, o);
-      case "Directive":
-        return Ct(d.kind, { flags: d.flags });
-      case "GroupOpen":
-        return gt(d, o, g);
-      case "NamedCallout":
-        return xt(d.kind, d.tag, d.arguments);
-      case "Quantifier":
-        return ht(d, o);
-      case "Subroutine":
-        return wt(d, o);
-      default:
-        throw new Error(`Unexpected token type "${d.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: n.tokens, unicodePropertyMap: t.unicodePropertyMap, walk: s }, a = Et(bt(n.flags));
-  let i = a.body[0];
-  for (; o.nextIndex < n.tokens.length; ) {
-    const f = s(i, {});
-    f.type === "Alternative" ? (a.body.push(f), i = f) : i.body.push(f);
-  }
-  const { capturingGroups: u, hasNumberedRef: c, namedGroupsByName: p, subroutines: l } = o;
-  if (c && p.size && !t.rules.captureGroup) throw new Error("Numbered backref/subroutine not allowed when using named capture");
-  for (const { ref: f } of l) if (typeof f == "number") {
-    if (f > u.length) throw new Error("Subroutine uses a group number that's not defined");
-    f && (u[f - 1].isSubroutined = !0);
-  } else if (p.has(f)) {
-    if (p.get(f).length > 1) throw new Error(x`Subroutine uses a duplicate group name "\g<${f}>"`);
-    p.get(f)[0].isSubroutined = !0;
-  } else throw new Error(x`Subroutine uses a group name that's not defined "\g<${f}>"`);
-  return a;
-}
-function ct({ kind: e }) {
-  return Se(te({ "^": "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 lt({ raw: e }, r) {
-  const t = /^\\k[<']/.test(e), n = t ? e.slice(3, -1) : e.slice(1), s = (o, a = !1) => {
-    const i = r.capturingGroups.length;
-    let u = !1;
-    if (o > i) if (r.skipBackrefValidation) u = !0;
-    else throw new Error(`Not enough capturing groups defined to the left "${e}"`);
-    return r.hasNumberedRef = !0, ve(a ? i + 1 - o : o, { orphan: u });
-  };
-  if (t) {
-    const o = /^(?<sign>-?)0*(?<num>[1-9]\d*)$/.exec(n);
-    if (o) return s(+o.groups.num, !!o.groups.sign);
-    if (/[-+]/.test(n)) throw new Error(`Invalid backref name "${e}"`);
-    if (!r.namedGroupsByName.has(n)) throw new Error(`Group name not defined to the left "${e}"`);
-    return ve(n);
-  }
-  return s(+n);
-}
-function pt(e, r, t) {
-  const { tokens: n, walk: s } = r, o = r.parent, a = o.body.at(-1), i = n[r.nextIndex];
-  if (!t.isCheckingRangeEnd && a && a.type !== "CharacterClass" && a.type !== "CharacterClassRange" && i && i.type !== "CharacterClassOpen" && i.type !== "CharacterClassClose" && i.type !== "CharacterClassIntersector") {
-    const u = s(o, { ...t, isCheckingRangeEnd: !0 });
-    if (a.type === "Character" && u.type === "Character") return o.body.pop(), yt(a, u);
-    throw new Error("Invalid character class range");
-  }
-  return ge(re("-"));
-}
-function ft({ negate: e }, r, t) {
-  const { tokens: n, walk: s } = r, o = [fe()], a = n[r.nextIndex];
-  let i = Ze(a);
-  for (; i.type !== "CharacterClassClose"; ) {
-    if (i.type === "CharacterClassIntersector") o.push(fe()), r.nextIndex++;
-    else {
-      const c = o.at(-1);
-      c.body.push(s(c, t));
-    }
-    i = Ze(n[r.nextIndex], a);
-  }
-  const u = fe({ negate: e });
-  return o.length === 1 ? u.body = o[0].body : (u.kind = "intersection", u.body = o.map((c) => c.body.length === 1 ? c.body[0] : c)), r.nextIndex++, u;
-}
-function dt({ kind: e, negate: r, value: t }, n) {
-  const { normalizeUnknownPropertyNames: s, skipPropertyNameValidation: o, unicodePropertyMap: a } = n;
-  if (e === "property") {
-    const i = he(t);
-    if (Fe.has(i) && !(a != null && a.has(i))) e = "posix", t = i;
-    else return ee(t, { negate: r, normalizeUnknownPropertyNames: s, skipPropertyNameValidation: o, unicodePropertyMap: a });
-  }
-  return e === "posix" ? kt(t, { negate: r }) : _e(e, { negate: r });
-}
-function gt(e, r, t) {
-  const { tokens: n, capturingGroups: s, namedGroupsByName: o, skipLookbehindValidation: a, walk: i } = r, u = $t(e), c = u.type === "AbsenceFunction", p = Xe(u), l = p && u.negate;
-  if (u.type === "CapturingGroup" && (s.push(u), u.name && Ur(o, u.name, []).push(u)), c && t.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
-  let f = Qe(n[r.nextIndex]);
-  for (; f.type !== "GroupClose"; ) {
-    if (f.type === "Alternator") u.body.push(Q()), r.nextIndex++;
-    else {
-      const g = u.body.at(-1), d = i(g, { ...t, isInAbsenceFunction: t.isInAbsenceFunction || c, isInLookbehind: t.isInLookbehind || p, isInNegLookbehind: t.isInNegLookbehind || l });
-      if (g.body.push(d), (p || t.isInLookbehind) && !a) {
-        const w = "Lookbehind includes a pattern not allowed by Oniguruma";
-        if (l || t.isInNegLookbehind) {
-          if (je(d) || d.type === "CapturingGroup") throw new Error(w);
-        } else if (je(d) || Xe(d) && d.negate) throw new Error(w);
-      }
-    }
-    f = Qe(n[r.nextIndex]);
-  }
-  return r.nextIndex++, u;
-}
-function ht({ kind: e, min: r, max: t }, n) {
-  const s = n.parent, o = s.body.at(-1);
-  if (!o || !it(o)) throw new Error("Quantifier requires a repeatable token");
-  const a = hr(e, r, t, o);
-  return s.body.pop(), a;
-}
-function wt({ raw: e }, r) {
-  const { capturingGroups: t, subroutines: n } = r;
-  let s = e.slice(3, -1);
-  const o = /^(?<sign>[-+]?)0*(?<num>[1-9]\d*)$/.exec(s);
-  if (o) {
-    const i = +o.groups.num, u = t.length;
-    if (r.hasNumberedRef = !0, s = { "": i, "+": u + i, "-": u + 1 - i }[o.groups.sign], s < 1) throw new Error("Invalid subroutine number");
-  } else s === "0" && (s = 0);
-  const a = wr(s);
-  return n.push(a), a;
-}
-function mt(e, r) {
-  return { type: "AbsenceFunction", kind: e, body: ue(r == null ? void 0 : r.body) };
-}
-function Q(e) {
-  return { type: "Alternative", body: mr(e == null ? void 0 : e.body) };
-}
-function Se(e, r) {
-  const t = { type: "Assertion", kind: e };
-  return (e === "word_boundary" || e === "text_segment_boundary") && (t.negate = !!(r != null && r.negate)), t;
-}
-function ve(e, r) {
-  const t = !!(r != null && r.orphan);
-  return { type: "Backreference", ref: e, ...t && { orphan: t } };
-}
-function gr(e, r) {
-  const t = { name: void 0, isSubroutined: !1, ...r };
-  if (t.name !== void 0 && !At(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(r == null ? void 0 : r.body) };
-}
-function ge(e, r) {
-  const t = { useLastValid: !1, ...r };
-  if (e > 1114111) {
-    const n = e.toString(16);
-    if (t.useLastValid) e = 1114111;
-    else throw e > 1310719 ? new Error(`Invalid code point out of range "\\x{${n}}"`) : new Error(`Invalid code point out of range in JS "\\x{${n}}"`);
-  }
-  return { type: "Character", value: e };
-}
-function fe(e) {
-  const r = { kind: "union", negate: !1, ...e };
-  return { type: "CharacterClass", kind: r.kind, negate: r.negate, body: mr(e == null ? void 0 : e.body) };
-}
-function yt(e, r) {
-  if (r.value < e.value) throw new Error("Character class range out of order");
-  return { type: "CharacterClassRange", min: e, max: r };
-}
-function _e(e, r) {
-  const t = !!(r != null && r.negate), n = { type: "CharacterSet", kind: e };
-  return (e === "digit" || e === "hex" || e === "newline" || e === "space" || e === "word") && (n.negate = t), (e === "text_segment" || e === "newline" && !t) && (n.variableLength = !0), n;
-}
-function Ct(e, r = {}) {
-  if (e === "keep") return { type: "Directive", kind: e };
-  if (e === "flags") return { type: "Directive", kind: e, flags: te(r.flags) };
-  throw new Error(`Unexpected directive kind "${e}"`);
-}
-function bt(e) {
-  return { type: "Flags", ...e };
-}
-function N(e) {
-  const r = e == null ? void 0 : e.atomic, t = e == null ? void 0 : e.flags;
-  if (r && t) throw new Error("Atomic group cannot have flags");
-  return { type: "Group", ...r && { atomic: r }, ...t && { flags: t }, body: ue(e == null ? void 0 : e.body) };
-}
-function H(e) {
-  const r = { behind: !1, negate: !1, ...e };
-  return { type: "LookaroundAssertion", kind: r.behind ? "lookbehind" : "lookahead", negate: r.negate, body: ue(e == null ? void 0 : e.body) };
-}
-function xt(e, r, t) {
-  return { type: "NamedCallout", kind: e, tag: r, arguments: t };
-}
-function kt(e, r) {
-  const t = !!(r != null && r.negate);
-  if (!Fe.has(e)) throw new Error(`Invalid POSIX class "${e}"`);
-  return { type: "CharacterSet", kind: "posix", value: e, negate: t };
-}
-function hr(e, r, t, n) {
-  if (r > t) throw new Error("Invalid reversed quantifier range");
-  return { type: "Quantifier", kind: e, min: r, max: t, body: n };
-}
-function Et(e, r) {
-  return { type: "Regex", body: ue(r == null ? void 0 : r.body), flags: e };
-}
-function wr(e) {
-  return { type: "Subroutine", ref: e };
-}
-function ee(e, r) {
-  var s;
-  const t = { negate: !1, normalizeUnknownPropertyNames: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...r };
-  let n = (s = t.unicodePropertyMap) == null ? void 0 : s.get(he(e));
-  if (!n) {
-    if (t.normalizeUnknownPropertyNames) n = It(e);
-    else if (t.unicodePropertyMap && !t.skipPropertyNameValidation) throw new Error(x`Invalid Unicode property "\p{${e}}"`);
-  }
-  return { type: "CharacterSet", kind: "property", value: n ?? e, negate: t.negate };
-}
-function $t({ flags: e, kind: r, name: t, negate: n, number: s }) {
-  switch (r) {
-    case "absence_repeater":
-      return mt("repeater");
-    case "atomic":
-      return N({ atomic: !0 });
-    case "capturing":
-      return gr(s, { name: t });
-    case "group":
-      return N({ flags: e });
-    case "lookahead":
-    case "lookbehind":
-      return H({ behind: r === "lookbehind", negate: n });
-    default:
-      throw new Error(`Unexpected group kind "${r}"`);
-  }
-}
-function ue(e) {
-  if (e === void 0) e = [Q()];
-  else if (!Array.isArray(e) || !e.length || !e.every((r) => r.type === "Alternative")) throw new Error("Invalid body; expected array of one or more Alternative nodes");
-  return e;
-}
-function mr(e) {
-  if (e === void 0) e = [];
-  else if (!Array.isArray(e) || !e.every((r) => !!r.type)) throw new Error("Invalid body; expected array of nodes");
-  return e;
-}
-function je(e) {
-  return e.type === "LookaroundAssertion" && e.kind === "lookahead";
-}
-function Xe(e) {
-  return e.type === "LookaroundAssertion" && e.kind === "lookbehind";
-}
-function At(e) {
-  return /^[\p{Alpha}\p{Pc}][^)]*$/u.test(e);
-}
-function It(e) {
-  return e.trim().replace(/[- _]+/g, "_").replace(/[A-Z][a-z]+(?=[A-Z])/g, "$&_").replace(/[A-Za-z]+/g, (r) => r[0].toUpperCase() + r.slice(1).toLowerCase());
-}
-function he(e) {
-  return e.replace(/[- _]+/g, "").toLowerCase();
-}
-function Ze(e, r) {
-  const t = r;
-  return te(e, `Unclosed character class${(t == null ? void 0 : t.type) === "Character" && t.value === 93 && t.raw === "]" ? ' (started with "]")' : ""}`);
-}
-function Qe(e) {
-  return te(e, "Unclosed group");
-}
-function oe(e, r, t = null) {
-  function n(o, a) {
-    for (let i = 0; i < o.length; i++) {
-      const u = s(o[i], a, i, o);
-      i = Math.max(-1, i + u);
-    }
-  }
-  function s(o, a = null, i = null, u = null) {
-    var $, A;
-    let c = 0, p = !1;
-    const l = { node: o, parent: a, key: i, container: u, root: e, remove() {
-      le(u).splice(Math.max(0, J(i) + c), 1), c--, p = !0;
-    }, removeAllNextSiblings() {
-      return le(u).splice(J(i) + 1);
-    }, removeAllPrevSiblings() {
-      const y = J(i) + c;
-      return c -= y, le(u).splice(0, Math.max(0, y));
-    }, replaceWith(y, k = {}) {
-      const v = !!k.traverse;
-      u ? u[Math.max(0, J(i) + c)] = y : te(a, "Can't replace root node")[i] = y, v && s(y, a, i, u), p = !0;
-    }, replaceWithMultiple(y, k = {}) {
-      const v = !!k.traverse;
-      if (le(u).splice(Math.max(0, J(i) + c), 1, ...y), c += y.length - 1, v) {
-        let V = 0;
-        for (let _ = 0; _ < y.length; _++) V += s(y[_], a, J(i) + _ + V, u);
-      }
-      p = !0;
-    }, skip() {
-      p = !0;
-    } }, { type: f } = o, g = r["*"], d = r[f], w = typeof g == "function" ? g : g == null ? void 0 : g.enter, m = typeof d == "function" ? d : d == null ? void 0 : d.enter;
-    if (w == null || w(l, t), m == null || m(l, t), !p) switch (f) {
-      case "AbsenceFunction":
-      case "Alternative":
-      case "CapturingGroup":
-      case "CharacterClass":
-      case "Group":
-      case "LookaroundAssertion":
-        n(o.body, o);
-        break;
-      case "Assertion":
-      case "Backreference":
-      case "Character":
-      case "CharacterSet":
-      case "Directive":
-      case "Flags":
-      case "NamedCallout":
-      case "Subroutine":
-        break;
-      case "CharacterClassRange":
-        s(o.min, o, "min"), s(o.max, o, "max");
-        break;
-      case "Quantifier":
-        s(o.body, o, "body");
-        break;
-      case "Regex":
-        n(o.body, o), s(o.flags, o, "flags");
-        break;
-      default:
-        throw new Error(`Unexpected node type "${f}"`);
-    }
-    return ($ = d == null ? void 0 : d.exit) == null || $.call(d, l, t), (A = g == null ? void 0 : g.exit) == null || A.call(g, l, t), c;
-  }
-  return s(e), e;
-}
-function le(e) {
-  if (!Array.isArray(e)) throw new Error("Container expected");
-  return e;
-}
-function J(e) {
-  if (typeof e != "number") throw new Error("Numeric key expected");
-  return e;
-}
-const St = String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;
-function vt(e, r) {
-  for (let t = 0; t < e.length; t++)
-    e[t] >= r && e[t]++;
-}
-function _t(e, r, t, n) {
-  return e.slice(0, r) + n + e.slice(r + t.length);
-}
-const S = Object.freeze({
-  DEFAULT: "DEFAULT",
-  CHAR_CLASS: "CHAR_CLASS"
-});
-function Pe(e, r, t, n) {
-  const s = new RegExp(String.raw`${r}|(?<$skip>\[\^?|\\?.)`, "gsu"), o = [!1];
-  let a = 0, i = "";
-  for (const u of e.matchAll(s)) {
-    const { 0: c, groups: { $skip: p } } = u;
-    if (!p && (!n || n === S.DEFAULT == !a)) {
-      t instanceof Function ? i += t(u, {
-        context: a ? S.CHAR_CLASS : S.DEFAULT,
-        negated: o[o.length - 1]
-      }) : i += t;
-      continue;
-    }
-    c[0] === "[" ? (a++, o.push(c[1] === "^")) : c === "]" && a && (a--, o.pop()), i += c;
-  }
-  return i;
-}
-function yr(e, r, t, n) {
-  Pe(e, r, t, n);
-}
-function Mt(e, r, t = 0, n) {
-  if (!new RegExp(r, "su").test(e))
-    return null;
-  const s = new RegExp(`${r}|(?<$skip>\\\\?.)`, "gsu");
-  s.lastIndex = t;
-  let o = 0, a;
-  for (; a = s.exec(e); ) {
-    const { 0: i, groups: { $skip: u } } = a;
-    if (!u && (!n || n === S.DEFAULT == !o))
-      return a;
-    i === "[" ? o++ : i === "]" && o && o--, s.lastIndex == a.index && s.lastIndex++;
-  }
-  return null;
-}
-function pe(e, r, t) {
-  return !!Mt(e, r, 0, t);
-}
-function Nt(e, r) {
-  const t = /\\?./gsu;
-  t.lastIndex = r;
-  let n = e.length, s = 0, o = 1, a;
-  for (; a = t.exec(e); ) {
-    const [i] = a;
-    if (i === "[")
-      s++;
-    else if (s)
-      i === "]" && s--;
-    else if (i === "(")
-      o++;
-    else if (i === ")" && (o--, !o)) {
-      n = a.index;
-      break;
-    }
-  }
-  return e.slice(r, n);
-}
-const qe = new RegExp(String.raw`(?<noncapturingStart>${St})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`, "gsu");
-function Lt(e, r) {
-  const t = (r == null ? void 0 : r.hiddenCaptures) ?? [];
-  let n = (r == null ? void 0 : r.captureTransfers) ?? /* @__PURE__ */ new Map();
-  if (!/\(\?>/.test(e))
-    return {
-      pattern: e,
-      captureTransfers: n,
-      hiddenCaptures: t
-    };
-  const s = "(?>", o = "(?:(?=(", a = [0], i = [];
-  let u = 0, c = 0, p = NaN, l;
-  do {
-    l = !1;
-    let f = 0, g = 0, d = !1, w;
-    for (qe.lastIndex = Number.isNaN(p) ? 0 : p + o.length; w = qe.exec(e); ) {
-      const { 0: m, index: $, groups: { capturingStart: A, noncapturingStart: y } } = w;
-      if (m === "[")
-        f++;
-      else if (f)
-        m === "]" && f--;
-      else if (m === s && !d)
-        p = $, d = !0;
-      else if (d && y)
-        g++;
-      else if (A)
-        d ? g++ : (u++, a.push(u + c));
-      else if (m === ")" && d) {
-        if (!g) {
-          c++;
-          const k = u + c;
-          if (e = `${e.slice(0, p)}${o}${e.slice(p + s.length, $)}))<$$${k}>)${e.slice($ + 1)}`, l = !0, i.push(k), vt(t, k), n.size) {
-            const v = /* @__PURE__ */ new Map();
-            n.forEach((V, _) => {
-              v.set(
-                _ >= k ? _ + 1 : _,
-                V.map((q) => q >= k ? q + 1 : q)
-              );
-            }), n = v;
-          }
-          break;
-        }
-        g--;
-      }
-    }
-  } while (l);
-  return t.push(...i), e = Pe(
-    e,
-    String.raw`\\(?<backrefNum>[1-9]\d*)|<\$\$(?<wrappedBackrefNum>\d+)>`,
-    ({ 0: f, groups: { backrefNum: g, wrappedBackrefNum: d } }) => {
-      if (g) {
-        const w = +g;
-        if (w > a.length - 1)
-          throw new Error(`Backref "${f}" greater than number of captures`);
-        return `\\${a[w]}`;
-      }
-      return `\\${d}`;
-    },
-    S.DEFAULT
-  ), {
-    pattern: e,
-    captureTransfers: n,
-    hiddenCaptures: t
-  };
-}
-const Cr = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, xe = new RegExp(String.raw`
+`.replace(/\s+/g,""),"gsu");function On(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=at(t.flags),a=[r.extended],o={captureGroup:t.rules.captureGroup,getCurrentModX(){return a.at(-1)},numOpenGroups:0,popModX(){a.pop()},pushModX(l){a.push(l)},replaceCurrentModX(l){a[a.length-1]=l},singleline:t.rules.singleline};let s=[],i;for(ue.lastIndex=0;i=ue.exec(e);){const l=Tn(o,e,i[0],ue.lastIndex);l.tokens?s.push(...l.tokens):l.token&&s.push(l.token),l.lastIndex!==void 0&&(ue.lastIndex=l.lastIndex)}const u=[];let c=0;s.filter(l=>l.type==="GroupOpen").forEach(l=>{l.kind==="capturing"?l.number=++c:l.raw==="("&&u.push(l)}),c||u.forEach((l,d)=>{l.kind="capturing",l.number=d+1});const p=c||u.length;return{tokens:s.map(l=>l.type==="EscapedNumber"?it(l,p):l).flat(),flags:r}}function Tn(e,n,t,r){const[a,o]=t;if(t==="["||t==="[^"){const s=Wn(n,t,r);return{tokens:s.tokens,lastIndex:s.lastIndex}}if(a==="\\"){if("AbBGyYzZ".includes(o))return{token:Ve(t,t)};if(/^\\g[<']/.test(t)){if(!/^\\g(?:<[^>]+>|'[^']+')$/.test(t))throw new Error(`Invalid group name "${t}"`);return{token:Kn(t)}}if(/^\\k[<']/.test(t)){if(!/^\\k(?:<[^>]+>|'[^']+')$/.test(t))throw new Error(`Invalid group name "${t}"`);return{token:je(t)}}if(o==="K")return{token:Xe("keep",t)};if(o==="N"||o==="R")return{token:O("newline",t,{negate:o==="N"})};if(o==="O")return{token:O("any",t)};if(o==="X")return{token:O("text_segment",t)};const s=ze(t,{inCharClass:!1});return Array.isArray(s)?{tokens:s}:{token:s}}if(a==="("){if(o==="*")return{token:tt(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:nt(t,e)};if(e.pushModX(e.getCurrentModX()),e.numOpenGroups++,t==="("&&!e.captureGroup||t==="(?:")return{token:q("group",t)};if(t==="(?>")return{token:q("atomic",t)};if(t==="(?="||t==="(?!"||t==="(?<="||t==="(?<!")return{token:q(t[2]==="<"?"lookbehind":"lookahead",t,{negate:t.endsWith("!")})};if(t==="("&&e.captureGroup||t.startsWith("(?<")&&t.endsWith(">")||t.startsWith("(?'")&&t.endsWith("'"))return{token:q("capturing",t,{...t!=="("&&{name:t.slice(3,-1)}})};if(t.startsWith("(?~")){if(t==="(?~|")throw new Error(`Unsupported absence function kind "${t}"`);return{token:q("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:Qn(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:O("dot",t)};if(t==="^"||t==="$"){const s=e.singleline?{"^":x`\A`,$:x`\Z`}[t]:t;return{token:Ve(s,t)}}return t==="|"?{token:Vn(t)}:xe.test(t)?{tokens:ut(t)}:{token:R(Z(t),t)}}function Wn(e,n,t){const r=[He(n[1]==="^",n)];let a=1,o;for(ke.lastIndex=t;o=ke.exec(e);){const s=o[0];if(s[0]==="["&&s[1]!==":")a++,r.push(He(s[1]==="^",s));else if(s==="]"){if(r.at(-1).type==="CharacterClassOpen")r.push(R(93,s));else if(a--,r.push(jn(s)),!a)break}else{const i=zn(s);Array.isArray(i)?r.push(...i):r.push(i)}}return{tokens:r,lastIndex:ke.lastIndex||e.length}}function zn(e){if(e[0]==="\\")return ze(e,{inCharClass:!0});if(e[0]==="["){const n=/\[:(?<negate>\^?)(?<name>[a-z]+):\]/.exec(e);if(!n||!Ce.has(n.groups.name))throw new Error(`Invalid POSIX class "${e}"`);return O("posix",e,{value:n.groups.name,negate:!!n.groups.negate})}return e==="-"?Hn(e):e==="&&"?Xn(e):R(Z(e),e)}function ze(e,{inCharClass:n}){const t=e[1];if(t==="c"||t==="C")return et(e);if("dDhHsSwW".includes(t))return rt(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 ot(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 R(Z(s),i)})}catch{throw new Error(`Multibyte code "${e}" incomplete or invalid in Oniguruma`)}if(t==="u"||t==="x")return R(st(e),e);if(Ze.has(t))return R(Ze.get(t),e);if(/\d/.test(t))return Zn(n,e);if(e==="\\")throw new Error(x`Incomplete escape "\"`);if(t==="M")throw new Error(`Unsupported meta "${e}"`);if([...e].length===2)return R(e.codePointAt(1),e);throw new Error(`Unexpected escape "${e}"`)}function Vn(e){return{type:"Alternator",raw:e}}function Ve(e,n){return{type:"Assertion",kind:e,raw:n}}function je(e){return{type:"Backreference",raw:e}}function R(e,n){return{type:"Character",value:e,raw:n}}function jn(e){return{type:"CharacterClassClose",raw:e}}function Hn(e){return{type:"CharacterClassHyphen",raw:e}}function Xn(e){return{type:"CharacterClassIntersector",raw:e}}function He(e,n){return{type:"CharacterClassOpen",negate:e,raw:n}}function O(e,n,t={}){return{type:"CharacterSet",kind:e,...t,raw:n}}function Xe(e,n,t={}){return e==="keep"?{type:"Directive",kind:e,raw:n}:{type:"Directive",kind:e,flags:Q(t.flags),raw:n}}function Zn(e,n){return{type:"EscapedNumber",inCharClass:e,raw:n}}function Qn(e){return{type:"GroupClose",raw:e}}function q(e,n,t={}){return{type:"GroupOpen",kind:e,...t,raw:n}}function qn(e,n,t,r){return{type:"NamedCallout",kind:e,tag:n,arguments:t,raw:r}}function Jn(e,n,t,r){return{type:"Quantifier",kind:e,min:n,max:t,raw:r}}function Kn(e){return{type:"Subroutine",raw:e}}const Yn=new Set(["COUNT","CMP","ERROR","FAIL","MAX","MISMATCH","SKIP","TOTAL_COUNT"]),Ze=new Map([["a",7],["b",8],["e",27],["f",12],["n",10],["r",13],["t",9],["v",11]]);function et(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 R(Z(n.toUpperCase())-64,e)}function nt(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=qe(t),s=qe(r),i={};if(o&&(i.enable=o),s&&(i.disable=s),e.endsWith(")"))return n.replaceCurrentModX(a),Xe("flags",e,{flags:i});if(e.endsWith(":"))return n.pushModX(a),n.numOpenGroups++,q("group",e,{...(o||s)&&{flags:i}});throw new Error(`Unexpected flag modifier "${e}"`)}function tt(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,c=Yn.has(t)?t.toLowerCase():"custom";switch(c){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 "${c}"`)}return qn(c,r??null,a?.split(",")??null,e)}function Qe(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 Jn(n,t,r,e)}function rt(e){const n=e[1].toLowerCase();return O({d:"digit",h:"hex",s:"space",w:"word"}[n],e,{negate:e[1]!==n})}function ot(e){const{p:n,neg:t,value:r}=/^\\(?<p>[pP])\{(?<neg>\^?)(?<value>[^}]+)/.exec(e).groups;return O("property",e,{value:r,negate:n==="P"&&!t||n==="p"&&!!t})}function qe(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 at(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 st(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 it(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[je(t)];const o=[],s=a.match(/^[0-7]+|\d/g);for(let i=0;i<s.length;i++){const u=s[i];let c;if(i===0&&u!=="8"&&u!=="9"){if(c=parseInt(u,8),c>127)throw new Error(x`Octal encoded byte above 177 unsupported "${t}"`)}else c=Z(u);o.push(R(c,(i===0?"\\":"")+u))}return o}function ut(e){const n=[],t=new RegExp(xe,"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(Qe(a.slice(0,-1)));continue}}}n.push(Qe(a))}return n}function Je(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 ct(e){return lt.has(e.type)}const lt=new Set(["AbsenceFunction","Backreference","CapturingGroup","Character","CharacterClass","CharacterSet","Group","Quantifier","Subroutine"]);function Ke(e,n={}){const t={flags:"",normalizeUnknownPropertyNames:!1,skipBackrefValidation:!1,skipLookbehindValidation:!1,skipPropertyNameValidation:!1,unicodePropertyMap:null,...n,rules:{captureGroup:!1,singleline:!1,...n.rules}},r=On(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 T();case"Assertion":return pt(f);case"Backreference":return dt(f,o);case"Character":return ce(f.value,{useLastValid:!!g.isCheckingRangeEnd});case"CharacterClassHyphen":return ft(f,o,g);case"CharacterClassOpen":return gt(f,o,g);case"CharacterSet":return ht(f,o);case"Directive":return xt(f.kind,{flags:f.flags});case"GroupOpen":return wt(f,o,g);case"NamedCallout":return Et(f.kind,f.tag,f.arguments);case"Quantifier":return yt(f,o);case"Subroutine":return mt(f,o);default:throw new Error(`Unexpected token type "${f.type}"`)}},o={capturingGroups:[],hasNumberedRef:!1,namedGroupsByName: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=$t(kt(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:c,namedGroupsByName:p,subroutines:l}=o;if(c&&p.size&&!t.rules.captureGroup)throw new Error("Numbered backref/subroutine not allowed when using named capture");for(const{ref:d}of l)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 pt({kind:e}){return Ee(Q({"^":"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 dt({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,ve(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 ve(r)}return a(+r)}function ft(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(),Ct(s,u);throw new Error("Invalid character class range")}return ce(Z("-"))}function gt({negate:e},n,t){const{tokens:r,walk:a}=n,o=[le()],s=r[n.nextIndex];let i=an(s);for(;i.type!=="CharacterClassClose";){if(i.type==="CharacterClassIntersector")o.push(le()),n.nextIndex++;else{const c=o.at(-1);c.body.push(a(c,t))}i=an(r[n.nextIndex],s)}const u=le({negate:e});return o.length===1?u.body=o[0].body:(u.kind="intersection",u.body=o.map(c=>c.body.length===1?c.body[0]:c)),n.nextIndex++,u}function ht({kind:e,negate:n,value:t},r){const{normalizeUnknownPropertyNames:a,skipPropertyNameValidation:o,unicodePropertyMap:s}=r;if(e==="property"){const i=pe(t);if(Ce.has(i)&&!(s!=null&&s.has(i)))e="posix",t=i;else return J(t,{negate:n,normalizeUnknownPropertyNames:a,skipPropertyNameValidation:o,unicodePropertyMap:s})}return e==="posix"?vt(t,{negate:n}):$e(e,{negate:n})}function wt(e,n,t){const{tokens:r,capturingGroups:a,namedGroupsByName:o,skipLookbehindValidation:s,walk:i}=n,u=At(e),c=u.type==="AbsenceFunction",p=on(u),l=p&&u.negate;if(u.type==="CapturingGroup"&&(a.push(u),u.name&&Dn(o,u.name,[]).push(u)),c&&t.isInAbsenceFunction)throw new Error("Nested absence function not supported by Oniguruma");let d=sn(r[n.nextIndex]);for(;d.type!=="GroupClose";){if(d.type==="Alternator")u.body.push(T()),n.nextIndex++;else{const g=u.body.at(-1),f=i(g,{...t,isInAbsenceFunction:t.isInAbsenceFunction||c,isInLookbehind:t.isInLookbehind||p,isInNegLookbehind:t.isInNegLookbehind||l});if(g.body.push(f),(p||t.isInLookbehind)&&!s){const w="Lookbehind includes a pattern not allowed by Oniguruma";if(l||t.isInNegLookbehind){if(rn(f)||f.type==="CapturingGroup")throw new Error(w)}else if(rn(f)||on(f)&&f.negate)throw new Error(w)}}d=sn(r[n.nextIndex])}return n.nextIndex++,u}function yt({kind:e,min:n,max:t},r){const a=r.parent,o=a.body.at(-1);if(!o||!ct(o))throw new Error("Quantifier requires a repeatable token");const s=en(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=nn(a);return r.push(s),s}function bt(e,n){return{type:"AbsenceFunction",kind:e,body:re(n?.body)}}function T(e){return{type:"Alternative",body:tn(e?.body)}}function Ee(e,n){const t={type:"Assertion",kind:e};return(e==="word_boundary"||e==="text_segment_boundary")&&(t.negate=!!(n!=null&&n.negate)),t}function ve(e,n){const t=!!(n!=null&&n.orphan);return{type:"Backreference",ref:e,...t&&{orphan:t}}}function Ye(e,n){const t={name:void 0,isSubroutined:!1,...n};if(t.name!==void 0&&!It(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:re(n?.body)}}function ce(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 le(e){const n={kind:"union",negate:!1,...e};return{type:"CharacterClass",kind:n.kind,negate:n.negate,body:tn(e?.body)}}function Ct(e,n){if(n.value<e.value)throw new Error("Character class range out of order");return{type:"CharacterClassRange",min:e,max:n}}function $e(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 xt(e,n={}){if(e==="keep")return{type:"Directive",kind:e};if(e==="flags")return{type:"Directive",kind:e,flags:Q(n.flags)};throw new Error(`Unexpected directive kind "${e}"`)}function kt(e){return{type:"Flags",...e}}function _(e){const n=e?.atomic,t=e?.flags;if(n&&t)throw new Error("Atomic group cannot have flags");return{type:"Group",...n&&{atomic:n},...t&&{flags:t},body:re(e?.body)}}function W(e){const n={behind:!1,negate:!1,...e};return{type:"LookaroundAssertion",kind:n.behind?"lookbehind":"lookahead",negate:n.negate,body:re(e?.body)}}function Et(e,n,t){return{type:"NamedCallout",kind:e,tag:n,arguments:t}}function vt(e,n){const t=!!(n!=null&&n.negate);if(!Ce.has(e))throw new Error(`Invalid POSIX class "${e}"`);return{type:"CharacterSet",kind:"posix",value:e,negate:t}}function en(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 $t(e,n){return{type:"Regex",body:re(n?.body),flags:e}}function nn(e){return{type:"Subroutine",ref:e}}function J(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(pe(e));if(!a){if(r.normalizeUnknownPropertyNames)a=St(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 At({flags:e,kind:n,name:t,negate:r,number:a}){switch(n){case"absence_repeater":return bt("repeater");case"atomic":return _({atomic:!0});case"capturing":return Ye(a,{name:t});case"group":return _({flags:e});case"lookahead":case"lookbehind":return W({behind:n==="lookbehind",negate:r});default:throw new Error(`Unexpected group kind "${n}"`)}}function re(e){if(e===void 0)e=[T()];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 tn(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 rn(e){return e.type==="LookaroundAssertion"&&e.kind==="lookahead"}function on(e){return e.type==="LookaroundAssertion"&&e.kind==="lookbehind"}function It(e){return/^[\p{Alpha}\p{Pc}][^)]*$/u.test(e)}function St(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 pe(e){return e.replace(/[- _]+/g,"").toLowerCase()}function an(e,n){const t=n;return Q(e,`Unclosed character class${t?.type==="Character"&&t.value===93&&t.raw==="]"?' (started with "]")':""}`)}function sn(e){return Q(e,"Unclosed group")}function oe(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 c,p;let l=0,d=!1;const g={node:o,parent:s,key:i,container:u,root:e,remove(){de(u).splice(Math.max(0,K(i)+l),1),l--,d=!0},removeAllNextSiblings(){return de(u).splice(K(i)+1)},removeAllPrevSiblings(){const m=K(i)+l;return l-=m,de(u).splice(0,Math.max(0,m))},replaceWith(m,k={}){const I=!!k.traverse;u?u[Math.max(0,K(i)+l)]=m:Q(s,"Can't replace root node")[i]=m,I&&a(m,s,i,u),d=!0},replaceWithMultiple(m,k={}){const I=!!k.traverse;if(de(u).splice(Math.max(0,K(i)+l),1,...m),l+=m.length-1,I){let D=0;for(let S=0;S<m.length;S++)D+=a(m[S],s,K(i)+S+D,u)}d=!0},skip(){d=!0}},{type:f}=o,w=n["*"],y=n[f],N=typeof w=="function"?w:w?.enter,v=typeof y=="function"?y:y?.enter;if(N?.(g,t),v?.(g,t),!d)switch(f){case"AbsenceFunction":case"Alternative":case"CapturingGroup":case"CharacterClass":case"Group":case"LookaroundAssertion":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"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(c=y?.exit)==null||c.call(y,g,t),(p=w?.exit)==null||p.call(w,g,t),l}return a(e),e}function de(e){if(!Array.isArray(e))throw new Error("Container expected");return e}function K(e){if(typeof e!="number")throw new Error("Numeric key expected");return e}const _t=String.raw`\(\?(?:[:=!>A-Za-z\-]|<[=!]|\(DEFINE\))`;function Mt(e,n){for(let t=0;t<e.length;t++)e[t]>=n&&e[t]++}function Nt(e,n,t,r){return e.slice(0,n)+r+e.slice(n+t.length)}const $=Object.freeze({DEFAULT:"DEFAULT",CHAR_CLASS:"CHAR_CLASS"});function Ae(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:c,groups:{$skip:p}}=u;if(!p&&(!r||r===$.DEFAULT==!s)){t instanceof Function?i+=t(u,{context:s?$.CHAR_CLASS:$.DEFAULT,negated:o[o.length-1]}):i+=t;continue}c[0]==="["?(s++,o.push(c[1]==="^")):c==="]"&&s&&(s--,o.pop()),i+=c}return i}function un(e,n,t,r){Ae(e,n,t,r)}function Lt(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===$.DEFAULT==!o))return s;i==="["?o++:i==="]"&&o&&o--,a.lastIndex==s.index&&a.lastIndex++}return null}function fe(e,n,t){return!!Lt(e,n,0,t)}function Rt(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 cn=new RegExp(String.raw`(?<noncapturingStart>${_t})|(?<capturingStart>\((?:\?<[^>]+>)?)|\\?.`,"gsu");function Pt(e,n){const t=n?.hiddenCaptures??[];let r=n?.captureTransfers??new Map;if(!/\(\?>/.test(e))return{pattern:e,captureTransfers:r,hiddenCaptures:t};const a="(?>",o="(?:(?=(",s=[0],i=[];let u=0,c=0,p=NaN,l;do{l=!1;let d=0,g=0,f=!1,w;for(cn.lastIndex=Number.isNaN(p)?0:p+o.length;w=cn.exec(e);){const{0:y,index:N,groups:{capturingStart:v,noncapturingStart:m}}=w;if(y==="[")d++;else if(d)y==="]"&&d--;else if(y===a&&!f)p=N,f=!0;else if(f&&m)g++;else if(v)f?g++:(u++,s.push(u+c));else if(y===")"&&f){if(!g){c++;const k=u+c;if(e=`${e.slice(0,p)}${o}${e.slice(p+a.length,N)}))<$$${k}>)${e.slice(N+1)}`,l=!0,i.push(k),Mt(t,k),r.size){const I=new Map;r.forEach((D,S)=>{I.set(S>=k?S+1:S,D.map(H=>H>=k?H+1:H))}),r=I}break}g--}}}while(l);return t.push(...i),e=Ae(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}`},$.DEFAULT),{pattern:e,captureTransfers:r,hiddenCaptures:t}}const ln=String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`,Ie=new RegExp(String.raw`
 \\(?: \d+
   | c[A-Za-z]
   | [gk]<[^>]+>
@@ -934,342 +43,9 @@ const Cr = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, xe = new RegExp(String.raw`
   | [A-Za-z\-]+:
   | \(DEFINE\)
   ))?
-| (?<qBase>${Cr})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
+| (?<qBase>${ln})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
 | \\?.
-`.replace(/\s+/g, ""), "gsu");
-function Ft(e) {
-  if (!new RegExp(`${Cr}\\+`).test(e))
-    return {
-      pattern: e
-    };
-  const r = [];
-  let t = null, n = null, s = "", o = 0, a;
-  for (xe.lastIndex = 0; a = xe.exec(e); ) {
-    const { 0: i, index: u, groups: { qBase: c, qMod: p, invalidQ: l } } = a;
-    if (i === "[")
-      o || (n = u), o++;
-    else if (i === "]")
-      o ? o-- : n = null;
-    else if (!o)
-      if (p === "+" && s && !s.startsWith("(")) {
-        if (l)
-          throw new Error(`Invalid quantifier "${i}"`);
-        let f = -1;
-        if (/^\{\d+\}$/.test(c))
-          e = _t(e, u + c.length, p, "");
-        else {
-          if (s === ")" || s === "]") {
-            const g = s === ")" ? t : n;
-            if (g === null)
-              throw new Error(`Invalid unmatched "${s}"`);
-            e = `${e.slice(0, g)}(?>${e.slice(g, u)}${c})${e.slice(u + i.length)}`;
-          } else
-            e = `${e.slice(0, u - s.length)}(?>${s}${c})${e.slice(u + i.length)}`;
-          f += 4;
-        }
-        xe.lastIndex += f;
-      } else i[0] === "(" ? r.push(u) : i === ")" && (t = r.length ? r.pop() : null);
-    s = i;
-  }
-  return {
-    pattern: e
-  };
-}
-const I = String.raw, Gt = I`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, Me = I`\(\?R=(?<rDepth>[^\)]+)\)|${Gt}`, we = I`\(\?<(?![=!])(?<captureName>[^>]+)>`, br = I`${we}|(?<unnamed>\()(?!\?)`, W = new RegExp(I`${we}|${Me}|\(\?|\\?.`, "gsu"), ke = "Cannot use multiple overlapping recursions";
-function Pt(e, r) {
-  const { hiddenCaptures: t, mode: n } = {
-    hiddenCaptures: [],
-    mode: "plugin",
-    ...r
-  };
-  let s = (r == null ? void 0 : r.captureTransfers) ?? /* @__PURE__ */ new Map();
-  if (!new RegExp(Me, "su").test(e))
-    return {
-      pattern: e,
-      captureTransfers: s,
-      hiddenCaptures: t
-    };
-  if (n === "plugin" && pe(e, I`\(\?\(DEFINE\)`, S.DEFAULT))
-    throw new Error("DEFINE groups cannot be used with recursion");
-  const o = [], a = pe(e, I`\\[1-9]`, S.DEFAULT), i = /* @__PURE__ */ new Map(), u = [];
-  let c = !1, p = 0, l = 0, f;
-  for (W.lastIndex = 0; f = W.exec(e); ) {
-    const { 0: g, groups: { captureName: d, rDepth: w, gRNameOrNum: m, gRDepth: $ } } = f;
-    if (g === "[")
-      p++;
-    else if (p)
-      g === "]" && p--;
-    else if (w) {
-      if (Je(w), c)
-        throw new Error(ke);
-      if (a)
-        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
-          `${n === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with global recursion`
-        );
-      const A = e.slice(0, f.index), y = e.slice(W.lastIndex);
-      if (pe(y, Me, S.DEFAULT))
-        throw new Error(ke);
-      const k = +w - 1;
-      e = Ke(
-        A,
-        y,
-        k,
-        !1,
-        t,
-        o,
-        l
-      ), s = er(
-        s,
-        A,
-        k,
-        o.length,
-        0,
-        l
-      );
-      break;
-    } else if (m) {
-      Je($);
-      let A = !1;
-      for (const ne of u)
-        if (ne.name === m || ne.num === +m) {
-          if (A = !0, ne.hasRecursedWithin)
-            throw new Error(ke);
-          break;
-        }
-      if (!A)
-        throw new Error(I`Recursive \g cannot be used outside the referenced group "${n === "external" ? m : I`\g<${m}&R=${$}>`}"`);
-      const y = i.get(m), k = Nt(e, y);
-      if (a && pe(k, I`${we}|\((?!\?)`, S.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
-          `${n === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with recursion of capturing groups`
-        );
-      const v = e.slice(y, f.index), V = k.slice(v.length + g.length), _ = o.length, q = +$ - 1, Oe = Ke(
-        v,
-        V,
-        q,
-        !0,
-        t,
-        o,
-        l
-      );
-      s = er(
-        s,
-        v,
-        q,
-        o.length - _,
-        _,
-        l
-      );
-      const Nr = e.slice(0, y), Lr = e.slice(y + k.length);
-      e = `${Nr}${Oe}${Lr}`, W.lastIndex += Oe.length - g.length - v.length - V.length, u.forEach((ne) => ne.hasRecursedWithin = !0), c = !0;
-    } else if (d)
-      l++, i.set(String(l), W.lastIndex), i.set(d, W.lastIndex), u.push({
-        num: l,
-        name: d
-      });
-    else if (g[0] === "(") {
-      const A = g === "(";
-      A && (l++, i.set(String(l), W.lastIndex)), u.push(A ? { num: l } : {});
-    } else g === ")" && u.pop();
-  }
-  return t.push(...o), {
-    pattern: e,
-    captureTransfers: s,
-    hiddenCaptures: t
-  };
-}
-function Je(e) {
-  const r = `Max depth must be integer between 2 and 100; used ${e}`;
-  if (!/^[1-9]\d*$/.test(e))
-    throw new Error(r);
-  if (e = +e, e < 2 || e > 100)
-    throw new Error(r);
-}
-function Ke(e, r, t, n, s, o, a) {
-  const i = /* @__PURE__ */ new Set();
-  n && yr(e + r, we, ({ groups: { captureName: c } }) => {
-    i.add(c);
-  }, S.DEFAULT);
-  const u = [
-    t,
-    n ? i : null,
-    s,
-    o,
-    a
-  ];
-  return `${e}${Ye(`(?:${e}`, "forward", ...u)}(?:)${Ye(`${r})`, "backward", ...u)}${r}`;
-}
-function Ye(e, r, t, n, s, o, a) {
-  const u = (p) => r === "forward" ? p + 2 : t - p + 2 - 1;
-  let c = "";
-  for (let p = 0; p < t; p++) {
-    const l = u(p);
-    c += Pe(
-      e,
-      I`${br}|\\k<(?<backref>[^>]+)>`,
-      ({ 0: f, groups: { captureName: g, unnamed: d, backref: w } }) => {
-        if (w && n && !n.has(w))
-          return f;
-        const m = `_$${l}`;
-        if (d || g) {
-          const $ = a + o.length + 1;
-          return o.push($), Rt(s, $), d ? f : `(?<${g}${m}>`;
-        }
-        return I`\k<${w}${m}>`;
-      },
-      S.DEFAULT
-    );
-  }
-  return c;
-}
-function Rt(e, r) {
-  for (let t = 0; t < e.length; t++)
-    e[t] >= r && e[t]++;
-}
-function er(e, r, t, n, s, o) {
-  if (e.size && n) {
-    let a = 0;
-    yr(r, br, () => a++, S.DEFAULT);
-    const i = o - a + s, u = /* @__PURE__ */ new Map();
-    return e.forEach((c, p) => {
-      const l = (n - a * t) / t, f = a * t, g = p > i + a ? p + n : p, d = [];
-      for (const w of c)
-        if (w <= i)
-          d.push(w);
-        else if (w > i + a + l)
-          d.push(w + n);
-        else if (w <= i + a)
-          for (let m = 0; m <= t; m++)
-            d.push(w + a * m);
-        else
-          for (let m = 0; m <= t; m++)
-            d.push(w + f + l * m);
-      u.set(g, d);
-    }), u;
-  }
-  return e;
-}
-var b = String.fromCodePoint, h = String.raw, L = {}, me = globalThis.RegExp;
-L.flagGroups = (() => {
-  try {
-    new me("(?i:)");
-  } catch {
-    return !1;
-  }
-  return !0;
-})();
-L.unicodeSets = (() => {
-  try {
-    new me("[[]]", "v");
-  } catch {
-    return !1;
-  }
-  return !0;
-})();
-L.bugFlagVLiteralHyphenIsRange = L.unicodeSets ? (() => {
-  try {
-    new me(h`[\d\-a]`, "v");
-  } catch {
-    return !0;
-  }
-  return !1;
-})() : !1;
-L.bugNestedClassIgnoresNegation = L.unicodeSets && new me("[[^a]]", "v").test("a");
-function de(e, { enable: r, disable: t }) {
-  return {
-    dotAll: !(t != null && t.dotAll) && !!(r != null && r.dotAll || e.dotAll),
-    ignoreCase: !(t != null && t.ignoreCase) && !!(r != null && r.ignoreCase || e.ignoreCase)
-  };
-}
-function ae(e, r, t) {
-  return e.has(r) || e.set(r, t), e.get(r);
-}
-function Ne(e, r) {
-  return rr[e] >= rr[r];
-}
-function Ut(e, r) {
-  if (e == null)
-    throw new Error(r ?? "Value expected");
-  return e;
-}
-var rr = {
-  ES2025: 2025,
-  ES2024: 2024,
-  ES2018: 2018
-}, Ot = (
-  /** @type {const} */
-  {
-    auto: "auto",
-    ES2025: "ES2025",
-    ES2024: "ES2024",
-    ES2018: "ES2018"
-  }
-);
-function xr(e = {}) {
-  if ({}.toString.call(e) !== "[object Object]")
-    throw new Error("Unexpected options");
-  if (e.target !== void 0 && !Ot[e.target])
-    throw new Error(`Unexpected target "${e.target}"`);
-  const r = {
-    // 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 r.target === "auto" && (r.target = L.flagGroups ? "ES2025" : L.unicodeSets ? "ES2024" : "ES2018"), r;
-}
-var Dt = "[	-\r ]", Tt = /* @__PURE__ */ new Set([
-  b(304),
-  // İ
-  b(305)
-  // ı
-]), F = h`[\p{L}\p{M}\p{N}\p{Pc}]`;
-function kr(e) {
-  if (Tt.has(e))
-    return [e];
-  const r = /* @__PURE__ */ new Set(), t = e.toLowerCase(), n = t.toUpperCase(), s = zt.get(t), o = Bt.get(t), a = Vt.get(t);
-  return [...n].length === 1 && r.add(n), a && r.add(a), s && r.add(s), r.add(t), o && r.add(o), [...r];
-}
-var Re = /* @__PURE__ */ new Map(
-  `C Other
+`.replace(/\s+/g,""),"gsu");function Ft(e){if(!new RegExp(`${ln}\\+`).test(e))return{pattern:e};const n=[];let t=null,r=null,a="",o=0,s;for(Ie.lastIndex=0;s=Ie.exec(e);){const{0:i,index:u,groups:{qBase:c,qMod:p,invalidQ:l}}=s;if(i==="[")o||(r=u),o++;else if(i==="]")o?o--:r=null;else if(!o)if(p==="+"&&a&&!a.startsWith("(")){if(l)throw new Error(`Invalid quantifier "${i}"`);let d=-1;if(/^\{\d+\}$/.test(c))e=Nt(e,u+c.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)}${c})${e.slice(u+i.length)}`}else e=`${e.slice(0,u-a.length)}(?>${a}${c})${e.slice(u+i.length)}`;d+=4}Ie.lastIndex+=d}else i[0]==="("?n.push(u):i===")"&&(t=n.length?n.pop():null);a=i}return{pattern:e}}const A=String.raw,Ut=A`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`,Se=A`\(\?R=(?<rDepth>[^\)]+)\)|${Ut}`,ge=A`\(\?<(?![=!])(?<captureName>[^>]+)>`,pn=A`${ge}|(?<unnamed>\()(?!\?)`,z=new RegExp(A`${ge}|${Se}|\(\?|\\?.`,"gsu"),_e="Cannot use multiple overlapping recursions";function Bt(e,n){const{hiddenCaptures:t,mode:r}={hiddenCaptures:[],mode:"plugin",...n};let a=n?.captureTransfers??new Map;if(!new RegExp(Se,"su").test(e))return{pattern:e,captureTransfers:a,hiddenCaptures:t};if(r==="plugin"&&fe(e,A`\(\?\(DEFINE\)`,$.DEFAULT))throw new Error("DEFINE groups cannot be used with recursion");const o=[],s=fe(e,A`\\[1-9]`,$.DEFAULT),i=new Map,u=[];let c=!1,p=0,l=0,d;for(z.lastIndex=0;d=z.exec(e);){const{0:g,groups:{captureName:f,rDepth:w,gRNameOrNum:y,gRDepth:N}}=d;if(g==="[")p++;else if(p)g==="]"&&p--;else if(w){if(dn(w),c)throw new Error(_e);if(s)throw new Error(`${r==="external"?"Backrefs":"Numbered backrefs"} cannot be used with global recursion`);const v=e.slice(0,d.index),m=e.slice(z.lastIndex);if(fe(m,Se,$.DEFAULT))throw new Error(_e);const k=+w-1;e=fn(v,m,k,!1,t,o,l),a=hn(a,v,k,o.length,0,l);break}else if(y){dn(N);let v=!1;for(const te of u)if(te.name===y||te.num===+y){if(v=!0,te.hasRecursedWithin)throw new Error(_e);break}if(!v)throw new Error(A`Recursive \g cannot be used outside the referenced group "${r==="external"?y:A`\g<${y}&R=${N}>`}"`);const m=i.get(y),k=Rt(e,m);if(s&&fe(k,A`${ge}|\((?!\?)`,$.DEFAULT))throw new Error(`${r==="external"?"Backrefs":"Numbered backrefs"} cannot be used with recursion of capturing groups`);const I=e.slice(m,d.index),D=k.slice(I.length+g.length),S=o.length,H=+N-1,Ge=fn(I,D,H,!0,t,o,l);a=hn(a,I,H,o.length-S,S,l);const Ln=e.slice(0,m),Rn=e.slice(m+k.length);e=`${Ln}${Ge}${Rn}`,z.lastIndex+=Ge.length-g.length-I.length-D.length,u.forEach(te=>te.hasRecursedWithin=!0),c=!0}else if(f)l++,i.set(String(l),z.lastIndex),i.set(f,z.lastIndex),u.push({num:l,name:f});else if(g[0]==="("){const v=g==="(";v&&(l++,i.set(String(l),z.lastIndex)),u.push(v?{num:l}:{})}else g===")"&&u.pop()}return t.push(...o),{pattern:e,captureTransfers:a,hiddenCaptures:t}}function dn(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 fn(e,n,t,r,a,o,s){const i=new Set;r&&un(e+n,ge,({groups:{captureName:c}})=>{i.add(c)},$.DEFAULT);const u=[t,r?i:null,a,o,s];return`${e}${gn(`(?:${e}`,"forward",...u)}(?:)${gn(`${n})`,"backward",...u)}${n}`}function gn(e,n,t,r,a,o,s){const i=c=>n==="forward"?c+2:t-c+2-1;let u="";for(let c=0;c<t;c++){const p=i(c);u+=Ae(e,A`${pn}|\\k<(?<backref>[^>]+)>`,({0:l,groups:{captureName:d,unnamed:g,backref:f}})=>{if(f&&r&&!r.has(f))return l;const w=`_$${p}`;if(g||d){const y=s+o.length+1;return o.push(y),Gt(a,y),g?l:`(?<${d}${w}>`}return A`\k<${f}${w}>`},$.DEFAULT)}return u}function Gt(e,n){for(let t=0;t<e.length;t++)e[t]>=n&&e[t]++}function hn(e,n,t,r,a,o){if(e.size&&r){let s=0;un(n,pn,()=>s++,$.DEFAULT);const i=o-s+a,u=new Map;return e.forEach((c,p)=>{const l=(r-s*t)/t,d=s*t,g=p>i+s?p+r:p,f=[];for(const w of c)if(w<=i)f.push(w);else if(w>i+s+l)f.push(w+r);else if(w<=i+s)for(let y=0;y<=t;y++)f.push(w+s*y);else for(let y=0;y<=t;y++)f.push(w+d+l*y);u.set(g,f)}),u}return e}var C=String.fromCodePoint,h=String.raw,M={},he=globalThis.RegExp;M.flagGroups=(()=>{try{new he("(?i:)")}catch{return!1}return!0})(),M.unicodeSets=(()=>{try{new he("[[]]","v")}catch{return!1}return!0})(),M.bugFlagVLiteralHyphenIsRange=M.unicodeSets?(()=>{try{new he(h`[\d\-a]`,"v")}catch{return!0}return!1})():!1,M.bugNestedClassIgnoresNegation=M.unicodeSets&&new he("[[^a]]","v").test("a");function we(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 ae(e,n,t){return e.has(n)||e.set(n,t),e.get(n)}function Me(e,n){return wn[e]>=wn[n]}function Dt(e,n){if(e==null)throw new Error(n??"Value expected");return e}var wn={ES2025:2025,ES2024:2024,ES2018:2018},Ot={auto:"auto",ES2025:"ES2025",ES2024:"ES2024",ES2018:"ES2018"};function yn(e={}){if({}.toString.call(e)!=="[object Object]")throw new Error("Unexpected options");if(e.target!==void 0&&!Ot[e.target])throw new Error(`Unexpected target "${e.target}"`);const n={accuracy:"default",avoidSubclass:!1,flags:"",global:!1,hasIndices:!1,lazyCompileLength:1/0,target:"auto",verbose:!1,...e,rules:{allowOrphanBackrefs:!1,asciiWordBoundaries:!1,captureGroup:!1,recursionLimit:20,singleline:!1,...e.rules}};return n.target==="auto"&&(n.target=M.flagGroups?"ES2025":M.unicodeSets?"ES2024":"ES2018"),n}var Tt="[	-\r ]",Wt=new Set([C(304),C(305)]),P=h`[\p{L}\p{M}\p{N}\p{Pc}]`;function mn(e){if(Wt.has(e))return[e];const n=new Set,t=e.toLowerCase(),r=t.toUpperCase(),a=jt.get(t),o=zt.get(t),s=Vt.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 Ne=new Map(`C Other
 Cc Control cntrl
 Cf Format
 Cn Unassigned
@@ -1359,1285 +135,7 @@ Uppercase Upper
 Variation_Selector VS
 White_Space space
 XID_Continue XIDC
-XID_Start XIDS`.split(/\s/).map((e) => [he(e), e])
-), Bt = /* @__PURE__ */ new Map([
-  ["s", b(383)],
-  // s, ſ
-  [b(383), "s"]
-  // ſ, s
-]), Vt = /* @__PURE__ */ new Map([
-  [b(223), b(7838)],
-  // ß, ẞ
-  [b(107), b(8490)],
-  // k, K (Kelvin)
-  [b(229), b(8491)],
-  // å, Å (Angstrom)
-  [b(969), b(8486)]
-  // ω, Ω (Ohm)
-]), zt = new Map([
-  U(453),
-  U(456),
-  U(459),
-  U(498),
-  ...Ee(8072, 8079),
-  ...Ee(8088, 8095),
-  ...Ee(8104, 8111),
-  U(8124),
-  U(8140),
-  U(8188)
-]), Wt = /* @__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 Ht(e, r) {
-  const t = [];
-  for (let n = e; n <= r; n++)
-    t.push(n);
-  return t;
-}
-function U(e) {
-  const r = b(e);
-  return [r.toLowerCase(), r];
-}
-function Ee(e, r) {
-  return Ht(e, r).map((t) => U(t));
-}
-var Er = /* @__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 jt(e, r) {
-  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",
-    ...r
-  };
-  $r(e);
-  const n = {
-    accuracy: t.accuracy,
-    asciiWordBoundaries: t.asciiWordBoundaries,
-    avoidSubclass: t.avoidSubclass,
-    flagDirectivesByAlt: /* @__PURE__ */ new Map(),
-    jsGroupNameMap: /* @__PURE__ */ new Map(),
-    minTargetEs2024: Ne(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
-  };
-  oe(e, Xt, n);
-  const s = {
-    dotAll: e.flags.dotAll,
-    ignoreCase: e.flags.ignoreCase
-  }, o = {
-    currentFlags: s,
-    prevFlags: null,
-    globalFlags: s,
-    groupOriginByCopy: /* @__PURE__ */ new Map(),
-    groupsByName: /* @__PURE__ */ new Map(),
-    multiplexCapturesToLeftByRef: /* @__PURE__ */ new Map(),
-    openRefs: /* @__PURE__ */ new Map(),
-    reffedNodesByReferencer: /* @__PURE__ */ new Map(),
-    subroutineRefMap: n.subroutineRefMap
-  };
-  oe(e, Zt, o);
-  const a = {
-    groupsByName: o.groupsByName,
-    highestOrphanBackref: 0,
-    numCapturesToLeft: 0,
-    reffedNodesByReferencer: o.reffedNodesByReferencer
-  };
-  return oe(e, Qt, a), e._originMap = o.groupOriginByCopy, e._strategy = n.strategy, e;
-}
-var Xt = {
-  AbsenceFunction({ node: e, parent: r, replaceWith: t }) {
-    const { body: n, kind: s } = e;
-    if (s === "repeater") {
-      const o = N();
-      o.body[0].body.push(
-        // Insert own alts as `body`
-        H({ negate: !0, body: n }),
-        ee("Any")
-      );
-      const a = N();
-      a.body[0].body.push(
-        hr("greedy", 0, 1 / 0, o)
-      ), t(C(a, r), { traverse: !0 });
-    } else
-      throw new Error('Unsupported absence function "(?~|"');
-  },
-  Alternative: {
-    enter({ node: e, parent: r, key: t }, { flagDirectivesByAlt: n }) {
-      const s = e.body.filter((o) => o.kind === "flags");
-      for (let o = t + 1; o < r.body.length; o++) {
-        const a = r.body[o];
-        ae(n, a, []).push(...s);
-      }
-    },
-    exit({ node: e }, { flagDirectivesByAlt: r }) {
-      var t;
-      if ((t = r.get(e)) != null && t.length) {
-        const n = Ir(r.get(e));
-        if (n) {
-          const s = N({ flags: n });
-          s.body[0].body = e.body, e.body = [C(s, e)];
-        }
-      }
-    }
-  },
-  Assertion({ node: e, parent: r, key: t, container: n, root: s, remove: o, replaceWith: a }, i) {
-    const { kind: u, negate: c } = e, { asciiWordBoundaries: p, avoidSubclass: l, supportedGNodes: f, wordIsAscii: g } = i;
-    if (u === "text_segment_boundary")
-      throw new Error(`Unsupported text segment boundary "\\${c ? "Y" : "y"}"`);
-    if (u === "line_end")
-      a(C(H({ body: [
-        Q({ body: [Se("string_end")] }),
-        Q({ body: [ge(10)] })
-        // `\n`
-      ] }), r));
-    else if (u === "line_start")
-      a(C(G(h`(?<=\A|\n(?!\z))`, { skipLookbehindValidation: !0 }), r));
-    else if (u === "search_start")
-      if (f.has(e))
-        s.flags.sticky = !0, o();
-      else {
-        const d = n[t - 1];
-        if (d && rn(d))
-          a(C(H({ negate: !0 }), r));
-        else {
-          if (l)
-            throw new Error(h`Uses "\G" in a way that requires a subclass`);
-          a(O(Se("string_start"), r)), i.strategy = "clip_search";
-        }
-      }
-    else if (!(u === "string_end" || u === "string_start")) if (u === "string_end_newline")
-      a(C(G(h`(?=\n?\z)`), r));
-    else if (u === "word_boundary") {
-      if (!g && !p) {
-        const d = `(?:(?<=${F})(?!${F})|(?<!${F})(?=${F}))`, w = `(?:(?<=${F})(?=${F})|(?<!${F})(?!${F}))`;
-        a(C(G(c ? w : d), r));
-      }
-    } else
-      throw new Error(`Unexpected assertion kind "${u}"`);
-  },
-  Backreference({ node: e }, { jsGroupNameMap: r }) {
-    let { ref: t } = e;
-    typeof t == "string" && !Ae(t) && (t = $e(t, r), e.ref = t);
-  },
-  CapturingGroup({ node: e }, { jsGroupNameMap: r, subroutineRefMap: t }) {
-    let { name: n } = e;
-    n && !Ae(n) && (n = $e(n, r), e.name = n), t.set(e.number, e), n && t.set(n, e);
-  },
-  CharacterClassRange({ node: e, parent: r, replaceWith: t }) {
-    if (r.kind === "intersection") {
-      const n = fe({ body: [e] });
-      t(C(n, r), { traverse: !0 });
-    }
-  },
-  CharacterSet({ node: e, parent: r, replaceWith: t }, { accuracy: n, minTargetEs2024: s, digitIsAscii: o, spaceIsAscii: a, wordIsAscii: i }) {
-    const { kind: u, negate: c, value: p } = e;
-    if (o && (u === "digit" || p === "digit")) {
-      t(O(_e("digit", { negate: c }), r));
-      return;
-    }
-    if (a && (u === "space" || p === "space")) {
-      t(C(Ie(G(Dt), c), r));
-      return;
-    }
-    if (i && (u === "word" || p === "word")) {
-      t(O(_e("word", { negate: c }), r));
-      return;
-    }
-    if (u === "any")
-      t(O(ee("Any"), r));
-    else if (u === "digit")
-      t(O(ee("Nd", { negate: c }), r));
-    else if (u !== "dot") if (u === "text_segment") {
-      if (n === "strict")
-        throw new Error(h`Use of "\X" requires non-strict accuracy`);
-      const l = "\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?", f = h`\p{RI}{2}|${l}(?:\u200D${l})*`;
-      t(C(G(
-        // Close approximation of an extended grapheme cluster; see <unicode.org/reports/tr29/>
-        h`(?>\r\n|${s ? h`\p{RGI_Emoji}` : f}|\P{M}\p{M}*)`,
-        // Allow JS property `RGI_Emoji` through
-        { skipPropertyNameValidation: !0 }
-      ), r));
-    } else if (u === "hex")
-      t(O(ee("AHex", { negate: c }), r));
-    else if (u === "newline")
-      t(C(G(c ? `[^
-]` : `(?>\r
+XID_Start XIDS`.split(/\s/).map(e=>[pe(e),e])),zt=new Map([["s",C(383)],[C(383),"s"]]),Vt=new Map([[C(223),C(7838)],[C(107),C(8490)],[C(229),C(8491)],[C(969),C(8486)]]),jt=new Map([U(453),U(456),U(459),U(498),...Le(8072,8079),...Le(8088,8095),...Le(8104,8111),U(8124),U(8140),U(8188)]),Ht=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}]`],["space",h`\p{space}`],["upper",h`\p{Upper}`],["word",h`[\p{Alpha}\p{M}\p{Nd}\p{Pc}]`],["xdigit",h`\p{AHex}`]]);function Xt(e,n){const t=[];for(let r=e;r<=n;r++)t.push(r);return t}function U(e){const n=C(e);return[n.toLowerCase(),n]}function Le(e,n){return Xt(e,n).map(t=>U(t))}var bn=new Set(["Lower","Lowercase","Upper","Uppercase","Ll","Lowercase_Letter","Lt","Titlecase_Letter","Lu","Uppercase_Letter"]);function Zt(e,n){const t={accuracy:"default",asciiWordBoundaries:!1,avoidSubclass:!1,bestEffortTarget:"ES2025",...n};Cn(e);const r={accuracy:t.accuracy,asciiWordBoundaries:t.asciiWordBoundaries,avoidSubclass:t.avoidSubclass,flagDirectivesByAlt:new Map,jsGroupNameMap:new Map,minTargetEs2024:Me(t.bestEffortTarget,"ES2024"),passedLookbehind:!1,strategy:null,subroutineRefMap:new Map,supportedGNodes:new Set,digitIsAscii:e.flags.digitIsAscii,spaceIsAscii:e.flags.spaceIsAscii,wordIsAscii:e.flags.wordIsAscii};oe(e,Qt,r);const a={dotAll:e.flags.dotAll,ignoreCase:e.flags.ignoreCase},o={currentFlags:a,prevFlags:null,globalFlags:a,groupOriginByCopy:new Map,groupsByName:new Map,multiplexCapturesToLeftByRef:new Map,openRefs:new Map,reffedNodesByReferencer:new Map,subroutineRefMap:r.subroutineRefMap};oe(e,qt,o);const s={groupsByName:o.groupsByName,highestOrphanBackref:0,numCapturesToLeft:0,reffedNodesByReferencer:o.reffedNodesByReferencer};return oe(e,Jt,s),e._originMap=o.groupOriginByCopy,e._strategy=r.strategy,e}var Qt={AbsenceFunction({node:e,parent:n,replaceWith:t}){const{body:r,kind:a}=e;if(a==="repeater"){const o=_();o.body[0].body.push(W({negate:!0,body:r}),J("Any"));const s=_();s.body[0].body.push(en("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];ae(r,s,[]).push(...a)}},exit({node:e},{flagDirectivesByAlt:n}){var t;if((t=n.get(e))!=null&&t.length){const r=En(n.get(e));if(r){const a=_({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:c}=e,{asciiWordBoundaries:p,avoidSubclass:l,supportedGNodes:d,wordIsAscii:g}=i;if(u==="text_segment_boundary")throw new Error(`Unsupported text segment boundary "\\${c?"Y":"y"}"`);if(u==="line_end")s(b(W({body:[T({body:[Ee("string_end")]}),T({body:[ce(10)]})]}),n));else if(u==="line_start")s(b(F(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&&rr(f))s(b(W({negate:!0}),n));else{if(l)throw new Error(h`Uses "\G" in a way that requires a subclass`);s(B(Ee("string_start"),n)),i.strategy="clip_search"}}else if(!(u==="string_end"||u==="string_start"))if(u==="string_end_newline")s(b(F(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(F(c?w:f),n))}}else throw new Error(`Unexpected assertion kind "${u}"`)},Backreference({node:e},{jsGroupNameMap:n}){let{ref:t}=e;typeof t=="string"&&!Pe(t)&&(t=Re(t,n),e.ref=t)},CapturingGroup({node:e},{jsGroupNameMap:n,subroutineRefMap:t}){let{name:r}=e;r&&!Pe(r)&&(r=Re(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=le({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:c,value:p}=e;if(o&&(u==="digit"||p==="digit")){t(B($e("digit",{negate:c}),n));return}if(s&&(u==="space"||p==="space")){t(b(Fe(F(Tt),c),n));return}if(i&&(u==="word"||p==="word")){t(B($e("word",{negate:c}),n));return}if(u==="any")t(B(J("Any"),n));else if(u==="digit")t(B(J("Nd",{negate:c}),n));else if(u!=="dot")if(u==="text_segment"){if(r==="strict")throw new Error(h`Use of "\X" requires non-strict accuracy`);const l="\\p{Emoji}(?:\\p{EMod}|\\uFE0F\\u20E3?|[\\x{E0020}-\\x{E007E}]+\\x{E007F})?",d=h`\p{RI}{2}|${l}(?:\u200D${l})*`;t(b(F(h`(?>\r\n|${a?h`\p{RGI_Emoji}`:d}|\P{M}\p{M}*)`,{skipPropertyNameValidation:!0}),n))}else if(u==="hex")t(B(J("AHex",{negate:c}),n));else if(u==="newline")t(b(F(c?`[^
+]`:`(?>\r
 ?|[
-\v\f…\u2028\u2029])`), r));
-    else if (u === "posix")
-      if (!s && (p === "graph" || p === "print")) {
-        if (n === "strict")
-          throw new Error(`POSIX class "${p}" requires min target ES2024 or non-strict accuracy`);
-        let l = {
-          graph: "!-~",
-          print: " -~"
-        }[p];
-        c && (l = `\0-${b(l.codePointAt(0) - 1)}${b(l.codePointAt(2) + 1)}-􏿿`), t(C(G(`[${l}]`), r));
-      } else
-        t(C(Ie(G(Wt.get(p)), c), r));
-    else if (u === "property")
-      Re.has(he(p)) || (e.key = "sc");
-    else if (u === "space")
-      t(O(ee("space", { negate: c }), r));
-    else if (u === "word")
-      t(C(Ie(G(F), c), r));
-    else
-      throw new Error(`Unexpected character set kind "${u}"`);
-  },
-  Directive({ node: e, parent: r, root: t, remove: n, replaceWith: s, removeAllPrevSiblings: o, removeAllNextSiblings: a }) {
-    const { kind: i, flags: u } = e;
-    if (i === "flags")
-      if (!u.enable && !u.disable)
-        n();
-      else {
-        const c = N({ flags: u });
-        c.body[0].body = a(), s(C(c, r), { traverse: !0 });
-      }
-    else if (i === "keep") {
-      const c = t.body[0], l = t.body.length === 1 && // Not emulatable if within a `CapturingGroup`
-      fr(c, { type: "Group" }) && c.body[0].body.length === 1 ? c.body[0] : t;
-      if (r.parent !== l || l.body.length > 1)
-        throw new Error(h`Uses "\K" in a way that's unsupported`);
-      const f = H({ behind: !0 });
-      f.body[0].body = o(), s(C(f, r));
-    } else
-      throw new Error(`Unexpected directive kind "${i}"`);
-  },
-  Flags({ node: e, parent: r }) {
-    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)
-    }), r.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: r, disable: t } = e.flags;
-    r != null && r.extended && delete r.extended, t != null && t.extended && delete t.extended, r != null && r.dotAll && (t != null && t.dotAll) && delete r.dotAll, r != null && r.ignoreCase && (t != null && t.ignoreCase) && delete r.ignoreCase, r && !Object.keys(r).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 }, r) {
-    const { kind: t } = e;
-    t === "lookbehind" && (r.passedLookbehind = !0);
-  },
-  NamedCallout({ node: e, parent: r, replaceWith: t }) {
-    const { kind: n } = e;
-    if (n === "fail")
-      t(C(H({ negate: !0 }), r));
-    else
-      throw new Error(`Unsupported named callout "(*${n.toUpperCase()}"`);
-  },
-  Quantifier({ node: e }) {
-    if (e.body.type === "Quantifier") {
-      const r = N();
-      r.body[0].body.push(e.body), e.body = C(r, e);
-    }
-  },
-  Regex: {
-    enter({ node: e }, { supportedGNodes: r }) {
-      const t = [];
-      let n = !1, s = !1;
-      for (const o of e.body)
-        if (o.body.length === 1 && o.body[0].kind === "search_start")
-          o.body.pop();
-        else {
-          const a = vr(o.body);
-          a ? (n = !0, Array.isArray(a) ? t.push(...a) : t.push(a)) : s = !0;
-        }
-      n && !s && t.forEach((o) => r.add(o));
-    },
-    exit(e, { accuracy: r, passedLookbehind: t, strategy: n }) {
-      if (r === "strict" && t && n)
-        throw new Error(h`Uses "\G" in a way that requires non-strict accuracy`);
-    }
-  },
-  Subroutine({ node: e }, { jsGroupNameMap: r }) {
-    let { ref: t } = e;
-    typeof t == "string" && !Ae(t) && (t = $e(t, r), e.ref = t);
-  }
-}, Zt = {
-  Backreference({ node: e }, { multiplexCapturesToLeftByRef: r, reffedNodesByReferencer: t }) {
-    const { orphan: n, ref: s } = e;
-    n || t.set(e, [...r.get(s).map(({ node: o }) => o)]);
-  },
-  CapturingGroup: {
-    enter({
-      node: e,
-      parent: r,
-      replaceWith: t,
-      skip: n
-    }, {
-      groupOriginByCopy: s,
-      groupsByName: o,
-      multiplexCapturesToLeftByRef: a,
-      openRefs: i,
-      reffedNodesByReferencer: u
-    }) {
-      const c = s.get(e);
-      if (c && i.has(e.number)) {
-        const l = O(tr(e.number), r);
-        u.set(l, i.get(e.number)), t(l);
-        return;
-      }
-      i.set(e.number, e), a.set(e.number, []), e.name && ae(a, e.name, []);
-      const p = a.get(e.name ?? e.number);
-      for (let l = 0; l < p.length; l++) {
-        const f = p[l];
-        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
-          c === f.node || c && c === f.origin || // This group is not from subroutine expansion, and it comes after a subroutine expansion
-          // group that refers to this group
-          e === f.origin
-        ) {
-          p.splice(l, 1);
-          break;
-        }
-      }
-      if (a.get(e.number).push({ node: e, origin: c }), e.name && a.get(e.name).push({ node: e, origin: c }), e.name) {
-        const l = ae(o, e.name, /* @__PURE__ */ new Map());
-        let f = !1;
-        if (c)
-          f = !0;
-        else
-          for (const g of l.values())
-            if (!g.hasDuplicateNameToRemove) {
-              f = !0;
-              break;
-            }
-        o.get(e.name).set(e, { node: e, hasDuplicateNameToRemove: f });
-      }
-    },
-    exit({ node: e }, { openRefs: r }) {
-      r.get(e.number) === e && r.delete(e.number);
-    }
-  },
-  Group: {
-    enter({ node: e }, r) {
-      r.prevFlags = r.currentFlags, e.flags && (r.currentFlags = de(r.currentFlags, e.flags));
-    },
-    exit(e, r) {
-      r.currentFlags = r.prevFlags;
-    }
-  },
-  Subroutine({ node: e, parent: r, replaceWith: t }, n) {
-    const { isRecursive: s, ref: o } = e;
-    if (s) {
-      let p = r;
-      for (; (p = p.parent) && !(p.type === "CapturingGroup" && (p.name === o || p.number === o)); )
-        ;
-      n.reffedNodesByReferencer.set(e, p);
-      return;
-    }
-    const a = n.subroutineRefMap.get(o), i = o === 0, u = i ? tr(0) : (
-      // The reffed group might itself contain subroutines, which are expanded during sub-traversal
-      Ar(a, n.groupOriginByCopy, null)
-    );
-    let c = u;
-    if (!i) {
-      const p = Ir(Kt(
-        a,
-        (f) => f.type === "Group" && !!f.flags
-      )), l = p ? de(n.globalFlags, p) : n.globalFlags;
-      qt(l, n.currentFlags) || (c = N({
-        flags: Yt(l)
-      }), c.body[0].body.push(u));
-    }
-    t(C(c, r), { traverse: !i });
-  }
-}, Qt = {
-  Backreference({ node: e, parent: r, replaceWith: t }, n) {
-    if (e.orphan) {
-      n.highestOrphanBackref = Math.max(n.highestOrphanBackref, e.ref);
-      return;
-    }
-    const o = n.reffedNodesByReferencer.get(e).filter((a) => Jt(a, e));
-    if (!o.length)
-      t(C(H({ negate: !0 }), r));
-    else if (o.length > 1) {
-      const a = N({
-        atomic: !0,
-        body: o.reverse().map((i) => Q({
-          body: [ve(i.number)]
-        }))
-      });
-      t(C(a, r));
-    } else
-      e.ref = o[0].number;
-  },
-  CapturingGroup({ node: e }, r) {
-    e.number = ++r.numCapturesToLeft, e.name && r.groupsByName.get(e.name).get(e).hasDuplicateNameToRemove && delete e.name;
-  },
-  Regex: {
-    exit({ node: e }, r) {
-      const t = Math.max(r.highestOrphanBackref - r.numCapturesToLeft, 0);
-      for (let n = 0; n < t; n++) {
-        const s = gr();
-        e.body.at(-1).body.push(s);
-      }
-    }
-  },
-  Subroutine({ node: e }, r) {
-    !e.isRecursive || e.ref === 0 || (e.ref = r.reffedNodesByReferencer.get(e).number);
-  }
-};
-function $r(e) {
-  oe(e, {
-    "*"({ node: r, parent: t }) {
-      r.parent = t;
-    }
-  });
-}
-function qt(e, r) {
-  return e.dotAll === r.dotAll && e.ignoreCase === r.ignoreCase;
-}
-function Jt(e, r) {
-  let t = r;
-  do {
-    if (t.type === "Regex")
-      return !1;
-    if (t.type === "Alternative")
-      continue;
-    if (t === e)
-      return !1;
-    const n = Sr(t.parent);
-    for (const s of n) {
-      if (s === t)
-        break;
-      if (s === e || _r(s, e))
-        return !0;
-    }
-  } while (t = t.parent);
-  throw new Error("Unexpected path");
-}
-function Ar(e, r, t, n) {
-  const s = Array.isArray(e) ? [] : {};
-  for (const [o, a] of Object.entries(e))
-    o === "parent" ? s.parent = Array.isArray(t) ? n : t : a && typeof a == "object" ? s[o] = Ar(a, r, s, t) : (o === "type" && a === "CapturingGroup" && r.set(s, r.get(e) ?? e), s[o] = a);
-  return s;
-}
-function tr(e) {
-  const r = wr(e);
-  return r.isRecursive = !0, r;
-}
-function Kt(e, r) {
-  const t = [];
-  for (; e = e.parent; )
-    (!r || r(e)) && t.push(e);
-  return t;
-}
-function $e(e, r) {
-  if (r.has(e))
-    return r.get(e);
-  const t = `$${r.size}_${e.replace(/^[^$_\p{IDS}]|[^$\u200C\u200D\p{IDC}]/ug, "_")}`;
-  return r.set(e, t), t;
-}
-function Ir(e) {
-  const r = ["dotAll", "ignoreCase"], t = { enable: {}, disable: {} };
-  return e.forEach(({ flags: n }) => {
-    r.forEach((s) => {
-      var o, a;
-      (o = n.enable) != null && o[s] && (delete t.disable[s], t.enable[s] = !0), (a = n.disable) != null && a[s] && (t.disable[s] = !0);
-    });
-  }), Object.keys(t.enable).length || delete t.enable, Object.keys(t.disable).length || delete t.disable, t.enable || t.disable ? t : null;
-}
-function Yt({ dotAll: e, ignoreCase: r }) {
-  const t = {};
-  return (e || r) && (t.enable = {}, e && (t.enable.dotAll = !0), r && (t.enable.ignoreCase = !0)), (!e || !r) && (t.disable = {}, !e && (t.disable.dotAll = !0), !r && (t.disable.ignoreCase = !0)), t;
-}
-function Sr(e) {
-  if (!e)
-    throw new Error("Node expected");
-  const { body: r } = e;
-  return Array.isArray(r) ? r : r ? [r] : null;
-}
-function vr(e) {
-  const r = e.find((t) => t.kind === "search_start" || tn(t, { negate: !1 }) || !en(t));
-  if (!r)
-    return null;
-  if (r.kind === "search_start")
-    return r;
-  if (r.type === "LookaroundAssertion")
-    return r.body[0].body[0];
-  if (r.type === "CapturingGroup" || r.type === "Group") {
-    const t = [];
-    for (const n of r.body) {
-      const s = vr(n.body);
-      if (!s)
-        return null;
-      Array.isArray(s) ? t.push(...s) : t.push(s);
-    }
-    return t;
-  }
-  return null;
-}
-function _r(e, r) {
-  const t = Sr(e) ?? [];
-  for (const n of t)
-    if (n === r || _r(n, r))
-      return !0;
-  return !1;
-}
-function en({ type: e }) {
-  return e === "Assertion" || e === "Directive" || e === "LookaroundAssertion";
-}
-function rn(e) {
-  const r = [
-    "Character",
-    "CharacterClass",
-    "CharacterSet"
-  ];
-  return r.includes(e.type) || e.type === "Quantifier" && e.min && r.includes(e.body.type);
-}
-function tn(e, r) {
-  const t = {
-    negate: null,
-    ...r
-  };
-  return e.type === "LookaroundAssertion" && (t.negate === null || e.negate === t.negate) && e.body.length === 1 && fr(e.body[0], {
-    type: "Assertion",
-    kind: "search_start"
-  });
-}
-function Ae(e) {
-  return /^[$_\p{IDS}][$\u200C\u200D\p{IDC}]*$/u.test(e);
-}
-function G(e, r) {
-  const n = dr(e, {
-    ...r,
-    // Providing a custom set of Unicode property names avoids converting some JS Unicode
-    // properties (ex: `\p{Alpha}`) to Onig POSIX classes
-    unicodePropertyMap: Re
-  }).body;
-  return n.length > 1 || n[0].body.length > 1 ? N({ body: n }) : n[0].body[0];
-}
-function Ie(e, r) {
-  return e.negate = r, e;
-}
-function O(e, r) {
-  return e.parent = r, e;
-}
-function C(e, r) {
-  return $r(e), e.parent = r, e;
-}
-function nn(e, r) {
-  const t = xr(r), n = Ne(t.target, "ES2024"), s = Ne(t.target, "ES2025"), o = t.rules.recursionLimit;
-  if (!Number.isInteger(o) || o < 2 || o > 20)
-    throw new Error("Invalid recursionLimit; use 2-20");
-  let a = null, i = null;
-  if (!s) {
-    const g = [e.flags.ignoreCase];
-    oe(e, sn, {
-      getCurrentModI: () => g.at(-1),
-      popModI() {
-        g.pop();
-      },
-      pushModI(d) {
-        g.push(d);
-      },
-      setHasCasedChar() {
-        g.at(-1) ? a = !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 || a) && !i)
-  };
-  let c = e;
-  const p = {
-    accuracy: t.accuracy,
-    appliedGlobalFlags: u,
-    captureMap: /* @__PURE__ */ new Map(),
-    currentFlags: {
-      dotAll: e.flags.dotAll,
-      ignoreCase: e.flags.ignoreCase
-    },
-    inCharClass: !1,
-    lastNode: c,
-    originMap: e._originMap,
-    recursionLimit: o,
-    useAppliedIgnoreCase: !!(!s && a && i),
-    useFlagMods: s,
-    useFlagV: n,
-    verbose: t.verbose
-  };
-  function l(g) {
-    return p.lastNode = c, c = g, Ut(on[g.type], `Unexpected node type "${g.type}"`)(g, p, l);
-  }
-  const f = {
-    pattern: e.body.map(l).join("|"),
-    // Could reset `lastNode` at this point via `lastNode = ast`, but it isn't needed by flags
-    flags: l(e.flags),
-    options: { ...e.options }
-  };
-  return n || (delete f.options.force.v, f.options.disable.v = !0, f.options.unicodeSetsPlugin = null), f._captureTransfers = /* @__PURE__ */ new Map(), f._hiddenCaptures = [], p.captureMap.forEach((g, d) => {
-    g.hidden && f._hiddenCaptures.push(d), g.transferTo && ae(f._captureTransfers, g.transferTo, []).push(d);
-  }), f;
-}
-var sn = {
-  "*": {
-    enter({ node: e }, r) {
-      if (sr(e)) {
-        const t = r.getCurrentModI();
-        r.pushModI(
-          e.flags ? de({ ignoreCase: t }, e.flags).ignoreCase : t
-        );
-      }
-    },
-    exit({ node: e }, r) {
-      sr(e) && r.popModI();
-    }
-  },
-  Backreference(e, r) {
-    r.setHasCasedChar();
-  },
-  Character({ node: e }, r) {
-    Ue(b(e.value)) && r.setHasCasedChar();
-  },
-  CharacterClassRange({ node: e, skip: r }, t) {
-    r(), Mr(e, { firstOnly: !0 }).length && t.setHasCasedChar();
-  },
-  CharacterSet({ node: e }, r) {
-    e.kind === "property" && Er.has(e.value) && r.setHasCasedChar();
-  }
-}, on = {
-  /**
-  @param {AlternativeNode} node
-  */
-  Alternative({ body: e }, r, t) {
-    return e.map(t).join("");
-  },
-  /**
-  @param {AssertionNode} node
-  */
-  Assertion({ kind: e, negate: r }) {
-    if (e === "string_end")
-      return "$";
-    if (e === "string_start")
-      return "^";
-    if (e === "word_boundary")
-      return r ? h`\B` : h`\b`;
-    throw new Error(`Unexpected assertion kind "${e}"`);
-  },
-  /**
-  @param {BackreferenceNode} node
-  */
-  Backreference({ ref: e }, r) {
-    if (typeof e != "number")
-      throw new Error("Unexpected named backref in transformed AST");
-    if (!r.useFlagMods && r.accuracy === "strict" && r.currentFlags.ignoreCase && !r.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, r, t) {
-    const { body: n, name: s, number: o } = e, a = { ignoreCase: r.currentFlags.ignoreCase }, i = r.originMap.get(e);
-    return i && (a.hidden = !0, o > i.number && (a.transferTo = i.number)), r.captureMap.set(o, a), `(${s ? `?<${s}>` : ""}${n.map(t).join("|")})`;
-  },
-  /**
-  @param {CharacterNode} node
-  */
-  Character({ value: e }, r) {
-    const t = b(e), n = K(e, {
-      escDigit: r.lastNode.type === "Backreference",
-      inCharClass: r.inCharClass,
-      useFlagV: r.useFlagV
-    });
-    if (n !== t)
-      return n;
-    if (r.useAppliedIgnoreCase && r.currentFlags.ignoreCase && Ue(t)) {
-      const s = kr(t);
-      return r.inCharClass ? s.join("") : s.length > 1 ? `[${s.join("")}]` : s[0];
-    }
-    return t;
-  },
-  /**
-  @param {CharacterClassNode} node
-  */
-  CharacterClass(e, r, t) {
-    const { kind: n, negate: s, parent: o } = e;
-    let { body: a } = e;
-    if (n === "intersection" && !r.useFlagV)
-      throw new Error("Use of character class intersection requires min target ES2024");
-    L.bugFlagVLiteralHyphenIsRange && r.useFlagV && a.some(or) && (a = [ge(45), ...a.filter((c) => !or(c))]);
-    const i = () => `[${s ? "^" : ""}${a.map(t).join(n === "intersection" ? "&&" : "")}]`;
-    if (!r.inCharClass) {
-      if (
-        // Already established `kind !== 'intersection'` if `!state.useFlagV`; don't check again
-        (!r.useFlagV || L.bugNestedClassIgnoresNegation) && !s
-      ) {
-        const p = a.filter(
-          (l) => l.type === "CharacterClass" && l.kind === "union" && l.negate
-        );
-        if (p.length) {
-          const l = N(), f = l.body[0];
-          return l.parent = o, f.parent = l, a = a.filter((g) => !p.includes(g)), e.body = a, a.length ? (e.parent = f, f.body.push(e)) : l.body.pop(), p.forEach((g) => {
-            const d = Q({ body: [g] });
-            g.parent = d, d.parent = l, l.body.push(d);
-          }), t(l);
-        }
-      }
-      r.inCharClass = !0;
-      const c = i();
-      return r.inCharClass = !1, c;
-    }
-    const u = a[0];
-    if (
-      // Already established that the parent is a char class via `inCharClass`; don't check again
-      n === "union" && !s && u && // Allows many nested classes to work with `target` ES2018 which doesn't support nesting
-      ((!r.useFlagV || !r.verbose) && o.kind === "union" && !(L.bugFlagVLiteralHyphenIsRange && r.useFlagV) || !r.verbose && o.kind === "intersection" && // JS doesn't allow intersection with union or ranges
-      a.length === 1 && u.type !== "CharacterClassRange")
-    )
-      return a.map(t).join("");
-    if (!r.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, r) {
-    const t = e.min.value, n = e.max.value, s = {
-      escDigit: !1,
-      inCharClass: !0,
-      useFlagV: r.useFlagV
-    }, o = K(t, s), a = K(n, s), i = /* @__PURE__ */ new Set();
-    if (r.useAppliedIgnoreCase && r.currentFlags.ignoreCase) {
-      const u = Mr(e);
-      pn(u).forEach((p) => {
-        i.add(
-          Array.isArray(p) ? `${K(p[0], s)}-${K(p[1], s)}` : K(p, s)
-        );
-      });
-    }
-    return `${o}-${a}${[...i].join("")}`;
-  },
-  /**
-  @param {CharacterSetNode} node
-  */
-  CharacterSet({ kind: e, negate: r, value: t, key: n }, s) {
-    if (e === "dot")
-      return s.currentFlags.dotAll ? s.appliedGlobalFlags.dotAll || s.useFlagMods ? "." : "[^]" : (
-        // Onig's only line break char is line feed, unlike JS
-        h`[^\n]`
-      );
-    if (e === "digit")
-      return r ? h`\D` : h`\d`;
-    if (e === "property") {
-      if (s.useAppliedIgnoreCase && s.currentFlags.ignoreCase && Er.has(t))
-        throw new Error(`Unicode property "${t}" can't be case-insensitive when other chars have specific case`);
-      return `${r ? h`\P` : h`\p`}{${n ? `${n}=` : ""}${t}}`;
-    }
-    if (e === "word")
-      return r ? h`\W` : h`\w`;
-    throw new Error(`Unexpected character set kind "${e}"`);
-  },
-  /**
-  @param {FlagsNode} node
-  */
-  Flags(e, r) {
-    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' : '') +
-      (r.appliedGlobalFlags.ignoreCase ? "i" : "") + (e.dotAll ? "s" : "") + (e.sticky ? "y" : "")
-    );
-  },
-  /**
-  @param {GroupNode} node
-  */
-  Group({ atomic: e, body: r, flags: t, parent: n }, s, o) {
-    const a = s.currentFlags;
-    t && (s.currentFlags = de(a, t));
-    const i = r.map(o).join("|"), u = !s.verbose && r.length === 1 && // Single alt
-    n.type !== "Quantifier" && !e && (!s.useFlagMods || !t) ? i : `(?${fn(e, t, s.useFlagMods)}${i})`;
-    return s.currentFlags = a, u;
-  },
-  /**
-  @param {LookaroundAssertionNode} node
-  */
-  LookaroundAssertion({ body: e, kind: r, negate: t }, n, s) {
-    return `(?${`${r === "lookahead" ? "" : "<"}${t ? "!" : "="}`}${e.map(s).join("|")})`;
-  },
-  /**
-  @param {QuantifierNode} node
-  */
-  Quantifier(e, r, t) {
-    return t(e.body) + dn(e);
-  },
-  /**
-  @param {SubroutineNode & {isRecursive: true}} node
-  */
-  Subroutine({ isRecursive: e, ref: r }, t) {
-    if (!e)
-      throw new Error("Unexpected non-recursive subroutine in transformed AST");
-    const n = t.recursionLimit;
-    return r === 0 ? `(?R=${n})` : h`\g<${r}&R=${n}>`;
-  }
-}, an = /* @__PURE__ */ new Set([
-  "$",
-  "(",
-  ")",
-  "*",
-  "+",
-  ".",
-  "?",
-  "[",
-  "\\",
-  "]",
-  "^",
-  "{",
-  "|",
-  "}"
-]), un = /* @__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
-  "["
-]), cn = /* @__PURE__ */ new Set([
-  "(",
-  ")",
-  "-",
-  "/",
-  "[",
-  "\\",
-  "]",
-  "^",
-  "{",
-  "|",
-  "}",
-  // Double punctuators; also includes already-listed `-` and `^`
-  "!",
-  "#",
-  "$",
-  "%",
-  "&",
-  "*",
-  "+",
-  ",",
-  ".",
-  ":",
-  ";",
-  "<",
-  "=",
-  ">",
-  "?",
-  "@",
-  "`",
-  "~"
-]), nr = /* @__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
-]), ln = new RegExp("^\\p{Cased}$", "u");
-function Ue(e) {
-  return ln.test(e);
-}
-function Mr(e, r) {
-  const t = !!(r != null && r.firstOnly), n = e.min.value, s = e.max.value, o = [];
-  if (n < 65 && (s === 65535 || s >= 131071) || n === 65536 && s >= 131071)
-    return o;
-  for (let a = n; a <= s; a++) {
-    const i = b(a);
-    if (!Ue(i))
-      continue;
-    const u = kr(i).filter((c) => {
-      const p = c.codePointAt(0);
-      return p < n || p > s;
-    });
-    if (u.length && (o.push(...u), t))
-      break;
-  }
-  return o;
-}
-function K(e, { escDigit: r, inCharClass: t, useFlagV: n }) {
-  if (nr.has(e))
-    return nr.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
-    r && gn(e)
-  )
-    return e > 255 ? `\\u{${e.toString(16).toUpperCase()}}` : `\\x${e.toString(16).toUpperCase().padStart(2, "0")}`;
-  const s = t ? n ? cn : un : an, o = b(e);
-  return (s.has(o) ? "\\" : "") + o;
-}
-function pn(e) {
-  const r = e.map((s) => s.codePointAt(0)).sort((s, o) => s - o), t = [];
-  let n = null;
-  for (let s = 0; s < r.length; s++)
-    r[s + 1] === r[s] + 1 ? n ?? (n = r[s]) : n === null ? t.push(r[s]) : (t.push([n, r[s]]), n = null);
-  return t;
-}
-function fn(e, r, t) {
-  if (e)
-    return ">";
-  let n = "";
-  if (r && t) {
-    const { enable: s, disable: o } = r;
-    n = (s != null && s.ignoreCase ? "i" : "") + (s != null && s.dotAll ? "s" : "") + (o ? "-" : "") + (o != null && o.ignoreCase ? "i" : "") + (o != null && o.dotAll ? "s" : "");
-  }
-  return `${n}:`;
-}
-function dn({ kind: e, max: r, min: t }) {
-  let n;
-  return !t && r === 1 ? n = "?" : !t && r === 1 / 0 ? n = "*" : t === 1 && r === 1 / 0 ? n = "+" : t === r ? n = `{${t}}` : n = `{${t},${r === 1 / 0 ? "" : r}}`, n + {
-    greedy: "",
-    lazy: "?",
-    possessive: "+"
-  }[e];
-}
-function sr({ type: e }) {
-  return e === "CapturingGroup" || e === "Group" || e === "LookaroundAssertion";
-}
-function gn(e) {
-  return e > 47 && e < 58;
-}
-function or({ type: e, value: r }) {
-  return e === "Character" && r === 45;
-}
-var D, P, X, T, Z, ie, Le, B, hn = (B = class extends RegExp {
-  /**
-  @overload
-  @param {string} pattern
-  @param {string} [flags]
-  @param {EmulatedRegExpOptions} [options]
-  */
-  /**
-  @overload
-  @param {EmulatedRegExp} pattern
-  @param {string} [flags]
-  */
-  constructor(t, n, s) {
-    var r = (...Sn) => (super(...Sn), z(this, ie), /**
-    @type {Map<number, {
-      hidden?: true;
-      transferTo?: number;
-    }>}
-    */
-    z(this, D, /* @__PURE__ */ new Map()), /**
-    @type {RegExp | EmulatedRegExp | null}
-    */
-    z(this, P, null), /**
-    @type {string}
-    */
-    z(this, X), /**
-    @type {Map<number, string>?}
-    */
-    z(this, T, null), /**
-    @type {string?}
-    */
-    z(this, Z, null), /**
-    Can be used to serialize the instance.
-    @type {EmulatedRegExpOptions}
-    */
-    se(this, "rawOptions", {}), this);
-    const o = !!(s != null && s.lazyCompile);
-    if (t instanceof RegExp) {
-      if (s)
-        throw new Error("Cannot provide options when copying a regexp");
-      const a = t;
-      r(a, n), M(this, X, a.source), a instanceof B && (M(this, D, E(a, D)), M(this, T, E(a, T)), M(this, Z, E(a, Z)), this.rawOptions = a.rawOptions);
-    } else {
-      const a = {
-        hiddenCaptures: [],
-        strategy: null,
-        transfers: [],
-        ...s
-      };
-      r(o ? "" : t, n), M(this, X, t), M(this, D, mn(a.hiddenCaptures, a.transfers)), M(this, Z, a.strategy), this.rawOptions = s ?? {};
-    }
-    o || M(this, P, this);
-  }
-  // Override the getter with one that works with lazy-compiled regexes
-  get source() {
-    return E(this, X) || "(?:)";
-  }
-  /**
-  Called internally by all String/RegExp methods that use regexes.
-  @override
-  @param {string} str
-  @returns {RegExpExecArray?}
-  */
-  exec(t) {
-    if (!E(this, P)) {
-      const { lazyCompile: o, ...a } = this.rawOptions;
-      M(this, P, new B(E(this, X), this.flags, a));
-    }
-    const n = this.global || this.sticky, s = this.lastIndex;
-    if (E(this, Z) === "clip_search" && n && s) {
-      this.lastIndex = 0;
-      const o = Ce(this, ie, Le).call(this, t.slice(s));
-      return o && (wn(o, s, t, this.hasIndices), this.lastIndex += s), o;
-    }
-    return Ce(this, ie, Le).call(this, t);
-  }
-}, D = new WeakMap(), P = new WeakMap(), X = new WeakMap(), T = new WeakMap(), Z = new WeakMap(), ie = new WeakSet(), /**
-Adds support for hidden and transfer captures.
-@param {string} str
-@returns
-*/
-Le = function(t) {
-  E(this, P).lastIndex = this.lastIndex;
-  const n = Te(B.prototype, this, "exec").call(E(this, P), t);
-  if (this.lastIndex = E(this, P).lastIndex, !n || !E(this, D).size)
-    return n;
-  const s = [...n];
-  n.length = 1;
-  let o;
-  this.hasIndices && (o = [...n.indices], n.indices.length = 1);
-  const a = [0];
-  for (let i = 1; i < s.length; i++) {
-    const { hidden: u, transferTo: c } = E(this, D).get(i) ?? {};
-    if (u ? a.push(null) : (a.push(n.length), n.push(s[i]), this.hasIndices && n.indices.push(o[i])), c && s[i] !== void 0) {
-      const p = a[c];
-      if (!p)
-        throw new Error(`Invalid capture transfer to "${p}"`);
-      if (n[p] = s[i], this.hasIndices && (n.indices[p] = o[i]), n.groups) {
-        E(this, T) || M(this, T, yn(this.source));
-        const l = E(this, T).get(c);
-        l && (n.groups[l] = s[i], this.hasIndices && (n.indices.groups[l] = o[i]));
-      }
-    }
-  }
-  return n;
-}, B);
-function wn(e, r, t, n) {
-  if (e.index += r, e.input = t, n) {
-    const s = e.indices;
-    for (let a = 0; a < s.length; a++) {
-      const i = s[a];
-      i && (s[a] = [i[0] + r, i[1] + r]);
-    }
-    const o = s.groups;
-    o && Object.keys(o).forEach((a) => {
-      const i = o[a];
-      i && (o[a] = [i[0] + r, i[1] + r]);
-    });
-  }
-}
-function mn(e, r) {
-  const t = /* @__PURE__ */ new Map();
-  for (const n of e)
-    t.set(n, {
-      hidden: !0
-    });
-  for (const [n, s] of r)
-    for (const o of s)
-      ae(t, o, {}).transferTo = n;
-  return t;
-}
-function yn(e) {
-  const r = /(?<capture>\((?:\?<(?![=!])(?<name>[^>]+)>|(?!\?)))|\\?./gsu, t = /* @__PURE__ */ new Map();
-  let n = 0, s = 0, o;
-  for (; o = r.exec(e); ) {
-    const { 0: a, groups: { capture: i, name: u } } = o;
-    a === "[" ? n++ : n ? a === "]" && n-- : i && (s++, u && t.set(s, u));
-  }
-  return t;
-}
-function Cn(e, r) {
-  const t = bn(e, r);
-  return t.options ? new hn(t.pattern, t.flags, t.options) : new RegExp(t.pattern, t.flags);
-}
-function bn(e, r) {
-  const t = xr(r), n = dr(e, {
-    flags: t.flags,
-    normalizeUnknownPropertyNames: !0,
-    rules: {
-      captureGroup: t.rules.captureGroup,
-      singleline: t.rules.singleline
-    },
-    skipBackrefValidation: t.rules.allowOrphanBackrefs,
-    unicodePropertyMap: Re
-  }), s = jt(n, {
-    accuracy: t.accuracy,
-    asciiWordBoundaries: t.rules.asciiWordBoundaries,
-    avoidSubclass: t.avoidSubclass,
-    bestEffortTarget: t.target
-  }), o = nn(s, t), a = Pt(o.pattern, {
-    captureTransfers: o._captureTransfers,
-    hiddenCaptures: o._hiddenCaptures,
-    mode: "external"
-  }), i = Ft(a.pattern), u = Lt(i.pattern, {
-    captureTransfers: a.captureTransfers,
-    hiddenCaptures: a.hiddenCaptures
-  }), c = {
-    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((d, w) => d - w), l = Array.from(u.captureTransfers), f = s._strategy, g = c.pattern.length >= t.lazyCompileLength;
-    (p.length || l.length || f || g) && (c.options = {
-      ...p.length && { hiddenCaptures: p },
-      ...l.length && { transfers: l },
-      ...f && { strategy: f },
-      ...g && { lazyCompile: g }
-    });
-  }
-  return c;
-}
-function xn(e, r) {
-  return Cn(e, {
-    global: !0,
-    hasIndices: !0,
-    lazyCompileLength: 3e3,
-    rules: {
-      allowOrphanBackrefs: !0,
-      asciiWordBoundaries: !0,
-      captureGroup: !0,
-      recursionLimit: 5,
-      singleline: !0
-    },
-    ...r
-  });
-}
-function En(e = {}) {
-  const r = {
-    target: "auto",
-    cache: /* @__PURE__ */ new Map(),
-    ...e
-  };
-  return r.regexConstructor || (r.regexConstructor = (t) => xn(t, { target: r.target })), {
-    createScanner(t) {
-      return new ar(t, r);
-    },
-    createString(t) {
-      return { content: t };
-    }
-  };
-}
-function $n() {
-  const e = {
-    cache: /* @__PURE__ */ new Map(),
-    regexConstructor: () => {
-      throw new Error("JavaScriptRawEngine: only support precompiled grammar");
-    }
-  };
-  return {
-    createScanner(r) {
-      return new ar(r, e);
-    },
-    createString(r) {
-      return { content: r };
-    }
-  };
-}
-export {
-  ar as JavaScriptScanner,
-  $n as createJavaScriptRawEngine,
-  En as createJavaScriptRegexEngine,
-  xn as defaultJavaScriptRegexConstructor
-};
+\v\f\x85\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 l={graph:"!-~",print:" -~"}[p];c&&(l=`\0-${C(l.codePointAt(0)-1)}${C(l.codePointAt(2)+1)}-\u{10FFFF}`),t(b(F(`[${l}]`),n))}else t(b(Fe(F(Ht.get(p)),c),n));else if(u==="property")Ne.has(pe(p))||(e.key="sc");else if(u==="space")t(B(J("space",{negate:c}),n));else if(u==="word")t(b(Fe(F(P),c),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 c=_({flags:u});c.body[0].body=s(),a(b(c,n),{traverse:!0})}else if(i==="keep"){const c=t.body[0],p=t.body.length===1&&Je(c,{type:"Group"})&&c.body[0].body.length===1?c.body[0]:t;if(n.parent!==p||p.body.length>1)throw new Error(h`Uses "\K" in a way that's unsupported`);const l=W({behind:!0});l.body[0].body=o(),a(b(l,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","extended","posixIsAscii","spaceIsAscii","wordIsAscii","textSegmentMode"].forEach(t=>delete e[t]),Object.assign(e,{global:!1,hasIndices:!1,multiline:!1,sticky:e.sticky??!1}),n.options={disable:{x:!0,n:!0},force:{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(W({negate:!0}),n));else throw new Error(`Unsupported named callout "(*${r.toUpperCase()}"`)},Quantifier({node:e}){if(e.body.type==="Quantifier"){const 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=$n(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"&&!Pe(t)&&(t=Re(t,n),e.ref=t)}},qt={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 c=a.get(e);if(c&&i.has(e.number)){const l=B(kn(e.number),n);u.set(l,i.get(e.number)),t(l);return}i.set(e.number,e),s.set(e.number,[]),e.name&&ae(s,e.name,[]);const p=s.get(e.name??e.number);for(let l=0;l<p.length;l++){const d=p[l];if(c===d.node||c&&c===d.origin||e===d.origin){p.splice(l,1);break}}if(s.get(e.number).push({node:e,origin:c}),e.name&&s.get(e.name).push({node:e,origin:c}),e.name){const l=ae(o,e.name,new Map);let d=!1;if(c)d=!0;else for(const g of l.values())if(!g.hasDuplicateNameToRemove){d=!0;break}o.get(e.name).set(e,{node:e,hasDuplicateNameToRemove:d})}},exit({node:e},{openRefs:n}){n.get(e.number)===e&&n.delete(e.number)}},Group:{enter({node:e},n){n.prevFlags=n.currentFlags,e.flags&&(n.currentFlags=we(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?kn(0):xn(s,r.groupOriginByCopy,null);let c=u;if(!i){const p=En(er(s,d=>d.type==="Group"&&!!d.flags)),l=p?we(r.globalFlags,p):r.globalFlags;Kt(l,r.currentFlags)||(c=_({flags:nr(l)}),c.body[0].body.push(u))}t(b(c,n),{traverse:!i})}},Jt={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=>Yt(o,e));if(!a.length)t(b(W({negate:!0}),n));else if(a.length>1){const o=_({atomic:!0,body:a.reverse().map(s=>T({body:[ve(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=Ye();e.body.at(-1).body.push(a)}}},Subroutine({node:e},n){!e.isRecursive||e.ref===0||(e.ref=n.reffedNodesByReferencer.get(e).number)}};function Cn(e){oe(e,{"*"({node:n,parent:t}){n.parent=t}})}function Kt(e,n){return e.dotAll===n.dotAll&&e.ignoreCase===n.ignoreCase}function Yt(e,n){let t=n;do{if(t.type==="Regex")return!1;if(t.type==="Alternative")continue;if(t===e)return!1;const r=vn(t.parent);for(const a of r){if(a===t)break;if(a===e||An(a,e))return!0}}while(t=t.parent);throw new Error("Unexpected path")}function xn(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]=xn(s,n,a,t):(o==="type"&&s==="CapturingGroup"&&n.set(a,n.get(e)??e),a[o]=s);return a}function kn(e){const n=nn(e);return n.isRecursive=!0,n}function er(e,n){const t=[];for(;e=e.parent;)(!n||n(e))&&t.push(e);return t}function Re(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 En(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 nr({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 vn(e){if(!e)throw new Error("Node expected");const{body:n}=e;return Array.isArray(n)?n:n?[n]:null}function $n(e){const n=e.find(t=>t.kind==="search_start"||or(t,{negate:!1})||!tr(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=$n(r.body);if(!a)return null;Array.isArray(a)?t.push(...a):t.push(a)}return t}return null}function An(e,n){const t=vn(e)??[];for(const r of t)if(r===n||An(r,n))return!0;return!1}function tr({type:e}){return e==="Assertion"||e==="Directive"||e==="LookaroundAssertion"}function rr(e){const n=["Character","CharacterClass","CharacterSet"];return n.includes(e.type)||e.type==="Quantifier"&&e.min&&n.includes(e.body.type)}function or(e,n){const t={negate:null,...n};return e.type==="LookaroundAssertion"&&(t.negate===null||e.negate===t.negate)&&e.body.length===1&&Je(e.body[0],{type:"Assertion",kind:"search_start"})}function Pe(e){return/^[$_\p{IDS}][$\u200C\u200D\p{IDC}]*$/u.test(e)}function F(e,n){const t=Ke(e,{...n,unicodePropertyMap:Ne}).body;return t.length>1||t[0].body.length>1?_({body:t}):t[0].body[0]}function Fe(e,n){return e.negate=n,e}function B(e,n){return e.parent=n,e}function b(e,n){return Cn(e),e.parent=n,e}function ar(e,n){const t=yn(n),r=Me(t.target,"ES2024"),a=Me(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];oe(e,sr,{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,ignoreCase:!!((e.flags.ignoreCase||s)&&!i)};let c=e;const p={accuracy:t.accuracy,appliedGlobalFlags:u,captureMap:new Map,currentFlags:{dotAll:e.flags.dotAll,ignoreCase:e.flags.ignoreCase},inCharClass:!1,lastNode:c,originMap:e._originMap,recursionLimit:o,useAppliedIgnoreCase:!!(!a&&s&&i),useFlagMods:a,useFlagV:r,verbose:t.verbose};function l(g){return p.lastNode=c,c=g,Dt(ir[g.type],`Unexpected node type "${g.type}"`)(g,p,l)}const d={pattern:e.body.map(l).join("|"),flags:l(e.flags),options:{...e.options}};return r||(delete d.options.force.v,d.options.disable.v=!0,d.options.unicodeSetsPlugin=null),d._captureTransfers=new Map,d._hiddenCaptures=[],p.captureMap.forEach((g,f)=>{g.hidden&&d._hiddenCaptures.push(f),g.transferTo&&ae(d._captureTransfers,g.transferTo,[]).push(f)}),d}var sr={"*":{enter({node:e},n){if(_n(e)){const t=n.getCurrentModI();n.pushModI(e.flags?we({ignoreCase:t},e.flags).ignoreCase:t)}},exit({node:e},n){_n(e)&&n.popModI()}},Backreference(e,n){n.setHasCasedChar()},Character({node:e},n){Ue(C(e.value))&&n.setHasCasedChar()},CharacterClassRange({node:e,skip:n},t){n(),Sn(e,{firstOnly:!0}).length&&t.setHasCasedChar()},CharacterSet({node:e},n){e.kind==="property"&&bn.has(e.value)&&n.setHasCasedChar()}},ir={Alternative({body:e},n,t){return e.map(t).join("")},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}"`)},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},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("|")})`},Character({value:e},n){const t=C(e),r=Y(e,{escDigit:n.lastNode.type==="Backreference",inCharClass:n.inCharClass,useFlagV:n.useFlagV});if(r!==t)return r;if(n.useAppliedIgnoreCase&&n.currentFlags.ignoreCase&&Ue(t)){const a=mn(t);return n.inCharClass?a.join(""):a.length>1?`[${a.join("")}]`:a[0]}return t},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");M.bugFlagVLiteralHyphenIsRange&&n.useFlagV&&s.some(Mn)&&(s=[ce(45),...s.filter(c=>!Mn(c))]);const i=()=>`[${a?"^":""}${s.map(t).join(r==="intersection"?"&&":"")}]`;if(!n.inCharClass){if((!n.useFlagV||M.bugNestedClassIgnoresNegation)&&!a){const p=s.filter(l=>l.type==="CharacterClass"&&l.kind==="union"&&l.negate);if(p.length){const l=_(),d=l.body[0];return l.parent=o,d.parent=l,s=s.filter(g=>!p.includes(g)),e.body=s,s.length?(e.parent=d,d.body.push(e)):l.body.pop(),p.forEach(g=>{const f=T({body:[g]});g.parent=f,f.parent=l,l.body.push(f)}),t(l)}}n.inCharClass=!0;const c=i();return n.inCharClass=!1,c}const u=s[0];if(r==="union"&&!a&&u&&((!n.useFlagV||!n.verbose)&&o.kind==="union"&&!(M.bugFlagVLiteralHyphenIsRange&&n.useFlagV)||!n.verbose&&o.kind==="intersection"&&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()},CharacterClassRange(e,n){const t=e.min.value,r=e.max.value,a={escDigit:!1,inCharClass:!0,useFlagV:n.useFlagV},o=Y(t,a),s=Y(r,a),i=new Set;if(n.useAppliedIgnoreCase&&n.currentFlags.ignoreCase){const u=Sn(e);dr(u).forEach(c=>{i.add(Array.isArray(c)?`${Y(c[0],a)}-${Y(c[1],a)}`:Y(c,a))})}return`${o}-${s}${[...i].join("")}`},CharacterSet({kind:e,negate:n,value:t,key:r},a){if(e==="dot")return a.currentFlags.dotAll?a.appliedGlobalFlags.dotAll||a.useFlagMods?".":"[^]":h`[^\n]`;if(e==="digit")return n?h`\D`:h`\d`;if(e==="property"){if(a.useAppliedIgnoreCase&&a.currentFlags.ignoreCase&&bn.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}"`)},Flags(e,n){return(n.appliedGlobalFlags.ignoreCase?"i":"")+(e.dotAll?"s":"")+(e.sticky?"y":"")},Group({atomic:e,body:n,flags:t,parent:r},a,o){const s=a.currentFlags;t&&(a.currentFlags=we(s,t));const i=n.map(o).join("|"),u=!a.verbose&&n.length===1&&r.type!=="Quantifier"&&!e&&(!a.useFlagMods||!t)?i:`(?${fr(e,t,a.useFlagMods)}${i})`;return a.currentFlags=s,u},LookaroundAssertion({body:e,kind:n,negate:t},r,a){return`(?${`${n==="lookahead"?"":"<"}${t?"!":"="}`}${e.map(a).join("|")})`},Quantifier(e,n,t){return t(e.body)+gr(e)},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}>`}},ur=new Set(["$","(",")","*","+",".","?","[","\\","]","^","{","|","}"]),cr=new Set(["-","\\","]","^","["]),lr=new Set(["(",")","-","/","[","\\","]","^","{","|","}","!","#","$","%","&","*","+",",",".",":",";","<","=",">","?","@","`","~"]),In=new Map([[9,h`\t`],[10,h`\n`],[11,h`\v`],[12,h`\f`],[13,h`\r`],[8232,h`\u2028`],[8233,h`\u2029`],[65279,h`\uFEFF`]]),pr=new RegExp("^\\p{Cased}$","u");function Ue(e){return pr.test(e)}function Sn(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(!Ue(i))continue;const u=mn(i).filter(c=>{const p=c.codePointAt(0);return p<r||p>a});if(u.length&&(o.push(...u),t))break}return o}function Y(e,{escDigit:n,inCharClass:t,useFlagV:r}){if(In.has(e))return In.get(e);if(e<32||e>126&&e<160||e>262143||n&&hr(e))return e>255?`\\u{${e.toString(16).toUpperCase()}}`:`\\x${e.toString(16).toUpperCase().padStart(2,"0")}`;const a=t?r?lr:cr:ur,o=C(e);return(a.has(o)?"\\":"")+o}function dr(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 fr(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 gr({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 _n({type:e}){return e==="CapturingGroup"||e==="Group"||e==="LookaroundAssertion"}function hr(e){return e>47&&e<58}function Mn({type:e,value:n}){return e==="Character"&&n===45}var V,G,ee,j,ne,ye,Be,se,wr=(se=class extends RegExp{constructor(e,n,t){var r=(...o)=>(super(...o),X(this,ye),X(this,V,new Map),X(this,G,null),X(this,ee),X(this,j,null),X(this,ne,null),ie(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,ee,o.source),o instanceof se&&(L(this,V,E(o,V)),L(this,j,E(o,j)),L(this,ne,E(o,ne)),this.rawOptions=o.rawOptions)}else{const o={hiddenCaptures:[],strategy:null,transfers:[],...t};r(a?"":e,n),L(this,ee,e),L(this,V,mr(o.hiddenCaptures,o.transfers)),L(this,ne,o.strategy),this.rawOptions=t??{}}a||L(this,G,this)}get source(){return E(this,ee)||"(?:)"}exec(e){if(!E(this,G)){const{lazyCompile:r,...a}=this.rawOptions;L(this,G,new se(E(this,ee),this.flags,a))}const n=this.global||this.sticky,t=this.lastIndex;if(E(this,ne)==="clip_search"&&n&&t){this.lastIndex=0;const r=Oe(this,ye,Be).call(this,e.slice(t));return r&&(yr(r,t,e,this.hasIndices),this.lastIndex+=t),r}return Oe(this,ye,Be).call(this,e)}},V=new WeakMap,G=new WeakMap,ee=new WeakMap,j=new WeakMap,ne=new WeakMap,ye=new WeakSet,Be=function(e){E(this,G).lastIndex=this.lastIndex;const n=Gn(se.prototype,this,"exec").call(E(this,G),e);if(this.lastIndex=E(this,G).lastIndex,!n||!E(this,V).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,V).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,br(this.source));const c=E(this,j).get(i);c&&(n.groups[c]=t[o],this.hasIndices&&(n.indices.groups[c]=r[o]))}}}return n},se);function yr(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=new Map;for(const r of e)t.set(r,{hidden:!0});for(const[r,a]of n)for(const o of a)ae(t,o,{}).transferTo=r;return t}function br(e){const n=/(?<capture>\((?:\?<(?![=!])(?<name>[^>]+)>|(?!\?)))|\\?./gsu,t=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 Cr(e,n){const t=xr(e,n);return t.options?new wr(t.pattern,t.flags,t.options):new RegExp(t.pattern,t.flags)}function xr(e,n){const t=yn(n),r=Ke(e,{flags:t.flags,normalizeUnknownPropertyNames:!0,rules:{captureGroup:t.rules.captureGroup,singleline:t.rules.singleline},skipBackrefValidation:t.rules.allowOrphanBackrefs,unicodePropertyMap:Ne}),a=Zt(r,{accuracy:t.accuracy,asciiWordBoundaries:t.rules.asciiWordBoundaries,avoidSubclass:t.avoidSubclass,bestEffortTarget:t.target}),o=ar(a,t),s=Bt(o.pattern,{captureTransfers:o._captureTransfers,hiddenCaptures:o._hiddenCaptures,mode:"external"}),i=Ft(s.pattern),u=Pt(i.pattern,{captureTransfers:s.captureTransfers,hiddenCaptures:s.hiddenCaptures}),c={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),l=Array.from(u.captureTransfers),d=a._strategy,g=c.pattern.length>=t.lazyCompileLength;(p.length||l.length||d||g)&&(c.options={...p.length&&{hiddenCaptures:p},...l.length&&{transfers:l},...d&&{strategy:d},...g&&{lazyCompile:g}})}return c}function Nn(e,n){return Cr(e,{global:!0,hasIndices:!0,lazyCompileLength:3e3,rules:{allowOrphanBackrefs:!0,asciiWordBoundaries:!0,captureGroup:!0,recursionLimit:5,singleline:!0},...n})}function kr(e={}){const n={target:"auto",cache:new Map,...e};return n.regexConstructor||(n.regexConstructor=t=>Nn(t,{target:n.target})),{createScanner(t){return new be(t,n)},createString(t){return{content:t}}}}function Er(){const e={cache:new Map,regexConstructor:()=>{throw new Error("JavaScriptRawEngine: only support precompiled grammar")}};return{createScanner(n){return new be(n,e)},createString(n){return{content:n}}}}export{be as JavaScriptScanner,Er as createJavaScriptRawEngine,kr as createJavaScriptRegexEngine,Nn as defaultJavaScriptRegexConstructor};