@dipoleml/dcode-cli 1.0.0 → 1.2.0

package/node_modules/oniguruma-to-es/dist/cjs/index.js

@@ -145,7 +145,7 @@ function getOptions(options = {}) {
   return opts;
 }
 
-// node_modules/.pnpm/oniguruma-parser@0.12.2/node_modules/oniguruma-parser/dist/utils.js
+// node_modules/.pnpm/oniguruma-parser@0.12.1/node_modules/oniguruma-parser/dist/utils.js
 function r2(e) {
   if ([...e].length !== 1) throw new Error(`Expected "${e}" to be a single code point`);
   return e.codePointAt(0);
@@ -160,7 +160,7 @@ function u(e, t) {
   return e;
 }
 
-// node_modules/.pnpm/oniguruma-parser@0.12.2/node_modules/oniguruma-parser/dist/tokenizer/tokenize.js
+// node_modules/.pnpm/oniguruma-parser@0.12.1/node_modules/oniguruma-parser/dist/tokenizer/tokenize.js
 var m = o`\[\^?`;
 var b = `c.? | C(?:-.?)?|${o`[pP]\{(?:\^?[-\x20_]*[A-Za-z][-\x20\w]*\})?`}|${o`x[89A-Fa-f]\p{AHex}(?:\\x[89A-Fa-f]\p{AHex})*`}|${o`u(?:\p{AHex}{4})? | x\{[^\}]*\}? | x\p{AHex}{0,2}`}|${o`o\{[^\}]*\}?`}|${o`\d{1,3}`}`;
 var y = /[?*+][?+]?|\{(?:\d+(?:,\d*)?|,\d+)\}\??/;
@@ -518,7 +518,7 @@ function te(e) {
   return n;
 }
 
-// node_modules/.pnpm/oniguruma-parser@0.12.2/node_modules/oniguruma-parser/dist/parser/node-utils.js
+// node_modules/.pnpm/oniguruma-parser@0.12.1/node_modules/oniguruma-parser/dist/parser/node-utils.js
 function o2(e, t) {
   if (!Array.isArray(e.body)) throw new Error("Expected node with body array");
   if (e.body.length !== 1) return false;
@@ -530,142 +530,142 @@ function s(e) {
 }
 var y2 = /* @__PURE__ */ new Set(["AbsenceFunction", "Backreference", "CapturingGroup", "Character", "CharacterClass", "CharacterSet", "Group", "Quantifier", "Subroutine"]);
 
-// node_modules/.pnpm/oniguruma-parser@0.12.2/node_modules/oniguruma-parser/dist/parser/parse.js
+// node_modules/.pnpm/oniguruma-parser@0.12.1/node_modules/oniguruma-parser/dist/parser/parse.js
 function J2(e, r4 = {}) {
-  const n = { flags: "", normalizeUnknownPropertyNames: false, skipBackrefValidation: false, skipLookbehindValidation: false, skipPropertyNameValidation: false, unicodePropertyMap: null, ...r4, rules: { captureGroup: false, singleline: false, ...r4.rules } }, o3 = M(e, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), i2 = (p, N) => {
-    const u2 = o3.tokens[t.nextIndex];
-    switch (t.parent = p, t.nextIndex++, u2.type) {
+  const n = { flags: "", normalizeUnknownPropertyNames: false, skipBackrefValidation: false, skipLookbehindValidation: false, skipPropertyNameValidation: false, unicodePropertyMap: null, ...r4, rules: { captureGroup: false, singleline: false, ...r4.rules } }, t = M(e, { flags: n.flags, rules: { captureGroup: n.rules.captureGroup, singleline: n.rules.singleline } }), s2 = (p, N) => {
+    const u2 = t.tokens[o3.nextIndex];
+    switch (o3.parent = p, o3.nextIndex++, u2.type) {
       case "Alternator":
         return b2();
       case "Assertion":
         return W2(u2);
       case "Backreference":
-        return X2(u2, t);
+        return X2(u2, o3);
       case "Character":
         return m2(u2.value, { useLastValid: !!N.isCheckingRangeEnd });
       case "CharacterClassHyphen":
-        return ee2(u2, t, N);
+        return ee2(u2, o3, N);
       case "CharacterClassOpen":
-        return re(u2, t, N);
+        return re(u2, o3, N);
       case "CharacterSet":
-        return ne(u2, t);
+        return ne(u2, o3);
       case "Directive":
         return I2(u2.kind, { flags: u2.flags });
       case "GroupOpen":
-        return te2(u2, t, N);
+        return te2(u2, o3, N);
       case "NamedCallout":
         return U2(u2.kind, u2.tag, u2.arguments);
       case "Quantifier":
-        return oe(u2, t);
+        return oe(u2, o3);
       case "Subroutine":
-        return ae(u2, t);
+        return ae(u2, o3);
       default:
         throw new Error(`Unexpected token type "${u2.type}"`);
     }
-  }, t = { capturingGroups: [], hasNumberedRef: false, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: n.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: n.skipBackrefValidation, skipLookbehindValidation: n.skipLookbehindValidation, skipPropertyNameValidation: n.skipPropertyNameValidation, subroutines: [], tokens: o3.tokens, unicodePropertyMap: n.unicodePropertyMap, walk: i2 }, d2 = B2(T2(o3.flags));
-  let s2 = d2.body[0];
-  for (; t.nextIndex < o3.tokens.length; ) {
-    const p = i2(s2, {});
-    p.type === "Alternative" ? (d2.body.push(p), s2 = p) : s2.body.push(p);
+  }, o3 = { capturingGroups: [], hasNumberedRef: false, namedGroupsByName: /* @__PURE__ */ new Map(), nextIndex: 0, normalizeUnknownPropertyNames: n.normalizeUnknownPropertyNames, parent: null, skipBackrefValidation: n.skipBackrefValidation, skipLookbehindValidation: n.skipLookbehindValidation, skipPropertyNameValidation: n.skipPropertyNameValidation, subroutines: [], tokens: t.tokens, unicodePropertyMap: n.unicodePropertyMap, walk: s2 }, i2 = B2(T2(t.flags));
+  let d2 = i2.body[0];
+  for (; o3.nextIndex < t.tokens.length; ) {
+    const p = s2(d2, {});
+    p.type === "Alternative" ? (i2.body.push(p), d2 = p) : d2.body.push(p);
   }
-  const { capturingGroups: a2, hasNumberedRef: l3, namedGroupsByName: c, subroutines: f2 } = t;
+  const { capturingGroups: a2, hasNumberedRef: l3, namedGroupsByName: c, subroutines: f3 } = o3;
   if (l3 && c.size && !n.rules.captureGroup) throw new Error("Numbered backref/subroutine not allowed when using named capture");
-  for (const { ref: p } of f2) if (typeof p == "number") {
+  for (const { ref: p } of f3) if (typeof p == "number") {
     if (p > a2.length) throw new Error("Subroutine uses a group number that's not defined");
     p && (a2[p - 1].isSubroutined = true);
   } else if (c.has(p)) {
     if (c.get(p).length > 1) throw new Error(o`Subroutine uses a duplicate group name "\g<${p}>"`);
     c.get(p)[0].isSubroutined = true;
   } else throw new Error(o`Subroutine uses a group name that's not defined "\g<${p}>"`);
-  return d2;
+  return i2;
 }
 function W2({ kind: e }) {
   return F2(u({ "^": "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 === o`\B` || e === o`\Y` });
 }
 function X2({ raw: e }, r4) {
-  const n = /^\\k[<']/.test(e), o3 = n ? e.slice(3, -1) : e.slice(1), i2 = (t, d2 = false) => {
-    const s2 = r4.capturingGroups.length;
+  const n = /^\\k[<']/.test(e), t = n ? e.slice(3, -1) : e.slice(1), s2 = (o3, i2 = false) => {
+    const d2 = r4.capturingGroups.length;
     let a2 = false;
-    if (t > s2) if (r4.skipBackrefValidation) a2 = true;
+    if (o3 > d2) if (r4.skipBackrefValidation) a2 = true;
     else throw new Error(`Not enough capturing groups defined to the left "${e}"`);
-    return r4.hasNumberedRef = true, k2(d2 ? s2 + 1 - t : t, { orphan: a2 });
+    return r4.hasNumberedRef = true, k2(i2 ? d2 + 1 - o3 : o3, { orphan: a2 });
   };
   if (n) {
-    const t = /^(?<sign>-?)0*(?<num>[1-9]\d*)$/.exec(o3);
-    if (t) return i2(+t.groups.num, !!t.groups.sign);
-    if (/[-+]/.test(o3)) throw new Error(`Invalid backref name "${e}"`);
-    if (!r4.namedGroupsByName.has(o3)) throw new Error(`Group name not defined to the left "${e}"`);
-    return k2(o3);
+    const o3 = /^(?<sign>-?)0*(?<num>[1-9]\d*)$/.exec(t);
+    if (o3) return s2(+o3.groups.num, !!o3.groups.sign);
+    if (/[-+]/.test(t)) throw new Error(`Invalid backref name "${e}"`);
+    if (!r4.namedGroupsByName.has(t)) throw new Error(`Group name not defined to the left "${e}"`);
+    return k2(t);
   }
-  return i2(+o3);
+  return s2(+t);
 }
 function ee2(e, r4, n) {
-  const { tokens: o3, walk: i2 } = r4, t = r4.parent, d2 = t.body.at(-1), s2 = o3[r4.nextIndex];
-  if (!n.isCheckingRangeEnd && d2 && d2.type !== "CharacterClass" && d2.type !== "CharacterClassRange" && s2 && s2.type !== "CharacterClassOpen" && s2.type !== "CharacterClassClose" && s2.type !== "CharacterClassIntersector") {
-    const a2 = i2(t, { ...n, isCheckingRangeEnd: true });
-    if (d2.type === "Character" && a2.type === "Character") return t.body.pop(), L2(d2, a2);
+  const { tokens: t, walk: s2 } = r4, o3 = r4.parent, i2 = o3.body.at(-1), d2 = t[r4.nextIndex];
+  if (!n.isCheckingRangeEnd && i2 && i2.type !== "CharacterClass" && i2.type !== "CharacterClassRange" && d2 && d2.type !== "CharacterClassOpen" && d2.type !== "CharacterClassClose" && d2.type !== "CharacterClassIntersector") {
+    const a2 = s2(o3, { ...n, isCheckingRangeEnd: true });
+    if (i2.type === "Character" && a2.type === "Character") return o3.body.pop(), L2(i2, a2);
     throw new Error("Invalid character class range");
   }
   return m2(r2("-"));
 }
 function re({ negate: e }, r4, n) {
-  const { tokens: o3, walk: i2 } = r4, t = [C2()], d2 = o3[r4.nextIndex];
-  let s2 = z2(d2);
-  for (; s2.type !== "CharacterClassClose"; ) {
-    if (s2.type === "CharacterClassIntersector") t.push(C2()), r4.nextIndex++;
+  const { tokens: t, walk: s2 } = r4, o3 = t[r4.nextIndex], i2 = [C2()];
+  let d2 = z2(o3);
+  for (; d2.type !== "CharacterClassClose"; ) {
+    if (d2.type === "CharacterClassIntersector") i2.push(C2()), r4.nextIndex++;
     else {
-      const l3 = t.at(-1);
-      l3.body.push(i2(l3, n));
+      const l3 = i2.at(-1);
+      l3.body.push(s2(l3, n));
     }
-    s2 = z2(o3[r4.nextIndex], d2);
+    d2 = z2(t[r4.nextIndex], o3);
   }
   const a2 = C2({ negate: e });
-  return t.length === 1 ? a2.body = t[0].body : (a2.kind = "intersection", a2.body = t.map((l3) => l3.body.length === 1 ? l3.body[0] : l3)), r4.nextIndex++, a2;
+  return i2.length === 1 ? a2.body = i2[0].body : (a2.kind = "intersection", a2.body = i2.map((l3) => l3.body.length === 1 ? l3.body[0] : l3)), r4.nextIndex++, a2;
 }
-function ne({ kind: e, negate: r4, value: n }, o3) {
-  const { normalizeUnknownPropertyNames: i2, skipPropertyNameValidation: t, unicodePropertyMap: d2 } = o3;
+function ne({ kind: e, negate: r4, value: n }, t) {
+  const { normalizeUnknownPropertyNames: s2, skipPropertyNameValidation: o3, unicodePropertyMap: i2 } = t;
   if (e === "property") {
-    const s2 = w2(n);
-    if (i.has(s2) && !d2?.has(s2)) e = "posix", n = s2;
-    else return Q2(n, { negate: r4, normalizeUnknownPropertyNames: i2, skipPropertyNameValidation: t, unicodePropertyMap: d2 });
+    const d2 = w2(n);
+    if (i.has(d2) && !i2?.has(d2)) e = "posix", n = d2;
+    else return Q2(n, { negate: r4, normalizeUnknownPropertyNames: s2, skipPropertyNameValidation: o3, unicodePropertyMap: i2 });
   }
   return e === "posix" ? R2(n, { negate: r4 }) : E2(e, { negate: r4 });
 }
 function te2(e, r4, n) {
-  const { tokens: o3, capturingGroups: i2, namedGroupsByName: t, skipLookbehindValidation: d2, walk: s2 } = r4, a2 = ie(e), l3 = a2.type === "AbsenceFunction", c = $2(a2), f2 = c && a2.negate;
-  if (a2.type === "CapturingGroup" && (i2.push(a2), a2.name && l(t, a2.name, []).push(a2)), l3 && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
-  let p = D2(o3[r4.nextIndex]);
+  const { tokens: t, capturingGroups: s2, namedGroupsByName: o3, skipLookbehindValidation: i2, walk: d2 } = r4, a2 = ie(e), l3 = a2.type === "AbsenceFunction", c = $2(a2), f3 = c && a2.negate;
+  if (a2.type === "CapturingGroup" && (s2.push(a2), a2.name && l(o3, a2.name, []).push(a2)), l3 && n.isInAbsenceFunction) throw new Error("Nested absence function not supported by Oniguruma");
+  let p = D2(t[r4.nextIndex]);
   for (; p.type !== "GroupClose"; ) {
     if (p.type === "Alternator") a2.body.push(b2()), r4.nextIndex++;
     else {
-      const N = a2.body.at(-1), u2 = s2(N, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || l3, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || f2 });
-      if (N.body.push(u2), (c || n.isInLookbehind) && !d2) {
+      const N = a2.body.at(-1), u2 = d2(N, { ...n, isInAbsenceFunction: n.isInAbsenceFunction || l3, isInLookbehind: n.isInLookbehind || c, isInNegLookbehind: n.isInNegLookbehind || f3 });
+      if (N.body.push(u2), (c || n.isInLookbehind) && !i2) {
         const v2 = "Lookbehind includes a pattern not allowed by Oniguruma";
-        if (f2 || n.isInNegLookbehind) {
+        if (f3 || n.isInNegLookbehind) {
           if (M2(u2) || u2.type === "CapturingGroup") throw new Error(v2);
         } else if (M2(u2) || $2(u2) && u2.negate) throw new Error(v2);
       }
     }
-    p = D2(o3[r4.nextIndex]);
+    p = D2(t[r4.nextIndex]);
   }
   return r4.nextIndex++, a2;
 }
-function oe({ kind: e, min: r4, max: n }, o3) {
-  const i2 = o3.parent, t = i2.body.at(-1);
-  if (!t || !s(t)) throw new Error("Quantifier requires a repeatable token");
-  const d2 = _2(e, r4, n, t);
-  return i2.body.pop(), d2;
+function oe({ kind: e, min: r4, max: n }, t) {
+  const s2 = t.parent, o3 = s2.body.at(-1);
+  if (!o3 || !s(o3)) throw new Error("Quantifier requires a repeatable token");
+  const i2 = _2(e, r4, n, o3);
+  return s2.body.pop(), i2;
 }
 function ae({ raw: e }, r4) {
-  const { capturingGroups: n, subroutines: o3 } = r4;
-  let i2 = e.slice(3, -1);
-  const t = /^(?<sign>[-+]?)0*(?<num>[1-9]\d*)$/.exec(i2);
-  if (t) {
-    const s2 = +t.groups.num, a2 = n.length;
-    if (r4.hasNumberedRef = true, i2 = { "": s2, "+": a2 + s2, "-": a2 + 1 - s2 }[t.groups.sign], i2 < 1) throw new Error("Invalid subroutine number");
-  } else i2 === "0" && (i2 = 0);
-  const d2 = O2(i2);
-  return o3.push(d2), d2;
+  const { capturingGroups: n, subroutines: t } = r4;
+  let s2 = e.slice(3, -1);
+  const o3 = /^(?<sign>[-+]?)0*(?<num>[1-9]\d*)$/.exec(s2);
+  if (o3) {
+    const d2 = +o3.groups.num, a2 = n.length;
+    if (r4.hasNumberedRef = true, s2 = { "": d2, "+": a2 + d2, "-": a2 + 1 - d2 }[o3.groups.sign], s2 < 1) throw new Error("Invalid subroutine number");
+  } else s2 === "0" && (s2 = 0);
+  const i2 = O2(s2);
+  return t.push(i2), i2;
 }
 function G(e, r4) {
   if (e !== "repeater") throw new Error(`Unexpected absence function kind "${e}"`);
@@ -690,9 +690,9 @@ function P2(e, r4) {
 function m2(e, r4) {
   const n = { useLastValid: false, ...r4 };
   if (e > 1114111) {
-    const o3 = e.toString(16);
+    const t = e.toString(16);
     if (n.useLastValid) e = 1114111;
-    else throw e > 1310719 ? new Error(`Invalid code point out of range "\\x{${o3}}"`) : new Error(`Invalid code point out of range in JS "\\x{${o3}}"`);
+    else throw e > 1310719 ? new Error(`Invalid code point out of range "\\x{${t}}"`) : new Error(`Invalid code point out of range in JS "\\x{${t}}"`);
   }
   return { type: "Character", value: e };
 }
@@ -705,8 +705,8 @@ function L2(e, r4) {
   return { type: "CharacterClassRange", min: e, max: r4 };
 }
 function E2(e, r4) {
-  const n = !!r4?.negate, o3 = { type: "CharacterSet", kind: e };
-  return (e === "digit" || e === "hex" || e === "newline" || e === "space" || e === "word") && (o3.negate = n), (e === "text_segment" || e === "newline" && !n) && (o3.variableLength = true), o3;
+  const n = !!r4?.negate, t = { type: "CharacterSet", kind: e };
+  return (e === "digit" || e === "hex" || e === "newline" || e === "space" || e === "word") && (t.negate = n), (e === "text_segment" || e === "newline" && !n) && (t.variableLength = true), t;
 }
 function I2(e, r4 = {}) {
   if (e === "keep") return { type: "Directive", kind: e };
@@ -733,9 +733,9 @@ function R2(e, r4) {
   if (!i.has(e)) throw new Error(`Invalid POSIX class "${e}"`);
   return { type: "CharacterSet", kind: "posix", value: e, negate: n };
 }
-function _2(e, r4, n, o3) {
+function _2(e, r4, n, t) {
   if (r4 > n) throw new Error("Invalid reversed quantifier range");
-  return { type: "Quantifier", kind: e, min: r4, max: n, body: o3 };
+  return { type: "Quantifier", kind: e, min: r4, max: n, body: t };
 }
 function B2(e, r4) {
   return { type: "Regex", body: h(r4?.body), flags: e };
@@ -745,26 +745,26 @@ function O2(e) {
 }
 function Q2(e, r4) {
   const n = { negate: false, normalizeUnknownPropertyNames: false, skipPropertyNameValidation: false, unicodePropertyMap: null, ...r4 };
-  let o3 = n.unicodePropertyMap?.get(w2(e));
-  if (!o3) {
-    if (n.normalizeUnknownPropertyNames) o3 = de(e);
+  let t = n.unicodePropertyMap?.get(w2(e));
+  if (!t) {
+    if (n.normalizeUnknownPropertyNames) t = de(e);
     else if (n.unicodePropertyMap && !n.skipPropertyNameValidation) throw new Error(o`Invalid Unicode property "\p{${e}}"`);
   }
-  return { type: "CharacterSet", kind: "property", value: o3 ?? e, negate: n.negate };
+  return { type: "CharacterSet", kind: "property", value: t ?? e, negate: n.negate };
 }
-function ie({ flags: e, kind: r4, name: n, negate: o3, number: i2 }) {
+function ie({ flags: e, kind: r4, name: n, negate: t, number: s2 }) {
   switch (r4) {
     case "absence_repeater":
       return G("repeater");
     case "atomic":
       return A2({ atomic: true });
     case "capturing":
-      return P2(i2, { name: n });
+      return P2(s2, { name: n });
     case "group":
       return A2({ flags: e });
     case "lookahead":
     case "lookbehind":
-      return K2({ behind: r4 === "lookbehind", negate: o3 });
+      return K2({ behind: r4 === "lookbehind", negate: t });
     default:
       throw new Error(`Unexpected group kind "${r4}"`);
   }
@@ -795,8 +795,7 @@ function w2(e) {
   return e.replace(/[- _]+/g, "").toLowerCase();
 }
 function z2(e, r4) {
-  const n = r4;
-  return u(e, `Unclosed character class${n?.type === "Character" && n.value === 93 && n.raw === "]" ? ' (started with "]")' : ""}`);
+  return u(e, `${r4?.type === "Character" && r4.value === 93 ? "Empty" : "Unclosed"} character class`);
 }
 function D2(e) {
   return u(e, "Unclosed group");
@@ -999,9 +998,9 @@ var UnicodePropertiesWithSpecificCase = /* @__PURE__ */ new Set([
   // undesired behavior anyway
 ]);
 
-// node_modules/.pnpm/oniguruma-parser@0.12.2/node_modules/oniguruma-parser/dist/traverser/traverse.js
+// node_modules/.pnpm/oniguruma-parser@0.12.1/node_modules/oniguruma-parser/dist/traverser/traverse.js
 function S(a2, v2, N = null) {
-  function b3(e, s2) {
+  function u2(e, s2) {
     for (let t = 0; t < e.length; t++) {
       const r4 = n(e[t], s2, t, e);
       t = Math.max(-1, t + r4);
@@ -1010,33 +1009,34 @@ function S(a2, v2, N = null) {
   function n(e, s2 = null, t = null, r4 = null) {
     let i2 = 0, c = false;
     const d2 = { node: e, parent: s2, key: t, container: r4, root: a2, remove() {
-      x2(r4).splice(Math.max(0, l2(t) + i2), 1), i2--, c = true;
+      f2(r4).splice(Math.max(0, l2(t) + i2), 1), i2--, c = true;
     }, removeAllNextSiblings() {
-      return x2(r4).splice(l2(t) + 1);
+      return f2(r4).splice(l2(t) + 1);
     }, removeAllPrevSiblings() {
       const o3 = l2(t) + i2;
-      return i2 -= o3, x2(r4).splice(0, Math.max(0, o3));
-    }, replaceWith(o3, m3 = {}) {
-      const y3 = !!m3.traverse;
-      r4 ? r4[Math.max(0, l2(t) + i2)] = o3 : u(s2, "Can't replace root node")[t] = o3, y3 && n(o3, s2, t, r4), c = true;
-    }, replaceWithMultiple(o3, m3 = {}) {
-      const y3 = !!m3.traverse;
-      if (x2(r4).splice(Math.max(0, l2(t) + i2), 1, ...o3), i2 += o3.length - 1, y3) {
+      return i2 -= o3, f2(r4).splice(0, Math.max(0, o3));
+    }, replaceWith(o3, y3 = {}) {
+      const b3 = !!y3.traverse;
+      r4 ? r4[Math.max(0, l2(t) + i2)] = o3 : u(s2, "Can't replace root node")[t] = o3, b3 && n(o3, s2, t, r4), c = true;
+    }, replaceWithMultiple(o3, y3 = {}) {
+      const b3 = !!y3.traverse;
+      if (f2(r4).splice(Math.max(0, l2(t) + i2), 1, ...o3), i2 += o3.length - 1, b3) {
         let g = 0;
-        for (let p = 0; p < o3.length; p++) g += n(o3[p], s2, l2(t) + p + g, r4);
+        for (let x2 = 0; x2 < o3.length; x2++) g += n(o3[x2], s2, l2(t) + x2 + g, r4);
       }
       c = true;
     }, skip() {
       c = true;
-    } }, { type: f2 } = e, u2 = v2["*"], h2 = v2[f2], R3 = typeof u2 == "function" ? u2 : u2?.enter, P3 = typeof h2 == "function" ? h2 : h2?.enter;
-    if (R3?.(d2, N), P3?.(d2, N), !c) switch (f2) {
+    } }, { type: m3 } = e, h2 = v2["*"], p = v2[m3], R3 = typeof h2 == "function" ? h2 : h2?.enter, P3 = typeof p == "function" ? p : p?.enter;
+    if (R3?.(d2, N), P3?.(d2, N), !c) switch (m3) {
       case "AbsenceFunction":
-      case "Alternative":
       case "CapturingGroup":
-      case "CharacterClass":
       case "Group":
-      case "LookaroundAssertion":
-        b3(e.body, e);
+        u2(e.body, e);
+        break;
+      case "Alternative":
+      case "CharacterClass":
+        u2(e.body, e);
         break;
       case "Assertion":
       case "Backreference":
@@ -1050,20 +1050,23 @@ function S(a2, v2, N = null) {
       case "CharacterClassRange":
         n(e.min, e, "min"), n(e.max, e, "max");
         break;
+      case "LookaroundAssertion":
+        u2(e.body, e);
+        break;
       case "Quantifier":
         n(e.body, e, "body");
         break;
       case "Regex":
-        b3(e.body, e), n(e.flags, e, "flags");
+        u2(e.body, e), n(e.flags, e, "flags");
         break;
       default:
-        throw new Error(`Unexpected node type "${f2}"`);
+        throw new Error(`Unexpected node type "${m3}"`);
     }
-    return h2?.exit?.(d2, N), u2?.exit?.(d2, N), i2;
+    return p?.exit?.(d2, N), h2?.exit?.(d2, N), i2;
   }
   return n(a2), a2;
 }
-function x2(a2) {
+function f2(a2) {
   if (!Array.isArray(a2)) throw new Error("Container expected");
   return a2;
 }
@@ -1343,7 +1346,7 @@ var FirstPassVisitor = {
       // Flag W
       "textSegmentMode"
       // Flag y{g} or y{w}
-    ].forEach((f2) => delete node[f2]);
+    ].forEach((f3) => delete node[f3]);
     Object.assign(node, {
       // JS flag g; no Onig equiv
       global: false,
@@ -1512,9 +1515,7 @@ var SecondPassVisitor = {
       }
     },
     exit({ node }, { openRefs }) {
-      if (openRefs.get(node.number) === node) {
-        openRefs.delete(node.number);
-      }
+      openRefs.delete(node.number);
     }
   },
   Group: {
@@ -2720,7 +2721,7 @@ function atomic(expression, data) {
               captureTransfers.forEach((from, to) => {
                 newCaptureTransfers.set(
                   to >= addedCaptureNum ? to + 1 : to,
-                  from.map((f2) => f2 >= addedCaptureNum ? f2 + 1 : f2)
+                  from.map((f3) => f3 >= addedCaptureNum ? f3 + 1 : f3)
                 );
               });
               captureTransfers = newCaptureTransfers;
@@ -3059,18 +3060,18 @@ function mapCaptureTransfers(captureTransfers, left, reps, numCapturesAddedInExp
       const numCapturesAddedInLeft = numCapturesInLeft * reps;
       const newTo = to > recursionDelimCaptureNum + numCapturesInLeft ? to + numCapturesAddedInExpansion : to;
       const newFrom = [];
-      for (const f2 of from) {
-        if (f2 <= recursionDelimCaptureNum) {
-          newFrom.push(f2);
-        } else if (f2 > recursionDelimCaptureNum + numCapturesInLeft + numCapturesInRight) {
-          newFrom.push(f2 + numCapturesAddedInExpansion);
-        } else if (f2 <= recursionDelimCaptureNum + numCapturesInLeft) {
+      for (const f3 of from) {
+        if (f3 <= recursionDelimCaptureNum) {
+          newFrom.push(f3);
+        } else if (f3 > recursionDelimCaptureNum + numCapturesInLeft + numCapturesInRight) {
+          newFrom.push(f3 + numCapturesAddedInExpansion);
+        } else if (f3 <= recursionDelimCaptureNum + numCapturesInLeft) {
           for (let i2 = 0; i2 <= reps; i2++) {
-            newFrom.push(f2 + numCapturesInLeft * i2);
+            newFrom.push(f3 + numCapturesInLeft * i2);
           }
         } else {
           for (let i2 = 0; i2 <= reps; i2++) {
-            newFrom.push(f2 + numCapturesAddedInLeft + numCapturesInRight * i2);
+            newFrom.push(f3 + numCapturesAddedInLeft + numCapturesInRight * i2);
           }
         }
       }

package/node_modules/oniguruma-to-es/dist/cjs/subclass.d.ts

@@ -23,13 +23,13 @@ export class EmulatedRegExp extends RegExp {
      @param {string} [flags]
      @param {EmulatedRegExpOptions} [options]
      */
-    constructor(pattern: string, flags?: string | undefined, options?: EmulatedRegExpOptions | undefined);
+    constructor(pattern: string, flags?: string, options?: EmulatedRegExpOptions);
     /**
      @overload
      @param {EmulatedRegExp} pattern
      @param {string} [flags]
      */
-    constructor(pattern: EmulatedRegExp, flags?: string | undefined);
+    constructor(pattern: EmulatedRegExp, flags?: string);
     /**
     Can be used to serialize the instance.
     @type {EmulatedRegExpOptions}

package/node_modules/oniguruma-to-es/dist/cjs/transform.d.ts

@@ -1,4 +1,4 @@
-export type RegexPlusAst = OnigurumaAst & {
+export type RegexPlusAst = createAlternative & {
     options: {
         disable: {
             [key: string]: boolean;
@@ -7,7 +7,7 @@ export type RegexPlusAst = OnigurumaAst & {
             [key: string]: boolean;
         };
     };
-    _originMap: Map<CapturingGroupNode, CapturingGroupNode>;
+    _originMap: Map<createAlternative, createAlternative>;
     _strategy: string | null;
 };
 /**
@@ -44,11 +44,9 @@ AST represents what's needed to precisely reproduce Oniguruma behavior using Reg
 }} [options]
 @returns {RegexPlusAst}
 */
-export function transform(ast: OnigurumaAst, options?: {
+export function transform(ast: createAlternative, options?: {
     accuracy?: "default" | "strict";
     asciiWordBoundaries?: boolean;
     avoidSubclass?: boolean;
     bestEffortTarget?: "auto" | "ES2025" | "ES2024" | "ES2018";
 }): RegexPlusAst;
-import type { OnigurumaAst } from 'oniguruma-parser/parser';
-import type { CapturingGroupNode } from 'oniguruma-parser/parser';

package/node_modules/oniguruma-to-es/dist/cjs/unicode.d.ts

@@ -1,6 +1,6 @@
 export const asciiSpaceChar: "[\t-\r ]";
 export const defaultWordChar: string;
 export function getIgnoreCaseMatchChars(char: any): any[];
-export const JsUnicodePropertyMap: Map<string, string>;
+export const JsUnicodePropertyMap: Map<any, string>;
 export const PosixClassMap: Map<string, string>;
 export const UnicodePropertiesWithSpecificCase: Set<string>;

package/node_modules/oniguruma-to-es/dist/esm/generate.d.ts

@@ -19,7 +19,7 @@ Generates a Regex+ compatible `pattern`, `flags`, and `options` from a Regex+ AS
 export function generate(ast: RegexPlusAst, options?: ToRegExpOptions): {
     pattern: string;
     flags: string;
-    options: Object;
+    options: any;
     _captureTransfers: Map<number, Array<number>>;
     _hiddenCaptures: Array<number>;
 };

package/node_modules/oniguruma-to-es/dist/esm/index.js

@@ -758,9 +758,7 @@ var SecondPassVisitor = {
       }
     },
     exit({ node }, { openRefs }) {
-      if (openRefs.get(node.number) === node) {
-        openRefs.delete(node.number);
-      }
+      openRefs.delete(node.number);
     }
   },
   Group: {

package/node_modules/oniguruma-to-es/dist/esm/subclass.d.ts

@@ -23,13 +23,13 @@ export class EmulatedRegExp extends RegExp {
      @param {string} [flags]
      @param {EmulatedRegExpOptions} [options]
      */
-    constructor(pattern: string, flags?: string | undefined, options?: EmulatedRegExpOptions | undefined);
+    constructor(pattern: string, flags?: string, options?: EmulatedRegExpOptions);
     /**
      @overload
      @param {EmulatedRegExp} pattern
      @param {string} [flags]
      */
-    constructor(pattern: EmulatedRegExp, flags?: string | undefined);
+    constructor(pattern: EmulatedRegExp, flags?: string);
     /**
     Can be used to serialize the instance.
     @type {EmulatedRegExpOptions}

package/node_modules/oniguruma-to-es/dist/esm/transform.d.ts

@@ -1,4 +1,4 @@
-export type RegexPlusAst = OnigurumaAst & {
+export type RegexPlusAst = createAlternative & {
     options: {
         disable: {
             [key: string]: boolean;
@@ -7,7 +7,7 @@ export type RegexPlusAst = OnigurumaAst & {
             [key: string]: boolean;
         };
     };
-    _originMap: Map<CapturingGroupNode, CapturingGroupNode>;
+    _originMap: Map<createAlternative, createAlternative>;
     _strategy: string | null;
 };
 /**
@@ -44,11 +44,9 @@ AST represents what's needed to precisely reproduce Oniguruma behavior using Reg
 }} [options]
 @returns {RegexPlusAst}
 */
-export function transform(ast: OnigurumaAst, options?: {
+export function transform(ast: createAlternative, options?: {
     accuracy?: "default" | "strict";
     asciiWordBoundaries?: boolean;
     avoidSubclass?: boolean;
     bestEffortTarget?: "auto" | "ES2025" | "ES2024" | "ES2018";
 }): RegexPlusAst;
-import type { OnigurumaAst } from 'oniguruma-parser/parser';
-import type { CapturingGroupNode } from 'oniguruma-parser/parser';

package/node_modules/oniguruma-to-es/dist/esm/unicode.d.ts

@@ -1,6 +1,6 @@
 export const asciiSpaceChar: "[\t-\r ]";
 export const defaultWordChar: string;
 export function getIgnoreCaseMatchChars(char: any): any[];
-export const JsUnicodePropertyMap: Map<string, string>;
+export const JsUnicodePropertyMap: Map<any, string>;
 export const PosixClassMap: Map<string, string>;
 export const UnicodePropertiesWithSpecificCase: Set<string>;