langgraph-ui-components 0.0.27 → 0.0.29

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

@@ -1 +0,0 @@
-{"version":3,"file":"re.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/internal/re.js"],"sourcesContent":["'use strict'\n\nconst {\n  MAX_SAFE_COMPONENT_LENGTH,\n  MAX_SAFE_BUILD_LENGTH,\n  MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst safeSrc = exports.safeSrc = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n  ['\\\\s', 1],\n  ['\\\\d', MAX_LENGTH],\n  [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n  for (const [token, max] of safeRegexReplacements) {\n    value = value\n      .split(`${token}*`).join(`${token}{0,${max}}`)\n      .split(`${token}+`).join(`${token}{1,${max}}`)\n  }\n  return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n  const safe = makeSafeRegex(value)\n  const index = R++\n  debug(name, index, value)\n  t[name] = index\n  src[index] = value\n  safeSrc[index] = safe\n  re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n  safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n                   `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n// Non-numberic identifiers include numberic identifiers but can be longer.\n// Therefore non-numberic identifiers must go first.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups.  The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n  src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifer, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n                   `(?:${src[t.PRERELEASE]})?${\n                     src[t.BUILD]}?` +\n                   `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n                        `(?:${src[t.PRERELEASELOOSE]})?${\n                          src[t.BUILD]}?` +\n                        `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n              '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n              `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n              `(?:${src[t.PRERELEASE]})?` +\n              `(?:${src[t.BUILD]})?` +\n              `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s+-\\\\s+` +\n                   `(${src[t.XRANGEPLAIN]})` +\n                   `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s+-\\\\s+` +\n                        `(${src[t.XRANGEPLAINLOOSE]})` +\n                        `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n"],"names":["MAX_SAFE_COMPONENT_LENGTH","MAX_SAFE_BUILD_LENGTH","MAX_LENGTH","require$$0","debug","require$$1","exports","module","re","safeRe","src","safeSrc","t","R","LETTERDASHNUMBER","safeRegexReplacements","makeSafeRegex","value","token","max","createToken","name","isGlobal","safe","index"],"mappings":";;;;;;AAEA,UAAM;AAAA,MACJ,2BAAAA;AAAA,MACA,uBAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAIC,EAAA,GACEC,IAAQC,EAAA;AACdC,IAAAA,IAAUC,EAAA,UAAiB,CAAA;AAG3B,UAAMC,IAAKF,EAAA,KAAa,CAAA,GAClBG,IAASH,EAAA,SAAiB,CAAA,GAC1BI,IAAMJ,EAAA,MAAc,CAAA,GACpBK,IAAUL,EAAA,UAAkB,CAAA,GAC5BM,IAAIN,EAAA,IAAY,CAAA;AACtB,QAAIO,IAAI;AAER,UAAMC,IAAmB,gBAQnBC,IAAwB;AAAA,MAC5B,CAAC,OAAO,CAAC;AAAA,MACT,CAAC,OAAOb,CAAU;AAAA,MAClB,CAACY,GAAkBb,CAAqB;AAAA,IAC1C,GAEMe,IAAgB,CAACC,MAAU;AAC/B,iBAAW,CAACC,GAAOC,CAAG,KAAKJ;AACzB,QAAAE,IAAQA,EACL,MAAM,GAAGC,CAAK,GAAG,EAAE,KAAK,GAAGA,CAAK,MAAMC,CAAG,GAAG,EAC5C,MAAM,GAAGD,CAAK,GAAG,EAAE,KAAK,GAAGA,CAAK,MAAMC,CAAG,GAAG;AAEjD,aAAOF;AAAA,IACT,GAEMG,IAAc,CAACC,GAAMJ,GAAOK,MAAa;AAC7C,YAAMC,IAAOP,EAAcC,CAAK,GAC1BO,IAAQX;AACd,MAAAT,EAAMiB,GAAMG,GAAOP,CAAK,GACxBL,EAAES,CAAI,IAAIG,GACVd,EAAIc,CAAK,IAAIP,GACbN,EAAQa,CAAK,IAAID,GACjBf,EAAGgB,CAAK,IAAI,IAAI,OAAOP,GAAOK,IAAW,MAAM,MAAS,GACxDb,EAAOe,CAAK,IAAI,IAAI,OAAOD,GAAMD,IAAW,MAAM,MAAS;AAAA,IAC7D;AAQA,IAAAF,EAAY,qBAAqB,aAAa,GAC9CA,EAAY,0BAA0B,MAAM,GAM5CA,EAAY,wBAAwB,gBAAgBN,CAAgB,GAAG,GAKvEM,EAAY,eAAe,IAAIV,EAAIE,EAAE,iBAAiB,CAAC,QAChCF,EAAIE,EAAE,iBAAiB,CAAC,QACxBF,EAAIE,EAAE,iBAAiB,CAAC,GAAG,GAElDQ,EAAY,oBAAoB,IAAIV,EAAIE,EAAE,sBAAsB,CAAC,QACrCF,EAAIE,EAAE,sBAAsB,CAAC,QAC7BF,EAAIE,EAAE,sBAAsB,CAAC,GAAG,GAO5DQ,EAAY,wBAAwB,MAAMV,EAAIE,EAAE,oBAAoB,KAChEF,EAAIE,EAAE,iBAAiB,CAAC,GAAG,GAE/BQ,EAAY,6BAA6B,MAAMV,EAAIE,EAAE,oBAAoB,KACrEF,EAAIE,EAAE,sBAAsB,CAAC,GAAG,GAMpCQ,EAAY,cAAc,QAAQV,EAAIE,EAAE,oBAAoB,UACnDF,EAAIE,EAAE,oBAAoB,CAAC,MAAM,GAE1CQ,EAAY,mBAAmB,SAASV,EAAIE,EAAE,yBAAyB,UAC9DF,EAAIE,EAAE,yBAAyB,CAAC,MAAM,GAK/CQ,EAAY,mBAAmB,GAAGN,CAAgB,GAAG,GAMrDM,EAAY,SAAS,UAAUV,EAAIE,EAAE,eAAe,UAC3CF,EAAIE,EAAE,eAAe,CAAC,MAAM,GAWrCQ,EAAY,aAAa,KAAKV,EAAIE,EAAE,WAAW,IAC5CF,EAAIE,EAAE,UAAU,CAAC,IAClBF,EAAIE,EAAE,KAAK,CAAC,GAAG,GAEjBQ,EAAY,QAAQ,IAAIV,EAAIE,EAAE,SAAS,CAAC,GAAG,GAK3CQ,EAAY,cAAc,WAAWV,EAAIE,EAAE,gBAAgB,IACxDF,EAAIE,EAAE,eAAe,CAAC,IACvBF,EAAIE,EAAE,KAAK,CAAC,GAAG,GAEjBQ,EAAY,SAAS,IAAIV,EAAIE,EAAE,UAAU,CAAC,GAAG,GAE7CQ,EAAY,QAAQ,cAAc,GAKlCA,EAAY,yBAAyB,GAAGV,EAAIE,EAAE,sBAAsB,CAAC,UAAU,GAC/EQ,EAAY,oBAAoB,GAAGV,EAAIE,EAAE,iBAAiB,CAAC,UAAU,GAErEQ,EAAY,eAAe,YAAYV,EAAIE,EAAE,gBAAgB,CAAC,WACjCF,EAAIE,EAAE,gBAAgB,CAAC,WACvBF,EAAIE,EAAE,gBAAgB,CAAC,OAC3BF,EAAIE,EAAE,UAAU,CAAC,KACrBF,EAAIE,EAAE,KAAK,CAAC,OACR,GAEzBQ,EAAY,oBAAoB,YAAYV,EAAIE,EAAE,qBAAqB,CAAC,WACtCF,EAAIE,EAAE,qBAAqB,CAAC,WAC5BF,EAAIE,EAAE,qBAAqB,CAAC,OAChCF,EAAIE,EAAE,eAAe,CAAC,KAC1BF,EAAIE,EAAE,KAAK,CAAC,OACR,GAE9BQ,EAAY,UAAU,IAAIV,EAAIE,EAAE,IAAI,CAAC,OAAOF,EAAIE,EAAE,WAAW,CAAC,GAAG,GACjEQ,EAAY,eAAe,IAAIV,EAAIE,EAAE,IAAI,CAAC,OAAOF,EAAIE,EAAE,gBAAgB,CAAC,GAAG,GAI3EQ,EAAY,eAAe,oBACDpB,CAAyB,kBACrBA,CAAyB,oBACzBA,CAAyB,MAAM,GAC7DoB,EAAY,UAAU,GAAGV,EAAIE,EAAE,WAAW,CAAC,cAAc,GACzDQ,EAAY,cAAcV,EAAIE,EAAE,WAAW,IAC7B,MAAMF,EAAIE,EAAE,UAAU,CAAC,QACjBF,EAAIE,EAAE,KAAK,CAAC,gBACJ,GAC5BQ,EAAY,aAAaV,EAAIE,EAAE,MAAM,GAAG,EAAI,GAC5CQ,EAAY,iBAAiBV,EAAIE,EAAE,UAAU,GAAG,EAAI,GAIpDQ,EAAY,aAAa,SAAS,GAElCA,EAAY,aAAa,SAASV,EAAIE,EAAE,SAAS,CAAC,QAAQ,EAAI,GAC9DN,EAAA,mBAA2B,OAE3Bc,EAAY,SAAS,IAAIV,EAAIE,EAAE,SAAS,CAAC,GAAGF,EAAIE,EAAE,WAAW,CAAC,GAAG,GACjEQ,EAAY,cAAc,IAAIV,EAAIE,EAAE,SAAS,CAAC,GAAGF,EAAIE,EAAE,gBAAgB,CAAC,GAAG,GAI3EQ,EAAY,aAAa,SAAS,GAElCA,EAAY,aAAa,SAASV,EAAIE,EAAE,SAAS,CAAC,QAAQ,EAAI,GAC9DN,EAAA,mBAA2B,OAE3Bc,EAAY,SAAS,IAAIV,EAAIE,EAAE,SAAS,CAAC,GAAGF,EAAIE,EAAE,WAAW,CAAC,GAAG,GACjEQ,EAAY,cAAc,IAAIV,EAAIE,EAAE,SAAS,CAAC,GAAGF,EAAIE,EAAE,gBAAgB,CAAC,GAAG,GAG3EQ,EAAY,mBAAmB,IAAIV,EAAIE,EAAE,IAAI,CAAC,QAAQF,EAAIE,EAAE,UAAU,CAAC,OAAO,GAC9EQ,EAAY,cAAc,IAAIV,EAAIE,EAAE,IAAI,CAAC,QAAQF,EAAIE,EAAE,SAAS,CAAC,OAAO,GAIxEQ,EAAY,kBAAkB,SAASV,EAAIE,EAAE,IAAI,SACzCF,EAAIE,EAAE,UAAU,CAAC,IAAIF,EAAIE,EAAE,WAAW,CAAC,KAAK,EAAI,GACxDN,EAAA,wBAAgC,UAMhCc,EAAY,eAAe,SAASV,EAAIE,EAAE,WAAW,CAAC,cAE/BF,EAAIE,EAAE,WAAW,CAAC,QACf,GAE1BQ,EAAY,oBAAoB,SAASV,EAAIE,EAAE,gBAAgB,CAAC,cAEpCF,EAAIE,EAAE,gBAAgB,CAAC,QACpB,GAG/BQ,EAAY,QAAQ,iBAAiB,GAErCA,EAAY,QAAQ,2BAA2B,GAC/CA,EAAY,WAAW,6BAA6B;AAAA;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/gtr.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./outside.cjs.js");var r,e;function s(){if(e)return r;e=1;const t=n.__require();return r=(u,i,o)=>t(u,i,">",o),r}exports.__require=s;
-//# sourceMappingURL=gtr.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"gtr.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/gtr.js"],"sourcesContent":["'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n"],"names":["outside","require$$0","gtr_1","version","range","options"],"mappings":"2JAGA,MAAMA,EAAUC,EAAAA,UAAA,EAEhB,OAAAC,EADY,CAACC,EAASC,EAAOC,IAAYL,EAAQG,EAASC,EAAO,IAAKC,CAAO","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/gtr.es.js

@@ -1,12 +0,0 @@
-import { __require as s } from "./outside.es.js";
-var r, e;
-function q() {
-  if (e) return r;
-  e = 1;
-  const t = s();
-  return r = (i, u, o) => t(i, u, ">", o), r;
-}
-export {
-  q as __require
-};
-//# sourceMappingURL=gtr.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"gtr.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/gtr.js"],"sourcesContent":["'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n"],"names":["outside","require$$0","gtr_1","version","range","options"],"mappings":";;;;;AAGA,QAAMA,IAAUC,EAAA;AAEhB,SAAAC,IADY,CAACC,GAASC,GAAOC,MAAYL,EAAQG,GAASC,GAAO,KAAKC,CAAO;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/intersects.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("../classes/range.cjs.js");var n,c;function u(){if(c)return n;c=1;const s=i.__require();return n=(e,r,t)=>(e=new s(e,t),r=new s(r,t),e.intersects(r,t)),n}exports.__require=u;
-//# sourceMappingURL=intersects.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"intersects.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/intersects.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n  r1 = new Range(r1, options)\n  r2 = new Range(r2, options)\n  return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n"],"names":["Range","require$$0","intersects_1","r1","r2","options"],"mappings":"kKAEA,MAAMA,EAAQC,EAAAA,UAAA,EAMd,OAAAC,EALmB,CAACC,EAAIC,EAAIC,KAC1BF,EAAK,IAAIH,EAAMG,EAAIE,CAAO,EAC1BD,EAAK,IAAIJ,EAAMI,EAAIC,CAAO,EACnBF,EAAG,WAAWC,EAAIC,CAAO","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/intersects.es.js

@@ -1,12 +0,0 @@
-import { __require as c } from "../classes/range.es.js";
-var n, i;
-function q() {
-  if (i) return n;
-  i = 1;
-  const s = c();
-  return n = (e, r, t) => (e = new s(e, t), r = new s(r, t), e.intersects(r, t)), n;
-}
-export {
-  q as __require
-};
-//# sourceMappingURL=intersects.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"intersects.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/intersects.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n  r1 = new Range(r1, options)\n  r2 = new Range(r2, options)\n  return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n"],"names":["Range","require$$0","intersects_1","r1","r2","options"],"mappings":";;;;;AAEA,QAAMA,IAAQC,EAAA;AAMd,SAAAC,IALmB,CAACC,GAAIC,GAAIC,OAC1BF,IAAK,IAAIH,EAAMG,GAAIE,CAAO,GAC1BD,IAAK,IAAIJ,EAAMI,GAAIC,CAAO,GACnBF,EAAG,WAAWC,GAAIC,CAAO;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/ltr.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./outside.cjs.js");var r,e;function s(){if(e)return r;e=1;const t=n.__require();return r=(u,i,o)=>t(u,i,"<",o),r}exports.__require=s;
-//# sourceMappingURL=ltr.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ltr.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/ltr.js"],"sourcesContent":["'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n"],"names":["outside","require$$0","ltr_1","version","range","options"],"mappings":"2JAEA,MAAMA,EAAUC,EAAAA,UAAA,EAGhB,OAAAC,EADY,CAACC,EAASC,EAAOC,IAAYL,EAAQG,EAASC,EAAO,IAAKC,CAAO","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/ltr.es.js

@@ -1,12 +0,0 @@
-import { __require as s } from "./outside.es.js";
-var r, e;
-function q() {
-  if (e) return r;
-  e = 1;
-  const t = s();
-  return r = (i, u, o) => t(i, u, "<", o), r;
-}
-export {
-  q as __require
-};
-//# sourceMappingURL=ltr.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ltr.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/ltr.js"],"sourcesContent":["'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n"],"names":["outside","require$$0","ltr_1","version","range","options"],"mappings":";;;;;AAEA,QAAMA,IAAUC,EAAA;AAGhB,SAAAC,IADY,CAACC,GAASC,GAAOC,MAAYL,EAAQG,GAASC,GAAO,KAAKC,CAAO;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("../classes/semver.cjs.js"),o=require("../classes/range.cjs.js");var t,u;function m(){if(u)return t;u=1;const l=g.__require(),s=o.__require();return t=(c,f,n)=>{let e=null,a=null,i=null;try{i=new s(f,n)}catch{return null}return c.forEach(r=>{i.test(r)&&(!e||a.compare(r)===-1)&&(e=r,a=new l(e,n))}),e},t}exports.__require=m;
-//# sourceMappingURL=max-satisfying.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"max-satisfying.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n  let max = null\n  let maxSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!max || maxSV.compare(v) === -1) {\n        // compare(max, v, true)\n        max = v\n        maxSV = new SemVer(max, options)\n      }\n    }\n  })\n  return max\n}\nmodule.exports = maxSatisfying\n"],"names":["SemVer","require$$0","Range","require$$1","maxSatisfying_1","versions","range","options","max","maxSV","rangeObj","v"],"mappings":"wMAEA,MAAMA,EAASC,EAAAA,UAAA,EACTC,EAAQC,EAAAA,UAAA,EAuBd,OAAAC,EArBsB,CAACC,EAAUC,EAAOC,IAAY,CAClD,IAAIC,EAAM,KACNC,EAAQ,KACRC,EAAW,KACf,GAAI,CACFA,EAAW,IAAIR,EAAMI,EAAOC,CAAO,CACvC,MAAe,CACX,OAAO,IACX,CACE,OAAAF,EAAS,QAASM,GAAM,CAClBD,EAAS,KAAKC,CAAC,IAEb,CAACH,GAAOC,EAAM,QAAQE,CAAC,IAAM,MAE/BH,EAAMG,EACNF,EAAQ,IAAIT,EAAOQ,EAAKD,CAAO,EAGvC,CAAG,EACMC,CACT","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.es.js

@@ -1,23 +0,0 @@
-import { __require as o } from "../classes/semver.es.js";
-import { __require as c } from "../classes/range.es.js";
-var a, u;
-function q() {
-  if (u) return a;
-  u = 1;
-  const f = o(), m = c();
-  return a = (s, l, i) => {
-    let r = null, n = null, t = null;
-    try {
-      t = new m(l, i);
-    } catch {
-      return null;
-    }
-    return s.forEach((e) => {
-      t.test(e) && (!r || n.compare(e) === -1) && (r = e, n = new f(r, i));
-    }), r;
-  }, a;
-}
-export {
-  q as __require
-};
-//# sourceMappingURL=max-satisfying.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"max-satisfying.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/max-satisfying.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n  let max = null\n  let maxSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!max || maxSV.compare(v) === -1) {\n        // compare(max, v, true)\n        max = v\n        maxSV = new SemVer(max, options)\n      }\n    }\n  })\n  return max\n}\nmodule.exports = maxSatisfying\n"],"names":["SemVer","require$$0","Range","require$$1","maxSatisfying_1","versions","range","options","max","maxSV","rangeObj","v"],"mappings":";;;;;;AAEA,QAAMA,IAASC,EAAA,GACTC,IAAQC,EAAA;AAuBd,SAAAC,IArBsB,CAACC,GAAUC,GAAOC,MAAY;AAClD,QAAIC,IAAM,MACNC,IAAQ,MACRC,IAAW;AACf,QAAI;AACF,MAAAA,IAAW,IAAIR,EAAMI,GAAOC,CAAO;AAAA,IACvC,QAAe;AACX,aAAO;AAAA,IACX;AACE,WAAAF,EAAS,QAAQ,CAACM,MAAM;AACtB,MAAID,EAAS,KAAKC,CAAC,MAEb,CAACH,KAAOC,EAAM,QAAQE,CAAC,MAAM,QAE/BH,IAAMG,GACNF,IAAQ,IAAIT,EAAOQ,GAAKD,CAAO;AAAA,IAGvC,CAAG,GACMC;AAAA,EACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("../classes/semver.cjs.js"),o=require("../classes/range.cjs.js");var n,a;function m(){if(a)return n;a=1;const l=g.__require(),s=o.__require();return n=(c,f,i)=>{let e=null,t=null,u=null;try{u=new s(f,i)}catch{return null}return c.forEach(r=>{u.test(r)&&(!e||t.compare(r)===1)&&(e=r,t=new l(e,i))}),e},n}exports.__require=m;
-//# sourceMappingURL=min-satisfying.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"min-satisfying.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n  let min = null\n  let minSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!min || minSV.compare(v) === 1) {\n        // compare(min, v, true)\n        min = v\n        minSV = new SemVer(min, options)\n      }\n    }\n  })\n  return min\n}\nmodule.exports = minSatisfying\n"],"names":["SemVer","require$$0","Range","require$$1","minSatisfying_1","versions","range","options","min","minSV","rangeObj","v"],"mappings":"wMAEA,MAAMA,EAASC,EAAAA,UAAA,EACTC,EAAQC,EAAAA,UAAA,EAsBd,OAAAC,EArBsB,CAACC,EAAUC,EAAOC,IAAY,CAClD,IAAIC,EAAM,KACNC,EAAQ,KACRC,EAAW,KACf,GAAI,CACFA,EAAW,IAAIR,EAAMI,EAAOC,CAAO,CACvC,MAAe,CACX,OAAO,IACX,CACE,OAAAF,EAAS,QAASM,GAAM,CAClBD,EAAS,KAAKC,CAAC,IAEb,CAACH,GAAOC,EAAM,QAAQE,CAAC,IAAM,KAE/BH,EAAMG,EACNF,EAAQ,IAAIT,EAAOQ,EAAKD,CAAO,EAGvC,CAAG,EACMC,CACT","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.es.js

@@ -1,23 +0,0 @@
-import { __require as o } from "../classes/semver.es.js";
-import { __require as c } from "../classes/range.es.js";
-var i, u;
-function _() {
-  if (u) return i;
-  u = 1;
-  const f = o(), m = c();
-  return i = (s, l, n) => {
-    let r = null, t = null, a = null;
-    try {
-      a = new m(l, n);
-    } catch {
-      return null;
-    }
-    return s.forEach((e) => {
-      a.test(e) && (!r || t.compare(e) === 1) && (r = e, t = new f(r, n));
-    }), r;
-  }, i;
-}
-export {
-  _ as __require
-};
-//# sourceMappingURL=min-satisfying.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"min-satisfying.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-satisfying.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n  let min = null\n  let minSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!min || minSV.compare(v) === 1) {\n        // compare(min, v, true)\n        min = v\n        minSV = new SemVer(min, options)\n      }\n    }\n  })\n  return min\n}\nmodule.exports = minSatisfying\n"],"names":["SemVer","require$$0","Range","require$$1","minSatisfying_1","versions","range","options","min","minSV","rangeObj","v"],"mappings":";;;;;;AAEA,QAAMA,IAASC,EAAA,GACTC,IAAQC,EAAA;AAsBd,SAAAC,IArBsB,CAACC,GAAUC,GAAOC,MAAY;AAClD,QAAIC,IAAM,MACNC,IAAQ,MACRC,IAAW;AACf,QAAI;AACF,MAAAA,IAAW,IAAIR,EAAMI,GAAOC,CAAO;AAAA,IACvC,QAAe;AACX,aAAO;AAAA,IACX;AACE,WAAAF,EAAS,QAAQ,CAACM,MAAM;AACtB,MAAID,EAAS,KAAKC,CAAC,MAEb,CAACH,KAAOC,EAAM,QAAQE,CAAC,MAAM,OAE/BH,IAAMG,GACNF,IAAQ,IAAIT,EAAOQ,GAAKD,CAAO;AAAA,IAGvC,CAAG,GACMC;AAAA,EACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("../classes/semver.cjs.js"),q=require("../classes/range.cjs.js"),_=require("../functions/gt.cjs.js");var u,l;function h(){if(l)return u;l=1;const s=p.__require(),a=q.__require(),c=_.__require();return u=(r,f)=>{r=new a(r,f);let e=new s("0.0.0");if(r.test(e)||(e=new s("0.0.0-0"),r.test(e)))return e;e=null;for(let i=0;i<r.set.length;++i){const m=r.set[i];let n=null;m.forEach(o=>{const t=new s(o.semver.version);switch(o.operator){case">":t.prerelease.length===0?t.patch++:t.prerelease.push(0),t.raw=t.format();case"":case">=":(!n||c(t,n))&&(n=t);break;case"<":case"<=":break;default:throw new Error(`Unexpected operation: ${o.operator}`)}}),n&&(!e||c(e,n))&&(e=n)}return e&&r.test(e)?e:null},u}exports.__require=h;
-//# sourceMappingURL=min-version.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"min-version.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n  range = new Range(range, loose)\n\n  let minver = new SemVer('0.0.0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = new SemVer('0.0.0-0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = null\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let setMin = null\n    comparators.forEach((comparator) => {\n      // Clone to avoid manipulating the comparator's semver object.\n      const compver = new SemVer(comparator.semver.version)\n      switch (comparator.operator) {\n        case '>':\n          if (compver.prerelease.length === 0) {\n            compver.patch++\n          } else {\n            compver.prerelease.push(0)\n          }\n          compver.raw = compver.format()\n          /* fallthrough */\n        case '':\n        case '>=':\n          if (!setMin || gt(compver, setMin)) {\n            setMin = compver\n          }\n          break\n        case '<':\n        case '<=':\n          /* Ignore maximum versions */\n          break\n        /* istanbul ignore next */\n        default:\n          throw new Error(`Unexpected operation: ${comparator.operator}`)\n      }\n    })\n    if (setMin && (!minver || gt(minver, setMin))) {\n      minver = setMin\n    }\n  }\n\n  if (minver && range.test(minver)) {\n    return minver\n  }\n\n  return null\n}\nmodule.exports = minVersion\n"],"names":["SemVer","require$$0","Range","require$$1","gt","require$$2","minVersion_1","range","loose","minver","comparators","setMin","comparator","compver"],"mappings":"4OAEA,MAAMA,EAASC,EAAAA,UAAA,EACTC,EAAQC,EAAAA,UAAA,EACRC,EAAKC,EAAAA,UAAA,EA0DX,OAAAC,EAxDmB,CAACC,EAAOC,IAAU,CACnCD,EAAQ,IAAIL,EAAMK,EAAOC,CAAK,EAE9B,IAAIC,EAAS,IAAIT,EAAO,OAAO,EAM/B,GALIO,EAAM,KAAKE,CAAM,IAIrBA,EAAS,IAAIT,EAAO,SAAS,EACzBO,EAAM,KAAKE,CAAM,GACnB,OAAOA,EAGTA,EAAS,KACT,QAAS,EAAI,EAAG,EAAIF,EAAM,IAAI,OAAQ,EAAE,EAAG,CACzC,MAAMG,EAAcH,EAAM,IAAI,CAAC,EAE/B,IAAII,EAAS,KACbD,EAAY,QAASE,GAAe,CAElC,MAAMC,EAAU,IAAIb,EAAOY,EAAW,OAAO,OAAO,EACpD,OAAQA,EAAW,SAAQ,CACzB,IAAK,IACCC,EAAQ,WAAW,SAAW,EAChCA,EAAQ,QAERA,EAAQ,WAAW,KAAK,CAAC,EAE3BA,EAAQ,IAAMA,EAAQ,OAAM,EAE9B,IAAK,GACL,IAAK,MACC,CAACF,GAAUP,EAAGS,EAASF,CAAM,KAC/BA,EAASE,GAEX,MACF,IAAK,IACL,IAAK,KAEH,MAEF,QACE,MAAM,IAAI,MAAM,yBAAyBD,EAAW,QAAQ,EAAE,CACxE,CACA,CAAK,EACGD,IAAW,CAACF,GAAUL,EAAGK,EAAQE,CAAM,KACzCF,EAASE,EAEf,CAEE,OAAIF,GAAUF,EAAM,KAAKE,CAAM,EACtBA,EAGF,IACT","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.es.js

@@ -1,43 +0,0 @@
-import { __require as p } from "../classes/semver.es.js";
-import { __require as q } from "../classes/range.es.js";
-import { __require as _ } from "../functions/gt.es.js";
-var u, c;
-function d() {
-  if (c) return u;
-  c = 1;
-  const n = p(), f = q(), a = _();
-  return u = (r, l) => {
-    r = new f(r, l);
-    let e = new n("0.0.0");
-    if (r.test(e) || (e = new n("0.0.0-0"), r.test(e)))
-      return e;
-    e = null;
-    for (let s = 0; s < r.set.length; ++s) {
-      const m = r.set[s];
-      let i = null;
-      m.forEach((o) => {
-        const t = new n(o.semver.version);
-        switch (o.operator) {
-          case ">":
-            t.prerelease.length === 0 ? t.patch++ : t.prerelease.push(0), t.raw = t.format();
-          /* fallthrough */
-          case "":
-          case ">=":
-            (!i || a(t, i)) && (i = t);
-            break;
-          case "<":
-          case "<=":
-            break;
-          /* istanbul ignore next */
-          default:
-            throw new Error(`Unexpected operation: ${o.operator}`);
-        }
-      }), i && (!e || a(e, i)) && (e = i);
-    }
-    return e && r.test(e) ? e : null;
-  }, u;
-}
-export {
-  d as __require
-};
-//# sourceMappingURL=min-version.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"min-version.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/min-version.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n  range = new Range(range, loose)\n\n  let minver = new SemVer('0.0.0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = new SemVer('0.0.0-0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = null\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let setMin = null\n    comparators.forEach((comparator) => {\n      // Clone to avoid manipulating the comparator's semver object.\n      const compver = new SemVer(comparator.semver.version)\n      switch (comparator.operator) {\n        case '>':\n          if (compver.prerelease.length === 0) {\n            compver.patch++\n          } else {\n            compver.prerelease.push(0)\n          }\n          compver.raw = compver.format()\n          /* fallthrough */\n        case '':\n        case '>=':\n          if (!setMin || gt(compver, setMin)) {\n            setMin = compver\n          }\n          break\n        case '<':\n        case '<=':\n          /* Ignore maximum versions */\n          break\n        /* istanbul ignore next */\n        default:\n          throw new Error(`Unexpected operation: ${comparator.operator}`)\n      }\n    })\n    if (setMin && (!minver || gt(minver, setMin))) {\n      minver = setMin\n    }\n  }\n\n  if (minver && range.test(minver)) {\n    return minver\n  }\n\n  return null\n}\nmodule.exports = minVersion\n"],"names":["SemVer","require$$0","Range","require$$1","gt","require$$2","minVersion_1","range","loose","minver","i","comparators","setMin","comparator","compver"],"mappings":";;;;;;;AAEA,QAAMA,IAASC,EAAA,GACTC,IAAQC,EAAA,GACRC,IAAKC,EAAA;AA0DX,SAAAC,IAxDmB,CAACC,GAAOC,MAAU;AACnC,IAAAD,IAAQ,IAAIL,EAAMK,GAAOC,CAAK;AAE9B,QAAIC,IAAS,IAAIT,EAAO,OAAO;AAM/B,QALIO,EAAM,KAAKE,CAAM,MAIrBA,IAAS,IAAIT,EAAO,SAAS,GACzBO,EAAM,KAAKE,CAAM;AACnB,aAAOA;AAGT,IAAAA,IAAS;AACT,aAASC,IAAI,GAAGA,IAAIH,EAAM,IAAI,QAAQ,EAAEG,GAAG;AACzC,YAAMC,IAAcJ,EAAM,IAAIG,CAAC;AAE/B,UAAIE,IAAS;AACb,MAAAD,EAAY,QAAQ,CAACE,MAAe;AAElC,cAAMC,IAAU,IAAId,EAAOa,EAAW,OAAO,OAAO;AACpD,gBAAQA,EAAW,UAAQ;AAAA,UACzB,KAAK;AACH,YAAIC,EAAQ,WAAW,WAAW,IAChCA,EAAQ,UAERA,EAAQ,WAAW,KAAK,CAAC,GAE3BA,EAAQ,MAAMA,EAAQ,OAAM;AAAA;AAAA,UAE9B,KAAK;AAAA,UACL,KAAK;AACH,aAAI,CAACF,KAAUR,EAAGU,GAASF,CAAM,OAC/BA,IAASE;AAEX;AAAA,UACF,KAAK;AAAA,UACL,KAAK;AAEH;AAAA;AAAA,UAEF;AACE,kBAAM,IAAI,MAAM,yBAAyBD,EAAW,QAAQ,EAAE;AAAA,QACxE;AAAA,MACA,CAAK,GACGD,MAAW,CAACH,KAAUL,EAAGK,GAAQG,CAAM,OACzCH,IAASG;AAAA,IAEf;AAEE,WAAIH,KAAUF,EAAM,KAAKE,CAAM,IACtBA,IAGF;AAAA,EACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/outside.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const k=require("../classes/semver.cjs.js"),p=require("../classes/comparator.cjs.js"),E=require("../classes/range.cjs.js"),M=require("../functions/satisfies.cjs.js"),R=require("../functions/gt.cjs.js"),T=require("../functions/lt.cjs.js"),j=require("../functions/lte.cjs.js"),A=require("../functions/gte.cjs.js");var _,h;function C(){if(h)return _;h=1;const m=k.__require(),a=p.__require(),{ANY:g}=a,w=E.__require(),$=M.__require(),d=R.__require(),v=T.__require(),b=j.__require(),y=A.__require();return _=(s,u,O,i)=>{s=new m(s,i),u=new w(u,i);let c,f,n,l,o;switch(O){case">":c=d,f=b,n=v,l=">",o=">=";break;case"<":c=v,f=y,n=d,l="<",o="<=";break;default:throw new TypeError('Must provide a hilo val of "<" or ">"')}if($(s,u,i))return!1;for(let q=0;q<u.set.length;++q){const S=u.set[q];let t=null,e=null;if(S.forEach(r=>{r.semver===g&&(r=new a(">=0.0.0")),t=t||r,e=e||r,c(r.semver,t.semver,i)?t=r:n(r.semver,e.semver,i)&&(e=r)}),t.operator===l||t.operator===o||(!e.operator||e.operator===l)&&f(s,e.semver))return!1;if(e.operator===o&&n(s,e.semver))return!1}return!0},_}exports.__require=C;
-//# sourceMappingURL=outside.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"outside.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/outside.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n  version = new SemVer(version, options)\n  range = new Range(range, options)\n\n  let gtfn, ltefn, ltfn, comp, ecomp\n  switch (hilo) {\n    case '>':\n      gtfn = gt\n      ltefn = lte\n      ltfn = lt\n      comp = '>'\n      ecomp = '>='\n      break\n    case '<':\n      gtfn = lt\n      ltefn = gte\n      ltfn = gt\n      comp = '<'\n      ecomp = '<='\n      break\n    default:\n      throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n  }\n\n  // If it satisfies the range it is not outside\n  if (satisfies(version, range, options)) {\n    return false\n  }\n\n  // From now on, variable terms are as if we're in \"gtr\" mode.\n  // but note that everything is flipped for the \"ltr\" function.\n\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let high = null\n    let low = null\n\n    comparators.forEach((comparator) => {\n      if (comparator.semver === ANY) {\n        comparator = new Comparator('>=0.0.0')\n      }\n      high = high || comparator\n      low = low || comparator\n      if (gtfn(comparator.semver, high.semver, options)) {\n        high = comparator\n      } else if (ltfn(comparator.semver, low.semver, options)) {\n        low = comparator\n      }\n    })\n\n    // If the edge version comparator has a operator then our version\n    // isn't outside it\n    if (high.operator === comp || high.operator === ecomp) {\n      return false\n    }\n\n    // If the lowest version comparator has an operator and our version\n    // is less than it then it isn't higher than the range\n    if ((!low.operator || low.operator === comp) &&\n        ltefn(version, low.semver)) {\n      return false\n    } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n      return false\n    }\n  }\n  return true\n}\n\nmodule.exports = outside\n"],"names":["SemVer","require$$0","Comparator","require$$1","ANY","Range","require$$2","satisfies","require$$3","gt","require$$4","lt","require$$5","lte","require$$6","gte","require$$7","outside_1","version","range","hilo","options","gtfn","ltefn","ltfn","comp","ecomp","i","comparators","high","low","comparator"],"mappings":"+aAEA,MAAMA,EAASC,EAAAA,UAAA,EACTC,EAAaC,EAAAA,UAAA,EACb,CAAE,IAAAC,CAAG,EAAKF,EACVG,EAAQC,EAAAA,UAAA,EACRC,EAAYC,EAAAA,UAAA,EACZC,EAAKC,EAAAA,UAAA,EACLC,EAAKC,EAAAA,UAAA,EACLC,EAAMC,EAAAA,UAAA,EACNC,EAAMC,EAAAA,UAAA,EAuEZ,OAAAC,EArEgB,CAACC,EAASC,EAAOC,EAAMC,IAAY,CACjDH,EAAU,IAAIlB,EAAOkB,EAASG,CAAO,EACrCF,EAAQ,IAAId,EAAMc,EAAOE,CAAO,EAEhC,IAAIC,EAAMC,EAAOC,EAAMC,EAAMC,EAC7B,OAAQN,EAAI,CACV,IAAK,IACHE,EAAOb,EACPc,EAAQV,EACRW,EAAOb,EACPc,EAAO,IACPC,EAAQ,KACR,MACF,IAAK,IACHJ,EAAOX,EACPY,EAAQR,EACRS,EAAOf,EACPgB,EAAO,IACPC,EAAQ,KACR,MACF,QACE,MAAM,IAAI,UAAU,uCAAuC,CACjE,CAGE,GAAInB,EAAUW,EAASC,EAAOE,CAAO,EACnC,MAAO,GAMT,QAASM,EAAI,EAAGA,EAAIR,EAAM,IAAI,OAAQ,EAAEQ,EAAG,CACzC,MAAMC,EAAcT,EAAM,IAAIQ,CAAC,EAE/B,IAAIE,EAAO,KACPC,EAAM,KAuBV,GArBAF,EAAY,QAASG,GAAe,CAC9BA,EAAW,SAAW3B,IACxB2B,EAAa,IAAI7B,EAAW,SAAS,GAEvC2B,EAAOA,GAAQE,EACfD,EAAMA,GAAOC,EACTT,EAAKS,EAAW,OAAQF,EAAK,OAAQR,CAAO,EAC9CQ,EAAOE,EACEP,EAAKO,EAAW,OAAQD,EAAI,OAAQT,CAAO,IACpDS,EAAMC,EAEd,CAAK,EAIGF,EAAK,WAAaJ,GAAQI,EAAK,WAAaH,IAM3C,CAACI,EAAI,UAAYA,EAAI,WAAaL,IACnCF,EAAML,EAASY,EAAI,MAAM,EAC3B,MAAO,GACF,GAAIA,EAAI,WAAaJ,GAASF,EAAKN,EAASY,EAAI,MAAM,EAC3D,MAAO,EAEb,CACE,MAAO,EACT","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/outside.es.js

@@ -1,45 +0,0 @@
-import { __require as C } from "../classes/semver.es.js";
-import { __require as E } from "../classes/comparator.es.js";
-import { __require as G } from "../classes/range.es.js";
-import { __require as L } from "../functions/satisfies.es.js";
-import { __require as O } from "../functions/gt.es.js";
-import { __require as x } from "../functions/lt.es.js";
-import { __require as y } from "../functions/lte.es.js";
-import { __require as A } from "../functions/gte.es.js";
-var q, d;
-function F() {
-  if (d) return q;
-  d = 1;
-  const h = C(), _ = E(), { ANY: v } = _, w = G(), g = L(), c = O(), p = x(), R = y(), S = A();
-  return q = (s, i, b, u) => {
-    s = new h(s, u), i = new w(i, u);
-    let m, a, o, f, l;
-    switch (b) {
-      case ">":
-        m = c, a = R, o = p, f = ">", l = ">=";
-        break;
-      case "<":
-        m = p, a = S, o = c, f = "<", l = "<=";
-        break;
-      default:
-        throw new TypeError('Must provide a hilo val of "<" or ">"');
-    }
-    if (g(s, i, u))
-      return !1;
-    for (let n = 0; n < i.set.length; ++n) {
-      const k = i.set[n];
-      let t = null, e = null;
-      if (k.forEach((r) => {
-        r.semver === v && (r = new _(">=0.0.0")), t = t || r, e = e || r, m(r.semver, t.semver, u) ? t = r : o(r.semver, e.semver, u) && (e = r);
-      }), t.operator === f || t.operator === l || (!e.operator || e.operator === f) && a(s, e.semver))
-        return !1;
-      if (e.operator === l && o(s, e.semver))
-        return !1;
-    }
-    return !0;
-  }, q;
-}
-export {
-  F as __require
-};
-//# sourceMappingURL=outside.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"outside.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/outside.js"],"sourcesContent":["'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n  version = new SemVer(version, options)\n  range = new Range(range, options)\n\n  let gtfn, ltefn, ltfn, comp, ecomp\n  switch (hilo) {\n    case '>':\n      gtfn = gt\n      ltefn = lte\n      ltfn = lt\n      comp = '>'\n      ecomp = '>='\n      break\n    case '<':\n      gtfn = lt\n      ltefn = gte\n      ltfn = gt\n      comp = '<'\n      ecomp = '<='\n      break\n    default:\n      throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n  }\n\n  // If it satisfies the range it is not outside\n  if (satisfies(version, range, options)) {\n    return false\n  }\n\n  // From now on, variable terms are as if we're in \"gtr\" mode.\n  // but note that everything is flipped for the \"ltr\" function.\n\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let high = null\n    let low = null\n\n    comparators.forEach((comparator) => {\n      if (comparator.semver === ANY) {\n        comparator = new Comparator('>=0.0.0')\n      }\n      high = high || comparator\n      low = low || comparator\n      if (gtfn(comparator.semver, high.semver, options)) {\n        high = comparator\n      } else if (ltfn(comparator.semver, low.semver, options)) {\n        low = comparator\n      }\n    })\n\n    // If the edge version comparator has a operator then our version\n    // isn't outside it\n    if (high.operator === comp || high.operator === ecomp) {\n      return false\n    }\n\n    // If the lowest version comparator has an operator and our version\n    // is less than it then it isn't higher than the range\n    if ((!low.operator || low.operator === comp) &&\n        ltefn(version, low.semver)) {\n      return false\n    } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n      return false\n    }\n  }\n  return true\n}\n\nmodule.exports = outside\n"],"names":["SemVer","require$$0","Comparator","require$$1","ANY","Range","require$$2","satisfies","require$$3","gt","require$$4","lt","require$$5","lte","require$$6","gte","require$$7","outside_1","version","range","hilo","options","gtfn","ltefn","ltfn","comp","ecomp","i","comparators","high","low","comparator"],"mappings":";;;;;;;;;;;;AAEA,QAAMA,IAASC,EAAA,GACTC,IAAaC,EAAA,GACb,EAAE,KAAAC,EAAG,IAAKF,GACVG,IAAQC,EAAA,GACRC,IAAYC,EAAA,GACZC,IAAKC,EAAA,GACLC,IAAKC,EAAA,GACLC,IAAMC,EAAA,GACNC,IAAMC,EAAA;AAuEZ,SAAAC,IArEgB,CAACC,GAASC,GAAOC,GAAMC,MAAY;AACjD,IAAAH,IAAU,IAAIlB,EAAOkB,GAASG,CAAO,GACrCF,IAAQ,IAAId,EAAMc,GAAOE,CAAO;AAEhC,QAAIC,GAAMC,GAAOC,GAAMC,GAAMC;AAC7B,YAAQN,GAAI;AAAA,MACV,KAAK;AACH,QAAAE,IAAOb,GACPc,IAAQV,GACRW,IAAOb,GACPc,IAAO,KACPC,IAAQ;AACR;AAAA,MACF,KAAK;AACH,QAAAJ,IAAOX,GACPY,IAAQR,GACRS,IAAOf,GACPgB,IAAO,KACPC,IAAQ;AACR;AAAA,MACF;AACE,cAAM,IAAI,UAAU,uCAAuC;AAAA,IACjE;AAGE,QAAInB,EAAUW,GAASC,GAAOE,CAAO;AACnC,aAAO;AAMT,aAASM,IAAI,GAAGA,IAAIR,EAAM,IAAI,QAAQ,EAAEQ,GAAG;AACzC,YAAMC,IAAcT,EAAM,IAAIQ,CAAC;AAE/B,UAAIE,IAAO,MACPC,IAAM;AAuBV,UArBAF,EAAY,QAAQ,CAACG,MAAe;AAClC,QAAIA,EAAW,WAAW3B,MACxB2B,IAAa,IAAI7B,EAAW,SAAS,IAEvC2B,IAAOA,KAAQE,GACfD,IAAMA,KAAOC,GACTT,EAAKS,EAAW,QAAQF,EAAK,QAAQR,CAAO,IAC9CQ,IAAOE,IACEP,EAAKO,EAAW,QAAQD,EAAI,QAAQT,CAAO,MACpDS,IAAMC;AAAA,MAEd,CAAK,GAIGF,EAAK,aAAaJ,KAAQI,EAAK,aAAaH,MAM3C,CAACI,EAAI,YAAYA,EAAI,aAAaL,MACnCF,EAAML,GAASY,EAAI,MAAM;AAC3B,eAAO;AACF,UAAIA,EAAI,aAAaJ,KAASF,EAAKN,GAASY,EAAI,MAAM;AAC3D,eAAO;AAAA,IAEb;AACE,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const q=require("../functions/satisfies.cjs.js"),v=require("../functions/compare.cjs.js");var o,p;function y(){if(p)return o;p=1;const a=q.__require(),h=v.__require();return o=(m,t,f)=>{const l=[];let s=null,n=null;const u=m.sort((e,i)=>h(e,i,f));for(const e of u)a(e,t,f)?(n=e,s||(s=e)):(n&&l.push([s,n]),n=null,s=null);s&&l.push([s,null]);const r=[];for(const[e,i]of l)e===i?r.push(e):!i&&e===u[0]?r.push("*"):i?e===u[0]?r.push(`<=${i}`):r.push(`${e} - ${i}`):r.push(`>=${e}`);const c=r.join(" || "),d=typeof t.raw=="string"?t.raw:String(t);return c.length<d.length?c:t},o}exports.__require=y;
-//# sourceMappingURL=simplify.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"simplify.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.js"],"sourcesContent":["'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n"],"names":["satisfies","require$$0","compare","require$$1","simplify","versions","range","options","set","first","prev","v","a","b","version","ranges","min","max","simplified","original"],"mappings":"iNAKA,MAAMA,EAAYC,EAAAA,UAAA,EACZC,EAAUC,EAAAA,UAAA,EAChB,OAAAC,EAAiB,CAACC,EAAUC,EAAOC,IAAY,CAC7C,MAAMC,EAAM,CAAA,EACZ,IAAIC,EAAQ,KACRC,EAAO,KACX,MAAMC,EAAIN,EAAS,KAAK,CAACO,EAAGC,IAAMX,EAAQU,EAAGC,EAAGN,CAAO,CAAC,EACxD,UAAWO,KAAWH,EACHX,EAAUc,EAASR,EAAOC,CAAO,GAEhDG,EAAOI,EACFL,IACHA,EAAQK,KAGNJ,GACFF,EAAI,KAAK,CAACC,EAAOC,CAAI,CAAC,EAExBA,EAAO,KACPD,EAAQ,MAGRA,GACFD,EAAI,KAAK,CAACC,EAAO,IAAI,CAAC,EAGxB,MAAMM,EAAS,CAAA,EACf,SAAW,CAACC,EAAKC,CAAG,IAAKT,EACnBQ,IAAQC,EACVF,EAAO,KAAKC,CAAG,EACN,CAACC,GAAOD,IAAQL,EAAE,CAAC,EAC5BI,EAAO,KAAK,GAAG,EACLE,EAEDD,IAAQL,EAAE,CAAC,EACpBI,EAAO,KAAK,KAAKE,CAAG,EAAE,EAEtBF,EAAO,KAAK,GAAGC,CAAG,MAAMC,CAAG,EAAE,EAJ7BF,EAAO,KAAK,KAAKC,CAAG,EAAE,EAO1B,MAAME,EAAaH,EAAO,KAAK,MAAM,EAC/BI,EAAW,OAAOb,EAAM,KAAQ,SAAWA,EAAM,IAAM,OAAOA,CAAK,EACzE,OAAOY,EAAW,OAASC,EAAS,OAASD,EAAaZ,CAC5D","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.es.js

@@ -1,25 +0,0 @@
-import { __require as d } from "../functions/satisfies.es.js";
-import { __require as _ } from "../functions/compare.es.js";
-var u, c;
-function S() {
-  if (c) return u;
-  c = 1;
-  const m = d(), a = _();
-  return u = (h, t, f) => {
-    const n = [];
-    let s = null, l = null;
-    const o = h.sort((i, e) => a(i, e, f));
-    for (const i of o)
-      m(i, t, f) ? (l = i, s || (s = i)) : (l && n.push([s, l]), l = null, s = null);
-    s && n.push([s, null]);
-    const r = [];
-    for (const [i, e] of n)
-      i === e ? r.push(i) : !e && i === o[0] ? r.push("*") : e ? i === o[0] ? r.push(`<=${e}`) : r.push(`${i} - ${e}`) : r.push(`>=${i}`);
-    const p = r.join(" || "), q = typeof t.raw == "string" ? t.raw : String(t);
-    return p.length < q.length ? p : t;
-  }, u;
-}
-export {
-  S as __require
-};
-//# sourceMappingURL=simplify.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"simplify.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/simplify.js"],"sourcesContent":["'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n"],"names":["satisfies","require$$0","compare","require$$1","simplify","versions","range","options","set","first","prev","v","a","b","version","ranges","min","max","simplified","original"],"mappings":";;;;;;AAKA,QAAMA,IAAYC,EAAA,GACZC,IAAUC,EAAA;AAChB,SAAAC,IAAiB,CAACC,GAAUC,GAAOC,MAAY;AAC7C,UAAMC,IAAM,CAAA;AACZ,QAAIC,IAAQ,MACRC,IAAO;AACX,UAAMC,IAAIN,EAAS,KAAK,CAACO,GAAGC,MAAMX,EAAQU,GAAGC,GAAGN,CAAO,CAAC;AACxD,eAAWO,KAAWH;AAEpB,MADiBX,EAAUc,GAASR,GAAOC,CAAO,KAEhDG,IAAOI,GACFL,MACHA,IAAQK,OAGNJ,KACFF,EAAI,KAAK,CAACC,GAAOC,CAAI,CAAC,GAExBA,IAAO,MACPD,IAAQ;AAGZ,IAAIA,KACFD,EAAI,KAAK,CAACC,GAAO,IAAI,CAAC;AAGxB,UAAMM,IAAS,CAAA;AACf,eAAW,CAACC,GAAKC,CAAG,KAAKT;AACvB,MAAIQ,MAAQC,IACVF,EAAO,KAAKC,CAAG,IACN,CAACC,KAAOD,MAAQL,EAAE,CAAC,IAC5BI,EAAO,KAAK,GAAG,IACLE,IAEDD,MAAQL,EAAE,CAAC,IACpBI,EAAO,KAAK,KAAKE,CAAG,EAAE,IAEtBF,EAAO,KAAK,GAAGC,CAAG,MAAMC,CAAG,EAAE,IAJ7BF,EAAO,KAAK,KAAKC,CAAG,EAAE;AAO1B,UAAME,IAAaH,EAAO,KAAK,MAAM,GAC/BI,IAAW,OAAOb,EAAM,OAAQ,WAAWA,EAAM,MAAM,OAAOA,CAAK;AACzE,WAAOY,EAAW,SAASC,EAAS,SAASD,IAAaZ;AAAA,EAC5D;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/subset.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const R=require("../classes/range.cjs.js"),y=require("../classes/comparator.cjs.js"),C=require("../functions/satisfies.cjs.js"),V=require("../functions/compare.cjs.js");var q,j;function $(){if(j)return q;j=1;const _=R.__require(),m=y.__require(),{ANY:c}=m,u=C.__require(),p=V.__require(),D=(t,r,s={})=>{if(t===r)return!0;t=new _(t,s),r=new _(r,s);let o=!1;e:for(const l of t.set){for(const n of r.set){const f=L(l,n,s);if(o=o||f!==null,f)continue e}if(o)return!1}return!0},G=[new m(">=0.0.0-0")],w=[new m(">=0.0.0")],L=(t,r,s)=>{if(t===r)return!0;if(t.length===1&&t[0].semver===c){if(r.length===1&&r[0].semver===c)return!0;s.includePrerelease?t=G:t=w}if(r.length===1&&r[0].semver===c){if(s.includePrerelease)return!0;r=w}const o=new Set;let l,n;for(const e of t)e.operator===">"||e.operator===">="?l=P(l,e,s):e.operator==="<"||e.operator==="<="?n=T(n,e,s):o.add(e.semver);if(o.size>1)return null;let f;if(l&&n){if(f=p(l.semver,n.semver,s),f>0)return null;if(f===0&&(l.operator!==">="||n.operator!=="<="))return null}for(const e of o){if(l&&!u(e,String(l),s)||n&&!u(e,String(n),s))return null;for(const N of r)if(!u(e,String(N),s))return!1;return!0}let v,g,h,S,a=n&&!s.includePrerelease&&n.semver.prerelease.length?n.semver:!1,i=l&&!s.includePrerelease&&l.semver.prerelease.length?l.semver:!1;a&&a.prerelease.length===1&&n.operator==="<"&&a.prerelease[0]===0&&(a=!1);for(const e of r){if(S=S||e.operator===">"||e.operator===">=",h=h||e.operator==="<"||e.operator==="<=",l){if(i&&e.semver.prerelease&&e.semver.prerelease.length&&e.semver.major===i.major&&e.semver.minor===i.minor&&e.semver.patch===i.patch&&(i=!1),e.operator===">"||e.operator===">="){if(v=P(l,e,s),v===e&&v!==l)return!1}else if(l.operator===">="&&!u(l.semver,String(e),s))return!1}if(n){if(a&&e.semver.prerelease&&e.semver.prerelease.length&&e.semver.major===a.major&&e.semver.minor===a.minor&&e.semver.patch===a.patch&&(a=!1),e.operator==="<"||e.operator==="<="){if(g=T(n,e,s),g===e&&g!==n)return!1}else if(n.operator==="<="&&!u(n.semver,String(e),s))return!1}if(!e.operator&&(n||l)&&f!==0)return!1}return!(l&&h&&!n&&f!==0||n&&S&&!l&&f!==0||i||a)},P=(t,r,s)=>{if(!t)return r;const o=p(t.semver,r.semver,s);return o>0?t:o<0||r.operator===">"&&t.operator===">="?r:t},T=(t,r,s)=>{if(!t)return r;const o=p(t.semver,r.semver,s);return o<0?t:o>0||r.operator==="<"&&t.operator==="<="?r:t};return q=D,q}exports.__require=$;
-//# sourceMappingURL=subset.cjs.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"subset.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/subset.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n"],"names":["Range","require$$0","Comparator","require$$1","ANY","satisfies","require$$2","compare","require$$3","subset","sub","dom","options","sawNonNull","OUTER","simpleSub","simpleDom","isSub","simpleSubset","minimumVersionWithPreRelease","minimumVersion","eqSet","gt","lt","c","higherGT","lowerLT","gtltComp","eq","higher","lower","hasDomLT","hasDomGT","needDomLTPre","needDomGTPre","a","b","comp","subset_1"],"mappings":"gSAEA,MAAMA,EAAQC,EAAAA,UAAA,EACRC,EAAaC,EAAAA,UAAA,EACb,CAAE,IAAAC,CAAG,EAAKF,EACVG,EAAYC,EAAAA,UAAA,EACZC,EAAUC,EAAAA,UAAA,EAsCVC,EAAS,CAACC,EAAKC,EAAKC,EAAU,CAAA,IAAO,CACzC,GAAIF,IAAQC,EACV,MAAO,GAGTD,EAAM,IAAIV,EAAMU,EAAKE,CAAO,EAC5BD,EAAM,IAAIX,EAAMW,EAAKC,CAAO,EAC5B,IAAIC,EAAa,GAEjBC,EAAO,UAAWC,KAAaL,EAAI,IAAK,CACtC,UAAWM,KAAaL,EAAI,IAAK,CAC/B,MAAMM,EAAQC,EAAaH,EAAWC,EAAWJ,CAAO,EAExD,GADAC,EAAaA,GAAcI,IAAU,KACjCA,EACF,SAASH,CAEjB,CAKI,GAAID,EACF,MAAO,EAEb,CACE,MAAO,EACT,EAEMM,EAA+B,CAAC,IAAIjB,EAAW,WAAW,CAAC,EAC3DkB,EAAiB,CAAC,IAAIlB,EAAW,SAAS,CAAC,EAE3CgB,EAAe,CAACR,EAAKC,EAAKC,IAAY,CAC1C,GAAIF,IAAQC,EACV,MAAO,GAGT,GAAID,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,SAAWN,EAAK,CAC7C,GAAIO,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,SAAWP,EACxC,MAAO,GACEQ,EAAQ,kBACjBF,EAAMS,EAENT,EAAMU,CAEZ,CAEE,GAAIT,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,SAAWP,EAAK,CAC7C,GAAIQ,EAAQ,kBACV,MAAO,GAEPD,EAAMS,CAEZ,CAEE,MAAMC,EAAQ,IAAI,IAClB,IAAIC,EAAIC,EACR,UAAWC,KAAKd,EACVc,EAAE,WAAa,KAAOA,EAAE,WAAa,KACvCF,EAAKG,EAASH,EAAIE,EAAGZ,CAAO,EACnBY,EAAE,WAAa,KAAOA,EAAE,WAAa,KAC9CD,EAAKG,EAAQH,EAAIC,EAAGZ,CAAO,EAE3BS,EAAM,IAAIG,EAAE,MAAM,EAItB,GAAIH,EAAM,KAAO,EACf,OAAO,KAGT,IAAIM,EACJ,GAAIL,GAAMC,EAAI,CAEZ,GADAI,EAAWpB,EAAQe,EAAG,OAAQC,EAAG,OAAQX,CAAO,EAC5Ce,EAAW,EACb,OAAO,KACF,GAAIA,IAAa,IAAML,EAAG,WAAa,MAAQC,EAAG,WAAa,MACpE,OAAO,IAEb,CAGE,UAAWK,KAAMP,EAAO,CAKtB,GAJIC,GAAM,CAACjB,EAAUuB,EAAI,OAAON,CAAE,EAAGV,CAAO,GAIxCW,GAAM,CAAClB,EAAUuB,EAAI,OAAOL,CAAE,EAAGX,CAAO,EAC1C,OAAO,KAGT,UAAWY,KAAKb,EACd,GAAI,CAACN,EAAUuB,EAAI,OAAOJ,CAAC,EAAGZ,CAAO,EACnC,MAAO,GAIX,MAAO,EACX,CAEE,IAAIiB,EAAQC,EACRC,EAAUC,EAGVC,EAAeV,GACjB,CAACX,EAAQ,mBACTW,EAAG,OAAO,WAAW,OAASA,EAAG,OAAS,GACxCW,EAAeZ,GACjB,CAACV,EAAQ,mBACTU,EAAG,OAAO,WAAW,OAASA,EAAG,OAAS,GAExCW,GAAgBA,EAAa,WAAW,SAAW,GACnDV,EAAG,WAAa,KAAOU,EAAa,WAAW,CAAC,IAAM,IACxDA,EAAe,IAGjB,UAAWT,KAAKb,EAAK,CAGnB,GAFAqB,EAAWA,GAAYR,EAAE,WAAa,KAAOA,EAAE,WAAa,KAC5DO,EAAWA,GAAYP,EAAE,WAAa,KAAOA,EAAE,WAAa,KACxDF,GASF,GARIY,GACEV,EAAE,OAAO,YAAcA,EAAE,OAAO,WAAW,QAC3CA,EAAE,OAAO,QAAUU,EAAa,OAChCV,EAAE,OAAO,QAAUU,EAAa,OAChCV,EAAE,OAAO,QAAUU,EAAa,QAClCA,EAAe,IAGfV,EAAE,WAAa,KAAOA,EAAE,WAAa,MAEvC,GADAK,EAASJ,EAASH,EAAIE,EAAGZ,CAAO,EAC5BiB,IAAWL,GAAKK,IAAWP,EAC7B,MAAO,WAEAA,EAAG,WAAa,MAAQ,CAACjB,EAAUiB,EAAG,OAAQ,OAAOE,CAAC,EAAGZ,CAAO,EACzE,MAAO,GAGX,GAAIW,GASF,GARIU,GACET,EAAE,OAAO,YAAcA,EAAE,OAAO,WAAW,QAC3CA,EAAE,OAAO,QAAUS,EAAa,OAChCT,EAAE,OAAO,QAAUS,EAAa,OAChCT,EAAE,OAAO,QAAUS,EAAa,QAClCA,EAAe,IAGfT,EAAE,WAAa,KAAOA,EAAE,WAAa,MAEvC,GADAM,EAAQJ,EAAQH,EAAIC,EAAGZ,CAAO,EAC1BkB,IAAUN,GAAKM,IAAUP,EAC3B,MAAO,WAEAA,EAAG,WAAa,MAAQ,CAAClB,EAAUkB,EAAG,OAAQ,OAAOC,CAAC,EAAGZ,CAAO,EACzE,MAAO,GAGX,GAAI,CAACY,EAAE,WAAaD,GAAMD,IAAOK,IAAa,EAC5C,MAAO,EAEb,CAgBE,MAXI,EAAAL,GAAMS,GAAY,CAACR,GAAMI,IAAa,GAItCJ,GAAMS,GAAY,CAACV,GAAMK,IAAa,GAOtCO,GAAgBD,EAKtB,EAGMR,EAAW,CAACU,EAAGC,EAAGxB,IAAY,CAClC,GAAI,CAACuB,EACH,OAAOC,EAET,MAAMC,EAAO9B,EAAQ4B,EAAE,OAAQC,EAAE,OAAQxB,CAAO,EAChD,OAAOyB,EAAO,EAAIF,EACdE,EAAO,GACPD,EAAE,WAAa,KAAOD,EAAE,WAAa,KAD1BC,EAEXD,CACN,EAGMT,EAAU,CAACS,EAAGC,EAAGxB,IAAY,CACjC,GAAI,CAACuB,EACH,OAAOC,EAET,MAAMC,EAAO9B,EAAQ4B,EAAE,OAAQC,EAAE,OAAQxB,CAAO,EAChD,OAAOyB,EAAO,EAAIF,EACdE,EAAO,GACPD,EAAE,WAAa,KAAOD,EAAE,WAAa,KAD1BC,EAEXD,CACN,EAEA,OAAAG,EAAiB7B","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/subset.es.js

@@ -1,95 +0,0 @@
-import { __require as L } from "../classes/range.es.js";
-import { __require as N } from "../classes/comparator.es.js";
-import { __require as V } from "../functions/satisfies.es.js";
-import { __require as x } from "../functions/compare.es.js";
-var S, D;
-function k() {
-  if (D) return S;
-  D = 1;
-  const _ = L(), m = N(), { ANY: c } = m, u = V(), p = x(), j = (t, r, s = {}) => {
-    if (t === r)
-      return !0;
-    t = new _(t, s), r = new _(r, s);
-    let o = !1;
-    e: for (const l of t.set) {
-      for (const n of r.set) {
-        const f = R(l, n, s);
-        if (o = o || f !== null, f)
-          continue e;
-      }
-      if (o)
-        return !1;
-    }
-    return !0;
-  }, C = [new m(">=0.0.0-0")], w = [new m(">=0.0.0")], R = (t, r, s) => {
-    if (t === r)
-      return !0;
-    if (t.length === 1 && t[0].semver === c) {
-      if (r.length === 1 && r[0].semver === c)
-        return !0;
-      s.includePrerelease ? t = C : t = w;
-    }
-    if (r.length === 1 && r[0].semver === c) {
-      if (s.includePrerelease)
-        return !0;
-      r = w;
-    }
-    const o = /* @__PURE__ */ new Set();
-    let l, n;
-    for (const e of t)
-      e.operator === ">" || e.operator === ">=" ? l = P(l, e, s) : e.operator === "<" || e.operator === "<=" ? n = T(n, e, s) : o.add(e.semver);
-    if (o.size > 1)
-      return null;
-    let f;
-    if (l && n) {
-      if (f = p(l.semver, n.semver, s), f > 0)
-        return null;
-      if (f === 0 && (l.operator !== ">=" || n.operator !== "<="))
-        return null;
-    }
-    for (const e of o) {
-      if (l && !u(e, String(l), s) || n && !u(e, String(n), s))
-        return null;
-      for (const G of r)
-        if (!u(e, String(G), s))
-          return !1;
-      return !0;
-    }
-    let v, h, g, q, a = n && !s.includePrerelease && n.semver.prerelease.length ? n.semver : !1, i = l && !s.includePrerelease && l.semver.prerelease.length ? l.semver : !1;
-    a && a.prerelease.length === 1 && n.operator === "<" && a.prerelease[0] === 0 && (a = !1);
-    for (const e of r) {
-      if (q = q || e.operator === ">" || e.operator === ">=", g = g || e.operator === "<" || e.operator === "<=", l) {
-        if (i && e.semver.prerelease && e.semver.prerelease.length && e.semver.major === i.major && e.semver.minor === i.minor && e.semver.patch === i.patch && (i = !1), e.operator === ">" || e.operator === ">=") {
-          if (v = P(l, e, s), v === e && v !== l)
-            return !1;
-        } else if (l.operator === ">=" && !u(l.semver, String(e), s))
-          return !1;
-      }
-      if (n) {
-        if (a && e.semver.prerelease && e.semver.prerelease.length && e.semver.major === a.major && e.semver.minor === a.minor && e.semver.patch === a.patch && (a = !1), e.operator === "<" || e.operator === "<=") {
-          if (h = T(n, e, s), h === e && h !== n)
-            return !1;
-        } else if (n.operator === "<=" && !u(n.semver, String(e), s))
-          return !1;
-      }
-      if (!e.operator && (n || l) && f !== 0)
-        return !1;
-    }
-    return !(l && g && !n && f !== 0 || n && q && !l && f !== 0 || i || a);
-  }, P = (t, r, s) => {
-    if (!t)
-      return r;
-    const o = p(t.semver, r.semver, s);
-    return o > 0 ? t : o < 0 || r.operator === ">" && t.operator === ">=" ? r : t;
-  }, T = (t, r, s) => {
-    if (!t)
-      return r;
-    const o = p(t.semver, r.semver, s);
-    return o < 0 ? t : o > 0 || r.operator === "<" && t.operator === "<=" ? r : t;
-  };
-  return S = j, S;
-}
-export {
-  k as __require
-};
-//# sourceMappingURL=subset.es.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"subset.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/subset.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n"],"names":["Range","require$$0","Comparator","require$$1","ANY","satisfies","require$$2","compare","require$$3","subset","sub","dom","options","sawNonNull","OUTER","simpleSub","simpleDom","isSub","simpleSubset","minimumVersionWithPreRelease","minimumVersion","eqSet","gt","lt","c","higherGT","lowerLT","gtltComp","eq","higher","lower","hasDomLT","hasDomGT","needDomLTPre","needDomGTPre","a","b","comp","subset_1"],"mappings":";;;;;;;;AAEA,QAAMA,IAAQC,EAAA,GACRC,IAAaC,EAAA,GACb,EAAE,KAAAC,EAAG,IAAKF,GACVG,IAAYC,EAAA,GACZC,IAAUC,EAAA,GAsCVC,IAAS,CAACC,GAAKC,GAAKC,IAAU,CAAA,MAAO;AACzC,QAAIF,MAAQC;AACV,aAAO;AAGT,IAAAD,IAAM,IAAIV,EAAMU,GAAKE,CAAO,GAC5BD,IAAM,IAAIX,EAAMW,GAAKC,CAAO;AAC5B,QAAIC,IAAa;AAEjB,IAAAC,EAAO,YAAWC,KAAaL,EAAI,KAAK;AACtC,iBAAWM,KAAaL,EAAI,KAAK;AAC/B,cAAMM,IAAQC,EAAaH,GAAWC,GAAWJ,CAAO;AAExD,YADAC,IAAaA,KAAcI,MAAU,MACjCA;AACF,mBAASH;AAAA,MAEjB;AAKI,UAAID;AACF,eAAO;AAAA,IAEb;AACE,WAAO;AAAA,EACT,GAEMM,IAA+B,CAAC,IAAIjB,EAAW,WAAW,CAAC,GAC3DkB,IAAiB,CAAC,IAAIlB,EAAW,SAAS,CAAC,GAE3CgB,IAAe,CAACR,GAAKC,GAAKC,MAAY;AAC1C,QAAIF,MAAQC;AACV,aAAO;AAGT,QAAID,EAAI,WAAW,KAAKA,EAAI,CAAC,EAAE,WAAWN,GAAK;AAC7C,UAAIO,EAAI,WAAW,KAAKA,EAAI,CAAC,EAAE,WAAWP;AACxC,eAAO;AACF,MAAIQ,EAAQ,oBACjBF,IAAMS,IAENT,IAAMU;AAAA,IAEZ;AAEE,QAAIT,EAAI,WAAW,KAAKA,EAAI,CAAC,EAAE,WAAWP,GAAK;AAC7C,UAAIQ,EAAQ;AACV,eAAO;AAEP,MAAAD,IAAMS;AAAA,IAEZ;AAEE,UAAMC,IAAQ,oBAAI,IAAG;AACrB,QAAIC,GAAIC;AACR,eAAWC,KAAKd;AACd,MAAIc,EAAE,aAAa,OAAOA,EAAE,aAAa,OACvCF,IAAKG,EAASH,GAAIE,GAAGZ,CAAO,IACnBY,EAAE,aAAa,OAAOA,EAAE,aAAa,OAC9CD,IAAKG,EAAQH,GAAIC,GAAGZ,CAAO,IAE3BS,EAAM,IAAIG,EAAE,MAAM;AAItB,QAAIH,EAAM,OAAO;AACf,aAAO;AAGT,QAAIM;AACJ,QAAIL,KAAMC,GAAI;AAEZ,UADAI,IAAWpB,EAAQe,EAAG,QAAQC,EAAG,QAAQX,CAAO,GAC5Ce,IAAW;AACb,eAAO;AACF,UAAIA,MAAa,MAAML,EAAG,aAAa,QAAQC,EAAG,aAAa;AACpE,eAAO;AAAA,IAEb;AAGE,eAAWK,KAAMP,GAAO;AAKtB,UAJIC,KAAM,CAACjB,EAAUuB,GAAI,OAAON,CAAE,GAAGV,CAAO,KAIxCW,KAAM,CAAClB,EAAUuB,GAAI,OAAOL,CAAE,GAAGX,CAAO;AAC1C,eAAO;AAGT,iBAAWY,KAAKb;AACd,YAAI,CAACN,EAAUuB,GAAI,OAAOJ,CAAC,GAAGZ,CAAO;AACnC,iBAAO;AAIX,aAAO;AAAA,IACX;AAEE,QAAIiB,GAAQC,GACRC,GAAUC,GAGVC,IAAeV,KACjB,CAACX,EAAQ,qBACTW,EAAG,OAAO,WAAW,SAASA,EAAG,SAAS,IACxCW,IAAeZ,KACjB,CAACV,EAAQ,qBACTU,EAAG,OAAO,WAAW,SAASA,EAAG,SAAS;AAE5C,IAAIW,KAAgBA,EAAa,WAAW,WAAW,KACnDV,EAAG,aAAa,OAAOU,EAAa,WAAW,CAAC,MAAM,MACxDA,IAAe;AAGjB,eAAWT,KAAKb,GAAK;AAGnB,UAFAqB,IAAWA,KAAYR,EAAE,aAAa,OAAOA,EAAE,aAAa,MAC5DO,IAAWA,KAAYP,EAAE,aAAa,OAAOA,EAAE,aAAa,MACxDF;AASF,YARIY,KACEV,EAAE,OAAO,cAAcA,EAAE,OAAO,WAAW,UAC3CA,EAAE,OAAO,UAAUU,EAAa,SAChCV,EAAE,OAAO,UAAUU,EAAa,SAChCV,EAAE,OAAO,UAAUU,EAAa,UAClCA,IAAe,KAGfV,EAAE,aAAa,OAAOA,EAAE,aAAa;AAEvC,cADAK,IAASJ,EAASH,GAAIE,GAAGZ,CAAO,GAC5BiB,MAAWL,KAAKK,MAAWP;AAC7B,mBAAO;AAAA,mBAEAA,EAAG,aAAa,QAAQ,CAACjB,EAAUiB,EAAG,QAAQ,OAAOE,CAAC,GAAGZ,CAAO;AACzE,iBAAO;AAAA;AAGX,UAAIW;AASF,YARIU,KACET,EAAE,OAAO,cAAcA,EAAE,OAAO,WAAW,UAC3CA,EAAE,OAAO,UAAUS,EAAa,SAChCT,EAAE,OAAO,UAAUS,EAAa,SAChCT,EAAE,OAAO,UAAUS,EAAa,UAClCA,IAAe,KAGfT,EAAE,aAAa,OAAOA,EAAE,aAAa;AAEvC,cADAM,IAAQJ,EAAQH,GAAIC,GAAGZ,CAAO,GAC1BkB,MAAUN,KAAKM,MAAUP;AAC3B,mBAAO;AAAA,mBAEAA,EAAG,aAAa,QAAQ,CAAClB,EAAUkB,EAAG,QAAQ,OAAOC,CAAC,GAAGZ,CAAO;AACzE,iBAAO;AAAA;AAGX,UAAI,CAACY,EAAE,aAAaD,KAAMD,MAAOK,MAAa;AAC5C,eAAO;AAAA,IAEb;AAgBE,WAXI,EAAAL,KAAMS,KAAY,CAACR,KAAMI,MAAa,KAItCJ,KAAMS,KAAY,CAACV,KAAMK,MAAa,KAOtCO,KAAgBD;AAAA,EAKtB,GAGMR,IAAW,CAACU,GAAGC,GAAGxB,MAAY;AAClC,QAAI,CAACuB;AACH,aAAOC;AAET,UAAMC,IAAO9B,EAAQ4B,EAAE,QAAQC,EAAE,QAAQxB,CAAO;AAChD,WAAOyB,IAAO,IAAIF,IACdE,IAAO,KACPD,EAAE,aAAa,OAAOD,EAAE,aAAa,OAD1BC,IAEXD;AAAA,EACN,GAGMT,IAAU,CAACS,GAAGC,GAAGxB,MAAY;AACjC,QAAI,CAACuB;AACH,aAAOC;AAET,UAAMC,IAAO9B,EAAQ4B,EAAE,QAAQC,EAAE,QAAQxB,CAAO;AAChD,WAAOyB,IAAO,IAAIF,IACdE,IAAO,KACPD,EAAE,aAAa,OAAOD,EAAE,aAAa,OAD1BC,IAEXD;AAAA,EACN;AAEA,SAAAG,IAAiB7B;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("../classes/range.cjs.js");var r,e;function u(){if(e)return r;e=1;const o=s.__require();return r=(t,a)=>new o(t,a).set.map(i=>i.map(n=>n.value).join(" ").trim().split(" ")),r}exports.__require=u;
-//# sourceMappingURL=to-comparators.cjs.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"to-comparators.cjs.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n"],"names":["Range","require$$0","toComparators_1","range","options","comp","c"],"mappings":"kKAEA,MAAMA,EAAQC,EAAAA,UAAA,EAOd,OAAAC,EAJsB,CAACC,EAAOC,IAC5B,IAAIJ,EAAMG,EAAOC,CAAO,EAAE,IACvB,IAAIC,GAAQA,EAAK,IAAIC,GAAKA,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAI,EAAG,MAAM,GAAG,CAAC","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.es.js

@@ -1,12 +0,0 @@
-import { __require as m } from "../classes/range.es.js";
-var r, o;
-function u() {
-  if (o) return r;
-  o = 1;
-  const a = m();
-  return r = (e, t) => new a(e, t).set.map((s) => s.map((i) => i.value).join(" ").trim().split(" ")), r;
-}
-export {
-  u as __require
-};
-//# sourceMappingURL=to-comparators.es.js.map

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"to-comparators.es.js","sources":["../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/to-comparators.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n"],"names":["Range","require$$0","toComparators_1","range","options","comp","c"],"mappings":";;;;;AAEA,QAAMA,IAAQC,EAAA;AAOd,SAAAC,IAJsB,CAACC,GAAOC,MAC5B,IAAIJ,EAAMG,GAAOC,CAAO,EAAE,IACvB,IAAI,CAAAC,MAAQA,EAAK,IAAI,CAAAC,MAAKA,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAI,EAAG,MAAM,GAAG,CAAC;;","x_google_ignoreList":[0]}