@vc-shell/framework 1.1.61 → 1.1.63

package/dist/{vendor-semver-BoKYtkQw.js → vendor-semver-FuwqpOls.js}

@@ -1,14 +1,14 @@
-var H = { exports: {} }, K, Ke;
+var H = { exports: {} }, ee, Ke;
 function k() {
-  if (Ke) return K;
+  if (Ke) return ee;
   Ke = 1;
-  const a = "2.0.0", l = 256, n = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
-  9007199254740991, r = 16, i = l - 6;
-  return K = {
-    MAX_LENGTH: l,
+  const a = "2.0.0", u = 256, i = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
+  9007199254740991, r = 16, n = u - 6;
+  return ee = {
+    MAX_LENGTH: u,
     MAX_SAFE_COMPONENT_LENGTH: r,
-    MAX_SAFE_BUILD_LENGTH: i,
-    MAX_SAFE_INTEGER: n,
+    MAX_SAFE_BUILD_LENGTH: n,
+    MAX_SAFE_INTEGER: i,
     RELEASE_TYPES: [
       "major",
       "premajor",
@@ -21,64 +21,64 @@ function k() {
     SEMVER_SPEC_VERSION: a,
     FLAG_INCLUDE_PRERELEASE: 1,
     FLAG_LOOSE: 2
-  }, K;
+  }, ee;
 }
-var Z, Ze;
+var re, Ze;
 function B() {
-  return Ze || (Ze = 1, Z = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...l) => console.error("SEMVER", ...l) : () => {
-  }), Z;
+  return Ze || (Ze = 1, re = typeof process == "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...u) => console.error("SEMVER", ...u) : () => {
+  }), re;
 }
 var Je;
-function b() {
-  return Je || (Je = 1, function(a, l) {
+function M() {
+  return Je || (Je = 1, function(a, u) {
     const {
-      MAX_SAFE_COMPONENT_LENGTH: n,
+      MAX_SAFE_COMPONENT_LENGTH: i,
       MAX_SAFE_BUILD_LENGTH: r,
-      MAX_LENGTH: i
-    } = /* @__PURE__ */ k(), p = /* @__PURE__ */ B();
-    l = a.exports = {};
-    const c = l.re = [], f = l.safeRe = [], s = l.src = [], t = l.safeSrc = [], e = l.t = {};
+      MAX_LENGTH: n
+    } = k(), p = B();
+    u = a.exports = {};
+    const c = u.re = [], f = u.safeRe = [], s = u.src = [], t = u.safeSrc = [], e = u.t = {};
     let o = 0;
-    const u = "[a-zA-Z0-9-]", m = [
+    const l = "[a-zA-Z0-9-]", m = [
       ["\\s", 1],
-      ["\\d", i],
-      [u, r]
-    ], A = (O) => {
-      for (const [g, y] of m)
-        O = O.split(`${g}*`).join(`${g}{0,${y}}`).split(`${g}+`).join(`${g}{1,${y}}`);
-      return O;
-    }, E = (O, g, y) => {
-      const w = A(g), G = o++;
-      p(O, G, g), e[O] = G, s[G] = g, t[G] = w, c[G] = new RegExp(g, y ? "g" : void 0), f[G] = new RegExp(w, y ? "g" : void 0);
+      ["\\d", n],
+      [l, r]
+    ], A = (S) => {
+      for (const [g, G] of m)
+        S = S.split(`${g}*`).join(`${g}{0,${G}}`).split(`${g}+`).join(`${g}{1,${G}}`);
+      return S;
+    }, E = (S, g, G) => {
+      const w = A(g), y = o++;
+      p(S, y, g), e[S] = y, s[y] = g, t[y] = w, c[y] = new RegExp(g, G ? "g" : void 0), f[y] = new RegExp(w, G ? "g" : void 0);
     };
-    E("NUMERICIDENTIFIER", "0|[1-9]\\d*"), E("NUMERICIDENTIFIERLOOSE", "\\d+"), E("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${u}*`), E("MAINVERSION", `(${s[e.NUMERICIDENTIFIER]})\\.(${s[e.NUMERICIDENTIFIER]})\\.(${s[e.NUMERICIDENTIFIER]})`), E("MAINVERSIONLOOSE", `(${s[e.NUMERICIDENTIFIERLOOSE]})\\.(${s[e.NUMERICIDENTIFIERLOOSE]})\\.(${s[e.NUMERICIDENTIFIERLOOSE]})`), E("PRERELEASEIDENTIFIER", `(?:${s[e.NONNUMERICIDENTIFIER]}|${s[e.NUMERICIDENTIFIER]})`), E("PRERELEASEIDENTIFIERLOOSE", `(?:${s[e.NONNUMERICIDENTIFIER]}|${s[e.NUMERICIDENTIFIERLOOSE]})`), E("PRERELEASE", `(?:-(${s[e.PRERELEASEIDENTIFIER]}(?:\\.${s[e.PRERELEASEIDENTIFIER]})*))`), E("PRERELEASELOOSE", `(?:-?(${s[e.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${s[e.PRERELEASEIDENTIFIERLOOSE]})*))`), E("BUILDIDENTIFIER", `${u}+`), E("BUILD", `(?:\\+(${s[e.BUILDIDENTIFIER]}(?:\\.${s[e.BUILDIDENTIFIER]})*))`), E("FULLPLAIN", `v?${s[e.MAINVERSION]}${s[e.PRERELEASE]}?${s[e.BUILD]}?`), E("FULL", `^${s[e.FULLPLAIN]}$`), E("LOOSEPLAIN", `[v=\\s]*${s[e.MAINVERSIONLOOSE]}${s[e.PRERELEASELOOSE]}?${s[e.BUILD]}?`), E("LOOSE", `^${s[e.LOOSEPLAIN]}$`), E("GTLT", "((?:<|>)?=?)"), E("XRANGEIDENTIFIERLOOSE", `${s[e.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), E("XRANGEIDENTIFIER", `${s[e.NUMERICIDENTIFIER]}|x|X|\\*`), E("XRANGEPLAIN", `[v=\\s]*(${s[e.XRANGEIDENTIFIER]})(?:\\.(${s[e.XRANGEIDENTIFIER]})(?:\\.(${s[e.XRANGEIDENTIFIER]})(?:${s[e.PRERELEASE]})?${s[e.BUILD]}?)?)?`), E("XRANGEPLAINLOOSE", `[v=\\s]*(${s[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${s[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${s[e.XRANGEIDENTIFIERLOOSE]})(?:${s[e.PRERELEASELOOSE]})?${s[e.BUILD]}?)?)?`), E("XRANGE", `^${s[e.GTLT]}\\s*${s[e.XRANGEPLAIN]}$`), E("XRANGELOOSE", `^${s[e.GTLT]}\\s*${s[e.XRANGEPLAINLOOSE]}$`), E("COERCEPLAIN", `(^|[^\\d])(\\d{1,${n}})(?:\\.(\\d{1,${n}}))?(?:\\.(\\d{1,${n}}))?`), E("COERCE", `${s[e.COERCEPLAIN]}(?:$|[^\\d])`), E("COERCEFULL", s[e.COERCEPLAIN] + `(?:${s[e.PRERELEASE]})?(?:${s[e.BUILD]})?(?:$|[^\\d])`), E("COERCERTL", s[e.COERCE], !0), E("COERCERTLFULL", s[e.COERCEFULL], !0), E("LONETILDE", "(?:~>?)"), E("TILDETRIM", `(\\s*)${s[e.LONETILDE]}\\s+`, !0), l.tildeTrimReplace = "$1~", E("TILDE", `^${s[e.LONETILDE]}${s[e.XRANGEPLAIN]}$`), E("TILDELOOSE", `^${s[e.LONETILDE]}${s[e.XRANGEPLAINLOOSE]}$`), E("LONECARET", "(?:\\^)"), E("CARETTRIM", `(\\s*)${s[e.LONECARET]}\\s+`, !0), l.caretTrimReplace = "$1^", E("CARET", `^${s[e.LONECARET]}${s[e.XRANGEPLAIN]}$`), E("CARETLOOSE", `^${s[e.LONECARET]}${s[e.XRANGEPLAINLOOSE]}$`), E("COMPARATORLOOSE", `^${s[e.GTLT]}\\s*(${s[e.LOOSEPLAIN]})$|^$`), E("COMPARATOR", `^${s[e.GTLT]}\\s*(${s[e.FULLPLAIN]})$|^$`), E("COMPARATORTRIM", `(\\s*)${s[e.GTLT]}\\s*(${s[e.LOOSEPLAIN]}|${s[e.XRANGEPLAIN]})`, !0), l.comparatorTrimReplace = "$1$2$3", E("HYPHENRANGE", `^\\s*(${s[e.XRANGEPLAIN]})\\s+-\\s+(${s[e.XRANGEPLAIN]})\\s*$`), E("HYPHENRANGELOOSE", `^\\s*(${s[e.XRANGEPLAINLOOSE]})\\s+-\\s+(${s[e.XRANGEPLAINLOOSE]})\\s*$`), E("STAR", "(<|>)?=?\\s*\\*"), E("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), E("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
+    E("NUMERICIDENTIFIER", "0|[1-9]\\d*"), E("NUMERICIDENTIFIERLOOSE", "\\d+"), E("NONNUMERICIDENTIFIER", `\\d*[a-zA-Z-]${l}*`), E("MAINVERSION", `(${s[e.NUMERICIDENTIFIER]})\\.(${s[e.NUMERICIDENTIFIER]})\\.(${s[e.NUMERICIDENTIFIER]})`), E("MAINVERSIONLOOSE", `(${s[e.NUMERICIDENTIFIERLOOSE]})\\.(${s[e.NUMERICIDENTIFIERLOOSE]})\\.(${s[e.NUMERICIDENTIFIERLOOSE]})`), E("PRERELEASEIDENTIFIER", `(?:${s[e.NONNUMERICIDENTIFIER]}|${s[e.NUMERICIDENTIFIER]})`), E("PRERELEASEIDENTIFIERLOOSE", `(?:${s[e.NONNUMERICIDENTIFIER]}|${s[e.NUMERICIDENTIFIERLOOSE]})`), E("PRERELEASE", `(?:-(${s[e.PRERELEASEIDENTIFIER]}(?:\\.${s[e.PRERELEASEIDENTIFIER]})*))`), E("PRERELEASELOOSE", `(?:-?(${s[e.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${s[e.PRERELEASEIDENTIFIERLOOSE]})*))`), E("BUILDIDENTIFIER", `${l}+`), E("BUILD", `(?:\\+(${s[e.BUILDIDENTIFIER]}(?:\\.${s[e.BUILDIDENTIFIER]})*))`), E("FULLPLAIN", `v?${s[e.MAINVERSION]}${s[e.PRERELEASE]}?${s[e.BUILD]}?`), E("FULL", `^${s[e.FULLPLAIN]}$`), E("LOOSEPLAIN", `[v=\\s]*${s[e.MAINVERSIONLOOSE]}${s[e.PRERELEASELOOSE]}?${s[e.BUILD]}?`), E("LOOSE", `^${s[e.LOOSEPLAIN]}$`), E("GTLT", "((?:<|>)?=?)"), E("XRANGEIDENTIFIERLOOSE", `${s[e.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`), E("XRANGEIDENTIFIER", `${s[e.NUMERICIDENTIFIER]}|x|X|\\*`), E("XRANGEPLAIN", `[v=\\s]*(${s[e.XRANGEIDENTIFIER]})(?:\\.(${s[e.XRANGEIDENTIFIER]})(?:\\.(${s[e.XRANGEIDENTIFIER]})(?:${s[e.PRERELEASE]})?${s[e.BUILD]}?)?)?`), E("XRANGEPLAINLOOSE", `[v=\\s]*(${s[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${s[e.XRANGEIDENTIFIERLOOSE]})(?:\\.(${s[e.XRANGEIDENTIFIERLOOSE]})(?:${s[e.PRERELEASELOOSE]})?${s[e.BUILD]}?)?)?`), E("XRANGE", `^${s[e.GTLT]}\\s*${s[e.XRANGEPLAIN]}$`), E("XRANGELOOSE", `^${s[e.GTLT]}\\s*${s[e.XRANGEPLAINLOOSE]}$`), E("COERCEPLAIN", `(^|[^\\d])(\\d{1,${i}})(?:\\.(\\d{1,${i}}))?(?:\\.(\\d{1,${i}}))?`), E("COERCE", `${s[e.COERCEPLAIN]}(?:$|[^\\d])`), E("COERCEFULL", s[e.COERCEPLAIN] + `(?:${s[e.PRERELEASE]})?(?:${s[e.BUILD]})?(?:$|[^\\d])`), E("COERCERTL", s[e.COERCE], !0), E("COERCERTLFULL", s[e.COERCEFULL], !0), E("LONETILDE", "(?:~>?)"), E("TILDETRIM", `(\\s*)${s[e.LONETILDE]}\\s+`, !0), u.tildeTrimReplace = "$1~", E("TILDE", `^${s[e.LONETILDE]}${s[e.XRANGEPLAIN]}$`), E("TILDELOOSE", `^${s[e.LONETILDE]}${s[e.XRANGEPLAINLOOSE]}$`), E("LONECARET", "(?:\\^)"), E("CARETTRIM", `(\\s*)${s[e.LONECARET]}\\s+`, !0), u.caretTrimReplace = "$1^", E("CARET", `^${s[e.LONECARET]}${s[e.XRANGEPLAIN]}$`), E("CARETLOOSE", `^${s[e.LONECARET]}${s[e.XRANGEPLAINLOOSE]}$`), E("COMPARATORLOOSE", `^${s[e.GTLT]}\\s*(${s[e.LOOSEPLAIN]})$|^$`), E("COMPARATOR", `^${s[e.GTLT]}\\s*(${s[e.FULLPLAIN]})$|^$`), E("COMPARATORTRIM", `(\\s*)${s[e.GTLT]}\\s*(${s[e.LOOSEPLAIN]}|${s[e.XRANGEPLAIN]})`, !0), u.comparatorTrimReplace = "$1$2$3", E("HYPHENRANGE", `^\\s*(${s[e.XRANGEPLAIN]})\\s+-\\s+(${s[e.XRANGEPLAIN]})\\s*$`), E("HYPHENRANGELOOSE", `^\\s*(${s[e.XRANGEPLAINLOOSE]})\\s+-\\s+(${s[e.XRANGEPLAINLOOSE]})\\s*$`), E("STAR", "(<|>)?=?\\s*\\*"), E("GTE0", "^\\s*>=\\s*0\\.0\\.0\\s*$"), E("GTE0PRE", "^\\s*>=\\s*0\\.0\\.0-0\\s*$");
   }(H, H.exports)), H.exports;
 }
-var J, Qe;
-function Ve() {
-  if (Qe) return J;
+var te, Qe;
+function He() {
+  if (Qe) return te;
   Qe = 1;
-  const a = Object.freeze({ loose: !0 }), l = Object.freeze({});
-  return J = (r) => r ? typeof r != "object" ? a : r : l, J;
+  const a = Object.freeze({ loose: !0 }), u = Object.freeze({});
+  return te = (r) => r ? typeof r != "object" ? a : r : u, te;
 }
-var Q, er;
+var se, er;
 function xr() {
-  if (er) return Q;
+  if (er) return se;
   er = 1;
-  const a = /^[0-9]+$/, l = (r, i) => {
-    const p = a.test(r), c = a.test(i);
-    return p && c && (r = +r, i = +i), r === i ? 0 : p && !c ? -1 : c && !p ? 1 : r < i ? -1 : 1;
+  const a = /^[0-9]+$/, u = (r, n) => {
+    const p = a.test(r), c = a.test(n);
+    return p && c && (r = +r, n = +n), r === n ? 0 : p && !c ? -1 : c && !p ? 1 : r < n ? -1 : 1;
   };
-  return Q = {
-    compareIdentifiers: l,
-    rcompareIdentifiers: (r, i) => l(i, r)
-  }, Q;
-}
-var ee, rr;
-function _() {
-  if (rr) return ee;
+  return se = {
+    compareIdentifiers: u,
+    rcompareIdentifiers: (r, n) => u(n, r)
+  }, se;
+}
+var ne, rr;
+function j() {
+  if (rr) return ne;
   rr = 1;
-  const a = /* @__PURE__ */ B(), { MAX_LENGTH: l, MAX_SAFE_INTEGER: n } = /* @__PURE__ */ k(), { safeRe: r, t: i } = /* @__PURE__ */ b(), p = /* @__PURE__ */ Ve(), { compareIdentifiers: c } = /* @__PURE__ */ xr();
+  const a = B(), { MAX_LENGTH: u, MAX_SAFE_INTEGER: i } = k(), { safeRe: r, t: n } = M(), p = He(), { compareIdentifiers: c } = xr();
   class f {
     constructor(t, e) {
       if (e = p(e), t instanceof f) {
@@ -87,27 +87,27 @@ function _() {
         t = t.version;
       } else if (typeof t != "string")
         throw new TypeError(`Invalid version. Must be a string. Got type "${typeof t}".`);
-      if (t.length > l)
+      if (t.length > u)
         throw new TypeError(
-          `version is longer than ${l} characters`
+          `version is longer than ${u} characters`
         );
       a("SemVer", t, e), this.options = e, this.loose = !!e.loose, this.includePrerelease = !!e.includePrerelease;
-      const o = t.trim().match(e.loose ? r[i.LOOSE] : r[i.FULL]);
+      const o = t.trim().match(e.loose ? r[n.LOOSE] : r[n.FULL]);
       if (!o)
         throw new TypeError(`Invalid Version: ${t}`);
-      if (this.raw = t, this.major = +o[1], this.minor = +o[2], this.patch = +o[3], this.major > n || this.major < 0)
+      if (this.raw = t, this.major = +o[1], this.minor = +o[2], this.patch = +o[3], this.major > i || this.major < 0)
         throw new TypeError("Invalid major version");
-      if (this.minor > n || this.minor < 0)
+      if (this.minor > i || this.minor < 0)
         throw new TypeError("Invalid minor version");
-      if (this.patch > n || this.patch < 0)
+      if (this.patch > i || this.patch < 0)
         throw new TypeError("Invalid patch version");
-      o[4] ? this.prerelease = o[4].split(".").map((u) => {
-        if (/^[0-9]+$/.test(u)) {
-          const m = +u;
-          if (m >= 0 && m < n)
+      o[4] ? this.prerelease = o[4].split(".").map((l) => {
+        if (/^[0-9]+$/.test(l)) {
+          const m = +l;
+          if (m >= 0 && m < i)
             return m;
         }
-        return u;
+        return l;
       }) : this.prerelease = [], this.build = o[5] ? o[5].split(".") : [], this.format();
     }
     format() {
@@ -136,32 +136,32 @@ function _() {
         return 0;
       let e = 0;
       do {
-        const o = this.prerelease[e], u = t.prerelease[e];
-        if (a("prerelease compare", e, o, u), o === void 0 && u === void 0)
+        const o = this.prerelease[e], l = t.prerelease[e];
+        if (a("prerelease compare", e, o, l), o === void 0 && l === void 0)
           return 0;
-        if (u === void 0)
+        if (l === void 0)
           return 1;
         if (o === void 0)
           return -1;
-        if (o === u)
+        if (o === l)
           continue;
-        return c(o, u);
+        return c(o, l);
       } while (++e);
     }
     compareBuild(t) {
       t instanceof f || (t = new f(t, this.options));
       let e = 0;
       do {
-        const o = this.build[e], u = t.build[e];
-        if (a("build compare", e, o, u), o === void 0 && u === void 0)
+        const o = this.build[e], l = t.build[e];
+        if (a("build compare", e, o, l), o === void 0 && l === void 0)
           return 0;
-        if (u === void 0)
+        if (l === void 0)
           return 1;
         if (o === void 0)
           return -1;
-        if (o === u)
+        if (o === l)
           continue;
-        return c(o, u);
+        return c(o, l);
       } while (++e);
     }
     // preminor will bump the version up to the next minor release, and immediately
@@ -171,8 +171,8 @@ function _() {
         if (!e && o === !1)
           throw new Error("invalid increment argument: identifier is empty");
         if (e) {
-          const u = `-${e}`.match(this.options.loose ? r[i.PRERELEASELOOSE] : r[i.PRERELEASE]);
-          if (!u || u[1] !== e)
+          const l = `-${e}`.match(this.options.loose ? r[n.PRERELEASELOOSE] : r[n.PRERELEASE]);
+          if (!l || l[1] !== e)
             throw new Error(`invalid identifier: ${e}`);
         }
       }
@@ -208,9 +208,9 @@ function _() {
         // 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 u = Number(o) ? 1 : 0;
+          const l = Number(o) ? 1 : 0;
           if (this.prerelease.length === 0)
-            this.prerelease = [u];
+            this.prerelease = [l];
           else {
             let m = this.prerelease.length;
             for (; --m >= 0; )
@@ -218,11 +218,11 @@ function _() {
             if (m === -1) {
               if (e === this.prerelease.join(".") && o === !1)
                 throw new Error("invalid increment argument: identifier already exists");
-              this.prerelease.push(u);
+              this.prerelease.push(l);
             }
           }
           if (e) {
-            let m = [e, u];
+            let m = [e, l];
             o === !1 && (m = [e]), c(this.prerelease[0], e) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = m) : this.prerelease = m;
           }
           break;
@@ -233,206 +233,206 @@ function _() {
       return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
     }
   }
-  return ee = f, ee;
+  return ne = f, ne;
 }
-var re, tr;
+var ie, tr;
 function V() {
-  if (tr) return re;
+  if (tr) return ie;
   tr = 1;
-  const a = /* @__PURE__ */ _();
-  return re = (n, r, i = !1) => {
-    if (n instanceof a)
-      return n;
+  const a = j();
+  return ie = (i, r, n = !1) => {
+    if (i instanceof a)
+      return i;
     try {
-      return new a(n, r);
+      return new a(i, r);
     } catch (p) {
-      if (!i)
+      if (!n)
         return null;
       throw p;
     }
-  }, re;
+  }, ie;
 }
-var te, sr;
+var ae, sr;
 function kr() {
-  if (sr) return te;
+  if (sr) return ae;
   sr = 1;
-  const a = /* @__PURE__ */ V();
-  return te = (n, r) => {
-    const i = a(n, r);
-    return i ? i.version : null;
-  }, te;
+  const a = V();
+  return ae = (i, r) => {
+    const n = a(i, r);
+    return n ? n.version : null;
+  }, ae;
 }
-var se, nr;
+var oe, nr;
 function Br() {
-  if (nr) return se;
+  if (nr) return oe;
   nr = 1;
-  const a = /* @__PURE__ */ V();
-  return se = (n, r) => {
-    const i = a(n.trim().replace(/^[=v]+/, ""), r);
-    return i ? i.version : null;
-  }, se;
+  const a = V();
+  return oe = (i, r) => {
+    const n = a(i.trim().replace(/^[=v]+/, ""), r);
+    return n ? n.version : null;
+  }, oe;
 }
-var ne, ir;
+var ce, ir;
 function Yr() {
-  if (ir) return ne;
+  if (ir) return ce;
   ir = 1;
-  const a = /* @__PURE__ */ _();
-  return ne = (n, r, i, p, c) => {
-    typeof i == "string" && (c = p, p = i, i = void 0);
+  const a = j();
+  return ce = (i, r, n, p, c) => {
+    typeof n == "string" && (c = p, p = n, n = void 0);
     try {
       return new a(
-        n instanceof a ? n.version : n,
-        i
+        i instanceof a ? i.version : i,
+        n
       ).inc(r, p, c).version;
     } catch {
       return null;
     }
-  }, ne;
+  }, ce;
 }
-var ie, ar;
+var ue, ar;
 function Wr() {
-  if (ar) return ie;
+  if (ar) return ue;
   ar = 1;
-  const a = /* @__PURE__ */ V();
-  return ie = (n, r) => {
-    const i = a(n, null, !0), p = a(r, null, !0), c = i.compare(p);
+  const a = V();
+  return ue = (i, r) => {
+    const n = a(i, null, !0), p = a(r, null, !0), c = n.compare(p);
     if (c === 0)
       return null;
-    const f = c > 0, s = f ? i : p, t = f ? p : i, e = !!s.prerelease.length;
+    const f = c > 0, s = f ? n : p, t = f ? p : n, e = !!s.prerelease.length;
     if (!!t.prerelease.length && !e) {
       if (!t.patch && !t.minor)
         return "major";
       if (t.compareMain(s) === 0)
         return t.minor && !t.patch ? "minor" : "patch";
     }
-    const u = e ? "pre" : "";
-    return i.major !== p.major ? u + "major" : i.minor !== p.minor ? u + "minor" : i.patch !== p.patch ? u + "patch" : "prerelease";
-  }, ie;
+    const l = e ? "pre" : "";
+    return n.major !== p.major ? l + "major" : n.minor !== p.minor ? l + "minor" : n.patch !== p.patch ? l + "patch" : "prerelease";
+  }, ue;
 }
-var ae, or;
+var le, or;
 function zr() {
-  if (or) return ae;
+  if (or) return le;
   or = 1;
-  const a = /* @__PURE__ */ _();
-  return ae = (n, r) => new a(n, r).major, ae;
+  const a = j();
+  return le = (i, r) => new a(i, r).major, le;
 }
-var oe, cr;
+var fe, cr;
 function Kr() {
-  if (cr) return oe;
+  if (cr) return fe;
   cr = 1;
-  const a = /* @__PURE__ */ _();
-  return oe = (n, r) => new a(n, r).minor, oe;
+  const a = j();
+  return fe = (i, r) => new a(i, r).minor, fe;
 }
-var ce, lr;
+var he, ur;
 function Zr() {
-  if (lr) return ce;
-  lr = 1;
-  const a = /* @__PURE__ */ _();
-  return ce = (n, r) => new a(n, r).patch, ce;
+  if (ur) return he;
+  ur = 1;
+  const a = j();
+  return he = (i, r) => new a(i, r).patch, he;
 }
-var le, ur;
+var Ee, lr;
 function Jr() {
-  if (ur) return le;
-  ur = 1;
-  const a = /* @__PURE__ */ V();
-  return le = (n, r) => {
-    const i = a(n, r);
-    return i && i.prerelease.length ? i.prerelease : null;
-  }, le;
+  if (lr) return Ee;
+  lr = 1;
+  const a = V();
+  return Ee = (i, r) => {
+    const n = a(i, r);
+    return n && n.prerelease.length ? n.prerelease : null;
+  }, Ee;
 }
-var ue, fr;
+var pe, fr;
 function U() {
-  if (fr) return ue;
+  if (fr) return pe;
   fr = 1;
-  const a = /* @__PURE__ */ _();
-  return ue = (n, r, i) => new a(n, i).compare(new a(r, i)), ue;
+  const a = j();
+  return pe = (i, r, n) => new a(i, n).compare(new a(r, n)), pe;
 }
-var fe, hr;
+var Re, hr;
 function Qr() {
-  if (hr) return fe;
+  if (hr) return Re;
   hr = 1;
-  const a = /* @__PURE__ */ U();
-  return fe = (n, r, i) => a(r, n, i), fe;
+  const a = U();
+  return Re = (i, r, n) => a(r, i, n), Re;
 }
-var he, Er;
+var me, Er;
 function et() {
-  if (Er) return he;
+  if (Er) return me;
   Er = 1;
-  const a = /* @__PURE__ */ U();
-  return he = (n, r) => a(n, r, !0), he;
+  const a = U();
+  return me = (i, r) => a(i, r, !0), me;
 }
-var Ee, pr;
-function xe() {
-  if (pr) return Ee;
+var $e, pr;
+function ke() {
+  if (pr) return $e;
   pr = 1;
-  const a = /* @__PURE__ */ _();
-  return Ee = (n, r, i) => {
-    const p = new a(n, i), c = new a(r, i);
+  const a = j();
+  return $e = (i, r, n) => {
+    const p = new a(i, n), c = new a(r, n);
     return p.compare(c) || p.compareBuild(c);
-  }, Ee;
+  }, $e;
 }
-var pe, Rr;
+var de, Rr;
 function rt() {
-  if (Rr) return pe;
+  if (Rr) return de;
   Rr = 1;
-  const a = /* @__PURE__ */ xe();
-  return pe = (n, r) => n.sort((i, p) => a(i, p, r)), pe;
+  const a = ke();
+  return de = (i, r) => i.sort((n, p) => a(n, p, r)), de;
 }
-var Re, mr;
+var Ie, mr;
 function tt() {
-  if (mr) return Re;
+  if (mr) return Ie;
   mr = 1;
-  const a = /* @__PURE__ */ xe();
-  return Re = (n, r) => n.sort((i, p) => a(p, i, r)), Re;
+  const a = ke();
+  return Ie = (i, r) => i.sort((n, p) => a(p, n, r)), Ie;
 }
-var me, $r;
+var ve, $r;
 function Y() {
-  if ($r) return me;
+  if ($r) return ve;
   $r = 1;
-  const a = /* @__PURE__ */ U();
-  return me = (n, r, i) => a(n, r, i) > 0, me;
+  const a = U();
+  return ve = (i, r, n) => a(i, r, n) > 0, ve;
 }
-var $e, dr;
-function be() {
-  if (dr) return $e;
+var Le, dr;
+function Be() {
+  if (dr) return Le;
   dr = 1;
-  const a = /* @__PURE__ */ U();
-  return $e = (n, r, i) => a(n, r, i) < 0, $e;
+  const a = U();
+  return Le = (i, r, n) => a(i, r, n) < 0, Le;
 }
-var de, Ir;
+var Ne, Ir;
 function br() {
-  if (Ir) return de;
+  if (Ir) return Ne;
   Ir = 1;
-  const a = /* @__PURE__ */ U();
-  return de = (n, r, i) => a(n, r, i) === 0, de;
+  const a = U();
+  return Ne = (i, r, n) => a(i, r, n) === 0, Ne;
 }
-var Ie, vr;
+var Oe, vr;
 function Mr() {
-  if (vr) return Ie;
+  if (vr) return Oe;
   vr = 1;
-  const a = /* @__PURE__ */ U();
-  return Ie = (n, r, i) => a(n, r, i) !== 0, Ie;
+  const a = U();
+  return Oe = (i, r, n) => a(i, r, n) !== 0, Oe;
 }
-var ve, Lr;
-function Me() {
-  if (Lr) return ve;
+var Se, Lr;
+function Ye() {
+  if (Lr) return Se;
   Lr = 1;
-  const a = /* @__PURE__ */ U();
-  return ve = (n, r, i) => a(n, r, i) >= 0, ve;
+  const a = U();
+  return Se = (i, r, n) => a(i, r, n) >= 0, Se;
 }
-var Le, Nr;
-function He() {
-  if (Nr) return Le;
+var Ae, Nr;
+function We() {
+  if (Nr) return Ae;
   Nr = 1;
-  const a = /* @__PURE__ */ U();
-  return Le = (n, r, i) => a(n, r, i) <= 0, Le;
+  const a = U();
+  return Ae = (i, r, n) => a(i, r, n) <= 0, Ae;
 }
-var Ne, Sr;
+var Te, Or;
 function Hr() {
-  if (Sr) return Ne;
-  Sr = 1;
-  const a = /* @__PURE__ */ br(), l = /* @__PURE__ */ Mr(), n = /* @__PURE__ */ Y(), r = /* @__PURE__ */ Me(), i = /* @__PURE__ */ be(), p = /* @__PURE__ */ He();
-  return Ne = (f, s, t, e) => {
+  if (Or) return Te;
+  Or = 1;
+  const a = br(), u = Mr(), i = Y(), r = Ye(), n = Be(), p = We();
+  return Te = (f, s, t, e) => {
     switch (s) {
       case "===":
         return typeof f == "object" && (f = f.version), typeof t == "object" && (t = t.version), f === t;
@@ -443,26 +443,26 @@ function Hr() {
       case "==":
         return a(f, t, e);
       case "!=":
-        return l(f, t, e);
+        return u(f, t, e);
       case ">":
-        return n(f, t, e);
+        return i(f, t, e);
       case ">=":
         return r(f, t, e);
       case "<":
-        return i(f, t, e);
+        return n(f, t, e);
       case "<=":
         return p(f, t, e);
       default:
         throw new TypeError(`Invalid operator: ${s}`);
     }
-  }, Ne;
+  }, Te;
 }
-var Se, Or;
+var ge, Sr;
 function st() {
-  if (Or) return Se;
-  Or = 1;
-  const a = /* @__PURE__ */ _(), l = /* @__PURE__ */ V(), { safeRe: n, t: r } = /* @__PURE__ */ b();
-  return Se = (p, c) => {
+  if (Sr) return ge;
+  Sr = 1;
+  const a = j(), u = V(), { safeRe: i, t: r } = M();
+  return ge = (p, c) => {
     if (p instanceof a)
       return p;
     if (typeof p == "number" && (p = String(p)), typeof p != "string")
@@ -470,9 +470,9 @@ function st() {
     c = c || {};
     let f = null;
     if (!c.rtl)
-      f = p.match(c.includePrerelease ? n[r.COERCEFULL] : n[r.COERCE]);
+      f = p.match(c.includePrerelease ? i[r.COERCEFULL] : i[r.COERCE]);
     else {
-      const m = c.includePrerelease ? n[r.COERCERTLFULL] : n[r.COERCERTL];
+      const m = c.includePrerelease ? i[r.COERCERTLFULL] : i[r.COERCERTL];
       let A;
       for (; (A = m.exec(p)) && (!f || f.index + f[0].length !== p.length); )
         (!f || A.index + A[0].length !== f.index + f[0].length) && (f = A), m.lastIndex = A.index + A[1].length + A[2].length;
@@ -480,48 +480,48 @@ function st() {
     }
     if (f === null)
       return null;
-    const s = f[2], t = f[3] || "0", e = f[4] || "0", o = c.includePrerelease && f[5] ? `-${f[5]}` : "", u = c.includePrerelease && f[6] ? `+${f[6]}` : "";
-    return l(`${s}.${t}.${e}${o}${u}`, c);
-  }, Se;
+    const s = f[2], t = f[3] || "0", e = f[4] || "0", o = c.includePrerelease && f[5] ? `-${f[5]}` : "", l = c.includePrerelease && f[6] ? `+${f[6]}` : "";
+    return u(`${s}.${t}.${e}${o}${l}`, c);
+  }, ge;
 }
-var Oe, Ar;
+var we, Ar;
 function nt() {
-  if (Ar) return Oe;
+  if (Ar) return we;
   Ar = 1;
   class a {
     constructor() {
       this.max = 1e3, this.map = /* @__PURE__ */ new Map();
     }
-    get(n) {
-      const r = this.map.get(n);
+    get(i) {
+      const r = this.map.get(i);
       if (r !== void 0)
-        return this.map.delete(n), this.map.set(n, r), r;
+        return this.map.delete(i), this.map.set(i, r), r;
     }
-    delete(n) {
-      return this.map.delete(n);
+    delete(i) {
+      return this.map.delete(i);
     }
-    set(n, r) {
-      if (!this.delete(n) && r !== void 0) {
+    set(i, r) {
+      if (!this.delete(i) && r !== void 0) {
         if (this.map.size >= this.max) {
           const p = this.map.keys().next().value;
           this.delete(p);
         }
-        this.map.set(n, r);
+        this.map.set(i, r);
       }
       return this;
     }
   }
-  return Oe = a, Oe;
+  return we = a, we;
 }
-var Ae, Tr;
+var qe, Tr;
 function X() {
-  if (Tr) return Ae;
+  if (Tr) return qe;
   Tr = 1;
   const a = /\s+/g;
-  class l {
+  class u {
     constructor(h, I) {
-      if (I = i(I), h instanceof l)
-        return h.loose === !!I.loose && h.includePrerelease === !!I.includePrerelease ? h : new l(h.raw, I);
+      if (I = n(I), h instanceof u)
+        return h.loose === !!I.loose && h.includePrerelease === !!I.includePrerelease ? h : new u(h.raw, I);
       if (h instanceof p)
         return this.raw = h.value, this.set = [[h]], this.formatted = void 0, this;
       if (this.options = I, this.loose = !!I.loose, this.includePrerelease = !!I.includePrerelease, this.raw = h.trim().replace(a, " "), this.set = this.raw.split("||").map(($) => this.parseRange($.trim())).filter(($) => $.length), !this.set.length)
@@ -532,7 +532,7 @@ function X() {
           this.set = [$];
         else if (this.set.length > 1) {
           for (const v of this.set)
-            if (v.length === 1 && O(v[0])) {
+            if (v.length === 1 && S(v[0])) {
               this.set = [v];
               break;
             }
@@ -563,21 +563,21 @@ function X() {
       if (v)
         return v;
       const d = this.options.loose, L = d ? s[t.HYPHENRANGELOOSE] : s[t.HYPHENRANGE];
-      h = h.replace(L, We(this.options.includePrerelease)), c("hyphen replace", h), h = h.replace(s[t.COMPARATORTRIM], e), c("comparator trim", h), h = h.replace(s[t.TILDETRIM], o), c("tilde trim", h), h = h.replace(s[t.CARETTRIM], u), c("caret trim", h);
-      let T = h.split(" ").map((P) => y(P, this.options)).join(" ").split(/\s+/).map((P) => Ye(P, this.options));
+      h = h.replace(L, J(this.options.includePrerelease)), c("hyphen replace", h), h = h.replace(s[t.COMPARATORTRIM], e), c("comparator trim", h), h = h.replace(s[t.TILDETRIM], o), c("tilde trim", h), h = h.replace(s[t.CARETTRIM], l), c("caret trim", h);
+      let T = h.split(" ").map((P) => G(P, this.options)).join(" ").split(/\s+/).map((P) => Z(P, this.options));
       d && (T = T.filter((P) => (c("loose invalid filter", P, this.options), !!P.match(s[t.COMPARATORLOOSE])))), c("range list", T);
-      const S = /* @__PURE__ */ new Map(), q = T.map((P) => new p(P, this.options));
+      const O = /* @__PURE__ */ new Map(), q = T.map((P) => new p(P, this.options));
       for (const P of q) {
         if (E(P))
           return [P];
-        S.set(P.value, P);
+        O.set(P.value, P);
       }
-      S.size > 1 && S.has("") && S.delete("");
-      const j = [...S.values()];
-      return r.set($, j), j;
+      O.size > 1 && O.has("") && O.delete("");
+      const _ = [...O.values()];
+      return r.set($, _), _;
     }
     intersects(h, I) {
-      if (!(h instanceof l))
+      if (!(h instanceof u))
         throw new TypeError("a Range is required");
       return this.set.some(($) => g($, I) && h.set.some((v) => g(v, I) && $.every((d) => v.every((L) => d.intersects(L, I)))));
     }
@@ -592,49 +592,49 @@ function X() {
           return !1;
         }
       for (let I = 0; I < this.set.length; I++)
-        if (ze(this.set[I], h, this.options))
+        if (Q(this.set[I], h, this.options))
           return !0;
       return !1;
     }
   }
-  Ae = l;
-  const n = /* @__PURE__ */ nt(), r = new n(), i = /* @__PURE__ */ Ve(), p = /* @__PURE__ */ W(), c = /* @__PURE__ */ B(), f = /* @__PURE__ */ _(), {
+  qe = u;
+  const i = nt(), r = new i(), n = He(), p = W(), c = B(), f = j(), {
     safeRe: s,
     t,
     comparatorTrimReplace: e,
     tildeTrimReplace: o,
-    caretTrimReplace: u
-  } = /* @__PURE__ */ b(), { FLAG_INCLUDE_PRERELEASE: m, FLAG_LOOSE: A } = /* @__PURE__ */ k(), E = (R) => R.value === "<0.0.0-0", O = (R) => R.value === "", g = (R, h) => {
+    caretTrimReplace: l
+  } = M(), { FLAG_INCLUDE_PRERELEASE: m, FLAG_LOOSE: A } = k(), E = (R) => R.value === "<0.0.0-0", S = (R) => R.value === "", g = (R, h) => {
     let I = !0;
     const $ = R.slice();
     let v = $.pop();
     for (; I && $.length; )
       I = $.every((d) => v.intersects(d, h)), v = $.pop();
     return I;
-  }, y = (R, h) => (c("comp", R, h), R = C(R, h), c("caret", R), R = G(R, h), c("tildes", R), R = N(R, h), c("xrange", R), R = Be(R, h), c("stars", R), R), w = (R) => !R || R.toLowerCase() === "x" || R === "*", G = (R, h) => R.trim().split(/\s+/).map((I) => F(I, h)).join(" "), F = (R, h) => {
+  }, G = (R, h) => (c("comp", R, h), R = C(R, h), c("caret", R), R = y(R, h), c("tildes", R), R = N(R, h), c("xrange", R), R = K(R, h), c("stars", R), R), w = (R) => !R || R.toLowerCase() === "x" || R === "*", y = (R, h) => R.trim().split(/\s+/).map((I) => F(I, h)).join(" "), F = (R, h) => {
     const I = h.loose ? s[t.TILDELOOSE] : s[t.TILDE];
     return R.replace(I, ($, v, d, L, T) => {
       c("tilde", R, $, v, d, L, T);
-      let S;
-      return w(v) ? S = "" : w(d) ? S = `>=${v}.0.0 <${+v + 1}.0.0-0` : w(L) ? S = `>=${v}.${d}.0 <${v}.${+d + 1}.0-0` : T ? (c("replaceTilde pr", T), S = `>=${v}.${d}.${L}-${T} <${v}.${+d + 1}.0-0`) : S = `>=${v}.${d}.${L} <${v}.${+d + 1}.0-0`, c("tilde return", S), S;
+      let O;
+      return w(v) ? O = "" : w(d) ? O = `>=${v}.0.0 <${+v + 1}.0.0-0` : w(L) ? O = `>=${v}.${d}.0 <${v}.${+d + 1}.0-0` : T ? (c("replaceTilde pr", T), O = `>=${v}.${d}.${L}-${T} <${v}.${+d + 1}.0-0`) : O = `>=${v}.${d}.${L} <${v}.${+d + 1}.0-0`, c("tilde return", O), O;
     });
   }, C = (R, h) => R.trim().split(/\s+/).map((I) => D(I, h)).join(" "), D = (R, h) => {
     c("caret", R, h);
     const I = h.loose ? s[t.CARETLOOSE] : s[t.CARET], $ = h.includePrerelease ? "-0" : "";
-    return R.replace(I, (v, d, L, T, S) => {
-      c("caret", R, v, d, L, T, S);
+    return R.replace(I, (v, d, L, T, O) => {
+      c("caret", R, v, d, L, T, O);
       let q;
-      return w(d) ? q = "" : w(L) ? q = `>=${d}.0.0${$} <${+d + 1}.0.0-0` : w(T) ? d === "0" ? q = `>=${d}.${L}.0${$} <${d}.${+L + 1}.0-0` : q = `>=${d}.${L}.0${$} <${+d + 1}.0.0-0` : S ? (c("replaceCaret pr", S), d === "0" ? L === "0" ? q = `>=${d}.${L}.${T}-${S} <${d}.${L}.${+T + 1}-0` : q = `>=${d}.${L}.${T}-${S} <${d}.${+L + 1}.0-0` : q = `>=${d}.${L}.${T}-${S} <${+d + 1}.0.0-0`) : (c("no pr"), d === "0" ? L === "0" ? q = `>=${d}.${L}.${T}${$} <${d}.${L}.${+T + 1}-0` : q = `>=${d}.${L}.${T}${$} <${d}.${+L + 1}.0-0` : q = `>=${d}.${L}.${T} <${+d + 1}.0.0-0`), c("caret return", q), q;
+      return w(d) ? q = "" : w(L) ? q = `>=${d}.0.0${$} <${+d + 1}.0.0-0` : w(T) ? d === "0" ? q = `>=${d}.${L}.0${$} <${d}.${+L + 1}.0-0` : q = `>=${d}.${L}.0${$} <${+d + 1}.0.0-0` : O ? (c("replaceCaret pr", O), d === "0" ? L === "0" ? q = `>=${d}.${L}.${T}-${O} <${d}.${L}.${+T + 1}-0` : q = `>=${d}.${L}.${T}-${O} <${d}.${+L + 1}.0-0` : q = `>=${d}.${L}.${T}-${O} <${+d + 1}.0.0-0`) : (c("no pr"), d === "0" ? L === "0" ? q = `>=${d}.${L}.${T}${$} <${d}.${L}.${+T + 1}-0` : q = `>=${d}.${L}.${T}${$} <${d}.${+L + 1}.0-0` : q = `>=${d}.${L}.${T} <${+d + 1}.0.0-0`), c("caret return", q), q;
     });
-  }, N = (R, h) => (c("replaceXRanges", R, h), R.split(/\s+/).map((I) => M(I, h)).join(" ")), M = (R, h) => {
+  }, N = (R, h) => (c("replaceXRanges", R, h), R.split(/\s+/).map((I) => x(I, h)).join(" ")), x = (R, h) => {
     R = R.trim();
     const I = h.loose ? s[t.XRANGELOOSE] : s[t.XRANGE];
-    return R.replace(I, ($, v, d, L, T, S) => {
-      c("xRange", R, $, v, d, L, T, S);
-      const q = w(d), j = q || w(L), P = j || w(T), x = P;
-      return v === "=" && x && (v = ""), S = h.includePrerelease ? "-0" : "", q ? v === ">" || v === "<" ? $ = "<0.0.0-0" : $ = "*" : v && x ? (j && (L = 0), T = 0, v === ">" ? (v = ">=", j ? (d = +d + 1, L = 0, T = 0) : (L = +L + 1, T = 0)) : v === "<=" && (v = "<", j ? d = +d + 1 : L = +L + 1), v === "<" && (S = "-0"), $ = `${v + d}.${L}.${T}${S}`) : j ? $ = `>=${d}.0.0${S} <${+d + 1}.0.0-0` : P && ($ = `>=${d}.${L}.0${S} <${d}.${+L + 1}.0-0`), c("xRange return", $), $;
+    return R.replace(I, ($, v, d, L, T, O) => {
+      c("xRange", R, $, v, d, L, T, O);
+      const q = w(d), _ = q || w(L), P = _ || w(T), b = P;
+      return v === "=" && b && (v = ""), O = h.includePrerelease ? "-0" : "", q ? v === ">" || v === "<" ? $ = "<0.0.0-0" : $ = "*" : v && b ? (_ && (L = 0), T = 0, v === ">" ? (v = ">=", _ ? (d = +d + 1, L = 0, T = 0) : (L = +L + 1, T = 0)) : v === "<=" && (v = "<", _ ? d = +d + 1 : L = +L + 1), v === "<" && (O = "-0"), $ = `${v + d}.${L}.${T}${O}`) : _ ? $ = `>=${d}.0.0${O} <${+d + 1}.0.0-0` : P && ($ = `>=${d}.${L}.0${O} <${d}.${+L + 1}.0-0`), c("xRange return", $), $;
     });
-  }, Be = (R, h) => (c("replaceStars", R, h), R.trim().replace(s[t.STAR], "")), Ye = (R, h) => (c("replaceGTE0", R, h), R.trim().replace(s[h.includePrerelease ? t.GTE0PRE : t.GTE0], "")), We = (R) => (h, I, $, v, d, L, T, S, q, j, P, x) => (w($) ? I = "" : w(v) ? I = `>=${$}.0.0${R ? "-0" : ""}` : w(d) ? I = `>=${$}.${v}.0${R ? "-0" : ""}` : L ? I = `>=${I}` : I = `>=${I}${R ? "-0" : ""}`, w(q) ? S = "" : w(j) ? S = `<${+q + 1}.0.0-0` : w(P) ? S = `<${q}.${+j + 1}.0-0` : x ? S = `<=${q}.${j}.${P}-${x}` : R ? S = `<${q}.${j}.${+P + 1}-0` : S = `<=${S}`, `${I} ${S}`.trim()), ze = (R, h, I) => {
+  }, K = (R, h) => (c("replaceStars", R, h), R.trim().replace(s[t.STAR], "")), Z = (R, h) => (c("replaceGTE0", R, h), R.trim().replace(s[h.includePrerelease ? t.GTE0PRE : t.GTE0], "")), J = (R) => (h, I, $, v, d, L, T, O, q, _, P, b) => (w($) ? I = "" : w(v) ? I = `>=${$}.0.0${R ? "-0" : ""}` : w(d) ? I = `>=${$}.${v}.0${R ? "-0" : ""}` : L ? I = `>=${I}` : I = `>=${I}${R ? "-0" : ""}`, w(q) ? O = "" : w(_) ? O = `<${+q + 1}.0.0-0` : w(P) ? O = `<${q}.${+_ + 1}.0-0` : b ? O = `<=${q}.${_}.${P}-${b}` : R ? O = `<${q}.${_}.${+P + 1}-0` : O = `<=${O}`, `${I} ${O}`.trim()), Q = (R, h, I) => {
     for (let $ = 0; $ < R.length; $++)
       if (!R[$].test(h))
         return !1;
@@ -649,19 +649,19 @@ function X() {
     }
     return !0;
   };
-  return Ae;
+  return qe;
 }
-var Te, gr;
+var Ce, gr;
 function W() {
-  if (gr) return Te;
+  if (gr) return Ce;
   gr = 1;
   const a = Symbol("SemVer ANY");
-  class l {
+  class u {
     static get ANY() {
       return a;
     }
     constructor(e, o) {
-      if (o = n(o), e instanceof l) {
+      if (o = i(o), e instanceof u) {
         if (e.loose === !!o.loose)
           return e;
         e = e.value;
@@ -669,10 +669,10 @@ function W() {
       e = e.trim().split(/\s+/).join(" "), c("comparator", e, o), this.options = o, this.loose = !!o.loose, this.parse(e), this.semver === a ? this.value = "" : this.value = this.operator + this.semver.version, c("comp", this);
     }
     parse(e) {
-      const o = this.options.loose ? r[i.COMPARATORLOOSE] : r[i.COMPARATOR], u = e.match(o);
-      if (!u)
+      const o = this.options.loose ? r[n.COMPARATORLOOSE] : r[n.COMPARATOR], l = e.match(o);
+      if (!l)
         throw new TypeError(`Invalid comparator: ${e}`);
-      this.operator = u[1] !== void 0 ? u[1] : "", this.operator === "=" && (this.operator = ""), u[2] ? this.semver = new f(u[2], this.options.loose) : this.semver = a;
+      this.operator = l[1] !== void 0 ? l[1] : "", this.operator === "=" && (this.operator = ""), l[2] ? this.semver = new f(l[2], this.options.loose) : this.semver = a;
     }
     toString() {
       return this.value;
@@ -689,83 +689,83 @@ function W() {
       return p(e, this.operator, this.semver, this.options);
     }
     intersects(e, o) {
-      if (!(e instanceof l))
+      if (!(e instanceof u))
         throw new TypeError("a Comparator is required");
-      return this.operator === "" ? this.value === "" ? !0 : new s(e.value, o).test(this.value) : e.operator === "" ? e.value === "" ? !0 : new s(this.value, o).test(e.semver) : (o = n(o), o.includePrerelease && (this.value === "<0.0.0-0" || e.value === "<0.0.0-0") || !o.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("=") || p(this.semver, "<", e.semver, o) && this.operator.startsWith(">") && e.operator.startsWith("<") || p(this.semver, ">", e.semver, o) && this.operator.startsWith("<") && e.operator.startsWith(">")));
+      return this.operator === "" ? this.value === "" ? !0 : new s(e.value, o).test(this.value) : e.operator === "" ? e.value === "" ? !0 : new s(this.value, o).test(e.semver) : (o = i(o), o.includePrerelease && (this.value === "<0.0.0-0" || e.value === "<0.0.0-0") || !o.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("=") || p(this.semver, "<", e.semver, o) && this.operator.startsWith(">") && e.operator.startsWith("<") || p(this.semver, ">", e.semver, o) && this.operator.startsWith("<") && e.operator.startsWith(">")));
     }
   }
-  Te = l;
-  const n = /* @__PURE__ */ Ve(), { safeRe: r, t: i } = /* @__PURE__ */ b(), p = /* @__PURE__ */ Hr(), c = /* @__PURE__ */ B(), f = /* @__PURE__ */ _(), s = /* @__PURE__ */ X();
-  return Te;
+  Ce = u;
+  const i = He(), { safeRe: r, t: n } = M(), p = Hr(), c = B(), f = j(), s = X();
+  return Ce;
 }
-var ge, wr;
+var Pe, wr;
 function z() {
-  if (wr) return ge;
+  if (wr) return Pe;
   wr = 1;
-  const a = /* @__PURE__ */ X();
-  return ge = (n, r, i) => {
+  const a = X();
+  return Pe = (i, r, n) => {
     try {
-      r = new a(r, i);
+      r = new a(r, n);
     } catch {
       return !1;
     }
-    return r.test(n);
-  }, ge;
+    return r.test(i);
+  }, Pe;
 }
-var we, qr;
+var De, qr;
 function it() {
-  if (qr) return we;
+  if (qr) return De;
   qr = 1;
-  const a = /* @__PURE__ */ X();
-  return we = (n, r) => new a(n, r).set.map((i) => i.map((p) => p.value).join(" ").trim().split(" ")), we;
+  const a = X();
+  return De = (i, r) => new a(i, r).set.map((n) => n.map((p) => p.value).join(" ").trim().split(" ")), De;
 }
-var qe, Cr;
+var Ge, Cr;
 function at() {
-  if (Cr) return qe;
+  if (Cr) return Ge;
   Cr = 1;
-  const a = /* @__PURE__ */ _(), l = /* @__PURE__ */ X();
-  return qe = (r, i, p) => {
+  const a = j(), u = X();
+  return Ge = (r, n, p) => {
     let c = null, f = null, s = null;
     try {
-      s = new l(i, p);
+      s = new u(n, p);
     } catch {
       return null;
     }
     return r.forEach((t) => {
       s.test(t) && (!c || f.compare(t) === -1) && (c = t, f = new a(c, p));
     }), c;
-  }, qe;
+  }, Ge;
 }
-var Ce, Pr;
+var ye, Pr;
 function ot() {
-  if (Pr) return Ce;
+  if (Pr) return ye;
   Pr = 1;
-  const a = /* @__PURE__ */ _(), l = /* @__PURE__ */ X();
-  return Ce = (r, i, p) => {
+  const a = j(), u = X();
+  return ye = (r, n, p) => {
     let c = null, f = null, s = null;
     try {
-      s = new l(i, p);
+      s = new u(n, p);
     } catch {
       return null;
     }
     return r.forEach((t) => {
       s.test(t) && (!c || f.compare(t) === 1) && (c = t, f = new a(c, p));
     }), c;
-  }, Ce;
+  }, ye;
 }
-var Pe, Dr;
+var _e, Dr;
 function ct() {
-  if (Dr) return Pe;
+  if (Dr) return _e;
   Dr = 1;
-  const a = /* @__PURE__ */ _(), l = /* @__PURE__ */ X(), n = /* @__PURE__ */ Y();
-  return Pe = (i, p) => {
-    i = new l(i, p);
+  const a = j(), u = X(), i = Y();
+  return _e = (n, p) => {
+    n = new u(n, p);
     let c = new a("0.0.0");
-    if (i.test(c) || (c = new a("0.0.0-0"), i.test(c)))
+    if (n.test(c) || (c = new a("0.0.0-0"), n.test(c)))
       return c;
     c = null;
-    for (let f = 0; f < i.set.length; ++f) {
-      const s = i.set[f];
+    for (let f = 0; f < n.set.length; ++f) {
+      const s = n.set[f];
       let t = null;
       s.forEach((e) => {
         const o = new a(e.semver.version);
@@ -775,7 +775,7 @@ function ct() {
           /* fallthrough */
           case "":
           case ">=":
-            (!t || n(o, t)) && (t = o);
+            (!t || i(o, t)) && (t = o);
             break;
           case "<":
           case "<=":
@@ -784,109 +784,109 @@ function ct() {
           default:
             throw new Error(`Unexpected operation: ${e.operator}`);
         }
-      }), t && (!c || n(c, t)) && (c = t);
+      }), t && (!c || i(c, t)) && (c = t);
     }
-    return c && i.test(c) ? c : null;
-  }, Pe;
+    return c && n.test(c) ? c : null;
+  }, _e;
 }
-var De, yr;
-function lt() {
-  if (yr) return De;
-  yr = 1;
-  const a = /* @__PURE__ */ X();
-  return De = (n, r) => {
+var je, Gr;
+function ut() {
+  if (Gr) return je;
+  Gr = 1;
+  const a = X();
+  return je = (i, r) => {
     try {
-      return new a(n, r).range || "*";
+      return new a(i, r).range || "*";
     } catch {
       return null;
     }
-  }, De;
+  }, je;
 }
-var ye, Gr;
-function ke() {
-  if (Gr) return ye;
-  Gr = 1;
-  const a = /* @__PURE__ */ _(), l = /* @__PURE__ */ W(), { ANY: n } = l, r = /* @__PURE__ */ X(), i = /* @__PURE__ */ z(), p = /* @__PURE__ */ Y(), c = /* @__PURE__ */ be(), f = /* @__PURE__ */ He(), s = /* @__PURE__ */ Me();
-  return ye = (e, o, u, m) => {
+var Fe, yr;
+function ze() {
+  if (yr) return Fe;
+  yr = 1;
+  const a = j(), u = W(), { ANY: i } = u, r = X(), n = z(), p = Y(), c = Be(), f = We(), s = Ye();
+  return Fe = (e, o, l, m) => {
     e = new a(e, m), o = new r(o, m);
-    let A, E, O, g, y;
-    switch (u) {
+    let A, E, S, g, G;
+    switch (l) {
       case ">":
-        A = p, E = f, O = c, g = ">", y = ">=";
+        A = p, E = f, S = c, g = ">", G = ">=";
         break;
       case "<":
-        A = c, E = s, O = p, g = "<", y = "<=";
+        A = c, E = s, S = p, g = "<", G = "<=";
         break;
       default:
         throw new TypeError('Must provide a hilo val of "<" or ">"');
     }
-    if (i(e, o, m))
+    if (n(e, o, m))
       return !1;
     for (let w = 0; w < o.set.length; ++w) {
-      const G = o.set[w];
+      const y = o.set[w];
       let F = null, C = null;
-      if (G.forEach((D) => {
-        D.semver === n && (D = new l(">=0.0.0")), F = F || D, C = C || D, A(D.semver, F.semver, m) ? F = D : O(D.semver, C.semver, m) && (C = D);
-      }), F.operator === g || F.operator === y || (!C.operator || C.operator === g) && E(e, C.semver))
+      if (y.forEach((D) => {
+        D.semver === i && (D = new u(">=0.0.0")), F = F || D, C = C || D, A(D.semver, F.semver, m) ? F = D : S(D.semver, C.semver, m) && (C = D);
+      }), F.operator === g || F.operator === G || (!C.operator || C.operator === g) && E(e, C.semver))
         return !1;
-      if (C.operator === y && O(e, C.semver))
+      if (C.operator === G && S(e, C.semver))
         return !1;
     }
     return !0;
-  }, ye;
+  }, Fe;
 }
-var Ge, _r;
-function ut() {
-  if (_r) return Ge;
+var Ue, _r;
+function lt() {
+  if (_r) return Ue;
   _r = 1;
-  const a = /* @__PURE__ */ ke();
-  return Ge = (n, r, i) => a(n, r, ">", i), Ge;
+  const a = ze();
+  return Ue = (i, r, n) => a(i, r, ">", n), Ue;
 }
-var _e, jr;
+var Xe, jr;
 function ft() {
-  if (jr) return _e;
+  if (jr) return Xe;
   jr = 1;
-  const a = /* @__PURE__ */ ke();
-  return _e = (n, r, i) => a(n, r, "<", i), _e;
+  const a = ze();
+  return Xe = (i, r, n) => a(i, r, "<", n), Xe;
 }
-var je, Fr;
+var Ve, Fr;
 function ht() {
-  if (Fr) return je;
+  if (Fr) return Ve;
   Fr = 1;
-  const a = /* @__PURE__ */ X();
-  return je = (n, r, i) => (n = new a(n, i), r = new a(r, i), n.intersects(r, i)), je;
+  const a = X();
+  return Ve = (i, r, n) => (i = new a(i, n), r = new a(r, n), i.intersects(r, n)), Ve;
 }
-var Fe, Ur;
+var xe, Ur;
 function Et() {
-  if (Ur) return Fe;
+  if (Ur) return xe;
   Ur = 1;
-  const a = /* @__PURE__ */ z(), l = /* @__PURE__ */ U();
-  return Fe = (n, r, i) => {
+  const a = z(), u = U();
+  return xe = (i, r, n) => {
     const p = [];
     let c = null, f = null;
-    const s = n.sort((u, m) => l(u, m, i));
-    for (const u of s)
-      a(u, r, i) ? (f = u, c || (c = u)) : (f && p.push([c, f]), f = null, c = null);
+    const s = i.sort((l, m) => u(l, m, n));
+    for (const l of s)
+      a(l, r, n) ? (f = l, c || (c = l)) : (f && p.push([c, f]), f = null, c = null);
     c && p.push([c, null]);
     const t = [];
-    for (const [u, m] of p)
-      u === m ? t.push(u) : !m && u === s[0] ? t.push("*") : m ? u === s[0] ? t.push(`<=${m}`) : t.push(`${u} - ${m}`) : t.push(`>=${u}`);
+    for (const [l, m] of p)
+      l === m ? t.push(l) : !m && l === s[0] ? t.push("*") : m ? l === s[0] ? t.push(`<=${m}`) : t.push(`${l} - ${m}`) : t.push(`>=${l}`);
     const e = t.join(" || "), o = typeof r.raw == "string" ? r.raw : String(r);
     return e.length < o.length ? e : r;
-  }, Fe;
+  }, xe;
 }
-var Ue, Xr;
+var be, Xr;
 function pt() {
-  if (Xr) return Ue;
+  if (Xr) return be;
   Xr = 1;
-  const a = /* @__PURE__ */ X(), l = /* @__PURE__ */ W(), { ANY: n } = l, r = /* @__PURE__ */ z(), i = /* @__PURE__ */ U(), p = (o, u, m = {}) => {
-    if (o === u)
+  const a = X(), u = W(), { ANY: i } = u, r = z(), n = U(), p = (o, l, m = {}) => {
+    if (o === l)
       return !0;
-    o = new a(o, m), u = new a(u, m);
+    o = new a(o, m), l = new a(l, m);
     let A = !1;
     e: for (const E of o.set) {
-      for (const O of u.set) {
-        const g = s(E, O, m);
+      for (const S of l.set) {
+        const g = s(E, S, m);
         if (A = A || g !== null, g)
           continue e;
       }
@@ -894,128 +894,128 @@ function pt() {
         return !1;
     }
     return !0;
-  }, c = [new l(">=0.0.0-0")], f = [new l(">=0.0.0")], s = (o, u, m) => {
-    if (o === u)
+  }, c = [new u(">=0.0.0-0")], f = [new u(">=0.0.0")], s = (o, l, m) => {
+    if (o === l)
       return !0;
-    if (o.length === 1 && o[0].semver === n) {
-      if (u.length === 1 && u[0].semver === n)
+    if (o.length === 1 && o[0].semver === i) {
+      if (l.length === 1 && l[0].semver === i)
         return !0;
       m.includePrerelease ? o = c : o = f;
     }
-    if (u.length === 1 && u[0].semver === n) {
+    if (l.length === 1 && l[0].semver === i) {
       if (m.includePrerelease)
         return !0;
-      u = f;
+      l = f;
     }
     const A = /* @__PURE__ */ new Set();
-    let E, O;
+    let E, S;
     for (const N of o)
-      N.operator === ">" || N.operator === ">=" ? E = t(E, N, m) : N.operator === "<" || N.operator === "<=" ? O = e(O, N, m) : A.add(N.semver);
+      N.operator === ">" || N.operator === ">=" ? E = t(E, N, m) : N.operator === "<" || N.operator === "<=" ? S = e(S, N, m) : A.add(N.semver);
     if (A.size > 1)
       return null;
     let g;
-    if (E && O) {
-      if (g = i(E.semver, O.semver, m), g > 0)
+    if (E && S) {
+      if (g = n(E.semver, S.semver, m), g > 0)
         return null;
-      if (g === 0 && (E.operator !== ">=" || O.operator !== "<="))
+      if (g === 0 && (E.operator !== ">=" || S.operator !== "<="))
         return null;
     }
     for (const N of A) {
-      if (E && !r(N, String(E), m) || O && !r(N, String(O), m))
+      if (E && !r(N, String(E), m) || S && !r(N, String(S), m))
         return null;
-      for (const M of u)
-        if (!r(N, String(M), m))
+      for (const x of l)
+        if (!r(N, String(x), m))
           return !1;
       return !0;
     }
-    let y, w, G, F, C = O && !m.includePrerelease && O.semver.prerelease.length ? O.semver : !1, D = E && !m.includePrerelease && E.semver.prerelease.length ? E.semver : !1;
-    C && C.prerelease.length === 1 && O.operator === "<" && C.prerelease[0] === 0 && (C = !1);
-    for (const N of u) {
-      if (F = F || N.operator === ">" || N.operator === ">=", G = G || N.operator === "<" || N.operator === "<=", E) {
+    let G, w, y, F, C = S && !m.includePrerelease && S.semver.prerelease.length ? S.semver : !1, D = E && !m.includePrerelease && E.semver.prerelease.length ? E.semver : !1;
+    C && C.prerelease.length === 1 && S.operator === "<" && C.prerelease[0] === 0 && (C = !1);
+    for (const N of l) {
+      if (F = F || N.operator === ">" || N.operator === ">=", y = y || N.operator === "<" || N.operator === "<=", E) {
         if (D && N.semver.prerelease && N.semver.prerelease.length && N.semver.major === D.major && N.semver.minor === D.minor && N.semver.patch === D.patch && (D = !1), N.operator === ">" || N.operator === ">=") {
-          if (y = t(E, N, m), y === N && y !== E)
+          if (G = t(E, N, m), G === N && G !== E)
             return !1;
         } else if (E.operator === ">=" && !r(E.semver, String(N), m))
           return !1;
       }
-      if (O) {
+      if (S) {
         if (C && N.semver.prerelease && N.semver.prerelease.length && N.semver.major === C.major && N.semver.minor === C.minor && N.semver.patch === C.patch && (C = !1), N.operator === "<" || N.operator === "<=") {
-          if (w = e(O, N, m), w === N && w !== O)
+          if (w = e(S, N, m), w === N && w !== S)
             return !1;
-        } else if (O.operator === "<=" && !r(O.semver, String(N), m))
+        } else if (S.operator === "<=" && !r(S.semver, String(N), m))
           return !1;
       }
-      if (!N.operator && (O || E) && g !== 0)
+      if (!N.operator && (S || E) && g !== 0)
         return !1;
     }
-    return !(E && G && !O && g !== 0 || O && F && !E && g !== 0 || D || C);
-  }, t = (o, u, m) => {
+    return !(E && y && !S && g !== 0 || S && F && !E && g !== 0 || D || C);
+  }, t = (o, l, m) => {
     if (!o)
-      return u;
-    const A = i(o.semver, u.semver, m);
-    return A > 0 ? o : A < 0 || u.operator === ">" && o.operator === ">=" ? u : o;
-  }, e = (o, u, m) => {
+      return l;
+    const A = n(o.semver, l.semver, m);
+    return A > 0 ? o : A < 0 || l.operator === ">" && o.operator === ">=" ? l : o;
+  }, e = (o, l, m) => {
     if (!o)
-      return u;
-    const A = i(o.semver, u.semver, m);
-    return A < 0 ? o : A > 0 || u.operator === "<" && o.operator === "<=" ? u : o;
+      return l;
+    const A = n(o.semver, l.semver, m);
+    return A < 0 ? o : A > 0 || l.operator === "<" && o.operator === "<=" ? l : o;
   };
-  return Ue = p, Ue;
+  return be = p, be;
 }
-var Xe, Vr;
+var Me, Vr;
 function Rt() {
-  if (Vr) return Xe;
+  if (Vr) return Me;
   Vr = 1;
-  const a = /* @__PURE__ */ b(), l = /* @__PURE__ */ k(), n = /* @__PURE__ */ _(), r = /* @__PURE__ */ xr();
-  return Xe = {
-    parse: /* @__PURE__ */ V(),
-    valid: /* @__PURE__ */ kr(),
-    clean: /* @__PURE__ */ Br(),
-    inc: /* @__PURE__ */ Yr(),
-    diff: /* @__PURE__ */ Wr(),
-    major: /* @__PURE__ */ zr(),
-    minor: /* @__PURE__ */ Kr(),
-    patch: /* @__PURE__ */ Zr(),
-    prerelease: /* @__PURE__ */ Jr(),
-    compare: /* @__PURE__ */ U(),
-    rcompare: /* @__PURE__ */ Qr(),
-    compareLoose: /* @__PURE__ */ et(),
-    compareBuild: /* @__PURE__ */ xe(),
-    sort: /* @__PURE__ */ rt(),
-    rsort: /* @__PURE__ */ tt(),
-    gt: /* @__PURE__ */ Y(),
-    lt: /* @__PURE__ */ be(),
-    eq: /* @__PURE__ */ br(),
-    neq: /* @__PURE__ */ Mr(),
-    gte: /* @__PURE__ */ Me(),
-    lte: /* @__PURE__ */ He(),
-    cmp: /* @__PURE__ */ Hr(),
-    coerce: /* @__PURE__ */ st(),
-    Comparator: /* @__PURE__ */ W(),
-    Range: /* @__PURE__ */ X(),
-    satisfies: /* @__PURE__ */ z(),
-    toComparators: /* @__PURE__ */ it(),
-    maxSatisfying: /* @__PURE__ */ at(),
-    minSatisfying: /* @__PURE__ */ ot(),
-    minVersion: /* @__PURE__ */ ct(),
-    validRange: /* @__PURE__ */ lt(),
-    outside: /* @__PURE__ */ ke(),
-    gtr: /* @__PURE__ */ ut(),
-    ltr: /* @__PURE__ */ ft(),
-    intersects: /* @__PURE__ */ ht(),
-    simplifyRange: /* @__PURE__ */ Et(),
-    subset: /* @__PURE__ */ pt(),
-    SemVer: n,
+  const a = M(), u = k(), i = j(), r = xr(), n = V(), p = kr(), c = Br(), f = Yr(), s = Wr(), t = zr(), e = Kr(), o = Zr(), l = Jr(), m = U(), A = Qr(), E = et(), S = ke(), g = rt(), G = tt(), w = Y(), y = Be(), F = br(), C = Mr(), D = Ye(), N = We(), x = Hr(), K = st(), Z = W(), J = X(), Q = z(), R = it(), h = at(), I = ot(), $ = ct(), v = ut(), d = ze(), L = lt(), T = ft(), O = ht(), q = Et(), _ = pt();
+  return Me = {
+    parse: n,
+    valid: p,
+    clean: c,
+    inc: f,
+    diff: s,
+    major: t,
+    minor: e,
+    patch: o,
+    prerelease: l,
+    compare: m,
+    rcompare: A,
+    compareLoose: E,
+    compareBuild: S,
+    sort: g,
+    rsort: G,
+    gt: w,
+    lt: y,
+    eq: F,
+    neq: C,
+    gte: D,
+    lte: N,
+    cmp: x,
+    coerce: K,
+    Comparator: Z,
+    Range: J,
+    satisfies: Q,
+    toComparators: R,
+    maxSatisfying: h,
+    minSatisfying: I,
+    minVersion: $,
+    validRange: v,
+    outside: d,
+    gtr: L,
+    ltr: T,
+    intersects: O,
+    simplifyRange: q,
+    subset: _,
+    SemVer: i,
     re: a.re,
     src: a.src,
     tokens: a.t,
-    SEMVER_SPEC_VERSION: l.SEMVER_SPEC_VERSION,
-    RELEASE_TYPES: l.RELEASE_TYPES,
+    SEMVER_SPEC_VERSION: u.SEMVER_SPEC_VERSION,
+    RELEASE_TYPES: u.RELEASE_TYPES,
     compareIdentifiers: r.compareIdentifiers,
     rcompareIdentifiers: r.rcompareIdentifiers
-  }, Xe;
+  }, Me;
 }
-var mt = /* @__PURE__ */ Rt();
+var mt = Rt();
 export {
   mt as s
 };