@cloudflare/kumo 1.11.0 → 1.12.0

package/dist/{engine-compile-D-n7xALU.js → chunks/engine-javascript-hi1kqifa6nkcridk.js}

@@ -1,5 +1,5 @@
 "use client";
-var wr = class {
+var We = class {
   regexps;
   constructor(e, r = {}) {
     this.patterns = e, this.options = r;
@@ -75,9 +75,9 @@ function j(e, r) {
   if (e == null) throw new Error(r ?? "Value expected");
   return e;
 }
-const We = x`\[\^?`, He = `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}`}`, be = /[?*+][?+]?|\{(?:\d+(?:,\d*)?|,\d+)\}\??/, K = new RegExp(x`
+const He = x`\[\^?`, je = `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}`}`, be = /[?*+][?+]?|\{(?:\d+(?:,\d*)?|,\d+)\}\??/, K = new RegExp(x`
   \\ (?:
-    ${He}
+    ${je}
     | [gk]<[^>]*>?
     | [gk]'[^']*'?
     | .
@@ -95,15 +95,15 @@ const We = x`\[\^?`, He = `c.? | C(?:-.?)?|${x`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x
     | \*[^\)]*\)?
   )?
   | (?:${be.source})+
-  | ${We}
+  | ${He}
   | .
 `.replace(/\s+/g, ""), "gsu"), oe = new RegExp(x`
   \\ (?:
-    ${He}
+    ${je}
     | .
   )
   | \[:(?:\^?\p{Alpha}+|\^):\]
-  | ${We}
+  | ${He}
   | &&
   | .
 `.replace(/\s+/g, ""), "gsu");
@@ -148,13 +148,13 @@ function Cr(e, r, t, n) {
     }
     if (/^\\k[<']/.test(t)) {
       if (!/^\\k(?:<[^>]+>|'[^']+')$/.test(t)) throw new Error(`Invalid group name "${t}"`);
-      return { token: Xe(t) };
+      return { token: Ze(t) };
     }
-    if (s === "K") return { token: Ze("keep", t) };
+    if (s === "K") return { token: Qe("keep", t) };
     if (s === "N" || s === "R") return { token: U("newline", t, { negate: s === "N" }) };
     if (s === "O") return { token: U("any", t) };
     if (s === "X") return { token: U("text_segment", t) };
-    const o = je(t, { inCharClass: !1 });
+    const o = Xe(t, { inCharClass: !1 });
     return Array.isArray(o) ? { tokens: o } : { token: o };
   }
   if (a === "(") {
@@ -205,7 +205,7 @@ function br(e, r, t) {
     if (o[0] === "[" && o[1] !== ":") a++, n.push(Ie(o[1] === "^", o));
     else if (o === "]") {
       if (n.at(-1).type === "CharacterClassOpen") n.push(N(93, o));
-      else if (a--, n.push($r(o)), !a) break;
+      else if (a--, n.push(Er(o)), !a) break;
     } else {
       const i = xr(o);
       Array.isArray(i) ? n.push(...i) : n.push(i);
@@ -214,15 +214,15 @@ function br(e, r, t) {
   return { tokens: n, lastIndex: oe.lastIndex || e.length };
 }
 function xr(e) {
-  if (e[0] === "\\") return je(e, { inCharClass: !0 });
+  if (e[0] === "\\") return Xe(e, { inCharClass: !0 });
   if (e[0] === "[") {
     const r = /\[:(?<negate>\^?)(?<name>[a-z]+):\]/.exec(e);
     if (!r || !Ce.has(r.groups.name)) throw new Error(`Invalid POSIX class "${e}"`);
     return U("posix", e, { value: r.groups.name, negate: !!r.groups.negate });
   }
-  return e === "-" ? Er(e) : e === "&&" ? Ar(e) : N(H(e), e);
+  return e === "-" ? $r(e) : e === "&&" ? Ar(e) : N(H(e), e);
 }
-function je(e, { inCharClass: r }) {
+function Xe(e, { inCharClass: r }) {
   const t = e[1];
   if (t === "c" || t === "C") return Lr(e);
   if ("dDhHsSwW".includes(t)) return Pr(e);
@@ -254,16 +254,16 @@ function kr(e) {
 function Ae(e, r) {
   return { type: "Assertion", kind: e, raw: r };
 }
-function Xe(e) {
+function Ze(e) {
   return { type: "Backreference", raw: e };
 }
 function N(e, r) {
   return { type: "Character", value: e, raw: r };
 }
-function $r(e) {
+function Er(e) {
   return { type: "CharacterClassClose", raw: e };
 }
-function Er(e) {
+function $r(e) {
   return { type: "CharacterClassHyphen", raw: e };
 }
 function Ar(e) {
@@ -275,7 +275,7 @@ function Ie(e, r) {
 function U(e, r, t = {}) {
   return { type: "CharacterSet", kind: e, ...t, raw: r };
 }
-function Ze(e, r, t = {}) {
+function Qe(e, r, t = {}) {
   return e === "keep" ? { type: "Directive", kind: e, raw: r } : { type: "Directive", kind: e, flags: j(t.flags), raw: r };
 }
 function Ir(e, r) {
@@ -306,7 +306,7 @@ function Fr(e, r) {
   let { on: t, off: n } = /^\(\?(?<on>[imx]*)(?:-(?<off>[-imx]*))?/.exec(e).groups;
   n ??= "";
   const a = (r.getCurrentModX() || t.includes("x")) && !n.includes("x"), s = _e(t), o = _e(n), i = {};
-  if (s && (i.enable = s), o && (i.disable = o), e.endsWith(")")) return r.replaceCurrentModX(a), Ze("flags", e, { flags: i });
+  if (s && (i.enable = s), o && (i.disable = o), e.endsWith(")")) return r.replaceCurrentModX(a), Qe("flags", e, { flags: i });
   if (e.endsWith(":")) return r.pushModX(a), r.numOpenGroups++, z("group", e, { ...(s || o) && { flags: i } });
   throw new Error(`Unexpected flag modifier "${e}"`);
 }
@@ -395,7 +395,7 @@ function Or(e) {
 }
 function Dr(e, r) {
   const { raw: t, inCharClass: n } = e, a = t.slice(1);
-  if (!n && (a !== "0" && a.length === 1 || a[0] !== "0" && +a <= r)) return [Xe(t)];
+  if (!n && (a !== "0" && a.length === 1 || a[0] !== "0" && +a <= r)) return [Ze(t)];
   const s = [], o = a.match(/^[0-7]+|\d/g);
   for (let i = 0; i < o.length; i++) {
     const u = o[i];
@@ -426,7 +426,7 @@ function Br(e) {
   }
   return r;
 }
-function Qe(e, r) {
+function qe(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];
@@ -436,7 +436,7 @@ function Tr(e) {
   return Vr.has(e.type);
 }
 const Vr = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
-function qe(e, r = {}) {
+function Je(e, r = {}) {
   const t = { flags: "", normalizeUnknownPropertyNames: !1, skipBackrefValidation: !1, skipLookbehindValidation: !1, skipPropertyNameValidation: !1, unicodePropertyMap: null, ...r, rules: { captureGroup: !1, singleline: !1, ...r.rules } }, n = yr(e, { flags: t.flags, rules: { captureGroup: t.rules.captureGroup, singleline: t.rules.singleline } }), a = (f, g) => {
     const d = n.tokens[s.nextIndex];
     switch (s.parent = f, s.nextIndex++, d.type) {
@@ -558,7 +558,7 @@ function Zr(e, r, t) {
 function Qr({ kind: e, min: r, max: t }, n) {
   const a = n.parent, s = a.body.at(-1);
   if (!s || !Tr(s)) throw new Error("Quantifier requires a repeatable token");
-  const o = Ke(e, r, t, s);
+  const o = Ye(e, r, t, s);
   return a.body.pop(), o;
 }
 function qr({ raw: e }, r) {
@@ -569,14 +569,14 @@ function qr({ raw: e }, r) {
     const i = +s.groups.num, u = t.length;
     if (r.hasNumberedRef = !0, a = { "": i, "+": u + i, "-": u + 1 - i }[s.groups.sign], a < 1) throw new Error("Invalid subroutine number");
   } else a === "0" && (a = 0);
-  const o = Ye(a);
+  const o = er(a);
   return n.push(o), o;
 }
 function Jr(e, r) {
   return { type: "AbsenceFunction", kind: e, body: q(r?.body) };
 }
 function O(e) {
-  return { type: "Alternative", body: er(e?.body) };
+  return { type: "Alternative", body: rr(e?.body) };
 }
 function de(e, r) {
   const t = { type: "Assertion", kind: e };
@@ -586,7 +586,7 @@ function ge(e, r) {
   const t = !!r?.orphan;
   return { type: "Backreference", ref: e, ...t && { orphan: t } };
 }
-function Je(e, r) {
+function Ke(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: q(r?.body) };
@@ -602,7 +602,7 @@ function ne(e, r) {
 }
 function re(e) {
   const r = { kind: "union", negate: !1, ...e };
-  return { type: "CharacterClass", kind: r.kind, negate: r.negate, body: er(e?.body) };
+  return { type: "CharacterClass", kind: r.kind, negate: r.negate, body: rr(e?.body) };
 }
 function Kr(e, r) {
   if (r.value < e.value) throw new Error("Character class range out of order");
@@ -637,14 +637,14 @@ function tt(e, r) {
   if (!Ce.has(e)) throw new Error(`Invalid POSIX class "${e}"`);
   return { type: "CharacterSet", kind: "posix", value: e, negate: t };
 }
-function Ke(e, r, t, n) {
+function Ye(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 nt(e, r) {
   return { type: "Regex", body: q(r?.body), flags: e };
 }
-function Ye(e) {
+function er(e) {
   return { type: "Subroutine", ref: e };
 }
 function W(e, r) {
@@ -663,7 +663,7 @@ function st({ flags: e, kind: r, name: t, negate: n, number: a }) {
     case "atomic":
       return v({ atomic: !0 });
     case "capturing":
-      return Je(a, { name: t });
+      return Ke(a, { name: t });
     case "group":
       return v({ flags: e });
     case "lookahead":
@@ -678,7 +678,7 @@ function q(e) {
   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 er(e) {
+function rr(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;
@@ -720,12 +720,12 @@ function Z(e, r, t = null) {
     }, removeAllPrevSiblings() {
       const y = T(i) + c;
       return c -= y, Y(u).splice(0, Math.max(0, y));
-    }, replaceWith(y, $ = {}) {
-      const E = !!$.traverse;
-      u ? u[Math.max(0, T(i) + c)] = y : j(o, "Can't replace root node")[i] = y, E && a(y, o, i, u), p = !0;
-    }, replaceWithMultiple(y, $ = {}) {
-      const E = !!$.traverse;
-      if (Y(u).splice(Math.max(0, T(i) + c), 1, ...y), c += y.length - 1, E) {
+    }, replaceWith(y, E = {}) {
+      const $ = !!E.traverse;
+      u ? u[Math.max(0, T(i) + c)] = y : j(o, "Can't replace root node")[i] = y, $ && a(y, o, i, u), p = !0;
+    }, replaceWithMultiple(y, E = {}) {
+      const $ = !!E.traverse;
+      if (Y(u).splice(Math.max(0, T(i) + c), 1, ...y), c += y.length - 1, $) {
         let k = 0;
         for (let A = 0; A < y.length; A++) k += a(y[A], o, T(i) + A + k, u);
       }
@@ -807,7 +807,7 @@ function xe(e, r, t, n) {
   }
   return i;
 }
-function rr(e, r, t, n) {
+function tr(e, r, t, n) {
   xe(e, r, t, n);
 }
 function lt(e, r, t = 0, n) {
@@ -862,16 +862,16 @@ function ft(e, r) {
     l = !1;
     let f = 0, g = 0, d = !1, w;
     for (Ge.lastIndex = Number.isNaN(p) ? 0 : p + s.length; w = Ge.exec(e); ) {
-      const { 0: m, index: y, groups: { capturingStart: $, noncapturingStart: E } } = w;
+      const { 0: m, index: y, groups: { capturingStart: E, noncapturingStart: $ } } = w;
       if (m === "[")
         f++;
       else if (f)
         m === "]" && f--;
       else if (m === a && !d)
         p = y, d = !0;
-      else if (d && E)
+      else if (d && $)
         g++;
-      else if ($)
+      else if (E)
         d ? g++ : (u++, o.push(u + c));
       else if (m === ")" && d) {
         if (!g) {
@@ -911,7 +911,7 @@ function ft(e, r) {
     hiddenCaptures: t
   };
 }
-const tr = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, ie = new RegExp(String.raw`
+const nr = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, ie = new RegExp(String.raw`
 \\(?: \d+
   | c[A-Za-z]
   | [gk]<[^>]+>
@@ -924,11 +924,11 @@ const tr = String.raw`(?:[?*+]|\{\d+(?:,\d*)?\})`, ie = new RegExp(String.raw`
   | [A-Za-z\-]+:
   | \(DEFINE\)
   ))?
-| (?<qBase>${tr})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
+| (?<qBase>${nr})(?<qMod>[?+]?)(?<invalidQ>[?*+\{]?)
 | \\?.
 `.replace(/\s+/g, ""), "gsu");
 function dt(e) {
-  if (!new RegExp(`${tr}\\+`).test(e))
+  if (!new RegExp(`${nr}\\+`).test(e))
     return {
       pattern: e
     };
@@ -965,7 +965,7 @@ function dt(e) {
     pattern: e
   };
 }
-const I = String.raw, gt = I`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, we = I`\(\?R=(?<rDepth>[^\)]+)\)|${gt}`, ae = I`\(\?<(?![=!])(?<captureName>[^>]+)>`, nr = I`${ae}|(?<unnamed>\()(?!\?)`, P = new RegExp(I`${ae}|${we}|\(\?|\\?.`, "gsu"), ue = "Cannot use multiple overlapping recursions";
+const I = String.raw, gt = I`\\g<(?<gRNameOrNum>[^>&]+)&R=(?<gRDepth>[^>]+)>`, we = I`\(\?R=(?<rDepth>[^\)]+)\)|${gt}`, ae = I`\(\?<(?![=!])(?<captureName>[^>]+)>`, sr = I`${ae}|(?<unnamed>\()(?!\?)`, P = new RegExp(I`${ae}|${we}|\(\?|\\?.`, "gsu"), ue = "Cannot use multiple overlapping recursions";
 function ht(e, r) {
   const { hiddenCaptures: t, mode: n } = {
     hiddenCaptures: [],
@@ -998,13 +998,13 @@ function ht(e, r) {
           // gone through conversion from named to numbered, so avoid a misleading error
           `${n === "external" ? "Backrefs" : "Numbered backrefs"} cannot be used with global recursion`
         );
-      const $ = e.slice(0, f.index), E = e.slice(P.lastIndex);
-      if (ee(E, we, S.DEFAULT))
+      const E = e.slice(0, f.index), $ = e.slice(P.lastIndex);
+      if (ee($, we, S.DEFAULT))
         throw new Error(ue);
       const k = +w - 1;
       e = Re(
-        $,
         E,
+        $,
         k,
         !1,
         t,
@@ -1012,7 +1012,7 @@ function ht(e, r) {
         l
       ), a = Oe(
         a,
-        $,
+        E,
         k,
         s.length,
         0,
@@ -1021,23 +1021,23 @@ function ht(e, r) {
       break;
     } else if (m) {
       Pe(y);
-      let $ = !1;
+      let E = !1;
       for (const X of u)
         if (X.name === m || X.num === +m) {
-          if ($ = !0, X.hasRecursedWithin)
+          if (E = !0, X.hasRecursedWithin)
             throw new Error(ue);
           break;
         }
-      if (!$)
+      if (!E)
         throw new Error(I`Recursive \g cannot be used outside the referenced group "${n === "external" ? m : I`\g<${m}&R=${y}>`}"`);
-      const E = i.get(m), k = pt(e, E);
+      const $ = i.get(m), k = pt(e, $);
       if (o && ee(k, I`${ae}|\((?!\?)`, 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 A = e.slice(E, f.index), J = k.slice(A.length + g.length), D = s.length, B = +y - 1, Ee = Re(
+      const A = e.slice($, f.index), J = k.slice(A.length + g.length), D = s.length, B = +y - 1, $e = Re(
         A,
         J,
         B,
@@ -1054,16 +1054,16 @@ function ht(e, r) {
         D,
         l
       );
-      const gr = e.slice(0, E), hr = e.slice(E + k.length);
-      e = `${gr}${Ee}${hr}`, P.lastIndex += Ee.length - g.length - A.length - J.length, u.forEach((X) => X.hasRecursedWithin = !0), c = !0;
+      const hr = e.slice(0, $), wr = e.slice($ + k.length);
+      e = `${hr}${$e}${wr}`, P.lastIndex += $e.length - g.length - A.length - J.length, u.forEach((X) => X.hasRecursedWithin = !0), c = !0;
     } else if (d)
       l++, i.set(String(l), P.lastIndex), i.set(d, P.lastIndex), u.push({
         num: l,
         name: d
       });
     else if (g[0] === "(") {
-      const $ = g === "(";
-      $ && (l++, i.set(String(l), P.lastIndex)), u.push($ ? { num: l } : {});
+      const E = g === "(";
+      E && (l++, i.set(String(l), P.lastIndex)), u.push(E ? { num: l } : {});
     } else g === ")" && u.pop();
   }
   return t.push(...s), {
@@ -1081,7 +1081,7 @@ function Pe(e) {
 }
 function Re(e, r, t, n, a, s, o) {
   const i = /* @__PURE__ */ new Set();
-  n && rr(e + r, ae, ({ groups: { captureName: c } }) => {
+  n && tr(e + r, ae, ({ groups: { captureName: c } }) => {
     i.add(c);
   }, S.DEFAULT);
   const u = [
@@ -1100,7 +1100,7 @@ function Ue(e, r, t, n, a, s, o) {
     const l = u(p);
     c += xe(
       e,
-      I`${nr}|\\k<(?<backref>[^>]+)>`,
+      I`${sr}|\\k<(?<backref>[^>]+)>`,
       ({ 0: f, groups: { captureName: g, unnamed: d, backref: w } }) => {
         if (w && n && !n.has(w))
           return f;
@@ -1123,7 +1123,7 @@ function wt(e, r) {
 function Oe(e, r, t, n, a, s) {
   if (e.size && n) {
     let o = 0;
-    rr(r, nr, () => o++, S.DEFAULT);
+    tr(r, sr, () => o++, S.DEFAULT);
     const i = s - o + a, u = /* @__PURE__ */ new Map();
     return e.forEach((c, p) => {
       const l = (n - o * t) / t, f = o * t, g = p > i + o ? p + n : p, d = [];
@@ -1200,7 +1200,7 @@ var De = {
     ES2018: "ES2018"
   }
 );
-function sr(e = {}) {
+function ar(e = {}) {
   if ({}.toString.call(e) !== "[object Object]")
     throw new Error("Unexpected options");
   if (e.target !== void 0 && !yt[e.target])
@@ -1253,10 +1253,10 @@ var Ct = "[	-\r ]", bt = /* @__PURE__ */ new Set([
   b(305)
   // ı
 ]), _ = h`[\p{L}\p{M}\p{N}\p{Pc}]`;
-function ar(e) {
+function or(e) {
   if (bt.has(e))
     return [e];
-  const r = /* @__PURE__ */ new Set(), t = e.toLowerCase(), n = t.toUpperCase(), a = $t.get(t), s = xt.get(t), o = kt.get(t);
+  const r = /* @__PURE__ */ new Set(), t = e.toLowerCase(), n = t.toUpperCase(), a = Et.get(t), s = xt.get(t), o = kt.get(t);
   return [...n].length === 1 && r.add(n), o && r.add(o), a && r.add(a), r.add(t), s && r.add(s), [...r];
 }
 var ke = /* @__PURE__ */ new Map(
@@ -1365,7 +1365,7 @@ XID_Start XIDS`.split(/\s/).map((e) => [se(e), e])
   // å, Å (Angstrom)
   [b(969), b(8486)]
   // ω, Ω (Ohm)
-]), $t = new Map([
+]), Et = new Map([
   F(453),
   F(456),
   F(459),
@@ -1376,7 +1376,7 @@ XID_Start XIDS`.split(/\s/).map((e) => [se(e), e])
   F(8124),
   F(8140),
   F(8188)
-]), Et = /* @__PURE__ */ new Map([
+]), $t = /* @__PURE__ */ new Map([
   ["alnum", h`[\p{Alpha}\p{Nd}]`],
   ["alpha", h`\p{Alpha}`],
   ["ascii", h`\p{ASCII}`],
@@ -1406,7 +1406,7 @@ function F(e) {
 function ce(e, r) {
   return At(e, r).map((t) => F(t));
 }
-var or = /* @__PURE__ */ new Set([
+var ir = /* @__PURE__ */ new Set([
   "Lower",
   "Lowercase",
   "Upper",
@@ -1436,7 +1436,7 @@ function It(e, r) {
     bestEffortTarget: "ES2025",
     ...r
   };
-  ir(e);
+  ur(e);
   const n = {
     accuracy: t.accuracy,
     asciiWordBoundaries: t.asciiWordBoundaries,
@@ -1489,7 +1489,7 @@ var St = {
       );
       const o = v();
       o.body[0].body.push(
-        Ke("greedy", 0, 1 / 0, s)
+        Ye("greedy", 0, 1 / 0, s)
       ), t(C(o, r), { traverse: !0 });
     } else
       throw new Error('Unsupported absence function "(?~|"');
@@ -1504,7 +1504,7 @@ var St = {
     },
     exit({ node: e }, { flagDirectivesByAlt: r }) {
       if (r.get(e)?.length) {
-        const t = cr(r.get(e));
+        const t = lr(r.get(e));
         if (t) {
           const n = v({ flags: t });
           n.body[0].body = e.body, e.body = [C(n, e)];
@@ -1606,7 +1606,7 @@ var St = {
         }[p];
         c && (l = `\0-${b(l.codePointAt(0) - 1)}${b(l.codePointAt(2) + 1)}-􏿿`), t(C(M(`[${l}]`), r));
       } else
-        t(C(fe(M(Et.get(p)), c), r));
+        t(C(fe(M($t.get(p)), c), r));
     else if (u === "property")
       ke.has(se(p)) || (e.key = "sc");
     else if (u === "space")
@@ -1627,7 +1627,7 @@ var St = {
       }
     else if (i === "keep") {
       const c = t.body[0], l = t.body.length === 1 && // Not emulatable if within a `CapturingGroup`
-      Qe(c, { type: "Group" }) && c.body[0].body.length === 1 ? c.body[0] : t;
+      qe(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 = R({ behind: !0 });
@@ -1714,7 +1714,7 @@ var St = {
         if (s.body.length === 1 && s.body[0].kind === "search_start")
           s.body.pop();
         else {
-          const o = pr(s.body);
+          const o = fr(s.body);
           o ? (n = !0, Array.isArray(o) ? t.push(...o) : t.push(o)) : a = !0;
         }
       n && !a && t.forEach((s) => r.add(s));
@@ -1804,11 +1804,11 @@ var St = {
     }
     const o = n.subroutineRefMap.get(s), i = s === 0, u = i ? Be(0) : (
       // The reffed group might itself contain subroutines, which are expanded during sub-traversal
-      ur(o, n.groupOriginByCopy, null)
+      cr(o, n.groupOriginByCopy, null)
     );
     let c = u;
     if (!i) {
-      const p = cr(Lt(
+      const p = lr(Lt(
         o,
         (f) => f.type === "Group" && !!f.flags
       )), l = p ? te(n.globalFlags, p) : n.globalFlags;
@@ -1845,7 +1845,7 @@ var St = {
     exit({ node: e }, r) {
       const t = Math.max(r.highestOrphanBackref - r.numCapturesToLeft, 0);
       for (let n = 0; n < t; n++) {
-        const a = Je();
+        const a = Ke();
         e.body.at(-1).body.push(a);
       }
     }
@@ -1854,7 +1854,7 @@ var St = {
     !e.isRecursive || e.ref === 0 || (e.ref = r.reffedNodesByReferencer.get(e).number);
   }
 };
-function ir(e) {
+function ur(e) {
   Z(e, {
     "*"({ node: r, parent: t }) {
       r.parent = t;
@@ -1873,24 +1873,24 @@ function Nt(e, r) {
       continue;
     if (t === e)
       return !1;
-    const n = lr(t.parent);
+    const n = pr(t.parent);
     for (const a of n) {
       if (a === t)
         break;
-      if (a === e || fr(a, e))
+      if (a === e || dr(a, e))
         return !0;
     }
   } while (t = t.parent);
   throw new Error("Unexpected path");
 }
-function ur(e, r, t, n) {
+function cr(e, r, t, n) {
   const a = Array.isArray(e) ? [] : {};
   for (const [s, o] of Object.entries(e))
-    s === "parent" ? a.parent = Array.isArray(t) ? n : t : o && typeof o == "object" ? a[s] = ur(o, r, a, t) : (s === "type" && o === "CapturingGroup" && r.set(a, r.get(e) ?? e), a[s] = o);
+    s === "parent" ? a.parent = Array.isArray(t) ? n : t : o && typeof o == "object" ? a[s] = cr(o, r, a, t) : (s === "type" && o === "CapturingGroup" && r.set(a, r.get(e) ?? e), a[s] = o);
   return a;
 }
 function Be(e) {
-  const r = Ye(e);
+  const r = er(e);
   return r.isRecursive = !0, r;
 }
 function Lt(e, r) {
@@ -1905,7 +1905,7 @@ function le(e, r) {
   const t = `$${r.size}_${e.replace(/^[^$_\p{IDS}]|[^$\u200C\u200D\p{IDC}]/ug, "_")}`;
   return r.set(e, t), t;
 }
-function cr(e) {
+function lr(e) {
   const r = ["dotAll", "ignoreCase"], t = { enable: {}, disable: {} };
   return e.forEach(({ flags: n }) => {
     r.forEach((a) => {
@@ -1917,13 +1917,13 @@ function Ft({ 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 lr(e) {
+function pr(e) {
   if (!e)
     throw new Error("Node expected");
   const { body: r } = e;
   return Array.isArray(r) ? r : r ? [r] : null;
 }
-function pr(e) {
+function fr(e) {
   const r = e.find((t) => t.kind === "search_start" || Rt(t, { negate: !1 }) || !Gt(t));
   if (!r)
     return null;
@@ -1934,7 +1934,7 @@ function pr(e) {
   if (r.type === "CapturingGroup" || r.type === "Group") {
     const t = [];
     for (const n of r.body) {
-      const a = pr(n.body);
+      const a = fr(n.body);
       if (!a)
         return null;
       Array.isArray(a) ? t.push(...a) : t.push(a);
@@ -1943,10 +1943,10 @@ function pr(e) {
   }
   return null;
 }
-function fr(e, r) {
-  const t = lr(e) ?? [];
+function dr(e, r) {
+  const t = pr(e) ?? [];
   for (const n of t)
-    if (n === r || fr(n, r))
+    if (n === r || dr(n, r))
       return !0;
   return !1;
 }
@@ -1966,7 +1966,7 @@ function Rt(e, r) {
     negate: null,
     ...r
   };
-  return e.type === "LookaroundAssertion" && (t.negate === null || e.negate === t.negate) && e.body.length === 1 && Qe(e.body[0], {
+  return e.type === "LookaroundAssertion" && (t.negate === null || e.negate === t.negate) && e.body.length === 1 && qe(e.body[0], {
     type: "Assertion",
     kind: "search_start"
   });
@@ -1975,7 +1975,7 @@ function pe(e) {
   return /^[$_\p{IDS}][$\u200C\u200D\p{IDC}]*$/u.test(e);
 }
 function M(e, r) {
-  const n = qe(e, {
+  const n = Je(e, {
     ...r,
     // Providing a custom set of Unicode property names avoids converting some JS Unicode
     // properties (ex: `\p{Alpha}`) to Onig POSIX classes
@@ -1990,10 +1990,10 @@ function G(e, r) {
   return e.parent = r, e;
 }
 function C(e, r) {
-  return ir(e), e.parent = r, e;
+  return ur(e), e.parent = r, e;
 }
 function Ut(e, r) {
-  const t = sr(r), n = me(t.target, "ES2024"), a = me(t.target, "ES2025"), s = t.rules.recursionLimit;
+  const t = ar(r), n = me(t.target, "ES2024"), a = me(t.target, "ES2025"), s = t.rules.recursionLimit;
   if (!Number.isInteger(s) || s < 2 || s > 20)
     throw new Error("Invalid recursionLimit; use 2-20");
   let o = null, i = null;
@@ -2069,13 +2069,13 @@ var Ot = {
     r.setHasCasedChar();
   },
   Character({ node: e }, r) {
-    $e(b(e.value)) && r.setHasCasedChar();
+    Ee(b(e.value)) && r.setHasCasedChar();
   },
   CharacterClassRange({ node: e, skip: r }, t) {
-    r(), dr(e, { firstOnly: !0 }).length && t.setHasCasedChar();
+    r(), gr(e, { firstOnly: !0 }).length && t.setHasCasedChar();
   },
   CharacterSet({ node: e }, r) {
-    e.kind === "property" && or.has(e.value) && r.setHasCasedChar();
+    e.kind === "property" && ir.has(e.value) && r.setHasCasedChar();
   }
 }, Dt = {
   /**
@@ -2124,8 +2124,8 @@ var Ot = {
     });
     if (n !== t)
       return n;
-    if (r.useAppliedIgnoreCase && r.currentFlags.ignoreCase && $e(t)) {
-      const a = ar(t);
+    if (r.useAppliedIgnoreCase && r.currentFlags.ignoreCase && Ee(t)) {
+      const a = or(t);
       return r.inCharClass ? a.join("") : a.length > 1 ? `[${a.join("")}]` : a[0];
     }
     return t;
@@ -2182,7 +2182,7 @@ var Ot = {
       useFlagV: r.useFlagV
     }, s = V(t, a), o = V(n, a), i = /* @__PURE__ */ new Set();
     if (r.useAppliedIgnoreCase && r.currentFlags.ignoreCase) {
-      const u = dr(e);
+      const u = gr(e);
       Wt(u).forEach((p) => {
         i.add(
           Array.isArray(p) ? `${V(p[0], a)}-${V(p[1], a)}` : V(p, a)
@@ -2203,7 +2203,7 @@ var Ot = {
     if (e === "digit")
       return r ? h`\D` : h`\d`;
     if (e === "property") {
-      if (a.useAppliedIgnoreCase && a.currentFlags.ignoreCase && or.has(t))
+      if (a.useAppliedIgnoreCase && a.currentFlags.ignoreCase && ir.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}}`;
     }
@@ -2327,18 +2327,18 @@ var Ot = {
   [65279, h`\uFEFF`]
   // ZWNBSP/BOM
 ]), zt = new RegExp("^\\p{Cased}$", "u");
-function $e(e) {
+function Ee(e) {
   return zt.test(e);
 }
-function dr(e, r) {
+function gr(e, r) {
   const t = !!r?.firstOnly, n = e.min.value, a = e.max.value, s = [];
   if (n < 65 && (a === 65535 || a >= 131071) || n === 65536 && a >= 131071)
     return s;
   for (let o = n; o <= a; o++) {
     const i = b(o);
-    if (!$e(i))
+    if (!Ee(i))
       continue;
-    const u = ar(i).filter((c) => {
+    const u = or(i).filter((c) => {
       const p = c.codePointAt(0);
       return p < n || p > a;
     });
@@ -2545,7 +2545,7 @@ function Kt(e, r) {
   return t.options ? new Zt(t.pattern, t.flags, t.options) : new RegExp(t.pattern, t.flags);
 }
 function Yt(e, r) {
-  const t = sr(r), n = qe(e, {
+  const t = ar(r), n = Je(e, {
     flags: t.flags,
     normalizeUnknownPropertyNames: !0,
     rules: {
@@ -2606,16 +2606,33 @@ function rn(e = {}) {
   }, e);
   return r.regexConstructor ||= (t) => en(t, { target: r.target }), {
     createScanner(t) {
-      return new wr(t, r);
+      return new We(t, r);
     },
     createString(t) {
       return { content: t };
     }
   };
 }
+function tn() {
+  const e = {
+    cache: /* @__PURE__ */ new Map(),
+    regexConstructor: () => {
+      throw new Error("JavaScriptRawEngine: only support precompiled grammar");
+    }
+  };
+  return {
+    createScanner(r) {
+      return new We(r, e);
+    },
+    createString(r) {
+      return { content: r };
+    }
+  };
+}
 export {
-  wr as J,
-  rn as c,
-  en as d
+  We as JavaScriptScanner,
+  tn as createJavaScriptRawEngine,
+  rn as createJavaScriptRegexEngine,
+  en as defaultJavaScriptRegexConstructor
 };
-//# sourceMappingURL=engine-compile-D-n7xALU.js.map
+//# sourceMappingURL=engine-javascript-hi1kqifa6nkcridk.js.map