@spotlightjs/spotlight 4.5.0 → 4.6.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"re.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":["require$$0","require$$1","re"],"mappings":";;;;AAEA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,EACF,IAAIA;AACJ,QAAM,QAAQC;AACd,YAAU,iBAAiB,CAAA;AAG3B,QAAMC,MAAK,QAAA,KAAa,CAAA;AACxB,QAAM,SAAS,QAAA,SAAiB,CAAA;AAChC,QAAM,MAAM,QAAA,MAAc,CAAA;AAC1B,QAAM,UAAU,QAAA,UAAkB,CAAA;AAClC,QAAM,IAAI,QAAA,IAAY,CAAA;AACtB,MAAI,IAAI;AAER,QAAM,mBAAmB;AAQzB,QAAM,wBAAwB;AAAA,IAC5B,CAAC,OAAO,CAAC;AAAA,IACT,CAAC,OAAO,UAAU;AAAA,IAClB,CAAC,kBAAkB,qBAAqB;AAAA;AAG1C,QAAM,gBAAgB,CAAC,UAAU;AAC/B,eAAW,CAAC,OAAO,GAAG,KAAK,uBAAuB;AAChD,cAAQ,MACL,MAAM,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG,EAC5C,MAAM,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,GAAG;AAAA,IACnD;AACE,WAAO;AAAA,EACT;AAEA,QAAM,cAAc,CAAC,MAAM,OAAO,aAAa;AAC7C,UAAM,OAAO,cAAc,KAAK;AAChC,UAAM,QAAQ;AACd,UAAM,MAAM,OAAO,KAAK;AACxB,MAAE,IAAI,IAAI;AACV,QAAI,KAAK,IAAI;AACb,YAAQ,KAAK,IAAI;AACjB,IAAAA,IAAG,KAAK,IAAI,IAAI,OAAO,OAAO,WAAW,MAAM,MAAS;AACxD,WAAO,KAAK,IAAI,IAAI,OAAO,MAAM,WAAW,MAAM,MAAS;AAAA,EAC7D;AAQA,cAAY,qBAAqB,aAAa;AAC9C,cAAY,0BAA0B,MAAM;AAM5C,cAAY,wBAAwB,gBAAgB,gBAAgB,GAAG;AAKvE,cAAY,eAAe,IAAI,IAAI,EAAE,iBAAiB,CAAC,QAChC,IAAI,EAAE,iBAAiB,CAAC,QACxB,IAAI,EAAE,iBAAiB,CAAC,GAAG;AAElD,cAAY,oBAAoB,IAAI,IAAI,EAAE,sBAAsB,CAAC,QACrC,IAAI,EAAE,sBAAsB,CAAC,QAC7B,IAAI,EAAE,sBAAsB,CAAC,GAAG;AAO5D,cAAY,wBAAwB,MAAM,IAAI,EAAE,oBAAoB,KAChE,IAAI,EAAE,iBAAiB,CAAC,GAAG;AAE/B,cAAY,6BAA6B,MAAM,IAAI,EAAE,oBAAoB,KACrE,IAAI,EAAE,sBAAsB,CAAC,GAAG;AAMpC,cAAY,cAAc,QAAQ,IAAI,EAAE,oBAAoB,UACnD,IAAI,EAAE,oBAAoB,CAAC,MAAM;AAE1C,cAAY,mBAAmB,SAAS,IAAI,EAAE,yBAAyB,UAC9D,IAAI,EAAE,yBAAyB,CAAC,MAAM;AAK/C,cAAY,mBAAmB,GAAG,gBAAgB,GAAG;AAMrD,cAAY,SAAS,UAAU,IAAI,EAAE,eAAe,UAC3C,IAAI,EAAE,eAAe,CAAC,MAAM;AAWrC,cAAY,aAAa,KAAK,IAAI,EAAE,WAAW,IAC5C,IAAI,EAAE,UAAU,CAAC,IAClB,IAAI,EAAE,KAAK,CAAC,GAAG;AAEjB,cAAY,QAAQ,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG;AAK3C,cAAY,cAAc,WAAW,IAAI,EAAE,gBAAgB,IACxD,IAAI,EAAE,eAAe,CAAC,IACvB,IAAI,EAAE,KAAK,CAAC,GAAG;AAEjB,cAAY,SAAS,IAAI,IAAI,EAAE,UAAU,CAAC,GAAG;AAE7C,cAAY,QAAQ,cAAc;AAKlC,cAAY,yBAAyB,GAAG,IAAI,EAAE,sBAAsB,CAAC,UAAU;AAC/E,cAAY,oBAAoB,GAAG,IAAI,EAAE,iBAAiB,CAAC,UAAU;AAErE,cAAY,eAAe,YAAY,IAAI,EAAE,gBAAgB,CAAC,WACjC,IAAI,EAAE,gBAAgB,CAAC,WACvB,IAAI,EAAE,gBAAgB,CAAC,OAC3B,IAAI,EAAE,UAAU,CAAC,KACrB,IAAI,EAAE,KAAK,CAAC,OACR;AAEzB,cAAY,oBAAoB,YAAY,IAAI,EAAE,qBAAqB,CAAC,WACtC,IAAI,EAAE,qBAAqB,CAAC,WAC5B,IAAI,EAAE,qBAAqB,CAAC,OAChC,IAAI,EAAE,eAAe,CAAC,KAC1B,IAAI,EAAE,KAAK,CAAC,OACR;AAE9B,cAAY,UAAU,IAAI,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,cAAY,eAAe,IAAI,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAI3E,cAAY,eAAe,GAAG,mBACP,GAAG,yBAAyB,kBACrB,yBAAyB,oBACzB,yBAAyB,MAAM;AAC7D,cAAY,UAAU,GAAG,IAAI,EAAE,WAAW,CAAC,cAAc;AACzD,cAAY,cAAc,IAAI,EAAE,WAAW,IAC7B,MAAM,IAAI,EAAE,UAAU,CAAC,QACjB,IAAI,EAAE,KAAK,CAAC,gBACJ;AAC5B,cAAY,aAAa,IAAI,EAAE,MAAM,GAAG,IAAI;AAC5C,cAAY,iBAAiB,IAAI,EAAE,UAAU,GAAG,IAAI;AAIpD,cAAY,aAAa,SAAS;AAElC,cAAY,aAAa,SAAS,IAAI,EAAE,SAAS,CAAC,QAAQ,IAAI;AAC9D,UAAA,mBAA2B;AAE3B,cAAY,SAAS,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,cAAY,cAAc,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAI3E,cAAY,aAAa,SAAS;AAElC,cAAY,aAAa,SAAS,IAAI,EAAE,SAAS,CAAC,QAAQ,IAAI;AAC9D,UAAA,mBAA2B;AAE3B,cAAY,SAAS,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG;AACjE,cAAY,cAAc,IAAI,IAAI,EAAE,SAAS,CAAC,GAAG,IAAI,EAAE,gBAAgB,CAAC,GAAG;AAG3E,cAAY,mBAAmB,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,UAAU,CAAC,OAAO;AAC9E,cAAY,cAAc,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,SAAS,CAAC,OAAO;AAIxE,cAAY,kBAAkB,SAAS,IAAI,EAAE,IAAI,SACzC,IAAI,EAAE,UAAU,CAAC,IAAI,IAAI,EAAE,WAAW,CAAC,KAAK,IAAI;AACxD,UAAA,wBAAgC;AAMhC,cAAY,eAAe,SAAS,IAAI,EAAE,WAAW,CAAC,cAE/B,IAAI,EAAE,WAAW,CAAC,QACf;AAE1B,cAAY,oBAAoB,SAAS,IAAI,EAAE,gBAAgB,CAAC,cAEpC,IAAI,EAAE,gBAAgB,CAAC,QACpB;AAG/B,cAAY,QAAQ,iBAAiB;AAErC,cAAY,QAAQ,2BAA2B;AAC/C,cAAY,WAAW,6BAA6B;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,8 @@
+import { o as outside_1 } from "./outside.js";
+const outside = outside_1;
+const gtr = (version, range, options) => outside(version, range, ">", options);
+var gtr_1 = gtr;
+export {
+  gtr_1 as g
+};
+//# sourceMappingURL=gtr.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"gtr.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":["require$$0"],"mappings":";AAGA,MAAM,UAAUA;AAChB,MAAM,MAAM,CAAC,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;AAC7E,IAAA,QAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,12 @@
+import { __require as requireRange } from "../classes/range.js";
+const Range = requireRange();
+const intersects = (r1, r2, options) => {
+  r1 = new Range(r1, options);
+  r2 = new Range(r2, options);
+  return r1.intersects(r2, options);
+};
+var intersects_1 = intersects;
+export {
+  intersects_1 as i
+};
+//# sourceMappingURL=intersects.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"intersects.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":["require$$0"],"mappings":";AAEA,MAAM,QAAQA,aAAA;AACd,MAAM,aAAa,CAAC,IAAI,IAAI,YAAY;AACtC,OAAK,IAAI,MAAM,IAAI,OAAO;AAC1B,OAAK,IAAI,MAAM,IAAI,OAAO;AAC1B,SAAO,GAAG,WAAW,IAAI,OAAO;AAClC;AACA,IAAA,eAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,8 @@
+import { o as outside_1 } from "./outside.js";
+const outside = outside_1;
+const ltr = (version, range, options) => outside(version, range, "<", options);
+var ltr_1 = ltr;
+export {
+  ltr_1 as l
+};
+//# sourceMappingURL=ltr.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"ltr.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":["require$$0"],"mappings":";AAEA,MAAM,UAAUA;AAEhB,MAAM,MAAM,CAAC,SAAS,OAAO,YAAY,QAAQ,SAAS,OAAO,KAAK,OAAO;AAC7E,IAAA,QAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,28 @@
+import { s as semver } from "../classes/semver.js";
+import { __require as requireRange } from "../classes/range.js";
+const SemVer = semver;
+const Range = requireRange();
+const maxSatisfying = (versions, range, options) => {
+  let max = null;
+  let maxSV = null;
+  let rangeObj = null;
+  try {
+    rangeObj = new Range(range, options);
+  } catch (er) {
+    return null;
+  }
+  versions.forEach((v) => {
+    if (rangeObj.test(v)) {
+      if (!max || maxSV.compare(v) === -1) {
+        max = v;
+        maxSV = new SemVer(max, options);
+      }
+    }
+  });
+  return max;
+};
+var maxSatisfying_1 = maxSatisfying;
+export {
+  maxSatisfying_1 as m
+};
+//# sourceMappingURL=max-satisfying.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"max-satisfying.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":["require$$0","require$$1"],"mappings":";;AAEA,MAAM,SAASA;AACf,MAAM,QAAQC,aAAA;AAEd,MAAM,gBAAgB,CAAC,UAAU,OAAO,YAAY;AAClD,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI;AACF,eAAW,IAAI,MAAM,OAAO,OAAO;AAAA,EACvC,SAAW,IAAI;AACX,WAAO;AAAA,EACX;AACE,WAAS,QAAQ,CAAC,MAAM;AACtB,QAAI,SAAS,KAAK,CAAC,GAAG;AAEpB,UAAI,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,IAAI;AAEnC,cAAM;AACN,gBAAQ,IAAI,OAAO,KAAK,OAAO;AAAA,MACvC;AAAA,IACA;AAAA,EACA,CAAG;AACD,SAAO;AACT;AACA,IAAA,kBAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,28 @@
+import { s as semver } from "../classes/semver.js";
+import { __require as requireRange } from "../classes/range.js";
+const SemVer = semver;
+const Range = requireRange();
+const minSatisfying = (versions, range, options) => {
+  let min = null;
+  let minSV = null;
+  let rangeObj = null;
+  try {
+    rangeObj = new Range(range, options);
+  } catch (er) {
+    return null;
+  }
+  versions.forEach((v) => {
+    if (rangeObj.test(v)) {
+      if (!min || minSV.compare(v) === 1) {
+        min = v;
+        minSV = new SemVer(min, options);
+      }
+    }
+  });
+  return min;
+};
+var minSatisfying_1 = minSatisfying;
+export {
+  minSatisfying_1 as m
+};
+//# sourceMappingURL=min-satisfying.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"min-satisfying.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":["require$$0","require$$1"],"mappings":";;AAEA,MAAM,SAASA;AACf,MAAM,QAAQC,aAAA;AACd,MAAM,gBAAgB,CAAC,UAAU,OAAO,YAAY;AAClD,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,MAAI;AACF,eAAW,IAAI,MAAM,OAAO,OAAO;AAAA,EACvC,SAAW,IAAI;AACX,WAAO;AAAA,EACX;AACE,WAAS,QAAQ,CAAC,MAAM;AACtB,QAAI,SAAS,KAAK,CAAC,GAAG;AAEpB,UAAI,CAAC,OAAO,MAAM,QAAQ,CAAC,MAAM,GAAG;AAElC,cAAM;AACN,gBAAQ,IAAI,OAAO,KAAK,OAAO;AAAA,MACvC;AAAA,IACA;AAAA,EACA,CAAG;AACD,SAAO;AACT;AACA,IAAA,kBAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,57 @@
+import { s as semver } from "../classes/semver.js";
+import { __require as requireRange } from "../classes/range.js";
+import { g as gt_1 } from "../functions/gt.js";
+const SemVer = semver;
+const Range = requireRange();
+const gt = gt_1;
+const minVersion = (range, loose) => {
+  range = new Range(range, loose);
+  let minver = new SemVer("0.0.0");
+  if (range.test(minver)) {
+    return minver;
+  }
+  minver = new SemVer("0.0.0-0");
+  if (range.test(minver)) {
+    return minver;
+  }
+  minver = null;
+  for (let i = 0; i < range.set.length; ++i) {
+    const comparators = range.set[i];
+    let setMin = null;
+    comparators.forEach((comparator) => {
+      const compver = new SemVer(comparator.semver.version);
+      switch (comparator.operator) {
+        case ">":
+          if (compver.prerelease.length === 0) {
+            compver.patch++;
+          } else {
+            compver.prerelease.push(0);
+          }
+          compver.raw = compver.format();
+        case "":
+        case ">=":
+          if (!setMin || gt(compver, setMin)) {
+            setMin = compver;
+          }
+          break;
+        case "<":
+        case "<=":
+          break;
+        default:
+          throw new Error(`Unexpected operation: ${comparator.operator}`);
+      }
+    });
+    if (setMin && (!minver || gt(minver, setMin))) {
+      minver = setMin;
+    }
+  }
+  if (minver && range.test(minver)) {
+    return minver;
+  }
+  return null;
+};
+var minVersion_1 = minVersion;
+export {
+  minVersion_1 as m
+};
+//# sourceMappingURL=min-version.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"min-version.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":["require$$0","require$$1","require$$2"],"mappings":";;;AAEA,MAAM,SAASA;AACf,MAAM,QAAQC,aAAA;AACd,MAAM,KAAKC;AAEX,MAAM,aAAa,CAAC,OAAO,UAAU;AACnC,UAAQ,IAAI,MAAM,OAAO,KAAK;AAE9B,MAAI,SAAS,IAAI,OAAO,OAAO;AAC/B,MAAI,MAAM,KAAK,MAAM,GAAG;AACtB,WAAO;AAAA,EACX;AAEE,WAAS,IAAI,OAAO,SAAS;AAC7B,MAAI,MAAM,KAAK,MAAM,GAAG;AACtB,WAAO;AAAA,EACX;AAEE,WAAS;AACT,WAAS,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;AACzC,UAAM,cAAc,MAAM,IAAI,CAAC;AAE/B,QAAI,SAAS;AACb,gBAAY,QAAQ,CAAC,eAAe;AAElC,YAAM,UAAU,IAAI,OAAO,WAAW,OAAO,OAAO;AACpD,cAAQ,WAAW,UAAQ;AAAA,QACzB,KAAK;AACH,cAAI,QAAQ,WAAW,WAAW,GAAG;AACnC,oBAAQ;AAAA,UACpB,OAAiB;AACL,oBAAQ,WAAW,KAAK,CAAC;AAAA,UACrC;AACU,kBAAQ,MAAM,QAAQ,OAAM;AAAA,QAE9B,KAAK;AAAA,QACL,KAAK;AACH,cAAI,CAAC,UAAU,GAAG,SAAS,MAAM,GAAG;AAClC,qBAAS;AAAA,UACrB;AACU;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AAEH;AAAA,QAEF;AACE,gBAAM,IAAI,MAAM,yBAAyB,WAAW,QAAQ,EAAE;AAAA,MACxE;AAAA,IACA,CAAK;AACD,QAAI,WAAW,CAAC,UAAU,GAAG,QAAQ,MAAM,IAAI;AAC7C,eAAS;AAAA,IACf;AAAA,EACA;AAEE,MAAI,UAAU,MAAM,KAAK,MAAM,GAAG;AAChC,WAAO;AAAA,EACX;AAEE,SAAO;AACT;AACA,IAAA,eAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,74 @@
+import { s as semver } from "../classes/semver.js";
+import { __require as requireComparator } from "../classes/comparator.js";
+import { __require as requireRange } from "../classes/range.js";
+import { s as satisfies_1 } from "../functions/satisfies.js";
+import { g as gt_1 } from "../functions/gt.js";
+import { l as lt_1 } from "../functions/lt.js";
+import { l as lte_1 } from "../functions/lte.js";
+import { g as gte_1 } from "../functions/gte.js";
+const SemVer = semver;
+const Comparator = requireComparator();
+const { ANY } = Comparator;
+const Range = requireRange();
+const satisfies = satisfies_1;
+const gt = gt_1;
+const lt = lt_1;
+const lte = lte_1;
+const gte = gte_1;
+const outside = (version, range, hilo, options) => {
+  version = new SemVer(version, options);
+  range = new Range(range, options);
+  let gtfn, ltefn, ltfn, comp, ecomp;
+  switch (hilo) {
+    case ">":
+      gtfn = gt;
+      ltefn = lte;
+      ltfn = lt;
+      comp = ">";
+      ecomp = ">=";
+      break;
+    case "<":
+      gtfn = lt;
+      ltefn = gte;
+      ltfn = gt;
+      comp = "<";
+      ecomp = "<=";
+      break;
+    default:
+      throw new TypeError('Must provide a hilo val of "<" or ">"');
+  }
+  if (satisfies(version, range, options)) {
+    return false;
+  }
+  for (let i = 0; i < range.set.length; ++i) {
+    const comparators = range.set[i];
+    let high = null;
+    let low = null;
+    comparators.forEach((comparator) => {
+      if (comparator.semver === ANY) {
+        comparator = new Comparator(">=0.0.0");
+      }
+      high = high || comparator;
+      low = low || comparator;
+      if (gtfn(comparator.semver, high.semver, options)) {
+        high = comparator;
+      } else if (ltfn(comparator.semver, low.semver, options)) {
+        low = comparator;
+      }
+    });
+    if (high.operator === comp || high.operator === ecomp) {
+      return false;
+    }
+    if ((!low.operator || low.operator === comp) && ltefn(version, low.semver)) {
+      return false;
+    } else if (low.operator === ecomp && ltfn(version, low.semver)) {
+      return false;
+    }
+  }
+  return true;
+};
+var outside_1 = outside;
+export {
+  outside_1 as o
+};
+//# sourceMappingURL=outside.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"outside.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":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7"],"mappings":";;;;;;;;AAEA,MAAM,SAASA;AACf,MAAM,aAAaC,kBAAA;AACnB,MAAM,EAAE,IAAG,IAAK;AAChB,MAAM,QAAQC,aAAA;AACd,MAAM,YAAYC;AAClB,MAAM,KAAKC;AACX,MAAM,KAAKC;AACX,MAAM,MAAMC;AACZ,MAAM,MAAMC;AAEZ,MAAM,UAAU,CAAC,SAAS,OAAO,MAAM,YAAY;AACjD,YAAU,IAAI,OAAO,SAAS,OAAO;AACrC,UAAQ,IAAI,MAAM,OAAO,OAAO;AAEhC,MAAI,MAAM,OAAO,MAAM,MAAM;AAC7B,UAAQ,MAAI;AAAA,IACV,KAAK;AACH,aAAO;AACP,cAAQ;AACR,aAAO;AACP,aAAO;AACP,cAAQ;AACR;AAAA,IACF,KAAK;AACH,aAAO;AACP,cAAQ;AACR,aAAO;AACP,aAAO;AACP,cAAQ;AACR;AAAA,IACF;AACE,YAAM,IAAI,UAAU,uCAAuC;AAAA,EACjE;AAGE,MAAI,UAAU,SAAS,OAAO,OAAO,GAAG;AACtC,WAAO;AAAA,EACX;AAKE,WAAS,IAAI,GAAG,IAAI,MAAM,IAAI,QAAQ,EAAE,GAAG;AACzC,UAAM,cAAc,MAAM,IAAI,CAAC;AAE/B,QAAI,OAAO;AACX,QAAI,MAAM;AAEV,gBAAY,QAAQ,CAAC,eAAe;AAClC,UAAI,WAAW,WAAW,KAAK;AAC7B,qBAAa,IAAI,WAAW,SAAS;AAAA,MAC7C;AACM,aAAO,QAAQ;AACf,YAAM,OAAO;AACb,UAAI,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO,GAAG;AACjD,eAAO;AAAA,MACf,WAAiB,KAAK,WAAW,QAAQ,IAAI,QAAQ,OAAO,GAAG;AACvD,cAAM;AAAA,MACd;AAAA,IACA,CAAK;AAID,QAAI,KAAK,aAAa,QAAQ,KAAK,aAAa,OAAO;AACrD,aAAO;AAAA,IACb;AAII,SAAK,CAAC,IAAI,YAAY,IAAI,aAAa,SACnC,MAAM,SAAS,IAAI,MAAM,GAAG;AAC9B,aAAO;AAAA,IACb,WAAe,IAAI,aAAa,SAAS,KAAK,SAAS,IAAI,MAAM,GAAG;AAC9D,aAAO;AAAA,IACb;AAAA,EACA;AACE,SAAO;AACT;AAEA,IAAA,YAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,49 @@
+import { s as satisfies_1 } from "../functions/satisfies.js";
+import { c as compare_1 } from "../functions/compare.js";
+const satisfies = satisfies_1;
+const compare = compare_1;
+var simplify = (versions, range, options) => {
+  const set = [];
+  let first = null;
+  let prev = null;
+  const v = versions.sort((a, b) => compare(a, b, options));
+  for (const version of v) {
+    const included = satisfies(version, range, options);
+    if (included) {
+      prev = version;
+      if (!first) {
+        first = version;
+      }
+    } else {
+      if (prev) {
+        set.push([first, prev]);
+      }
+      prev = null;
+      first = null;
+    }
+  }
+  if (first) {
+    set.push([first, null]);
+  }
+  const ranges = [];
+  for (const [min, max] of set) {
+    if (min === max) {
+      ranges.push(min);
+    } else if (!max && min === v[0]) {
+      ranges.push("*");
+    } else if (!max) {
+      ranges.push(`>=${min}`);
+    } else if (min === v[0]) {
+      ranges.push(`<=${max}`);
+    } else {
+      ranges.push(`${min} - ${max}`);
+    }
+  }
+  const simplified = ranges.join(" || ");
+  const original = typeof range.raw === "string" ? range.raw : String(range);
+  return simplified.length < original.length ? simplified : range;
+};
+export {
+  simplify as s
+};
+//# sourceMappingURL=simplify.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"simplify.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":["require$$0","require$$1"],"mappings":";;AAKA,MAAM,YAAYA;AAClB,MAAM,UAAUC;AAChB,IAAA,WAAiB,CAAC,UAAU,OAAO,YAAY;AAC7C,QAAM,MAAM,CAAA;AACZ,MAAI,QAAQ;AACZ,MAAI,OAAO;AACX,QAAM,IAAI,SAAS,KAAK,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,OAAO,CAAC;AACxD,aAAW,WAAW,GAAG;AACvB,UAAM,WAAW,UAAU,SAAS,OAAO,OAAO;AAClD,QAAI,UAAU;AACZ,aAAO;AACP,UAAI,CAAC,OAAO;AACV,gBAAQ;AAAA,MAChB;AAAA,IACA,OAAW;AACL,UAAI,MAAM;AACR,YAAI,KAAK,CAAC,OAAO,IAAI,CAAC;AAAA,MAC9B;AACM,aAAO;AACP,cAAQ;AAAA,IACd;AAAA,EACA;AACE,MAAI,OAAO;AACT,QAAI,KAAK,CAAC,OAAO,IAAI,CAAC;AAAA,EAC1B;AAEE,QAAM,SAAS,CAAA;AACf,aAAW,CAAC,KAAK,GAAG,KAAK,KAAK;AAC5B,QAAI,QAAQ,KAAK;AACf,aAAO,KAAK,GAAG;AAAA,IACrB,WAAe,CAAC,OAAO,QAAQ,EAAE,CAAC,GAAG;AAC/B,aAAO,KAAK,GAAG;AAAA,IACrB,WAAe,CAAC,KAAK;AACf,aAAO,KAAK,KAAK,GAAG,EAAE;AAAA,IAC5B,WAAe,QAAQ,EAAE,CAAC,GAAG;AACvB,aAAO,KAAK,KAAK,GAAG,EAAE;AAAA,IAC5B,OAAW;AACL,aAAO,KAAK,GAAG,GAAG,MAAM,GAAG,EAAE;AAAA,IACnC;AAAA,EACA;AACE,QAAM,aAAa,OAAO,KAAK,MAAM;AACrC,QAAM,WAAW,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM,OAAO,KAAK;AACzE,SAAO,WAAW,SAAS,SAAS,SAAS,aAAa;AAC5D;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,163 @@
+import { __require as requireRange } from "../classes/range.js";
+import { __require as requireComparator } from "../classes/comparator.js";
+import { s as satisfies_1 } from "../functions/satisfies.js";
+import { c as compare_1 } from "../functions/compare.js";
+const Range = requireRange();
+const Comparator = requireComparator();
+const { ANY } = Comparator;
+const satisfies = satisfies_1;
+const compare = compare_1;
+const subset = (sub, dom, options = {}) => {
+  if (sub === dom) {
+    return true;
+  }
+  sub = new Range(sub, options);
+  dom = new Range(dom, options);
+  let sawNonNull = false;
+  OUTER: for (const simpleSub of sub.set) {
+    for (const simpleDom of dom.set) {
+      const isSub = simpleSubset(simpleSub, simpleDom, options);
+      sawNonNull = sawNonNull || isSub !== null;
+      if (isSub) {
+        continue OUTER;
+      }
+    }
+    if (sawNonNull) {
+      return false;
+    }
+  }
+  return true;
+};
+const minimumVersionWithPreRelease = [new Comparator(">=0.0.0-0")];
+const minimumVersion = [new Comparator(">=0.0.0")];
+const simpleSubset = (sub, dom, options) => {
+  if (sub === dom) {
+    return true;
+  }
+  if (sub.length === 1 && sub[0].semver === ANY) {
+    if (dom.length === 1 && dom[0].semver === ANY) {
+      return true;
+    } else if (options.includePrerelease) {
+      sub = minimumVersionWithPreRelease;
+    } else {
+      sub = minimumVersion;
+    }
+  }
+  if (dom.length === 1 && dom[0].semver === ANY) {
+    if (options.includePrerelease) {
+      return true;
+    } else {
+      dom = minimumVersion;
+    }
+  }
+  const eqSet = /* @__PURE__ */ new Set();
+  let gt, lt;
+  for (const c of sub) {
+    if (c.operator === ">" || c.operator === ">=") {
+      gt = higherGT(gt, c, options);
+    } else if (c.operator === "<" || c.operator === "<=") {
+      lt = lowerLT(lt, c, options);
+    } else {
+      eqSet.add(c.semver);
+    }
+  }
+  if (eqSet.size > 1) {
+    return null;
+  }
+  let gtltComp;
+  if (gt && lt) {
+    gtltComp = compare(gt.semver, lt.semver, options);
+    if (gtltComp > 0) {
+      return null;
+    } else if (gtltComp === 0 && (gt.operator !== ">=" || lt.operator !== "<=")) {
+      return null;
+    }
+  }
+  for (const eq of eqSet) {
+    if (gt && !satisfies(eq, String(gt), options)) {
+      return null;
+    }
+    if (lt && !satisfies(eq, String(lt), options)) {
+      return null;
+    }
+    for (const c of dom) {
+      if (!satisfies(eq, String(c), options)) {
+        return false;
+      }
+    }
+    return true;
+  }
+  let higher, lower;
+  let hasDomLT, hasDomGT;
+  let needDomLTPre = lt && !options.includePrerelease && lt.semver.prerelease.length ? lt.semver : false;
+  let needDomGTPre = gt && !options.includePrerelease && gt.semver.prerelease.length ? gt.semver : false;
+  if (needDomLTPre && needDomLTPre.prerelease.length === 1 && lt.operator === "<" && needDomLTPre.prerelease[0] === 0) {
+    needDomLTPre = false;
+  }
+  for (const c of dom) {
+    hasDomGT = hasDomGT || c.operator === ">" || c.operator === ">=";
+    hasDomLT = hasDomLT || c.operator === "<" || c.operator === "<=";
+    if (gt) {
+      if (needDomGTPre) {
+        if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomGTPre.major && c.semver.minor === needDomGTPre.minor && c.semver.patch === needDomGTPre.patch) {
+          needDomGTPre = false;
+        }
+      }
+      if (c.operator === ">" || c.operator === ">=") {
+        higher = higherGT(gt, c, options);
+        if (higher === c && higher !== gt) {
+          return false;
+        }
+      } else if (gt.operator === ">=" && !satisfies(gt.semver, String(c), options)) {
+        return false;
+      }
+    }
+    if (lt) {
+      if (needDomLTPre) {
+        if (c.semver.prerelease && c.semver.prerelease.length && c.semver.major === needDomLTPre.major && c.semver.minor === needDomLTPre.minor && c.semver.patch === needDomLTPre.patch) {
+          needDomLTPre = false;
+        }
+      }
+      if (c.operator === "<" || c.operator === "<=") {
+        lower = lowerLT(lt, c, options);
+        if (lower === c && lower !== lt) {
+          return false;
+        }
+      } else if (lt.operator === "<=" && !satisfies(lt.semver, String(c), options)) {
+        return false;
+      }
+    }
+    if (!c.operator && (lt || gt) && gtltComp !== 0) {
+      return false;
+    }
+  }
+  if (gt && hasDomLT && !lt && gtltComp !== 0) {
+    return false;
+  }
+  if (lt && hasDomGT && !gt && gtltComp !== 0) {
+    return false;
+  }
+  if (needDomGTPre || needDomLTPre) {
+    return false;
+  }
+  return true;
+};
+const higherGT = (a, b, options) => {
+  if (!a) {
+    return b;
+  }
+  const comp = compare(a.semver, b.semver, options);
+  return comp > 0 ? a : comp < 0 ? b : b.operator === ">" && a.operator === ">=" ? b : a;
+};
+const lowerLT = (a, b, options) => {
+  if (!a) {
+    return b;
+  }
+  const comp = compare(a.semver, b.semver, options);
+  return comp < 0 ? a : comp > 0 ? b : b.operator === "<" && a.operator === "<=" ? b : a;
+};
+var subset_1 = subset;
+export {
+  subset_1 as s
+};
+//# sourceMappingURL=subset.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"subset.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":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;AAEA,MAAM,QAAQA,aAAA;AACd,MAAM,aAAaC,kBAAA;AACnB,MAAM,EAAE,IAAG,IAAK;AAChB,MAAM,YAAYC;AAClB,MAAM,UAAUC;AAsChB,MAAM,SAAS,CAAC,KAAK,KAAK,UAAU,CAAA,MAAO;AACzC,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACX;AAEE,QAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,QAAM,IAAI,MAAM,KAAK,OAAO;AAC5B,MAAI,aAAa;AAEjB,QAAO,YAAW,aAAa,IAAI,KAAK;AACtC,eAAW,aAAa,IAAI,KAAK;AAC/B,YAAM,QAAQ,aAAa,WAAW,WAAW,OAAO;AACxD,mBAAa,cAAc,UAAU;AACrC,UAAI,OAAO;AACT,iBAAS;AAAA,MACjB;AAAA,IACA;AAKI,QAAI,YAAY;AACd,aAAO;AAAA,IACb;AAAA,EACA;AACE,SAAO;AACT;AAEA,MAAM,+BAA+B,CAAC,IAAI,WAAW,WAAW,CAAC;AACjE,MAAM,iBAAiB,CAAC,IAAI,WAAW,SAAS,CAAC;AAEjD,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACX;AAEE,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,QAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,aAAO;AAAA,IACb,WAAe,QAAQ,mBAAmB;AACpC,YAAM;AAAA,IACZ,OAAW;AACL,YAAM;AAAA,IACZ;AAAA,EACA;AAEE,MAAI,IAAI,WAAW,KAAK,IAAI,CAAC,EAAE,WAAW,KAAK;AAC7C,QAAI,QAAQ,mBAAmB;AAC7B,aAAO;AAAA,IACb,OAAW;AACL,YAAM;AAAA,IACZ;AAAA,EACA;AAEE,QAAM,QAAQ,oBAAI,IAAG;AACrB,MAAI,IAAI;AACR,aAAW,KAAK,KAAK;AACnB,QAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,WAAK,SAAS,IAAI,GAAG,OAAO;AAAA,IAClC,WAAe,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AACpD,WAAK,QAAQ,IAAI,GAAG,OAAO;AAAA,IACjC,OAAW;AACL,YAAM,IAAI,EAAE,MAAM;AAAA,IACxB;AAAA,EACA;AAEE,MAAI,MAAM,OAAO,GAAG;AAClB,WAAO;AAAA,EACX;AAEE,MAAI;AACJ,MAAI,MAAM,IAAI;AACZ,eAAW,QAAQ,GAAG,QAAQ,GAAG,QAAQ,OAAO;AAChD,QAAI,WAAW,GAAG;AAChB,aAAO;AAAA,IACb,WAAe,aAAa,MAAM,GAAG,aAAa,QAAQ,GAAG,aAAa,OAAO;AAC3E,aAAO;AAAA,IACb;AAAA,EACA;AAGE,aAAW,MAAM,OAAO;AACtB,QAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,aAAO;AAAA,IACb;AAEI,QAAI,MAAM,CAAC,UAAU,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG;AAC7C,aAAO;AAAA,IACb;AAEI,eAAW,KAAK,KAAK;AACnB,UAAI,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,OAAO,GAAG;AACtC,eAAO;AAAA,MACf;AAAA,IACA;AAEI,WAAO;AAAA,EACX;AAEE,MAAI,QAAQ;AACZ,MAAI,UAAU;AAGd,MAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAC5C,MAAI,eAAe,MACjB,CAAC,QAAQ,qBACT,GAAG,OAAO,WAAW,SAAS,GAAG,SAAS;AAE5C,MAAI,gBAAgB,aAAa,WAAW,WAAW,KACnD,GAAG,aAAa,OAAO,aAAa,WAAW,CAAC,MAAM,GAAG;AAC3D,mBAAe;AAAA,EACnB;AAEE,aAAW,KAAK,KAAK;AACnB,eAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,eAAW,YAAY,EAAE,aAAa,OAAO,EAAE,aAAa;AAC5D,QAAI,IAAI;AACN,UAAI,cAAc;AAChB,YAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,yBAAe;AAAA,QACzB;AAAA,MACA;AACM,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,iBAAS,SAAS,IAAI,GAAG,OAAO;AAChC,YAAI,WAAW,KAAK,WAAW,IAAI;AACjC,iBAAO;AAAA,QACjB;AAAA,MACA,WAAiB,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,eAAO;AAAA,MACf;AAAA,IACA;AACI,QAAI,IAAI;AACN,UAAI,cAAc;AAChB,YAAI,EAAE,OAAO,cAAc,EAAE,OAAO,WAAW,UAC3C,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,SAChC,EAAE,OAAO,UAAU,aAAa,OAAO;AACzC,yBAAe;AAAA,QACzB;AAAA,MACA;AACM,UAAI,EAAE,aAAa,OAAO,EAAE,aAAa,MAAM;AAC7C,gBAAQ,QAAQ,IAAI,GAAG,OAAO;AAC9B,YAAI,UAAU,KAAK,UAAU,IAAI;AAC/B,iBAAO;AAAA,QACjB;AAAA,MACA,WAAiB,GAAG,aAAa,QAAQ,CAAC,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,OAAO,GAAG;AAC5E,eAAO;AAAA,MACf;AAAA,IACA;AACI,QAAI,CAAC,EAAE,aAAa,MAAM,OAAO,aAAa,GAAG;AAC/C,aAAO;AAAA,IACb;AAAA,EACA;AAKE,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,WAAO;AAAA,EACX;AAEE,MAAI,MAAM,YAAY,CAAC,MAAM,aAAa,GAAG;AAC3C,WAAO;AAAA,EACX;AAKE,MAAI,gBAAgB,cAAc;AAChC,WAAO;AAAA,EACX;AAEE,SAAO;AACT;AAGA,MAAM,WAAW,CAAC,GAAG,GAAG,YAAY;AAClC,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACX;AACE,QAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AACN;AAGA,MAAM,UAAU,CAAC,GAAG,GAAG,YAAY;AACjC,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACX;AACE,QAAM,OAAO,QAAQ,EAAE,QAAQ,EAAE,QAAQ,OAAO;AAChD,SAAO,OAAO,IAAI,IACd,OAAO,IAAI,IACX,EAAE,aAAa,OAAO,EAAE,aAAa,OAAO,IAC5C;AACN;AAEA,IAAA,WAAiB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,8 @@
+import { __require as requireRange } from "../classes/range.js";
+const Range = requireRange();
+const toComparators = (range, options) => new Range(range, options).set.map((comp) => comp.map((c) => c.value).join(" ").trim().split(" "));
+var toComparators_1 = toComparators;
+export {
+  toComparators_1 as t
+};
+//# sourceMappingURL=to-comparators.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"to-comparators.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":["require$$0"],"mappings":";AAEA,MAAM,QAAQA,aAAA;AAGd,MAAM,gBAAgB,CAAC,OAAO,YAC5B,IAAI,MAAM,OAAO,OAAO,EAAE,IACvB,IAAI,UAAQ,KAAK,IAAI,OAAK,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAI,EAAG,MAAM,GAAG,CAAC;AAEnE,IAAA,kBAAiB;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/valid.js

@@ -0,0 +1,14 @@
+import { __require as requireRange } from "../classes/range.js";
+const Range = requireRange();
+const validRange = (range, options) => {
+  try {
+    return new Range(range, options).range || "*";
+  } catch (er) {
+    return null;
+  }
+};
+var valid = validRange;
+export {
+  valid as v
+};
+//# sourceMappingURL=valid.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"valid.js","sources":["../../../../../../../../../node_modules/.pnpm/semver@7.7.3/node_modules/semver/ranges/valid.js"],"sourcesContent":["'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n"],"names":["require$$0"],"mappings":";AAEA,MAAM,QAAQA,aAAA;AACd,MAAM,aAAa,CAAC,OAAO,YAAY;AACrC,MAAI;AAGF,WAAO,IAAI,MAAM,OAAO,OAAO,EAAE,SAAS;AAAA,EAC9C,SAAW,IAAI;AACX,WAAO;AAAA,EACX;AACA;AACA,IAAA,QAAiB;","x_google_ignoreList":[0]}