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