langgraph-ui-components 0.0.27 → 0.0.28

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.js"],"sourcesContent":["'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  comp = comp.replace(re[t.BUILD], '')\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n"],"names":["SPACE_CHARACTERS","Range","range","options","parseOptions","Comparator","c","first","isNullSet","isAny","i","comps","k","memoKey","FLAG_INCLUDE_PRERELEASE","FLAG_LOOSE","cached","cache","loose","hr","re","t","hyphenReplace","debug","comparatorTrimReplace","tildeTrimReplace","caretTrimReplace","rangeList","comp","parseComparator","replaceGTE0","rangeMap","comparators","result","thisComparators","isSatisfiable","rangeComparators","thisComparator","rangeComparator","version","SemVer","testSet","LRU","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","remainingComparators","testComparator","otherComparator","replaceCarets","replaceTildes","replaceXRanges","replaceStars","isX","id","replaceTilde","r","_","M","m","p","pr","ret","replaceCaret","z","replaceXRange","gtlt","xM","xm","xp","anyX","incPr","$0","from","fM","fm","fp","fpr","fb","to","tM","tm","tp","tpr","set","allowed"],"mappings":"qYAEA,MAAMA,EAAmB,OAGzB,MAAMC,CAAM,CACV,YAAaC,EAAOC,EAAS,CAG3B,GAFAA,EAAUC,EAAaD,CAAO,EAE1BD,aAAiBD,EACnB,OACEC,EAAM,QAAU,CAAC,CAACC,EAAQ,OAC1BD,EAAM,oBAAsB,CAAC,CAACC,EAAQ,kBAE/BD,EAEA,IAAID,EAAMC,EAAM,IAAKC,CAAO,EAIvC,GAAID,aAAiBG,EAEnB,YAAK,IAAMH,EAAM,MACjB,KAAK,IAAM,CAAC,CAACA,CAAK,CAAC,EACnB,KAAK,UAAY,OACV,KAsBT,GAnBA,KAAK,QAAUC,EACf,KAAK,MAAQ,CAAC,CAACA,EAAQ,MACvB,KAAK,kBAAoB,CAAC,CAACA,EAAQ,kBAKnC,KAAK,IAAMD,EAAM,KAAI,EAAG,QAAQF,EAAkB,GAAG,EAGrD,KAAK,IAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,GAAK,KAAK,WAAW,EAAE,KAAI,CAAE,CAAC,EAIlC,OAAOM,GAAKA,EAAE,MAAM,EAEnB,CAAC,KAAK,IAAI,OACZ,MAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE,EAIzD,GAAI,KAAK,IAAI,OAAS,EAAG,CAEvB,MAAMC,EAAQ,KAAK,IAAI,CAAC,EAExB,GADA,KAAK,IAAM,KAAK,IAAI,OAAOD,GAAK,CAACE,EAAUF,EAAE,CAAC,CAAC,CAAC,EAC5C,KAAK,IAAI,SAAW,EACtB,KAAK,IAAM,CAACC,CAAK,UACR,KAAK,IAAI,OAAS,GAE3B,UAAWD,KAAK,KAAK,IACnB,GAAIA,EAAE,SAAW,GAAKG,EAAMH,EAAE,CAAC,CAAC,EAAG,CACjC,KAAK,IAAM,CAACA,CAAC,EACb,KACZ,EAGA,CAEI,KAAK,UAAY,MACrB,CAEE,IAAI,OAAS,CACX,GAAI,KAAK,YAAc,OAAW,CAChC,KAAK,UAAY,GACjB,QAASI,EAAI,EAAGA,EAAI,KAAK,IAAI,OAAQA,IAAK,CACpCA,EAAI,IACN,KAAK,WAAa,MAEpB,MAAMC,EAAQ,KAAK,IAAID,CAAC,EACxB,QAASE,EAAI,EAAGA,EAAID,EAAM,OAAQC,IAC5BA,EAAI,IACN,KAAK,WAAa,KAEpB,KAAK,WAAaD,EAAMC,CAAC,EAAE,SAAQ,EAAG,KAAI,CAEpD,CACA,CACI,OAAO,KAAK,SAChB,CAEE,QAAU,CACR,OAAO,KAAK,KAChB,CAEE,UAAY,CACV,OAAO,KAAK,KAChB,CAEE,WAAYV,EAAO,CAMjB,MAAMW,IAFH,KAAK,QAAQ,mBAAqBC,IAClC,KAAK,QAAQ,OAASC,IACE,IAAMb,EAC3Bc,EAASC,EAAM,IAAIJ,CAAO,EAChC,GAAIG,EACF,OAAOA,EAGT,MAAME,EAAQ,KAAK,QAAQ,MAErBC,EAAKD,EAAQE,EAAGC,EAAE,gBAAgB,EAAID,EAAGC,EAAE,WAAW,EAC5DnB,EAAQA,EAAM,QAAQiB,EAAIG,EAAc,KAAK,QAAQ,iBAAiB,CAAC,EACvEC,EAAM,iBAAkBrB,CAAK,EAG7BA,EAAQA,EAAM,QAAQkB,EAAGC,EAAE,cAAc,EAAGG,CAAqB,EACjED,EAAM,kBAAmBrB,CAAK,EAG9BA,EAAQA,EAAM,QAAQkB,EAAGC,EAAE,SAAS,EAAGI,CAAgB,EACvDF,EAAM,aAAcrB,CAAK,EAGzBA,EAAQA,EAAM,QAAQkB,EAAGC,EAAE,SAAS,EAAGK,CAAgB,EACvDH,EAAM,aAAcrB,CAAK,EAKzB,IAAIyB,EAAYzB,EACb,MAAM,GAAG,EACT,IAAI0B,GAAQC,EAAgBD,EAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAIA,GAAQE,EAAYF,EAAM,KAAK,OAAO,CAAC,EAE1CV,IAEFS,EAAYA,EAAU,OAAOC,IAC3BL,EAAM,uBAAwBK,EAAM,KAAK,OAAO,EACzC,CAAC,CAACA,EAAK,MAAMR,EAAGC,EAAE,eAAe,CAAC,EAC1C,GAEHE,EAAM,aAAcI,CAAS,EAK7B,MAAMI,EAAW,IAAI,IACfC,EAAcL,EAAU,IAAIC,GAAQ,IAAIvB,EAAWuB,EAAM,KAAK,OAAO,CAAC,EAC5E,UAAWA,KAAQI,EAAa,CAC9B,GAAIxB,EAAUoB,CAAI,EAChB,MAAO,CAACA,CAAI,EAEdG,EAAS,IAAIH,EAAK,MAAOA,CAAI,CACnC,CACQG,EAAS,KAAO,GAAKA,EAAS,IAAI,EAAE,GACtCA,EAAS,OAAO,EAAE,EAGpB,MAAME,EAAS,CAAC,GAAGF,EAAS,OAAM,CAAE,EACpC,OAAAd,EAAM,IAAIJ,EAASoB,CAAM,EAClBA,CACX,CAEE,WAAY/B,EAAOC,EAAS,CAC1B,GAAI,EAAED,aAAiBD,GACrB,MAAM,IAAI,UAAU,qBAAqB,EAG3C,OAAO,KAAK,IAAI,KAAMiC,GAElBC,EAAcD,EAAiB/B,CAAO,GACtCD,EAAM,IAAI,KAAMkC,GAEZD,EAAcC,EAAkBjC,CAAO,GACvC+B,EAAgB,MAAOG,GACdD,EAAiB,MAAOE,GACtBD,EAAe,WAAWC,EAAiBnC,CAAO,CAC1D,CACF,CAEJ,CAEJ,CACL,CAGE,KAAMoC,EAAS,CACb,GAAI,CAACA,EACH,MAAO,GAGT,GAAI,OAAOA,GAAY,SACrB,GAAI,CACFA,EAAU,IAAIC,EAAOD,EAAS,KAAK,OAAO,CAClD,MAAmB,CACX,MAAO,EACf,CAGI,QAAS,EAAI,EAAG,EAAI,KAAK,IAAI,OAAQ,IACnC,GAAIE,EAAQ,KAAK,IAAI,CAAC,EAAGF,EAAS,KAAK,OAAO,EAC5C,MAAO,GAGX,MAAO,EACX,CACA,CAEArC,EAAiBD,EAEjB,MAAMyC,EAAMC,EAAAA,UAAA,EACN1B,EAAQ,IAAIyB,EAEZtC,EAAewC,EAAAA,UAAA,EACfvC,EAAawC,EAAAA,UAAA,EACbtB,EAAQuB,EAAAA,UAAA,EACRN,EAASO,EAAAA,UAAA,EACT,CACJ,OAAQ3B,EACR,EAAAC,EACA,sBAAAG,EACA,iBAAAC,EACA,iBAAAC,CACF,EAAIsB,EAAAA,UAAA,EACE,CAAE,wBAAAlC,EAAyB,WAAAC,CAAU,EAAKkC,EAAAA,UAAA,EAE1CzC,EAAYF,GAAKA,EAAE,QAAU,WAC7BG,EAAQH,GAAKA,EAAE,QAAU,GAIzB6B,EAAgB,CAACH,EAAa7B,IAAY,CAC9C,IAAI8B,EAAS,GACb,MAAMiB,EAAuBlB,EAAY,MAAK,EAC9C,IAAImB,EAAiBD,EAAqB,IAAG,EAE7C,KAAOjB,GAAUiB,EAAqB,QACpCjB,EAASiB,EAAqB,MAAOE,GAC5BD,EAAe,WAAWC,EAAiBjD,CAAO,CAC1D,EAEDgD,EAAiBD,EAAqB,IAAG,EAG3C,OAAOjB,CACT,EAKMJ,EAAkB,CAACD,EAAMzB,KAC7ByB,EAAOA,EAAK,QAAQR,EAAGC,EAAE,KAAK,EAAG,EAAE,EACnCE,EAAM,OAAQK,EAAMzB,CAAO,EAC3ByB,EAAOyB,EAAczB,EAAMzB,CAAO,EAClCoB,EAAM,QAASK,CAAI,EACnBA,EAAO0B,EAAc1B,EAAMzB,CAAO,EAClCoB,EAAM,SAAUK,CAAI,EACpBA,EAAO2B,EAAe3B,EAAMzB,CAAO,EACnCoB,EAAM,SAAUK,CAAI,EACpBA,EAAO4B,EAAa5B,EAAMzB,CAAO,EACjCoB,EAAM,QAASK,CAAI,EACZA,GAGH6B,EAAMC,GAAM,CAACA,GAAMA,EAAG,YAAW,IAAO,KAAOA,IAAO,IAStDJ,EAAgB,CAAC1B,EAAMzB,IACpByB,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAKtB,GAAMqD,EAAarD,EAAGH,CAAO,CAAC,EACnC,KAAK,GAAG,EAGPwD,EAAe,CAAC/B,EAAMzB,IAAY,CACtC,MAAMyD,EAAIzD,EAAQ,MAAQiB,EAAGC,EAAE,UAAU,EAAID,EAAGC,EAAE,KAAK,EACvD,OAAOO,EAAK,QAAQgC,EAAG,CAACC,EAAGC,EAAGC,EAAGC,EAAGC,IAAO,CACzC1C,EAAM,QAASK,EAAMiC,EAAGC,EAAGC,EAAGC,EAAGC,CAAE,EACnC,IAAIC,EAEJ,OAAIT,EAAIK,CAAC,EACPI,EAAM,GACGT,EAAIM,CAAC,EACdG,EAAM,KAAKJ,CAAC,SAAS,CAACA,EAAI,CAAC,SAClBL,EAAIO,CAAC,EAEdE,EAAM,KAAKJ,CAAC,IAAIC,CAAC,OAAOD,CAAC,IAAI,CAACC,EAAI,CAAC,OAC1BE,GACT1C,EAAM,kBAAmB0C,CAAE,EAC3BC,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,EAAI,CAAC,QAGhBG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,MAChBF,CAAC,IAAI,CAACC,EAAI,CAAC,OAGlBxC,EAAM,eAAgB2C,CAAG,EAClBA,CACX,CAAG,CACH,EAUMb,EAAgB,CAACzB,EAAMzB,IACpByB,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAKtB,GAAM6D,EAAa7D,EAAGH,CAAO,CAAC,EACnC,KAAK,GAAG,EAGPgE,EAAe,CAACvC,EAAMzB,IAAY,CACtCoB,EAAM,QAASK,EAAMzB,CAAO,EAC5B,MAAMyD,EAAIzD,EAAQ,MAAQiB,EAAGC,EAAE,UAAU,EAAID,EAAGC,EAAE,KAAK,EACjD+C,EAAIjE,EAAQ,kBAAoB,KAAO,GAC7C,OAAOyB,EAAK,QAAQgC,EAAG,CAACC,EAAGC,EAAGC,EAAGC,EAAGC,IAAO,CACzC1C,EAAM,QAASK,EAAMiC,EAAGC,EAAGC,EAAGC,EAAGC,CAAE,EACnC,IAAIC,EAEJ,OAAIT,EAAIK,CAAC,EACPI,EAAM,GACGT,EAAIM,CAAC,EACdG,EAAM,KAAKJ,CAAC,OAAOM,CAAC,KAAK,CAACN,EAAI,CAAC,SACtBL,EAAIO,CAAC,EACVF,IAAM,IACRI,EAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAKN,CAAC,IAAI,CAACC,EAAI,CAAC,OAEvCG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAK,CAACN,EAAI,CAAC,SAE3BG,GACT1C,EAAM,kBAAmB0C,CAAE,EACvBH,IAAM,IACJC,IAAM,IACRG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACpC,KAAeH,CAAC,IAAIC,CAAC,IAAI,CAACC,EAAI,CAAC,KAErBE,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,EAAI,CAAC,OAGlBG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAClC,KAAa,CAACH,EAAI,CAAC,WAGbvC,EAAM,OAAO,EACTuC,IAAM,IACJC,IAAM,IACRG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAIC,CAAC,IAAI,CAACC,EAAI,CAAC,KAEzBE,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAI,CAACC,EAAI,CAAC,OAGtBG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC7B,KAAa,CAACF,EAAI,CAAC,UAIfvC,EAAM,eAAgB2C,CAAG,EAClBA,CACX,CAAG,CACH,EAEMX,EAAiB,CAAC3B,EAAMzB,KAC5BoB,EAAM,iBAAkBK,EAAMzB,CAAO,EAC9ByB,EACJ,MAAM,KAAK,EACX,IAAKtB,GAAM+D,EAAc/D,EAAGH,CAAO,CAAC,EACpC,KAAK,GAAG,GAGPkE,EAAgB,CAACzC,EAAMzB,IAAY,CACvCyB,EAAOA,EAAK,KAAI,EAChB,MAAMgC,EAAIzD,EAAQ,MAAQiB,EAAGC,EAAE,WAAW,EAAID,EAAGC,EAAE,MAAM,EACzD,OAAOO,EAAK,QAAQgC,EAAG,CAACM,EAAKI,EAAMR,EAAGC,EAAGC,EAAGC,IAAO,CACjD1C,EAAM,SAAUK,EAAMsC,EAAKI,EAAMR,EAAGC,EAAGC,EAAGC,CAAE,EAC5C,MAAMM,EAAKd,EAAIK,CAAC,EACVU,EAAKD,GAAMd,EAAIM,CAAC,EAChBU,EAAKD,GAAMf,EAAIO,CAAC,EAChBU,EAAOD,EAEb,OAAIH,IAAS,KAAOI,IAClBJ,EAAO,IAKTL,EAAK9D,EAAQ,kBAAoB,KAAO,GAEpCoE,EACED,IAAS,KAAOA,IAAS,IAE3BJ,EAAM,WAGNA,EAAM,IAECI,GAAQI,GAGbF,IACFT,EAAI,GAENC,EAAI,EAEAM,IAAS,KAGXA,EAAO,KACHE,GACFV,EAAI,CAACA,EAAI,EACTC,EAAI,EACJC,EAAI,IAEJD,EAAI,CAACA,EAAI,EACTC,EAAI,IAEGM,IAAS,OAGlBA,EAAO,IACHE,EACFV,EAAI,CAACA,EAAI,EAETC,EAAI,CAACA,EAAI,GAITO,IAAS,MACXL,EAAK,MAGPC,EAAM,GAAGI,EAAOR,CAAC,IAAIC,CAAC,IAAIC,CAAC,GAAGC,CAAE,IACvBO,EACTN,EAAM,KAAKJ,CAAC,OAAOG,CAAE,KAAK,CAACH,EAAI,CAAC,SACvBW,IACTP,EAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKE,MACjBH,CAAC,IAAI,CAACC,EAAI,CAAC,QAGlBxC,EAAM,gBAAiB2C,CAAG,EAEnBA,CACX,CAAG,CACH,EAIMV,EAAe,CAAC5B,EAAMzB,KAC1BoB,EAAM,eAAgBK,EAAMzB,CAAO,EAE5ByB,EACJ,KAAI,EACJ,QAAQR,EAAGC,EAAE,IAAI,EAAG,EAAE,GAGrBS,EAAc,CAACF,EAAMzB,KACzBoB,EAAM,cAAeK,EAAMzB,CAAO,EAC3ByB,EACJ,KAAI,EACJ,QAAQR,EAAGjB,EAAQ,kBAAoBkB,EAAE,QAAUA,EAAE,IAAI,EAAG,EAAE,GAS7DC,EAAgBqD,GAAS,CAACC,EAC9BC,EAAMC,EAAIC,EAAIC,EAAIC,EAAKC,EACvBC,EAAIC,EAAIC,EAAIC,EAAIC,KACZ9B,EAAIqB,CAAE,EACRD,EAAO,GACEpB,EAAIsB,CAAE,EACfF,EAAO,KAAKC,CAAE,OAAOH,EAAQ,KAAO,EAAE,GAC7BlB,EAAIuB,CAAE,EACfH,EAAO,KAAKC,CAAE,IAAIC,CAAE,KAAKJ,EAAQ,KAAO,EAAE,GACjCM,EACTJ,EAAO,KAAKA,CAAI,GAEhBA,EAAO,KAAKA,CAAI,GAAGF,EAAQ,KAAO,EAAE,GAGlClB,EAAI2B,CAAE,EACRD,EAAK,GACI1B,EAAI4B,CAAE,EACfF,EAAK,IAAI,CAACC,EAAK,CAAC,SACP3B,EAAI6B,CAAE,EACfH,EAAK,IAAIC,CAAE,IAAI,CAACC,EAAK,CAAC,OACbE,EACTJ,EAAK,KAAKC,CAAE,IAAIC,CAAE,IAAIC,CAAE,IAAIC,CAAG,GACtBZ,EACTQ,EAAK,IAAIC,CAAE,IAAIC,CAAE,IAAI,CAACC,EAAK,CAAC,KAE5BH,EAAK,KAAKA,CAAE,GAGP,GAAGN,CAAI,IAAIM,CAAE,GAAG,KAAI,GAGvB1C,EAAU,CAAC+C,EAAKjD,EAASpC,IAAY,CACzC,QAASO,EAAI,EAAGA,EAAI8E,EAAI,OAAQ9E,IAC9B,GAAI,CAAC8E,EAAI9E,CAAC,EAAE,KAAK6B,CAAO,EACtB,MAAO,GAIX,GAAIA,EAAQ,WAAW,QAAU,CAACpC,EAAQ,kBAAmB,CAM3D,QAASO,EAAI,EAAGA,EAAI8E,EAAI,OAAQ9E,IAE9B,GADAa,EAAMiE,EAAI9E,CAAC,EAAE,MAAM,EACf8E,EAAI9E,CAAC,EAAE,SAAWL,EAAW,KAI7BmF,EAAI9E,CAAC,EAAE,OAAO,WAAW,OAAS,EAAG,CACvC,MAAM+E,EAAUD,EAAI9E,CAAC,EAAE,OACvB,GAAI+E,EAAQ,QAAUlD,EAAQ,OAC1BkD,EAAQ,QAAUlD,EAAQ,OAC1BkD,EAAQ,QAAUlD,EAAQ,MAC5B,MAAO,EAEjB,CAII,MAAO,EACX,CAEE,MAAO,EACT","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.es.js

@@ -1,149 +0,0 @@
-import { __require as F } from "../internal/lrucache.es.js";
-import { __require as V } from "../internal/parse-options.es.js";
-import { __require as B } from "./comparator.es.js";
-import { __require as K } from "../internal/debug.es.js";
-import { __require as J } from "./semver.es.js";
-import { __require as Q } from "../internal/re.es.js";
-import { __require as W } from "../internal/constants.es.js";
-var A, L;
-function le() {
-  if (L) return A;
-  L = 1;
-  const w = /\s+/g;
-  class E {
-    constructor(e, i) {
-      if (i = _(i), e instanceof E)
-        return e.loose === !!i.loose && e.includePrerelease === !!i.includePrerelease ? e : new E(e.raw, i);
-      if (e instanceof p)
-        return this.raw = e.value, this.set = [[e]], this.formatted = void 0, this;
-      if (this.options = i, this.loose = !!i.loose, this.includePrerelease = !!i.includePrerelease, this.raw = e.trim().replace(w, " "), this.set = this.raw.split("||").map((t) => this.parseRange(t.trim())).filter((t) => t.length), !this.set.length)
-        throw new TypeError(`Invalid SemVer Range: ${this.raw}`);
-      if (this.set.length > 1) {
-        const t = this.set[0];
-        if (this.set = this.set.filter((l) => !S(l[0])), this.set.length === 0)
-          this.set = [t];
-        else if (this.set.length > 1) {
-          for (const l of this.set)
-            if (l.length === 1 && x(l[0])) {
-              this.set = [l];
-              break;
-            }
-        }
-      }
-      this.formatted = void 0;
-    }
-    get range() {
-      if (this.formatted === void 0) {
-        this.formatted = "";
-        for (let e = 0; e < this.set.length; e++) {
-          e > 0 && (this.formatted += "||");
-          const i = this.set[e];
-          for (let t = 0; t < i.length; t++)
-            t > 0 && (this.formatted += " "), this.formatted += i[t].toString().trim();
-        }
-      }
-      return this.formatted;
-    }
-    format() {
-      return this.range;
-    }
-    toString() {
-      return this.range;
-    }
-    parseRange(e) {
-      const t = ((this.options.includePrerelease && I) | (this.options.loose && N)) + ":" + e, l = O.get(t);
-      if (l)
-        return l;
-      const s = this.options.loose, n = s ? h[o.HYPHENRANGELOOSE] : h[o.HYPHENRANGE];
-      e = e.replace(n, k(this.options.includePrerelease)), f("hyphen replace", e), e = e.replace(h[o.COMPARATORTRIM], y), f("comparator trim", e), e = e.replace(h[o.TILDETRIM], G), f("tilde trim", e), e = e.replace(h[o.CARETTRIM], v), f("caret trim", e);
-      let $ = e.split(" ").map((u) => m(u, this.options)).join(" ").split(/\s+/).map((u) => Y(u, this.options));
-      s && ($ = $.filter((u) => (f("loose invalid filter", u, this.options), !!u.match(h[o.COMPARATORLOOSE])))), f("range list", $);
-      const a = /* @__PURE__ */ new Map(), c = $.map((u) => new p(u, this.options));
-      for (const u of c) {
-        if (S(u))
-          return [u];
-        a.set(u.value, u);
-      }
-      a.size > 1 && a.has("") && a.delete("");
-      const R = [...a.values()];
-      return O.set(t, R), R;
-    }
-    intersects(e, i) {
-      if (!(e instanceof E))
-        throw new TypeError("a Range is required");
-      return this.set.some((t) => q(t, i) && e.set.some((l) => q(l, i) && t.every((s) => l.every((n) => s.intersects(n, i)))));
-    }
-    // if ANY of the sets match ALL of its comparators, then pass
-    test(e) {
-      if (!e)
-        return !1;
-      if (typeof e == "string")
-        try {
-          e = new P(e, this.options);
-        } catch {
-          return !1;
-        }
-      for (let i = 0; i < this.set.length; i++)
-        if (z(this.set[i], e, this.options))
-          return !0;
-      return !1;
-    }
-  }
-  A = E;
-  const C = F(), O = new C(), _ = V(), p = B(), f = K(), P = J(), {
-    safeRe: h,
-    t: o,
-    comparatorTrimReplace: y,
-    tildeTrimReplace: G,
-    caretTrimReplace: v
-  } = Q(), { FLAG_INCLUDE_PRERELEASE: I, FLAG_LOOSE: N } = W(), S = (r) => r.value === "<0.0.0-0", x = (r) => r.value === "", q = (r, e) => {
-    let i = !0;
-    const t = r.slice();
-    let l = t.pop();
-    for (; i && t.length; )
-      i = t.every((s) => l.intersects(s, e)), l = t.pop();
-    return i;
-  }, m = (r, e) => (r = r.replace(h[o.BUILD], ""), f("comp", r, e), r = j(r, e), f("caret", r), r = X(r, e), f("tildes", r), r = b(r, e), f("xrange", r), r = U(r, e), f("stars", r), r), d = (r) => !r || r.toLowerCase() === "x" || r === "*", X = (r, e) => r.trim().split(/\s+/).map((i) => g(i, e)).join(" "), g = (r, e) => {
-    const i = e.loose ? h[o.TILDELOOSE] : h[o.TILDE];
-    return r.replace(i, (t, l, s, n, $) => {
-      f("tilde", r, t, l, s, n, $);
-      let a;
-      return d(l) ? a = "" : d(s) ? a = `>=${l}.0.0 <${+l + 1}.0.0-0` : d(n) ? a = `>=${l}.${s}.0 <${l}.${+s + 1}.0-0` : $ ? (f("replaceTilde pr", $), a = `>=${l}.${s}.${n}-${$} <${l}.${+s + 1}.0-0`) : a = `>=${l}.${s}.${n} <${l}.${+s + 1}.0-0`, f("tilde return", a), a;
-    });
-  }, j = (r, e) => r.trim().split(/\s+/).map((i) => D(i, e)).join(" "), D = (r, e) => {
-    f("caret", r, e);
-    const i = e.loose ? h[o.CARETLOOSE] : h[o.CARET], t = e.includePrerelease ? "-0" : "";
-    return r.replace(i, (l, s, n, $, a) => {
-      f("caret", r, l, s, n, $, a);
-      let c;
-      return d(s) ? c = "" : d(n) ? c = `>=${s}.0.0${t} <${+s + 1}.0.0-0` : d($) ? s === "0" ? c = `>=${s}.${n}.0${t} <${s}.${+n + 1}.0-0` : c = `>=${s}.${n}.0${t} <${+s + 1}.0.0-0` : a ? (f("replaceCaret pr", a), s === "0" ? n === "0" ? c = `>=${s}.${n}.${$}-${a} <${s}.${n}.${+$ + 1}-0` : c = `>=${s}.${n}.${$}-${a} <${s}.${+n + 1}.0-0` : c = `>=${s}.${n}.${$}-${a} <${+s + 1}.0.0-0`) : (f("no pr"), s === "0" ? n === "0" ? c = `>=${s}.${n}.${$}${t} <${s}.${n}.${+$ + 1}-0` : c = `>=${s}.${n}.${$}${t} <${s}.${+n + 1}.0-0` : c = `>=${s}.${n}.${$} <${+s + 1}.0.0-0`), f("caret return", c), c;
-    });
-  }, b = (r, e) => (f("replaceXRanges", r, e), r.split(/\s+/).map((i) => H(i, e)).join(" ")), H = (r, e) => {
-    r = r.trim();
-    const i = e.loose ? h[o.XRANGELOOSE] : h[o.XRANGE];
-    return r.replace(i, (t, l, s, n, $, a) => {
-      f("xRange", r, t, l, s, n, $, a);
-      const c = d(s), R = c || d(n), u = R || d($), T = u;
-      return l === "=" && T && (l = ""), a = e.includePrerelease ? "-0" : "", c ? l === ">" || l === "<" ? t = "<0.0.0-0" : t = "*" : l && T ? (R && (n = 0), $ = 0, l === ">" ? (l = ">=", R ? (s = +s + 1, n = 0, $ = 0) : (n = +n + 1, $ = 0)) : l === "<=" && (l = "<", R ? s = +s + 1 : n = +n + 1), l === "<" && (a = "-0"), t = `${l + s}.${n}.${$}${a}`) : R ? t = `>=${s}.0.0${a} <${+s + 1}.0.0-0` : u && (t = `>=${s}.${n}.0${a} <${s}.${+n + 1}.0-0`), f("xRange return", t), t;
-    });
-  }, U = (r, e) => (f("replaceStars", r, e), r.trim().replace(h[o.STAR], "")), Y = (r, e) => (f("replaceGTE0", r, e), r.trim().replace(h[e.includePrerelease ? o.GTE0PRE : o.GTE0], "")), k = (r) => (e, i, t, l, s, n, $, a, c, R, u, T) => (d(t) ? i = "" : d(l) ? i = `>=${t}.0.0${r ? "-0" : ""}` : d(s) ? i = `>=${t}.${l}.0${r ? "-0" : ""}` : n ? i = `>=${i}` : i = `>=${i}${r ? "-0" : ""}`, d(c) ? a = "" : d(R) ? a = `<${+c + 1}.0.0-0` : d(u) ? a = `<${c}.${+R + 1}.0-0` : T ? a = `<=${c}.${R}.${u}-${T}` : r ? a = `<${c}.${R}.${+u + 1}-0` : a = `<=${a}`, `${i} ${a}`.trim()), z = (r, e, i) => {
-    for (let t = 0; t < r.length; t++)
-      if (!r[t].test(e))
-        return !1;
-    if (e.prerelease.length && !i.includePrerelease) {
-      for (let t = 0; t < r.length; t++)
-        if (f(r[t].semver), r[t].semver !== p.ANY && r[t].semver.prerelease.length > 0) {
-          const l = r[t].semver;
-          if (l.major === e.major && l.minor === e.minor && l.patch === e.patch)
-            return !0;
-        }
-      return !1;
-    }
-    return !0;
-  };
-  return A;
-}
-export {
-  le as __require
-};
-//# sourceMappingURL=range.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"range.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/range.js"],"sourcesContent":["'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n  constructor (range, options) {\n    options = parseOptions(options)\n\n    if (range instanceof Range) {\n      if (\n        range.loose === !!options.loose &&\n        range.includePrerelease === !!options.includePrerelease\n      ) {\n        return range\n      } else {\n        return new Range(range.raw, options)\n      }\n    }\n\n    if (range instanceof Comparator) {\n      // just put it in the set and return\n      this.raw = range.value\n      this.set = [[range]]\n      this.formatted = undefined\n      return this\n    }\n\n    this.options = options\n    this.loose = !!options.loose\n    this.includePrerelease = !!options.includePrerelease\n\n    // First reduce all whitespace as much as possible so we do not have to rely\n    // on potentially slow regexes like \\s*. This is then stored and used for\n    // future error messages as well.\n    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n    // First, split on ||\n    this.set = this.raw\n      .split('||')\n      // map the range to a 2d array of comparators\n      .map(r => this.parseRange(r.trim()))\n      // throw out any comparator lists that are empty\n      // this generally means that it was not a valid range, which is allowed\n      // in loose mode, but will still throw if the WHOLE range is invalid.\n      .filter(c => c.length)\n\n    if (!this.set.length) {\n      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n    }\n\n    // if we have any that are not the null set, throw out null sets.\n    if (this.set.length > 1) {\n      // keep the first one, in case they're all null sets\n      const first = this.set[0]\n      this.set = this.set.filter(c => !isNullSet(c[0]))\n      if (this.set.length === 0) {\n        this.set = [first]\n      } else if (this.set.length > 1) {\n        // if we have any that are *, then the range is just *\n        for (const c of this.set) {\n          if (c.length === 1 && isAny(c[0])) {\n            this.set = [c]\n            break\n          }\n        }\n      }\n    }\n\n    this.formatted = undefined\n  }\n\n  get range () {\n    if (this.formatted === undefined) {\n      this.formatted = ''\n      for (let i = 0; i < this.set.length; i++) {\n        if (i > 0) {\n          this.formatted += '||'\n        }\n        const comps = this.set[i]\n        for (let k = 0; k < comps.length; k++) {\n          if (k > 0) {\n            this.formatted += ' '\n          }\n          this.formatted += comps[k].toString().trim()\n        }\n      }\n    }\n    return this.formatted\n  }\n\n  format () {\n    return this.range\n  }\n\n  toString () {\n    return this.range\n  }\n\n  parseRange (range) {\n    // memoize range parsing for performance.\n    // this is a very hot path, and fully deterministic.\n    const memoOpts =\n      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n      (this.options.loose && FLAG_LOOSE)\n    const memoKey = memoOpts + ':' + range\n    const cached = cache.get(memoKey)\n    if (cached) {\n      return cached\n    }\n\n    const loose = this.options.loose\n    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n    debug('hyphen replace', range)\n\n    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n    debug('comparator trim', range)\n\n    // `~ 1.2.3` => `~1.2.3`\n    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n    debug('tilde trim', range)\n\n    // `^ 1.2.3` => `^1.2.3`\n    range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n    debug('caret trim', range)\n\n    // At this point, the range is completely trimmed and\n    // ready to be split into comparators.\n\n    let rangeList = range\n      .split(' ')\n      .map(comp => parseComparator(comp, this.options))\n      .join(' ')\n      .split(/\\s+/)\n      // >=0.0.0 is equivalent to *\n      .map(comp => replaceGTE0(comp, this.options))\n\n    if (loose) {\n      // in loose mode, throw out any that are not valid comparators\n      rangeList = rangeList.filter(comp => {\n        debug('loose invalid filter', comp, this.options)\n        return !!comp.match(re[t.COMPARATORLOOSE])\n      })\n    }\n    debug('range list', rangeList)\n\n    // if any comparators are the null set, then replace with JUST null set\n    // if more than one comparator, remove any * comparators\n    // also, don't include the same comparator more than once\n    const rangeMap = new Map()\n    const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n    for (const comp of comparators) {\n      if (isNullSet(comp)) {\n        return [comp]\n      }\n      rangeMap.set(comp.value, comp)\n    }\n    if (rangeMap.size > 1 && rangeMap.has('')) {\n      rangeMap.delete('')\n    }\n\n    const result = [...rangeMap.values()]\n    cache.set(memoKey, result)\n    return result\n  }\n\n  intersects (range, options) {\n    if (!(range instanceof Range)) {\n      throw new TypeError('a Range is required')\n    }\n\n    return this.set.some((thisComparators) => {\n      return (\n        isSatisfiable(thisComparators, options) &&\n        range.set.some((rangeComparators) => {\n          return (\n            isSatisfiable(rangeComparators, options) &&\n            thisComparators.every((thisComparator) => {\n              return rangeComparators.every((rangeComparator) => {\n                return thisComparator.intersects(rangeComparator, options)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test (version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = new SemVer(version, this.options)\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version, this.options)) {\n        return true\n      }\n    }\n    return false\n  }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n  safeRe: re,\n  t,\n  comparatorTrimReplace,\n  tildeTrimReplace,\n  caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n  let result = true\n  const remainingComparators = comparators.slice()\n  let testComparator = remainingComparators.pop()\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every((otherComparator) => {\n      return testComparator.intersects(otherComparator, options)\n    })\n\n    testComparator = remainingComparators.pop()\n  }\n\n  return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n  comp = comp.replace(re[t.BUILD], '')\n  debug('comp', comp, options)\n  comp = replaceCarets(comp, options)\n  debug('caret', comp)\n  comp = replaceTildes(comp, options)\n  debug('tildes', comp)\n  comp = replaceXRanges(comp, options)\n  debug('xrange', comp)\n  comp = replaceStars(comp, options)\n  debug('stars', comp)\n  return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceTilde(c, options))\n    .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('tilde', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      // ~1.2 == >=1.2.0 <1.3.0-0\n      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n    } else if (pr) {\n      debug('replaceTilde pr', pr)\n      ret = `>=${M}.${m}.${p}-${pr\n      } <${M}.${+m + 1}.0-0`\n    } else {\n      // ~1.2.3 == >=1.2.3 <1.3.0-0\n      ret = `>=${M}.${m}.${p\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('tilde return', ret)\n    return ret\n  })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n  return comp\n    .trim()\n    .split(/\\s+/)\n    .map((c) => replaceCaret(c, options))\n    .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n  debug('caret', comp, options)\n  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n  const z = options.includePrerelease ? '-0' : ''\n  return comp.replace(r, (_, M, m, p, pr) => {\n    debug('caret', comp, _, M, m, p, pr)\n    let ret\n\n    if (isX(M)) {\n      ret = ''\n    } else if (isX(m)) {\n      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n    } else if (isX(p)) {\n      if (M === '0') {\n        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n      } else {\n        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n      }\n    } else if (pr) {\n      debug('replaceCaret pr', pr)\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p}-${pr\n          } <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p}-${pr\n        } <${+M + 1}.0.0-0`\n      }\n    } else {\n      debug('no pr')\n      if (M === '0') {\n        if (m === '0') {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${m}.${+p + 1}-0`\n        } else {\n          ret = `>=${M}.${m}.${p\n          }${z} <${M}.${+m + 1}.0-0`\n        }\n      } else {\n        ret = `>=${M}.${m}.${p\n        } <${+M + 1}.0.0-0`\n      }\n    }\n\n    debug('caret return', ret)\n    return ret\n  })\n}\n\nconst replaceXRanges = (comp, options) => {\n  debug('replaceXRanges', comp, options)\n  return comp\n    .split(/\\s+/)\n    .map((c) => replaceXRange(c, options))\n    .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n  comp = comp.trim()\n  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n    debug('xRange', comp, ret, gtlt, M, m, p, pr)\n    const xM = isX(M)\n    const xm = xM || isX(m)\n    const xp = xm || isX(p)\n    const anyX = xp\n\n    if (gtlt === '=' && anyX) {\n      gtlt = ''\n    }\n\n    // if we're including prereleases in the match, then we need\n    // to fix this to -0, the lowest possible prerelease value\n    pr = options.includePrerelease ? '-0' : ''\n\n    if (xM) {\n      if (gtlt === '>' || gtlt === '<') {\n        // nothing is allowed\n        ret = '<0.0.0-0'\n      } else {\n        // nothing is forbidden\n        ret = '*'\n      }\n    } else if (gtlt && anyX) {\n      // we know patch is an x, because we have any x at all.\n      // replace X with 0\n      if (xm) {\n        m = 0\n      }\n      p = 0\n\n      if (gtlt === '>') {\n        // >1 => >=2.0.0\n        // >1.2 => >=1.3.0\n        gtlt = '>='\n        if (xm) {\n          M = +M + 1\n          m = 0\n          p = 0\n        } else {\n          m = +m + 1\n          p = 0\n        }\n      } else if (gtlt === '<=') {\n        // <=0.7.x is actually <0.8.0, since any 0.7.x should\n        // pass.  Similarly, <=7.x is actually <8.0.0, etc.\n        gtlt = '<'\n        if (xm) {\n          M = +M + 1\n        } else {\n          m = +m + 1\n        }\n      }\n\n      if (gtlt === '<') {\n        pr = '-0'\n      }\n\n      ret = `${gtlt + M}.${m}.${p}${pr}`\n    } else if (xm) {\n      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n    } else if (xp) {\n      ret = `>=${M}.${m}.0${pr\n      } <${M}.${+m + 1}.0-0`\n    }\n\n    debug('xRange return', ret)\n\n    return ret\n  })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n  debug('replaceStars', comp, options)\n  // Looseness is ignored here.  star is always as loose as it gets!\n  return comp\n    .trim()\n    .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n  debug('replaceGTE0', comp, options)\n  return comp\n    .trim()\n    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n  from, fM, fm, fp, fpr, fb,\n  to, tM, tm, tp, tpr) => {\n  if (isX(fM)) {\n    from = ''\n  } else if (isX(fm)) {\n    from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n  } else if (isX(fp)) {\n    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n  } else if (fpr) {\n    from = `>=${from}`\n  } else {\n    from = `>=${from}${incPr ? '-0' : ''}`\n  }\n\n  if (isX(tM)) {\n    to = ''\n  } else if (isX(tm)) {\n    to = `<${+tM + 1}.0.0-0`\n  } else if (isX(tp)) {\n    to = `<${tM}.${+tm + 1}.0-0`\n  } else if (tpr) {\n    to = `<=${tM}.${tm}.${tp}-${tpr}`\n  } else if (incPr) {\n    to = `<${tM}.${tm}.${+tp + 1}-0`\n  } else {\n    to = `<=${to}`\n  }\n\n  return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n  for (let i = 0; i < set.length; i++) {\n    if (!set[i].test(version)) {\n      return false\n    }\n  }\n\n  if (version.prerelease.length && !options.includePrerelease) {\n    // Find the set of versions that are allowed to have prereleases\n    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n    // That should allow `1.2.3-pr.2` to pass.\n    // However, `1.2.4-alpha.notready` should NOT be allowed,\n    // even though it's within the range set by the comparators.\n    for (let i = 0; i < set.length; i++) {\n      debug(set[i].semver)\n      if (set[i].semver === Comparator.ANY) {\n        continue\n      }\n\n      if (set[i].semver.prerelease.length > 0) {\n        const allowed = set[i].semver\n        if (allowed.major === version.major &&\n            allowed.minor === version.minor &&\n            allowed.patch === version.patch) {\n          return true\n        }\n      }\n    }\n\n    // Version has a -pre, but it's not one of the ones we like.\n    return false\n  }\n\n  return true\n}\n"],"names":["SPACE_CHARACTERS","Range","range","options","parseOptions","Comparator","r","c","first","isNullSet","isAny","i","comps","k","memoKey","FLAG_INCLUDE_PRERELEASE","FLAG_LOOSE","cached","cache","loose","hr","re","t","hyphenReplace","debug","comparatorTrimReplace","tildeTrimReplace","caretTrimReplace","rangeList","comp","parseComparator","replaceGTE0","rangeMap","comparators","result","thisComparators","isSatisfiable","rangeComparators","thisComparator","rangeComparator","version","SemVer","testSet","LRU","require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","remainingComparators","testComparator","otherComparator","replaceCarets","replaceTildes","replaceXRanges","replaceStars","isX","id","replaceTilde","_","M","m","p","pr","ret","replaceCaret","z","replaceXRange","gtlt","xM","xm","xp","anyX","incPr","$0","from","fM","fm","fp","fpr","fb","to","tM","tm","tp","tpr","set","allowed"],"mappings":";;;;;;;;;;;AAEA,QAAMA,IAAmB;AAAA,EAGzB,MAAMC,EAAM;AAAA,IACV,YAAaC,GAAOC,GAAS;AAG3B,UAFAA,IAAUC,EAAaD,CAAO,GAE1BD,aAAiBD;AACnB,eACEC,EAAM,UAAU,CAAC,CAACC,EAAQ,SAC1BD,EAAM,sBAAsB,CAAC,CAACC,EAAQ,oBAE/BD,IAEA,IAAID,EAAMC,EAAM,KAAKC,CAAO;AAIvC,UAAID,aAAiBG;AAEnB,oBAAK,MAAMH,EAAM,OACjB,KAAK,MAAM,CAAC,CAACA,CAAK,CAAC,GACnB,KAAK,YAAY,QACV;AAsBT,UAnBA,KAAK,UAAUC,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OACvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ,mBAKnC,KAAK,MAAMD,EAAM,KAAI,EAAG,QAAQF,GAAkB,GAAG,GAGrD,KAAK,MAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAI,CAAAM,MAAK,KAAK,WAAWA,EAAE,KAAI,CAAE,CAAC,EAIlC,OAAO,CAAAC,MAAKA,EAAE,MAAM,GAEnB,CAAC,KAAK,IAAI;AACZ,cAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE;AAIzD,UAAI,KAAK,IAAI,SAAS,GAAG;AAEvB,cAAMC,IAAQ,KAAK,IAAI,CAAC;AAExB,YADA,KAAK,MAAM,KAAK,IAAI,OAAO,CAAAD,MAAK,CAACE,EAAUF,EAAE,CAAC,CAAC,CAAC,GAC5C,KAAK,IAAI,WAAW;AACtB,eAAK,MAAM,CAACC,CAAK;AAAA,iBACR,KAAK,IAAI,SAAS;AAE3B,qBAAWD,KAAK,KAAK;AACnB,gBAAIA,EAAE,WAAW,KAAKG,EAAMH,EAAE,CAAC,CAAC,GAAG;AACjC,mBAAK,MAAM,CAACA,CAAC;AACb;AAAA,YACZ;AAAA;AAAA,MAGA;AAEI,WAAK,YAAY;AAAA,IACrB;AAAA,IAEE,IAAI,QAAS;AACX,UAAI,KAAK,cAAc,QAAW;AAChC,aAAK,YAAY;AACjB,iBAASI,IAAI,GAAGA,IAAI,KAAK,IAAI,QAAQA,KAAK;AACxC,UAAIA,IAAI,MACN,KAAK,aAAa;AAEpB,gBAAMC,IAAQ,KAAK,IAAID,CAAC;AACxB,mBAASE,IAAI,GAAGA,IAAID,EAAM,QAAQC;AAChC,YAAIA,IAAI,MACN,KAAK,aAAa,MAEpB,KAAK,aAAaD,EAAMC,CAAC,EAAE,SAAQ,EAAG,KAAI;AAAA,QAEpD;AAAA,MACA;AACI,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,SAAU;AACR,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,WAAYX,GAAO;AAMjB,YAAMY,MAFH,KAAK,QAAQ,qBAAqBC,MAClC,KAAK,QAAQ,SAASC,MACE,MAAMd,GAC3Be,IAASC,EAAM,IAAIJ,CAAO;AAChC,UAAIG;AACF,eAAOA;AAGT,YAAME,IAAQ,KAAK,QAAQ,OAErBC,IAAKD,IAAQE,EAAGC,EAAE,gBAAgB,IAAID,EAAGC,EAAE,WAAW;AAC5D,MAAApB,IAAQA,EAAM,QAAQkB,GAAIG,EAAc,KAAK,QAAQ,iBAAiB,CAAC,GACvEC,EAAM,kBAAkBtB,CAAK,GAG7BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,cAAc,GAAGG,CAAqB,GACjED,EAAM,mBAAmBtB,CAAK,GAG9BA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGI,CAAgB,GACvDF,EAAM,cAActB,CAAK,GAGzBA,IAAQA,EAAM,QAAQmB,EAAGC,EAAE,SAAS,GAAGK,CAAgB,GACvDH,EAAM,cAActB,CAAK;AAKzB,UAAI0B,IAAY1B,EACb,MAAM,GAAG,EACT,IAAI,CAAA2B,MAAQC,EAAgBD,GAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAI,CAAAA,MAAQE,EAAYF,GAAM,KAAK,OAAO,CAAC;AAE9C,MAAIV,MAEFS,IAAYA,EAAU,OAAO,CAAAC,OAC3BL,EAAM,wBAAwBK,GAAM,KAAK,OAAO,GACzC,CAAC,CAACA,EAAK,MAAMR,EAAGC,EAAE,eAAe,CAAC,EAC1C,IAEHE,EAAM,cAAcI,CAAS;AAK7B,YAAMI,IAAW,oBAAI,IAAG,GAClBC,IAAcL,EAAU,IAAI,CAAAC,MAAQ,IAAIxB,EAAWwB,GAAM,KAAK,OAAO,CAAC;AAC5E,iBAAWA,KAAQI,GAAa;AAC9B,YAAIxB,EAAUoB,CAAI;AAChB,iBAAO,CAACA,CAAI;AAEd,QAAAG,EAAS,IAAIH,EAAK,OAAOA,CAAI;AAAA,MACnC;AACI,MAAIG,EAAS,OAAO,KAAKA,EAAS,IAAI,EAAE,KACtCA,EAAS,OAAO,EAAE;AAGpB,YAAME,IAAS,CAAC,GAAGF,EAAS,OAAM,CAAE;AACpC,aAAAd,EAAM,IAAIJ,GAASoB,CAAM,GAClBA;AAAA,IACX;AAAA,IAEE,WAAYhC,GAAOC,GAAS;AAC1B,UAAI,EAAED,aAAiBD;AACrB,cAAM,IAAI,UAAU,qBAAqB;AAG3C,aAAO,KAAK,IAAI,KAAK,CAACkC,MAElBC,EAAcD,GAAiBhC,CAAO,KACtCD,EAAM,IAAI,KAAK,CAACmC,MAEZD,EAAcC,GAAkBlC,CAAO,KACvCgC,EAAgB,MAAM,CAACG,MACdD,EAAiB,MAAM,CAACE,MACtBD,EAAe,WAAWC,GAAiBpC,CAAO,CAC1D,CACF,CAEJ,CAEJ;AAAA,IACL;AAAA;AAAA,IAGE,KAAMqC,GAAS;AACb,UAAI,CAACA;AACH,eAAO;AAGT,UAAI,OAAOA,KAAY;AACrB,YAAI;AACF,UAAAA,IAAU,IAAIC,EAAOD,GAAS,KAAK,OAAO;AAAA,QAClD,QAAmB;AACX,iBAAO;AAAA,QACf;AAGI,eAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ;AACnC,YAAIE,EAAQ,KAAK,IAAI,CAAC,GAAGF,GAAS,KAAK,OAAO;AAC5C,iBAAO;AAGX,aAAO;AAAA,IACX;AAAA,EACA;AAEA,EAAAtC,IAAiBD;AAEjB,QAAM0C,IAAMC,EAAA,GACN1B,IAAQ,IAAIyB,EAAG,GAEfvC,IAAeyC,EAAA,GACfxC,IAAayC,EAAA,GACbtB,IAAQuB,EAAA,GACRN,IAASO,EAAA,GACT;AAAA,IACJ,QAAQ3B;AAAA,IACR,GAAAC;AAAA,IACA,uBAAAG;AAAA,IACA,kBAAAC;AAAA,IACA,kBAAAC;AAAA,EACF,IAAIsB,EAAA,GACE,EAAE,yBAAAlC,GAAyB,YAAAC,EAAU,IAAKkC,EAAA,GAE1CzC,IAAY,CAAAF,MAAKA,EAAE,UAAU,YAC7BG,IAAQ,CAAAH,MAAKA,EAAE,UAAU,IAIzB6B,IAAgB,CAACH,GAAa9B,MAAY;AAC9C,QAAI+B,IAAS;AACb,UAAMiB,IAAuBlB,EAAY,MAAK;AAC9C,QAAImB,IAAiBD,EAAqB,IAAG;AAE7C,WAAOjB,KAAUiB,EAAqB;AACpC,MAAAjB,IAASiB,EAAqB,MAAM,CAACE,MAC5BD,EAAe,WAAWC,GAAiBlD,CAAO,CAC1D,GAEDiD,IAAiBD,EAAqB,IAAG;AAG3C,WAAOjB;AAAA,EACT,GAKMJ,IAAkB,CAACD,GAAM1B,OAC7B0B,IAAOA,EAAK,QAAQR,EAAGC,EAAE,KAAK,GAAG,EAAE,GACnCE,EAAM,QAAQK,GAAM1B,CAAO,GAC3B0B,IAAOyB,EAAczB,GAAM1B,CAAO,GAClCqB,EAAM,SAASK,CAAI,GACnBA,IAAO0B,EAAc1B,GAAM1B,CAAO,GAClCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO2B,EAAe3B,GAAM1B,CAAO,GACnCqB,EAAM,UAAUK,CAAI,GACpBA,IAAO4B,EAAa5B,GAAM1B,CAAO,GACjCqB,EAAM,SAASK,CAAI,GACZA,IAGH6B,IAAM,CAAAC,MAAM,CAACA,KAAMA,EAAG,YAAW,MAAO,OAAOA,MAAO,KAStDJ,IAAgB,CAAC1B,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAMqD,EAAarD,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPyD,IAAe,CAAC/B,GAAM1B,MAAY;AACtC,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK;AACvD,WAAOO,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,SAAS,CAACA,IAAI,CAAC,WAClBJ,EAAIM,CAAC,IAEdE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,OAAOD,CAAC,IAAI,CAACC,IAAI,CAAC,SAC1BE,KACTzC,EAAM,mBAAmByC,CAAE,GAC3BC,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,IAAI,CAAC,UAGhBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,MAChBF,CAAC,IAAI,CAACC,IAAI,CAAC,QAGlBvC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACX,CAAG;AAAA,EACH,GAUMZ,IAAgB,CAACzB,GAAM1B,MACpB0B,EACJ,KAAI,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM4D,EAAa5D,GAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,GAGPgE,IAAe,CAACtC,GAAM1B,MAAY;AACtC,IAAAqB,EAAM,SAASK,GAAM1B,CAAO;AAC5B,UAAMG,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,UAAU,IAAID,EAAGC,EAAE,KAAK,GACjD8C,IAAIjE,EAAQ,oBAAoB,OAAO;AAC7C,WAAO0B,EAAK,QAAQvB,GAAG,CAACuD,GAAGC,GAAGC,GAAGC,GAAGC,MAAO;AACzC,MAAAzC,EAAM,SAASK,GAAMgC,GAAGC,GAAGC,GAAGC,GAAGC,CAAE;AACnC,UAAIC;AAEJ,aAAIR,EAAII,CAAC,IACPI,IAAM,KACGR,EAAIK,CAAC,IACdG,IAAM,KAAKJ,CAAC,OAAOM,CAAC,KAAK,CAACN,IAAI,CAAC,WACtBJ,EAAIM,CAAC,IACVF,MAAM,MACRI,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAEvCG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAK,CAACN,IAAI,CAAC,WAE3BG,KACTzC,EAAM,mBAAmByC,CAAE,GACvBH,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CACpC,KAAeH,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAErBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,MACrBH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAClC,KAAa,CAACH,IAAI,CAAC,aAGbtC,EAAM,OAAO,GACTsC,MAAM,MACJC,MAAM,MACRG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAIC,CAAC,IAAI,CAACC,IAAI,CAAC,OAEzBE,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC/B,GAAaI,CAAC,KAAKN,CAAC,IAAI,CAACC,IAAI,CAAC,SAGtBG,IAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAC7B,KAAa,CAACF,IAAI,CAAC,WAIftC,EAAM,gBAAgB0C,CAAG,GAClBA;AAAA,IACX,CAAG;AAAA,EACH,GAEMV,IAAiB,CAAC3B,GAAM1B,OAC5BqB,EAAM,kBAAkBK,GAAM1B,CAAO,GAC9B0B,EACJ,MAAM,KAAK,EACX,IAAI,CAACtB,MAAM8D,EAAc9D,GAAGJ,CAAO,CAAC,EACpC,KAAK,GAAG,IAGPkE,IAAgB,CAACxC,GAAM1B,MAAY;AACvC,IAAA0B,IAAOA,EAAK,KAAI;AAChB,UAAMvB,IAAIH,EAAQ,QAAQkB,EAAGC,EAAE,WAAW,IAAID,EAAGC,EAAE,MAAM;AACzD,WAAOO,EAAK,QAAQvB,GAAG,CAAC4D,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,MAAO;AACjD,MAAAzC,EAAM,UAAUK,GAAMqC,GAAKI,GAAMR,GAAGC,GAAGC,GAAGC,CAAE;AAC5C,YAAMM,IAAKb,EAAII,CAAC,GACVU,IAAKD,KAAMb,EAAIK,CAAC,GAChBU,IAAKD,KAAMd,EAAIM,CAAC,GAChBU,IAAOD;AAEb,aAAIH,MAAS,OAAOI,MAClBJ,IAAO,KAKTL,IAAK9D,EAAQ,oBAAoB,OAAO,IAEpCoE,IACED,MAAS,OAAOA,MAAS,MAE3BJ,IAAM,aAGNA,IAAM,MAECI,KAAQI,KAGbF,MACFT,IAAI,IAENC,IAAI,GAEAM,MAAS,OAGXA,IAAO,MACHE,KACFV,IAAI,CAACA,IAAI,GACTC,IAAI,GACJC,IAAI,MAEJD,IAAI,CAACA,IAAI,GACTC,IAAI,MAEGM,MAAS,SAGlBA,IAAO,KACHE,IACFV,IAAI,CAACA,IAAI,IAETC,IAAI,CAACA,IAAI,IAITO,MAAS,QACXL,IAAK,OAGPC,IAAM,GAAGI,IAAOR,CAAC,IAAIC,CAAC,IAAIC,CAAC,GAAGC,CAAE,MACvBO,IACTN,IAAM,KAAKJ,CAAC,OAAOG,CAAE,KAAK,CAACH,IAAI,CAAC,WACvBW,MACTP,IAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKE,MACjBH,CAAC,IAAI,CAACC,IAAI,CAAC,SAGlBvC,EAAM,iBAAiB0C,CAAG,GAEnBA;AAAA,IACX,CAAG;AAAA,EACH,GAIMT,IAAe,CAAC5B,GAAM1B,OAC1BqB,EAAM,gBAAgBK,GAAM1B,CAAO,GAE5B0B,EACJ,KAAI,EACJ,QAAQR,EAAGC,EAAE,IAAI,GAAG,EAAE,IAGrBS,IAAc,CAACF,GAAM1B,OACzBqB,EAAM,eAAeK,GAAM1B,CAAO,GAC3B0B,EACJ,KAAI,EACJ,QAAQR,EAAGlB,EAAQ,oBAAoBmB,EAAE,UAAUA,EAAE,IAAI,GAAG,EAAE,IAS7DC,IAAgB,CAAAoD,MAAS,CAACC,GAC9BC,GAAMC,GAAIC,GAAIC,GAAIC,GAAKC,GACvBC,GAAIC,GAAIC,GAAIC,GAAIC,OACZ7B,EAAIoB,CAAE,IACRD,IAAO,KACEnB,EAAIqB,CAAE,IACfF,IAAO,KAAKC,CAAE,OAAOH,IAAQ,OAAO,EAAE,KAC7BjB,EAAIsB,CAAE,IACfH,IAAO,KAAKC,CAAE,IAAIC,CAAE,KAAKJ,IAAQ,OAAO,EAAE,KACjCM,IACTJ,IAAO,KAAKA,CAAI,KAEhBA,IAAO,KAAKA,CAAI,GAAGF,IAAQ,OAAO,EAAE,IAGlCjB,EAAI0B,CAAE,IACRD,IAAK,KACIzB,EAAI2B,CAAE,IACfF,IAAK,IAAI,CAACC,IAAK,CAAC,WACP1B,EAAI4B,CAAE,IACfH,IAAK,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,SACbE,IACTJ,IAAK,KAAKC,CAAE,IAAIC,CAAE,IAAIC,CAAE,IAAIC,CAAG,KACtBZ,IACTQ,IAAK,IAAIC,CAAE,IAAIC,CAAE,IAAI,CAACC,IAAK,CAAC,OAE5BH,IAAK,KAAKA,CAAE,IAGP,GAAGN,CAAI,IAAIM,CAAE,GAAG,KAAI,IAGvBzC,IAAU,CAAC8C,GAAKhD,GAASrC,MAAY;AACzC,aAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAC9B,UAAI,CAAC6E,EAAI7E,CAAC,EAAE,KAAK6B,CAAO;AACtB,eAAO;AAIX,QAAIA,EAAQ,WAAW,UAAU,CAACrC,EAAQ,mBAAmB;AAM3D,eAASQ,IAAI,GAAGA,IAAI6E,EAAI,QAAQ7E;AAE9B,YADAa,EAAMgE,EAAI7E,CAAC,EAAE,MAAM,GACf6E,EAAI7E,CAAC,EAAE,WAAWN,EAAW,OAI7BmF,EAAI7E,CAAC,EAAE,OAAO,WAAW,SAAS,GAAG;AACvC,gBAAM8E,IAAUD,EAAI7E,CAAC,EAAE;AACvB,cAAI8E,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ,SAC1BiD,EAAQ,UAAUjD,EAAQ;AAC5B,mBAAO;AAAA,QAEjB;AAII,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("../internal/debug.cjs.js"),g=require("../internal/constants.cjs.js"),b=require("../internal/re.cjs.js"),E=require("../internal/parse-options.cjs.js"),d=require("../internal/identifiers.cjs.js");var c,f;function v(){if(f)return c;f=1;const a=w.__require(),{MAX_LENGTH:u,MAX_SAFE_INTEGER:h}=g.__require(),{safeRe:l,t:o}=b.__require(),m=E.__require(),{compareIdentifiers:p}=d.__require();class n{constructor(e,r){if(r=m(r),e instanceof n){if(e.loose===!!r.loose&&e.includePrerelease===!!r.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`);a("SemVer",e,r),this.options=r,this.loose=!!r.loose,this.includePrerelease=!!r.includePrerelease;const s=e.trim().match(r.loose?l[o.LOOSE]:l[o.FULL]);if(!s)throw new TypeError(`Invalid Version: ${e}`);if(this.raw=e,this.major=+s[1],this.minor=+s[2],this.patch=+s[3],this.major>h||this.major<0)throw new TypeError("Invalid major version");if(this.minor>h||this.minor<0)throw new TypeError("Invalid minor version");if(this.patch>h||this.patch<0)throw new TypeError("Invalid patch version");s[4]?this.prerelease=s[4].split(".").map(t=>{if(/^[0-9]+$/.test(t)){const i=+t;if(i>=0&&i<h)return i}return t}):this.prerelease=[],this.build=s[5]?s[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(a("SemVer.compare",this.version,this.options,e),!(e instanceof n)){if(typeof e=="string"&&e===this.version)return 0;e=new n(e,this.options)}return e.version===this.version?0:this.compareMain(e)||this.comparePre(e)}compareMain(e){return e instanceof n||(e=new n(e,this.options)),this.major<e.major?-1:this.major>e.major?1:this.minor<e.minor?-1:this.minor>e.minor?1:this.patch<e.patch?-1:this.patch>e.patch?1:0}comparePre(e){if(e instanceof n||(e=new n(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 r=0;do{const s=this.prerelease[r],t=e.prerelease[r];if(a("prerelease compare",r,s,t),s===void 0&&t===void 0)return 0;if(t===void 0)return 1;if(s===void 0)return-1;if(s===t)continue;return p(s,t)}while(++r)}compareBuild(e){e instanceof n||(e=new n(e,this.options));let r=0;do{const s=this.build[r],t=e.build[r];if(a("build compare",r,s,t),s===void 0&&t===void 0)return 0;if(t===void 0)return 1;if(s===void 0)return-1;if(s===t)continue;return p(s,t)}while(++r)}inc(e,r,s){if(e.startsWith("pre")){if(!r&&s===!1)throw new Error("invalid increment argument: identifier is empty");if(r){const t=`-${r}`.match(this.options.loose?l[o.PRERELEASELOOSE]:l[o.PRERELEASE]);if(!t||t[1]!==r)throw new Error(`invalid identifier: ${r}`)}}switch(e){case"premajor":this.prerelease.length=0,this.patch=0,this.minor=0,this.major++,this.inc("pre",r,s);break;case"preminor":this.prerelease.length=0,this.patch=0,this.minor++,this.inc("pre",r,s);break;case"prepatch":this.prerelease.length=0,this.inc("patch",r,s),this.inc("pre",r,s);break;case"prerelease":this.prerelease.length===0&&this.inc("patch",r,s),this.inc("pre",r,s);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;case"pre":{const t=Number(s)?1:0;if(this.prerelease.length===0)this.prerelease=[t];else{let i=this.prerelease.length;for(;--i>=0;)typeof this.prerelease[i]=="number"&&(this.prerelease[i]++,i=-2);if(i===-1){if(r===this.prerelease.join(".")&&s===!1)throw new Error("invalid increment argument: identifier already exists");this.prerelease.push(t)}}if(r){let i=[r,t];s===!1&&(i=[r]),p(this.prerelease[0],r)===0?isNaN(this.prerelease[1])&&(this.prerelease=i):this.prerelease=i}break}default:throw new Error(`invalid increment argument: ${e}`)}return this.raw=this.format(),this.build.length&&(this.raw+=`+${this.build.join(".")}`),this}}return c=n,c}exports.__require=v;
-//# sourceMappingURL=semver.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"semver.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.js"],"sourcesContent":["'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n        version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    if (this.major < other.major) {\n      return -1\n    }\n    if (this.major > other.major) {\n      return 1\n    }\n    if (this.minor < other.minor) {\n      return -1\n    }\n    if (this.minor > other.minor) {\n      return 1\n    }\n    if (this.patch < other.patch) {\n      return -1\n    }\n    if (this.patch > other.patch) {\n      return 1\n    }\n    return 0\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    if (release.startsWith('pre')) {\n      if (!identifier && identifierBase === false) {\n        throw new Error('invalid increment argument: identifier is empty')\n      }\n      // Avoid an invalid semver results\n      if (identifier) {\n        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n        if (!match || match[1] !== identifier) {\n          throw new Error(`invalid identifier: ${identifier}`)\n        }\n      }\n    }\n\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'release':\n        if (this.prerelease.length === 0) {\n          throw new Error(`version ${this.raw} is not a prerelease`)\n        }\n        this.prerelease.length = 0\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n"],"names":["debug","require$$0","MAX_LENGTH","MAX_SAFE_INTEGER","require$$1","re","t","require$$2","parseOptions","require$$3","compareIdentifiers","require$$4","SemVer","version","options","m","id","num","other","i","a","b","release","identifier","identifierBase","match","base","prerelease","semver"],"mappings":"0UAEA,MAAMA,EAAQC,EAAAA,UAAA,EACR,CAAE,WAAAC,EAAY,iBAAAC,CAAgB,EAAKC,EAAAA,UAAA,EACnC,CAAE,OAAQC,EAAI,EAAAC,CAAC,EAAKC,EAAAA,UAAA,EAEpBC,EAAeC,EAAAA,UAAA,EACf,CAAE,mBAAAC,CAAkB,EAAKC,EAAAA,UAAA,EAC/B,MAAMC,CAAO,CACX,YAAaC,EAASC,EAAS,CAG7B,GAFAA,EAAUN,EAAaM,CAAO,EAE1BD,aAAmBD,EAAQ,CAC7B,GAAIC,EAAQ,QAAU,CAAC,CAACC,EAAQ,OAC9BD,EAAQ,oBAAsB,CAAC,CAACC,EAAQ,kBACxC,OAAOD,EAEPA,EAAUA,EAAQ,OAE1B,SAAe,OAAOA,GAAY,SAC5B,MAAM,IAAI,UAAU,gDAAgD,OAAOA,CAAO,IAAI,EAGxF,GAAIA,EAAQ,OAASX,EACnB,MAAM,IAAI,UACR,0BAA0BA,CAAU,aAC5C,EAGIF,EAAM,SAAUa,EAASC,CAAO,EAChC,KAAK,QAAUA,EACf,KAAK,MAAQ,CAAC,CAACA,EAAQ,MAGvB,KAAK,kBAAoB,CAAC,CAACA,EAAQ,kBAEnC,MAAMC,EAAIF,EAAQ,KAAI,EAAG,MAAMC,EAAQ,MAAQT,EAAGC,EAAE,KAAK,EAAID,EAAGC,EAAE,IAAI,CAAC,EAEvE,GAAI,CAACS,EACH,MAAM,IAAI,UAAU,oBAAoBF,CAAO,EAAE,EAUnD,GAPA,KAAK,IAAMA,EAGX,KAAK,MAAQ,CAACE,EAAE,CAAC,EACjB,KAAK,MAAQ,CAACA,EAAE,CAAC,EACjB,KAAK,MAAQ,CAACA,EAAE,CAAC,EAEb,KAAK,MAAQZ,GAAoB,KAAK,MAAQ,EAChD,MAAM,IAAI,UAAU,uBAAuB,EAG7C,GAAI,KAAK,MAAQA,GAAoB,KAAK,MAAQ,EAChD,MAAM,IAAI,UAAU,uBAAuB,EAG7C,GAAI,KAAK,MAAQA,GAAoB,KAAK,MAAQ,EAChD,MAAM,IAAI,UAAU,uBAAuB,EAIxCY,EAAE,CAAC,EAGN,KAAK,WAAaA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAKC,GAAO,CAC5C,GAAI,WAAW,KAAKA,CAAE,EAAG,CACvB,MAAMC,EAAM,CAACD,EACb,GAAIC,GAAO,GAAKA,EAAMd,EACpB,OAAOc,CAEnB,CACQ,OAAOD,CACf,CAAO,EAVD,KAAK,WAAa,CAAA,EAapB,KAAK,MAAQD,EAAE,CAAC,EAAIA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAI,CAAA,EACtC,KAAK,OAAM,CACf,CAEE,QAAU,CACR,YAAK,QAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,GACpD,KAAK,WAAW,SAClB,KAAK,SAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC,IAExC,KAAK,OAChB,CAEE,UAAY,CACV,OAAO,KAAK,OAChB,CAEE,QAASG,EAAO,CAEd,GADAlB,EAAM,iBAAkB,KAAK,QAAS,KAAK,QAASkB,CAAK,EACrD,EAAEA,aAAiBN,GAAS,CAC9B,GAAI,OAAOM,GAAU,UAAYA,IAAU,KAAK,QAC9C,MAAO,GAETA,EAAQ,IAAIN,EAAOM,EAAO,KAAK,OAAO,CAC5C,CAEI,OAAIA,EAAM,UAAY,KAAK,QAClB,EAGF,KAAK,YAAYA,CAAK,GAAK,KAAK,WAAWA,CAAK,CAC3D,CAEE,YAAaA,EAAO,CAKlB,OAJMA,aAAiBN,IACrBM,EAAQ,IAAIN,EAAOM,EAAO,KAAK,OAAO,GAGpC,KAAK,MAAQA,EAAM,MACd,GAEL,KAAK,MAAQA,EAAM,MACd,EAEL,KAAK,MAAQA,EAAM,MACd,GAEL,KAAK,MAAQA,EAAM,MACd,EAEL,KAAK,MAAQA,EAAM,MACd,GAEL,KAAK,MAAQA,EAAM,MACd,EAEF,CACX,CAEE,WAAYA,EAAO,CAMjB,GALMA,aAAiBN,IACrBM,EAAQ,IAAIN,EAAOM,EAAO,KAAK,OAAO,GAIpC,KAAK,WAAW,QAAU,CAACA,EAAM,WAAW,OAC9C,MAAO,GACF,GAAI,CAAC,KAAK,WAAW,QAAUA,EAAM,WAAW,OACrD,MAAO,GACF,GAAI,CAAC,KAAK,WAAW,QAAU,CAACA,EAAM,WAAW,OACtD,MAAO,GAGT,IAAIC,EAAI,EACR,EAAG,CACD,MAAMC,EAAI,KAAK,WAAWD,CAAC,EACrBE,EAAIH,EAAM,WAAWC,CAAC,EAE5B,GADAnB,EAAM,qBAAsBmB,EAAGC,EAAGC,CAAC,EAC/BD,IAAM,QAAaC,IAAM,OAC3B,MAAO,GACF,GAAIA,IAAM,OACf,MAAO,GACF,GAAID,IAAM,OACf,MAAO,GACF,GAAIA,IAAMC,EACf,SAEA,OAAOX,EAAmBU,EAAGC,CAAC,CAEtC,OAAa,EAAEF,EACf,CAEE,aAAcD,EAAO,CACbA,aAAiBN,IACrBM,EAAQ,IAAIN,EAAOM,EAAO,KAAK,OAAO,GAGxC,IAAIC,EAAI,EACR,EAAG,CACD,MAAMC,EAAI,KAAK,MAAMD,CAAC,EAChBE,EAAIH,EAAM,MAAMC,CAAC,EAEvB,GADAnB,EAAM,gBAAiBmB,EAAGC,EAAGC,CAAC,EAC1BD,IAAM,QAAaC,IAAM,OAC3B,MAAO,GACF,GAAIA,IAAM,OACf,MAAO,GACF,GAAID,IAAM,OACf,MAAO,GACF,GAAIA,IAAMC,EACf,SAEA,OAAOX,EAAmBU,EAAGC,CAAC,CAEtC,OAAa,EAAEF,EACf,CAIE,IAAKG,EAASC,EAAYC,EAAgB,CACxC,GAAIF,EAAQ,WAAW,KAAK,EAAG,CAC7B,GAAI,CAACC,GAAcC,IAAmB,GACpC,MAAM,IAAI,MAAM,iDAAiD,EAGnE,GAAID,EAAY,CACd,MAAME,EAAQ,IAAIF,CAAU,GAAG,MAAM,KAAK,QAAQ,MAAQlB,EAAGC,EAAE,eAAe,EAAID,EAAGC,EAAE,UAAU,CAAC,EAClG,GAAI,CAACmB,GAASA,EAAM,CAAC,IAAMF,EACzB,MAAM,IAAI,MAAM,uBAAuBA,CAAU,EAAE,CAE7D,CACA,CAEI,OAAQD,EAAO,CACb,IAAK,WACH,KAAK,WAAW,OAAS,EACzB,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,QACL,KAAK,IAAI,MAAOC,EAAYC,CAAc,EAC1C,MACF,IAAK,WACH,KAAK,WAAW,OAAS,EACzB,KAAK,MAAQ,EACb,KAAK,QACL,KAAK,IAAI,MAAOD,EAAYC,CAAc,EAC1C,MACF,IAAK,WAIH,KAAK,WAAW,OAAS,EACzB,KAAK,IAAI,QAASD,EAAYC,CAAc,EAC5C,KAAK,IAAI,MAAOD,EAAYC,CAAc,EAC1C,MAGF,IAAK,aACC,KAAK,WAAW,SAAW,GAC7B,KAAK,IAAI,QAASD,EAAYC,CAAc,EAE9C,KAAK,IAAI,MAAOD,EAAYC,CAAc,EAC1C,MACF,IAAK,UACH,GAAI,KAAK,WAAW,SAAW,EAC7B,MAAM,IAAI,MAAM,WAAW,KAAK,GAAG,sBAAsB,EAE3D,KAAK,WAAW,OAAS,EACzB,MAEF,IAAK,SAMD,KAAK,QAAU,GACf,KAAK,QAAU,GACf,KAAK,WAAW,SAAW,IAE3B,KAAK,QAEP,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,WAAa,CAAA,EAClB,MACF,IAAK,SAKC,KAAK,QAAU,GAAK,KAAK,WAAW,SAAW,IACjD,KAAK,QAEP,KAAK,MAAQ,EACb,KAAK,WAAa,CAAA,EAClB,MACF,IAAK,QAKC,KAAK,WAAW,SAAW,GAC7B,KAAK,QAEP,KAAK,WAAa,CAAA,EAClB,MAGF,IAAK,MAAO,CACV,MAAME,EAAO,OAAOF,CAAc,EAAI,EAAI,EAE1C,GAAI,KAAK,WAAW,SAAW,EAC7B,KAAK,WAAa,CAACE,CAAI,MAClB,CACL,IAAI,EAAI,KAAK,WAAW,OACxB,KAAO,EAAE,GAAK,GACR,OAAO,KAAK,WAAW,CAAC,GAAM,WAChC,KAAK,WAAW,CAAC,IACjB,EAAI,IAGR,GAAI,IAAM,GAAI,CAEZ,GAAIH,IAAe,KAAK,WAAW,KAAK,GAAG,GAAKC,IAAmB,GACjE,MAAM,IAAI,MAAM,uDAAuD,EAEzE,KAAK,WAAW,KAAKE,CAAI,CACrC,CACA,CACQ,GAAIH,EAAY,CAGd,IAAII,EAAa,CAACJ,EAAYG,CAAI,EAC9BF,IAAmB,KACrBG,EAAa,CAACJ,CAAU,GAEtBb,EAAmB,KAAK,WAAW,CAAC,EAAGa,CAAU,IAAM,EACrD,MAAM,KAAK,WAAW,CAAC,CAAC,IAC1B,KAAK,WAAaI,GAGpB,KAAK,WAAaA,CAE9B,CACQ,KACR,CACM,QACE,MAAM,IAAI,MAAM,+BAA+BL,CAAO,EAAE,CAChE,CACI,YAAK,IAAM,KAAK,OAAM,EAClB,KAAK,MAAM,SACb,KAAK,KAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC,IAE/B,IACX,CACA,CAEA,OAAAM,EAAiBhB","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.es.js

@@ -1,170 +0,0 @@
-import { __require as w } from "../internal/debug.es.js";
-import { __require as g } from "../internal/constants.es.js";
-import { __require as E } from "../internal/re.es.js";
-import { __require as b } from "../internal/parse-options.es.js";
-import { __require as d } from "../internal/identifiers.es.js";
-var c, f;
-function k() {
-  if (f) return c;
-  f = 1;
-  const a = w(), { MAX_LENGTH: u, MAX_SAFE_INTEGER: h } = g(), { safeRe: l, t: o } = E(), m = b(), { compareIdentifiers: p } = d();
-  class n {
-    constructor(e, r) {
-      if (r = m(r), e instanceof n) {
-        if (e.loose === !!r.loose && e.includePrerelease === !!r.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`
-        );
-      a("SemVer", e, r), this.options = r, this.loose = !!r.loose, this.includePrerelease = !!r.includePrerelease;
-      const s = e.trim().match(r.loose ? l[o.LOOSE] : l[o.FULL]);
-      if (!s)
-        throw new TypeError(`Invalid Version: ${e}`);
-      if (this.raw = e, this.major = +s[1], this.minor = +s[2], this.patch = +s[3], this.major > h || this.major < 0)
-        throw new TypeError("Invalid major version");
-      if (this.minor > h || this.minor < 0)
-        throw new TypeError("Invalid minor version");
-      if (this.patch > h || this.patch < 0)
-        throw new TypeError("Invalid patch version");
-      s[4] ? this.prerelease = s[4].split(".").map((t) => {
-        if (/^[0-9]+$/.test(t)) {
-          const i = +t;
-          if (i >= 0 && i < h)
-            return i;
-        }
-        return t;
-      }) : this.prerelease = [], this.build = s[5] ? s[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 (a("SemVer.compare", this.version, this.options, e), !(e instanceof n)) {
-        if (typeof e == "string" && e === this.version)
-          return 0;
-        e = new n(e, this.options);
-      }
-      return e.version === this.version ? 0 : this.compareMain(e) || this.comparePre(e);
-    }
-    compareMain(e) {
-      return e instanceof n || (e = new n(e, this.options)), this.major < e.major ? -1 : this.major > e.major ? 1 : this.minor < e.minor ? -1 : this.minor > e.minor ? 1 : this.patch < e.patch ? -1 : this.patch > e.patch ? 1 : 0;
-    }
-    comparePre(e) {
-      if (e instanceof n || (e = new n(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 r = 0;
-      do {
-        const s = this.prerelease[r], t = e.prerelease[r];
-        if (a("prerelease compare", r, s, t), s === void 0 && t === void 0)
-          return 0;
-        if (t === void 0)
-          return 1;
-        if (s === void 0)
-          return -1;
-        if (s === t)
-          continue;
-        return p(s, t);
-      } while (++r);
-    }
-    compareBuild(e) {
-      e instanceof n || (e = new n(e, this.options));
-      let r = 0;
-      do {
-        const s = this.build[r], t = e.build[r];
-        if (a("build compare", r, s, t), s === void 0 && t === void 0)
-          return 0;
-        if (t === void 0)
-          return 1;
-        if (s === void 0)
-          return -1;
-        if (s === t)
-          continue;
-        return p(s, t);
-      } while (++r);
-    }
-    // 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, r, s) {
-      if (e.startsWith("pre")) {
-        if (!r && s === !1)
-          throw new Error("invalid increment argument: identifier is empty");
-        if (r) {
-          const t = `-${r}`.match(this.options.loose ? l[o.PRERELEASELOOSE] : l[o.PRERELEASE]);
-          if (!t || t[1] !== r)
-            throw new Error(`invalid identifier: ${r}`);
-        }
-      }
-      switch (e) {
-        case "premajor":
-          this.prerelease.length = 0, this.patch = 0, this.minor = 0, this.major++, this.inc("pre", r, s);
-          break;
-        case "preminor":
-          this.prerelease.length = 0, this.patch = 0, this.minor++, this.inc("pre", r, s);
-          break;
-        case "prepatch":
-          this.prerelease.length = 0, this.inc("patch", r, s), this.inc("pre", r, s);
-          break;
-        // If the input is a non-prerelease version, this acts the same as
-        // prepatch.
-        case "prerelease":
-          this.prerelease.length === 0 && this.inc("patch", r, s), this.inc("pre", r, s);
-          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 t = Number(s) ? 1 : 0;
-          if (this.prerelease.length === 0)
-            this.prerelease = [t];
-          else {
-            let i = this.prerelease.length;
-            for (; --i >= 0; )
-              typeof this.prerelease[i] == "number" && (this.prerelease[i]++, i = -2);
-            if (i === -1) {
-              if (r === this.prerelease.join(".") && s === !1)
-                throw new Error("invalid increment argument: identifier already exists");
-              this.prerelease.push(t);
-            }
-          }
-          if (r) {
-            let i = [r, t];
-            s === !1 && (i = [r]), p(this.prerelease[0], r) === 0 ? isNaN(this.prerelease[1]) && (this.prerelease = i) : this.prerelease = i;
-          }
-          break;
-        }
-        default:
-          throw new Error(`invalid increment argument: ${e}`);
-      }
-      return this.raw = this.format(), this.build.length && (this.raw += `+${this.build.join(".")}`), this;
-    }
-  }
-  return c = n, c;
-}
-export {
-  k as __require
-};
-//# sourceMappingURL=semver.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"semver.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/classes/semver.js"],"sourcesContent":["'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n  constructor (version, options) {\n    options = parseOptions(options)\n\n    if (version instanceof SemVer) {\n      if (version.loose === !!options.loose &&\n        version.includePrerelease === !!options.includePrerelease) {\n        return version\n      } else {\n        version = version.version\n      }\n    } else if (typeof version !== 'string') {\n      throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new TypeError(\n        `version is longer than ${MAX_LENGTH} characters`\n      )\n    }\n\n    debug('SemVer', version, options)\n    this.options = options\n    this.loose = !!options.loose\n    // this isn't actually relevant for versions, but keep it so that we\n    // don't run into trouble passing this.options around.\n    this.includePrerelease = !!options.includePrerelease\n\n    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n    if (!m) {\n      throw new TypeError(`Invalid Version: ${version}`)\n    }\n\n    this.raw = version\n\n    // these are actually numbers\n    this.major = +m[1]\n    this.minor = +m[2]\n    this.patch = +m[3]\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new TypeError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new TypeError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new TypeError('Invalid patch version')\n    }\n\n    // numberify any prerelease numeric ids\n    if (!m[4]) {\n      this.prerelease = []\n    } else {\n      this.prerelease = m[4].split('.').map((id) => {\n        if (/^[0-9]+$/.test(id)) {\n          const num = +id\n          if (num >= 0 && num < MAX_SAFE_INTEGER) {\n            return num\n          }\n        }\n        return id\n      })\n    }\n\n    this.build = m[5] ? m[5].split('.') : []\n    this.format()\n  }\n\n  format () {\n    this.version = `${this.major}.${this.minor}.${this.patch}`\n    if (this.prerelease.length) {\n      this.version += `-${this.prerelease.join('.')}`\n    }\n    return this.version\n  }\n\n  toString () {\n    return this.version\n  }\n\n  compare (other) {\n    debug('SemVer.compare', this.version, this.options, other)\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other, this.options)\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    if (this.major < other.major) {\n      return -1\n    }\n    if (this.major > other.major) {\n      return 1\n    }\n    if (this.minor < other.minor) {\n      return -1\n    }\n    if (this.minor > other.minor) {\n      return 1\n    }\n    if (this.patch < other.patch) {\n      return -1\n    }\n    if (this.patch > other.patch) {\n      return 1\n    }\n    return 0\n  }\n\n  comparePre (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    // NOT having a prerelease is > having one\n    if (this.prerelease.length && !other.prerelease.length) {\n      return -1\n    } else if (!this.prerelease.length && other.prerelease.length) {\n      return 1\n    } else if (!this.prerelease.length && !other.prerelease.length) {\n      return 0\n    }\n\n    let i = 0\n    do {\n      const a = this.prerelease[i]\n      const b = other.prerelease[i]\n      debug('prerelease compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  compareBuild (other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other, this.options)\n    }\n\n    let i = 0\n    do {\n      const a = this.build[i]\n      const b = other.build[i]\n      debug('build compare', i, a, b)\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n\n  // preminor will bump the version up to the next minor release, and immediately\n  // down to pre-release. premajor and prepatch work the same way.\n  inc (release, identifier, identifierBase) {\n    if (release.startsWith('pre')) {\n      if (!identifier && identifierBase === false) {\n        throw new Error('invalid increment argument: identifier is empty')\n      }\n      // Avoid an invalid semver results\n      if (identifier) {\n        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n        if (!match || match[1] !== identifier) {\n          throw new Error(`invalid identifier: ${identifier}`)\n        }\n      }\n    }\n\n    switch (release) {\n      case 'premajor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor = 0\n        this.major++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'preminor':\n        this.prerelease.length = 0\n        this.patch = 0\n        this.minor++\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'prepatch':\n        // If this is already a prerelease, it will bump to the next version\n        // drop any prereleases that might already exist, since they are not\n        // relevant at this point.\n        this.prerelease.length = 0\n        this.inc('patch', identifier, identifierBase)\n        this.inc('pre', identifier, identifierBase)\n        break\n      // If the input is a non-prerelease version, this acts the same as\n      // prepatch.\n      case 'prerelease':\n        if (this.prerelease.length === 0) {\n          this.inc('patch', identifier, identifierBase)\n        }\n        this.inc('pre', identifier, identifierBase)\n        break\n      case 'release':\n        if (this.prerelease.length === 0) {\n          throw new Error(`version ${this.raw} is not a prerelease`)\n        }\n        this.prerelease.length = 0\n        break\n\n      case 'major':\n        // If this is a pre-major version, bump up to the same major version.\n        // Otherwise increment major.\n        // 1.0.0-5 bumps to 1.0.0\n        // 1.1.0 bumps to 2.0.0\n        if (\n          this.minor !== 0 ||\n          this.patch !== 0 ||\n          this.prerelease.length === 0\n        ) {\n          this.major++\n        }\n        this.minor = 0\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'minor':\n        // If this is a pre-minor version, bump up to the same minor version.\n        // Otherwise increment minor.\n        // 1.2.0-5 bumps to 1.2.0\n        // 1.2.1 bumps to 1.3.0\n        if (this.patch !== 0 || this.prerelease.length === 0) {\n          this.minor++\n        }\n        this.patch = 0\n        this.prerelease = []\n        break\n      case 'patch':\n        // If this is not a pre-release version, it will increment the patch.\n        // If it is a pre-release it will bump up to the same patch version.\n        // 1.2.0-5 patches to 1.2.0\n        // 1.2.0 patches to 1.2.1\n        if (this.prerelease.length === 0) {\n          this.patch++\n        }\n        this.prerelease = []\n        break\n      // This probably shouldn't be used publicly.\n      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n      case 'pre': {\n        const base = Number(identifierBase) ? 1 : 0\n\n        if (this.prerelease.length === 0) {\n          this.prerelease = [base]\n        } else {\n          let i = this.prerelease.length\n          while (--i >= 0) {\n            if (typeof this.prerelease[i] === 'number') {\n              this.prerelease[i]++\n              i = -2\n            }\n          }\n          if (i === -1) {\n            // didn't increment anything\n            if (identifier === this.prerelease.join('.') && identifierBase === false) {\n              throw new Error('invalid increment argument: identifier already exists')\n            }\n            this.prerelease.push(base)\n          }\n        }\n        if (identifier) {\n          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n          let prerelease = [identifier, base]\n          if (identifierBase === false) {\n            prerelease = [identifier]\n          }\n          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n            if (isNaN(this.prerelease[1])) {\n              this.prerelease = prerelease\n            }\n          } else {\n            this.prerelease = prerelease\n          }\n        }\n        break\n      }\n      default:\n        throw new Error(`invalid increment argument: ${release}`)\n    }\n    this.raw = this.format()\n    if (this.build.length) {\n      this.raw += `+${this.build.join('.')}`\n    }\n    return this\n  }\n}\n\nmodule.exports = SemVer\n"],"names":["debug","require$$0","MAX_LENGTH","MAX_SAFE_INTEGER","require$$1","re","t","require$$2","parseOptions","require$$3","compareIdentifiers","require$$4","SemVer","version","options","m","id","num","other","i","a","b","release","identifier","identifierBase","match","base","prerelease","semver"],"mappings":";;;;;;;;;AAEA,QAAMA,IAAQC,EAAA,GACR,EAAE,YAAAC,GAAY,kBAAAC,EAAgB,IAAKC,EAAA,GACnC,EAAE,QAAQC,GAAI,GAAAC,EAAC,IAAKC,EAAA,GAEpBC,IAAeC,EAAA,GACf,EAAE,oBAAAC,EAAkB,IAAKC,EAAA;AAAA,EAC/B,MAAMC,EAAO;AAAA,IACX,YAAaC,GAASC,GAAS;AAG7B,UAFAA,IAAUN,EAAaM,CAAO,GAE1BD,aAAmBD,GAAQ;AAC7B,YAAIC,EAAQ,UAAU,CAAC,CAACC,EAAQ,SAC9BD,EAAQ,sBAAsB,CAAC,CAACC,EAAQ;AACxC,iBAAOD;AAEP,QAAAA,IAAUA,EAAQ;AAAA,MAE1B,WAAe,OAAOA,KAAY;AAC5B,cAAM,IAAI,UAAU,gDAAgD,OAAOA,CAAO,IAAI;AAGxF,UAAIA,EAAQ,SAASX;AACnB,cAAM,IAAI;AAAA,UACR,0BAA0BA,CAAU;AAAA,QAC5C;AAGI,MAAAF,EAAM,UAAUa,GAASC,CAAO,GAChC,KAAK,UAAUA,GACf,KAAK,QAAQ,CAAC,CAACA,EAAQ,OAGvB,KAAK,oBAAoB,CAAC,CAACA,EAAQ;AAEnC,YAAMC,IAAIF,EAAQ,KAAI,EAAG,MAAMC,EAAQ,QAAQT,EAAGC,EAAE,KAAK,IAAID,EAAGC,EAAE,IAAI,CAAC;AAEvE,UAAI,CAACS;AACH,cAAM,IAAI,UAAU,oBAAoBF,CAAO,EAAE;AAUnD,UAPA,KAAK,MAAMA,GAGX,KAAK,QAAQ,CAACE,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GACjB,KAAK,QAAQ,CAACA,EAAE,CAAC,GAEb,KAAK,QAAQZ,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAG7C,UAAI,KAAK,QAAQA,KAAoB,KAAK,QAAQ;AAChD,cAAM,IAAI,UAAU,uBAAuB;AAI7C,MAAKY,EAAE,CAAC,IAGN,KAAK,aAAaA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAI,CAACC,MAAO;AAC5C,YAAI,WAAW,KAAKA,CAAE,GAAG;AACvB,gBAAMC,IAAM,CAACD;AACb,cAAIC,KAAO,KAAKA,IAAMd;AACpB,mBAAOc;AAAA,QAEnB;AACQ,eAAOD;AAAA,MACf,CAAO,IAVD,KAAK,aAAa,CAAA,GAapB,KAAK,QAAQD,EAAE,CAAC,IAAIA,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA,GACtC,KAAK,OAAM;AAAA,IACf;AAAA,IAEE,SAAU;AACR,kBAAK,UAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IACpD,KAAK,WAAW,WAClB,KAAK,WAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC,KAExC,KAAK;AAAA,IAChB;AAAA,IAEE,WAAY;AACV,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAASG,GAAO;AAEd,UADAlB,EAAM,kBAAkB,KAAK,SAAS,KAAK,SAASkB,CAAK,GACrD,EAAEA,aAAiBN,IAAS;AAC9B,YAAI,OAAOM,KAAU,YAAYA,MAAU,KAAK;AAC9C,iBAAO;AAET,QAAAA,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAAA,MAC5C;AAEI,aAAIA,EAAM,YAAY,KAAK,UAClB,IAGF,KAAK,YAAYA,CAAK,KAAK,KAAK,WAAWA,CAAK;AAAA,IAC3D;AAAA,IAEE,YAAaA,GAAO;AAKlB,aAJMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAGpC,KAAK,QAAQA,EAAM,QACd,KAEL,KAAK,QAAQA,EAAM,QACd,IAEL,KAAK,QAAQA,EAAM,QACd,KAEL,KAAK,QAAQA,EAAM,QACd,IAEL,KAAK,QAAQA,EAAM,QACd,KAEL,KAAK,QAAQA,EAAM,QACd,IAEF;AAAA,IACX;AAAA,IAEE,WAAYA,GAAO;AAMjB,UALMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO,IAIpC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AAC9C,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAUA,EAAM,WAAW;AACrD,eAAO;AACF,UAAI,CAAC,KAAK,WAAW,UAAU,CAACA,EAAM,WAAW;AACtD,eAAO;AAGT,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,WAAWD,CAAC,GACrBE,IAAIH,EAAM,WAAWC,CAAC;AAE5B,YADAnB,EAAM,sBAAsBmB,GAAGC,GAAGC,CAAC,GAC/BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEtC,SAAa,EAAEF;AAAA,IACf;AAAA,IAEE,aAAcD,GAAO;AACnB,MAAMA,aAAiBN,MACrBM,IAAQ,IAAIN,EAAOM,GAAO,KAAK,OAAO;AAGxC,UAAIC,IAAI;AACR,SAAG;AACD,cAAMC,IAAI,KAAK,MAAMD,CAAC,GAChBE,IAAIH,EAAM,MAAMC,CAAC;AAEvB,YADAnB,EAAM,iBAAiBmB,GAAGC,GAAGC,CAAC,GAC1BD,MAAM,UAAaC,MAAM;AAC3B,iBAAO;AACF,YAAIA,MAAM;AACf,iBAAO;AACF,YAAID,MAAM;AACf,iBAAO;AACF,YAAIA,MAAMC;AACf;AAEA,eAAOX,EAAmBU,GAAGC,CAAC;AAAA,MAEtC,SAAa,EAAEF;AAAA,IACf;AAAA;AAAA;AAAA,IAIE,IAAKG,GAASC,GAAYC,GAAgB;AACxC,UAAIF,EAAQ,WAAW,KAAK,GAAG;AAC7B,YAAI,CAACC,KAAcC,MAAmB;AACpC,gBAAM,IAAI,MAAM,iDAAiD;AAGnE,YAAID,GAAY;AACd,gBAAME,IAAQ,IAAIF,CAAU,GAAG,MAAM,KAAK,QAAQ,QAAQlB,EAAGC,EAAE,eAAe,IAAID,EAAGC,EAAE,UAAU,CAAC;AAClG,cAAI,CAACmB,KAASA,EAAM,CAAC,MAAMF;AACzB,kBAAM,IAAI,MAAM,uBAAuBA,CAAU,EAAE;AAAA,QAE7D;AAAA,MACA;AAEI,cAAQD,GAAO;AAAA,QACb,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOC,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,eAAK,WAAW,SAAS,GACzB,KAAK,QAAQ,GACb,KAAK,SACL,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AAIH,eAAK,WAAW,SAAS,GACzB,KAAK,IAAI,SAASD,GAAYC,CAAc,GAC5C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA;AAAA;AAAA,QAGF,KAAK;AACH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,IAAI,SAASD,GAAYC,CAAc,GAE9C,KAAK,IAAI,OAAOD,GAAYC,CAAc;AAC1C;AAAA,QACF,KAAK;AACH,cAAI,KAAK,WAAW,WAAW;AAC7B,kBAAM,IAAI,MAAM,WAAW,KAAK,GAAG,sBAAsB;AAE3D,eAAK,WAAW,SAAS;AACzB;AAAA,QAEF,KAAK;AAKH,WACE,KAAK,UAAU,KACf,KAAK,UAAU,KACf,KAAK,WAAW,WAAW,MAE3B,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,WAAI,KAAK,UAAU,KAAK,KAAK,WAAW,WAAW,MACjD,KAAK,SAEP,KAAK,QAAQ,GACb,KAAK,aAAa,CAAA;AAClB;AAAA,QACF,KAAK;AAKH,UAAI,KAAK,WAAW,WAAW,KAC7B,KAAK,SAEP,KAAK,aAAa,CAAA;AAClB;AAAA;AAAA;AAAA,QAGF,KAAK,OAAO;AACV,gBAAME,IAAO,OAAOF,CAAc,IAAI,IAAI;AAE1C,cAAI,KAAK,WAAW,WAAW;AAC7B,iBAAK,aAAa,CAACE,CAAI;AAAA,eAClB;AACL,gBAAI,IAAI,KAAK,WAAW;AACxB,mBAAO,EAAE,KAAK;AACZ,cAAI,OAAO,KAAK,WAAW,CAAC,KAAM,aAChC,KAAK,WAAW,CAAC,KACjB,IAAI;AAGR,gBAAI,MAAM,IAAI;AAEZ,kBAAIH,MAAe,KAAK,WAAW,KAAK,GAAG,KAAKC,MAAmB;AACjE,sBAAM,IAAI,MAAM,uDAAuD;AAEzE,mBAAK,WAAW,KAAKE,CAAI;AAAA,YACrC;AAAA,UACA;AACQ,cAAIH,GAAY;AAGd,gBAAII,IAAa,CAACJ,GAAYG,CAAI;AAClC,YAAIF,MAAmB,OACrBG,IAAa,CAACJ,CAAU,IAEtBb,EAAmB,KAAK,WAAW,CAAC,GAAGa,CAAU,MAAM,IACrD,MAAM,KAAK,WAAW,CAAC,CAAC,MAC1B,KAAK,aAAaI,KAGpB,KAAK,aAAaA;AAAA,UAE9B;AACQ;AAAA,QACR;AAAA,QACM;AACE,gBAAM,IAAI,MAAM,+BAA+BL,CAAO,EAAE;AAAA,MAChE;AACI,kBAAK,MAAM,KAAK,OAAM,GAClB,KAAK,MAAM,WACb,KAAK,OAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC,KAE/B;AAAA,IACX;AAAA,EACA;AAEA,SAAAM,IAAiBhB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./parse.cjs.js");var e,n;function c(){if(n)return e;n=1;const t=i.__require();return e=(a,u)=>{const r=t(a.trim().replace(/^[=v]+/,""),u);return r?r.version:null},e}exports.__require=c;
-//# sourceMappingURL=clean.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"clean.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.js"],"sourcesContent":["'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n"],"names":["parse","require$$0","clean_1","version","options","s"],"mappings":"yJAEA,MAAMA,EAAQC,EAAAA,UAAA,EAKd,OAAAC,EAJc,CAACC,EAASC,IAAY,CAClC,MAAMC,EAAIL,EAAMG,EAAQ,KAAI,EAAG,QAAQ,SAAU,EAAE,EAAGC,CAAO,EAC7D,OAAOC,EAAIA,EAAE,QAAU,IACzB","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.es.js

@@ -1,15 +0,0 @@
-import { __require as t } from "./parse.es.js";
-var r, n;
-function l() {
-  if (n) return r;
-  n = 1;
-  const a = t();
-  return r = (i, s) => {
-    const e = a(i.trim().replace(/^[=v]+/, ""), s);
-    return e ? e.version : null;
-  }, r;
-}
-export {
-  l as __require
-};
-//# sourceMappingURL=clean.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"clean.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/clean.js"],"sourcesContent":["'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n"],"names":["parse","require$$0","clean_1","version","options","s"],"mappings":";;;;;AAEA,QAAMA,IAAQC,EAAA;AAKd,SAAAC,IAJc,CAACC,GAASC,MAAY;AAClC,UAAMC,IAAIL,EAAMG,EAAQ,KAAI,EAAG,QAAQ,UAAU,EAAE,GAAGC,CAAO;AAC7D,WAAOC,IAAIA,EAAE,UAAU;AAAA,EACzB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/cmp.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./eq.cjs.js"),v=require("./neq.cjs.js"),y=require("./gt.cjs.js"),$=require("./gte.cjs.js"),g=require("./lt.cjs.js"),m=require("./lte.cjs.js");var n,i;function a(){if(i)return n;i=1;const u=p.__require(),s=v.__require(),o=y.__require(),q=$.__require(),_=g.__require(),f=m.__require();return n=(e,c,r,t)=>{switch(c){case"===":return typeof e=="object"&&(e=e.version),typeof r=="object"&&(r=r.version),e===r;case"!==":return typeof e=="object"&&(e=e.version),typeof r=="object"&&(r=r.version),e!==r;case"":case"=":case"==":return u(e,r,t);case"!=":return s(e,r,t);case">":return o(e,r,t);case">=":return q(e,r,t);case"<":return _(e,r,t);case"<=":return f(e,r,t);default:throw new TypeError(`Invalid operator: ${c}`)}},n}exports.__require=a;
-//# sourceMappingURL=cmp.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/cmp.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cmp.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/functions/cmp.js"],"sourcesContent":["'use strict'\n\nconst eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n  switch (op) {\n    case '===':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a === b\n\n    case '!==':\n      if (typeof a === 'object') {\n        a = a.version\n      }\n      if (typeof b === 'object') {\n        b = b.version\n      }\n      return a !== b\n\n    case '':\n    case '=':\n    case '==':\n      return eq(a, b, loose)\n\n    case '!=':\n      return neq(a, b, loose)\n\n    case '>':\n      return gt(a, b, loose)\n\n    case '>=':\n      return gte(a, b, loose)\n\n    case '<':\n      return lt(a, b, loose)\n\n    case '<=':\n      return lte(a, b, loose)\n\n    default:\n      throw new TypeError(`Invalid operator: ${op}`)\n  }\n}\nmodule.exports = cmp\n"],"names":["eq","require$$0","neq","require$$1","gt","require$$2","gte","require$$3","lt","require$$4","lte","require$$5","cmp_1","a","op","b","loose"],"mappings":"sRAEA,MAAMA,EAAKC,EAAAA,UAAA,EACLC,EAAMC,EAAAA,UAAA,EACNC,EAAKC,EAAAA,UAAA,EACLC,EAAMC,EAAAA,UAAA,EACNC,EAAKC,EAAAA,UAAA,EACLC,EAAMC,EAAAA,UAAA,EA8CZ,OAAAC,EA5CY,CAACC,EAAGC,EAAIC,EAAGC,IAAU,CAC/B,OAAQF,EAAE,CACR,IAAK,MACH,OAAI,OAAOD,GAAM,WACfA,EAAIA,EAAE,SAEJ,OAAOE,GAAM,WACfA,EAAIA,EAAE,SAEDF,IAAME,EAEf,IAAK,MACH,OAAI,OAAOF,GAAM,WACfA,EAAIA,EAAE,SAEJ,OAAOE,GAAM,WACfA,EAAIA,EAAE,SAEDF,IAAME,EAEf,IAAK,GACL,IAAK,IACL,IAAK,KACH,OAAOf,EAAGa,EAAGE,EAAGC,CAAK,EAEvB,IAAK,KACH,OAAOd,EAAIW,EAAGE,EAAGC,CAAK,EAExB,IAAK,IACH,OAAOZ,EAAGS,EAAGE,EAAGC,CAAK,EAEvB,IAAK,KACH,OAAOV,EAAIO,EAAGE,EAAGC,CAAK,EAExB,IAAK,IACH,OAAOR,EAAGK,EAAGE,EAAGC,CAAK,EAEvB,IAAK,KACH,OAAON,EAAIG,EAAGE,EAAGC,CAAK,EAExB,QACE,MAAM,IAAI,UAAU,qBAAqBF,CAAE,EAAE,CACnD,CACA","x_google_ignoreList":[0]}