@music-lyric-player/base 0.12.1 → 0.14.0

package/dist/index.ecma.js

@@ -3,6 +3,7 @@ import "lodash-es";
 const Wt = or({
   driver: "animation",
   bridgeActive: !0,
+  mergeWindow: 300,
   offset: {
     global: 0,
     useMeta: !0,
@@ -12,13 +13,13 @@ const Wt = or({
   __proto__: null,
   DEFAULT: Wt
 }, Symbol.toStringTag, { value: "Module" })), We = (t = 8) => {
-  const n = new Uint8Array(t);
+  const s = new Uint8Array(t);
   if (typeof globalThis.crypto?.getRandomValues == "function")
-    crypto.getRandomValues(n);
+    crypto.getRandomValues(s);
   else
-    for (let r = 0; r < n.length; r++)
-      n[r] = Math.floor(Math.random() * 256);
-  return Array.from(n).map((r) => r.toString(16).padStart(2, "0")).join("");
+    for (let r = 0; r < s.length; r++)
+      s[r] = Math.floor(Math.random() * 256);
+  return Array.from(s).map((r) => r.toString(16).padStart(2, "0")).join("");
 };
 class W {
   start = 0;
@@ -55,7 +56,7 @@ class hr {
   content = "";
 }
 var Jt = /* @__PURE__ */ ((t) => (t.Normal = "Normal", t.Interlude = "Interlude", t))(Jt || {});
-class pr {
+class dr {
   id = We(4).toUpperCase();
   type = "Interlude";
   time = new W();
@@ -64,7 +65,7 @@ class Kt {
   words = [];
   extended = [];
   get original() {
-    return this.words.map((n) => n.type === Ye.Normal ? n.content : " ".repeat(n.count)).join("");
+    return this.words.map((s) => s.type === Ye.Normal ? s.content : " ".repeat(s.count)).join("");
   }
   toJSON() {
     return {
@@ -81,16 +82,16 @@ class Zt {
   content = new Kt();
   agent;
 }
-class Er extends Zt {
-}
 class mr extends Zt {
+}
+class Er extends Zt {
   background;
 }
 var Qt = /* @__PURE__ */ ((t) => (t.Offset = "Offset", t.Duration = "Duration", t.Title = "Title", t.Singer = "Singer", t.Album = "Album", t.Creator = "Creator", t.Unknown = "Unknown", t))(Qt || {});
 class F {
   id = We(4).toUpperCase();
 }
-class dr extends F {
+class pr extends F {
   type = "Offset";
   content = 0;
 }
@@ -106,11 +107,11 @@ class Ir extends F {
   type = "Singer";
   content = "";
 }
-class $r extends F {
+class gr extends F {
   type = "Album";
   content = "";
 }
-class gr extends F {
+class $r extends F {
   type = "Creator";
   content = {
     role: "",
@@ -138,31 +139,31 @@ class Nr {
 }
 const tr = "0.6.0";
 var rr = /* @__PURE__ */ ((t) => (t.Invalid = "Invalid", t.Normal = "Normal", t.Syllable = "Syllable", t.Pure = "Pure", t.Empty = "Empty", t.NoTime = "NoTime", t))(rr || {});
-class Or {
+class Sr {
   version = tr;
   type = "Invalid";
   metas = [];
   lines = [];
   agents = [];
 }
-const M = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const X = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Agent: Tr,
   Extended: hr,
   ExtendedType: zt,
-  Info: Or,
+  Info: Sr,
   InfoType: rr,
   LineAgent: Nr,
   LineAgentIndex: er,
-  LineInterlude: pr,
-  LineNormal: mr,
-  LineNormalBackground: Er,
+  LineInterlude: dr,
+  LineNormal: Er,
+  LineNormalBackground: mr,
   LineNormalContent: Kt,
   LineType: Jt,
-  MetaAlbum: $r,
-  MetaCreator: gr,
+  MetaAlbum: gr,
+  MetaCreator: $r,
   MetaDuration: Rr,
-  MetaOffset: dr,
+  MetaOffset: pr,
   MetaSinger: Ir,
   MetaTitle: vr,
   MetaType: Qt,
@@ -178,11 +179,11 @@ var H = { exports: {} }, se, tt;
 function Y() {
   if (tt) return se;
   tt = 1;
-  const t = "2.0.0", n = 256, r = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
-  9007199254740991, s = 16, i = n - 6;
+  const t = "2.0.0", s = 256, r = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+  9007199254740991, n = 16, i = s - 6;
   return se = {
-    MAX_LENGTH: n,
-    MAX_SAFE_COMPONENT_LENGTH: s,
+    MAX_LENGTH: s,
+    MAX_SAFE_COMPONENT_LENGTH: n,
     MAX_SAFE_BUILD_LENGTH: i,
     MAX_SAFE_INTEGER: r,
     RELEASE_TYPES: [
@@ -201,92 +202,92 @@ function Y() {
 }
 var ne, rt;
 function z() {
-  return rt || (rt = 1, ne = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...n) => console.error("SEMVER", ...n) : () => {
+  return rt || (rt = 1, ne = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...s) => console.error("SEMVER", ...s) : () => {
   }), ne;
 }
 var st;
 function B() {
-  return st || (st = 1, (function(t, n) {
+  return st || (st = 1, (function(t, s) {
     const {
       MAX_SAFE_COMPONENT_LENGTH: r,
-      MAX_SAFE_BUILD_LENGTH: s,
+      MAX_SAFE_BUILD_LENGTH: n,
       MAX_LENGTH: i
-    } = Y(), u = z();
-    n = t.exports = {};
-    const l = n.re = [], h = n.safeRe = [], o = n.src = [], a = n.safeSrc = [], e = n.t = {};
-    let c = 0;
-    const f = "[a-zA-Z0-9-]", d = [
+    } = Y(), c = z();
+    s = t.exports = {};
+    const l = s.re = [], h = s.safeRe = [], o = s.src = [], a = s.safeSrc = [], e = s.t = {};
+    let u = 0;
+    const f = "[a-zA-Z0-9-]", p = [
       ["\\s", 1],
       ["\\d", i],
-      [f, s]
-    ], O = (N) => {
-      for (const [A, G] of d)
+      [f, n]
+    ], S = (N) => {
+      for (const [A, G] of p)
         N = N.split(`${A}*`).join(`${A}{0,${G}}`).split(`${A}+`).join(`${A}{1,${G}}`);
       return N;
-    }, E = (N, A, G) => {
-      const w = O(A), x = c++;
-      u(N, x, A), e[N] = x, o[x] = A, a[x] = w, l[x] = new RegExp(A, G ? "g" : void 0), h[x] = new RegExp(w, G ? "g" : void 0);
+    }, m = (N, A, G) => {
+      const w = S(A), x = u++;
+      c(N, x, A), e[N] = x, o[x] = A, a[x] = w, l[x] = new RegExp(A, G ? "g" : void 0), h[x] = new RegExp(w, G ? "g" : void 0);
     };
-    E("NUMERICIDENTIFIER", "0|[1-9]\\d*"), E("NUMERICIDENTIFIERLOOSE", "\\d+"), E("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${f}*`), E("MAINVERSION", `(${o[e.NUMERICIDENTIFIER]})\\.(${o[e.NUMERICIDENTIFIER]})\\.(${o[e.NUMERICIDENTIFIER]})`), E("MAINVERSIONLOOSE", `(${o[e.NUMERICIDENTIFIERLOOSE]})\\.(${o[e.NUMERICIDENTIFIERLOOSE]})\\.(${o[e.NUMERICIDENTIFIERLOOSE]})`), E("PRERELEASEIDENTIFIER", `(?:${o[e.NONNUMERICIDENTIFIER]}|${o[e.NUMERICIDENTIFIER]})`), E("PRERELEASEIDENTIFIERLOOSE", `(?:${o[e.NONNUMERICIDENTIFIER]}|${o[e.NUMERICIDENTIFIERLOOSE]})`), E("PRERELEASE", `(?:-(${o[e.PRERELEASEIDENTIFIER]}(?:\\.${o[e.PRERELEASEIDENTIFIER]})*))`), E("PRERELEASELOOSE", `(?:-?(${o[e.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${o[e.PRERELEASEIDENTIFIERLOOSE]})*))`), E("BUILDIDENTIFIER", `${f}+`), E("BUILD", `(?:\\+(${o[e.BUILDIDENTIFIER]}(?:\\.${o[e.BUILDIDENTIFIER]})*))`), E("FULLPLAIN", `v?${o[e.MAINVERSION]}${o[e.PRERELEASE]}?${o[e.BUILD]}?`), E("FULL", `^${o[e.FULLPLAIN]}$`), E("LOOSEPLAIN", `[v=\\s]*${o[e.MAINVERSIONLOOSE]}${o[e.PRERELEASELOOSE]}?${o[e.BUILD]}?`), E("LOOSE", `^${o[e.LOOSEPLAIN]}$`), E("GTLT", "((?:<|>)?=?)"), E("XRANGEIDENTIFIERLOOSE", `${o[e.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), E("XRANGEIDENTIFIER", `${o[e.NUMERICIDENTIFIER]}|x|X|\\*`), E("XRANGEPLAIN", `[v=\\s]*(${o[e.XRANGEIDENTIFIER]})(?:\\.(${o[e.XRANGEIDENTIFIER]})(?:\\.(${o[e.XRANGEIDENTIFIER]})(?:${o[e.PRERELEASE]})?${o[e.BUILD]}?)?)?`), E("XRANGEPLAINLOOSE", `[v=\\s]*(${o[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[e.XRANGEIDENTIFIERLOOSE]})(?:${o[e.PRERELEASELOOSE]})?${o[e.BUILD]}?)?)?`), E("XRANGE", `^${o[e.GTLT]}\\s*${o[e.XRANGEPLAIN]}$`), E("XRANGELOOSE", `^${o[e.GTLT]}\\s*${o[e.XRANGEPLAINLOOSE]}$`), E("COERCEPLAIN", `(^|[^\\d])(\\d{1,${r}})(?:\\.(\\d{1,${r}}))?(?:\\.(\\d{1,${r}}))?`), E("COERCE", `${o[e.COERCEPLAIN]}(?:$|[^\\d])`), E("COERCEFULL", o[e.COERCEPLAIN] + `(?:${o[e.PRERELEASE]})?(?:${o[e.BUILD]})?(?:$|[^\\d])`), E("COERCERTL", o[e.COERCE], !0), E("COERCERTLFULL", o[e.COERCEFULL], !0), E("LONETILDE", "(?:~>?)"), E("TILDETRIM", `(\\s*)${o[e.LONETILDE]}\\s+`, !0), n.tildeTrimReplace = "$1~", E("TILDE", `^${o[e.LONETILDE]}${o[e.XRANGEPLAIN]}$`), E("TILDELOOSE", `^${o[e.LONETILDE]}${o[e.XRANGEPLAINLOOSE]}$`), E("LONECARET", "(?:\\^)"), E("CARETTRIM", `(\\s*)${o[e.LONECARET]}\\s+`, !0), n.caretTrimReplace = "$1^", E("CARET", `^${o[e.LONECARET]}${o[e.XRANGEPLAIN]}$`), E("CARETLOOSE", `^${o[e.LONECARET]}${o[e.XRANGEPLAINLOOSE]}$`), E("COMPARATORLOOSE", `^${o[e.GTLT]}\\s*(${o[e.LOOSEPLAIN]})$|^$`), E("COMPARATOR", `^${o[e.GTLT]}\\s*(${o[e.FULLPLAIN]})$|^$`), E("COMPARATORTRIM", `(\\s*)${o[e.GTLT]}\\s*(${o[e.LOOSEPLAIN]}|${o[e.XRANGEPLAIN]})`, !0), n.comparatorTrimReplace = "$1$2$3", E("HYPHENRANGE", `^\\s*(${o[e.XRANGEPLAIN]})\\s+-\\s+(${o[e.XRANGEPLAIN]})\\s*$`), E("HYPHENRANGELOOSE", `^\\s*(${o[e.XRANGEPLAINLOOSE]})\\s+-\\s+(${o[e.XRANGEPLAINLOOSE]})\\s*$`), E("STAR", "(<|>)?=?\\s*\\*"), E("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), E("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
+    m("NUMERICIDENTIFIER", "0|[1-9]\\d*"), m("NUMERICIDENTIFIERLOOSE", "\\d+"), m("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${f}*`), m("MAINVERSION", `(${o[e.NUMERICIDENTIFIER]})\\.(${o[e.NUMERICIDENTIFIER]})\\.(${o[e.NUMERICIDENTIFIER]})`), m("MAINVERSIONLOOSE", `(${o[e.NUMERICIDENTIFIERLOOSE]})\\.(${o[e.NUMERICIDENTIFIERLOOSE]})\\.(${o[e.NUMERICIDENTIFIERLOOSE]})`), m("PRERELEASEIDENTIFIER", `(?:${o[e.NONNUMERICIDENTIFIER]}|${o[e.NUMERICIDENTIFIER]})`), m("PRERELEASEIDENTIFIERLOOSE", `(?:${o[e.NONNUMERICIDENTIFIER]}|${o[e.NUMERICIDENTIFIERLOOSE]})`), m("PRERELEASE", `(?:-(${o[e.PRERELEASEIDENTIFIER]}(?:\\.${o[e.PRERELEASEIDENTIFIER]})*))`), m("PRERELEASELOOSE", `(?:-?(${o[e.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${o[e.PRERELEASEIDENTIFIERLOOSE]})*))`), m("BUILDIDENTIFIER", `${f}+`), m("BUILD", `(?:\\+(${o[e.BUILDIDENTIFIER]}(?:\\.${o[e.BUILDIDENTIFIER]})*))`), m("FULLPLAIN", `v?${o[e.MAINVERSION]}${o[e.PRERELEASE]}?${o[e.BUILD]}?`), m("FULL", `^${o[e.FULLPLAIN]}$`), m("LOOSEPLAIN", `[v=\\s]*${o[e.MAINVERSIONLOOSE]}${o[e.PRERELEASELOOSE]}?${o[e.BUILD]}?`), m("LOOSE", `^${o[e.LOOSEPLAIN]}$`), m("GTLT", "((?:<|>)?=?)"), m("XRANGEIDENTIFIERLOOSE", `${o[e.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), m("XRANGEIDENTIFIER", `${o[e.NUMERICIDENTIFIER]}|x|X|\\*`), m("XRANGEPLAIN", `[v=\\s]*(${o[e.XRANGEIDENTIFIER]})(?:\\.(${o[e.XRANGEIDENTIFIER]})(?:\\.(${o[e.XRANGEIDENTIFIER]})(?:${o[e.PRERELEASE]})?${o[e.BUILD]}?)?)?`), m("XRANGEPLAINLOOSE", `[v=\\s]*(${o[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${o[e.XRANGEIDENTIFIERLOOSE]})(?:${o[e.PRERELEASELOOSE]})?${o[e.BUILD]}?)?)?`), m("XRANGE", `^${o[e.GTLT]}\\s*${o[e.XRANGEPLAIN]}$`), m("XRANGELOOSE", `^${o[e.GTLT]}\\s*${o[e.XRANGEPLAINLOOSE]}$`), m("COERCEPLAIN", `(^|[^\\d])(\\d{1,${r}})(?:\\.(\\d{1,${r}}))?(?:\\.(\\d{1,${r}}))?`), m("COERCE", `${o[e.COERCEPLAIN]}(?:$|[^\\d])`), m("COERCEFULL", o[e.COERCEPLAIN] + `(?:${o[e.PRERELEASE]})?(?:${o[e.BUILD]})?(?:$|[^\\d])`), m("COERCERTL", o[e.COERCE], !0), m("COERCERTLFULL", o[e.COERCEFULL], !0), m("LONETILDE", "(?:~>?)"), m("TILDETRIM", `(\\s*)${o[e.LONETILDE]}\\s+`, !0), s.tildeTrimReplace = "$1~", m("TILDE", `^${o[e.LONETILDE]}${o[e.XRANGEPLAIN]}$`), m("TILDELOOSE", `^${o[e.LONETILDE]}${o[e.XRANGEPLAINLOOSE]}$`), m("LONECARET", "(?:\\^)"), m("CARETTRIM", `(\\s*)${o[e.LONECARET]}\\s+`, !0), s.caretTrimReplace = "$1^", m("CARET", `^${o[e.LONECARET]}${o[e.XRANGEPLAIN]}$`), m("CARETLOOSE", `^${o[e.LONECARET]}${o[e.XRANGEPLAINLOOSE]}$`), m("COMPARATORLOOSE", `^${o[e.GTLT]}\\s*(${o[e.LOOSEPLAIN]})$|^$`), m("COMPARATOR", `^${o[e.GTLT]}\\s*(${o[e.FULLPLAIN]})$|^$`), m("COMPARATORTRIM", `(\\s*)${o[e.GTLT]}\\s*(${o[e.LOOSEPLAIN]}|${o[e.XRANGEPLAIN]})`, !0), s.comparatorTrimReplace = "$1$2$3", m("HYPHENRANGE", `^\\s*(${o[e.XRANGEPLAIN]})\\s+-\\s+(${o[e.XRANGEPLAIN]})\\s*$`), m("HYPHENRANGELOOSE", `^\\s*(${o[e.XRANGEPLAINLOOSE]})\\s+-\\s+(${o[e.XRANGEPLAINLOOSE]})\\s*$`), m("STAR", "(<|>)?=?\\s*\\*"), m("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), m("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
   })(H, H.exports)), H.exports;
 }
 var ie, nt;
 function ze() {
   if (nt) return ie;
   nt = 1;
-  const t = Object.freeze({ loose: !0 }), n = Object.freeze({});
-  return ie = (s) => s ? typeof s != "object" ? t : s : n, ie;
+  const t = Object.freeze({ loose: !0 }), s = Object.freeze({});
+  return ie = (n) => n ? typeof n != "object" ? t : n : s, ie;
 }
 var ae, it;
 function sr() {
   if (it) return ae;
   it = 1;
-  const t = /^[0-9]+$/, n = (s, i) => {
-    if (typeof s == "number" && typeof i == "number")
-      return s === i ? 0 : s < i ? -1 : 1;
-    const u = t.test(s), l = t.test(i);
-    return u && l && (s = +s, i = +i), s === i ? 0 : u && !l ? -1 : l && !u ? 1 : s < i ? -1 : 1;
+  const t = /^[0-9]+$/, s = (n, i) => {
+    if (typeof n == "number" && typeof i == "number")
+      return n === i ? 0 : n < i ? -1 : 1;
+    const c = t.test(n), l = t.test(i);
+    return c && l && (n = +n, i = +i), n === i ? 0 : c && !l ? -1 : l && !c ? 1 : n < i ? -1 : 1;
   };
   return ae = {
-    compareIdentifiers: n,
-    rcompareIdentifiers: (s, i) => n(i, s)
+    compareIdentifiers: s,
+    rcompareIdentifiers: (n, i) => s(i, n)
   }, ae;
 }
 var oe, at;
 function b() {
   if (at) return oe;
   at = 1;
-  const t = z(), { MAX_LENGTH: n, MAX_SAFE_INTEGER: r } = Y(), { safeRe: s, t: i } = B(), u = ze(), { compareIdentifiers: l } = sr();
+  const t = z(), { MAX_LENGTH: s, MAX_SAFE_INTEGER: r } = Y(), { safeRe: n, t: i } = B(), c = ze(), { compareIdentifiers: l } = sr();
   class h {
     constructor(a, e) {
-      if (e = u(e), a instanceof h) {
+      if (e = c(e), a instanceof h) {
         if (a.loose === !!e.loose && a.includePrerelease === !!e.includePrerelease)
           return a;
         a = a.version;
       } else if (typeof a != "string")
         throw new TypeError(`Invalid version. Must be a string. Got type "${typeof a}".`);
-      if (a.length > n)
+      if (a.length > s)
         throw new TypeError(
-          `version is longer than ${n} characters`
+          `version is longer than ${s} characters`
         );
       t("SemVer", a, e), this.options = e, this.loose = !!e.loose, this.includePrerelease = !!e.includePrerelease;
-      const c = a.trim().match(e.loose ? s[i.LOOSE] : s[i.FULL]);
-      if (!c)
+      const u = a.trim().match(e.loose ? n[i.LOOSE] : n[i.FULL]);
+      if (!u)
         throw new TypeError(`Invalid Version: ${a}`);
-      if (this.raw = a, this.major = +c[1], this.minor = +c[2], this.patch = +c[3], this.major > r || this.major < 0)
+      if (this.raw = a, this.major = +u[1], this.minor = +u[2], this.patch = +u[3], this.major > r || this.major < 0)
         throw new TypeError("Invalid major version");
       if (this.minor > r || this.minor < 0)
         throw new TypeError("Invalid minor version");
       if (this.patch > r || this.patch < 0)
         throw new TypeError("Invalid patch version");
-      c[4] ? this.prerelease = c[4].split(".").map((f) => {
+      u[4] ? this.prerelease = u[4].split(".").map((f) => {
         if (/^[0-9]+$/.test(f)) {
-          const d = +f;
-          if (d >= 0 && d < r)
-            return d;
+          const p = +f;
+          if (p >= 0 && p < r)
+            return p;
         }
         return f;
-      }) : this.prerelease = [], this.build = c[5] ? c[5].split(".") : [], this.format();
+      }) : this.prerelease = [], this.build = u[5] ? u[5].split(".") : [], this.format();
     }
     format() {
       return this.version = `${this.major}.${this.minor}.${this.patch}`, this.prerelease.length && (this.version += `-${this.prerelease.join(".")}`), this.version;
@@ -314,60 +315,60 @@ function b() {
         return 0;
       let e = 0;
       do {
-        const c = this.prerelease[e], f = a.prerelease[e];
-        if (t("prerelease compare", e, c, f), c === void 0 && f === void 0)
+        const u = this.prerelease[e], f = a.prerelease[e];
+        if (t("prerelease compare", e, u, f), u === void 0 && f === void 0)
           return 0;
         if (f === void 0)
           return 1;
-        if (c === void 0)
+        if (u === void 0)
           return -1;
-        if (c === f)
+        if (u === f)
           continue;
-        return l(c, f);
+        return l(u, f);
       } while (++e);
     }
     compareBuild(a) {
       a instanceof h || (a = new h(a, this.options));
       let e = 0;
       do {
-        const c = this.build[e], f = a.build[e];
-        if (t("build compare", e, c, f), c === void 0 && f === void 0)
+        const u = this.build[e], f = a.build[e];
+        if (t("build compare", e, u, f), u === void 0 && f === void 0)
           return 0;
         if (f === void 0)
           return 1;
-        if (c === void 0)
+        if (u === void 0)
           return -1;
-        if (c === f)
+        if (u === f)
           continue;
-        return l(c, f);
+        return l(u, f);
       } while (++e);
     }
     // preminor will bump the version up to the next minor release, and immediately
     // down to pre-release. premajor and prepatch work the same way.
-    inc(a, e, c) {
+    inc(a, e, u) {
       if (a.startsWith("pre")) {
-        if (!e && c === !1)
+        if (!e && u === !1)
           throw new Error("invalid increment argument: identifier is empty");
         if (e) {
-          const f = `-${e}`.match(this.options.loose ? s[i.PRERELEASELOOSE] : s[i.PRERELEASE]);
+          const f = `-${e}`.match(this.options.loose ? n[i.PRERELEASELOOSE] : n[i.PRERELEASE]);
           if (!f || f[1] !== e)
             throw new Error(`invalid identifier: ${e}`);
         }
       }
       switch (a) {
         case "premajor":
-          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", e, c);
+          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", e, u);
           break;
         case "preminor":
-          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", e, c);
+          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", e, u);
           break;
         case "prepatch":
-          this.prerelease.length = 0, this.inc("patch", e, c), this.inc("pre", e, c);
+          this.prerelease.length = 0, this.inc("patch", e, u), this.inc("pre", e, u);
           break;
         // If the input is a non-prerelease version, this acts the same as
         // prepatch.
         case "prerelease":
-          this.prerelease.length === 0 && this.inc("patch", e, c), this.inc("pre", e, c);
+          this.prerelease.length === 0 && this.inc("patch", e, u), this.inc("pre", e, u);
           break;
         case "release":
           if (this.prerelease.length === 0)
@@ -386,22 +387,22 @@ function b() {
         // This probably shouldn't be used publicly.
         // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
         case "pre": {
-          const f = Number(c) ? 1 : 0;
+          const f = Number(u) ? 1 : 0;
           if (this.prerelease.length === 0)
             this.prerelease = [f];
           else {
-            let d = this.prerelease.length;
-            for (; --d >= 0; )
-              typeof this.prerelease[d] == "number" && (this.prerelease[d]++, d = -2);
-            if (d === -1) {
-              if (e === this.prerelease.join(".") && c === !1)
+            let p = this.prerelease.length;
+            for (; --p >= 0; )
+              typeof this.prerelease[p] == "number" && (this.prerelease[p]++, p = -2);
+            if (p === -1) {
+              if (e === this.prerelease.join(".") && u === !1)
                 throw new Error("invalid increment argument: identifier already exists");
               this.prerelease.push(f);
             }
           }
           if (e) {
-            let d = [e, f];
-            c === !1 && (d = [e]), l(this.prerelease[0], e) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = d) : this.prerelease = d;
+            let p = [e, f];
+            u === !1 && (p = [e]), l(this.prerelease[0], e) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = p) : this.prerelease = p;
           }
           break;
         }
@@ -414,29 +415,29 @@ function b() {
   return oe = h, oe;
 }
 var le, ot;
-function V() {
+function M() {
   if (ot) return le;
   ot = 1;
   const t = b();
-  return le = (r, s, i = !1) => {
+  return le = (r, n, i = !1) => {
     if (r instanceof t)
       return r;
     try {
-      return new t(r, s);
-    } catch (u) {
+      return new t(r, n);
+    } catch (c) {
       if (!i)
         return null;
-      throw u;
+      throw c;
     }
   }, le;
 }
 var ce, lt;
-function Sr() {
+function Or() {
   if (lt) return ce;
   lt = 1;
-  const t = V();
-  return ce = (r, s) => {
-    const i = t(r, s);
+  const t = M();
+  return ce = (r, n) => {
+    const i = t(r, n);
     return i ? i.version : null;
   }, ce;
 }
@@ -444,9 +445,9 @@ var ue, ct;
 function Ar() {
   if (ct) return ue;
   ct = 1;
-  const t = V();
-  return ue = (r, s) => {
-    const i = t(r.trim().replace(/^[=v]+/, ""), s);
+  const t = M();
+  return ue = (r, n) => {
+    const i = t(r.trim().replace(/^[=v]+/, ""), n);
     return i ? i.version : null;
   }, ue;
 }
@@ -455,13 +456,13 @@ function wr() {
   if (ut) return fe;
   ut = 1;
   const t = b();
-  return fe = (r, s, i, u, l) => {
-    typeof i == "string" && (l = u, u = i, i = void 0);
+  return fe = (r, n, i, c, l) => {
+    typeof i == "string" && (l = c, c = i, i = void 0);
     try {
       return new t(
         r instanceof t ? r.version : r,
         i
-      ).inc(s, u, l).version;
+      ).inc(n, c, l).version;
     } catch {
       return null;
     }
@@ -471,12 +472,12 @@ var he, ft;
 function yr() {
   if (ft) return he;
   ft = 1;
-  const t = V();
-  return he = (r, s) => {
-    const i = t(r, null, !0), u = t(s, null, !0), l = i.compare(u);
+  const t = M();
+  return he = (r, n) => {
+    const i = t(r, null, !0), c = t(n, null, !0), l = i.compare(c);
     if (l === 0)
       return null;
-    const h = l > 0, o = h ? i : u, a = h ? u : i, e = !!o.prerelease.length;
+    const h = l > 0, o = h ? i : c, a = h ? c : i, e = !!o.prerelease.length;
     if (!!a.prerelease.length && !e) {
       if (!a.patch && !a.minor)
         return "major";
@@ -484,132 +485,132 @@ function yr() {
         return a.minor && !a.patch ? "minor" : "patch";
     }
     const f = e ? "pre" : "";
-    return i.major !== u.major ? f + "major" : i.minor !== u.minor ? f + "minor" : i.patch !== u.patch ? f + "patch" : "prerelease";
+    return i.major !== c.major ? f + "major" : i.minor !== c.minor ? f + "minor" : i.patch !== c.patch ? f + "patch" : "prerelease";
   }, he;
 }
-var pe, ht;
+var de, ht;
 function Cr() {
-  if (ht) return pe;
+  if (ht) return de;
   ht = 1;
   const t = b();
-  return pe = (r, s) => new t(r, s).major, pe;
+  return de = (r, n) => new t(r, n).major, de;
 }
-var Ee, pt;
+var me, dt;
 function qr() {
-  if (pt) return Ee;
-  pt = 1;
+  if (dt) return me;
+  dt = 1;
   const t = b();
-  return Ee = (r, s) => new t(r, s).minor, Ee;
+  return me = (r, n) => new t(r, n).minor, me;
 }
-var me, Et;
+var Ee, mt;
 function Pr() {
-  if (Et) return me;
-  Et = 1;
+  if (mt) return Ee;
+  mt = 1;
   const t = b();
-  return me = (r, s) => new t(r, s).patch, me;
+  return Ee = (r, n) => new t(r, n).patch, Ee;
 }
-var de, mt;
+var pe, Et;
 function Gr() {
-  if (mt) return de;
-  mt = 1;
-  const t = V();
-  return de = (r, s) => {
-    const i = t(r, s);
+  if (Et) return pe;
+  Et = 1;
+  const t = M();
+  return pe = (r, n) => {
+    const i = t(r, n);
     return i && i.prerelease.length ? i.prerelease : null;
-  }, de;
+  }, pe;
 }
-var Re, dt;
+var Re, pt;
 function U() {
-  if (dt) return Re;
-  dt = 1;
+  if (pt) return Re;
+  pt = 1;
   const t = b();
-  return Re = (r, s, i) => new t(r, i).compare(new t(s, i)), Re;
+  return Re = (r, n, i) => new t(r, i).compare(new t(n, i)), Re;
 }
 var ve, Rt;
 function xr() {
   if (Rt) return ve;
   Rt = 1;
   const t = U();
-  return ve = (r, s, i) => t(s, r, i), ve;
+  return ve = (r, n, i) => t(n, r, i), ve;
 }
 var Ie, vt;
 function Dr() {
   if (vt) return Ie;
   vt = 1;
   const t = U();
-  return Ie = (r, s) => t(r, s, !0), Ie;
+  return Ie = (r, n) => t(r, n, !0), Ie;
 }
-var $e, It;
+var ge, It;
 function Je() {
-  if (It) return $e;
+  if (It) return ge;
   It = 1;
   const t = b();
-  return $e = (r, s, i) => {
-    const u = new t(r, i), l = new t(s, i);
-    return u.compare(l) || u.compareBuild(l);
-  }, $e;
+  return ge = (r, n, i) => {
+    const c = new t(r, i), l = new t(n, i);
+    return c.compare(l) || c.compareBuild(l);
+  }, ge;
 }
-var ge, $t;
+var $e, gt;
 function br() {
-  if ($t) return ge;
-  $t = 1;
+  if (gt) return $e;
+  gt = 1;
   const t = Je();
-  return ge = (r, s) => r.sort((i, u) => t(i, u, s)), ge;
+  return $e = (r, n) => r.sort((i, c) => t(i, c, n)), $e;
 }
-var Le, gt;
+var Le, $t;
 function _r() {
-  if (gt) return Le;
-  gt = 1;
+  if ($t) return Le;
+  $t = 1;
   const t = Je();
-  return Le = (r, s) => r.sort((i, u) => t(u, i, s)), Le;
+  return Le = (r, n) => r.sort((i, c) => t(c, i, n)), Le;
 }
 var Te, Lt;
 function J() {
   if (Lt) return Te;
   Lt = 1;
   const t = U();
-  return Te = (r, s, i) => t(r, s, i) > 0, Te;
+  return Te = (r, n, i) => t(r, n, i) > 0, Te;
 }
 var Ne, Tt;
 function Ke() {
   if (Tt) return Ne;
   Tt = 1;
   const t = U();
-  return Ne = (r, s, i) => t(r, s, i) < 0, Ne;
+  return Ne = (r, n, i) => t(r, n, i) < 0, Ne;
 }
-var Oe, Nt;
+var Se, Nt;
 function nr() {
-  if (Nt) return Oe;
+  if (Nt) return Se;
   Nt = 1;
   const t = U();
-  return Oe = (r, s, i) => t(r, s, i) === 0, Oe;
+  return Se = (r, n, i) => t(r, n, i) === 0, Se;
 }
-var Se, Ot;
+var Oe, St;
 function ir() {
-  if (Ot) return Se;
-  Ot = 1;
+  if (St) return Oe;
+  St = 1;
   const t = U();
-  return Se = (r, s, i) => t(r, s, i) !== 0, Se;
+  return Oe = (r, n, i) => t(r, n, i) !== 0, Oe;
 }
-var Ae, St;
+var Ae, Ot;
 function Ze() {
-  if (St) return Ae;
-  St = 1;
+  if (Ot) return Ae;
+  Ot = 1;
   const t = U();
-  return Ae = (r, s, i) => t(r, s, i) >= 0, Ae;
+  return Ae = (r, n, i) => t(r, n, i) >= 0, Ae;
 }
 var we, At;
 function Qe() {
   if (At) return we;
   At = 1;
   const t = U();
-  return we = (r, s, i) => t(r, s, i) <= 0, we;
+  return we = (r, n, i) => t(r, n, i) <= 0, we;
 }
 var ye, wt;
 function ar() {
   if (wt) return ye;
   wt = 1;
-  const t = nr(), n = ir(), r = J(), s = Ze(), i = Ke(), u = Qe();
+  const t = nr(), s = ir(), r = J(), n = Ze(), i = Ke(), c = Qe();
   return ye = (h, o, a, e) => {
     switch (o) {
       case "===":
@@ -621,15 +622,15 @@ function ar() {
       case "==":
         return t(h, a, e);
       case "!=":
-        return n(h, a, e);
+        return s(h, a, e);
       case ">":
         return r(h, a, e);
       case ">=":
-        return s(h, a, e);
+        return n(h, a, e);
       case "<":
         return i(h, a, e);
       case "<=":
-        return u(h, a, e);
+        return c(h, a, e);
       default:
         throw new TypeError(`Invalid operator: ${o}`);
     }
@@ -639,27 +640,27 @@ var Ce, yt;
 function Ur() {
   if (yt) return Ce;
   yt = 1;
-  const t = b(), n = V(), { safeRe: r, t: s } = B();
-  return Ce = (u, l) => {
-    if (u instanceof t)
-      return u;
-    if (typeof u == "number" && (u = String(u)), typeof u != "string")
+  const t = b(), s = M(), { safeRe: r, t: n } = B();
+  return Ce = (c, l) => {
+    if (c instanceof t)
+      return c;
+    if (typeof c == "number" && (c = String(c)), typeof c != "string")
       return null;
     l = l || {};
     let h = null;
     if (!l.rtl)
-      h = u.match(l.includePrerelease ? r[s.COERCEFULL] : r[s.COERCE]);
+      h = c.match(l.includePrerelease ? r[n.COERCEFULL] : r[n.COERCE]);
     else {
-      const d = l.includePrerelease ? r[s.COERCERTLFULL] : r[s.COERCERTL];
-      let O;
-      for (; (O = d.exec(u)) && (!h || h.index + h[0].length !== u.length); )
-        (!h || O.index + O[0].length !== h.index + h[0].length) && (h = O), d.lastIndex = O.index + O[1].length + O[2].length;
-      d.lastIndex = -1;
+      const p = l.includePrerelease ? r[n.COERCERTLFULL] : r[n.COERCERTL];
+      let S;
+      for (; (S = p.exec(c)) && (!h || h.index + h[0].length !== c.length); )
+        (!h || S.index + S[0].length !== h.index + h[0].length) && (h = S), p.lastIndex = S.index + S[1].length + S[2].length;
+      p.lastIndex = -1;
     }
     if (h === null)
       return null;
-    const o = h[2], a = h[3] || "0", e = h[4] || "0", c = l.includePrerelease && h[5] ? `-${h[5]}` : "", f = l.includePrerelease && h[6] ? `+${h[6]}` : "";
-    return n(`${o}.${a}.${e}${c}${f}`, l);
+    const o = h[2], a = h[3] || "0", e = h[4] || "0", u = l.includePrerelease && h[5] ? `-${h[5]}` : "", f = l.includePrerelease && h[6] ? `+${h[6]}` : "";
+    return s(`${o}.${a}.${e}${u}${f}`, l);
   }, Ce;
 }
 var qe, Ct;
@@ -671,20 +672,20 @@ function jr() {
       this.max = 1e3, this.map = /* @__PURE__ */ new Map();
     }
     get(r) {
-      const s = this.map.get(r);
-      if (s !== void 0)
-        return this.map.delete(r), this.map.set(r, s), s;
+      const n = this.map.get(r);
+      if (n !== void 0)
+        return this.map.delete(r), this.map.set(r, n), n;
     }
     delete(r) {
       return this.map.delete(r);
     }
-    set(r, s) {
-      if (!this.delete(r) && s !== void 0) {
+    set(r, n) {
+      if (!this.delete(r) && n !== void 0) {
         if (this.map.size >= this.max) {
-          const u = this.map.keys().next().value;
-          this.delete(u);
+          const c = this.map.keys().next().value;
+          this.delete(c);
         }
-        this.map.set(r, s);
+        this.map.set(r, n);
       }
       return this;
     }
@@ -696,22 +697,22 @@ function j() {
   if (qt) return Pe;
   qt = 1;
   const t = /\s+/g;
-  class n {
-    constructor(p, I) {
-      if (I = i(I), p instanceof n)
-        return p.loose === !!I.loose && p.includePrerelease === !!I.includePrerelease ? p : new n(p.raw, I);
-      if (p instanceof u)
-        return this.raw = p.value, this.set = [[p]], this.formatted = void 0, this;
-      if (this.options = I, this.loose = !!I.loose, this.includePrerelease = !!I.includePrerelease, this.raw = p.trim().replace(t, " "), this.set = this.raw.split("||").map((R) => this.parseRange(R.trim())).filter((R) => R.length), !this.set.length)
+  class s {
+    constructor(d, I) {
+      if (I = i(I), d instanceof s)
+        return d.loose === !!I.loose && d.includePrerelease === !!I.includePrerelease ? d : new s(d.raw, I);
+      if (d instanceof c)
+        return this.raw = d.value, this.set = [[d]], this.formatted = void 0, this;
+      if (this.options = I, this.loose = !!I.loose, this.includePrerelease = !!I.includePrerelease, this.raw = d.trim().replace(t, " "), this.set = this.raw.split("||").map((R) => this.parseRange(R.trim())).filter((R) => R.length), !this.set.length)
         throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
       if (this.set.length > 1) {
         const R = this.set[0];
-        if (this.set = this.set.filter(($) => !E($[0])), this.set.length === 0)
+        if (this.set = this.set.filter((g) => !m(g[0])), this.set.length === 0)
           this.set = [R];
         else if (this.set.length > 1) {
-          for (const $ of this.set)
-            if ($.length === 1 && N($[0])) {
-              this.set = [$];
+          for (const g of this.set)
+            if (g.length === 1 && N(g[0])) {
+              this.set = [g];
               break;
             }
         }
@@ -721,9 +722,9 @@ function j() {
     get range() {
       if (this.formatted === void 0) {
         this.formatted = "";
-        for (let p = 0; p < this.set.length; p++) {
-          p > 0 && (this.formatted += "||");
-          const I = this.set[p];
+        for (let d = 0; d < this.set.length; d++) {
+          d > 0 && (this.formatted += "||");
+          const I = this.set[d];
           for (let R = 0; R < I.length; R++)
             R > 0 && (this.formatted += " "), this.formatted += I[R].toString().trim();
         }
@@ -736,91 +737,91 @@ function j() {
     toString() {
       return this.range;
     }
-    parseRange(p) {
-      const R = ((this.options.includePrerelease && d) | (this.options.loose && O)) + ":" + p, $ = s.get(R);
-      if ($)
-        return $;
-      const v = this.options.loose, g = v ? o[a.HYPHENRANGELOOSE] : o[a.HYPHENRANGE];
-      p = p.replace(g, te(this.options.includePrerelease)), l("hyphen replace", p), p = p.replace(o[a.COMPARATORTRIM], e), l("comparator trim", p), p = p.replace(o[a.TILDETRIM], c), l("tilde trim", p), p = p.replace(o[a.CARETTRIM], f), l("caret trim", p);
-      let S = p.split(" ").map((q) => G(q, this.options)).join(" ").split(/\s+/).map((q) => ee(q, this.options));
-      v && (S = S.filter((q) => (l("loose invalid filter", q, this.options), !!q.match(o[a.COMPARATORLOOSE])))), l("range list", S);
-      const T = /* @__PURE__ */ new Map(), y = S.map((q) => new u(q, this.options));
+    parseRange(d) {
+      const R = ((this.options.includePrerelease && p) | (this.options.loose && S)) + ":" + d, g = n.get(R);
+      if (g)
+        return g;
+      const v = this.options.loose, $ = v ? o[a.HYPHENRANGELOOSE] : o[a.HYPHENRANGE];
+      d = d.replace($, te(this.options.includePrerelease)), l("hyphen replace", d), d = d.replace(o[a.COMPARATORTRIM], e), l("comparator trim", d), d = d.replace(o[a.TILDETRIM], u), l("tilde trim", d), d = d.replace(o[a.CARETTRIM], f), l("caret trim", d);
+      let O = d.split(" ").map((q) => G(q, this.options)).join(" ").split(/\s+/).map((q) => ee(q, this.options));
+      v && (O = O.filter((q) => (l("loose invalid filter", q, this.options), !!q.match(o[a.COMPARATORLOOSE])))), l("range list", O);
+      const T = /* @__PURE__ */ new Map(), y = O.map((q) => new c(q, this.options));
       for (const q of y) {
-        if (E(q))
+        if (m(q))
           return [q];
         T.set(q.value, q);
       }
       T.size > 1 && T.has("") && T.delete("");
       const D = [...T.values()];
-      return s.set(R, D), D;
+      return n.set(R, D), D;
     }
-    intersects(p, I) {
-      if (!(p instanceof n))
+    intersects(d, I) {
+      if (!(d instanceof s))
         throw new TypeError("a Range is required");
-      return this.set.some((R) => A(R, I) && p.set.some(($) => A($, I) && R.every((v) => $.every((g) => v.intersects(g, I)))));
+      return this.set.some((R) => A(R, I) && d.set.some((g) => A(g, I) && R.every((v) => g.every(($) => v.intersects($, I)))));
     }
     // if ANY of the sets match ALL of its comparators, then pass
-    test(p) {
-      if (!p)
+    test(d) {
+      if (!d)
         return !1;
-      if (typeof p == "string")
+      if (typeof d == "string")
         try {
-          p = new h(p, this.options);
+          d = new h(d, this.options);
         } catch {
           return !1;
         }
       for (let I = 0; I < this.set.length; I++)
-        if (re(this.set[I], p, this.options))
+        if (re(this.set[I], d, this.options))
           return !0;
       return !1;
     }
   }
-  Pe = n;
-  const r = jr(), s = new r(), i = ze(), u = K(), l = z(), h = b(), {
+  Pe = s;
+  const r = jr(), n = new r(), i = ze(), c = K(), l = z(), h = b(), {
     safeRe: o,
     t: a,
     comparatorTrimReplace: e,
-    tildeTrimReplace: c,
+    tildeTrimReplace: u,
     caretTrimReplace: f
-  } = B(), { FLAG_INCLUDE_PRERELEASE: d, FLAG_LOOSE: O } = Y(), E = (m) => m.value === "<0.0.0-0", N = (m) => m.value === "", A = (m, p) => {
+  } = B(), { FLAG_INCLUDE_PRERELEASE: p, FLAG_LOOSE: S } = Y(), m = (E) => E.value === "<0.0.0-0", N = (E) => E.value === "", A = (E, d) => {
     let I = !0;
-    const R = m.slice();
-    let $ = R.pop();
+    const R = E.slice();
+    let g = R.pop();
     for (; I && R.length; )
-      I = R.every((v) => $.intersects(v, p)), $ = R.pop();
+      I = R.every((v) => g.intersects(v, d)), g = R.pop();
     return I;
-  }, G = (m, p) => (m = m.replace(o[a.BUILD], ""), l("comp", m, p), m = C(m, p), l("caret", m), m = x(m, p), l("tildes", m), m = L(m, p), l("xrange", m), m = Q(m, p), l("stars", m), m), w = (m) => !m || m.toLowerCase() === "x" || m === "*", x = (m, p) => m.trim().split(/\s+/).map((I) => _(I, p)).join(" "), _ = (m, p) => {
-    const I = p.loose ? o[a.TILDELOOSE] : o[a.TILDE];
-    return m.replace(I, (R, $, v, g, S) => {
-      l("tilde", m, R, $, v, g, S);
+  }, G = (E, d) => (E = E.replace(o[a.BUILD], ""), l("comp", E, d), E = C(E, d), l("caret", E), E = x(E, d), l("tildes", E), E = L(E, d), l("xrange", E), E = Q(E, d), l("stars", E), E), w = (E) => !E || E.toLowerCase() === "x" || E === "*", x = (E, d) => E.trim().split(/\s+/).map((I) => _(I, d)).join(" "), _ = (E, d) => {
+    const I = d.loose ? o[a.TILDELOOSE] : o[a.TILDE];
+    return E.replace(I, (R, g, v, $, O) => {
+      l("tilde", E, R, g, v, $, O);
       let T;
-      return w($) ? T = "" : w(v) ? T = `>=${$}.0.0 <${+$ + 1}.0.0-0` : w(g) ? T = `>=${$}.${v}.0 <${$}.${+v + 1}.0-0` : S ? (l("replaceTilde pr", S), T = `>=${$}.${v}.${g}-${S} <${$}.${+v + 1}.0-0`) : T = `>=${$}.${v}.${g} <${$}.${+v + 1}.0-0`, l("tilde return", T), T;
+      return w(g) ? T = "" : w(v) ? T = `>=${g}.0.0 <${+g + 1}.0.0-0` : w($) ? T = `>=${g}.${v}.0 <${g}.${+v + 1}.0-0` : O ? (l("replaceTilde pr", O), T = `>=${g}.${v}.${$}-${O} <${g}.${+v + 1}.0-0`) : T = `>=${g}.${v}.${$} <${g}.${+v + 1}.0-0`, l("tilde return", T), T;
     });
-  }, C = (m, p) => m.trim().split(/\s+/).map((I) => P(I, p)).join(" "), P = (m, p) => {
-    l("caret", m, p);
-    const I = p.loose ? o[a.CARETLOOSE] : o[a.CARET], R = p.includePrerelease ? "-0" : "";
-    return m.replace(I, ($, v, g, S, T) => {
-      l("caret", m, $, v, g, S, T);
+  }, C = (E, d) => E.trim().split(/\s+/).map((I) => P(I, d)).join(" "), P = (E, d) => {
+    l("caret", E, d);
+    const I = d.loose ? o[a.CARETLOOSE] : o[a.CARET], R = d.includePrerelease ? "-0" : "";
+    return E.replace(I, (g, v, $, O, T) => {
+      l("caret", E, g, v, $, O, T);
       let y;
-      return w(v) ? y = "" : w(g) ? y = `>=${v}.0.0${R} <${+v + 1}.0.0-0` : w(S) ? v === "0" ? y = `>=${v}.${g}.0${R} <${v}.${+g + 1}.0-0` : y = `>=${v}.${g}.0${R} <${+v + 1}.0.0-0` : T ? (l("replaceCaret pr", T), v === "0" ? g === "0" ? y = `>=${v}.${g}.${S}-${T} <${v}.${g}.${+S + 1}-0` : y = `>=${v}.${g}.${S}-${T} <${v}.${+g + 1}.0-0` : y = `>=${v}.${g}.${S}-${T} <${+v + 1}.0.0-0`) : (l("no pr"), v === "0" ? g === "0" ? y = `>=${v}.${g}.${S}${R} <${v}.${g}.${+S + 1}-0` : y = `>=${v}.${g}.${S}${R} <${v}.${+g + 1}.0-0` : y = `>=${v}.${g}.${S} <${+v + 1}.0.0-0`), l("caret return", y), y;
+      return w(v) ? y = "" : w($) ? y = `>=${v}.0.0${R} <${+v + 1}.0.0-0` : w(O) ? v === "0" ? y = `>=${v}.${$}.0${R} <${v}.${+$ + 1}.0-0` : y = `>=${v}.${$}.0${R} <${+v + 1}.0.0-0` : T ? (l("replaceCaret pr", T), v === "0" ? $ === "0" ? y = `>=${v}.${$}.${O}-${T} <${v}.${$}.${+O + 1}-0` : y = `>=${v}.${$}.${O}-${T} <${v}.${+$ + 1}.0-0` : y = `>=${v}.${$}.${O}-${T} <${+v + 1}.0.0-0`) : (l("no pr"), v === "0" ? $ === "0" ? y = `>=${v}.${$}.${O}${R} <${v}.${$}.${+O + 1}-0` : y = `>=${v}.${$}.${O}${R} <${v}.${+$ + 1}.0-0` : y = `>=${v}.${$}.${O} <${+v + 1}.0.0-0`), l("caret return", y), y;
     });
-  }, L = (m, p) => (l("replaceXRanges", m, p), m.split(/\s+/).map((I) => k(I, p)).join(" ")), k = (m, p) => {
-    m = m.trim();
-    const I = p.loose ? o[a.XRANGELOOSE] : o[a.XRANGE];
-    return m.replace(I, (R, $, v, g, S, T) => {
-      l("xRange", m, R, $, v, g, S, T);
-      const y = w(v), D = y || w(g), q = D || w(S), X = q;
-      return $ === "=" && X && ($ = ""), T = p.includePrerelease ? "-0" : "", y ? $ === ">" || $ === "<" ? R = "<0.0.0-0" : R = "*" : $ && X ? (D && (g = 0), S = 0, $ === ">" ? ($ = ">=", D ? (v = +v + 1, g = 0, S = 0) : (g = +g + 1, S = 0)) : $ === "<=" && ($ = "<", D ? v = +v + 1 : g = +g + 1), $ === "<" && (T = "-0"), R = `${$ + v}.${g}.${S}${T}`) : D ? R = `>=${v}.0.0${T} <${+v + 1}.0.0-0` : q && (R = `>=${v}.${g}.0${T} <${v}.${+g + 1}.0-0`), l("xRange return", R), R;
+  }, L = (E, d) => (l("replaceXRanges", E, d), E.split(/\s+/).map((I) => V(I, d)).join(" ")), V = (E, d) => {
+    E = E.trim();
+    const I = d.loose ? o[a.XRANGELOOSE] : o[a.XRANGE];
+    return E.replace(I, (R, g, v, $, O, T) => {
+      l("xRange", E, R, g, v, $, O, T);
+      const y = w(v), D = y || w($), q = D || w(O), k = q;
+      return g === "=" && k && (g = ""), T = d.includePrerelease ? "-0" : "", y ? g === ">" || g === "<" ? R = "<0.0.0-0" : R = "*" : g && k ? (D && ($ = 0), O = 0, g === ">" ? (g = ">=", D ? (v = +v + 1, $ = 0, O = 0) : ($ = +$ + 1, O = 0)) : g === "<=" && (g = "<", D ? v = +v + 1 : $ = +$ + 1), g === "<" && (T = "-0"), R = `${g + v}.${$}.${O}${T}`) : D ? R = `>=${v}.0.0${T} <${+v + 1}.0.0-0` : q && (R = `>=${v}.${$}.0${T} <${v}.${+$ + 1}.0-0`), l("xRange return", R), R;
     });
-  }, Q = (m, p) => (l("replaceStars", m, p), m.trim().replace(o[a.STAR], "")), ee = (m, p) => (l("replaceGTE0", m, p), m.trim().replace(o[p.includePrerelease ? a.GTE0PRE : a.GTE0], "")), te = (m) => (p, I, R, $, v, g, S, T, y, D, q, X) => (w(R) ? I = "" : w($) ? I = `>=${R}.0.0${m ? "-0" : ""}` : w(v) ? I = `>=${R}.${$}.0${m ? "-0" : ""}` : g ? I = `>=${I}` : I = `>=${I}${m ? "-0" : ""}`, w(y) ? T = "" : w(D) ? T = `<${+y + 1}.0.0-0` : w(q) ? T = `<${y}.${+D + 1}.0-0` : X ? T = `<=${y}.${D}.${q}-${X}` : m ? T = `<${y}.${D}.${+q + 1}-0` : T = `<=${T}`, `${I} ${T}`.trim()), re = (m, p, I) => {
-    for (let R = 0; R < m.length; R++)
-      if (!m[R].test(p))
+  }, Q = (E, d) => (l("replaceStars", E, d), E.trim().replace(o[a.STAR], "")), ee = (E, d) => (l("replaceGTE0", E, d), E.trim().replace(o[d.includePrerelease ? a.GTE0PRE : a.GTE0], "")), te = (E) => (d, I, R, g, v, $, O, T, y, D, q, k) => (w(R) ? I = "" : w(g) ? I = `>=${R}.0.0${E ? "-0" : ""}` : w(v) ? I = `>=${R}.${g}.0${E ? "-0" : ""}` : $ ? I = `>=${I}` : I = `>=${I}${E ? "-0" : ""}`, w(y) ? T = "" : w(D) ? T = `<${+y + 1}.0.0-0` : w(q) ? T = `<${y}.${+D + 1}.0-0` : k ? T = `<=${y}.${D}.${q}-${k}` : E ? T = `<${y}.${D}.${+q + 1}-0` : T = `<=${T}`, `${I} ${T}`.trim()), re = (E, d, I) => {
+    for (let R = 0; R < E.length; R++)
+      if (!E[R].test(d))
         return !1;
-    if (p.prerelease.length && !I.includePrerelease) {
-      for (let R = 0; R < m.length; R++)
-        if (l(m[R].semver), m[R].semver !== u.ANY && m[R].semver.prerelease.length > 0) {
-          const $ = m[R].semver;
-          if ($.major === p.major && $.minor === p.minor && $.patch === p.patch)
+    if (d.prerelease.length && !I.includePrerelease) {
+      for (let R = 0; R < E.length; R++)
+        if (l(E[R].semver), E[R].semver !== c.ANY && E[R].semver.prerelease.length > 0) {
+          const g = E[R].semver;
+          if (g.major === d.major && g.minor === d.minor && g.patch === d.patch)
             return !0;
         }
       return !1;
@@ -834,20 +835,20 @@ function K() {
   if (Pt) return Ge;
   Pt = 1;
   const t = /* @__PURE__ */ Symbol("SemVer ANY");
-  class n {
+  class s {
     static get ANY() {
       return t;
     }
-    constructor(e, c) {
-      if (c = r(c), e instanceof n) {
-        if (e.loose === !!c.loose)
+    constructor(e, u) {
+      if (u = r(u), e instanceof s) {
+        if (e.loose === !!u.loose)
           return e;
         e = e.value;
       }
-      e = e.trim().split(/\s+/).join(" "), l("comparator", e, c), this.options = c, this.loose = !!c.loose, this.parse(e), this.semver === t ? this.value = "" : this.value = this.operator + this.semver.version, l("comp", this);
+      e = e.trim().split(/\s+/).join(" "), l("comparator", e, u), this.options = u, this.loose = !!u.loose, this.parse(e), this.semver === t ? this.value = "" : this.value = this.operator + this.semver.version, l("comp", this);
     }
     parse(e) {
-      const c = this.options.loose ? s[i.COMPARATORLOOSE] : s[i.COMPARATOR], f = e.match(c);
+      const u = this.options.loose ? n[i.COMPARATORLOOSE] : n[i.COMPARATOR], f = e.match(u);
       if (!f)
         throw new TypeError(`Invalid comparator: ${e}`);
       this.operator = f[1] !== void 0 ? f[1] : "", this.operator === "=" && (this.operator = ""), f[2] ? this.semver = new h(f[2], this.options.loose) : this.semver = t;
@@ -864,16 +865,16 @@ function K() {
         } catch {
           return !1;
         }
-      return u(e, this.operator, this.semver, this.options);
+      return c(e, this.operator, this.semver, this.options);
     }
-    intersects(e, c) {
-      if (!(e instanceof n))
+    intersects(e, u) {
+      if (!(e instanceof s))
         throw new TypeError("a Comparator is required");
-      return this.operator === "" ? this.value === "" ? !0 : new o(e.value, c).test(this.value) : e.operator === "" ? e.value === "" ? !0 : new o(this.value, c).test(e.semver) : (c = r(c), c.includePrerelease && (this.value === "<0.0.0-0" || e.value === "<0.0.0-0") || !c.includePrerelease && (this.value.startsWith("<0.0.0") || e.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && e.operator.startsWith(">") || this.operator.startsWith("<") && e.operator.startsWith("<") || this.semver.version === e.semver.version && this.operator.includes("=") && e.operator.includes("=") || u(this.semver, "<", e.semver, c) && this.operator.startsWith(">") && e.operator.startsWith("<") || u(this.semver, ">", e.semver, c) && this.operator.startsWith("<") && e.operator.startsWith(">")));
+      return this.operator === "" ? this.value === "" ? !0 : new o(e.value, u).test(this.value) : e.operator === "" ? e.value === "" ? !0 : new o(this.value, u).test(e.semver) : (u = r(u), u.includePrerelease && (this.value === "<0.0.0-0" || e.value === "<0.0.0-0") || !u.includePrerelease && (this.value.startsWith("<0.0.0") || e.value.startsWith("<0.0.0")) ? !1 : !!(this.operator.startsWith(">") && e.operator.startsWith(">") || this.operator.startsWith("<") && e.operator.startsWith("<") || this.semver.version === e.semver.version && this.operator.includes("=") && e.operator.includes("=") || c(this.semver, "<", e.semver, u) && this.operator.startsWith(">") && e.operator.startsWith("<") || c(this.semver, ">", e.semver, u) && this.operator.startsWith("<") && e.operator.startsWith(">")));
     }
   }
-  Ge = n;
-  const r = ze(), { safeRe: s, t: i } = B(), u = ar(), l = z(), h = b(), o = j();
+  Ge = s;
+  const r = ze(), { safeRe: n, t: i } = B(), c = ar(), l = z(), h = b(), o = j();
   return Ge;
 }
 var xe, Gt;
@@ -881,13 +882,13 @@ function Z() {
   if (Gt) return xe;
   Gt = 1;
   const t = j();
-  return xe = (r, s, i) => {
+  return xe = (r, n, i) => {
     try {
-      s = new t(s, i);
+      n = new t(n, i);
     } catch {
       return !1;
     }
-    return s.test(r);
+    return n.test(r);
   }, xe;
 }
 var De, xt;
@@ -895,49 +896,49 @@ function Fr() {
   if (xt) return De;
   xt = 1;
   const t = j();
-  return De = (r, s) => new t(r, s).set.map((i) => i.map((u) => u.value).join(" ").trim().split(" ")), De;
+  return De = (r, n) => new t(r, n).set.map((i) => i.map((c) => c.value).join(" ").trim().split(" ")), De;
 }
 var be, Dt;
-function Vr() {
+function Mr() {
   if (Dt) return be;
   Dt = 1;
-  const t = b(), n = j();
-  return be = (s, i, u) => {
+  const t = b(), s = j();
+  return be = (n, i, c) => {
     let l = null, h = null, o = null;
     try {
-      o = new n(i, u);
+      o = new s(i, c);
     } catch {
       return null;
     }
-    return s.forEach((a) => {
-      o.test(a) && (!l || h.compare(a) === -1) && (l = a, h = new t(l, u));
+    return n.forEach((a) => {
+      o.test(a) && (!l || h.compare(a) === -1) && (l = a, h = new t(l, c));
     }), l;
   }, be;
 }
 var _e, bt;
-function kr() {
+function Vr() {
   if (bt) return _e;
   bt = 1;
-  const t = b(), n = j();
-  return _e = (s, i, u) => {
+  const t = b(), s = j();
+  return _e = (n, i, c) => {
     let l = null, h = null, o = null;
     try {
-      o = new n(i, u);
+      o = new s(i, c);
     } catch {
       return null;
     }
-    return s.forEach((a) => {
-      o.test(a) && (!l || h.compare(a) === 1) && (l = a, h = new t(l, u));
+    return n.forEach((a) => {
+      o.test(a) && (!l || h.compare(a) === 1) && (l = a, h = new t(l, c));
     }), l;
   }, _e;
 }
 var Ue, _t;
-function Xr() {
+function kr() {
   if (_t) return Ue;
   _t = 1;
-  const t = b(), n = j(), r = J();
-  return Ue = (i, u) => {
-    i = new n(i, u);
+  const t = b(), s = j(), r = J();
+  return Ue = (i, c) => {
+    i = new s(i, c);
     let l = new t("0.0.0");
     if (i.test(l) || (l = new t("0.0.0-0"), i.test(l)))
       return l;
@@ -946,14 +947,14 @@ function Xr() {
       const o = i.set[h];
       let a = null;
       o.forEach((e) => {
-        const c = new t(e.semver.version);
+        const u = new t(e.semver.version);
         switch (e.operator) {
           case ">":
-            c.prerelease.length === 0 ? c.patch++ : c.prerelease.push(0), c.raw = c.format();
+            u.prerelease.length === 0 ? u.patch++ : u.prerelease.push(0), u.raw = u.format();
           /* fallthrough */
           case "":
           case ">=":
-            (!a || r(c, a)) && (a = c);
+            (!a || r(u, a)) && (a = u);
             break;
           case "<":
           case "<=":
@@ -968,13 +969,13 @@ function Xr() {
   }, Ue;
 }
 var je, Ut;
-function Mr() {
+function Xr() {
   if (Ut) return je;
   Ut = 1;
   const t = j();
-  return je = (r, s) => {
+  return je = (r, n) => {
     try {
-      return new t(r, s).range || "*";
+      return new t(r, n).range || "*";
     } catch {
       return null;
     }
@@ -984,28 +985,28 @@ var Fe, jt;
 function et() {
   if (jt) return Fe;
   jt = 1;
-  const t = b(), n = K(), { ANY: r } = n, s = j(), i = Z(), u = J(), l = Ke(), h = Qe(), o = Ze();
-  return Fe = (e, c, f, d) => {
-    e = new t(e, d), c = new s(c, d);
-    let O, E, N, A, G;
+  const t = b(), s = K(), { ANY: r } = s, n = j(), i = Z(), c = J(), l = Ke(), h = Qe(), o = Ze();
+  return Fe = (e, u, f, p) => {
+    e = new t(e, p), u = new n(u, p);
+    let S, m, N, A, G;
     switch (f) {
       case ">":
-        O = u, E = h, N = l, A = ">", G = ">=";
+        S = c, m = h, N = l, A = ">", G = ">=";
         break;
       case "<":
-        O = l, E = o, N = u, A = "<", G = "<=";
+        S = l, m = o, N = c, A = "<", G = "<=";
         break;
       default:
         throw new TypeError('Must provide a hilo val of "<" or ">"');
     }
-    if (i(e, c, d))
+    if (i(e, u, p))
       return !1;
-    for (let w = 0; w < c.set.length; ++w) {
-      const x = c.set[w];
+    for (let w = 0; w < u.set.length; ++w) {
+      const x = u.set[w];
       let _ = null, C = null;
       if (x.forEach((P) => {
-        P.semver === r && (P = new n(">=0.0.0")), _ = _ || P, C = C || P, O(P.semver, _.semver, d) ? _ = P : N(P.semver, C.semver, d) && (C = P);
-      }), _.operator === A || _.operator === G || (!C.operator || C.operator === A) && E(e, C.semver))
+        P.semver === r && (P = new s(">=0.0.0")), _ = _ || P, C = C || P, S(P.semver, _.semver, p) ? _ = P : N(P.semver, C.semver, p) && (C = P);
+      }), _.operator === A || _.operator === G || (!C.operator || C.operator === A) && m(e, C.semver))
         return !1;
       if (C.operator === G && N(e, C.semver))
         return !1;
@@ -1013,151 +1014,151 @@ function et() {
     return !0;
   }, Fe;
 }
-var Ve, Ft;
+var Me, Ft;
 function Br() {
-  if (Ft) return Ve;
+  if (Ft) return Me;
   Ft = 1;
   const t = et();
-  return Ve = (r, s, i) => t(r, s, ">", i), Ve;
+  return Me = (r, n, i) => t(r, n, ">", i), Me;
 }
-var ke, Vt;
+var Ve, Mt;
 function Hr() {
-  if (Vt) return ke;
-  Vt = 1;
+  if (Mt) return Ve;
+  Mt = 1;
   const t = et();
-  return ke = (r, s, i) => t(r, s, "<", i), ke;
+  return Ve = (r, n, i) => t(r, n, "<", i), Ve;
 }
-var Xe, kt;
+var ke, Vt;
 function Wr() {
-  if (kt) return Xe;
-  kt = 1;
+  if (Vt) return ke;
+  Vt = 1;
   const t = j();
-  return Xe = (r, s, i) => (r = new t(r, i), s = new t(s, i), r.intersects(s, i)), Xe;
+  return ke = (r, n, i) => (r = new t(r, i), n = new t(n, i), r.intersects(n, i)), ke;
 }
-var Me, Xt;
+var Xe, kt;
 function Yr() {
-  if (Xt) return Me;
-  Xt = 1;
-  const t = Z(), n = U();
-  return Me = (r, s, i) => {
-    const u = [];
+  if (kt) return Xe;
+  kt = 1;
+  const t = Z(), s = U();
+  return Xe = (r, n, i) => {
+    const c = [];
     let l = null, h = null;
-    const o = r.sort((f, d) => n(f, d, i));
+    const o = r.sort((f, p) => s(f, p, i));
     for (const f of o)
-      t(f, s, i) ? (h = f, l || (l = f)) : (h && u.push([l, h]), h = null, l = null);
-    l && u.push([l, null]);
+      t(f, n, i) ? (h = f, l || (l = f)) : (h && c.push([l, h]), h = null, l = null);
+    l && c.push([l, null]);
     const a = [];
-    for (const [f, d] of u)
-      f === d ? a.push(f) : !d && f === o[0] ? a.push("*") : d ? f === o[0] ? a.push(`<=${d}`) : a.push(`${f} - ${d}`) : a.push(`>=${f}`);
-    const e = a.join(" || "), c = typeof s.raw == "string" ? s.raw : String(s);
-    return e.length < c.length ? e : s;
-  }, Me;
+    for (const [f, p] of c)
+      f === p ? a.push(f) : !p && f === o[0] ? a.push("*") : p ? f === o[0] ? a.push(`<=${p}`) : a.push(`${f} - ${p}`) : a.push(`>=${f}`);
+    const e = a.join(" || "), u = typeof n.raw == "string" ? n.raw : String(n);
+    return e.length < u.length ? e : n;
+  }, Xe;
 }
-var Be, Mt;
+var Be, Xt;
 function zr() {
-  if (Mt) return Be;
-  Mt = 1;
-  const t = j(), n = K(), { ANY: r } = n, s = Z(), i = U(), u = (c, f, d = {}) => {
-    if (c === f)
+  if (Xt) return Be;
+  Xt = 1;
+  const t = j(), s = K(), { ANY: r } = s, n = Z(), i = U(), c = (u, f, p = {}) => {
+    if (u === f)
       return !0;
-    c = new t(c, d), f = new t(f, d);
-    let O = !1;
-    e: for (const E of c.set) {
+    u = new t(u, p), f = new t(f, p);
+    let S = !1;
+    e: for (const m of u.set) {
       for (const N of f.set) {
-        const A = o(E, N, d);
-        if (O = O || A !== null, A)
+        const A = o(m, N, p);
+        if (S = S || A !== null, A)
           continue e;
       }
-      if (O)
+      if (S)
         return !1;
     }
     return !0;
-  }, l = [new n(">=0.0.0-0")], h = [new n(">=0.0.0")], o = (c, f, d) => {
-    if (c === f)
+  }, l = [new s(">=0.0.0-0")], h = [new s(">=0.0.0")], o = (u, f, p) => {
+    if (u === f)
       return !0;
-    if (c.length === 1 && c[0].semver === r) {
+    if (u.length === 1 && u[0].semver === r) {
       if (f.length === 1 && f[0].semver === r)
         return !0;
-      d.includePrerelease ? c = l : c = h;
+      p.includePrerelease ? u = l : u = h;
     }
     if (f.length === 1 && f[0].semver === r) {
-      if (d.includePrerelease)
+      if (p.includePrerelease)
         return !0;
       f = h;
     }
-    const O = /* @__PURE__ */ new Set();
-    let E, N;
-    for (const L of c)
-      L.operator === ">" || L.operator === ">=" ? E = a(E, L, d) : L.operator === "<" || L.operator === "<=" ? N = e(N, L, d) : O.add(L.semver);
-    if (O.size > 1)
+    const S = /* @__PURE__ */ new Set();
+    let m, N;
+    for (const L of u)
+      L.operator === ">" || L.operator === ">=" ? m = a(m, L, p) : L.operator === "<" || L.operator === "<=" ? N = e(N, L, p) : S.add(L.semver);
+    if (S.size > 1)
       return null;
     let A;
-    if (E && N) {
-      if (A = i(E.semver, N.semver, d), A > 0)
+    if (m && N) {
+      if (A = i(m.semver, N.semver, p), A > 0)
         return null;
-      if (A === 0 && (E.operator !== ">=" || N.operator !== "<="))
+      if (A === 0 && (m.operator !== ">=" || N.operator !== "<="))
         return null;
     }
-    for (const L of O) {
-      if (E && !s(L, String(E), d) || N && !s(L, String(N), d))
+    for (const L of S) {
+      if (m && !n(L, String(m), p) || N && !n(L, String(N), p))
         return null;
-      for (const k of f)
-        if (!s(L, String(k), d))
+      for (const V of f)
+        if (!n(L, String(V), p))
           return !1;
       return !0;
     }
-    let G, w, x, _, C = N && !d.includePrerelease && N.semver.prerelease.length ? N.semver : !1, P = E && !d.includePrerelease && E.semver.prerelease.length ? E.semver : !1;
+    let G, w, x, _, C = N && !p.includePrerelease && N.semver.prerelease.length ? N.semver : !1, P = m && !p.includePrerelease && m.semver.prerelease.length ? m.semver : !1;
     C && C.prerelease.length === 1 && N.operator === "<" && C.prerelease[0] === 0 && (C = !1);
     for (const L of f) {
-      if (_ = _ || L.operator === ">" || L.operator === ">=", x = x || L.operator === "<" || L.operator === "<=", E) {
+      if (_ = _ || L.operator === ">" || L.operator === ">=", x = x || L.operator === "<" || L.operator === "<=", m) {
         if (P && L.semver.prerelease && L.semver.prerelease.length && L.semver.major === P.major && L.semver.minor === P.minor && L.semver.patch === P.patch && (P = !1), L.operator === ">" || L.operator === ">=") {
-          if (G = a(E, L, d), G === L && G !== E)
+          if (G = a(m, L, p), G === L && G !== m)
             return !1;
-        } else if (E.operator === ">=" && !s(E.semver, String(L), d))
+        } else if (m.operator === ">=" && !n(m.semver, String(L), p))
           return !1;
       }
       if (N) {
         if (C && L.semver.prerelease && L.semver.prerelease.length && L.semver.major === C.major && L.semver.minor === C.minor && L.semver.patch === C.patch && (C = !1), L.operator === "<" || L.operator === "<=") {
-          if (w = e(N, L, d), w === L && w !== N)
+          if (w = e(N, L, p), w === L && w !== N)
             return !1;
-        } else if (N.operator === "<=" && !s(N.semver, String(L), d))
+        } else if (N.operator === "<=" && !n(N.semver, String(L), p))
           return !1;
       }
-      if (!L.operator && (N || E) && A !== 0)
+      if (!L.operator && (N || m) && A !== 0)
         return !1;
     }
-    return !(E && x && !N && A !== 0 || N && _ && !E && A !== 0 || P || C);
-  }, a = (c, f, d) => {
-    if (!c)
+    return !(m && x && !N && A !== 0 || N && _ && !m && A !== 0 || P || C);
+  }, a = (u, f, p) => {
+    if (!u)
       return f;
-    const O = i(c.semver, f.semver, d);
-    return O > 0 ? c : O < 0 || f.operator === ">" && c.operator === ">=" ? f : c;
-  }, e = (c, f, d) => {
-    if (!c)
+    const S = i(u.semver, f.semver, p);
+    return S > 0 ? u : S < 0 || f.operator === ">" && u.operator === ">=" ? f : u;
+  }, e = (u, f, p) => {
+    if (!u)
       return f;
-    const O = i(c.semver, f.semver, d);
-    return O < 0 ? c : O > 0 || f.operator === "<" && c.operator === "<=" ? f : c;
+    const S = i(u.semver, f.semver, p);
+    return S < 0 ? u : S > 0 || f.operator === "<" && u.operator === "<=" ? f : u;
   };
-  return Be = u, Be;
+  return Be = c, Be;
 }
 var He, Bt;
 function Jr() {
   if (Bt) return He;
   Bt = 1;
-  const t = B(), n = Y(), r = b(), s = sr(), i = V(), u = Sr(), l = Ar(), h = wr(), o = yr(), a = Cr(), e = qr(), c = Pr(), f = Gr(), d = U(), O = xr(), E = Dr(), N = Je(), A = br(), G = _r(), w = J(), x = Ke(), _ = nr(), C = ir(), P = Ze(), L = Qe(), k = ar(), Q = Ur(), ee = K(), te = j(), re = Z(), m = Fr(), p = Vr(), I = kr(), R = Xr(), $ = Mr(), v = et(), g = Br(), S = Hr(), T = Wr(), y = Yr(), D = zr();
+  const t = B(), s = Y(), r = b(), n = sr(), i = M(), c = Or(), l = Ar(), h = wr(), o = yr(), a = Cr(), e = qr(), u = Pr(), f = Gr(), p = U(), S = xr(), m = Dr(), N = Je(), A = br(), G = _r(), w = J(), x = Ke(), _ = nr(), C = ir(), P = Ze(), L = Qe(), V = ar(), Q = Ur(), ee = K(), te = j(), re = Z(), E = Fr(), d = Mr(), I = Vr(), R = kr(), g = Xr(), v = et(), $ = Br(), O = Hr(), T = Wr(), y = Yr(), D = zr();
   return He = {
     parse: i,
-    valid: u,
+    valid: c,
     clean: l,
     inc: h,
     diff: o,
     major: a,
     minor: e,
-    patch: c,
+    patch: u,
     prerelease: f,
-    compare: d,
-    rcompare: O,
-    compareLoose: E,
+    compare: p,
+    rcompare: S,
+    compareLoose: m,
     compareBuild: N,
     sort: A,
     rsort: G,
@@ -1167,19 +1168,19 @@ function Jr() {
     neq: C,
     gte: P,
     lte: L,
-    cmp: k,
+    cmp: V,
     coerce: Q,
     Comparator: ee,
     Range: te,
     satisfies: re,
-    toComparators: m,
-    maxSatisfying: p,
+    toComparators: E,
+    maxSatisfying: d,
     minSatisfying: I,
     minVersion: R,
-    validRange: $,
+    validRange: g,
     outside: v,
-    gtr: g,
-    ltr: S,
+    gtr: $,
+    ltr: O,
     intersects: T,
     simplifyRange: y,
     subset: D,
@@ -1187,14 +1188,14 @@ function Jr() {
     re: t.re,
     src: t.src,
     tokens: t.t,
-    SEMVER_SPEC_VERSION: n.SEMVER_SPEC_VERSION,
-    RELEASE_TYPES: n.RELEASE_TYPES,
-    compareIdentifiers: s.compareIdentifiers,
-    rcompareIdentifiers: s.rcompareIdentifiers
+    SEMVER_SPEC_VERSION: s.SEMVER_SPEC_VERSION,
+    RELEASE_TYPES: s.RELEASE_TYPES,
+    compareIdentifiers: n.compareIdentifiers,
+    rcompareIdentifiers: n.rcompareIdentifiers
   }, He;
 }
 var Kr = Jr();
-const Ht = `^${M.Version}`;
+const Ht = `^${X.Version}`;
 class ts {
   config = new lr(Wt);
   event = new cr();
@@ -1203,6 +1204,7 @@ class ts {
   time;
   offset;
   info;
+  mergedLineEnd = [];
   constructor() {
     this.state = {
       playing: !1,
@@ -1218,11 +1220,11 @@ class ts {
     }, this.offset = {
       temp: 0,
       meta: 0
-    }, this.info = new M.Info(), this.config.event.add("update", this.onConfigUpdate);
+    }, this.info = new X.Info(), this.config.event.add("update", this.onConfigUpdate);
   }
-  onConfigUpdate = (n) => {
-    const r = n.has("offset.useMeta");
-    r && this.handleRefreshOffset(), (r || n.has("offset.global")) && this.handleSyncTime();
+  onConfigUpdate = (s) => {
+    const r = s.has("offset.useMeta");
+    r && this.handleRefreshOffset(), (r || s.has("offset.global")) && this.handleSyncTime(), s.has("mergeWindow") && (this.handleBuildMergedLineEnd(), this.handleSyncTime());
   };
   // Get current playback time.
   handleGetCurrentTime() {
@@ -1235,78 +1237,97 @@ class ts {
   // Refresh meta offset.
   handleRefreshOffset() {
     if (this.config.current.offset.useMeta) {
-      const r = this.info.metas.find((i) => i.type === M.MetaType.Offset)?.content, s = typeof r == "number" && Number.isFinite(r) ? r : 0;
-      this.offset.meta = s;
+      const r = this.info.metas.find((i) => i.type === X.MetaType.Offset)?.content, n = typeof r == "number" && Number.isFinite(r) ? r : 0;
+      this.offset.meta = n;
     } else
       this.offset.meta = 0;
   }
-  handleGetLineTime(n) {
-    if (n < 0 || n >= this.info.lines.length)
+  handleGetLineTime(s) {
+    if (s < 0 || s >= this.info.lines.length)
       return 0;
-    if (n === this.info.lines.length - 1)
+    if (s === this.info.lines.length - 1)
       return 1 / 0;
-    const r = this.info.lines[n], s = this.info.lines[n + 1];
-    return Math.max(r.time.end, s.time.start);
+    const r = this.info.lines[s], n = this.info.lines[s + 1];
+    return Math.max(r.time.end, n.time.start);
+  }
+  handleBuildMergedLineEnd() {
+    const s = this.info.lines.length, r = new Array(s);
+    if (s === 0) {
+      this.mergedLineEnd = r;
+      return;
+    }
+    const n = Math.max(0, this.config.current.mergeWindow);
+    let i = this.handleGetLineTime(s - 1);
+    r[s - 1] = i;
+    for (let c = s - 2; c >= 0; c--) {
+      const l = this.handleGetLineTime(c);
+      n > 0 && Math.abs(i - l) < n ? r[c] = Math.max(l, r[c + 1]) : r[c] = l, i = l;
+    }
+    this.mergedLineEnd = r;
+  }
+  handleGetMergedLineTime(s) {
+    const r = this.mergedLineEnd[s];
+    return r === void 0 ? this.handleGetLineTime(s) : r;
   }
   handleGetActiveIndex() {
     return this.active.index.length > 0 ? this.active.index[0] : -1;
   }
-  handleBridgeActive(n, r) {
+  handleBridgeActive(s, r) {
     if (!this.config.current.bridgeActive || r.length < 2)
-      return { lines: n, index: r };
-    const s = r[0], i = r[r.length - 1];
-    if (i - s + 1 === r.length)
-      return { lines: n, index: r };
-    const u = /* @__PURE__ */ new Map();
+      return { lines: s, index: r };
+    const n = r[0], i = r[r.length - 1];
+    if (i - n + 1 === r.length)
+      return { lines: s, index: r };
+    const c = /* @__PURE__ */ new Map();
     for (let o = 0; o < r.length; o++)
-      u.set(r[o], n[o]);
+      c.set(r[o], s[o]);
     const l = [], h = [];
-    for (let o = s; o <= i; o++) {
-      const a = u.get(o) ?? this.info.lines[o];
+    for (let o = n; o <= i; o++) {
+      const a = c.get(o) ?? this.info.lines[o];
       a && (l.push(a), h.push(o));
     }
     return { lines: l, index: h };
   }
-  handleEmitLinesUpdate(n) {
+  handleEmitLinesUpdate(s) {
     const r = this.handleBridgeActive(this.active.lines, this.active.index);
-    this.event.emit("linesUpdate", r.lines, r.index, this.handleGetActiveIndex(), n);
+    this.event.emit("linesUpdate", r.lines, r.index, this.handleGetActiveIndex(), s);
   }
-  handleSyncTime(n) {
-    if (!this.info.lines.length || (n === void 0 && (n = this.handleGetEffectiveTime()), !Number.isFinite(n)))
+  handleSyncTime(s) {
+    if (!this.info.lines.length || (s === void 0 && (s = this.handleGetEffectiveTime()), !Number.isFinite(s)))
       return;
-    const r = [], s = [];
+    const r = [], n = [];
     let i = this.info.lines.length;
-    for (let u = 0; u < this.info.lines.length; u++) {
-      const l = this.info.lines[u];
-      if (l.time.start > n) {
-        i = u;
+    for (let c = 0; c < this.info.lines.length; c++) {
+      const l = this.info.lines[c];
+      if (l.time.start > s) {
+        i = c;
         break;
       }
-      this.handleGetLineTime(u) > n && (r.push(l), s.push(u));
+      this.handleGetMergedLineTime(c) > s && (r.push(l), n.push(c));
     }
-    this.state.scanIndex = i, this.active.lines = r, this.active.index = s, this.handleEmitLinesUpdate(!0);
+    this.state.scanIndex = i, this.active.lines = r, this.active.index = n, this.handleEmitLinesUpdate(!0);
   }
-  handleUpdateActiveLines(n) {
+  handleUpdateActiveLines(s) {
     let r = !1;
-    const s = [], i = [];
-    for (let u = 0; u < this.active.lines.length; u++) {
-      const l = this.active.lines[u], h = this.active.index[u];
-      n >= this.handleGetLineTime(h) ? r = !0 : (s.push(l), i.push(h));
+    const n = [], i = [];
+    for (let c = 0; c < this.active.lines.length; c++) {
+      const l = this.active.lines[c], h = this.active.index[c];
+      s >= this.handleGetMergedLineTime(h) ? r = !0 : (n.push(l), i.push(h));
     }
     for (; this.state.scanIndex < this.info.lines.length; ) {
-      const u = this.info.lines[this.state.scanIndex];
-      if (n >= u.time.start)
-        n < this.handleGetLineTime(this.state.scanIndex) && (s.push(u), i.push(this.state.scanIndex), r = !0), this.state.scanIndex++;
+      const c = this.info.lines[this.state.scanIndex];
+      if (s >= c.time.start)
+        s < this.handleGetMergedLineTime(this.state.scanIndex) && (n.push(c), i.push(this.state.scanIndex), r = !0), this.state.scanIndex++;
       else
         break;
     }
-    r && (this.active.lines = s, this.active.index = i, this.handleEmitLinesUpdate(!1));
+    r && (this.active.lines = n, this.active.index = i, this.handleEmitLinesUpdate(!1));
   }
   onTick = () => {
     if (!this.state.playing)
       return;
-    const n = this.handleGetEffectiveTime();
-    switch (this.handleUpdateActiveLines(n), this.config.current.driver) {
+    const s = this.handleGetEffectiveTime();
+    switch (this.handleUpdateActiveLines(s), this.config.current.driver) {
       case "animation":
         this.state.frameId = globalThis.requestAnimationFrame(this.onTick);
         break;
@@ -1315,18 +1336,18 @@ class ts {
         break;
     }
   };
-  updateLyric(n) {
-    if (!n)
+  updateLyric(s) {
+    if (!s)
       return;
-    let r = n;
-    Kr.satisfies(n.version, Ht) || (console.warn(`[music-lyric-player] ignored lyric with incompatible version "${n.version}", expected "${Ht}"`), r = new M.Info()), this.pause(), this.info = r, this.handleRefreshOffset(), this.config.current.offset.resetTempOnLyricChange && (this.offset.temp = 0), this.active.lines = [], this.active.index = [], this.state.scanIndex = 0, this.time.seek = 0, this.event.emit("lyricUpdate", r), this.event.emit("linesUpdate", [], [], -1, !1);
+    let r = s;
+    Kr.satisfies(s.version, Ht) || (console.warn(`[music-lyric-player] ignored lyric with incompatible version "${s.version}", expected "${Ht}"`), r = new X.Info()), this.pause(), this.info = r, this.handleBuildMergedLineEnd(), this.handleRefreshOffset(), this.config.current.offset.resetTempOnLyricChange && (this.offset.temp = 0), this.active.lines = [], this.active.index = [], this.state.scanIndex = 0, this.time.seek = 0, this.event.emit("lyricUpdate", r), this.event.emit("linesUpdate", [], [], -1, !1);
   }
   /**
    * Start playback
    * @param time Optional time in ms to seek to before starting playback. If not provided, playback will start from the current position.
    */
-  play(n) {
-    this.pause(), typeof n == "number" && Number.isFinite(n) && (this.time.seek = n, this.handleSyncTime()), this.time.start = performance.now(), this.state.playing = !0, this.onTick(), this.event.emit("play", this.handleGetCurrentTime());
+  play(s) {
+    this.pause(), typeof s == "number" && Number.isFinite(s) && (this.time.seek = s, this.handleSyncTime()), this.time.start = performance.now(), this.state.playing = !0, this.onTick(), this.event.emit("play", this.handleGetCurrentTime());
   }
   /**
    * Pause playback
@@ -1338,38 +1359,38 @@ class ts {
    * Stop playback
    */
   dispose() {
-    this.pause(), this.event.clear(), this.config.event.remove("update", this.onConfigUpdate), this.active.lines = [], this.active.index = [], this.info = new M.Info();
+    this.pause(), this.event.clear(), this.config.event.remove("update", this.onConfigUpdate), this.active.lines = [], this.active.index = [], this.info = new X.Info();
   }
   /**
    * Update the temp offset in ms (the user's temporary adjustment).
    * Stacked on top of the global config offset and the lyric's meta offset, then resyncs immediately.
    * @param value temp offset in ms; non-finite values are treated as 0.
    */
-  updateTempOffset(n) {
-    this.offset.temp = Number.isFinite(n) ? n : 0, this.handleSyncTime();
+  updateTempOffset(s) {
+    this.offset.temp = Number.isFinite(s) ? s : 0, this.handleSyncTime();
   }
   /**
    * Find all active lines at the given time (ms). Does not mutate internal state.
    * Assumes `info.lines` is sorted by `time.start` ascending.
    * @param time time in ms to find active lines for.
    */
-  matchLinesWithTime(n) {
-    const r = n + this.currentOffset, s = [], i = [];
-    for (let u = 0; u < this.info.lines.length; u++) {
-      const l = this.info.lines[u];
+  matchLinesWithTime(s) {
+    const r = s + this.currentOffset, n = [], i = [];
+    for (let c = 0; c < this.info.lines.length; c++) {
+      const l = this.info.lines[c];
       if (l.time.start > r)
         break;
-      this.handleGetLineTime(u) > r && (s.push(l), i.push(u));
+      this.handleGetMergedLineTime(c) > r && (n.push(l), i.push(c));
     }
-    return this.handleBridgeActive(s, i);
+    return this.handleBridgeActive(n, i);
   }
   /**
    * Convert a content (lyric) time to the playback clock by removing the active offset.
    * Seeking playback to the returned time makes a line at `contentTime` become active.
    * @param contentTime content time in ms (e.g. a line's start).
    */
-  convertContentTime(n) {
-    return n - this.currentOffset;
+  convertContentTime(s) {
+    return s - this.currentOffset;
   }
   /**
    * Whether the player is currently playing.
@@ -1411,8 +1432,8 @@ class ts {
    * The current effective lyric offset in ms (config offset + lyric meta offset + temp offset).
    */
   get currentOffset() {
-    const n = this.config.current.offset.global + this.offset.meta + this.offset.temp;
-    return Number.isFinite(n) ? n : 0;
+    const s = this.config.current.offset.global + this.offset.meta + this.offset.temp;
+    return Number.isFinite(s) ? s : 0;
   }
 }
 export {