@rotki/eslint-config 4.2.1 → 4.4.0

package/dist/index.js

@@ -3589,7 +3589,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		return Array.isArray(m$3) || m$3 instanceof Set || m$3 instanceof d$2 ? m$3 : new d$2(m$3);
 	}
 	function* _$1(m$3) {
-		const n$3 = e$2(m$3).map(g$2), i$3 = n$3.map((m$4) => m$4[Symbol.iterator]()), a$3 = [];
+		const n$3 = e$2(m$3).map(g$2), i$3 = n$3.map(((m$4) => m$4[Symbol.iterator]())), a$3 = [];
 		for (const m$4 of i$3) {
 			const n$4 = m$4.next();
 			if (n$4.done) return;
@@ -3630,7 +3630,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					case "Concatenation": throw new Error("A concatenation cannot be parent of a concatenation.");
 					default: throw h$2(n$3);
 				}
-				m$3.elements.forEach((n$4) => v$2(n$4, m$3));
+				m$3.elements.forEach(((n$4) => v$2(n$4, m$3)));
 				break;
 			case "Alternation":
 			case "Assertion":
@@ -3639,11 +3639,11 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			case "Unknown":
 				if (null === n$3) throw new Error(`The parent of a(n) ${m$3.type} cannot be null.`);
 				if ("Concatenation" !== n$3.type) throw new Error(`A(n) ${n$3.type} cannot be parent of a(n) ${m$3.type}.`);
-				m$3.parent = n$3, "CharacterClass" !== m$3.type && "Unknown" !== m$3.type && m$3.alternatives.forEach((n$4) => v$2(n$4, m$3));
+				m$3.parent = n$3, "CharacterClass" !== m$3.type && "Unknown" !== m$3.type && m$3.alternatives.forEach(((n$4) => v$2(n$4, m$3)));
 				break;
 			case "Expression":
 				if (null !== n$3) throw new Error(`The parent of an expression has to be null and cannot be a(n) ${n$3.type}.`);
-				m$3.parent = null, m$3.alternatives.forEach((n$4) => v$2(n$4, m$3));
+				m$3.parent = null, m$3.alternatives.forEach(((n$4) => v$2(n$4, m$3)));
 				break;
 			default: throw h$2(m$3);
 		}
@@ -3669,13 +3669,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		switch (m$3.type) {
 			case "Concatenation":
-				m$3.elements.forEach((m$4) => S$2(m$4, n$3, i$3));
+				m$3.elements.forEach(((m$4) => S$2(m$4, n$3, i$3)));
 				break;
 			case "Alternation":
 			case "Assertion":
 			case "Expression":
 			case "Quantifier":
-				m$3.alternatives.forEach((m$4) => S$2(m$4, n$3, i$3));
+				m$3.alternatives.forEach(((m$4) => S$2(m$4, n$3, i$3)));
 				break;
 			case "CharacterClass":
 			case "Unknown": break;
@@ -3749,13 +3749,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	function N$1({ transformer: m$3, ast: n$3, maxCharacter: i$3, events: a$3 }) {
 		let x$3, e$3 = !1;
 		const t$3 = m$3 instanceof k$1 ? m$3.transformers : [m$3], r$3 = {
-			onAlternation: t$3.filter((m$4) => m$4.onAlternation),
-			onAssertion: t$3.filter((m$4) => m$4.onAssertion),
-			onCharacterClass: t$3.filter((m$4) => m$4.onCharacterClass),
-			onConcatenation: t$3.filter((m$4) => m$4.onConcatenation),
-			onExpression: t$3.filter((m$4) => m$4.onExpression),
-			onQuantifier: t$3.filter((m$4) => m$4.onQuantifier),
-			onUnknown: t$3.filter((m$4) => m$4.onUnknown)
+			onAlternation: t$3.filter(((m$4) => m$4.onAlternation)),
+			onAssertion: t$3.filter(((m$4) => m$4.onAssertion)),
+			onCharacterClass: t$3.filter(((m$4) => m$4.onCharacterClass)),
+			onConcatenation: t$3.filter(((m$4) => m$4.onConcatenation)),
+			onExpression: t$3.filter(((m$4) => m$4.onExpression)),
+			onQuantifier: t$3.filter(((m$4) => m$4.onQuantifier)),
+			onUnknown: t$3.filter(((m$4) => m$4.onUnknown))
 		};
 		if (null == a$3 ? void 0 : a$3.onChange) {
 			let m$4 = !1;
@@ -3980,7 +3980,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				i$3.push(m$4);
 			}
 			var a$3;
-			return (a$3 = i$3).sort((m$4, n$4) => m$4.min - n$4.min), F$1(a$3), new I$1(this.maximum, i$3);
+			return (a$3 = i$3).sort(((m$4, n$4) => m$4.min - n$4.min)), F$1(a$3), new I$1(this.maximum, i$3);
 		}
 		intersect(m$3) {
 			let n$3;
@@ -4142,7 +4142,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	var V$1 = class {
 		constructor(m$3) {
 			this.sets = function(m$4) {
-				const n$3 = [...t$2(m$4)].filter((m$5) => !m$5.isEmpty).sort((m$5, n$4) => m$5.compare(n$4)).filter((m$5, n$4, i$4) => 0 === n$4 || !m$5.equals(i$4[n$4 - 1]));
+				const n$3 = [...t$2(m$4)].filter(((m$5) => !m$5.isEmpty)).sort(((m$5, n$4) => m$5.compare(n$4))).filter(((m$5, n$4, i$4) => 0 === n$4 || !m$5.equals(i$4[n$4 - 1])));
 				if (0 === n$3.length) return n$3;
 				if (1 === n$3.length) return n$3;
 				const i$3 = n$3[0].maximum, a$3 = [];
@@ -4155,7 +4155,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					const { min: n$5, max: i$4 } = a$3[m$5];
 					e$3.add(n$5), e$3.add(i$4 + 1);
 				}
-				const r$3 = [...e$3].sort((m$5, n$4) => m$5 - n$4), s$3 = /* @__PURE__ */ new Map();
+				const r$3 = [...e$3].sort(((m$5, n$4) => m$5 - n$4)), s$3 = /* @__PURE__ */ new Map();
 				for (let m$5 = 1, i$4 = r$3.length; m$5 < i$4; m$5++) {
 					const i$5 = r$3[m$5 - 1];
 					if (x$3.has(i$5)) {
@@ -4371,26 +4371,26 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		copy(m$3) {
 			if (!m$3) {
 				const m$4 = new W$1();
-				return m$4._array = this._array.map((m$5) => ({
+				return m$4._array = this._array.map(((m$5) => ({
 					range: m$5.range,
 					value: m$5.value
-				})), m$4;
+				}))), m$4;
 			}
 			const n$3 = new W$1();
-			return n$3._array = this._array.map((n$4) => ({
+			return n$3._array = this._array.map(((n$4) => ({
 				range: n$4.range,
 				value: m$3(n$4.value)
-			})), i$2(n$3._array, (m$4, n$4) => !n$4 || n$4.range.max + 1 !== m$4.range.min || n$4.value !== m$4.value || (n$4.range = {
+			}))), i$2(n$3._array, ((m$4, n$4) => !n$4 || n$4.range.max + 1 !== m$4.range.min || n$4.value !== m$4.value || (n$4.range = {
 				min: n$4.range.min,
 				max: m$4.range.max
-			}, !1)), n$3;
+			}, !1))), n$3;
 		}
 		map(m$3) {
 			for (const n$3 of this._array) n$3.value = m$3(n$3.value, n$3.range, this);
-			i$2(this._array, (m$4, n$3) => !n$3 || n$3.range.max + 1 !== m$4.range.min || n$3.value !== m$4.value || (n$3.range = {
+			i$2(this._array, ((m$4, n$3) => !n$3 || n$3.range.max + 1 !== m$4.range.min || n$3.value !== m$4.value || (n$3.range = {
 				min: n$3.range.min,
 				max: m$4.range.max
-			}, !1));
+			}, !1)));
 		}
 		mapRange(m$3, n$3) {
 			const i$3 = [];
@@ -4436,7 +4436,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			this._array = i$3;
 		}
 		filter(m$3) {
-			i$2(this._array, (n$3) => m$3(n$3.value, n$3.range, this));
+			i$2(this._array, ((n$3) => m$3(n$3.value, n$3.range, this)));
 		}
 		invert(m$3) {
 			const n$3 = /* @__PURE__ */ new Map();
@@ -4465,7 +4465,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 	};
 	function Q$1(n$3, i$3, a$3, x$3) {
-		const e$3 = m$2((m$3) => I$1.fromCharacters(x$3, [m$3]));
+		const e$3 = m$2(((m$3) => I$1.fromCharacters(x$3, [m$3])));
 		for (const m$3 of a$3) {
 			let a$4 = n$3.initial;
 			for (const t$3 of m$3) {
@@ -4494,10 +4494,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			}
 			for (const m$4 of n$4) m$4.isFinal = !0;
 		}
-		return l$2(a$3, (n$4, i$4) => {
+		return l$2(a$3, ((n$4, i$4) => {
 			n$4.isFinal && m$3.makeFinal(n$4.builderNode);
 			for (const { to: a$4, via: x$3 } of n$4.out) i$4.push(a$4), m$3.linkNodes(n$4.builderNode, a$4.builderNode, x$3);
-		}), {
+		})), {
 			initial: m$3.initial,
 			stableOut: !0,
 			getOut: (m$4) => m$4,
@@ -4556,7 +4556,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	}
 	function X$1(m$3, n$3) {
 		const i$3 = m$3.getOut;
-		return K$1(m$3, (m$4) => n$3(i$3(m$4)));
+		return K$1(m$3, ((m$4) => n$3(i$3(m$4))));
 	}
 	function Y$1(m$3, n$3) {
 		const i$3 = m$3.getOut;
@@ -4580,10 +4580,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	function im(m$3) {
 		return m$3.stableOut ? m$3 : function(m$4) {
 			const n$3 = /* @__PURE__ */ new Map(), i$3 = m$4.getOut;
-			return K$1(m$4, (m$5) => {
+			return K$1(m$4, ((m$5) => {
 				let a$3 = n$3.get(m$5);
 				return void 0 === a$3 && (a$3 = i$3(m$5), n$3.set(m$5, a$3)), a$3;
-			}, !0);
+			}), !0);
 		}(m$3);
 	}
 	function am(m$3) {
@@ -4623,8 +4623,8 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			for (const n$5 of m$4) i$4.set(n$5, /* @__PURE__ */ new Set());
 			for (const a$4 of m$4) for (const m$5 of n$4(a$4)) i$4.get(m$5).add(a$4);
 			return i$4;
-		}(n$3, m$3.getOut), x$3 = new Set(o$2(i$3, (m$4) => a$3.get(m$4)));
-		return !em(mm(m$3, (m$4) => x$3.has(m$4)));
+		}(n$3, m$3.getOut), x$3 = new Set(o$2(i$3, ((m$4) => a$3.get(m$4))));
+		return !em(mm(m$3, ((m$4) => x$3.has(m$4))));
 	}
 	function rm(m$3, n$3) {
 		const { initial: i$3, getOut: a$3, isFinal: x$3 } = m$3;
@@ -4674,9 +4674,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				if (void 0 === a$5) {
 					let x$4 = function(m$5) {
 						let n$5 = 65535 & m$5.maximum;
-						return m$5.ranges.forEach(({ min: m$6, max: i$6 }) => {
+						return m$5.ranges.forEach((({ min: m$6, max: i$6 }) => {
 							n$5 = 65535 & (31 * n$5 + m$6 ^ 31 * i$6);
-						}), n$5;
+						})), n$5;
 					}(i$5);
 					for (;;) {
 						const e$4 = m$4[x$4];
@@ -4733,10 +4733,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		const { charSets: a$3, ids: x$3 } = function(m$4) {
 			const n$4 = /* @__PURE__ */ new Set(), i$3 = /* @__PURE__ */ new Map();
 			let a$4 = 0;
-			return l$2(m$4.initial, (x$4, e$4) => {
+			return l$2(m$4.initial, ((x$4, e$4) => {
 				i$3.set(x$4, a$4), a$4++;
 				for (const [i$4, a$5] of m$4.getOut(x$4)) n$4.add(a$5), e$4.push(i$4);
-			}), {
+			})), {
 				charSets: n$4,
 				ids: i$3
 			};
@@ -4750,10 +4750,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const o$4 = [];
 			for (const m$4 of a$4) for (const [i$3, a$5] of n$3.getOut(m$4)) a$5.has(e$4) && o$4.push(i$3);
 			return 0 === o$4.length ? void 0 : function(a$5) {
-				a$5.sort((m$4, n$4) => x$3.get(m$4) - x$3.get(n$4)), i$2(a$5, (m$4, n$4) => m$4 !== n$4);
+				a$5.sort(((m$4, n$4) => x$3.get(m$4) - x$3.get(n$4))), i$2(a$5, ((m$4, n$4) => m$4 !== n$4));
 				const e$5 = s$3(a$5);
 				let o$5 = t$3.get(e$5);
-				return void 0 === o$5 && (o$5 = m$3.createNode(), a$5.some((m$4) => n$3.isFinal(m$4)) && m$3.makeFinal(o$5), t$3.set(e$5, o$5), r$3.set(o$5, a$5)), o$5;
+				return void 0 === o$5 && (o$5 = m$3.createNode(), a$5.some(((m$4) => n$3.isFinal(m$4))) && m$3.makeFinal(o$5), t$3.set(e$5, o$5), r$3.set(o$5, a$5)), o$5;
 			}(o$4);
 		}
 		return t$3.set(s$3([n$3.initial]), m$3.initial), r$3.set(m$3.initial, [n$3.initial]), n$3.isFinal(n$3.initial) && m$3.makeFinal(m$3.initial), {
@@ -4823,7 +4823,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				}
 				s$3 = m$5;
 			}
-			return r$3.forEach((m$5) => e$3.set(m$5, !1)), !1;
+			return r$3.forEach(((m$5) => e$3.set(m$5, !1))), !1;
 		}
 		return {
 			initial: i$3,
@@ -4843,15 +4843,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const n$4 = [];
 			for (let e$3 = 0, t$3 = x$3.length; e$3 < t$3; e$3++) {
 				const t$4 = x$3[e$3];
-				null === (a$3 = i$3.get(t$4)) || void 0 === a$3 || a$3.forEach((i$4) => {
+				null === (a$3 = i$3.get(t$4)) || void 0 === a$3 || a$3.forEach(((i$4) => {
 					m$3.has(i$4) || (m$3.set(i$4, !0), n$4.push(i$4));
-				});
+				}));
 			}
 			x$3 = n$4;
 		}
 	}
 	function dm(m$3) {
-		const n$3 = im(X$1(m$3, e$2)), i$3 = [...am(Y$1(n$3, ([m$4]) => m$4))], a$3 = new Map(i$3.map((m$4, n$4) => [m$4, n$4]));
+		const n$3 = im(X$1(m$3, e$2)), i$3 = [...am(Y$1(n$3, (([m$4]) => m$4)))], a$3 = new Map(i$3.map(((m$4, n$4) => [m$4, n$4])));
 		return {
 			stableIter: n$3,
 			states: i$3,
@@ -4874,7 +4874,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		function o$3(m$4) {
 			if (/^[a-zA-Z_]\w*$/.test(m$4)) s$3 += m$4;
 			else {
-				let n$4 = m$4.replace(/[\\"]/g, (m$5) => "\\" + m$5);
+				let n$4 = m$4.replace(/[\\"]/g, ((m$5) => "\\" + m$5));
 				"\\" === n$4[n$4.length - 1] && (n$4 += " "), s$3 += "\"" + n$4 + "\"";
 			}
 		}
@@ -4904,15 +4904,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			if (void 0 === n$4) continue;
 			s$3 += "	", o$3(m$4), s$3 += "=", l$3(n$4), s$3 += ";\n";
 		}
-		return s$3 += "\n	// nodes\n", s$3 += "	null [shape=point];\n", t$3.forEach((m$4, n$4) => {
+		return s$3 += "\n	// nodes\n", s$3 += "	null [shape=point];\n", t$3.forEach(((m$4, n$4) => {
 			s$3 += "	", h$3(n$4), s$3 += " ", c$3(x$3(m$4, r$3)), s$3 += ";\n";
-		}), s$3 += "\n	// edges\n", s$3 += "	null -> n0;\n", t$3.forEach((m$4, n$4) => {
-			e$3.getOut(m$4).forEach(([a$4, x$4], e$4) => {
+		})), s$3 += "\n	// edges\n", s$3 += "	null -> n0;\n", t$3.forEach(((m$4, n$4) => {
+			e$3.getOut(m$4).forEach((([a$4, x$4], e$4) => {
 				s$3 += "	", h$3(n$4), s$3 += " -> ", function(m$5) {
 					s$3 += "n" + r$3.getId(m$5);
 				}(a$4), s$3 += " ", c$3(i$3(x$4, e$4, m$4, a$4, r$3)), s$3 += ";\n";
-			});
-		}), s$3 += "}", s$3;
+			}));
+		})), s$3 += "}", s$3;
 	}
 	const _m = (m$3, n$3) => ({
 		label: String(n$3.getId(m$3)),
@@ -4935,18 +4935,18 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		function o$3(m$4) {
 			r$3 += "n" + m$4;
 		}
-		return r$3 += "flowchart LR\n", r$3 += "%% nodes\n", r$3 += "	null(( ))\n", e$3.forEach((m$4, n$4) => {
+		return r$3 += "flowchart LR\n", r$3 += "%% nodes\n", r$3 += "	null(( ))\n", e$3.forEach(((m$4, n$4) => {
 			r$3 += "	", o$3(n$4), function(m$5) {
 				r$3 += m$5.shape[0], s$3(m$5.label), r$3 += m$5.shape[1];
 			}(a$3(m$4, t$3)), r$3 += "\n";
-		}), r$3 += "\n%% edges\n", r$3 += "	null -.-> n0\n", e$3.forEach((m$4, n$4) => {
-			x$3.getOut(m$4).forEach(([a$4, x$4], e$4) => {
+		})), r$3 += "\n%% edges\n", r$3 += "	null -.-> n0\n", e$3.forEach(((m$4, n$4) => {
+			x$3.getOut(m$4).forEach((([a$4, x$4], e$4) => {
 				var l$3, c$3;
 				r$3 += "	", o$3(n$4), r$3 += " ", l$3 = i$3(x$4, e$4, m$4, a$4, t$3), r$3 += "-".repeat((null !== (c$3 = l$3.length) && void 0 !== c$3 ? c$3 : 1) + 1) + ">", void 0 !== l$3.label && (r$3 += "|", s$3(l$3.label), r$3 += "|"), r$3 += " ", function(m$5) {
 					r$3 += "n" + t$3.getId(m$5);
 				}(a$4), r$3 += "\n";
-			});
-		}), r$3.trim();
+			}));
+		})), r$3.trim();
 	}
 	const ym = (m$3, n$3) => ({
 		label: String(n$3.getId(m$3)),
@@ -5014,8 +5014,8 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			case "Alternation":
 			case "Expression":
 			case "Assertion":
-			case "Quantifier": return m$3.alternatives.some((m$4) => Nm(m$4, n$3, i$3));
-			case "Concatenation": return m$3.elements.some((m$4) => Nm(m$4, n$3, i$3));
+			case "Quantifier": return m$3.alternatives.some(((m$4) => Nm(m$4, n$3, i$3)));
+			case "Concatenation": return m$3.elements.some(((m$4) => Nm(m$4, n$3, i$3)));
 		}
 		return !1;
 	}
@@ -5147,14 +5147,14 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		return "ltr" === m$3 || "ahead" === m$3 ? "rtl" : "ltr";
 	}
 	function Um(m$3, n$3, i$3) {
-		if (Array.isArray(m$3)) return Rm(m$3.map((m$4) => Um(m$4, n$3, i$3)), i$3);
+		if (Array.isArray(m$3)) return Rm(m$3.map(((m$4) => Um(m$4, n$3, i$3))), i$3);
 		switch (m$3.type) {
 			case "Alternation":
 			case "Expression": return Um(m$3.alternatives, n$3, i$3);
 			case "Assertion":
 				if (Tm(m$3.kind) === n$3) {
 					if (m$3.negate) {
-						if (Nm(m$3, (n$4) => n$4 !== m$3 && "Assertion" === n$4.type)) return a$3();
+						if (Nm(m$3, ((n$4) => n$4 !== m$3 && "Assertion" === n$4.type))) return a$3();
 						const e$3 = Um(m$3.alternatives, n$3, i$3), t$3 = Mm(m$3.alternatives);
 						return e$3.empty || !t$3 ? {
 							char: I$1.empty(i$3),
@@ -5296,16 +5296,16 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const p$3 = n$4 = null !== (e$4 = null === (x$4 = a$3.enter) || void 0 === x$4 ? void 0 : x$4.call(a$3, m$4, n$4, i$4)) && void 0 !== e$4 ? e$4 : n$4;
 			if (null === (s$3 = null === (r$3 = a$3.continueInto) || void 0 === r$3 ? void 0 : r$3.call(a$3, m$4, n$4, i$4)) || void 0 === s$3 || s$3) switch (m$4.type) {
 				case "Alternation":
-					n$4 = a$3.join(m$4.alternatives.map((m$5) => t$3(m$5, a$3.fork(n$4, i$4), i$4)), i$4);
+					n$4 = a$3.join(m$4.alternatives.map(((m$5) => t$3(m$5, a$3.fork(n$4, i$4), i$4))), i$4);
 					break;
 				case "Assertion": {
-					const x$5 = Tm(m$4.kind), e$5 = a$3.join(m$4.alternatives.map((m$5) => t$3(m$5, a$3.fork(n$4, i$4), x$5)), x$5);
+					const x$5 = Tm(m$4.kind), e$5 = a$3.join(m$4.alternatives.map(((m$5) => t$3(m$5, a$3.fork(n$4, i$4), x$5))), x$5);
 					n$4 = null !== (l$3 = null === (o$3 = a$3.endPath) || void 0 === o$3 ? void 0 : o$3.call(a$3, n$4, x$5, "assertion")) && void 0 !== l$3 ? l$3 : n$4, n$4 = null !== (h$3 = null === (c$3 = a$3.assert) || void 0 === c$3 ? void 0 : c$3.call(a$3, n$4, i$4, e$5, x$5)) && void 0 !== h$3 ? h$3 : n$4;
 					break;
 				}
 				case "Quantifier": if (0 === m$4.max);
 				else {
-					const x$5 = m$4.alternatives.map((m$5) => t$3(m$5, a$3.fork(n$4, i$4), i$4));
+					const x$5 = m$4.alternatives.map(((m$5) => t$3(m$5, a$3.fork(n$4, i$4), i$4)));
 					0 === m$4.min && x$5.push(n$4), n$4 = a$3.join(x$5, i$4);
 				}
 			}
@@ -5439,14 +5439,14 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				case "Alternation": return {
 					type: "Alternation",
 					source: Zm(n$3.source),
-					alternatives: n$3.alternatives.map((m$5) => Xm(m$5))
+					alternatives: n$3.alternatives.map(((m$5) => Xm(m$5)))
 				};
 				case "Assertion": return {
 					type: "Assertion",
 					kind: n$3.kind,
 					negate: n$3.negate,
 					source: Zm(n$3.source),
-					alternatives: n$3.alternatives.map((m$5) => Xm(m$5))
+					alternatives: n$3.alternatives.map(((m$5) => Xm(m$5)))
 				};
 				case "CharacterClass": return {
 					type: "CharacterClass",
@@ -5456,12 +5456,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				case "Concatenation": return {
 					type: "Concatenation",
 					source: Zm(n$3.source),
-					elements: n$3.elements.map((m$5) => Xm(m$5))
+					elements: n$3.elements.map(((m$5) => Xm(m$5)))
 				};
 				case "Expression": return {
 					type: "Expression",
 					source: Zm(n$3.source),
-					alternatives: n$3.alternatives.map((m$5) => Xm(m$5))
+					alternatives: n$3.alternatives.map(((m$5) => Xm(m$5)))
 				};
 				case "Quantifier": return {
 					type: "Quantifier",
@@ -5469,7 +5469,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					min: n$3.min,
 					max: n$3.max,
 					source: Zm(n$3.source),
-					alternatives: n$3.alternatives.map((m$5) => Xm(m$5))
+					alternatives: n$3.alternatives.map(((m$5) => Xm(m$5)))
 				};
 				case "Unknown": return {
 					type: "Unknown",
@@ -5487,8 +5487,8 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			case "Alternation":
 			case "Assertion":
 			case "Expression":
-			case "Quantifier": return m$3.alternatives.reduce((m$4, n$3) => m$4 + Ym(n$3), 1);
-			case "Concatenation": return m$3.elements.reduce((m$4, n$3) => m$4 + Ym(n$3), 1);
+			case "Quantifier": return m$3.alternatives.reduce(((m$4, n$3) => m$4 + Ym(n$3)), 1);
+			case "Concatenation": return m$3.elements.reduce(((m$4, n$3) => m$4 + Ym(n$3)), 1);
 			default: return h$2(m$3);
 		}
 	}
@@ -5499,8 +5499,8 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			case "Alternation":
 			case "Assertion":
 			case "Expression":
-			case "Quantifier": return m$3.alternatives.reduce((m$4, n$3) => Math.max(m$4, mn(n$3)), 0) + 1;
-			case "Concatenation": return m$3.elements.reduce((m$4, n$3) => Math.max(m$4, mn(n$3)), 0) + 1;
+			case "Quantifier": return m$3.alternatives.reduce(((m$4, n$3) => Math.max(m$4, mn(n$3))), 0) + 1;
+			case "Concatenation": return m$3.elements.reduce(((m$4, n$3) => Math.max(m$4, mn(n$3))), 0) + 1;
 			default: return h$2(m$3);
 		}
 	}
@@ -5570,7 +5570,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 							const s$3 = Um(m$4.alternatives, x$3, e$3);
 							if (s$3.empty) return 2;
 							if (n$3.isDisjointWith(s$3.char)) return i$3;
-							if (!Nm(m$4, (n$4) => n$4 !== m$4 && "Assertion" === n$4.type)) {
+							if (!Nm(m$4, ((n$4) => n$4 !== m$4 && "Assertion" === n$4.type))) {
 								const i$4 = Mm(m$4.alternatives);
 								if (i$4 && 1 === i$4.max && s$3.exact && n$3.isSubsetOf(s$3.char)) return r$4;
 							}
@@ -5590,7 +5590,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				default: h$2(m$4);
 			}
 		}
-		return i$2(m$3.alternatives, (m$4) => {
+		return i$2(m$3.alternatives, ((m$4) => {
 			const n$4 = "ltr" === x$3 ? 1 : -1;
 			for (let i$3 = "ltr" === x$3 ? 0 : -1; en(m$4.elements, i$3); i$3 += n$4) {
 				const a$4 = an(m$4.elements, i$3), x$4 = r$3(a$4);
@@ -5605,7 +5605,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				}
 			}
 			return !0;
-		}), t$3;
+		})), t$3;
 	}
 	function hn(m$3, n$3) {
 		return "rtl" === m$3 && n$3.reverse(), n$3;
@@ -5624,7 +5624,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				const m$4 = a$4.elements[0];
 				"CharacterClass" === m$4.type && (n$3.characters = n$3.characters.without(m$4.characters), i$3.signalMutation(), x$3.add(a$4));
 			}
-			if (x$3.size > 0) return m$3.alternatives = m$3.alternatives.filter((m$4) => !x$3.has(m$4)), i$3.signalMutation(), hn(Tm(m$3.kind), [m$3, n$3]);
+			if (x$3.size > 0) return m$3.alternatives = m$3.alternatives.filter(((m$4) => !x$3.has(m$4))), i$3.signalMutation(), hn(Tm(m$3.kind), [m$3, n$3]);
 			for (const x$4 of m$3.alternatives) {
 				const { elements: e$3 } = x$4, t$3 = tn(a$3), r$3 = nn(e$3, t$3);
 				if (r$3 && dn(r$3)) {
@@ -5634,7 +5634,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 						type: "Assertion",
 						negate: m$3.negate,
 						kind: m$3.kind,
-						alternatives: m$3.alternatives.filter((m$4) => m$4 !== x$4).map(Xm),
+						alternatives: m$3.alternatives.filter(((m$4) => m$4 !== x$4)).map(Xm),
 						source: Zm(m$3.source)
 					}];
 					if (s$3.isSupersetOf(n$3.characters)) return hn(a$3, [
@@ -5710,7 +5710,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const r$3 = gn(m$3, t$3 + e$3, e$3);
 			if (void 0 === r$3) continue;
 			let s$3 = pn(x$4, _n(r$3), i$3);
-			void 0 === s$3 ? Om(x$4) && (i$3.signalMutation(), m$3.splice(t$3, 1), t$3 -= e$3) : (i$3.signalMutation(), m$3.splice(t$3, 1), t$3 -= e$3, s$3 = s$3.filter((m$4) => "Assertion" !== m$4.type || !Om(m$4)), "Quantifier" === r$3.type && (r$3.min--, r$3.max--, un(a$3, s$3, r$3)), m$3.splice(m$3.indexOf(r$3), 1, ...s$3));
+			void 0 === s$3 ? Om(x$4) && (i$3.signalMutation(), m$3.splice(t$3, 1), t$3 -= e$3) : (i$3.signalMutation(), m$3.splice(t$3, 1), t$3 -= e$3, s$3 = s$3.filter(((m$4) => "Assertion" !== m$4.type || !Om(m$4))), "Quantifier" === r$3.type && (r$3.min--, r$3.max--, un(a$3, s$3, r$3)), m$3.splice(m$3.indexOf(r$3), 1, ...s$3));
 		}
 	}
 	function yn(m$3, n$3, i$3) {
@@ -5816,7 +5816,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				f$3 = wn(u$3), a$3.signalMutation(), xn(m$3, h$3, f$3);
 			}
 			const p$3 = "CharacterClass" === (o$3 = c$3).type ? o$3.characters : o$3.alternatives[0].elements[0].characters, d$3 = /* @__PURE__ */ new Map();
-			if (i$2(f$3.alternatives, (m$4) => {
+			if (i$2(f$3.alternatives, ((m$4) => {
 				const n$5 = s$3(m$4);
 				if (void 0 !== n$5) {
 					const i$3 = Cn(n$5);
@@ -5827,7 +5827,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					return d$3.set(m$4, p$3), !0;
 				}
 				return !0;
-			}), d$3.size > 0) {
+			})), d$3.size > 0) {
 				a$3.signalMutation();
 				for (const m$4 of f$3.alternatives) un(e$3, m$4.elements, {
 					type: "CharacterClass",
@@ -5868,7 +5868,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				const m$4 = Vm(Um(s$3.alternatives, x$3, a$3.maxCharacter));
 				m$4.edge || (h$3 = m$4.char, u$3 = !0);
 			}
-			i$2(c$3.alternatives, (m$4) => {
+			i$2(c$3.alternatives, ((m$4) => {
 				if (h$3) {
 					const n$4 = Um(m$4, x$3, a$3.maxCharacter);
 					if (!n$4.empty) {
@@ -5877,7 +5877,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					}
 				}
 				return fn(x$3, m$4.elements, Xm(s$3)), !0;
-			});
+			}));
 		}
 	}
 	function On(m$3, n$3, i$3) {
@@ -5930,7 +5930,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const n$4 = rn(Dm(x$3));
 			for (let e$4 = tn(Dm(x$3)); en(m$3.elements, e$4); e$4 += n$4) {
 				const n$5 = an(m$3.elements, e$4);
-				if ("Assertion" === n$5.type && n$5.kind === i$3 && (sn(n$5) || 1 === (a$4 = n$5).alternatives.length && a$4.alternatives[0].elements.length >= 2 && a$4.alternatives[0].elements.every((m$4) => "CharacterClass" === m$4.type))) return n$5;
+				if ("Assertion" === n$5.type && n$5.kind === i$3 && (sn(n$5) || 1 === (a$4 = n$5).alternatives.length && a$4.alternatives[0].elements.length >= 2 && a$4.alternatives[0].elements.every(((m$4) => "CharacterClass" === m$4.type)))) return n$5;
 				if (!Sm(n$5)) break;
 			}
 			var a$4;
@@ -5938,7 +5938,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			type: "Alternation",
 			alternatives: [m$3],
 			source: Zm(m$3.source)
-		}, r$3 = m$2((m$3) => {
+		}, r$3 = m$2(((m$3) => {
 			const n$4 = [];
 			for (const i$4 of m$3.elements) {
 				if ("CharacterClass" !== i$4.type) break;
@@ -5952,7 +5952,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				chars: n$4,
 				after: Vm(Um(m$3, "ltr", a$3.maxCharacter))
 			};
-		}), s$3 = m$2((m$3) => {
+		})), s$3 = m$2(((m$3) => {
 			const n$4 = [];
 			for (let i$4 = 0; i$4 < m$3.elements.length; i$4++) {
 				const a$4 = m$3.elements[m$3.elements.length - i$4 - 1];
@@ -5967,7 +5967,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				chars: n$4,
 				after: Vm(Um(m$3, "rtl", a$3.maxCharacter))
 			};
-		}), o$3 = (m$3, n$4) => {
+		})), o$3 = (m$3, n$4) => {
 			const i$4 = Math.min(m$3.chars.length, n$4.chars.length);
 			for (let a$5 = 0; a$5 < i$4; a$5++) if (m$3.chars[a$5].isDisjointWith(n$4.chars[a$5])) return !0;
 			let a$4, x$4;
@@ -5982,13 +5982,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			} : n$4.after, l$3(a$4, x$4);
 		}, l$3 = (m$3, n$4) => !(m$3.edge && n$4.edge) && m$3.char.isDisjointWith(n$4.char), c$3 = (m$3, n$4) => {
 			const i$4 = Mm(m$3);
-			return n$4.every((n$5) => {
+			return n$4.every(((n$5) => {
 				if (i$4 && i$4.min === i$4.max) {
 					const m$4 = Mm(n$5);
 					if (m$4 && m$4.min === m$4.max && i$4.min === m$4.min) return !0;
 				}
 				return o$3(r$3(m$3), r$3(n$5)) && o$3(s$3(m$3), s$3(n$5));
-			});
+			}));
 		};
 		for (let m$3 = 0; m$3 < n$3.length; m$3++) {
 			const i$4 = n$3[m$3];
@@ -6015,7 +6015,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				const m$4 = Xm(i$4);
 				m$4.max = m$4.min, m$4.lazy = !1, l$4.push(m$4), i$4.min = 0;
 			}
-			const f$3 = i$4.alternatives.filter((m$4) => m$4 !== r$4), p$3 = r$4;
+			const f$3 = i$4.alternatives.filter(((m$4) => m$4 !== r$4)), p$3 = r$4;
 			p$3.elements.splice(p$3.elements.indexOf(o$4), 1);
 			const d$3 = {
 				type: "Concatenation",
@@ -6193,15 +6193,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			if (m$4.alternatives.length < 2) return;
 			const { prefix: t$3, suffix: r$3 } = function(m$5) {
 				let n$4 = 0, i$3 = 0;
-				const a$5 = x$2(m$5.alternatives, (m$6) => m$6.elements.length).elements;
+				const a$5 = x$2(m$5.alternatives, ((m$6) => m$6.elements.length)).elements;
 				for (let i$4 = 0; i$4 < a$5.length; i$4++) {
 					const x$3 = a$5[i$4];
-					if (!m$5.alternatives.every((m$6) => Hm(x$3, m$6.elements[i$4]))) break;
+					if (!m$5.alternatives.every(((m$6) => Hm(x$3, m$6.elements[i$4])))) break;
 					n$4++;
 				}
 				for (let x$3 = 0; x$3 < a$5.length - n$4; x$3++) {
 					const n$5 = a$5[a$5.length - 1 - x$3];
-					if (!m$5.alternatives.every((m$6) => Hm(n$5, m$6.elements[m$6.elements.length - 1 - x$3]))) break;
+					if (!m$5.alternatives.every(((m$6) => Hm(n$5, m$6.elements[m$6.elements.length - 1 - x$3])))) break;
 					i$3++;
 				}
 				return {
@@ -6239,7 +6239,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 						const o$3 = /* @__PURE__ */ new Set();
 						let l$3 = !1;
 						if (a$5) for (const n$5 of s$4.alternatives) {
-							const i$3 = m$5.alternatives.find((m$6) => Hm(n$5, m$6));
+							const i$3 = m$5.alternatives.find(((m$6) => Hm(n$5, m$6)));
 							if (!i$3) break;
 							o$3.add(i$3);
 						}
@@ -6262,7 +6262,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 							}
 						}
 						if (o$3.size !== s$4.alternatives.length) continue;
-						o$3.has(r$4), n$4.signalMutation(), i$2(m$5.alternatives, (m$6) => !o$3.has(m$6));
+						o$3.has(r$4), n$4.signalMutation(), i$2(m$5.alternatives, ((m$6) => !o$3.has(m$6)));
 						const c$3 = {
 							type: "Quantifier",
 							lazy: l$3,
@@ -6270,12 +6270,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 							max: 1,
 							alternatives: [{
 								type: "Concatenation",
-								elements: r$4.elements.filter((m$6) => m$6 !== s$4),
+								elements: r$4.elements.filter(((m$6) => m$6 !== s$4)),
 								source: Zm(r$4.source)
 							}],
 							source: Zm(r$4.source)
 						};
-						i$2(r$4.elements, (m$6) => m$6 === s$4), "ltr" === x$4 ? r$4.elements.push(c$3) : r$4.elements.unshift(c$3);
+						i$2(r$4.elements, ((m$6) => m$6 === s$4)), "ltr" === x$4 ? r$4.elements.push(c$3) : r$4.elements.unshift(c$3);
 					}
 				}
 				m$5.alternatives.length < 3 || (x$3("ltr"), x$3("rtl"));
@@ -6385,12 +6385,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	function Gn(m$3) {
 		const { ignoreAmbiguity: n$3 = !1, ignoreOrder: a$3 = !1 } = null != m$3 ? m$3 : {};
 		function x$3(m$4, x$4, e$3) {
-			"rtl" === x$4 && m$4.reverse(), i$2(m$4, (m$5, n$4) => !n$4 || "Quantifier" !== n$4.type || !$m(n$4, m$5) || (n$4.min++, n$4.max++, e$3.signalMutation(), !1));
+			"rtl" === x$4 && m$4.reverse(), i$2(m$4, ((m$5, n$4) => !n$4 || "Quantifier" !== n$4.type || !$m(n$4, m$5) || (n$4.min++, n$4.max++, e$3.signalMutation(), !1)));
 			for (let n$4 = 0; n$4 < m$4.length; n$4++) {
 				const i$3 = m$4[n$4];
 				if ("Quantifier" === i$3.type && 1 === i$3.alternatives.length) {
 					const a$4 = i$3.alternatives[0];
-					a$4.elements.length >= 2 && n$4 + 1 + a$4.elements.length <= m$4.length && a$4.elements.every((i$4, e$4) => ("rtl" === x$4 && (e$4 = a$4.elements.length - 1 - e$4), Hm(i$4, m$4[n$4 + 1 + e$4]))) && (e$3.signalMutation(), i$3.min++, i$3.max++, m$4.splice(n$4 + 1, a$4.elements.length), n$4--);
+					a$4.elements.length >= 2 && n$4 + 1 + a$4.elements.length <= m$4.length && a$4.elements.every(((i$4, e$4) => ("rtl" === x$4 && (e$4 = a$4.elements.length - 1 - e$4), Hm(i$4, m$4[n$4 + 1 + e$4])))) && (e$3.signalMutation(), i$3.min++, i$3.max++, m$4.splice(n$4 + 1, a$4.elements.length), n$4--);
 				}
 			}
 			if (n$3) for (let n$4 = 1; n$4 < m$4.length; n$4++) {
@@ -6403,7 +6403,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			name: "mergeWithQuantifier",
 			onConcatenation(m$4, e$3) {
 				const t$3 = m$4.elements, { signalMutation: r$3 } = e$3;
-				x$3(t$3, "ltr", e$3), x$3(t$3, "rtl", e$3), i$2(t$3, (m$5, i$3) => {
+				x$3(t$3, "ltr", e$3), x$3(t$3, "rtl", e$3), i$2(t$3, ((m$5, i$3) => {
 					if (i$3 && "Quantifier" === i$3.type && "Quantifier" === m$5.type) {
 						const x$4 = i$3.min === i$3.max, e$4 = m$5.min === m$5.max;
 						if (!n$3 && !x$4 && !e$4) return !0;
@@ -6411,21 +6411,21 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 						if (Hm(i$3.alternatives, m$5.alternatives)) return i$3.min += m$5.min, i$3.max += m$5.max, r$3(), !1;
 					}
 					return !0;
-				});
+				}));
 			}
 		};
 	}
 	function Rn(m$3, { signalMutation: n$3 }) {
 		if (m$3.alternatives.length < 2) return;
 		let a$3 = !1, x$3 = !0;
-		i$2(m$3.alternatives, (m$4) => {
+		i$2(m$3.alternatives, ((m$4) => {
 			if (wm(m$4)) return n$3(), a$3 = !0, !1;
 			if (1 === m$4.elements.length) {
 				const i$3 = m$4.elements[0];
 				if ("Quantifier" === i$3.type && 0 === i$3.min && i$3.max > 0) return n$3(), a$3 = !0, i$3.min = 1, 1 === i$3.max && 1 === i$3.alternatives.length && (m$4.elements = i$3.alternatives[0].elements), !0;
 			}
 			return km(m$4) && (x$3 = !1), !0;
-		}), a$3 && x$3 && function(m$4, n$4) {
+		})), a$3 && x$3 && function(m$4, n$4) {
 			if (0 === m$4.length) return void m$4.push({
 				type: "Concatenation",
 				elements: [],
@@ -6588,12 +6588,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	function Kn(m$3) {
 		switch (m$3.type) {
 			case "Alternation":
-			case "Expression": return m$3.alternatives.every((m$4) => Kn(m$4));
+			case "Expression": return m$3.alternatives.every(((m$4) => Kn(m$4)));
 			case "Assertion":
 			case "Unknown": return !1;
 			case "CharacterClass": return m$3.characters.isEmpty;
 			case "Concatenation": return 1 === m$3.elements.length && Kn(m$3.elements[0]);
-			case "Quantifier": return m$3.min > 0 && m$3.alternatives.every((m$4) => Kn(m$4));
+			case "Quantifier": return m$3.min > 0 && m$3.alternatives.every(((m$4) => Kn(m$4)));
 			default: h$2(m$3);
 		}
 	}
@@ -6601,7 +6601,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		let i$3 = null;
 		for (let a$3 = 0; a$3 < m$3.elements.length && !i$3; a$3++) {
 			const x$3 = m$3.elements[a$3];
-			"Quantifier" === x$3.type ? x$3.alternatives.every((m$4) => Kn(m$4)) && (0 === x$3.min ? (m$3.elements.splice(a$3, 1), n$3(), a$3--) : i$3 = x$3) : Kn(x$3) && (i$3 = x$3);
+			"Quantifier" === x$3.type ? x$3.alternatives.every(((m$4) => Kn(m$4))) && (0 === x$3.min ? (m$3.elements.splice(a$3, 1), n$3(), a$3--) : i$3 = x$3) : Kn(x$3) && (i$3 = x$3);
 		}
 		i$3 && m$3.elements.length > 1 && (m$3.elements = [i$3], n$3());
 	}
@@ -6629,7 +6629,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		const t$3 = Um(m$3.alternatives, e$3, i$3.maxCharacter);
 		if (t$3.empty) return 2;
 		if (n$3.char.isDisjointWith(t$3.char)) return x$3;
-		if (!Nm(m$3, (n$4) => n$4 !== m$3 && "Assertion" === n$4.type)) {
+		if (!Nm(m$3, ((n$4) => n$4 !== m$3 && "Assertion" === n$4.type))) {
 			const i$4 = Mm(m$3.alternatives);
 			if (i$4 && 1 === i$4.max && t$3.exact && n$3.char.isSubsetOf(t$3.char)) return a$3;
 		}
@@ -6751,11 +6751,11 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					m$5.alternatives.forEach(e$3);
 				})(m$4, n$3), function(m$5, n$4) {
 					if (2 !== m$5.alternatives.length) return;
-					const i$3 = m$5.alternatives.findIndex((m$6) => 1 === m$6.elements.length && "CharacterClass" === m$6.elements[0].type), a$3 = m$5.alternatives.findIndex((n$5) => {
+					const i$3 = m$5.alternatives.findIndex(((m$6) => 1 === m$6.elements.length && "CharacterClass" === m$6.elements[0].type)), a$3 = m$5.alternatives.findIndex(((n$5) => {
 						if (1 !== n$5.elements.length) return !1;
 						const i$4 = n$5.elements[0];
 						return "Assertion" === i$4.type && i$4.kind === m$5.kind && i$4.negate && sn(i$4) && i$4.alternatives[0].elements[0].characters.isAll;
-					});
+					}));
 					if (-1 === i$3 || -1 === a$3) return;
 					n$4.signalMutation(), m$5.alternatives.splice(a$3, 1), sn(m$5);
 					const x$3 = m$5.alternatives[0].elements[0];
@@ -6782,7 +6782,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					onAlternationLeave: x$3,
 					onAssertionLeave: x$3,
 					onConcatenationLeave(m$5) {
-						ai(m$5, (m$6) => ii(i$3, m$6, n$3), n$3), x$3();
+						ai(m$5, ((m$6) => ii(i$3, m$6, n$3)), n$3), x$3();
 					},
 					onExpressionLeave: x$3,
 					onQuantifierLeave: x$3
@@ -6791,7 +6791,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		};
 	}
 	function ri(m$3, n$3) {
-		i$2(m$3.alternatives, (m$4) => !m$4.elements.some((m$5) => "Assertion" === m$5.type) || (n$3.signalMutation(), !1));
+		i$2(m$3.alternatives, ((m$4) => !m$4.elements.some(((m$5) => "Assertion" === m$5.type)) || (n$3.signalMutation(), !1)));
 	}
 	function si(m$3, n$3) {
 		return m$3.kind !== n$3.kind ? "ahead" === m$3.kind ? 1 : -1 : 0;
@@ -6825,7 +6825,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const { alternatives: e$3 } = m$4;
 			if (e$3.length < 2) return;
 			let t$3, r$3 = !0;
-			i$2(e$3, (m$5) => {
+			i$2(e$3, ((m$5) => {
 				if (1 === (i$3 = m$5).elements.length && "CharacterClass" === i$3.elements[0].type) {
 					const i$4 = m$5.elements[0];
 					if (void 0 === t$3 || !r$3 && n$3) return t$3 = i$4, !0;
@@ -6837,7 +6837,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				}
 				return r$3 = !1, !0;
 				var i$3;
-			});
+			}));
 		}
 		return {
 			name: "unionCharacters",
@@ -6873,7 +6873,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			return "empty-word" === (null !== (n$3 = null == m$3 ? void 0 : m$3.replacement) && void 0 !== n$3 ? n$3 : "empty-set") ? {
 				name: "replaceAssertions",
 				onConcatenation(m$4, { signalMutation: n$4 }) {
-					i$2(m$4.elements, (m$5) => "Assertion" !== m$5.type || (n$4(), !1));
+					i$2(m$4.elements, ((m$5) => "Assertion" !== m$5.type || (n$4(), !1)));
 				}
 			} : {
 				name: "replaceAssertions",
@@ -7017,10 +7017,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		copy(m$3) {
 			switch (m$3.type) {
-				case "Alternation": return this.alter(m$3.alternatives.map((m$4) => this.copy(m$4)));
-				case "Concatenation": return this.concat(m$3.elements.map((m$4) => this.copy(m$4)));
+				case "Alternation": return this.alter(m$3.alternatives.map(((m$4) => this.copy(m$4))));
+				case "Concatenation": return this.concat(m$3.elements.map(((m$4) => this.copy(m$4))));
 				case "CharacterClass": return this.char(m$3.characters);
-				case "Quantifier": return this.quant(m$3.alternatives.map((m$4) => this.copy(m$4)), m$3.min, m$3.max);
+				case "Quantifier": return this.quant(m$3.alternatives.map(((m$4) => this.copy(m$4))), m$3.min, m$3.max);
 				case "Assertion": throw new Error("Assertions should not have been part of the created regex.");
 				case "Unknown": throw new Error("Unknowns should not have been part of the created regex.");
 				default: throw h$2(m$3);
@@ -7029,7 +7029,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	};
 	function Ci(m$3, n$3, i$3) {
 		const a$3 = m$3.initial, e$3 = r$2(m$3.finals), t$3 = /* @__PURE__ */ new Set();
-		s$2(a$3, (m$4) => (m$4 !== a$3 && m$4 !== e$3 && t$3.add(m$4), m$4.out.keys()));
+		s$2(a$3, ((m$4) => (m$4 !== a$3 && m$4 !== e$3 && t$3.add(m$4), m$4.out.keys())));
 		const o$3 = {
 			maxCharacter: i$3,
 			signalMutation: () => {}
@@ -7132,12 +7132,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		function _$2(m$4) {
 			for (; m$4.size > 0;) {
 				const n$4 = /* @__PURE__ */ new Set();
-				m$4.forEach((m$5) => {
+				m$4.forEach(((m$5) => {
 					if (!t$3.has(m$5)) return;
 					d$3(m$5);
 					const i$4 = g$3(m$5);
-					i$4 && i$4.forEach((m$6) => n$4.add(m$6));
-				}), m$4 = n$4;
+					i$4 && i$4.forEach(((m$6) => n$4.add(m$6)));
+				})), m$4 = n$4;
 			}
 		}
 		function C$3(i$4) {
@@ -7146,33 +7146,33 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const x$3 = m$3.unlinkNodes(i$4, i$4);
 			if (x$3) {
 				const m$4 = f$3(x$3);
-				i$4.in.forEach((a$5, x$4) => {
-					i$4.out.forEach((i$5, e$4) => {
+				i$4.in.forEach(((a$5, x$4) => {
+					i$4.out.forEach(((i$5, e$4) => {
 						l$3(x$4, e$4, h$3(n$3.copy(a$5), h$3(n$3.copy(m$4), n$3.copy(i$5))));
-					});
-				});
-			} else i$4.in.forEach((m$4, a$5) => {
-				i$4.out.forEach((i$5, x$4) => {
+					}));
+				}));
+			} else i$4.in.forEach(((m$4, a$5) => {
+				i$4.out.forEach(((i$5, x$4) => {
 					l$3(a$5, x$4, h$3(n$3.copy(m$4), n$3.copy(i$5)));
-				});
-			});
-			return i$4.in.forEach((n$4, a$5) => {
+				}));
+			}));
+			return i$4.in.forEach(((n$4, a$5) => {
 				m$3.unlinkNodes(a$5, i$4);
-			}), i$4.out.forEach((n$4, a$5) => {
+			})), i$4.out.forEach(((n$4, a$5) => {
 				m$3.unlinkNodes(i$4, a$5);
-			}), t$3.delete(i$4), a$4;
+			})), t$3.delete(i$4), a$4;
 		}
-		for (_$2(t$3); t$3.size > 0;) _$2(C$3(x$2(t$3, (m$4) => m$4.out.has(m$4) ? (m$4.in.size - 1) * (m$4.out.size - 1) * 3 : m$4.in.size * m$4.out.size * 2)));
+		for (_$2(t$3); t$3.size > 0;) _$2(C$3(x$2(t$3, ((m$4) => m$4.out.has(m$4) ? (m$4.in.size - 1) * (m$4.out.size - 1) * 3 : m$4.in.size * m$4.out.size * 2))));
 	}
 	function vi(n$3, i$3) {
 		const a$3 = new _i(i$3), x$3 = function(n$4, i$4) {
 			const a$4 = new gi(), x$4 = a$4.createNode();
 			a$4.linkNodes(a$4.initial, x$4, i$4.emptyConcat());
-			const e$4 = m$2(() => a$4.createNode());
+			const e$4 = m$2((() => a$4.createNode()));
 			let t$4;
-			if (e$4.cache.set(n$4.initial, x$4), s$2(n$4.initial, (m$3) => {
+			if (e$4.cache.set(n$4.initial, x$4), s$2(n$4.initial, ((m$3) => {
 				n$4.isFinal(m$3) && a$4.finals.add(e$4(m$3));
-				const x$5 = [...n$4.getOut(m$3)].sort(([, m$4], [, n$5]) => {
+				const x$5 = [...n$4.getOut(m$3)].sort((([, m$4], [, n$5]) => {
 					if (null === m$4) return null === n$5 ? 0 : -1;
 					if (null === n$5) return 1;
 					const i$5 = Number(m$4.isEmpty) - Number(n$5.isEmpty);
@@ -7183,30 +7183,30 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 						if (a$6.max !== x$6.max) return a$6.max - x$6.max;
 					}
 					return m$4.ranges.length - n$5.ranges.length;
-				});
-				return x$5.forEach(([n$5, x$6]) => {
+				}));
+				return x$5.forEach((([n$5, x$6]) => {
 					if (null === x$6) a$4.linkNodes(e$4(m$3), e$4(n$5), i$4.emptyConcat());
 					else {
 						if (void 0 === t$4) t$4 = x$6.maximum;
 						else if (x$6.maximum !== t$4) throw new Error("All character sets have to have to same maximum.");
 						a$4.linkNodes(e$4(m$3), e$4(n$5), i$4.char(x$6));
 					}
-				}), x$5.map((m$4) => m$4[0]);
-			}), 0 === a$4.finals.size) return null;
+				})), x$5.map(((m$4) => m$4[0]));
+			})), 0 === a$4.finals.size) return null;
 			const r$4 = a$4.createNode();
-			a$4.finals.forEach((m$3) => {
+			a$4.finals.forEach(((m$3) => {
 				a$4.linkNodes(m$3, r$4, i$4.emptyConcat());
-			}), a$4.finals.clear(), a$4.finals.add(r$4);
+			})), a$4.finals.clear(), a$4.finals.add(r$4);
 			const o$4 = /* @__PURE__ */ new Set();
-			s$2(r$4, (m$3) => (o$4.add(m$3), m$3.in.keys()));
+			s$2(r$4, ((m$3) => (o$4.add(m$3), m$3.in.keys())));
 			const l$3 = /* @__PURE__ */ new Set();
-			return s$2(a$4.initial, (m$3) => (o$4.has(m$3) || l$3.add(m$3), m$3.out.keys())), l$3.forEach((m$3) => {
-				m$3.out.forEach((n$5, i$5) => {
+			return s$2(a$4.initial, ((m$3) => (o$4.has(m$3) || l$3.add(m$3), m$3.out.keys()))), l$3.forEach(((m$3) => {
+				m$3.out.forEach(((n$5, i$5) => {
 					a$4.unlinkNodes(m$3, i$5);
-				}), m$3.in.forEach((n$5, i$5) => {
+				})), m$3.in.forEach(((n$5, i$5) => {
 					a$4.unlinkNodes(i$5, m$3);
-				});
-			}), {
+				}));
+			})), {
 				nodeList: a$4,
 				maxCharacter: null != t$4 ? t$4 : 0
 			};
@@ -7229,21 +7229,21 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		return E$2(di, a$3, { maxPasses: null == n$3 ? void 0 : n$3.maxOptimizationPasses });
 	}
 	function Si(m$3, n$3 = String, i$3 = !1) {
-		const a$3 = im(X$1(m$3, (m$4) => {
-			const a$4 = e$2(m$4).map(([m$5, i$4]) => [m$5, n$3(i$4)]);
-			return i$3 || a$4.sort(([, m$5], [, n$4]) => m$5.localeCompare(n$4)), a$4;
-		})), x$3 = [...am(Y$1(a$3, ([m$4]) => m$4))], t$3 = new Map(x$3.map((m$4, n$4) => [m$4, n$4])), r$3 = (m$4) => t$3.get(m$4), s$3 = (m$4) => {
+		const a$3 = im(X$1(m$3, ((m$4) => {
+			const a$4 = e$2(m$4).map((([m$5, i$4]) => [m$5, n$3(i$4)]));
+			return i$3 || a$4.sort((([, m$5], [, n$4]) => m$5.localeCompare(n$4))), a$4;
+		}))), x$3 = [...am(Y$1(a$3, (([m$4]) => m$4)))], t$3 = new Map(x$3.map(((m$4, n$4) => [m$4, n$4]))), r$3 = (m$4) => t$3.get(m$4), s$3 = (m$4) => {
 			const n$4 = r$3(m$4);
 			return a$3.isFinal(m$4) ? `[${n$4}]` : `(${n$4})`;
 		};
-		return x$3.map((m$4) => {
+		return x$3.map(((m$4) => {
 			const n$4 = s$3(m$4), x$4 = a$3.getOut(m$4);
-			if (i$3 || x$4.sort(([m$5], [n$5]) => r$3(m$5) - r$3(n$5)), 0 === x$4.length) return `${n$4} -> none`;
+			if (i$3 || x$4.sort((([m$5], [n$5]) => r$3(m$5) - r$3(n$5))), 0 === x$4.length) return `${n$4} -> none`;
 			{
 				const m$5 = " ".repeat(n$4.length);
-				return x$4.map(([i$4, a$4], x$5) => `${x$5 ? m$5 : n$4} -> ${s$3(i$4)} : ${a$4}`).join("\n");
+				return x$4.map((([i$4, a$4], x$5) => `${x$5 ? m$5 : n$4} -> ${s$3(i$4)} : ${a$4}`)).join("\n");
 			}
-		}).join("\n\n");
+		})).join("\n\n");
 	}
 	function wi(m$3) {
 		const n$3 = [];
@@ -7251,7 +7251,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		return n$3.reverse();
 	}
 	function* ki(m$3) {
-		const { initial: n$3, getOut: i$3, isFinal: a$3 } = im(fm(m$3, (m$4) => m$4[0]));
+		const { initial: n$3, getOut: i$3, isFinal: a$3 } = im(fm(m$3, ((m$4) => m$4[0])));
 		let x$3 = [{
 			state: n$3,
 			parent: null,
@@ -7299,7 +7299,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		forEach: nm,
 		count: function(m$3) {
 			let n$3 = 0;
-			return nm(m$3, () => n$3++), n$3;
+			return nm(m$3, (() => n$3++)), n$3;
 		},
 		ensureStableOut: im,
 		iterateStates: am,
@@ -7308,11 +7308,11 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		languageIsFinite: tm,
 		makeInitialFinal: function(m$3) {
 			const { initial: n$3, isFinal: i$3 } = m$3;
-			return Z$1(m$3, (m$4) => m$4 === n$3 || i$3(m$4));
+			return Z$1(m$3, ((m$4) => m$4 === n$3 || i$3(m$4)));
 		},
 		makeInitialNonFinal: function(m$3) {
 			const { initial: n$3, isFinal: i$3 } = m$3;
-			return Z$1(m$3, (m$4) => m$4 !== n$3 && i$3(m$4));
+			return Z$1(m$3, ((m$4) => m$4 !== n$3 && i$3(m$4)));
 		},
 		shortestAcceptingPath: rm,
 		makeDeterministic: lm,
@@ -7324,25 +7324,25 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		toString: Si,
 		iterateWordSets: ki,
 		shortestWordSet: function(m$3) {
-			const n$3 = rm(m$3, (m$4) => m$4[0]);
-			return void 0 === n$3 ? void 0 : n$3.map((m$4) => m$4[1]);
+			const n$3 = rm(m$3, ((m$4) => m$4[0]));
+			return void 0 === n$3 ? void 0 : n$3.map(((m$4) => m$4[1]));
 		},
 		approximateRejectingWordSet: function(m$3, n$3) {
 			if (n$3.isEmpty) return;
-			const { initial: i$3, getOut: a$3, isFinal: x$3 } = im(fm(m$3, (m$4) => m$4[0])), e$3 = [];
+			const { initial: i$3, getOut: a$3, isFinal: x$3 } = im(fm(m$3, ((m$4) => m$4[0]))), e$3 = [];
 			let t$3 = [i$3];
 			const r$3 = /* @__PURE__ */ new Map(), s$3 = /* @__PURE__ */ new Set();
 			for (let m$4 = 0; m$4 <= r$3.size; m$4++) {
-				if (!t$3.some((m$6) => x$3(m$6))) return e$3;
+				if (!t$3.some(((m$6) => x$3(m$6)))) return e$3;
 				const m$5 = /* @__PURE__ */ new Set(), i$4 = [];
 				for (const n$4 of t$3) for (const [x$4, e$4] of a$3(n$4)) m$5.add(x$4), i$4.push(e$4);
 				const o$3 = Ei(i$4, n$3);
 				if (void 0 !== o$3) return e$3.push(o$3), e$3;
 				e$3.push(n$3);
-				const l$3 = [...m$5], c$3 = l$3.map((m$6) => {
+				const l$3 = [...m$5], c$3 = l$3.map(((m$6) => {
 					let n$4 = r$3.get(m$6);
 					return void 0 === n$4 && (n$4 = r$3.size, r$3.set(m$6, n$4)), n$4;
-				}).sort((m$6, n$4) => m$6 - n$4).join(" ");
+				})).sort(((m$6, n$4) => m$6 - n$4)).join(" ");
 				if (s$3.has(c$3)) return;
 				s$3.add(c$3), t$3 = l$3;
 			}
@@ -7416,7 +7416,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		return n$3.length > 0 ? (n$3.reverse(), n$3.length === m$3.length ? [n$3] : (m$3 = m$3.slice(0, m$3.length - n$3.length), function* () {
 			for (const i$3 of Ai(m$3)) i$3.push(...n$3), yield i$3;
-		}())) : p$2(m$3.map((m$4) => m$4.characters()));
+		}())) : p$2(m$3.map(((m$4) => m$4.characters())));
 	}
 	function* Ii(m$3) {
 		for (const n$3 of m$3) yield* Ai(n$3);
@@ -7480,7 +7480,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				initial: this.initial,
 				getOut: (m$4) => {
 					const n$3 = /* @__PURE__ */ new Set();
-					return m$4.out.forEach((m$5) => n$3.add(m$5)), n$3;
+					return m$4.out.forEach(((m$5) => n$3.add(m$5))), n$3;
 				},
 				isFinal: (n$3) => m$3.has(n$3)
 			};
@@ -7498,15 +7498,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			let n$3 = [this.initial];
 			for (; n$3.length > 0;) {
 				const i$3 = [];
-				for (const a$3 of n$3) m$3.has(a$3) || (m$3.add(a$3), yield a$3, a$3.out.forEach((m$4) => i$3.push(m$4)));
+				for (const a$3 of n$3) m$3.has(a$3) || (m$3.add(a$3), yield a$3, a$3.out.forEach(((m$4) => i$3.push(m$4))));
 				n$3 = i$3;
 			}
 		}
 		countNodes() {
 			let m$3 = 0;
-			return l$2(this.initial, (n$3, i$3) => {
+			return l$2(this.initial, ((n$3, i$3) => {
 				m$3++, i$3.push(...n$3.out.values());
-			}), m$3;
+			})), m$3;
 		}
 		test(m$3) {
 			let n$3 = this.initial;
@@ -7524,7 +7524,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			return Ii(this.wordSets());
 		}
 		toString() {
-			return Si(this.transitionIterator(), (m$3) => m$3.toUnicodeString());
+			return Si(this.transitionIterator(), ((m$3) => m$3.toUnicodeString()));
 		}
 		toRegex(m$3) {
 			return yi(this.transitionIterator(), m$3);
@@ -7558,35 +7558,35 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		removeUnreachable() {
 			if (0 === this.finals.size) return void this.initial.out.clear();
-			const n$3 = m$2(() => /* @__PURE__ */ new Set()), i$3 = [];
-			l$2(this.initial, (m$3, a$4) => {
-				i$3.push(m$3), n$3(m$3), m$3.out.forEach((i$4) => {
+			const n$3 = m$2((() => /* @__PURE__ */ new Set())), i$3 = [];
+			l$2(this.initial, ((m$3, a$4) => {
+				i$3.push(m$3), n$3(m$3), m$3.out.forEach(((i$4) => {
 					a$4.push(i$4), n$3(i$4).add(m$3);
-				});
-			}), n$3.cache.has(this.initial);
+				}));
+			})), n$3.cache.has(this.initial);
 			const a$3 = [];
 			for (const m$3 of this.finals) n$3.cache.has(m$3) || a$3.push(m$3);
-			if (a$3.forEach((m$3) => this.finals.delete(m$3)), 0 === this.finals.size) return void this.initial.out.clear();
+			if (a$3.forEach(((m$3) => this.finals.delete(m$3))), 0 === this.finals.size) return void this.initial.out.clear();
 			const x$3 = /* @__PURE__ */ new Set();
-			if (c$2(this.finals, (m$3, i$4) => {
+			if (c$2(this.finals, ((m$3, i$4) => {
 				x$3.add(m$3), i$4.push(...n$3(m$3));
-			}), x$3.size < i$3.length) for (const m$3 of i$3) m$3.out.filter((m$4) => x$3.has(m$4));
+			})), x$3.size < i$3.length) for (const m$3 of i$3) m$3.out.filter(((m$4) => x$3.has(m$4)));
 		}
 		minimize() {
 			if (this.removeUnreachable(), this.initial.out.isEmpty) return;
 			const m$3 = function(m$4, n$4) {
 				if (0 === m$4.finals.size) throw new Error("Cannot find equivalence classes for a DFA without final states.");
 				const i$4 = [], a$4 = /* @__PURE__ */ new Set(), x$4 = /* @__PURE__ */ new Map(), e$3 = [];
-				l$2(m$4.initial, (m$5, t$4) => {
+				l$2(m$4.initial, ((m$5, t$4) => {
 					x$4.set(m$5, x$4.size), i$4.push(m$5);
 					const r$4 = m$5.out.invert(n$4);
-					e$3.push(r$4), r$4.forEach((m$6) => a$4.add(m$6)), t$4.push(...r$4.keys());
-				});
+					e$3.push(r$4), r$4.forEach(((m$6) => a$4.add(m$6))), t$4.push(...r$4.keys());
+				}));
 				const t$3 = new V$1(a$4), r$3 = [], s$3 = [], o$3 = [];
-				for (let m$5 = 0; m$5 < i$4.length; m$5++) e$3[m$5].forEach((n$5, i$5) => {
+				for (let m$5 = 0; m$5 < i$4.length; m$5++) e$3[m$5].forEach(((n$5, i$5) => {
 					const a$5 = x$4.get(i$5);
 					for (const i$6 of t$3.split(n$5)) r$3.push(m$5), s$3.push(i$6), o$3.push(a$5);
-				});
+				}));
 				const c$3 = [];
 				for (const n$5 of m$4.finals) c$3.push(x$4.get(n$5));
 				const h$3 = new Di(i$4.length, c$3, r$3, s$3, o$3).getBlockPartition(), u$3 = [];
@@ -7610,22 +7610,22 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			};
 			for (const m$4 of i$3) m$4.out.map(a$3);
 			const x$3 = [...this.finals].map(a$3);
-			this.finals.clear(), x$3.forEach((m$4) => this.finals.add(m$4));
+			this.finals.clear(), x$3.forEach(((m$4) => this.finals.add(m$4)));
 		}
 		complement(m$3 = Li.nodeFactory) {
 			const n$3 = {
 				min: 0,
 				max: this.maxCharacter
 			}, i$3 = m$3.createNode();
-			i$3.link(i$3, I$1.all(this.maxCharacter)), l$2(this.initial, (m$4, a$4) => {
-				a$4.push(...m$4.out.values()), m$4.out.mapRange(n$3, (m$5) => null != m$5 ? m$5 : i$3);
-			});
+			i$3.link(i$3, I$1.all(this.maxCharacter)), l$2(this.initial, ((m$4, a$4) => {
+				a$4.push(...m$4.out.values()), m$4.out.mapRange(n$3, ((m$5) => null != m$5 ? m$5 : i$3));
+			}));
 			const a$3 = function(m$4, n$4) {
 				const i$4 = /* @__PURE__ */ new Set();
 				for (const a$4 of m$4) n$4.has(a$4) || i$4.add(a$4);
 				return i$4;
 			}(this.nodes(), this.finals);
-			this.finals.clear(), a$3.forEach((m$4) => this.finals.add(m$4)), this.removeUnreachable();
+			this.finals.clear(), a$3.forEach(((m$4) => this.finals.add(m$4))), this.removeUnreachable();
 		}
 		prefixes() {
 			if (this.removeUnreachable(), !this.isEmpty) for (const m$3 of this.nodes()) this.finals.add(m$3);
@@ -7650,7 +7650,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		static fromIntersection(m$3, n$3, i$3 = new Li.LimitedNodeFactory()) {
 			if (cm.assert(m$3, n$3, "TransitionIterable"), m$3 instanceof Li && n$3 instanceof Li) {
 				const a$3 = new Li.Builder(i$3);
-				return nm(X$1(sm(a$3, m$3.transitionIterator(), n$3.transitionIterator()), (m$4) => m$4.out.values())), Li.fromBuilder(a$3, m$3);
+				return nm(X$1(sm(a$3, m$3.transitionIterator(), n$3.transitionIterator()), ((m$4) => m$4.out.values()))), Li.fromBuilder(a$3, m$3);
 			}
 			{
 				const a$3 = sm(new um(), m$3.transitionIterator(), n$3.transitionIterator());
@@ -7659,7 +7659,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		static fromWords(m$3, n$3, i$3 = new Li.LimitedNodeFactory()) {
 			const { maxCharacter: a$3 } = n$3, x$3 = new Li.Builder(i$3);
-			return Q$1(x$3, (m$4, n$4) => m$4.out.get(n$4), m$3, a$3), Li.fromBuilder(x$3, n$3);
+			return Q$1(x$3, ((m$4, n$4) => m$4.out.get(n$4)), m$3, a$3), Li.fromBuilder(x$3, n$3);
 		}
 		static fromWordSets(m$3, n$3, i$3 = new Li.LimitedNodeFactory()) {
 			const { maxCharacter: a$3 } = n$3, x$3 = new Li.Builder(i$3);
@@ -7674,20 +7674,20 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		static fromTransitionIterator(m$3, n$3, i$3 = new Li.LimitedNodeFactory()) {
 			const a$3 = new Li.Builder(i$3);
-			return nm(X$1(lm(a$3, m$3), (m$4) => m$4.out.values())), Li.fromBuilder(a$3, n$3);
+			return nm(X$1(lm(a$3, m$3), ((m$4) => m$4.out.values()))), Li.fromBuilder(a$3, n$3);
 		}
 		static fromBuilder(m$3, n$3) {
 			return new Li(m$3.initial, m$3.finals, n$3.maxCharacter);
 		}
 	};
 	function Pi(n$3, i$3) {
-		const a$3 = i$3.createNode(), x$3 = /* @__PURE__ */ new Set(), e$3 = m$2(() => i$3.createNode());
-		return e$3.cache.set(n$3.initial, a$3), l$2(n$3.initial, (m$3, n$4) => {
+		const a$3 = i$3.createNode(), x$3 = /* @__PURE__ */ new Set(), e$3 = m$2((() => i$3.createNode()));
+		return e$3.cache.set(n$3.initial, a$3), l$2(n$3.initial, ((m$3, n$4) => {
 			const i$4 = e$3(m$3);
-			m$3.out.forEach((m$4, a$4) => {
+			m$3.out.forEach(((m$4, a$4) => {
 				n$4.push(m$4), i$4.out.setRange(a$4, e$3(m$4));
-			});
-		}), n$3.finals.forEach((m$3) => x$3.add(e$3(m$3))), {
+			}));
+		})), n$3.finals.forEach(((m$3) => x$3.add(e$3(m$3)))), {
 			initial: a$3,
 			finals: x$3
 		};
@@ -7701,7 +7701,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				this.out.setCharSet(n$4, m$4);
 			}
 			unlink(m$4) {
-				this.out.filter((n$4) => n$4 !== m$4);
+				this.out.filter(((n$4) => n$4 !== m$4));
 			}
 			unlinkAll() {
 				this.out.clear();
@@ -7777,7 +7777,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				const i$4 = n$3.location[m$4];
 				i$4 >= a$3 && (n$3.elements[i$4] = n$3.elements[a$3], n$3.location[n$3.elements[i$4]] = i$4, n$3.elements[a$3] = m$4, n$3.location[m$4] = a$3++);
 			}
-			m$3.marked[0] = this.finals.length, m$3.touched.push(0), n$3.split(), i$3.elements.sort((m$4, n$4) => this.chars[m$4] - this.chars[n$4]), i$3.setCount = m$3.marked[0] = 0;
+			m$3.marked[0] = this.finals.length, m$3.touched.push(0), n$3.split(), i$3.elements.sort(((m$4, n$4) => this.chars[m$4] - this.chars[n$4])), i$3.setCount = m$3.marked[0] = 0;
 			let x$3 = this.chars[i$3.elements[0]];
 			for (let n$4 = 0; n$4 < this.transitionCount; n$4++) {
 				const a$4 = i$3.elements[n$4];
@@ -7820,7 +7820,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					initial: m$4,
 					getOut: (m$5) => {
 						const n$4 = /* @__PURE__ */ new Set();
-						return m$5.resolveEpsilon("out", (m$6, i$3) => n$4.add(i$3)), n$4;
+						return m$5.resolveEpsilon("out", ((m$6, i$3) => n$4.add(i$3))), n$4;
 					},
 					isFinal: (m$5) => n$3.has(m$5)
 				};
@@ -7841,10 +7841,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				initial: m$3,
 				getOut: (m$4) => {
 					const n$4 = /* @__PURE__ */ new Map();
-					return m$4.resolveEpsilon("out", (m$5, i$3) => {
+					return m$4.resolveEpsilon("out", ((m$5, i$3) => {
 						let a$3 = n$4.get(i$3);
 						a$3 = void 0 === a$3 ? m$5 : a$3.union(m$5), n$4.set(i$3, a$3);
-					}), n$4;
+					})), n$4;
 				},
 				isFinal: (m$4) => n$3.has(m$4)
 			};
@@ -7858,9 +7858,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		countNodes() {
 			let m$3 = 0;
-			return l$2(this.initial, (n$3, i$3) => {
+			return l$2(this.initial, ((n$3, i$3) => {
 				m$3++, i$3.push(...n$3.out.keys());
-			}), m$3;
+			})), m$3;
 		}
 		copy(m$3 = Ui.nodeFactory) {
 			const { initial: n$3, final: i$3 } = Ri(m$3, this);
@@ -7871,15 +7871,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const i$3 = /* @__PURE__ */ new Set();
 			for (const a$4 of m$3) {
 				const m$4 = [];
-				i$3.clear(), c$2(n$3, (n$4, x$3) => {
-					n$4.out.forEach((n$5, e$3) => {
+				i$3.clear(), c$2(n$3, ((n$4, x$3) => {
+					n$4.out.forEach(((n$5, e$3) => {
 						null === n$5 ? x$3.push(e$3) : n$5.has(a$4) && !i$3.has(e$3) && (m$4.push(e$3), i$3.add(e$3));
-					});
-				}), n$3 = m$4;
+					}));
+				})), n$3 = m$4;
 			}
 			if (i$3.has(this.final)) return !0;
 			const a$3 = this.final.reachableViaEpsilon("in");
-			return n$3.some((m$4) => a$3.has(m$4));
+			return n$3.some(((m$4) => a$3.has(m$4)));
 		}
 		wordSets() {
 			return ki(this.transitionIterator());
@@ -7893,7 +7893,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				getOut: (m$3) => m$3.out,
 				stableOut: !0,
 				isFinal: (m$3) => m$3 === this.final
-			}, (m$3) => null === m$3 ? "ε" : m$3.toUnicodeString(), !0);
+			}, ((m$3) => null === m$3 ? "ε" : m$3.toUnicodeString()), !0);
 		}
 		toRegex(m$3) {
 			return yi({
@@ -7962,7 +7962,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			if (!n$3.has(this.final)) return;
 			if (2 === n$3.size) return void this.initial.unlink(this.final);
 			const i$3 = [];
-			this.initial.resolveEpsilon("out", (m$4, n$4) => i$3.push([m$4, n$4])), this.initial.unlinkAllOut();
+			this.initial.resolveEpsilon("out", ((m$4, n$4) => i$3.push([m$4, n$4]))), this.initial.unlinkAllOut();
 			for (const [n$4, a$3] of i$3) if (this.initial.out.has(a$3)) {
 				const i$4 = m$3.createNode();
 				this.initial.link(i$4, n$4), i$4.link(a$3, null);
@@ -7973,18 +7973,18 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			(function(m$3) {
 				if (0 === m$3.final.in.size || 0 === m$3.initial.out.size) return void zi(m$3);
 				const n$3 = /* @__PURE__ */ new Set();
-				l$2(m$3.initial, (m$4, i$4) => {
+				l$2(m$3.initial, ((m$4, i$4) => {
 					n$3.add(m$4), i$4.push(...m$4.out.keys());
-				});
+				}));
 				const i$3 = /* @__PURE__ */ new Set();
-				if (l$2(m$3.final, (m$4, a$3) => {
+				if (l$2(m$3.final, ((m$4, a$3) => {
 					n$3.has(m$4) && (i$3.add(m$4), a$3.push(...m$4.in.keys()));
-				}), 0 === i$3.size || !i$3.has(m$3.initial)) return void zi(m$3);
-				for (const m$4 of i$3) m$4.out.forEach((m$5, n$4) => {
+				})), 0 === i$3.size || !i$3.has(m$3.initial)) return void zi(m$3);
+				for (const m$4 of i$3) m$4.out.forEach(((m$5, n$4) => {
 					i$3.has(n$4) || n$4.unlinkAll();
-				}), m$4.in.forEach((m$5, n$4) => {
+				})), m$4.in.forEach(((m$5, n$4) => {
 					i$3.has(n$4) || n$4.unlinkAll();
-				});
+				}));
 			})(this);
 		}
 		prefixes(m$3 = new Ui.LimitedNodeFactory()) {
@@ -8028,9 +8028,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		static fromWords(m$3, n$3, i$3 = new Ui.LimitedNodeFactory()) {
 			const { maxCharacter: a$3 } = n$3, x$3 = new Ui.Builder(i$3);
-			return Q$1(x$3, (m$4, n$4) => {
+			return Q$1(x$3, ((m$4, n$4) => {
 				for (const [i$4, a$4] of m$4.out) if (null !== a$4 && a$4.has(n$4)) return i$4;
-			}, m$3, a$3), Ui.fromBuilder(x$3, n$3);
+			}), m$3, a$3), Ui.fromBuilder(x$3, n$3);
 		}
 		static fromWordSets(m$3, n$3, i$3 = new Ui.LimitedNodeFactory()) {
 			const { maxCharacter: a$3 } = n$3, x$3 = new Ui.Builder(i$3);
@@ -8042,15 +8042,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		static fromTransitionIterator(n$3, i$3, a$3 = new Ui.LimitedNodeFactory()) {
 			const { maxCharacter: x$3 } = i$3, e$3 = new Ui.Builder(a$3), t$3 = a$3.createNode();
 			e$3.initial.link(t$3, null);
-			const r$3 = m$2(() => a$3.createNode());
-			return r$3.cache.set(n$3.initial, t$3), l$2(n$3.initial, (m$3, i$4) => {
+			const r$3 = m$2((() => a$3.createNode()));
+			return r$3.cache.set(n$3.initial, t$3), l$2(n$3.initial, ((m$3, i$4) => {
 				const a$4 = r$3(m$3);
 				n$3.isFinal(m$3) && e$3.makeFinal(a$4);
-				n$3.getOut(m$3).forEach((m$4, n$4) => {
+				n$3.getOut(m$3).forEach(((m$4, n$4) => {
 					if (m$4.maximum !== x$3) throw new Error("Some character sets do not conform to the given maximum.");
 					i$4.push(n$4), a$4.link(r$3(n$4), m$4);
-				});
-			}), Ui.fromBuilder(e$3, i$3);
+				}));
+			})), Ui.fromBuilder(e$3, i$3);
 		}
 		static fromBuilder(m$3, n$3) {
 			return new Ui(m$3.initial, m$3.final, n$3.maxCharacter);
@@ -8083,14 +8083,14 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	}
 	function Gi(n$3, i$3) {
 		return i$3 instanceof Ui ? Ri(n$3, i$3) : function(n$4, i$4) {
-			const a$3 = n$4.createNode(), x$3 = n$4.createNode(), e$3 = m$2(() => n$4.createNode());
-			e$3.cache.set(i$4.initial, a$3), l$2(i$4.initial, (m$3, n$5) => {
+			const a$3 = n$4.createNode(), x$3 = n$4.createNode(), e$3 = m$2((() => n$4.createNode()));
+			e$3.cache.set(i$4.initial, a$3), l$2(i$4.initial, ((m$3, n$5) => {
 				const a$4 = e$3(m$3);
 				i$4.isFinal(m$3) && a$4.link(x$3, null);
-				i$4.getOut(m$3).forEach((m$4, i$5) => {
+				i$4.getOut(m$3).forEach(((m$4, i$5) => {
 					n$5.push(i$5), a$4.link(e$3(i$5), m$4);
-				});
-			});
+				}));
+			}));
 			const t$3 = {
 				initial: a$3,
 				final: x$3
@@ -8099,13 +8099,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}(n$3, i$3.transitionIterator());
 	}
 	function Ri(n$3, i$3) {
-		const a$3 = n$3.createNode(), x$3 = n$3.createNode(), e$3 = m$2(() => n$3.createNode());
-		e$3.cache.set(i$3.initial, a$3), e$3.cache.set(i$3.final, x$3), l$2(i$3.initial, (m$3, n$4) => {
+		const a$3 = n$3.createNode(), x$3 = n$3.createNode(), e$3 = m$2((() => n$3.createNode()));
+		e$3.cache.set(i$3.initial, a$3), e$3.cache.set(i$3.final, x$3), l$2(i$3.initial, ((m$3, n$4) => {
 			const i$4 = e$3(m$3);
-			m$3.out.forEach((m$4, a$4) => {
+			m$3.out.forEach(((m$4, a$4) => {
 				n$4.push(a$4), i$4.link(e$3(a$4), m$4);
-			});
-		});
+			}));
+		}));
 		const t$3 = {
 			initial: a$3,
 			final: x$3
@@ -8209,14 +8209,14 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				this.unlinkAllIn(), this.unlinkAllOut();
 			}
 			unlinkAllOut() {
-				this.out.forEach((m$4, n$4) => {
+				this.out.forEach(((m$4, n$4) => {
 					n$4.in.delete(this);
-				}), this.out.clear();
+				})), this.out.clear();
 			}
 			unlinkAllIn() {
-				this.in.forEach((m$4, n$4) => {
+				this.in.forEach(((m$4, n$4) => {
 					n$4.out.delete(this);
-				}), this.in.clear();
+				})), this.in.clear();
 			}
 			resolveEpsilon(m$4, n$4) {
 				const i$3 = [...this[m$4]].reverse(), a$3 = new Set([this]);
@@ -8230,11 +8230,11 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			}
 			reachableViaEpsilon(m$4) {
 				const n$4 = /* @__PURE__ */ new Set();
-				return l$2(this, (i$3, a$3) => {
-					n$4.add(i$3), i$3[m$4].forEach((m$5, n$5) => {
+				return l$2(this, ((i$3, a$3) => {
+					n$4.add(i$3), i$3[m$4].forEach(((m$5, n$5) => {
 						null === m$5 && a$3.push(n$5);
-					});
-				}), n$4;
+					}));
+				})), n$4;
 			}
 		}
 		m$3.Node = n$3, m$3.nodeFactory = { createNode: () => new n$3() };
@@ -8402,9 +8402,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		countNodes() {
 			let m$3 = 0;
-			return l$2(this.initial, (n$3, i$3) => {
+			return l$2(this.initial, ((n$3, i$3) => {
 				m$3++, i$3.push(...n$3.out.keys());
-			}), m$3;
+			})), m$3;
 		}
 		copy(m$3 = new aa.LimitedNodeFactory()) {
 			const n$3 = ea(m$3, this.transitionIterator());
@@ -8416,12 +8416,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			for (const a$3 of m$3) {
 				const m$4 = [];
 				i$3.clear();
-				for (const x$3 of n$3) x$3.out.forEach((n$4, x$4) => {
+				for (const x$3 of n$3) x$3.out.forEach(((n$4, x$4) => {
 					n$4.has(a$3) && !i$3.has(x$4) && (m$4.push(x$4), i$3.add(x$4));
-				});
+				}));
 				n$3 = m$4;
 			}
-			return n$3.some((m$4) => this.finals.has(m$4));
+			return n$3.some(((m$4) => this.finals.has(m$4)));
 		}
 		wordSets() {
 			return ki(this.transitionIterator());
@@ -8430,7 +8430,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			return Ii(this.wordSets());
 		}
 		toString() {
-			return Si(this.transitionIterator(), (m$3) => m$3.toUnicodeString());
+			return Si(this.transitionIterator(), ((m$3) => m$3.toUnicodeString()));
 		}
 		toRegex(m$3) {
 			return yi(this.transitionIterator(), m$3);
@@ -8479,9 +8479,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			if (this.removeUnreachable(), this.normalize(), !this.isEmpty) {
 				for (const m$3 of this.nodes()) if (m$3 !== this.initial) {
 					let n$3;
-					m$3.in.forEach((m$4) => {
+					m$3.in.forEach(((m$4) => {
 						n$3 = void 0 === n$3 ? m$4 : n$3.union(m$4);
-					}), this.initial.link(m$3, n$3);
+					})), this.initial.link(m$3, n$3);
 				}
 				this.finals.add(this.initial);
 			}
@@ -8500,17 +8500,17 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 					n$4.out = n$4.in, n$4.in = i$4;
 				}
 				const e$3 = m$3.createNode();
-				i$3.in.forEach((m$4, n$4) => {
+				i$3.in.forEach(((m$4, n$4) => {
 					n$4.unlink(i$3), n$4.link(e$3, m$4);
-				});
+				}));
 				const t$3 = new Set([e$3]);
 				a$3.has(i$3) && (a$3.delete(i$3), t$3.add(i$3));
-				for (const m$4 of a$3) m$4.out.forEach((m$5, n$4) => {
+				for (const m$4 of a$3) m$4.out.forEach(((m$5, n$4) => {
 					i$3.link(n$4, m$5);
-				}), 0 === m$4.in.size && m$4.out.forEach((n$4, i$4) => {
+				})), 0 === m$4.in.size && m$4.out.forEach(((n$4, i$4) => {
 					m$4.unlink(i$4);
-				});
-				a$3.clear(), t$3.forEach((m$4) => a$3.add(m$4));
+				}));
+				a$3.clear(), t$3.forEach(((m$4) => a$3.add(m$4)));
 			}(aa.nodeFactory, this);
 		}
 		static empty(m$3, n$3 = aa.nodeFactory) {
@@ -8533,7 +8533,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		static fromIntersection(m$3, n$3, i$3 = new aa.LimitedNodeFactory()) {
 			cm.assert(m$3, n$3, "TransitionIterable");
 			const a$3 = new aa.Builder(i$3);
-			return nm(X$1(sm(a$3, m$3.transitionIterator(), n$3.transitionIterator()), (m$4) => m$4.out.keys())), da(a$3), pa(i$3, a$3), oa(a$3), aa.fromBuilder(a$3, m$3);
+			return nm(X$1(sm(a$3, m$3.transitionIterator(), n$3.transitionIterator()), ((m$4) => m$4.out.keys()))), da(a$3), pa(i$3, a$3), oa(a$3), aa.fromBuilder(a$3, m$3);
 		}
 		static fromRegex(m$3, n$3, i$3 = {}, a$3 = new aa.LimitedNodeFactory()) {
 			const { initial: x$3, finals: e$3 } = function(m$4, n$4, i$4, a$4) {
@@ -8578,7 +8578,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 							if (d$3(i$5), i$5.isEmpty) fa(n$5);
 							else {
 								const m$6 = a$4.createNode();
-								n$5.finals.forEach((n$6) => n$6.link(m$6, i$5)), n$5.finals.clear(), n$5.finals.add(m$6);
+								n$5.finals.forEach(((n$6) => n$6.link(m$6, i$5))), n$5.finals.clear(), n$5.finals.add(m$6);
 							}
 							break;
 						}
@@ -8634,9 +8634,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		static fromWords(m$3, n$3, i$3 = new aa.LimitedNodeFactory()) {
 			const { maxCharacter: a$3 } = n$3, x$3 = new aa.Builder(i$3);
-			return Q$1(x$3, (m$4, n$4) => {
+			return Q$1(x$3, ((m$4, n$4) => {
 				for (const [i$4, a$4] of m$4.out) if (a$4.has(n$4)) return i$4;
-			}, m$3, a$3), oa(x$3), la(x$3), aa.fromBuilder(x$3, n$3);
+			}), m$3, a$3), oa(x$3), la(x$3), aa.fromBuilder(x$3, n$3);
 		}
 		static fromWordSets(m$3, n$3, i$3 = new aa.LimitedNodeFactory()) {
 			const { maxCharacter: a$3 } = n$3, x$3 = new aa.Builder(i$3);
@@ -8646,15 +8646,15 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			return aa.fromTransitionIterator(m$3.transitionIterator(), m$3, n$3);
 		}
 		static fromTransitionIterator(n$3, i$3, a$3 = new aa.LimitedNodeFactory()) {
-			const { maxCharacter: x$3 } = i$3, e$3 = a$3.createNode(), t$3 = /* @__PURE__ */ new Set(), r$3 = m$2(() => a$3.createNode());
-			return r$3.cache.set(n$3.initial, e$3), l$2(n$3.initial, (m$3, i$4) => {
+			const { maxCharacter: x$3 } = i$3, e$3 = a$3.createNode(), t$3 = /* @__PURE__ */ new Set(), r$3 = m$2((() => a$3.createNode()));
+			return r$3.cache.set(n$3.initial, e$3), l$2(n$3.initial, ((m$3, i$4) => {
 				const a$4 = r$3(m$3);
 				n$3.isFinal(m$3) && t$3.add(a$4);
-				n$3.getOut(m$3).forEach((m$4, n$4) => {
+				n$3.getOut(m$3).forEach(((m$4, n$4) => {
 					if (m$4.maximum !== x$3) throw new Error("Some character sets do not conform to the given maximum.");
 					i$4.push(n$4), a$4.link(r$3(n$4), m$4);
-				});
-			}), new aa(e$3, t$3, x$3);
+				}));
+			})), new aa(e$3, t$3, x$3);
 		}
 		static fromBuilder(m$3, n$3) {
 			return new aa(m$3.initial, m$3.finals, n$3.maxCharacter);
@@ -8668,13 +8668,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		});
 	}
 	function ea(n$3, i$3) {
-		const a$3 = n$3.createNode(), x$3 = /* @__PURE__ */ new Set(), e$3 = m$2(() => n$3.createNode());
-		e$3.cache.set(i$3.initial, a$3), l$2(i$3.initial, (m$3, n$4) => {
+		const a$3 = n$3.createNode(), x$3 = /* @__PURE__ */ new Set(), e$3 = m$2((() => n$3.createNode()));
+		e$3.cache.set(i$3.initial, a$3), l$2(i$3.initial, ((m$3, n$4) => {
 			const a$4 = e$3(m$3);
 			i$3.isFinal(m$3) && x$3.add(a$4);
 			const t$4 = i$3.getOut(m$3);
 			for (const [m$4, i$4] of t$4) n$4.push(m$4), a$4.link(e$3(m$4), i$4);
-		});
+		}));
 		const t$3 = {
 			initial: a$3,
 			finals: x$3
@@ -8687,9 +8687,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		const i$3 = [...n$3.initial.out];
 		for (const n$4 of m$3.finals) for (const [m$4, a$3] of i$3) n$4.link(m$4, a$3);
 		for (const [m$4] of i$3) n$3.initial.unlink(m$4);
-		n$3.finals.has(n$3.initial) || m$3.finals.clear(), n$3.finals.forEach((i$4) => {
+		n$3.finals.has(n$3.initial) || m$3.finals.clear(), n$3.finals.forEach(((i$4) => {
 			i$4 !== n$3.initial && m$3.finals.add(i$4);
-		});
+		}));
 	}
 	function ra(m$3, n$3) {
 		if (0 === m$3.finals.size) return;
@@ -8698,16 +8698,16 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		for (const m$4 of n$3.finals) for (const [n$4, a$3] of i$3) m$4.link(n$4, a$3);
 		for (const [n$4] of i$3) m$3.initial.unlink(n$4);
 		for (const [i$4, a$3] of n$3.initial.out) m$3.initial.link(i$4, a$3), n$3.initial.unlink(i$4);
-		m$3.finals.has(m$3.initial) && (m$3.finals.delete(m$3.initial), n$3.finals.forEach((i$4) => {
+		m$3.finals.has(m$3.initial) && (m$3.finals.delete(m$3.initial), n$3.finals.forEach(((i$4) => {
 			i$4 === n$3.initial ? m$3.finals.add(m$3.initial) : m$3.finals.add(i$4);
-		}));
+		})));
 	}
 	function sa(m$3, n$3) {
-		n$3.finals.forEach((i$3) => {
+		n$3.finals.forEach(((i$3) => {
 			m$3.finals.add(i$3 === n$3.initial ? m$3.initial : i$3);
-		}), n$3.initial.out.forEach((n$4, i$3) => {
+		})), n$3.initial.out.forEach(((n$4, i$3) => {
 			m$3.initial.link(i$3, n$4);
-		}), n$3.initial.unlinkAllOut(), oa(m$3), function(m$4) {
+		})), n$3.initial.unlinkAllOut(), oa(m$3), function(m$4) {
 			const n$4 = [m$4.initial];
 			for (; n$4.length > 0;) {
 				const i$3 = n$4.pop();
@@ -8734,9 +8734,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		for (const i$3 of m$3.finals) i$3 !== m$3.initial && 0 === i$3.out.size && n$3.push(i$3);
 		if (n$3.length > 1) {
 			const i$3 = n$3.pop();
-			for (const a$3 of n$3) m$3.finals.delete(a$3), a$3.in.forEach((m$4, n$4) => {
+			for (const a$3 of n$3) m$3.finals.delete(a$3), a$3.in.forEach(((m$4, n$4) => {
 				n$4.out.delete(a$3), n$4.link(i$3, m$4);
-			});
+			}));
 		}
 	}
 	function la(m$3) {
@@ -8766,8 +8766,8 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const a$3 = new Set(n$3.finals);
 			n$3.finals.delete(n$3.initial);
 			const x$3 = xa(m$3, n$3);
-			for (let e$3 = i$3; e$3 > 2; e$3--) ta(n$3, xa(m$3, x$3)), n$3.finals.forEach((m$4) => a$3.add(m$4));
-			ta(n$3, x$3), n$3.finals.forEach((m$4) => a$3.add(m$4)), n$3.finals.clear(), a$3.forEach((m$4) => n$3.finals.add(m$4));
+			for (let e$3 = i$3; e$3 > 2; e$3--) ta(n$3, xa(m$3, x$3)), n$3.finals.forEach(((m$4) => a$3.add(m$4)));
+			ta(n$3, x$3), n$3.finals.forEach(((m$4) => a$3.add(m$4))), n$3.finals.clear(), a$3.forEach(((m$4) => n$3.finals.add(m$4)));
 		} else {
 			const a$3 = xa(m$3, n$3);
 			for (let x$3 = i$3; x$3 > 2; x$3--) ta(n$3, xa(m$3, a$3));
@@ -8775,9 +8775,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 	}
 	function ha(m$3) {
-		for (const n$3 of m$3.finals) n$3 !== m$3.initial && m$3.initial.out.forEach((m$4, i$3) => {
+		for (const n$3 of m$3.finals) n$3 !== m$3.initial && m$3.initial.out.forEach(((m$4, i$3) => {
 			n$3.link(i$3, m$4);
-		});
+		}));
 	}
 	function ua(m$3, n$3, i$3, a$3) {
 		if (0 === a$3) return fa(n$3), void n$3.finals.add(n$3.initial);
@@ -8811,27 +8811,27 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	function pa(m$3, n$3) {
 		if (0 === n$3.initial.in.size) return;
 		const i$3 = m$3.createNode();
-		n$3.initial.out.forEach((m$4, a$3) => {
+		n$3.initial.out.forEach(((m$4, a$3) => {
 			i$3.link(a$3 === n$3.initial ? i$3 : a$3, m$4);
-		}), n$3.initial.in.forEach((m$4, n$4) => {
+		})), n$3.initial.in.forEach(((m$4, n$4) => {
 			n$4.link(i$3, m$4);
-		}), n$3.initial.unlinkAllIn(), n$3.finals.has(n$3.initial) && n$3.finals.add(i$3);
+		})), n$3.initial.unlinkAllIn(), n$3.finals.has(n$3.initial) && n$3.finals.add(i$3);
 	}
 	function da(m$3) {
 		if (0 === m$3.finals.size) return void fa(m$3);
 		const n$3 = /* @__PURE__ */ new Set();
-		l$2(m$3.initial, (m$4, i$4) => {
+		l$2(m$3.initial, ((m$4, i$4) => {
 			n$3.add(m$4), i$4.push(...m$4.out.keys());
-		});
+		}));
 		const i$3 = /* @__PURE__ */ new Set();
-		if (c$2(m$3.finals, (m$4, a$3) => {
+		if (c$2(m$3.finals, ((m$4, a$3) => {
 			n$3.has(m$4) && (i$3.add(m$4), a$3.push(...m$4.in.keys()));
-		}), 0 !== i$3.size && i$3.has(m$3.initial)) {
-			for (const m$4 of i$3) m$4.out.forEach((m$5, n$4) => {
+		})), 0 !== i$3.size && i$3.has(m$3.initial)) {
+			for (const m$4 of i$3) m$4.out.forEach(((m$5, n$4) => {
 				i$3.has(n$4) || n$4.unlinkAll();
-			}), m$4.in.forEach((m$5, n$4) => {
+			})), m$4.in.forEach(((m$5, n$4) => {
 				i$3.has(n$4) || n$4.unlinkAll();
-			});
+			}));
 			for (const n$4 of [...m$3.finals]) i$3.has(n$4) || m$3.finals.delete(n$4);
 		} else fa(m$3);
 	}
@@ -8855,14 +8855,14 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				this.unlinkAllIn(), this.unlinkAllOut();
 			}
 			unlinkAllOut() {
-				this.out.forEach((m$4, n$4) => {
+				this.out.forEach(((m$4, n$4) => {
 					n$4.in.delete(this);
-				}), this.out.clear();
+				})), this.out.clear();
 			}
 			unlinkAllIn() {
-				this.in.forEach((m$4, n$4) => {
+				this.in.forEach(((m$4, n$4) => {
 					n$4.out.delete(this);
-				}), this.in.clear();
+				})), this.in.clear();
 			}
 		}
 		m$3.Node = n$3, m$3.nodeFactory = { createNode: () => new n$3() };
@@ -9977,7 +9977,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			for (let n$4 = 0, i$5 = m$5.length; n$4 < i$5; n$4++) x$3.add(m$5[n$4]);
 		}
 		const e$3 = [...x$3];
-		return e$3.sort((m$4, n$4) => m$4 - n$4), m$3.union(I$1.fromCharacters(m$3.maximum, e$3));
+		return e$3.sort(((m$4, n$4) => m$4 - n$4)), m$3.union(I$1.fromCharacters(m$3.maximum, e$3));
 	}
 	function Pc(m$3) {
 		return m$3.unicode || m$3.unicodeSets ? m$3.ignoreCase ? Mc : Jc : m$3.ignoreCase ? Ic : Ac;
@@ -10035,12 +10035,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			var m$3;
 			return null !== (m$3 = this._cachedWordSets) && void 0 !== m$3 ? m$3 : this._cachedWordSets = function(m$4, n$3) {
 				if (0 === m$4.length) return [];
-				return m$4.map((m$5) => m$5.map((m$6) => n$3.toCharSet(m$6)));
+				return m$4.map(((m$5) => m$5.map(((m$6) => n$3.toCharSet(m$6)))));
 			}(this.words, this._caseFolding);
 		}
 		get trie() {
 			var m$3;
-			return null !== (m$3 = this._cachedTrie) && void 0 !== m$3 ? m$3 : this._cachedTrie = Rc.fromWords(this.words, this._caseFolding, () => this.wordSets);
+			return null !== (m$3 = this._cachedTrie) && void 0 !== m$3 ? m$3 : this._cachedTrie = Rc.fromWords(this.words, this._caseFolding, (() => this.wordSets));
 		}
 		constructor(m$3, n$3) {
 			this.words = m$3, this._caseFolding = n$3;
@@ -10155,11 +10155,11 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			const m$3 = [];
 			for (const n$3 of this.words) if (1 === n$3.length) m$3.push(n$3[0]);
 			else if (n$3.length > 1) break;
-			if (0 !== m$3.length) return m$3.map((m$4) => this._caseFolding.toCharSet(m$4)).reduce((m$4, n$3) => m$4.union(n$3));
+			if (0 !== m$3.length) return m$3.map(((m$4) => this._caseFolding.toCharSet(m$4))).reduce(((m$4, n$3) => m$4.union(n$3)));
 		}
 		withoutSingleCharacters() {
 			if (!this.hasSingleCharacter) return this;
-			const m$3 = this.words.filter((m$4) => 1 !== m$4.length);
+			const m$3 = this.words.filter(((m$4) => 1 !== m$4.length));
 			return 0 === m$3.length ? Uc.empty : new Uc(m$3, this._caseFolding);
 		}
 		withoutEmptyWord() {
@@ -10176,7 +10176,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 	};
 	function Bc(m$3) {
-		m$3.length <= 1 || (m$3.sort(jc), i$2(m$3, (m$4, n$3) => !n$3 || 0 !== jc(m$4, n$3)));
+		m$3.length <= 1 || (m$3.sort(jc), i$2(m$3, ((m$4, n$3) => !n$3 || 0 !== jc(m$4, n$3))));
 	}
 	function jc(m$3, n$3) {
 		if (m$3.length !== n$3.length) return m$3.length - n$3.length;
@@ -10207,11 +10207,11 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			if (0 === m$3.length) return Rc.empty;
 			let a$3;
 			if (n$3.canonicalize) {
-				const m$4 = i$3(), n$4 = zc(m$4, (m$5) => m$5.maximum);
+				const m$4 = i$3(), n$4 = zc(m$4, ((m$5) => m$5.maximum));
 				if (void 0 === n$4) return Rc.emptyString;
 				a$3 = Li.fromWordSets(m$4, { maxCharacter: n$4 });
 			} else {
-				const i$4 = zc(m$3, (m$4) => n$3.toCharSet(m$4).maximum);
+				const i$4 = zc(m$3, ((m$4) => n$3.toCharSet(m$4).maximum));
 				if (void 0 === i$4) return Rc.emptyString;
 				a$3 = Li.fromWords(m$3, { maxCharacter: i$4 });
 			}
@@ -10286,14 +10286,14 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				if (m$4.accept.isEmpty && !m$4.chars.isEmpty) return [[m$4.chars]];
 				const n$3 = Array.from(m$4.accept.wordSets);
 				m$4.chars.isEmpty || n$3.push([m$4.chars]);
-				return n$3.sort((m$5, n$4) => {
+				return n$3.sort(((m$5, n$4) => {
 					if (m$5.length !== n$4.length) return n$4.length - m$5.length;
 					for (let i$3 = 0; i$3 < m$5.length; i$3++) {
 						const a$3 = m$5[i$3].compare(n$4[i$3]);
 						if (0 !== a$3) return a$3;
 					}
 					return 0;
-				}), n$3;
+				})), n$3;
 			}(this);
 		}
 		constructor(m$3, n$3) {
@@ -10322,7 +10322,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				const n$3 = m$3[0];
 				return n$3 instanceof Wc ? new Wc(this.chars.union(n$3.chars), this.accept.union(n$3.accept)) : new Wc(this.chars.union(n$3), this.accept);
 			}
-			return new Wc(this.chars.union(...m$3.map((m$4) => m$4 instanceof Wc ? m$4.chars : m$4)), this.accept.union(...m$3.map((m$4) => m$4 instanceof Wc ? m$4.accept : Uc.empty)));
+			return new Wc(this.chars.union(...m$3.map(((m$4) => m$4 instanceof Wc ? m$4.chars : m$4))), this.accept.union(...m$3.map(((m$4) => m$4 instanceof Wc ? m$4.accept : Uc.empty))));
 		}
 		intersect(m$3) {
 			return m$3 instanceof Wc ? new Wc(this.chars.intersect(m$3.chars), this.accept.intersect(m$3.accept)) : new Wc(this.chars.intersect(m$3), Uc.empty);
@@ -10529,7 +10529,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				max: r$3
 			}));
 		}
-		n$3.sort((m$4, n$4) => ch(m$4.low, n$4.low));
+		n$3.sort(((m$4, n$4) => ch(m$4.low, n$4.low)));
 		const x$3 = [];
 		for (const { high: m$4, low: i$4 } of n$3) {
 			const n$4 = x$3[x$3.length - 1];
@@ -10540,8 +10540,8 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		const e$3 = [];
 		i$3.length > 0 && e$3.push([I$1.empty(65535).union(i$3), rh]);
-		for (const { high: m$4, low: n$4 } of x$3) m$4.sort((m$5, n$5) => m$5 - n$5), e$3.push([I$1.fromCharacters(65535, m$4), I$1.empty(65535).union(n$4)]);
-		return e$3.sort((m$4, n$4) => m$4[0].ranges[0].min - n$4[0].ranges[0].min), e$3;
+		for (const { high: m$4, low: n$4 } of x$3) m$4.sort(((m$5, n$5) => m$5 - n$5)), e$3.push([I$1.fromCharacters(65535, m$4), I$1.empty(65535).union(n$4)]);
+		return e$3.sort(((m$4, n$4) => m$4[0].ranges[0].min - n$4[0].ranges[0].min)), e$3;
 	}
 	function oh(m$3) {
 		return Math.floor((m$3 - 65536) / 1024) + 55296;
@@ -10638,7 +10638,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				} else i$3 = "(?:" + fh(m$3.alternatives, n$3) + ")";
 				return 0 === m$3.min && m$3.max === Infinity ? i$3 += "*" : 1 === m$3.min && m$3.max === Infinity ? i$3 += "+" : 0 === m$3.min && 1 === m$3.max ? i$3 += "?" : m$3.max === Infinity ? i$3 += `{${m$3.min},}` : m$3.min === m$3.max ? i$3 += `{${m$3.min}}` : i$3 += `{${m$3.min},${m$3.max}}`, m$3.lazy && (i$3 += "?"), i$3;
 			}
-			case "Unknown": return "[]Unknown:" + m$3.id.replace(/[\\/|[\](){}+*?^$.]/g, (m$4) => "\\" + m$4).replace(/[\0-\x1F]/g, (m$4) => "\\x" + m$4.charCodeAt(0).toString(16).padStart(2, "0")) + "[]";
+			case "Unknown": return "[]Unknown:" + m$3.id.replace(/[\\/|[\](){}+*?^$.]/g, ((m$4) => "\\" + m$4)).replace(/[\0-\x1F]/g, ((m$4) => "\\x" + m$4.charCodeAt(0).toString(16).padStart(2, "0"))) + "[]";
 			default: throw h$2(m$3);
 		}
 	}
@@ -10717,7 +10717,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	function wh(m$3) {
 		return 0 === m$3 ? "\\0" : m$3 < 16 ? "\\x0" + m$3.toString(16) : m$3 < 256 ? "\\x" + m$3.toString(16) : m$3 < 4096 ? "\\u0" + m$3.toString(16) : m$3 < 65536 ? "\\u" + m$3.toString(16) : "\\u{" + m$3.toString(16) + "}";
 	}
-	const kh = new Set([..."\\]-^"].map((m$3) => m$3.charCodeAt(0)));
+	const kh = new Set([..."\\]-^"].map(((m$3) => m$3.charCodeAt(0))));
 	function Eh(m$3) {
 		if (kh.has(m$3)) return "\\" + String.fromCharCode(m$3);
 		const n$3 = Sh.get(m$3);
@@ -10736,9 +10736,9 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			min: 97,
 			max: 122
 		}
-	], Nh = Math.min(...Oh.map((m$3) => m$3.min)), bh = Math.max(...Oh.map((m$3) => m$3.max));
+	], Nh = Math.min(...Oh.map(((m$3) => m$3.min))), bh = Math.max(...Oh.map(((m$3) => m$3.max)));
 	function Ah(m$3) {
-		return Nh <= m$3.min && m$3.max <= bh && Oh.some(({ min: n$3, max: i$3 }) => n$3 <= m$3.min && m$3.max <= i$3) ? String.fromCharCode(m$3.min) + "-" + String.fromCharCode(m$3.max) : wh(m$3.min) + "-" + wh(m$3.max);
+		return Nh <= m$3.min && m$3.max <= bh && Oh.some((({ min: n$3, max: i$3 }) => n$3 <= m$3.min && m$3.max <= i$3)) ? String.fromCharCode(m$3.min) + "-" + String.fromCharCode(m$3.max) : wh(m$3.min) + "-" + wh(m$3.max);
 	}
 	function Ih(m$3) {
 		if (m$3.min === m$3.max) return Eh(m$3.min);
@@ -10750,7 +10750,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		}
 		return Ah(m$3);
 	}
-	const Jh = new Set([..."()[]{}*+?|\\.^$/"].map((m$3) => m$3.charCodeAt(0)));
+	const Jh = new Set([..."()[]{}*+?|\\.^$/"].map(((m$3) => m$3.charCodeAt(0))));
 	function Mh(m$3) {
 		if (Jh.has(m$3)) return "\\" + String.fromCharCode(m$3);
 		const n$3 = Sh.get(m$3);
@@ -10828,7 +10828,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	}
 	function zh(m$3) {
 		let n$3 = 0;
-		return m$3.split(" ").map((m$4) => n$3 += 0 | parseInt(m$4, 36));
+		return m$3.split(" ").map(((m$4) => n$3 += 0 | parseInt(m$4, 36)));
 	}
 	var Vh = class {
 		constructor(m$3, n$3, i$3, a$3, x$3, e$3, t$3) {
@@ -11829,7 +11829,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		onPatternLeave(m$3, n$3) {
 			this._node.end = n$3, this._node.raw = this.source.slice(m$3, n$3);
 			for (const m$4 of this._backreferences) {
-				const n$4 = m$4.ref, i$3 = "number" == typeof n$4 ? this._capturingGroups[n$4 - 1] : this._capturingGroups.find((m$5) => m$5.name === n$4);
+				const n$4 = m$4.ref, i$3 = "number" == typeof n$4 ? this._capturingGroups[n$4 - 1] : this._capturingGroups.find(((m$5) => m$5.name === n$4));
 				m$4.resolved = i$3, i$3.references.push(m$4);
 			}
 		}
@@ -12308,12 +12308,12 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 		switch (m$3.type) {
 			case "Alternative":
 			case "StringAlternative":
-			case "CharacterClass": return m$3.elements.some((m$4) => Eu(m$4, n$3));
-			case "Assertion": return ("lookahead" === m$3.kind || "lookbehind" === m$3.kind) && m$3.alternatives.some((m$4) => Eu(m$4, n$3));
+			case "CharacterClass": return m$3.elements.some(((m$4) => Eu(m$4, n$3)));
+			case "Assertion": return ("lookahead" === m$3.kind || "lookbehind" === m$3.kind) && m$3.alternatives.some(((m$4) => Eu(m$4, n$3)));
 			case "CapturingGroup":
 			case "Group":
 			case "Pattern":
-			case "ClassStringDisjunction": return m$3.alternatives.some((m$4) => Eu(m$4, n$3));
+			case "ClassStringDisjunction": return m$3.alternatives.some(((m$4) => Eu(m$4, n$3)));
 			case "ExpressionCharacterClass": return Eu(m$3.expression, n$3);
 			case "CharacterClassRange": return Eu(m$3.min, n$3) || Eu(m$3.max, n$3);
 			case "ClassIntersection":
@@ -12405,7 +12405,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			}
 			case "ClassStringDisjunction": {
 				const i$3 = Pc(n$3), a$3 = [], x$3 = [];
-				for (const n$4 of m$3.alternatives) 1 === n$4.elements.length ? x$3.push(n$4.elements[0].value) : a$3.push(n$4.elements.map((m$4) => m$4.value));
+				for (const n$4 of m$3.alternatives) 1 === n$4.elements.length ? x$3.push(n$4.elements[0].value) : a$3.push(n$4.elements.map(((m$4) => m$4.value)));
 				let e$3 = 0 === x$3.length ? i$3.empty : mh(x$3, n$3);
 				return i$3.ignoreCase && (e$3 = i$3.withCaseVaryingCharacters(e$3)), Wc.from(e$3, Uc.from(a$3, i$3.charCaseFolding));
 			}
@@ -12413,7 +12413,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 				const i$3 = Pc(n$3), a$3 = i$3.charCaseFolding;
 				if (1 === m$3.elements.length) return Wc.fromChars(a$3.toCharSet(m$3.elements[0].value));
 				{
-					const n$4 = Uc.fromWord(m$3.elements.map((m$4) => m$4.value), a$3);
+					const n$4 = Uc.fromWord(m$3.elements.map(((m$4) => m$4.value)), a$3);
 					return Wc.from(i$3.empty, n$4);
 				}
 			}
@@ -12429,7 +12429,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			}], n$3);
 			case "CharacterSet": return mh([m$3], n$3);
 			case "CharacterClass": {
-				const i$3 = mh(m$3.elements.map((m$4) => {
+				const i$3 = mh(m$3.elements.map(((m$4) => {
 					switch (m$4.type) {
 						case "Character": return m$4.value;
 						case "CharacterClassRange": return {
@@ -12439,7 +12439,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 						case "CharacterSet": return m$4;
 						default: throw h$2(m$4, "Unsupported element");
 					}
-				}), n$3);
+				})), n$3);
 				return m$3.negate ? i$3.negate() : i$3;
 			}
 			default: return h$2(m$3);
@@ -12771,13 +12771,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			let n$3 = this._backRefCanReachGroupCache.get(m$3);
 			return void 0 === n$3 && (n$3 = function(m$4) {
 				const n$4 = m$4.resolved;
-				return !Ou(m$4, (m$5) => m$5 === n$4) && function n$5(i$3) {
+				return !Ou(m$4, ((m$5) => m$5 === n$4)) && function n$5(i$3) {
 					const a$3 = i$3.parent;
 					switch (a$3.type) {
 						case "Alternative": {
 							const x$3 = a$3.elements.indexOf(i$3);
 							let e$3;
-							if (e$3 = "ltr" === Nu(i$3) ? a$3.elements.slice(x$3 + 1) : a$3.elements.slice(0, x$3), e$3.some((n$6) => Eu(n$6, (n$7) => n$7 === m$4))) return !0;
+							if (e$3 = "ltr" === Nu(i$3) ? a$3.elements.slice(x$3 + 1) : a$3.elements.slice(0, x$3), e$3.some(((n$6) => Eu(n$6, ((n$7) => n$7 === m$4))))) return !0;
 							const t$3 = a$3.parent;
 							return "Pattern" !== t$3.type && n$5(t$3);
 						}
@@ -12791,13 +12791,13 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			let n$3 = this._backRefAlwaysAfterGroupCache.get(m$3);
 			return void 0 === n$3 && (n$3 = function(m$4) {
 				const n$4 = m$4.resolved;
-				return !Ou(m$4, (m$5) => m$5 === n$4) && function n$5(i$3) {
+				return !Ou(m$4, ((m$5) => m$5 === n$4)) && function n$5(i$3) {
 					const a$3 = i$3.parent;
 					switch (a$3.type) {
 						case "Alternative": {
 							const x$3 = a$3.elements.indexOf(i$3);
 							let e$3;
-							if (e$3 = "ltr" === Nu(i$3) ? a$3.elements.slice(x$3 + 1) : a$3.elements.slice(0, x$3), e$3.some((n$6) => Eu(n$6, (n$7) => n$7 === m$4))) return !0;
+							if (e$3 = "ltr" === Nu(i$3) ? a$3.elements.slice(x$3 + 1) : a$3.elements.slice(0, x$3), e$3.some(((n$6) => Eu(n$6, ((n$7) => n$7 === m$4))))) return !0;
 							const t$3 = a$3.parent;
 							return "Pattern" !== t$3.type && !(t$3.alternatives.length > 1) && n$5(t$3);
 						}
@@ -12848,10 +12848,10 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 			return i$3;
 		}
 		_getResolvableGroupReferences(m$3) {
-			return this._getGroupReferences(m$3).filter((m$4) => this._backRefCanReachGroup(m$4) && this._backRefAlwaysAfterGroup(m$4));
+			return this._getGroupReferences(m$3).filter(((m$4) => this._backRefCanReachGroup(m$4) && this._backRefAlwaysAfterGroup(m$4)));
 		}
 		_getResolvableGroupReferencesUnder(m$3, n$3) {
-			return this._getResolvableGroupReferences(m$3).filter((m$4) => Ou(m$4, (m$5) => m$5 === n$3));
+			return this._getResolvableGroupReferences(m$3).filter(((m$4) => Ou(m$4, ((m$5) => m$5 === n$3))));
 		}
 	};
 	var Lu = class {
@@ -12941,7 +12941,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	}
 	function Uu(m$3) {
 		let n$3 = !1;
-		m$3.alternatives = m$3.alternatives.filter((m$4) => 0 !== m$4.elements.length || !n$3 && (n$3 = !0, !0));
+		m$3.alternatives = m$3.alternatives.filter(((m$4) => 0 !== m$4.elements.length || !n$3 && (n$3 = !0, !0)));
 	}
 	function Bu(m$3, n$3) {
 		return function* (m$4, n$4) {
@@ -13130,7 +13130,7 @@ var require_refa$1 = __commonJS({ "node_modules/.pnpm/refa@0.12.1/node_modules/r
 	}, exports.getIntersectionIterator = na, exports.getIntersectionWordSets = ia, exports.getIntersectionWords = function(m$3, n$3, i$3 = 1e4) {
 		return Ii(ia(m$3, n$3, i$3));
 	}, exports.isDisjointWith = function(m$3, n$3, i$3 = 1e4) {
-		return !xm(X$1(na(m$3, n$3, i$3), (m$4) => m$4.keys()));
+		return !xm(X$1(na(m$3, n$3, i$3), ((m$4) => m$4.keys())));
 	}, exports.setParent = C$2, exports.setSource = y$2, exports.transform = E$2, exports.visitAst = w$2;
 } });
 
@@ -13265,7 +13265,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	};
 	function h$1(e$3, r$3) {
 		if (!t$1.JS.isFlags(r$3)) throw new Error("Invalid flags.");
-		return a$1(e$3) ? 0 === e$3.length ? exports.Chars.empty(r$3) : 1 === e$3.length ? p$1(e$3[0], r$3) : exports.Chars.empty(r$3).union(...e$3.map((e$4) => p$1(e$4, r$3))) : p$1(e$3, r$3);
+		return a$1(e$3) ? 0 === e$3.length ? exports.Chars.empty(r$3) : 1 === e$3.length ? p$1(e$3[0], r$3) : exports.Chars.empty(r$3).union(...e$3.map(((e$4) => p$1(e$4, r$3)))) : p$1(e$3, r$3);
 	}
 	function p$1(e$3, r$3) {
 		if (r$3 instanceof l$1) {
@@ -13276,7 +13276,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	}
 	function f$1(e$3, r$3) {
 		if (!t$1.JS.isFlags(r$3)) throw new Error("Invalid flags.");
-		return a$1(e$3) ? 0 === e$3.length ? t$1.JS.UnicodeSet.empty(exports.Chars.maxChar(r$3)) : 1 === e$3.length ? C$1(e$3[0], r$3) : t$1.JS.UnicodeSet.empty(exports.Chars.maxChar(r$3)).union(...e$3.map((e$4) => C$1(e$4, r$3))) : C$1(e$3, r$3);
+		return a$1(e$3) ? 0 === e$3.length ? t$1.JS.UnicodeSet.empty(exports.Chars.maxChar(r$3)) : 1 === e$3.length ? C$1(e$3[0], r$3) : t$1.JS.UnicodeSet.empty(exports.Chars.maxChar(r$3)).union(...e$3.map(((e$4) => C$1(e$4, r$3)))) : C$1(e$3, r$3);
 	}
 	function C$1(e$3, r$3) {
 		if (r$3 instanceof l$1) {
@@ -13292,7 +13292,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "StringAlternative": return !1;
 			case "CharacterClassRange": return 0 === e$3.min.value && e$3.max.value === exports.Chars.maxChar(t$3);
 			case "CharacterSet": return "property" === e$3.kind ? !e$3.strings && h$1(e$3, t$3).isAll : "any" === e$3.kind && !!t$3.dotAll;
-			case "CharacterClass": return e$3.negate ? e$3.elements.every((e$4) => d$1(e$4, t$3)) : 0 !== e$3.elements.length && (1 === e$3.elements.length ? m$1(e$3.elements[0], t$3) : f$1(e$3, t$3).chars.isAll);
+			case "CharacterClass": return e$3.negate ? e$3.elements.every(((e$4) => d$1(e$4, t$3))) : 0 !== e$3.elements.length && (1 === e$3.elements.length ? m$1(e$3.elements[0], t$3) : f$1(e$3, t$3).chars.isAll);
 			case "ExpressionCharacterClass": return m$1(e$3.expression, t$3);
 			case "ClassIntersection": return m$1(e$3.left, t$3) && m$1(e$3.right, t$3);
 			case "ClassSubtraction": return f$1(e$3, t$3).chars.isAll;
@@ -13306,7 +13306,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "ClassStringDisjunction":
 			case "StringAlternative": return !1;
 			case "CharacterSet": return "property" === e$3.kind && !e$3.strings && h$1(e$3, t$3).isEmpty;
-			case "CharacterClass": return e$3.negate ? 0 !== e$3.elements.length && (1 === e$3.elements.length ? m$1(e$3.elements[0], t$3) : f$1(e$3, t$3).isEmpty) : e$3.elements.every((e$4) => d$1(e$4, t$3));
+			case "CharacterClass": return e$3.negate ? 0 !== e$3.elements.length && (1 === e$3.elements.length ? m$1(e$3.elements[0], t$3) : f$1(e$3, t$3).isEmpty) : e$3.elements.every(((e$4) => d$1(e$4, t$3)));
 			case "ExpressionCharacterClass": return d$1(e$3.expression, t$3);
 			case "ClassIntersection":
 			case "ClassSubtraction": return f$1(e$3, t$3).isEmpty;
@@ -13318,14 +13318,14 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "Character":
 			case "CharacterSet":
 			case "CharacterClassRange": return !1;
-			case "CharacterClass": return e$3.unicodeSets && !e$3.negate && e$3.elements.length > 0 && e$3.elements.every((e$4) => g$1(e$4, t$3));
+			case "CharacterClass": return e$3.unicodeSets && !e$3.negate && e$3.elements.length > 0 && e$3.elements.every(((e$4) => g$1(e$4, t$3)));
 			case "ExpressionCharacterClass": return !e$3.negate && g$1(e$3.expression, t$3);
 			case "ClassIntersection":
 			case "ClassSubtraction": {
 				const r$3 = f$1(e$3, t$3).getLengthRange();
 				return void 0 !== r$3 && 0 === r$3.min && 0 === r$3.max;
 			}
-			case "ClassStringDisjunction": return e$3.alternatives.every((e$4) => g$1(e$4, t$3));
+			case "ClassStringDisjunction": return e$3.alternatives.every(((e$4) => g$1(e$4, t$3)));
 			case "StringAlternative": return 0 === e$3.elements.length;
 			default: throw n$1(e$3);
 		}
@@ -13351,11 +13351,11 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 		return a$1(e$3) ? e$3.some(t$3) : t$3(e$3);
 	}
 	function v$1(e$3, t$3) {
-		return y$1(e$3, (e$4) => w$1(e$4, t$3));
+		return y$1(e$3, ((e$4) => w$1(e$4, t$3)));
 	}
 	function w$1(e$3, t$3) {
 		switch (e$3.type) {
-			case "Alternative": return e$3.elements.every((e$4) => w$1(e$4, t$3));
+			case "Alternative": return e$3.elements.every(((e$4) => w$1(e$4, t$3)));
 			case "Assertion": return !0;
 			case "Character":
 			case "CharacterSet":
@@ -13369,7 +13369,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "Quantifier": return 0 === e$3.max || w$1(e$3.element, t$3);
 			case "Backreference": return I(e$3, t$3);
 			case "CapturingGroup":
-			case "Group": return e$3.alternatives.length > 0 && e$3.alternatives.every((e$4) => w$1(e$4, t$3));
+			case "Group": return e$3.alternatives.length > 0 && e$3.alternatives.every(((e$4) => w$1(e$4, t$3)));
 			default: throw n$1(e$3);
 		}
 	}
@@ -13392,7 +13392,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	}
 	function A$1(e$3, t$3) {
 		switch (e$3.type) {
-			case "Alternative": return e$3.elements.every((e$4) => A$1(e$4, t$3));
+			case "Alternative": return e$3.elements.every(((e$4) => A$1(e$4, t$3)));
 			case "Assertion": return !1;
 			case "Backreference": return I(e$3, t$3);
 			case "Character":
@@ -13405,13 +13405,13 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "ClassStringDisjunction":
 			case "StringAlternative": return g$1(e$3, t$3);
 			case "CapturingGroup":
-			case "Group": return e$3.alternatives.length > 0 && e$3.alternatives.every((e$4) => A$1(e$4, t$3));
+			case "Group": return e$3.alternatives.length > 0 && e$3.alternatives.every(((e$4) => A$1(e$4, t$3)));
 			case "Quantifier": return 0 === e$3.max || A$1(e$3.element, t$3);
 			default: throw n$1(e$3);
 		}
 	}
 	function E$1(e$3, t$3, r$3) {
-		return !!I(e$3, r$3) || !!F(e$3.resolved, (e$4) => e$4 === t$3) && (!B(e$3) || k(e$3.resolved, t$3, r$3));
+		return !!I(e$3, r$3) || !!F(e$3.resolved, ((e$4) => e$4 === t$3)) && (!B(e$3) || k(e$3.resolved, t$3, r$3));
 	}
 	function F(e$3, t$3) {
 		return "function" == typeof t$3 ? function(e$4, t$4) {
@@ -13431,7 +13431,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 		}(e$3, t$3);
 	}
 	function b$1(e$3, t$3, r$3) {
-		return "function" == typeof t$3 ? _(e$3, t$3, r$3) : r$3 ? _(e$3, (e$4) => e$4 === t$3, r$3) : e$3 === t$3 || F(t$3, e$3);
+		return "function" == typeof t$3 ? _(e$3, t$3, r$3) : r$3 ? _(e$3, ((e$4) => e$4 === t$3), r$3) : e$3 === t$3 || F(t$3, e$3);
 	}
 	function _(e$3, t$3, r$3) {
 		if (t$3(e$3)) return !0;
@@ -13439,12 +13439,12 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 		switch (e$3.type) {
 			case "Alternative":
 			case "CharacterClass":
-			case "StringAlternative": return e$3.elements.some((e$4) => _(e$4, t$3, r$3));
-			case "Assertion": return ("lookahead" === e$3.kind || "lookbehind" === e$3.kind) && e$3.alternatives.some((e$4) => _(e$4, t$3, r$3));
+			case "StringAlternative": return e$3.elements.some(((e$4) => _(e$4, t$3, r$3)));
+			case "Assertion": return ("lookahead" === e$3.kind || "lookbehind" === e$3.kind) && e$3.alternatives.some(((e$4) => _(e$4, t$3, r$3)));
 			case "CapturingGroup":
 			case "ClassStringDisjunction":
 			case "Group":
-			case "Pattern": return e$3.alternatives.some((e$4) => _(e$4, t$3, r$3));
+			case "Pattern": return e$3.alternatives.some(((e$4) => _(e$4, t$3, r$3)));
 			case "ClassIntersection":
 			case "ClassSubtraction": return _(e$3.left, t$3, r$3) || _(e$3.right, t$3, r$3);
 			case "ExpressionCharacterClass": return _(e$3.expression, t$3, r$3);
@@ -13474,7 +13474,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	}
 	function G(e$3) {
 		let t$3;
-		return F(e$3, (e$4) => "Assertion" === e$4.type && (t$3 = e$4, !0)), void 0 === t$3 || "lookahead" === t$3.kind ? "ltr" : "rtl";
+		return F(e$3, ((e$4) => "Assertion" === e$4.type && (t$3 = e$4, !0))), void 0 === t$3 || "lookahead" === t$3.kind ? "ltr" : "rtl";
 	}
 	function R(e$3) {
 		return "ltr" === e$3 ? "rtl" : "ltr";
@@ -13494,7 +13494,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 				case "Alternative": {
 					const n$4 = r$4.elements.indexOf(t$4);
 					let a$3;
-					if (a$3 = "ltr" === G(t$4) ? r$4.elements.slice(n$4 + 1) : r$4.elements.slice(0, n$4), a$3.some((e$5) => s$3.has(e$5))) return !0;
+					if (a$3 = "ltr" === G(t$4) ? r$4.elements.slice(n$4 + 1) : r$4.elements.slice(0, n$4), a$3.some(((e$5) => s$3.has(e$5)))) return !0;
 					const o$3 = r$4.parent;
 					return "Pattern" !== o$3.type && ("Assertion" !== o$3.type || !o$3.negate) && e$4(o$3);
 				}
@@ -13514,7 +13514,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 				case "Alternative": {
 					const s$3 = r$4.elements.indexOf(t$4);
 					let a$3;
-					if (a$3 = "ltr" === G(t$4) ? r$4.elements.slice(s$3 + 1) : r$4.elements.slice(0, s$3), a$3.some((e$5) => n$3.has(e$5))) return !0;
+					if (a$3 = "ltr" === G(t$4) ? r$4.elements.slice(s$3 + 1) : r$4.elements.slice(0, s$3), a$3.some(((e$5) => n$3.has(e$5)))) return !0;
 					const o$3 = r$4.parent;
 					return "Pattern" !== o$3.type && ("Assertion" !== o$3.type || !o$3.negate) && !(o$3.alternatives.length > 1) && e$4(o$3);
 				}
@@ -13607,7 +13607,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	}
 	function T(e$3, t$3) {
 		if (0 === e$3.length) throw new RangeError("Expected the alternatives array to have at least one alternative.");
-		return e$3.some((e$4) => z(e$4, t$3));
+		return e$3.some(((e$4) => z(e$4, t$3)));
 	}
 	function z(e$3, t$3) {
 		switch (e$3.type) {
@@ -13620,7 +13620,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "ClassIntersection":
 			case "ClassSubtraction": return f$1(e$3, t$3).hasEmptyWord;
 			case "Quantifier": return 0 === e$3.min || z(e$3.element, t$3);
-			case "Alternative": return e$3.elements.every((e$4) => z(e$4, t$3));
+			case "Alternative": return e$3.elements.every(((e$4) => z(e$4, t$3)));
 			case "StringAlternative": return 0 === e$3.elements.length;
 			case "CapturingGroup":
 			case "Group":
@@ -13736,13 +13736,13 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			if (null === (a$4 = null === (n$3 = s$3.continueInto) || void 0 === n$3 ? void 0 : n$3.call(s$3, e$4, t$4, r$4)) || void 0 === a$4 || a$4) switch (e$4.type) {
 				case "Assertion":
 					if ("lookahead" === e$4.kind || "lookbehind" === e$4.kind) {
-						const n$4 = j(e$4.kind), a$5 = s$3.join(e$4.alternatives.map((e$5) => c$3(e$5, X(s$3, t$4, r$4), n$4)), n$4);
+						const n$4 = j(e$4.kind), a$5 = s$3.join(e$4.alternatives.map(((e$5) => c$3(e$5, X(s$3, t$4, r$4), n$4))), n$4);
 						t$4 = l$3(t$4, n$4, "assertion"), s$3.assert && (t$4 = s$3.assert(t$4, r$4, a$5, n$4));
 					}
 					break;
 				case "Group":
 				case "CapturingGroup":
-					t$4 = s$3.join(e$4.alternatives.map((e$5) => c$3(e$5, X(s$3, t$4, r$4), r$4)), r$4);
+					t$4 = s$3.join(e$4.alternatives.map(((e$5) => c$3(e$5, X(s$3, t$4, r$4), r$4))), r$4);
 					break;
 				case "Quantifier": 0 === e$4.max || (t$4 = 0 === e$4.min ? s$3.join([t$4, o$3(e$4.element, X(s$3, t$4, r$4), r$4)], r$4) : o$3(e$4.element, t$4, r$4));
 			}
@@ -13939,7 +13939,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			this._currentWordBoundaries = [], e$3 instanceof l$1 ? (this._ltrCache = e$3.getFirstConsumedCharLTR, this._rtlCache = e$3.getFirstConsumedCharRTL) : (this._ltrCache = /* @__PURE__ */ new WeakMap(), this._rtlCache = /* @__PURE__ */ new WeakMap());
 		}
 		isCurrentWordBoundary(e$3) {
-			return this._currentWordBoundaries.some((t$3) => t$3 === e$3);
+			return this._currentWordBoundaries.some(((t$3) => t$3 === e$3));
 		}
 		pushWordBoundary(e$3) {
 			this._currentWordBoundaries.push(e$3);
@@ -13959,7 +13959,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 		return a$1(e$3) ? ne(e$3, t$3, r$3, n$3) : se(e$3, t$3, r$3, n$3);
 	}
 	function ne(e$3, t$3, r$3, n$3) {
-		return exports.FirstConsumedChars.union(e$3.map((e$4) => se(e$4, t$3, r$3, n$3)), r$3);
+		return exports.FirstConsumedChars.union(e$3.map(((e$4) => se(e$4, t$3, r$3, n$3))), r$3);
 	}
 	function se(e$3, t$3, r$3, s$3) {
 		let a$3 = s$3.getCached(e$3, t$3);
@@ -13982,7 +13982,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 						case "lookbehind":
 							if (j(e$5.kind) === t$5) {
 								if (e$5.negate) {
-									if (b$1(e$5, (t$6) => t$6 !== e$5 && "Assertion" === t$6.type)) return a$4();
+									if (b$1(e$5, ((t$6) => t$6 !== e$5 && "Assertion" === t$6.type))) return a$4();
 									const n$3 = ne(e$5.alternatives, t$5, r$5, s$5), o$4 = P(e$5.alternatives, r$5);
 									return n$3.empty || !o$4 ? {
 										char: exports.Chars.empty(r$5),
@@ -14100,8 +14100,8 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 		}, {
 			join(e$4) {
 				const t$4 = /* @__PURE__ */ new Set();
-				return e$4.forEach((e$5) => e$5.contributors.forEach((e$6) => t$4.add(e$6))), {
-					char: exports.FirstConsumedChars.union(e$4.map((e$5) => e$5.char), r$3),
+				return e$4.forEach(((e$5) => e$5.contributors.forEach(((e$6) => t$4.add(e$6))))), {
+					char: exports.FirstConsumedChars.union(e$4.map(((e$5) => e$5.char)), r$3),
 					contributors: [...t$4]
 				};
 			},
@@ -14184,7 +14184,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			}
 			case "CapturingGroup":
 			case "Group": return function(e$4, t$4, r$4, n$3) {
-				const s$4 = e$4.alternatives.map((e$5) => fe(e$5, t$4, r$4, n$3));
+				const s$4 = e$4.alternatives.map(((e$5) => fe(e$5, t$4, r$4, n$3)));
 				return me(e$4, s$4, t$4, r$4, n$3);
 			}(e$3, t$3, r$3, s$3);
 			case "Quantifier": return function(e$4, t$4, r$4, n$3) {
@@ -14240,7 +14240,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			if (l$3) {
 				if (o$3 = !1, !ye(e$3, n$3, r$3, s$3)) break;
 				u$3.push(ce(e$3, r$3, s$3).char);
-			} else if (!n$3.looseGroups && (o$3 && u$3.some((e$4) => !e$4.equals(u$3[0])) && c$3++, c$3 >= 2 && (o$3 = !1, !n$3.includeAfter))) break;
+			} else if (!n$3.looseGroups && (o$3 && u$3.some(((e$4) => !e$4.equals(u$3[0]))) && c$3++, c$3 >= 2 && (o$3 = !1, !n$3.includeAfter))) break;
 			const h$3 = u$3[0].union(...u$3.slice(1));
 			a$3.push(h$3);
 		}
@@ -14281,10 +14281,10 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	}
 	function ve(e$3, t$3, r$3) {
 		return s$1(e$3), "unknown" === t$3 ? function(e$4, t$4) {
-			const r$4 = ke(e$4, "ltr", t$4), n$3 = ke(e$4, "rtl", t$4), s$3 = Ae([...r$4, ...n$3], (e$5) => e$5), a$3 = [];
+			const r$4 = ke(e$4, "ltr", t$4), n$3 = ke(e$4, "rtl", t$4), s$3 = Ae([...r$4, ...n$3], ((e$5) => e$5)), a$3 = [];
 			for (const e$5 of s$3) {
 				const t$5 = /* @__PURE__ */ new Set();
-				for (const r$5 of e$5) r$5.forEach((e$6) => t$5.add(e$6));
+				for (const r$5 of e$5) r$5.forEach(((e$6) => t$5.add(e$6)));
 				a$3.push([...t$5]);
 			}
 			return a$3;
@@ -14301,24 +14301,24 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 				return void 0 === n$4 && (n$4 = e$4(r$4), t$3.cache.set(r$4, n$4)), n$4;
 			}
 			return t$3.cache = /* @__PURE__ */ new Map(), t$3;
-		}((e$4) => {
+		}(((e$4) => {
 			let t$3 = le(e$4, r$3, n$3, we), s$4 = 0;
 			for (let e$5 = t$3.length - 1; e$5 >= 0 && t$3[e$5].isAll; e$5--) s$4++;
 			return s$4 > 0 && (t$3 = t$3.slice(0, t$3.length - s$4)), t$3;
-		}), a$3 = /* @__PURE__ */ new Set();
-		for (const t$3 of e$3) s$3(t$3).forEach((e$4) => a$3.add(e$4));
+		})), a$3 = /* @__PURE__ */ new Set();
+		for (const t$3 of e$3) s$3(t$3).forEach(((e$4) => a$3.add(e$4)));
 		const o$3 = new t$1.CharBase(a$3), c$3 = [];
 		for (const t$3 of e$3) c$3.push({
-			characters: s$3(t$3).map((e$4) => o$3.split(e$4)),
+			characters: s$3(t$3).map(((e$4) => o$3.split(e$4))),
 			alternative: t$3
 		});
 		return function e$4(t$3, r$4) {
 			if (t$3.length < 2) return [t$3];
 			for (const e$5 of t$3) if (r$4 >= e$5.characters.length) return [t$3];
-			const n$4 = Ae(t$3, (e$5) => e$5.characters[r$4]), s$4 = [];
+			const n$4 = Ae(t$3, ((e$5) => e$5.characters[r$4])), s$4 = [];
 			for (const t$4 of n$4) s$4.push(...e$4(t$4, r$4 + 1));
 			return s$4;
-		}(c$3, 0).map((e$4) => e$4.map((e$5) => e$5.alternative));
+		}(c$3, 0).map(((e$4) => e$4.map(((e$5) => e$5.alternative))));
 	}
 	function Ae(e$3, t$3) {
 		if (e$3.length < 2) return [e$3];
@@ -14338,7 +14338,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 	function Ee(e$3, t$3) {
 		const r$3 = [];
 		let n$3 = !0;
-		b$1(e$3, (e$4) => {
+		b$1(e$3, ((e$4) => {
 			if ("Character" === e$4.type || "CharacterClass" === e$4.type || "CharacterSet" === e$4.type || "ExpressionCharacterClass" === e$4.type) {
 				const s$3 = f$1(e$4, t$3);
 				if (r$3.push(s$3.chars), !s$3.accept.isEmpty) {
@@ -14352,7 +14352,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 				r$3.push(s$3.chars), n$3 = n$3 && s$3.exact && s$3.chars.size < 2;
 			}
 			return !1;
-		}, (e$4) => "CharacterClass" !== e$4.type && "ExpressionCharacterClass" !== e$4.type && ("Assertion" !== e$4.type || (n$3 = !1, !1)));
+		}), ((e$4) => "CharacterClass" !== e$4.type && "ExpressionCharacterClass" !== e$4.type && ("Assertion" !== e$4.type || (n$3 = !1, !1))));
 		return {
 			chars: exports.Chars.empty(t$3).union(...r$3),
 			exact: n$3
@@ -14364,10 +14364,10 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			let n$4 = 0, s$4 = 0;
 			for (const r$5 of t$4) W(r$5) && (e$4.has(r$5) ? n$4++ : s$4++);
 			if (n$4 > 1 || 1 === n$4 && 0 !== s$4) return !1;
-			if (0 !== s$4) return r$4.every((t$5) => !t$5.some(W) || t$5.every((t$6) => !e$4.has(t$6)));
-			if (0 !== n$4) return r$4.every((e$5) => e$5.length < 2 || !e$5.some(W));
+			if (0 !== s$4) return r$4.every(((t$5) => !t$5.some(W) || t$5.every(((t$6) => !e$4.has(t$6)))));
+			if (0 !== n$4) return r$4.every(((e$5) => e$5.length < 2 || !e$5.some(W)));
 			return !0;
-		}(e$3, t$3, a$3)) && a$3.every((t$4) => t$4.length < 2 || !!t$4.every((t$5) => !e$3.has(t$5)) || function(e$4, t$5) {
+		}(e$3, t$3, a$3)) && a$3.every(((t$4) => t$4.length < 2 || !!t$4.every(((t$5) => !e$3.has(t$5))) || function(e$4, t$5) {
 			const r$4 = P(e$4, t$5);
 			return Boolean(r$4 && r$4.min === r$4.max);
 		}(t$4, n$3) || function(e$4, t$5, r$4) {
@@ -14378,14 +14378,14 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 					right: n$5.prefix,
 					rest: n$5.rest
 				};
-			}(e$4.map((e$5) => e$5.elements), r$4), s$4 = [];
+			}(e$4.map(((e$5) => e$5.elements)), r$4), s$4 = [];
 			for (const e$5 of n$4.rest) s$4.push(...e$5);
-			const a$4 = exports.Chars.empty(r$4).union(...s$4.map((e$5) => Ee(e$5, r$4).chars)), o$3 = "ltr" === t$5 ? n$4.right : n$4.left;
-			if (o$3.some((e$5) => e$5.isDisjointWith(a$4))) return !0;
+			const a$4 = exports.Chars.empty(r$4).union(...s$4.map(((e$5) => Ee(e$5, r$4).chars))), o$3 = "ltr" === t$5 ? n$4.right : n$4.left;
+			if (o$3.some(((e$5) => e$5.isDisjointWith(a$4)))) return !0;
 			const c$3 = e$4[0].parent;
 			if ("Pattern" === c$3.type || "Assertion" === c$3.type) return !1;
 			return ce(c$3, t$5, r$4).char.isDisjointWith(a$4);
-		}(t$4, r$3, n$3));
+		}(t$4, r$3, n$3)));
 	}
 	function be(e$3, t$3, r$3) {
 		const n$3 = function(e$4, t$4, r$4) {
@@ -14421,10 +14421,10 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			rest: e$3
 		} : {
 			prefix: n$3,
-			rest: e$3.map((e$4) => {
+			rest: e$3.map(((e$4) => {
 				const r$4 = "ltr" === t$3 ? n$3.length : 0, s$3 = "ltr" === t$3 ? e$4.length : e$4.length - n$3.length;
 				return e$4.slice(r$4, s$3);
-			})
+			}))
 		};
 	}
 	exports.canReorder = function(e$3, t$3, r$3 = {}) {
@@ -14482,16 +14482,16 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "Character":
 			case "CharacterClassRange": return !1;
 			case "CharacterSet": return "property" === t$3.kind && t$3.strings;
-			case "CharacterClass": return !(t$3.negate || !t$3.unicodeSets) && t$3.elements.some((t$4) => e$3(t$4, r$3));
+			case "CharacterClass": return !(t$3.negate || !t$3.unicodeSets) && t$3.elements.some(((t$4) => e$3(t$4, r$3)));
 			case "ExpressionCharacterClass": return e$3(t$3.expression, r$3);
 			case "ClassIntersection":
 			case "ClassSubtraction": return !f$1(t$3, r$3).accept.isEmpty;
-			case "ClassStringDisjunction": return t$3.alternatives.some((t$4) => e$3(t$4, r$3));
+			case "ClassStringDisjunction": return t$3.alternatives.some(((t$4) => e$3(t$4, r$3)));
 			case "StringAlternative": return 1 !== t$3.elements.length;
 			default: return n$1(t$3);
 		}
 	}, exports.invertMatchingDirection = R, exports.isEmpty = function(e$3, t$3) {
-		return y$1(e$3, (e$4) => A$1(e$4, t$3));
+		return y$1(e$3, ((e$4) => A$1(e$4, t$3)));
 	}, exports.isEmptyBackreference = I, exports.isLengthRangeMinZero = q, exports.isPotentiallyEmpty = function(e$3, t$3) {
 		if (!a$1(e$3)) switch (e$3.type) {
 			case "Character":
@@ -14504,7 +14504,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "ClassStringDisjunction":
 			case "StringAlternative": return x$1(e$3);
 		}
-		return S$1(e$3, (e$4) => function(e$5, t$4) {
+		return S$1(e$3, ((e$4) => function(e$5, t$4) {
 			return r$3(e$5);
 			function r$3(s$3) {
 				switch (s$3.type) {
@@ -14521,7 +14521,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 					default: throw n$1(s$3);
 				}
 			}
-		}(e$4, t$3));
+		}(e$4, t$3)));
 	}, exports.isPotentiallyZeroLength = function(e$3, t$3) {
 		if (!a$1(e$3)) switch (e$3.type) {
 			case "Character":
@@ -14534,7 +14534,7 @@ var require_regexp_ast_analysis = __commonJS({ "node_modules/.pnpm/regexp-ast-an
 			case "ClassStringDisjunction":
 			case "StringAlternative": return x$1(e$3);
 		}
-		return S$1(e$3, (e$4) => k(e$4, e$4, t$3));
+		return S$1(e$3, ((e$4) => k(e$4, e$4, t$3)));
 	}, exports.isStrictBackreference = B, exports.isZeroLength = v$1, exports.matchesAllCharacters = m$1, exports.matchesNoCharacters = d$1, exports.structurallyEqual = K, exports.toCache = u$1, exports.toCharSet = h$1, exports.toUnicodeSet = f$1;
 } });
 
@@ -18941,9 +18941,9 @@ var require_regexp_ast = __commonJS({ "node_modules/.pnpm/eslint-plugin-regexp@2
 } });
 
 //#endregion
-//#region node_modules/.pnpm/tsdown@0.12.9_typescript@5.8.2/node_modules/tsdown/esm-shims.js
+//#region node_modules/.pnpm/tsdown@0.13.0_typescript@5.8.3/node_modules/tsdown/esm-shims.js
 var getFilename, getDirname, __dirname, __filename;
-var init_esm_shims = __esm({ "node_modules/.pnpm/tsdown@0.12.9_typescript@5.8.2/node_modules/tsdown/esm-shims.js"() {
+var init_esm_shims = __esm({ "node_modules/.pnpm/tsdown@0.13.0_typescript@5.8.3/node_modules/tsdown/esm-shims.js"() {
 	getFilename = () => fileURLToPath(import.meta.url);
 	getDirname = () => path.dirname(getFilename());
 	__dirname = /* @__PURE__ */ getDirname();
@@ -18951,8 +18951,8 @@ var init_esm_shims = __esm({ "node_modules/.pnpm/tsdown@0.12.9_typescript@5.8.2/
 } });
 
 //#endregion
-//#region node_modules/.pnpm/typescript@5.8.2/node_modules/typescript/lib/typescript.js
-var require_typescript = __commonJS({ "node_modules/.pnpm/typescript@5.8.2/node_modules/typescript/lib/typescript.js"(exports, module) {
+//#region node_modules/.pnpm/typescript@5.8.3/node_modules/typescript/lib/typescript.js
+var require_typescript = __commonJS({ "node_modules/.pnpm/typescript@5.8.3/node_modules/typescript/lib/typescript.js"(exports, module) {
 	init_esm_shims();
 	/*! *****************************************************************************
 	Copyright (c) Microsoft Corporation. All rights reserved.
@@ -21240,7 +21240,7 @@ var require_typescript = __commonJS({ "node_modules/.pnpm/typescript@5.8.2/node_
 		});
 		module$1.exports = __toCommonJS(typescript_exports);
 		var versionMajorMinor = "5.8";
-		var version = "5.8.2";
+		var version = "5.8.3";
 		var Comparison = /* @__PURE__ */ ((Comparison3) => {
 			Comparison3[Comparison3["LessThan"] = -1] = "LessThan";
 			Comparison3[Comparison3["EqualTo"] = 0] = "EqualTo";
@@ -67918,10 +67918,11 @@ ${lanes.join("\n")}
 					serializeExistingTypeNode(context, typeNode, addUndefined) {
 						return serializeExistingTypeNode(context, typeNode, !!addUndefined);
 					},
-					serializeReturnTypeForSignature(syntacticContext, signatureDeclaration) {
+					serializeReturnTypeForSignature(syntacticContext, signatureDeclaration, symbol) {
 						const context = syntacticContext;
 						const signature = getSignatureFromDeclaration(signatureDeclaration);
-						const returnType = context.enclosingSymbolTypes.get(getSymbolId(getSymbolOfDeclaration(signatureDeclaration))) ?? instantiateType(getReturnTypeOfSignature(signature), context.mapper);
+						symbol ?? (symbol = getSymbolOfDeclaration(signatureDeclaration));
+						const returnType = context.enclosingSymbolTypes.get(getSymbolId(symbol)) ?? instantiateType(getReturnTypeOfSignature(signature), context.mapper);
 						return serializeInferredReturnTypeForSignature(context, signature, returnType);
 					},
 					serializeTypeOfExpression(syntacticContext, expr) {
@@ -67934,7 +67935,7 @@ ${lanes.join("\n")}
 						const context = syntacticContext;
 						symbol ?? (symbol = getSymbolOfDeclaration(declaration));
 						let type = (_a$2 = context.enclosingSymbolTypes) == null ? void 0 : _a$2.get(getSymbolId(symbol));
-						if (type === void 0) type = symbol && !(symbol.flags & 133120) ? instantiateType(getWidenedLiteralType(getTypeOfSymbol(symbol)), context.mapper) : errorType;
+						if (type === void 0) type = symbol.flags & 98304 && declaration.kind === 178 ? instantiateType(getWriteTypeOfSymbol(symbol), context.mapper) : symbol && !(symbol.flags & 133120) ? instantiateType(getWidenedLiteralType(getTypeOfSymbol(symbol)), context.mapper) : errorType;
 						const addUndefinedForParameter = declaration && (isParameter(declaration) || isJSDocParameterTag(declaration)) && requiresAddingImplicitUndefined(declaration, context.enclosingDeclaration);
 						if (addUndefinedForParameter) type = getOptionalType(type);
 						return serializeInferredTypeForDeclaration(symbol, context, type);
@@ -67981,6 +67982,7 @@ ${lanes.join("\n")}
 						const context = syntacticContext;
 						if (context.bundled || context.enclosingFile !== getSourceFileOfNode(lit)) {
 							let name = lit.text;
+							const originalName = name;
 							const nodeSymbol = getNodeLinks(parent2).resolvedSymbol;
 							const meaning = parent2.isTypeOf ? 111551 : 788968;
 							const parentSymbol = nodeSymbol && isSymbolAccessible(nodeSymbol, context.enclosingDeclaration, meaning, false).accessibility === 0 && lookupSymbolChain(nodeSymbol, context, meaning, true)[0];
@@ -67993,7 +67995,7 @@ ${lanes.join("\n")}
 								context.encounteredError = true;
 								if (context.tracker.reportLikelyUnsafeImportRequiredError) context.tracker.reportLikelyUnsafeImportRequiredError(name);
 							}
-							return name;
+							if (name !== originalName) return name;
 						}
 					},
 					canReuseTypeNode(context, typeNode) {
@@ -68717,12 +68719,13 @@ ${lanes.join("\n")}
 					if (propertySymbol.flags & 98304) {
 						const writeType = getWriteTypeOfSymbol(propertySymbol);
 						if (propertyType !== writeType && !isErrorType(propertyType) && !isErrorType(writeType)) {
+							const symbolMapper = getSymbolLinks(propertySymbol).mapper;
 							const getterDeclaration = getDeclarationOfKind(propertySymbol, 177);
 							const getterSignature = getSignatureFromDeclaration(getterDeclaration);
-							typeElements.push(setCommentRange2(context, signatureToSignatureDeclarationHelper(getterSignature, 177, context, { name: propertyName }), getterDeclaration));
+							typeElements.push(setCommentRange2(context, signatureToSignatureDeclarationHelper(symbolMapper ? instantiateSignature(getterSignature, symbolMapper) : getterSignature, 177, context, { name: propertyName }), getterDeclaration));
 							const setterDeclaration = getDeclarationOfKind(propertySymbol, 178);
 							const setterSignature = getSignatureFromDeclaration(setterDeclaration);
-							typeElements.push(setCommentRange2(context, signatureToSignatureDeclarationHelper(setterSignature, 178, context, { name: propertyName }), setterDeclaration));
+							typeElements.push(setCommentRange2(context, signatureToSignatureDeclarationHelper(symbolMapper ? instantiateSignature(setterSignature, symbolMapper) : setterSignature, 178, context, { name: propertyName }), setterDeclaration));
 							return;
 						}
 					}
@@ -69477,12 +69480,10 @@ ${lanes.join("\n")}
 					const addUndefinedForParameter = declaration && (isParameter(declaration) || isJSDocParameterTag(declaration)) && requiresAddingImplicitUndefined(declaration, context.enclosingDeclaration);
 					const decl = declaration ?? symbol.valueDeclaration ?? getDeclarationWithTypeAnnotation(symbol) ?? ((_a$2 = symbol.declarations) == null ? void 0 : _a$2[0]);
 					if (decl) {
+						const restore = addSymbolTypeToContext(context, symbol, type);
 						if (isAccessor(decl)) result = syntacticNodeBuilder.serializeTypeOfAccessor(decl, symbol, context);
-						else if (hasInferredType(decl) && !nodeIsSynthesized(decl) && !(getObjectFlags(type) & 196608)) {
-							const restore = addSymbolTypeToContext(context, symbol, type);
-							result = syntacticNodeBuilder.serializeTypeOfDeclaration(decl, symbol, context);
-							restore();
-						}
+						else if (hasInferredType(decl) && !nodeIsSynthesized(decl) && !(getObjectFlags(type) & 196608)) result = syntacticNodeBuilder.serializeTypeOfDeclaration(decl, symbol, context);
+						restore();
 					}
 					if (!result) {
 						if (addUndefinedForParameter) type = getOptionalType(type);
@@ -69589,8 +69590,7 @@ ${lanes.join("\n")}
 							return setTextRange2(context, setEmitFlags(name, 16777216), node2);
 						}
 						const updated = visitEachChild(node2, (c$3) => attachSymbolToLeftmostIdentifier(c$3), void 0);
-						if (updated !== node2) setTextRange2(context, updated, node2);
-						return updated;
+						return setTextRange2(context, updated, node2);
 					}
 				}
 				function serializeTypeName(context, node$1, isTypeOf, typeArguments) {
@@ -85815,6 +85815,11 @@ ${lanes.join("\n")}
 				if (node$1.kind === 216) {
 					const file = getSourceFileOfNode(node$1);
 					if (file && fileExtensionIsOneOf(file.fileName, [".cts", ".mts"])) grammarErrorOnNode(node$1, Diagnostics.This_syntax_is_reserved_in_files_with_the_mts_or_cts_extension_Use_an_as_expression_instead);
+					if (compilerOptions.erasableSyntaxOnly) {
+						const start = skipTrivia(file.text, node$1.pos);
+						const end = node$1.expression.pos;
+						diagnostics.add(createFileDiagnostic(file, start, end - start, Diagnostics.This_syntax_is_not_allowed_when_erasableSyntaxOnly_is_enabled));
+					}
 				}
 				return checkAssertionWorker(node$1, checkMode);
 			}
@@ -121236,7 +121241,9 @@ ${lanes.join("\n")}
 							return node$1;
 						}
 						if (!resolver.canReuseTypeNode(context, node$1)) return resolver.serializeExistingTypeNode(context, node$1);
-						return factory.updateImportTypeNode(node$1, factory.updateLiteralTypeNode(node$1.argument, rewriteModuleSpecifier2(node$1, node$1.argument.literal)), visitNode(node$1.attributes, visitExistingNodeTreeSymbols, isImportAttributes), visitNode(node$1.qualifier, visitExistingNodeTreeSymbols, isEntityName), visitNodes2(node$1.typeArguments, visitExistingNodeTreeSymbols, isTypeNode), node$1.isTypeOf);
+						const specifier = rewriteModuleSpecifier2(node$1, node$1.argument.literal);
+						const literal = specifier === node$1.argument.literal ? reuseNode(context, node$1.argument.literal) : specifier;
+						return factory.updateImportTypeNode(node$1, literal === node$1.argument.literal ? reuseNode(context, node$1.argument) : factory.createLiteralTypeNode(literal), visitNode(node$1.attributes, visitExistingNodeTreeSymbols, isImportAttributes), visitNode(node$1.qualifier, visitExistingNodeTreeSymbols, isEntityName), visitNodes2(node$1.typeArguments, visitExistingNodeTreeSymbols, isTypeNode), node$1.isTypeOf);
 					}
 					if (isNamedDeclaration(node$1) && node$1.name.kind === 167 && !resolver.hasLateBindableName(node$1)) {
 						if (!hasDynamicName(node$1)) return visitEachChild2(node$1, visitExistingNodeTreeSymbols);
@@ -121346,8 +121353,7 @@ ${lanes.join("\n")}
 					}
 					function rewriteModuleSpecifier2(parent2, lit) {
 						const newName = resolver.getModuleSpecifierOverride(context, parent2, lit);
-						if (newName) return setOriginalNode(factory.createStringLiteral(newName), lit);
-						return visitNode(lit, visitExistingNodeTreeSymbols, isStringLiteral$1);
+						return newName ? setOriginalNode(factory.createStringLiteral(newName), lit) : lit;
 					}
 				}
 			}
@@ -121447,7 +121453,7 @@ ${lanes.join("\n")}
 				const accessorDeclarations = resolver.getAllAccessorDeclarations(node$1);
 				const accessorType = getTypeAnnotationFromAllAccessorDeclarations(node$1, accessorDeclarations);
 				if (accessorType && !isTypePredicateNode(accessorType)) return withNewScope(context, node$1, () => serializeTypeAnnotationOfDeclaration(accessorType, context, node$1, symbol) ?? inferTypeOfDeclaration(node$1, symbol, context));
-				if (accessorDeclarations.getAccessor) return withNewScope(context, accessorDeclarations.getAccessor, () => createReturnFromSignature(accessorDeclarations.getAccessor, void 0, context));
+				if (accessorDeclarations.getAccessor) return withNewScope(context, accessorDeclarations.getAccessor, () => createReturnFromSignature(accessorDeclarations.getAccessor, symbol, context));
 				return void 0;
 			}
 			function typeFromVariable(node$1, symbol, context) {
@@ -121505,10 +121511,10 @@ ${lanes.join("\n")}
 				if (context.noInferenceFallback === true) return factory.createKeywordTypeNode(133);
 				return resolver.serializeTypeOfExpression(context, node$1) ?? factory.createKeywordTypeNode(133);
 			}
-			function inferReturnTypeOfSignatureSignature(node$1, context, reportFallback) {
+			function inferReturnTypeOfSignatureSignature(node$1, context, symbol, reportFallback) {
 				if (reportFallback) context.tracker.reportInferenceFallback(node$1);
 				if (context.noInferenceFallback === true) return factory.createKeywordTypeNode(133);
-				return resolver.serializeReturnTypeForSignature(context, node$1) ?? factory.createKeywordTypeNode(133);
+				return resolver.serializeReturnTypeForSignature(context, node$1, symbol) ?? factory.createKeywordTypeNode(133);
 			}
 			function inferAccessorType(node$1, allAccessors, context, symbol, reportFallback = true) {
 				if (node$1.kind === 177) return createReturnFromSignature(node$1, symbol, context, reportFallback);
@@ -121698,7 +121704,8 @@ ${lanes.join("\n")}
 			function reuseTypeParameters(typeParameters, context) {
 				return typeParameters == null ? void 0 : typeParameters.map((tp) => {
 					var _a$2;
-					return factory.updateTypeParameterDeclaration(tp, (_a$2 = tp.modifiers) == null ? void 0 : _a$2.map((m$3) => reuseNode(context, m$3)), reuseNode(context, tp.name), serializeExistingTypeNodeWithFallback(tp.constraint, context), serializeExistingTypeNodeWithFallback(tp.default, context));
+					const { node: tpName } = resolver.trackExistingEntityName(context, tp.name);
+					return factory.updateTypeParameterDeclaration(tp, (_a$2 = tp.modifiers) == null ? void 0 : _a$2.map((m$3) => reuseNode(context, m$3)), tpName, serializeExistingTypeNodeWithFallback(tp.constraint, context), serializeExistingTypeNodeWithFallback(tp.default, context));
 				});
 			}
 			function typeFromObjectLiteralMethod(method, name, context, isConstContext) {
@@ -121759,7 +121766,7 @@ ${lanes.join("\n")}
 				const returnTypeNode = isJSDocConstructSignature(fn$1) ? getEffectiveTypeAnnotationNode(fn$1.parameters[0]) : getEffectiveReturnTypeNode(fn$1);
 				if (returnTypeNode) returnType = syntacticResult(serializeTypeAnnotationOfDeclaration(returnTypeNode, context, fn$1, symbol));
 				else if (isValueSignatureDeclaration(fn$1)) returnType = typeFromSingleReturnExpression(fn$1, context);
-				return returnType.type !== void 0 ? returnType.type : inferReturnTypeOfSignatureSignature(fn$1, context, reportFallback && returnType.reportFallback && !returnTypeNode);
+				return returnType.type !== void 0 ? returnType.type : inferReturnTypeOfSignatureSignature(fn$1, context, symbol, reportFallback && returnType.reportFallback && !returnTypeNode);
 			}
 			function typeFromSingleReturnExpression(declaration, context) {
 				let candidateExpr;
@@ -144386,7 +144393,7 @@ ${newComment.split("\n").map((c$3) => ` * ${c$3}`).join("\n")}
 							const isValidAccess = isNamespaceName ? (symbol2) => {
 								var _a$2;
 								return !!(symbol2.flags & 1920) && !((_a$2 = symbol2.declarations) == null ? void 0 : _a$2.every((d$3) => d$3.parent === node$1.parent));
-							} : isRhsOfImportDeclaration ? (symbol2) => isValidTypeAccess(symbol2) || isValidValueAccess(symbol2) : isTypeLocation || insideJsDocTagTypeExpression ? isValidTypeAccess : isValidValueAccess;
+							} : isRhsOfImportDeclaration ? ((symbol2) => isValidTypeAccess(symbol2) || isValidValueAccess(symbol2)) : isTypeLocation || insideJsDocTagTypeExpression ? isValidTypeAccess : isValidValueAccess;
 							for (const exportedSymbol of exportedSymbols) if (isValidAccess(exportedSymbol)) symbols.push(exportedSymbol);
 							if (!isTypeLocation && !insideJsDocTagTypeExpression && symbol.declarations && symbol.declarations.some((d$3) => d$3.kind !== 307 && d$3.kind !== 267 && d$3.kind !== 266)) {
 								let type = typeChecker.getTypeOfSymbolAtLocation(symbol, node$1).getNonOptionalType();
@@ -171034,9 +171041,9 @@ var require_object = __commonJS({ "node_modules/.pnpm/eslint-plugin-regexp@2.9.0
 	var TypeObject = class {
 		constructor(propertiesGenerator) {
 			this.type = "Object";
-			this.propertiesGenerator = propertiesGenerator !== null && propertiesGenerator !== void 0 ? propertiesGenerator : () => {
+			this.propertiesGenerator = propertiesGenerator !== null && propertiesGenerator !== void 0 ? propertiesGenerator : (() => {
 				return [][Symbol.iterator]();
-			};
+			});
 		}
 		*allProperties() {
 			const set = /* @__PURE__ */ new Set();
@@ -176963,7 +176970,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 		};
 	}
 	function m(r$3, a$3) {
-		if (Array.isArray(r$3)) return o(r$3.map((e$3) => m(e$3, a$3)), a$3);
+		if (Array.isArray(r$3)) return o(r$3.map(((e$3) => m(e$3, a$3))), a$3);
 		switch (r$3.type) {
 			case "Alternative": return c(function* () {
 				for (const e$3 of r$3.elements) yield m(e$3, a$3);
@@ -177026,7 +177033,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 					consume: t$3.chars,
 					assert: r$4
 				};
-				return t$3.isEmpty || t$3.accept.isEmpty ? a$4 : u([a$4, ...t$3.accept.wordSets.map((e$3) => {
+				return t$3.isEmpty || t$3.accept.isEmpty ? a$4 : u([a$4, ...t$3.accept.wordSets.map(((e$3) => {
 					if (0 === e$3.length) return {
 						consume: r$4,
 						assert: n$3
@@ -177037,7 +177044,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 						consume: t$4,
 						assert: r$4
 					};
-				})], e.CharSet.empty(t$3.chars.maximum));
+				}))], e.CharSet.empty(t$3.chars.maximum));
 			}(t.toUnicodeSet(r$3, a$3));
 			case "Quantifier": return 0 === r$3.max ? {
 				consume: t.Chars.empty(a$3),
@@ -177067,7 +177074,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 	function f(e$3, r$3, a$3, s$3, i$3) {
 		return 1 === t.followPaths(e$3, "enter", 0, {
 			fork: (e$4) => e$4,
-			join: (e$4) => e$4.every((e$5) => 2 === e$5) ? 2 : e$4.some((e$5) => 1 === e$5) ? 1 : 0,
+			join: (e$4) => e$4.every(((e$5) => 2 === e$5)) ? 2 : e$4.some(((e$5) => 1 === e$5)) ? 1 : 0,
 			assert: (e$4, t$3, r$4) => 1 === r$4 ? r$4 : e$4,
 			continueAfter: (t$3, r$4) => t$3 !== e$3 && 0 === r$4,
 			continueInto: (e$4, t$3) => 0 === t$3,
@@ -177117,7 +177124,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 		return 0 === t$3 ? "" : 1 === t$3 ? e$3.raw : e$3.raw + `{${t$3}}`;
 	}
 	function C(e$3) {
-		return t.hasSomeDescendant(e$3, (e$4) => "CapturingGroup" === e$4.type);
+		return t.hasSomeDescendant(e$3, ((e$4) => "CapturingGroup" === e$4.type));
 	}
 	var w = class {
 		constructor(e$3) {
@@ -177302,7 +177309,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 		};
 	}
 	function A(e$3, r$3) {
-		return t.hasSomeAncestor(r$3, (t$3) => t$3 === e$3);
+		return t.hasSomeAncestor(r$3, ((t$3) => t$3 === e$3));
 	}
 	const b = new r.RegExpParser();
 	exports.analyse = function(e$3, a$3) {
@@ -177385,7 +177392,7 @@ var require_scslre = __commonJS({ "node_modules/.pnpm/scslre@0.3.0/node_modules/
 				let n$3 = t$3.get(r$3);
 				return void 0 === n$3 && (n$3 = e$4(r$3), t$3.set(r$3, n$3)), n$3;
 			};
-		}((e$4) => m(e$4, i$3)), j$2 = {
+		}(((e$4) => m(e$4, i$3))), j$2 = {
 			fork: (e$4) => e$4,
 			join: (e$4) => o(e$4, i$3),
 			continueAfter: (e$4, t$3) => !(t$3.assert.isEmpty && t$3.consume.isEmpty) && d$3.reports.length < u$3,
@@ -185271,7 +185278,7 @@ async function vue(options = {}) {
 //#endregion
 //#region src/configs/vue-i18n.ts
 async function vueI18n(options = {}) {
-	const { files = [GLOB_TS, GLOB_VUE], ignores: ignores$1 = [], isInEditor = false, localesDirectory = "locales", noRawTextIgnores = {
+	const { enableNoUnusedKeys = "never", files = [GLOB_TS, GLOB_VUE], ignores: ignores$1 = [], isInEditor = false, localesDirectory = "locales", noRawTextIgnores = {
 		nodes: [
 			"md-icon",
 			"v-icon",
@@ -185325,11 +185332,11 @@ async function vueI18n(options = {}) {
 				ignorePattern: noRawTextIgnores.pattern,
 				ignoreText: noRawTextIgnores.text
 			}],
-			"@intlify/vue-i18n/no-unused-keys": ["error", {
+			...enableNoUnusedKeys === "always" || enableNoUnusedKeys === "ci" && process$1.env.CI ? { "@intlify/vue-i18n/no-unused-keys": ["error", {
 				extensions: [".ts", ".vue"],
 				ignores: ignores$1,
 				src: path.join(".", src)
-			}],
+			}] } : {},
 			...overrides
 		},
 		settings: { "vue-i18n": {