@dbmx/confy 0.0.73 → 0.0.76

package/esm/node_modules/@dbmx/semver/dist/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.esm.js","sources":["../../../../../node_modules/@dbmx/semver/dist/index.esm.js"],"sourcesContent":["import LRU from 'lru-cache';\n\nconst MAX_LENGTH = 256;\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || 9007199254740991;\n\nconst numeric = /^[0-9]+$/;\n\nconst compareIdentifiers = (a, b) => {\n  const anum = numeric.test(a);\n  const bnum = numeric.test(b);\n\n  if (anum && bnum) {\n    a = +a;\n    b = +b;\n  }\n\n  return a === b ? 0\n    : (anum && !bnum) ? -1\n    : (bnum && !anum) ? 1\n    : a < b ? -1\n    : 1\n};\n\nclass SemVerError extends Error {\n  constructor(message) {\n    super(message);\n    this.name = this.constructor.name;\n  }\n}\n\nconst re = [];\nconst src = [];\nconst t = {};\nlet R = 0;\n\nconst createToken = (name, value, isGlobal) => {\n  const index = R++;\n  t[name] = index;\n  src[index] = value;\n  re[index] = new RegExp(value, 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*');\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-][a-zA-Z0-9-]*');\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken(\n  'MAINVERSION',\n  `(${src[t.NUMERICIDENTIFIER]})\\\\.` + `(${src[t.NUMERICIDENTIFIER]})(?:\\\\.` + `(${src[t.NUMERICIDENTIFIER]}))?`,\n);\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]}|${src[t.NONNUMERICIDENTIFIER]})`);\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]}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`);\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', '[0-9A-Za-z-]+');\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]}(?:\\\\.${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', `${src[t.MAINVERSION]}${src[t.PRERELEASE]}?${src[t.BUILD]}?`);\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`);\n\ncreateToken('GTLT', '((?:<|>)?=?)');\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`);\n\n/**\n * Represents a Semantic Version (SemVer) object\n *\n * @function SemVer\n * @tag semver\n * @param {string} - Version to parse\n * @throws {SemVerError} - Throws an error if the provided version is invalid\n * @example\n *\n * expect(SemVer('1.0').parts()).toEqual(2)\n * expect(SemVer('1.0.1').parts()).toEqual(3)\n * expect(SemVer('1.0.1-draft').parts()).toEqual(4)\n * expect(SemVer('1.0').isNonVersioned()).toBeTruthy()\n * expect(SemVer('1.0.1').isNonVersioned()).toBeFalsy()\n *\n * expect(SemVer('1.0').is2Parts()).toBeTruthy()\n * expect(SemVer('1.0').patch).toEqual(null)\n * expect(SemVer('1.0.0').patch).toEqual(0)\n * expect(SemVer('1.0.0').is2Parts()).toBeFalsy()\n * expect(SemVer('1.0.0-draft.1').extension).toEqual('draft.1')\n * expect(() => SemVer('1.0-draft.1')).toThrow(/Invalid version/)\n *\n * expect(SemVer('1.0').isStable()).toBeFalsy()\n * expect(SemVer('0.1.2').isStable()).toBeFalsy()\n * expect(SemVer('3.1.2-draft').isStable()).toBeFalsy()\n * expect(SemVer('3.1.2').isStable()).toBeTruthy()\n *\n * expect(SemVer('1.0').compare('1.0')).toEqual(0)\n * expect(SemVer('1.1').compare('1.0')).toEqual(1)\n * expect(SemVer('1.0').compare('1.0.0')).toEqual(-1)\n * expect(SemVer('1.0.0-draft').compare('1.0')).toEqual(1)\n * expect(SemVer('1.2.1').compare('1.2.1')).toEqual(0)\n * expect(SemVer('1.2.2').compare('1.2.1')).toEqual(1)\n * expect(SemVer('1.2.2').compare('1.2.2-draft')).toEqual(1)\n * expect(SemVer('1.2.2-draft').compare('1.2.2-draft.1')).toEqual(-1)\n *\n */\n\nclass SemVer {\n  constructor(version) {\n    if (version instanceof SemVer) {\n      version = version.version;\n    } else if (typeof version !== 'string') {\n      throw new SemVerError(`Invalid Version: ${JSON.stringify(version, null, 4)}`)\n    }\n\n    if (version.length > MAX_LENGTH) {\n      throw new SemVerError(`version is longer than ${MAX_LENGTH} characters`)\n    }\n\n    const m = version.trim().match(re[t.FULL]);\n\n    if (!m) {\n      throw new SemVerError(`Invalid Version: ${version}`)\n    }\n\n    // these are actually numbers\n    this.major = +m[1];\n    this.minor = +m[2];\n    this.patch = m[3] ? +m[3] : null;\n\n    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n      throw new SemVerError('Invalid major version')\n    }\n\n    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n      throw new SemVerError('Invalid minor version')\n    }\n\n    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n      throw new SemVerError('Invalid patch version')\n    }\n\n    this.extension = m[4] || null;\n\n    if (this.patch === null && this.extension) {\n      throw new SemVerError('Invalid version')\n    }\n\n    this.format();\n  }\n\n  is2Parts() {\n    return this.patch === null\n  }\n\n  parts() {\n    return this.extension === null ? (this.patch === null ? 2 : 3) : 4\n  }\n\n  isNonVersioned() {\n    return this.parts() === 2\n  }\n\n  isStable() {\n    return !this.extension && this.major > 0 && !this.is2Parts()\n  }\n\n  format() {\n    this.version = this.is2Parts() ? `${this.major}.${this.minor}` : `${this.major}.${this.minor}.${this.patch}`;\n    if (this.extension) this.version += `-${this.extension}`;\n    return this.version\n  }\n\n  toString() {\n    return this.version\n  }\n\n  compare(other) {\n    if (!(other instanceof SemVer)) {\n      if (typeof other === 'string' && other === this.version) {\n        return 0\n      }\n      other = new SemVer(other);\n    }\n\n    if (other.version === this.version) {\n      return 0\n    }\n\n    return this.compareMain(other) || this.comparePre(other)\n  }\n\n  compareMain(other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other);\n    }\n\n    return (\n      compareIdentifiers(this.major, other.major) ||\n      compareIdentifiers(this.minor, other.minor) ||\n      this.comparePatch(other)\n    )\n  }\n\n  comparePatch(other) {\n    if (this.patch === other.patch) return 0\n    // if (this.is2Parts() && other.patch === 0) return 0\n    if (this.is2Parts()) return -1\n    if (other.is2Parts()) return 1\n    return compareIdentifiers(this.patch, other.patch)\n  }\n\n  comparePre(other) {\n    if (!(other instanceof SemVer)) {\n      other = new SemVer(other);\n    }\n\n    // NOT having a extension is > having one\n    if (this.extension && !other.extension) {\n      return -1\n    } else if (!this.extension && other.extension) {\n      return 1\n    } else if (!this.extension && !other.extension) {\n      return 0\n    }\n\n    let i = 0;\n    do {\n      const a = this.extension[i];\n      const b = other.extension[i];\n      if (a === undefined && b === undefined) {\n        return 0\n      } else if (b === undefined) {\n        return 1\n      } else if (a === undefined) {\n        return -1\n      } else if (a === b) {\n        continue\n      } else {\n        return compareIdentifiers(a, b)\n      }\n    } while (++i)\n  }\n}\n\nvar SemVer$1 = version => new SemVer(version);\n\n/**\n * Compares two version strings or SemVer instances\n *\n * @function compare\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance (a)\n * @param {string|SemVer} - Second version string or SemVer instance (b)\n * @return {number} - Returns 0 if versions are equal, 1 if `a` is greater than `b`, and -1 if `a` is less than `b`\n * @example\n *\n * compare('1.0.0', '1.2.0'); // -1\n * compare('1.2.0', '1.2.0'); // 0\n * compare('2.0.0', '1.2.0'); // 1\n */\n\nconst compare = (a, b) => SemVer$1(a).compare(SemVer$1(b));\n\n/**\n * Checks if two version strings or SemVer instances are equal\n *\n * @function eq\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance\n * @param {string|SemVer} - Second version string or SemVer instance\n * @return {boolean} - Returns true if the versions are equal, otherwise false\n * @example\n *\n * eq('1.0.0', '1.0.0'); // true\n * eq('1.0.0', '1.2.0'); // false\n */\n\nconst eq = (a, b) => compare(a, b) === 0;\n\n/**\n * Checks if two version strings or SemVer instances are not equal\n *\n * @function neq\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance\n * @param {string|SemVer} - Second version string or SemVer instance\n * @return {boolean} - Returns true if the versions are not equal, otherwise false\n * @example\n *\n * neq('1.0.0', '1.0.0'); // false\n * neq('1.0.0', '1.2.0'); // true\n */\n\nconst neq = (a, b) => compare(a, b) !== 0;\n\n/**\n * Checks if the first version string or SemVer instance is greater than the second\n *\n * @function gt\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance (a)\n * @param {string|SemVer} - Second version string or SemVer instance (b)\n * @return {boolean} - Returns true if `a` is greater than `b`, otherwise false\n * @example\n *\n * gt('1.2.0', '1.0.0'); // true\n * gt('1.0.0', '1.2.0'); // false\n */\n\nconst gt = (a, b) => compare(a, b) > 0;\n\n/**\n * Checks if the first version string or SemVer instance is greater than or equal to the second\n *\n * @function gte\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance (a)\n * @param {string|SemVer} - Second version string or SemVer instance (b)\n * @return {boolean} - Returns true if `a` is greater than or equal `b`, otherwise false\n * @example\n *\n * gte('1.2.0', '1.0.0'); // true\n * gte('1.0.0', '1.2.0'); // false\n * gte('1.2.0', '1.2.0'); // true\n */\n\nconst gte = (a, b) => compare(a, b) >= 0;\n\n/**\n * Checks if the first version string or SemVer instance is less than the second\n *\n * @function lt\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance (a)\n * @param {string|SemVer} - Second version string or SemVer instance (b)\n * @return {boolean} - Returns true if `a` is less than `b`, otherwise false\n * @example\n *\n * lt('1.0.0', '1.2.0'); // true\n * lt('1.2.0', '1.0.0'); // false\n */\n\nconst lt = (a, b) => compare(a, b) < 0;\n\n/**\n * Checks if the first version string or SemVer instance is less than or equal to the second\n *\n * @function lte\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance (a)\n * @param {string|SemVer} - Second version string or SemVer instance (b)\n * @return {boolean} - Returns true if `a` is less than or equal than `b`, otherwise false\n * @example\n *\n * lte('1.0.0', '1.2.0'); // true\n * lte('1.2.0', '1.0.0'); // false\n * lte('1.2.0', '1.2.0'); // true\n */\n\nconst lte = (a, b) => compare(a, b) <= 0;\n\n/**\n * Performs comparison operations between version strings or SemVer instances\n *\n * @function cmp\n * @tag core\n * @param {string|SemVer} - First version string or SemVer instance\n * @param {string} - Comparison operator ('===', '!==', '=', '==', '!=', '>', '>=', '<', '<=')\n * @param {string|SemVer} - Second version string or SemVer instance\n * @return {boolean} - Returns true if the comparison operation is true, otherwise false.\n * @throws {SemVerError} - Throws an error if the comparison operator is invalid.\n * @example\n *\n * cmp('1.0.0', '===', '1.0.0'); // true\n * cmp('1.0.0', '!=', '1.0.1'); // true\n * cmp('1.2.0', '>', '1.0.0'); // true\n */\n\nvar cmp = (a, op, b) => {\n  switch (op) {\n    case '===':\n      if (typeof a === 'object') a = a.version;\n      if (typeof b === 'object') b = b.version;\n      return a === b\n\n    case '!==':\n      if (typeof a === 'object') a = a.version;\n      if (typeof b === 'object') b = b.version;\n      return a !== b\n\n    case '':\n    case '=':\n    case '==':\n      return eq(a, b)\n\n    case '!=':\n      return neq(a, b)\n\n    case '>':\n      return gt(a, b)\n\n    case '>=':\n      return gte(a, b)\n\n    case '<':\n      return lt(a, b)\n\n    case '<=':\n      return lte(a, b)\n\n    default:\n      throw new SemVerError(`Invalid operator: ${op}`)\n  }\n};\n\nconst ANY = Symbol('SemVer ANY');\n\n/**\n * Represents a comparator object used for version comparison\n *\n * @function Comparator\n * @param {string|Comparator} - Comparator string or another Comparator object\n * @throw {SemVerError} - Throws an error if the provided comparator is invalid\n * @example\n *\n * Comparator('> 1.2.3')\n * Comparator('<= 1.2')\n * Comparator('= 1.21.3-draft')\n * Comparator('1.21.3-draft')\n *\n */\n\nclass Comparator {\n  static get ANY() {\n    return ANY\n  }\n\n  constructor(comp) {\n    if (comp instanceof Comparator) {\n      comp = comp.value;\n    }\n\n    this.parse(comp);\n\n    if (this.semver === ANY) {\n      this.value = '';\n    } else {\n      this.value = this.operator + this.semver.version;\n    }\n  }\n\n  parse(comp) {\n    const r = re[t.COMPARATOR];\n    const m = comp.match(r);\n\n    if (!m) {\n      throw new SemVerError(`Invalid comparator: ${comp}`)\n    }\n\n    this.operator = m[1] !== undefined ? m[1] : '';\n    if (this.operator === '=') {\n      this.operator = '';\n    }\n\n    this.semver = SemVer$1(m[2]);\n  }\n\n  toString() {\n    return this.value\n  }\n\n  test(version) {\n    // if (this.semver === ANY || version === ANY) {\n    //   return true\n    // }\n\n    if (typeof version === 'string') {\n      try {\n        version = SemVer$1(version);\n      } catch (err) {\n        return false\n      }\n    }\n\n    return cmp(version, this.operator, this.semver)\n  }\n\n  intersects(comp) {\n    if (!(comp instanceof Comparator)) {\n      throw new SemVerError('a Comparator is required')\n    }\n\n    if (this.operator === '') {\n      if (this.value === '') {\n        return true\n      }\n      return Range$1(comp.value).test(this.value)\n    } else if (comp.operator === '') {\n      if (comp.value === '') {\n        return true\n      }\n      return Range$1(this.value).test(comp.semver)\n    }\n\n    const sameDirectionIncreasing =\n      (this.operator === '>=' || this.operator === '>') && (comp.operator === '>=' || comp.operator === '>');\n    const sameDirectionDecreasing =\n      (this.operator === '<=' || this.operator === '<') && (comp.operator === '<=' || comp.operator === '<');\n    const sameSemVer = this.semver.version === comp.semver.version;\n    const differentDirectionsInclusive =\n      (this.operator === '>=' || this.operator === '<=') && (comp.operator === '>=' || comp.operator === '<=');\n    const oppositeDirectionsLessThan =\n      cmp(this.semver, '<', comp.semver) &&\n      (this.operator === '>=' || this.operator === '>') &&\n      (comp.operator === '<=' || comp.operator === '<');\n    const oppositeDirectionsGreaterThan =\n      cmp(this.semver, '>', comp.semver) &&\n      (this.operator === '<=' || this.operator === '<') &&\n      (comp.operator === '>=' || comp.operator === '>');\n\n    return (\n      sameDirectionIncreasing ||\n      sameDirectionDecreasing ||\n      (sameSemVer && differentDirectionsInclusive) ||\n      oppositeDirectionsLessThan ||\n      oppositeDirectionsGreaterThan\n    )\n  }\n}\n\nvar Comparator$1 = comp => new Comparator(comp);\n\nconst cache = new LRU({ max: 1000 });\n\nconst NUM = '0|[1-9]\\\\d*';\n\nconst RANGE_TYPE = {\n  ONE: 'one',\n  MANY: 'many',\n  LATEST: 'latest',\n};\n\nconst matchSemVer = (string, map) => regexp => {\n  const res = string.match(regexp);\n  if (!res) return () => false\n  const result = () => true;\n  for (const [key, pos, def = 0] of map) {\n    result[key] = res[pos] || def;\n  }\n  return result\n};\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = comparators => {\n  let result = true;\n  const remainingComparators = comparators.slice();\n  let testComparator = remainingComparators.pop();\n\n  while (result && remainingComparators.length) {\n    result = remainingComparators.every(otherComparator => {\n      return testComparator.intersects(otherComparator)\n    });\n\n    testComparator = remainingComparators.pop();\n  }\n\n  return result\n};\n\n/**\n * Represents a range of versions for semantic versioning\n *\n * @function Range\n * @tag range\n * @param {string} - Version range\n * @throws {SemVerError} - Throws an error if the provided range is invalid\n * @example\n *\n * expect(() => Range('wrong range')).toThrow()\n * expect(Range('1.0').test('1.0')).toBeTruthy()\n * expect(Range('1.0').test('1.0.0')).toBeFalsy()\n *\n * expect(Range('~').toString()).toEqual('>=0.0.0-0')\n * expect(Range('~').test('1.2.3-draft')).toBeTruthy()\n * expect(Range('1.~').test('1.2.3-draft')).toBeFalsy()\n *\n * expect(Range('+').toString()).toEqual('>=1.0.0')\n * expect(Range('+').test('1.2.3-draft')).toBeFalsy()\n * expect(Range('1.0.+').test('1.0.3')).toBeTruthy()\n *\n * expect(Range('*').test('1.0')).toBeTruthy()\n * expect(Range('*').test('1.0.0-draft')).toBeTruthy()\n * expect(Range('1.*').test('1.1.3')).toBeFalsy()\n *\n * expect(Range('1~.2.0').test('4.3.2')).toBeTruthy()\n * expect(Range('1~.2.0').test('4.3.2-draft')).toBeTruthy()\n * expect(Range('1.2~.0').toString()).toEqual('>=1.2.0-0 <2.0.0-0')\n *\n */\nclass Range {\n  constructor(range) {\n    if (range instanceof Range) return new Range(range.raw)\n\n    if (range instanceof Comparator) {\n      this.raw = range.value;\n      this.set = [[range]];\n      this.format();\n      return this\n    }\n\n    this.raw = range;\n    const [type, set, subType] = this.makeRangeSet(range);\n    this.set = set;\n    this.type = type;\n    this.subType = subType;\n\n    if (!this.set.length) {\n      throw new SemVerError(`Invalid SemVer Range: ${range}`)\n    }\n\n    this.format();\n  }\n\n  get comparators() {\n    const res = [];\n    for (const a of this.set) {\n      for (const b of a) {\n        res.push(b);\n      }\n    }\n    return res\n  }\n\n  isMonoVersion() {\n    return this.type === RANGE_TYPE.ONE\n  }\n\n  isResolved() {\n    return this.isMonoVersion()\n  }\n\n  format() {\n    this.range = this.set\n      .map(comps => {\n        return comps.join(' ').trim()\n      })\n      .join('||')\n      .trim();\n    return this.range\n  }\n\n  toString() {\n    return this.range\n  }\n\n  makeRangeSet(range) {\n    range = range.trim();\n    const memoKey = `parseRange:${range}`;\n    const cached = cache.get(memoKey);\n    if (cached) return cached\n\n    range = range.replace(/\\s+/, '');\n\n    const [type, comparators, subType] = makeComparators(range);\n    if (!comparators) return [null, []]\n\n    const set = comparators.map(comp => comp.split(/\\s+/).map(comp => Comparator$1(comp)));\n\n    cache.set(memoKey, [type, set, subType]);\n    return [type, set, subType]\n  }\n\n  intersects(range) {\n    if (!(range instanceof Range)) {\n      throw new SemVerError('a Range is required')\n    }\n\n    return this.set.some(thisComparators => {\n      return (\n        isSatisfiable(thisComparators) &&\n        range.set.some(rangeComparators => {\n          return (\n            isSatisfiable(rangeComparators) &&\n            thisComparators.every(thisComparator => {\n              return rangeComparators.every(rangeComparator => {\n                return thisComparator.intersects(rangeComparator)\n              })\n            })\n          )\n        })\n      )\n    })\n  }\n\n  // if ANY of the sets match ALL of its comparators, then pass\n  test(version) {\n    if (!version) {\n      return false\n    }\n\n    if (typeof version === 'string') {\n      try {\n        version = SemVer$1(version);\n      } catch (er) {\n        return false\n      }\n    }\n\n    for (let i = 0; i < this.set.length; i++) {\n      if (testSet(this.set[i], version)) return true\n    }\n    return false\n  }\n}\n\nconst RANGE_SUB_TYPE = {\n  RESOLVED: 'resolved',\n  STABLE: 'stable',\n  LATEST_STABLE: 'latest_stable',\n  LATEST_UNSTABLE: 'latest_unstable',\n  UNSTABLE: 'unstable',\n  ALL: 'all',\n  ABOVE: 'above',\n};\n\nconst makeComparators = comp => {\n  let newComp;\n\n  newComp = checkSpecific(comp);\n  if (newComp) return [RANGE_TYPE.ONE, [newComp], RANGE_SUB_TYPE.RESOLVED]\n\n  newComp = checkOnlyStable(comp);\n  if (newComp) return [RANGE_TYPE.LATEST, [newComp], RANGE_SUB_TYPE.STABLE]\n\n  newComp = checkLatestStable(comp);\n  if (newComp) return [RANGE_TYPE.LATEST, [newComp], RANGE_SUB_TYPE.LATEST_STABLE]\n\n  newComp = checkLatestUnStable(comp);\n  if (newComp) return [RANGE_TYPE.LATEST, [newComp], RANGE_SUB_TYPE.LATEST_UNSTABLE]\n\n  newComp = checkPossibleUnstable(comp);\n  if (newComp) return [RANGE_TYPE.LATEST, [newComp], RANGE_SUB_TYPE.UNSTABLE]\n\n  newComp = checkAllVersions(comp);\n  if (newComp) return [RANGE_TYPE.MANY, newComp, RANGE_SUB_TYPE.ALL]\n\n  newComp = checkAllAboveVersions(comp);\n  if (newComp) return [RANGE_TYPE.MANY, newComp, RANGE_SUB_TYPE.ABOVE]\n\n  return []\n};\n\nconst checkSpecific = comp => {\n  const res = comp.match(re[t.FULL]);\n  if (res) return comp\n};\n\nconst checkAllVersions = comp => {\n  if (comp === '*') return ['>=0.0.0-0', '>=0.0']\n  const match = matchSemVer(comp, [\n    ['M', 1],\n    ['m', 2],\n    ['p', 3],\n  ]);\n  let r;\n\n  r = match(`^(${NUM})[.]([*])$`);\n  if (r()) return [`>=${r.M}.0 <${+r.M + 1}.0`]\n\n  r = match(`^(${NUM})[.]([*])[.](${NUM})$`);\n  if (r()) return [`>=${r.M}.0.0-0 <${+r.M + 1}.0.0-0`]\n\n  r = match(`^(${NUM})[.](${NUM})[.]([*])$`);\n  if (r()) return [`>=${r.M}.${r.m}.0-0 <${r.M}.${+r.m + 1}.0-0`]\n};\n\nconst checkAllAboveVersions = comp => {\n  const match = matchSemVer(comp, [\n    ['M', 1],\n    ['m', 2],\n    ['p', 3],\n  ]);\n  let r;\n\n  r = match(`^(${NUM})[.](${NUM})[*]$`);\n  if (r()) return [`>=${r.M}.${r.m} <${+r.M + 1}.0`]\n\n  r = match(`^(${NUM})[.](${NUM})[*][.](${NUM})$`);\n  if (r()) return [`>=${r.M}.${r.m}.0-0 <${+r.M + 1}.0.0-0`]\n\n  r = match(`^(${NUM})[.](${NUM})[.](${NUM})[*]$`);\n  if (r()) return [`>=${r.M}.${r.m}.${r.p}-0 <${r.M}.${+r.m + 1}.0-0`]\n};\n\nconst checkPossibleUnstable = comp => {\n  if (comp === '~') return `>=0.0.0-0`\n  const match = matchSemVer(comp, [\n    ['M', 1],\n    ['m', 2],\n    ['p', 3],\n  ]);\n  let r;\n\n  r = match(`^(${NUM})[.]([~])$`);\n  if (r()) return `>=${r.M}.0 <${+r.M + 1}.0`\n\n  r = match(`^(${NUM})[.]([~])[.](${NUM})$`);\n  if (r()) return `>=${r.M}.0.0-0 <${+r.M + 1}.0.0-0`\n\n  r = match(`^(${NUM})[.](${NUM})[.]([~])$`);\n  if (r()) return `>=${r.M}.${r.m}.0-0 <${r.M}.${+r.m + 1}.0-0`\n};\n\nconst checkOnlyStable = comp => {\n  if (comp === '+') return `>=1.0.0`\n  const match = matchSemVer(comp, [\n    ['M', 1],\n    ['m', 2],\n    ['p', 3],\n  ]);\n\n  let r;\n\n  r = match(`^(${NUM})[.]([+])(?:[.](${NUM}))?$`);\n  if (r()) return `>=${r.M}.0.0 <${+r.M + 1}.0.0`\n\n  r = match(`^(${NUM})[.](${NUM})[.]([+])$`);\n  if (r()) return `>=${r.M}.${r.m}.0 <${r.M}.${+r.m + 1}.0`\n};\n\nconst checkLatestStable = comp => {\n  const match = matchSemVer(comp, [\n    ['M', 1],\n    ['m', 2],\n    ['p', 3],\n  ]);\n\n  let r;\n  r = match(`^(${NUM})[+][.](${NUM})[.](${NUM})$`);\n  if (r()) return `>=${r.M}.${r.m}.${r.p}`\n\n  r = match(`^(${NUM})[.](${NUM})[+][.](${NUM})$`);\n  if (r()) return `>=${r.M}.${r.m}.${r.p} <${+r.M + 1}.0.0`\n\n  r = match(`^(${NUM})[.](${NUM})[.](${NUM})[+]$`);\n  if (r()) return `>=${r.M}.${r.m}.${r.p} <${r.M}.${+r.m + 1}.0`\n};\n\nconst checkLatestUnStable = comp => {\n  const match = matchSemVer(comp, [\n    ['M', 1],\n    ['m', 2],\n    ['p', 3],\n  ]);\n\n  let r;\n  r = match(`^(${NUM})[~][.](${NUM})[.](${NUM})$`);\n  if (r()) return `>=${r.M}.${r.m}.${r.p}-0`\n\n  r = match(`^(${NUM})[.](${NUM})[~][.](${NUM})$`);\n  if (r()) return `>=${r.M}.${r.m}.${r.p}-0 <${+r.M + 1}.0.0-0`\n\n  r = match(`^(${NUM})[.](${NUM})[.](${NUM})[~]$`);\n  if (r()) return `>=${r.M}.${r.m}.${r.p}-0 <${r.M}.${+r.m + 1}.0-0`\n};\n\nconst testSet = (set, version) => {\n  for (let i = 0; i < set.length; i++) {\n    if (set[i].semver.is2Parts() && !version.is2Parts()) return false\n    if (version.is2Parts() && !set[i].semver.is2Parts()) return false\n    if (set[i].semver.isStable() && !version.isStable()) return false\n    if (!set[i].test(version)) return false\n  }\n\n  return true\n};\n\nvar Range$1 = range => new Range(range);\n\n/**\n * Represents a matcher object used for version matching\n *\n * @function Matcher\n * @tag matcher\n * @param {string} - Version string or range to create a matcher for\n * @throws {SemVerError} - Throws an error if the provided version or range is invalid\n * @example\n *\n * expect(() => Matcher('wrong range')).toThrow()\n * expect(Matcher('1.0').isMonoType()).toBeTruthy()\n * expect(Matcher('1.0.1').isMonoType()).toBeTruthy()\n * expect(Matcher('1.0.1').isResolved()).toBeTruthy()\n * expect(Matcher('1~.2.0').isLatestType()).toBeTruthy()\n * expect(() => Matcher('1.*')).toThrow()\n *\n */\nclass Matcher {\n  constructor(value) {\n    this.raw = value;\n    this.range = Range$1(value);\n    if (this.range.type !== RANGE_TYPE.ONE && this.range.type !== RANGE_TYPE.LATEST)\n      throw new SemVerError(`Wrong version for matcher ${value}`)\n  }\n\n  isMonoType() {\n    return this.range.type === RANGE_TYPE.ONE\n  }\n\n  isResolved() {\n    return this.isMonoType()\n  }\n\n  isLatestType() {\n    return this.range.type === RANGE_TYPE.LATEST\n  }\n}\n\nvar matcher = value => new Matcher(value);\n\n/**\n * Represents a dependency between two artifacts\n *\n * @class Dependency\n * @tag dependency\n * @param {object} - The source artifact object containing a version property\n * @param {string} - The version or version range of the target artifact\n * @throws {SemVerError} Throws an error if the provided version or range is invalid or if dependency source or version is undefined\n * @example\n *\n * //Should manage stable source\n * const source = { version: '1.0.1' };\n * Dependency(source, '2.3.0');\n * Dependency(source, '2+.3.0');\n * Dependency(source, '2.3+.0');\n * const dep = Dependency(source, '2.3.0+');\n * expect(dep.range.raw).toEqual(dep.raw);\n * expect(() => Dependency(source, '2.3')).toThrow();\n * expect(() => Dependency(source, '2.3.1-draft')).toThrow();\n *\n * //Should manage unstable source\n * const source = { version: '1.0.1-draft' }\n * Dependency(source, '2.3.0')\n * let dep = Dependency(source, '2.3.0+')\n * expect(dep.range.raw).toEqual('2.3.0~')\n * dep = Dependency({ version: '1.0' }, '2+.3.0')\n * expect(dep.range.raw).toEqual('2~.3.0')\n *\n */\nclass Dependency {\n  constructor(source, value) {\n    if (!value) throw new SemVerError(`Dependency version must be defined`)\n    if (!source?.version) throw new SemVerError(`Dependency source cannot be undefined`)\n    this.raw = value;\n    this.source = source;\n    this.range = Range$1(value);\n    const sVersion = SemVer$1(source.version);\n    if (!this.range.isResolved()) {\n      if (this.range.subType !== RANGE_SUB_TYPE.LATEST_STABLE) throw new SemVerError(`Wrong dependency ${value}`)\n      if (!sVersion.isStable()) {\n        this.range = Range$1(value.replace('+', '~'));\n      }\n    } else {\n      const tVersion = SemVer$1(value);\n      if (sVersion.isStable() && !tVersion.isStable())\n        throw new SemVerError(\n          `Wrong dependency: Semantically  versioned  artefacts  MUST  only  reference  another  semantically versioned artefacts`,\n        )\n    }\n  }\n\n  isResolved() {\n    return this.range.type === RANGE_TYPE.ONE\n  }\n}\n\nvar dependency = (source, value) => new Dependency(source, value);\n\n/**\n * Checks if a dependency is valid\n *\n * @function isValidDependency\n * @tag dependency\n * @param {Object} - Source artifact object containing a version property\n * @param {string} - Version or version range of the target artifact\n * @return {boolean} - Returns true if the dependency is valid, otherwise false\n * @example\n *\n * const source = { version: '1.0.1' };\n * isValidDependency(source, '2.3-'); // false\n * isValidDependency(source, '2.3+.1'); // true\n * isValidDependency(source, '2.3.1-draft'); // false\n * isValidDependency({ version: '1.2.1' }, '2.3'); // false\n * isValidDependency({ version: '1.2' }, '2.3.1'); // true\n * isValidDependency({ version: '1.2.1' }, '2.3.1-draft'); // false\n */\n\nconst isValidDependency = (source, targetVersion) => {\n  try {\n    new Dependency(source, targetVersion);\n    return true\n  } catch (err) {\n    return false\n  }\n};\n\nexport { Comparator$1 as Comparator, dependency as Dependency, matcher as Matcher, RANGE_TYPE, Range$1 as Range, SemVer$1 as SemVer, SemVerError, isValidDependency };\n"],"names":[],"mappings":";;AAEA,MAAM,UAAU,GAAG,GAAG;AACtB,MAAM,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,gBAAgB;;AAEpE,MAAM,OAAO,GAAG,UAAU;;AAE1B,MAAM,kBAAkB,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK;AACrC,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9B,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;;AAE9B,EAAE,IAAI,IAAI,IAAI,IAAI,EAAE;AACpB,IAAI,CAAC,GAAG,CAAC,CAAC;AACV,IAAI,CAAC,GAAG,CAAC,CAAC;AACV,EAAE;;AAEF,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG;AACnB,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI;AACxB,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI;AACxB,MAAM,CAAC,GAAG,CAAC,GAAG;AACd,MAAM;AACN,CAAC;;AAED,MAAM,WAAW,SAAS,KAAK,CAAC;AAChC,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI;AACrC,EAAE;AACF;;AAEA,MAAM,EAAE,GAAG,EAAE;AACb,MAAM,GAAG,GAAG,EAAE;AACd,MAAM,CAAC,GAAG,EAAE;AACZ,IAAI,CAAC,GAAG,CAAC;;AAET,MAAM,WAAW,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,KAAK;AAC/C,EAAE,MAAM,KAAK,GAAG,CAAC,EAAE;AACnB,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK;AACjB,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK;AACpB,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,EAAmB,SAAS,CAAC;AAC3D,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA,WAAW,CAAC,mBAAmB,EAAE,aAAa,CAAC;;AAE/C;AACA;AACA;;AAEA,WAAW,CAAC,sBAAsB,EAAE,4BAA4B,CAAC;;AAEjE;AACA;;AAEA,WAAW;AACX,EAAE,aAAa;AACf,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC;AAChH,CAAC;;AAED;AACA;;AAEA,WAAW,CAAC,sBAAsB,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;;AAErG;AACA;AACA;;AAEA,WAAW,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,IAAI,CAAC,CAAC;;AAExG;AACA;;AAEA,WAAW,CAAC,iBAAiB,EAAE,eAAe,CAAC;;AAE/C;AACA;AACA;;AAEA,WAAW,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC;;AAE3F;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,WAAW,CAAC,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;;AAEtF,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;;AAE5C,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC;;AAEnC;AACA,WAAW,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;;AAEzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,MAAM,CAAC;AACb,EAAE,WAAW,CAAC,OAAO,EAAE;AACvB,IAAI,IAAI,OAAO,YAAY,MAAM,EAAE;AACnC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO;AAC/B,IAAI,CAAC,MAAM,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AAC5C,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,iBAAiB,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAClF,IAAI;;AAEJ,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE;AACrC,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,uBAAuB,EAAE,UAAU,CAAC,WAAW,CAAC;AAC7E,IAAI;;AAEJ,IAAI,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;;AAE9C,IAAI,IAAI,CAAC,CAAC,EAAE;AACZ,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC;AACzD,IAAI;;AAEJ;AACA,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACtB,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACtB,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;;AAEpC,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,gBAAgB,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE;AACzD,MAAM,MAAM,IAAI,WAAW,CAAC,uBAAuB;AACnD,IAAI;;AAEJ,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,gBAAgB,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE;AACzD,MAAM,MAAM,IAAI,WAAW,CAAC,uBAAuB;AACnD,IAAI;;AAEJ,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,gBAAgB,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE;AACzD,MAAM,MAAM,IAAI,WAAW,CAAC,uBAAuB;AACnD,IAAI;;AAEJ,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI;;AAEjC,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE;AAC/C,MAAM,MAAM,IAAI,WAAW,CAAC,iBAAiB;AAC7C,IAAI;;AAEJ,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,EAAE;;AAEF,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK;AAC1B,EAAE;;AAEF,EAAE,KAAK,GAAG;AACV,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI;AACrE,EAAE;;AAEF,EAAE,cAAc,GAAG;AACnB,IAAI,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK;AAC5B,EAAE;;AAEF,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ;AAC9D,EAAE;;AAEF,EAAE,MAAM,GAAG;AACX,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAChH,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;AAC5D,IAAI,OAAO,IAAI,CAAC;AAChB,EAAE;;AAEF,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC;AAChB,EAAE;;AAEF,EAAE,OAAO,CAAC,KAAK,EAAE;AACjB,IAAI,IAAI,EAAE,KAAK,YAAY,MAAM,CAAC,EAAE;AACpC,MAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO,EAAE;AAC/D,QAAQ,OAAO;AACf,MAAM;AACN,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC;AAC/B,IAAI;;AAEJ,IAAI,IAAI,KAAK,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAAE;AACxC,MAAM,OAAO;AACb,IAAI;;AAEJ,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK;AAC3D,EAAE;;AAEF,EAAE,WAAW,CAAC,KAAK,EAAE;AACrB,IAAI,IAAI,EAAE,KAAK,YAAY,MAAM,CAAC,EAAE;AACpC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC;AAC/B,IAAI;;AAEJ,IAAI;AACJ,MAAM,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;AACjD,MAAM,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;AACjD,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK;AAC7B;AACA,EAAE;;AAEF,EAAE,YAAY,CAAC,KAAK,EAAE;AACtB,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,EAAE,OAAO;AAC3C;AACA,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,EAAE,OAAO;AAChC,IAAI,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,OAAO;AACjC,IAAI,OAAO,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK;AACrD,EAAE;;AAEF,EAAE,UAAU,CAAC,KAAK,EAAE;AACpB,IAAI,IAAI,EAAE,KAAK,YAAY,MAAM,CAAC,EAAE;AACpC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC;AAC/B,IAAI;;AAEJ;AACA,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;AAC5C,MAAM,OAAO;AACb,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,EAAE;AACnD,MAAM,OAAO;AACb,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;AACpD,MAAM,OAAO;AACb,IAAI;;AAEJ,IAAI,IAAI,CAAC,GAAG,CAAC;AACb,IAAI,GAAG;AACP,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AACjC,MAAM,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;AAClC,MAAM,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE;AAC9C,QAAQ,OAAO;AACf,MAAM,CAAC,MAAM,IAAI,CAAC,KAAK,SAAS,EAAE;AAClC,QAAQ,OAAO;AACf,MAAM,CAAC,MAAM,IAAI,CAAC,KAAK,SAAS,EAAE;AAClC,QAAQ,OAAO;AACf,MAAM,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,EAAE;AAC1B,QAAQ;AACR,MAAM,CAAC,MAAM;AACb,QAAQ,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC;AACtC,MAAM;AACN,IAAI,CAAC,QAAQ,EAAE,CAAC;AAChB,EAAE;AACF;;AAEG,IAAC,QAAQ,GAAG,OAAO,IAAI,IAAI,MAAM,CAAC,OAAO;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;;AAE1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC;;AAEzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK;AACxB,EAAE,QAAQ,EAAE;AACZ,IAAI,KAAK,KAAK;AACd,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO;AAC9C,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO;AAC9C,MAAM,OAAO,CAAC,KAAK;;AAEnB,IAAI,KAAK,KAAK;AACd,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO;AAC9C,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO;AAC9C,MAAM,OAAO,CAAC,KAAK;;AAEnB,IAAI,KAAK,EAAE;AACX,IAAI,KAAK,GAAG;AACZ,IAAI,KAAK,IAAI;AACb,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;;AAEpB,IAAI,KAAK,IAAI;AACb,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;;AAErB,IAAI,KAAK,GAAG;AACZ,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;;AAEpB,IAAI,KAAK,IAAI;AACb,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;;AAErB,IAAI,KAAK,GAAG;AACZ,MAAM,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;;AAEpB,IAAI,KAAK,IAAI;AACb,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;;AAErB,IAAI;AACJ,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;AACrD;AACA,CAAC;;AAED,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM,UAAU,CAAC;AACjB,EAAE,WAAW,GAAG,GAAG;AACnB,IAAI,OAAO;AACX,EAAE;;AAEF,EAAE,WAAW,CAAC,IAAI,EAAE;AACpB,IAAI,IAAI,IAAI,YAAY,UAAU,EAAE;AACpC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK;AACvB,IAAI;;AAEJ,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;;AAEpB,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,EAAE;AAC7B,MAAM,IAAI,CAAC,KAAK,GAAG,EAAE;AACrB,IAAI,CAAC,MAAM;AACX,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO;AACtD,IAAI;AACJ,EAAE;;AAEF,EAAE,KAAK,CAAC,IAAI,EAAE;AACd,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;AAC9B,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;;AAE3B,IAAI,IAAI,CAAC,CAAC,EAAE;AACZ,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAC;AACzD,IAAI;;AAEJ,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE;AAClD,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;AAC/B,MAAM,IAAI,CAAC,QAAQ,GAAG,EAAE;AACxB,IAAI;;AAEJ,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,EAAE;;AAEF,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC;AAChB,EAAE;;AAEF,EAAE,IAAI,CAAC,OAAO,EAAE;AAChB;AACA;AACA;;AAEA,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AACrC,MAAM,IAAI;AACV,QAAQ,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;AACnC,MAAM,CAAC,CAAC,OAAO,GAAG,EAAE;AACpB,QAAQ,OAAO;AACf,MAAM;AACN,IAAI;;AAEJ,IAAI,OAAO,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM;AAClD,EAAE;;AAEF,EAAE,UAAU,CAAC,IAAI,EAAE;AACnB,IAAI,IAAI,EAAE,IAAI,YAAY,UAAU,CAAC,EAAE;AACvC,MAAM,MAAM,IAAI,WAAW,CAAC,0BAA0B;AACtD,IAAI;;AAEJ,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE,EAAE;AAC9B,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,EAAE,EAAE;AAC7B,QAAQ,OAAO;AACf,MAAM;AACN,MAAM,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;AAChD,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE,EAAE;AACrC,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,EAAE,EAAE;AAC7B,QAAQ,OAAO;AACf,MAAM;AACN,MAAM,OAAO,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;AACjD,IAAI;;AAEJ,IAAI,MAAM,uBAAuB;AACjC,MAAM,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;AAC5G,IAAI,MAAM,uBAAuB;AACjC,MAAM,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;AAC5G,IAAI,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO;AAClE,IAAI,MAAM,4BAA4B;AACtC,MAAM,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,MAAM,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC;AAC9G,IAAI,MAAM,0BAA0B;AACpC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;AACxC,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;AACvD,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;AACvD,IAAI,MAAM,6BAA6B;AACvC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC;AACxC,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;AACvD,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;;AAEvD,IAAI;AACJ,MAAM,uBAAuB;AAC7B,MAAM,uBAAuB;AAC7B,OAAO,UAAU,IAAI,4BAA4B,CAAC;AAClD,MAAM,0BAA0B;AAChC,MAAM;AACN;AACA,EAAE;AACF;;AAEG,IAAC,YAAY,GAAG,IAAI,IAAI,IAAI,UAAU,CAAC,IAAI;;AAE9C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;;AAEpC,MAAM,GAAG,GAAG,aAAa;;AAEpB,MAAC,UAAU,GAAG;AACnB,EAAE,GAAG,EAAE,KAAK;AACZ,EAAE,IAAI,EAAE,MAAM;AACd,EAAE,MAAM,EAAE,QAAQ;AAClB;;AAEA,MAAM,WAAW,GAAG,CAAC,MAAM,EAAE,GAAG,KAAK,MAAM,IAAI;AAC/C,EAAE,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;AAClC,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,MAAM;AACzB,EAAE,MAAM,MAAM,GAAG,MAAM,IAAI;AAC3B,EAAE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,EAAE;AACzC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG;AACjC,EAAE;AACF,EAAE,OAAO;AACT,CAAC;;AAED;AACA;AACA,MAAM,aAAa,GAAG,WAAW,IAAI;AACrC,EAAE,IAAI,MAAM,GAAG,IAAI;AACnB,EAAE,MAAM,oBAAoB,GAAG,WAAW,CAAC,KAAK,EAAE;AAClD,EAAE,IAAI,cAAc,GAAG,oBAAoB,CAAC,GAAG,EAAE;;AAEjD,EAAE,OAAO,MAAM,IAAI,oBAAoB,CAAC,MAAM,EAAE;AAChD,IAAI,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,eAAe,IAAI;AAC3D,MAAM,OAAO,cAAc,CAAC,UAAU,CAAC,eAAe;AACtD,IAAI,CAAC,CAAC;;AAEN,IAAI,cAAc,GAAG,oBAAoB,CAAC,GAAG,EAAE;AAC/C,EAAE;;AAEF,EAAE,OAAO;AACT,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,KAAK,CAAC;AACZ,EAAE,WAAW,CAAC,KAAK,EAAE;AACrB,IAAI,IAAI,KAAK,YAAY,KAAK,EAAE,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG;;AAE1D,IAAI,IAAI,KAAK,YAAY,UAAU,EAAE;AACrC,MAAM,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK;AAC5B,MAAM,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAC1B,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,MAAM,OAAO;AACb,IAAI;;AAEJ,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK;AACpB,IAAI,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;AACzD,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG;AAClB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO;;AAE1B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE;AAC1B,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,sBAAsB,EAAE,KAAK,CAAC,CAAC;AAC5D,IAAI;;AAEJ,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,EAAE;;AAEF,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,MAAM,GAAG,GAAG,EAAE;AAClB,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE;AAC9B,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE;AACzB,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACnB,MAAM;AACN,IAAI;AACJ,IAAI,OAAO;AACX,EAAE;;AAEF,EAAE,aAAa,GAAG;AAClB,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC;AACpC,EAAE;;AAEF,EAAE,UAAU,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,aAAa;AAC7B,EAAE;;AAEF,EAAE,MAAM,GAAG;AACX,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;AACtB,OAAO,GAAG,CAAC,KAAK,IAAI;AACpB,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI;AACnC,MAAM,CAAC;AACP,OAAO,IAAI,CAAC,IAAI;AAChB,OAAO,IAAI,EAAE;AACb,IAAI,OAAO,IAAI,CAAC;AAChB,EAAE;;AAEF,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC;AAChB,EAAE;;AAEF,EAAE,YAAY,CAAC,KAAK,EAAE;AACtB,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE;AACxB,IAAI,MAAM,OAAO,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;AACzC,IAAI,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;AACrC,IAAI,IAAI,MAAM,EAAE,OAAO;;AAEvB,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;;AAEpC,IAAI,MAAM,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC;AAC/D,IAAI,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE;;AAEtC,IAAI,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;;AAE1F,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;AAC5C,IAAI,OAAO,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO;AAC9B,EAAE;;AAEF,EAAE,UAAU,CAAC,KAAK,EAAE;AACpB,IAAI,IAAI,EAAE,KAAK,YAAY,KAAK,CAAC,EAAE;AACnC,MAAM,MAAM,IAAI,WAAW,CAAC,qBAAqB;AACjD,IAAI;;AAEJ,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI;AAC5C,MAAM;AACN,QAAQ,aAAa,CAAC,eAAe,CAAC;AACtC,QAAQ,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAgB,IAAI;AAC3C,UAAU;AACV,YAAY,aAAa,CAAC,gBAAgB,CAAC;AAC3C,YAAY,eAAe,CAAC,KAAK,CAAC,cAAc,IAAI;AACpD,cAAc,OAAO,gBAAgB,CAAC,KAAK,CAAC,eAAe,IAAI;AAC/D,gBAAgB,OAAO,cAAc,CAAC,UAAU,CAAC,eAAe;AAChE,cAAc,CAAC;AACf,YAAY,CAAC;AACb;AACA,QAAQ,CAAC;AACT;AACA,IAAI,CAAC;AACL,EAAE;;AAEF;AACA,EAAE,IAAI,CAAC,OAAO,EAAE;AAChB,IAAI,IAAI,CAAC,OAAO,EAAE;AAClB,MAAM,OAAO;AACb,IAAI;;AAEJ,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AACrC,MAAM,IAAI;AACV,QAAQ,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;AACnC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE;AACnB,QAAQ,OAAO;AACf,MAAM;AACN,IAAI;;AAEJ,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9C,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,OAAO;AAChD,IAAI;AACJ,IAAI,OAAO;AACX,EAAE;AACF;;AAEA,MAAM,cAAc,GAAG;AACvB,EAAE,QAAQ,EAAE,UAAU;AACtB,EAAE,MAAM,EAAE,QAAQ;AAClB,EAAE,aAAa,EAAE,eAAe;AAChC,EAAE,eAAe,EAAE,iBAAiB;AACpC,EAAE,QAAQ,EAAE,UAAU;AACtB,EAAE,GAAG,EAAE,KAAK;AACZ,EAAE,KAAK,EAAE,OAAO;AAChB,CAAC;;AAED,MAAM,eAAe,GAAG,IAAI,IAAI;AAChC,EAAE,IAAI,OAAO;;AAEb,EAAE,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC;AAC/B,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,QAAQ;;AAEzE,EAAE,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC;AACjC,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,MAAM;;AAE1E,EAAE,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC;AACnC,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,aAAa;;AAEjF,EAAE,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC;AACrC,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,eAAe;;AAEnF,EAAE,OAAO,GAAG,qBAAqB,CAAC,IAAI,CAAC;AACvC,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,QAAQ;;AAE5E,EAAE,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC;AAClC,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,cAAc,CAAC,GAAG;;AAEnE,EAAE,OAAO,GAAG,qBAAqB,CAAC,IAAI,CAAC;AACvC,EAAE,IAAI,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,cAAc,CAAC,KAAK;;AAErE,EAAE,OAAO;AACT,CAAC;;AAED,MAAM,aAAa,GAAG,IAAI,IAAI;AAC9B,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACpC,EAAE,IAAI,GAAG,EAAE,OAAO;AAClB,CAAC;;AAED,MAAM,gBAAgB,GAAG,IAAI,IAAI;AACjC,EAAE,IAAI,IAAI,KAAK,GAAG,EAAE,OAAO,CAAC,WAAW,EAAE,OAAO;AAChD,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE;AAClC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,GAAG,CAAC;AACJ,EAAE,IAAI,CAAC;;AAEP,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AACjC,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;;AAE9C,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAC5C,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;;AAEtD,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AAC5C,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;AAChE,CAAC;;AAED,MAAM,qBAAqB,GAAG,IAAI,IAAI;AACtC,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE;AAClC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,GAAG,CAAC;AACJ,EAAE,IAAI,CAAC;;AAEP,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AACvC,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;;AAEnD,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;;AAE3D,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;AACrE,CAAC;;AAED,MAAM,qBAAqB,GAAG,IAAI,IAAI;AACtC,EAAE,IAAI,IAAI,KAAK,GAAG,EAAE,OAAO,CAAC,SAAS;AACrC,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE;AAClC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,GAAG,CAAC;AACJ,EAAE,IAAI,CAAC;;AAEP,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AACjC,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;;AAE5C,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAC5C,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM;;AAEpD,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AAC5C,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI;AAC9D,CAAC;;AAED,MAAM,eAAe,GAAG,IAAI,IAAI;AAChC,EAAE,IAAI,IAAI,KAAK,GAAG,EAAE,OAAO,CAAC,OAAO;AACnC,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE;AAClC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,GAAG,CAAC;;AAEJ,EAAE,IAAI,CAAC;;AAEP,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,gBAAgB,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AACjD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI;;AAEhD,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AAC5C,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;AAC1D,CAAC;;AAED,MAAM,iBAAiB,GAAG,IAAI,IAAI;AAClC,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE;AAClC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,GAAG,CAAC;;AAEJ,EAAE,IAAI,CAAC;AACP,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;AAEzC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI;;AAE1D,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;AAC/D,CAAC;;AAED,MAAM,mBAAmB,GAAG,IAAI,IAAI;AACpC,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,EAAE;AAClC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;AACZ,GAAG,CAAC;;AAEJ,EAAE,IAAI,CAAC;AACP,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;;AAE3C,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM;;AAE9D,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AAClD,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI;AACnE,CAAC;;AAED,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,OAAO,KAAK;AAClC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,OAAO;AAChE,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,OAAO;AAChE,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,OAAO;AAChE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,OAAO;AACtC,EAAE;;AAEF,EAAE,OAAO;AACT,CAAC;;AAEE,IAAC,OAAO,GAAG,KAAK,IAAI,IAAI,KAAK,CAAC,KAAK;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO,CAAC;AACd,EAAE,WAAW,CAAC,KAAK,EAAE;AACrB,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK;AACpB,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;AAC/B,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,MAAM;AACnF,MAAM,MAAM,IAAI,WAAW,CAAC,CAAC,0BAA0B,EAAE,KAAK,CAAC,CAAC;AAChE,EAAE;;AAEF,EAAE,UAAU,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC;AAC1C,EAAE;;AAEF,EAAE,UAAU,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,UAAU;AAC1B,EAAE;;AAEF,EAAE,YAAY,GAAG;AACjB,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC;AAC1C,EAAE;AACF;;AAEG,IAAC,OAAO,GAAG,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK;;;;","x_google_ignoreList":[0]}

package/esm/node_modules/@dbmx/semver/node_modules/lru-cache/index.js

@@ -0,0 +1,340 @@
+import { getDefaultExportFromCjs } from '../../../../../_virtual/_commonjsHelpers.js';
+import { y as yallist } from '../yallist/yallist.js';
+
+// A linked list to keep track of recently-used-ness
+const Yallist = yallist;
+
+const MAX = Symbol('max');
+const LENGTH = Symbol('length');
+const LENGTH_CALCULATOR = Symbol('lengthCalculator');
+const ALLOW_STALE = Symbol('allowStale');
+const MAX_AGE = Symbol('maxAge');
+const DISPOSE = Symbol('dispose');
+const NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet');
+const LRU_LIST = Symbol('lruList');
+const CACHE = Symbol('cache');
+const UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet');
+
+const naiveLength = () => 1;
+
+// lruList is a yallist where the head is the youngest
+// item, and the tail is the oldest.  the list contains the Hit
+// objects as the entries.
+// Each Hit object has a reference to its Yallist.Node.  This
+// never changes.
+//
+// cache is a Map (or PseudoMap) that matches the keys to
+// the Yallist.Node object.
+class LRUCache {
+  constructor (options) {
+    if (typeof options === 'number')
+      options = { max: options };
+
+    if (!options)
+      options = {};
+
+    if (options.max && (typeof options.max !== 'number' || options.max < 0))
+      throw new TypeError('max must be a non-negative number')
+    // Kind of weird to have a default max of Infinity, but oh well.
+    this[MAX] = options.max || Infinity;
+
+    const lc = options.length || naiveLength;
+    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc;
+    this[ALLOW_STALE] = options.stale || false;
+    if (options.maxAge && typeof options.maxAge !== 'number')
+      throw new TypeError('maxAge must be a number')
+    this[MAX_AGE] = options.maxAge || 0;
+    this[DISPOSE] = options.dispose;
+    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false;
+    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false;
+    this.reset();
+  }
+
+  // resize the cache when the max changes.
+  set max (mL) {
+    if (typeof mL !== 'number' || mL < 0)
+      throw new TypeError('max must be a non-negative number')
+
+    this[MAX] = mL || Infinity;
+    trim(this);
+  }
+  get max () {
+    return this[MAX]
+  }
+
+  set allowStale (allowStale) {
+    this[ALLOW_STALE] = !!allowStale;
+  }
+  get allowStale () {
+    return this[ALLOW_STALE]
+  }
+
+  set maxAge (mA) {
+    if (typeof mA !== 'number')
+      throw new TypeError('maxAge must be a non-negative number')
+
+    this[MAX_AGE] = mA;
+    trim(this);
+  }
+  get maxAge () {
+    return this[MAX_AGE]
+  }
+
+  // resize the cache when the lengthCalculator changes.
+  set lengthCalculator (lC) {
+    if (typeof lC !== 'function')
+      lC = naiveLength;
+
+    if (lC !== this[LENGTH_CALCULATOR]) {
+      this[LENGTH_CALCULATOR] = lC;
+      this[LENGTH] = 0;
+      this[LRU_LIST].forEach(hit => {
+        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key);
+        this[LENGTH] += hit.length;
+      });
+    }
+    trim(this);
+  }
+  get lengthCalculator () { return this[LENGTH_CALCULATOR] }
+
+  get length () { return this[LENGTH] }
+  get itemCount () { return this[LRU_LIST].length }
+
+  rforEach (fn, thisp) {
+    thisp = thisp || this;
+    for (let walker = this[LRU_LIST].tail; walker !== null;) {
+      const prev = walker.prev;
+      forEachStep(this, fn, walker, thisp);
+      walker = prev;
+    }
+  }
+
+  forEach (fn, thisp) {
+    thisp = thisp || this;
+    for (let walker = this[LRU_LIST].head; walker !== null;) {
+      const next = walker.next;
+      forEachStep(this, fn, walker, thisp);
+      walker = next;
+    }
+  }
+
+  keys () {
+    return this[LRU_LIST].toArray().map(k => k.key)
+  }
+
+  values () {
+    return this[LRU_LIST].toArray().map(k => k.value)
+  }
+
+  reset () {
+    if (this[DISPOSE] &&
+        this[LRU_LIST] &&
+        this[LRU_LIST].length) {
+      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value));
+    }
+
+    this[CACHE] = new Map(); // hash of items by key
+    this[LRU_LIST] = new Yallist(); // list of items in order of use recency
+    this[LENGTH] = 0; // length of items in the list
+  }
+
+  dump () {
+    return this[LRU_LIST].map(hit =>
+      isStale(this, hit) ? false : {
+        k: hit.key,
+        v: hit.value,
+        e: hit.now + (hit.maxAge || 0)
+      }).toArray().filter(h => h)
+  }
+
+  dumpLru () {
+    return this[LRU_LIST]
+  }
+
+  set (key, value, maxAge) {
+    maxAge = maxAge || this[MAX_AGE];
+
+    if (maxAge && typeof maxAge !== 'number')
+      throw new TypeError('maxAge must be a number')
+
+    const now = maxAge ? Date.now() : 0;
+    const len = this[LENGTH_CALCULATOR](value, key);
+
+    if (this[CACHE].has(key)) {
+      if (len > this[MAX]) {
+        del(this, this[CACHE].get(key));
+        return false
+      }
+
+      const node = this[CACHE].get(key);
+      const item = node.value;
+
+      // dispose of the old one before overwriting
+      // split out into 2 ifs for better coverage tracking
+      if (this[DISPOSE]) {
+        if (!this[NO_DISPOSE_ON_SET])
+          this[DISPOSE](key, item.value);
+      }
+
+      item.now = now;
+      item.maxAge = maxAge;
+      item.value = value;
+      this[LENGTH] += len - item.length;
+      item.length = len;
+      this.get(key);
+      trim(this);
+      return true
+    }
+
+    const hit = new Entry(key, value, len, now, maxAge);
+
+    // oversized objects fall out of cache automatically.
+    if (hit.length > this[MAX]) {
+      if (this[DISPOSE])
+        this[DISPOSE](key, value);
+
+      return false
+    }
+
+    this[LENGTH] += hit.length;
+    this[LRU_LIST].unshift(hit);
+    this[CACHE].set(key, this[LRU_LIST].head);
+    trim(this);
+    return true
+  }
+
+  has (key) {
+    if (!this[CACHE].has(key)) return false
+    const hit = this[CACHE].get(key).value;
+    return !isStale(this, hit)
+  }
+
+  get (key) {
+    return get(this, key, true)
+  }
+
+  peek (key) {
+    return get(this, key, false)
+  }
+
+  pop () {
+    const node = this[LRU_LIST].tail;
+    if (!node)
+      return null
+
+    del(this, node);
+    return node.value
+  }
+
+  del (key) {
+    del(this, this[CACHE].get(key));
+  }
+
+  load (arr) {
+    // reset the cache
+    this.reset();
+
+    const now = Date.now();
+    // A previous serialized cache has the most recent items first
+    for (let l = arr.length - 1; l >= 0; l--) {
+      const hit = arr[l];
+      const expiresAt = hit.e || 0;
+      if (expiresAt === 0)
+        // the item was created without expiration in a non aged cache
+        this.set(hit.k, hit.v);
+      else {
+        const maxAge = expiresAt - now;
+        // dont add already expired items
+        if (maxAge > 0) {
+          this.set(hit.k, hit.v, maxAge);
+        }
+      }
+    }
+  }
+
+  prune () {
+    this[CACHE].forEach((value, key) => get(this, key, false));
+  }
+}
+
+const get = (self, key, doUse) => {
+  const node = self[CACHE].get(key);
+  if (node) {
+    const hit = node.value;
+    if (isStale(self, hit)) {
+      del(self, node);
+      if (!self[ALLOW_STALE])
+        return undefined
+    } else {
+      if (doUse) {
+        if (self[UPDATE_AGE_ON_GET])
+          node.value.now = Date.now();
+        self[LRU_LIST].unshiftNode(node);
+      }
+    }
+    return hit.value
+  }
+};
+
+const isStale = (self, hit) => {
+  if (!hit || (!hit.maxAge && !self[MAX_AGE]))
+    return false
+
+  const diff = Date.now() - hit.now;
+  return hit.maxAge ? diff > hit.maxAge
+    : self[MAX_AGE] && (diff > self[MAX_AGE])
+};
+
+const trim = self => {
+  if (self[LENGTH] > self[MAX]) {
+    for (let walker = self[LRU_LIST].tail;
+      self[LENGTH] > self[MAX] && walker !== null;) {
+      // We know that we're about to delete this one, and also
+      // what the next least recently used key will be, so just
+      // go ahead and set it now.
+      const prev = walker.prev;
+      del(self, walker);
+      walker = prev;
+    }
+  }
+};
+
+const del = (self, node) => {
+  if (node) {
+    const hit = node.value;
+    if (self[DISPOSE])
+      self[DISPOSE](hit.key, hit.value);
+
+    self[LENGTH] -= hit.length;
+    self[CACHE].delete(hit.key);
+    self[LRU_LIST].removeNode(node);
+  }
+};
+
+class Entry {
+  constructor (key, value, length, now, maxAge) {
+    this.key = key;
+    this.value = value;
+    this.length = length;
+    this.now = now;
+    this.maxAge = maxAge || 0;
+  }
+}
+
+const forEachStep = (self, fn, node, thisp) => {
+  let hit = node.value;
+  if (isStale(self, hit)) {
+    del(self, node);
+    if (!self[ALLOW_STALE])
+      hit = undefined;
+  }
+  if (hit)
+    fn.call(thisp, hit.value, hit.key, self);
+};
+
+var lruCache = LRUCache;
+
+var LRU = /*@__PURE__*/getDefaultExportFromCjs(lruCache);
+
+export { LRU as default };
+//# sourceMappingURL=index.js.map

package/esm/node_modules/@dbmx/semver/node_modules/lru-cache/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../node_modules/@dbmx/semver/node_modules/lru-cache/index.js"],"sourcesContent":["'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest.  the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node.  This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n  constructor (options) {\n    if (typeof options === 'number')\n      options = { max: options }\n\n    if (!options)\n      options = {}\n\n    if (options.max && (typeof options.max !== 'number' || options.max < 0))\n      throw new TypeError('max must be a non-negative number')\n    // Kind of weird to have a default max of Infinity, but oh well.\n    const max = this[MAX] = options.max || Infinity\n\n    const lc = options.length || naiveLength\n    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n    this[ALLOW_STALE] = options.stale || false\n    if (options.maxAge && typeof options.maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n    this[MAX_AGE] = options.maxAge || 0\n    this[DISPOSE] = options.dispose\n    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n    this.reset()\n  }\n\n  // resize the cache when the max changes.\n  set max (mL) {\n    if (typeof mL !== 'number' || mL < 0)\n      throw new TypeError('max must be a non-negative number')\n\n    this[MAX] = mL || Infinity\n    trim(this)\n  }\n  get max () {\n    return this[MAX]\n  }\n\n  set allowStale (allowStale) {\n    this[ALLOW_STALE] = !!allowStale\n  }\n  get allowStale () {\n    return this[ALLOW_STALE]\n  }\n\n  set maxAge (mA) {\n    if (typeof mA !== 'number')\n      throw new TypeError('maxAge must be a non-negative number')\n\n    this[MAX_AGE] = mA\n    trim(this)\n  }\n  get maxAge () {\n    return this[MAX_AGE]\n  }\n\n  // resize the cache when the lengthCalculator changes.\n  set lengthCalculator (lC) {\n    if (typeof lC !== 'function')\n      lC = naiveLength\n\n    if (lC !== this[LENGTH_CALCULATOR]) {\n      this[LENGTH_CALCULATOR] = lC\n      this[LENGTH] = 0\n      this[LRU_LIST].forEach(hit => {\n        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n        this[LENGTH] += hit.length\n      })\n    }\n    trim(this)\n  }\n  get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n  get length () { return this[LENGTH] }\n  get itemCount () { return this[LRU_LIST].length }\n\n  rforEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].tail; walker !== null;) {\n      const prev = walker.prev\n      forEachStep(this, fn, walker, thisp)\n      walker = prev\n    }\n  }\n\n  forEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].head; walker !== null;) {\n      const next = walker.next\n      forEachStep(this, fn, walker, thisp)\n      walker = next\n    }\n  }\n\n  keys () {\n    return this[LRU_LIST].toArray().map(k => k.key)\n  }\n\n  values () {\n    return this[LRU_LIST].toArray().map(k => k.value)\n  }\n\n  reset () {\n    if (this[DISPOSE] &&\n        this[LRU_LIST] &&\n        this[LRU_LIST].length) {\n      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n    }\n\n    this[CACHE] = new Map() // hash of items by key\n    this[LRU_LIST] = new Yallist() // list of items in order of use recency\n    this[LENGTH] = 0 // length of items in the list\n  }\n\n  dump () {\n    return this[LRU_LIST].map(hit =>\n      isStale(this, hit) ? false : {\n        k: hit.key,\n        v: hit.value,\n        e: hit.now + (hit.maxAge || 0)\n      }).toArray().filter(h => h)\n  }\n\n  dumpLru () {\n    return this[LRU_LIST]\n  }\n\n  set (key, value, maxAge) {\n    maxAge = maxAge || this[MAX_AGE]\n\n    if (maxAge && typeof maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n\n    const now = maxAge ? Date.now() : 0\n    const len = this[LENGTH_CALCULATOR](value, key)\n\n    if (this[CACHE].has(key)) {\n      if (len > this[MAX]) {\n        del(this, this[CACHE].get(key))\n        return false\n      }\n\n      const node = this[CACHE].get(key)\n      const item = node.value\n\n      // dispose of the old one before overwriting\n      // split out into 2 ifs for better coverage tracking\n      if (this[DISPOSE]) {\n        if (!this[NO_DISPOSE_ON_SET])\n          this[DISPOSE](key, item.value)\n      }\n\n      item.now = now\n      item.maxAge = maxAge\n      item.value = value\n      this[LENGTH] += len - item.length\n      item.length = len\n      this.get(key)\n      trim(this)\n      return true\n    }\n\n    const hit = new Entry(key, value, len, now, maxAge)\n\n    // oversized objects fall out of cache automatically.\n    if (hit.length > this[MAX]) {\n      if (this[DISPOSE])\n        this[DISPOSE](key, value)\n\n      return false\n    }\n\n    this[LENGTH] += hit.length\n    this[LRU_LIST].unshift(hit)\n    this[CACHE].set(key, this[LRU_LIST].head)\n    trim(this)\n    return true\n  }\n\n  has (key) {\n    if (!this[CACHE].has(key)) return false\n    const hit = this[CACHE].get(key).value\n    return !isStale(this, hit)\n  }\n\n  get (key) {\n    return get(this, key, true)\n  }\n\n  peek (key) {\n    return get(this, key, false)\n  }\n\n  pop () {\n    const node = this[LRU_LIST].tail\n    if (!node)\n      return null\n\n    del(this, node)\n    return node.value\n  }\n\n  del (key) {\n    del(this, this[CACHE].get(key))\n  }\n\n  load (arr) {\n    // reset the cache\n    this.reset()\n\n    const now = Date.now()\n    // A previous serialized cache has the most recent items first\n    for (let l = arr.length - 1; l >= 0; l--) {\n      const hit = arr[l]\n      const expiresAt = hit.e || 0\n      if (expiresAt === 0)\n        // the item was created without expiration in a non aged cache\n        this.set(hit.k, hit.v)\n      else {\n        const maxAge = expiresAt - now\n        // dont add already expired items\n        if (maxAge > 0) {\n          this.set(hit.k, hit.v, maxAge)\n        }\n      }\n    }\n  }\n\n  prune () {\n    this[CACHE].forEach((value, key) => get(this, key, false))\n  }\n}\n\nconst get = (self, key, doUse) => {\n  const node = self[CACHE].get(key)\n  if (node) {\n    const hit = node.value\n    if (isStale(self, hit)) {\n      del(self, node)\n      if (!self[ALLOW_STALE])\n        return undefined\n    } else {\n      if (doUse) {\n        if (self[UPDATE_AGE_ON_GET])\n          node.value.now = Date.now()\n        self[LRU_LIST].unshiftNode(node)\n      }\n    }\n    return hit.value\n  }\n}\n\nconst isStale = (self, hit) => {\n  if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n    return false\n\n  const diff = Date.now() - hit.now\n  return hit.maxAge ? diff > hit.maxAge\n    : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n  if (self[LENGTH] > self[MAX]) {\n    for (let walker = self[LRU_LIST].tail;\n      self[LENGTH] > self[MAX] && walker !== null;) {\n      // We know that we're about to delete this one, and also\n      // what the next least recently used key will be, so just\n      // go ahead and set it now.\n      const prev = walker.prev\n      del(self, walker)\n      walker = prev\n    }\n  }\n}\n\nconst del = (self, node) => {\n  if (node) {\n    const hit = node.value\n    if (self[DISPOSE])\n      self[DISPOSE](hit.key, hit.value)\n\n    self[LENGTH] -= hit.length\n    self[CACHE].delete(hit.key)\n    self[LRU_LIST].removeNode(node)\n  }\n}\n\nclass Entry {\n  constructor (key, value, length, now, maxAge) {\n    this.key = key\n    this.value = value\n    this.length = length\n    this.now = now\n    this.maxAge = maxAge || 0\n  }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n  let hit = node.value\n  if (isStale(self, hit)) {\n    del(self, node)\n    if (!self[ALLOW_STALE])\n      hit = undefined\n  }\n  if (hit)\n    fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n"],"names":["require$$0"],"mappings":";;;AAEA;AACA,MAAM,OAAO,GAAGA;;AAEhB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK;AACxB,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ;AAC9B,MAAM,iBAAiB,GAAG,MAAM,CAAC,kBAAkB;AACnD,MAAM,WAAW,GAAG,MAAM,CAAC,YAAY;AACvC,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ;AAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS;AAChC,MAAM,iBAAiB,GAAG,MAAM,CAAC,gBAAgB;AACjD,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS;AACjC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO;AAC5B,MAAM,iBAAiB,GAAG,MAAM,CAAC,gBAAgB;;AAEjD,MAAM,WAAW,GAAG,MAAM;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,QAAQ,CAAC;AACf,EAAE,WAAW,CAAC,CAAC,OAAO,EAAE;AACxB,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ;AACnC,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO;;AAE9B,IAAI,IAAI,CAAC,OAAO;AAChB,MAAM,OAAO,GAAG;;AAEhB,IAAI,IAAI,OAAO,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,GAAG,KAAK,QAAQ,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;AAC3E,MAAM,MAAM,IAAI,SAAS,CAAC,mCAAmC;AAC7D;AACA,IAAgB,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI;;AAE3C,IAAI,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,IAAI;AACjC,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,UAAU,IAAI,WAAW,GAAG;AACzE,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC,KAAK,IAAI;AACzC,IAAI,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,OAAO,CAAC,MAAM,KAAK,QAAQ;AAC5D,MAAM,MAAM,IAAI,SAAS,CAAC,yBAAyB;AACnD,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI;AACtC,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC;AAC5B,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,OAAO,CAAC,cAAc,IAAI;AACxD,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,OAAO,CAAC,cAAc,IAAI;AACxD,IAAI,IAAI,CAAC,KAAK;AACd,EAAA;;AAEA;AACA,EAAE,IAAI,GAAG,CAAC,CAAC,EAAE,EAAE;AACf,IAAI,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,GAAG,CAAC;AACxC,MAAM,MAAM,IAAI,SAAS,CAAC,mCAAmC;;AAE7D,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI;AACtB,IAAI,IAAI,CAAC,IAAI;AACb,EAAA;AACA,EAAE,IAAI,GAAG,CAAC,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,GAAG;AACnB,EAAA;;AAEA,EAAE,IAAI,UAAU,CAAC,CAAC,UAAU,EAAE;AAC9B,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;AAC1B,EAAA;AACA,EAAE,IAAI,UAAU,CAAC,GAAG;AACpB,IAAI,OAAO,IAAI,CAAC,WAAW;AAC3B,EAAA;;AAEA,EAAE,IAAI,MAAM,CAAC,CAAC,EAAE,EAAE;AAClB,IAAI,IAAI,OAAO,EAAE,KAAK,QAAQ;AAC9B,MAAM,MAAM,IAAI,SAAS,CAAC,sCAAsC;;AAEhE,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG;AACpB,IAAI,IAAI,CAAC,IAAI;AACb,EAAA;AACA,EAAE,IAAI,MAAM,CAAC,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,EAAA;;AAEA;AACA,EAAE,IAAI,gBAAgB,CAAC,CAAC,EAAE,EAAE;AAC5B,IAAI,IAAI,OAAO,EAAE,KAAK,UAAU;AAChC,MAAM,EAAE,GAAG;;AAEX,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,iBAAiB,CAAC,EAAE;AACxC,MAAM,IAAI,CAAC,iBAAiB,CAAC,GAAG;AAChC,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG;AACrB,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI;AACpC,QAAQ,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG;AAC/D,QAAQ,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;AAC5B,MAAA,CAAO;AACP,IAAA;AACA,IAAI,IAAI,CAAC,IAAI;AACb,EAAA;AACA,EAAE,IAAI,gBAAgB,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAA;;AAE1D,EAAE,IAAI,MAAM,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAA;AACrC,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAA;;AAEjD,EAAE,QAAQ,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE;AACvB,IAAI,KAAK,GAAG,KAAK,IAAI;AACrB,IAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,GAAG;AAC7D,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAC1B,MAAM,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK;AACzC,MAAM,MAAM,GAAG;AACf,IAAA;AACA,EAAA;;AAEA,EAAE,OAAO,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE;AACtB,IAAI,KAAK,GAAG,KAAK,IAAI;AACrB,IAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,IAAI,GAAG;AAC7D,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAC1B,MAAM,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK;AACzC,MAAM,MAAM,GAAG;AACf,IAAA;AACA,EAAA;;AAEA,EAAE,IAAI,CAAC,GAAG;AACV,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG;AAClD,EAAA;;AAEA,EAAE,MAAM,CAAC,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK;AACpD,EAAA;;AAEA,EAAE,KAAK,CAAC,GAAG;AACX,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC;AACrB,QAAQ,IAAI,CAAC,QAAQ,CAAC;AACtB,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE;AAC/B,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC;AACrE,IAAA;;AAEA,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,GAAE;AAC3B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,OAAO,GAAE;AAClC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,EAAC;AACpB,EAAA;;AAEA,EAAE,IAAI,CAAC,GAAG;AACV,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG;AACjC,MAAM,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,KAAK,GAAG;AACnC,QAAQ,CAAC,EAAE,GAAG,CAAC,GAAG;AAClB,QAAQ,CAAC,EAAE,GAAG,CAAC,KAAK;AACpB,QAAQ,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;AACrC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;AAChC,EAAA;;AAEA,EAAE,OAAO,CAAC,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,QAAQ;AACxB,EAAA;;AAEA,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE;AAC3B,IAAI,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC,OAAO;;AAEnC,IAAI,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;AAC5C,MAAM,MAAM,IAAI,SAAS,CAAC,yBAAyB;;AAEnD,IAAI,MAAM,GAAG,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG;AACtC,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,KAAK,EAAE,GAAG;;AAElD,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;AAC9B,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE;AAC3B,QAAQ,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;AACtC,QAAQ,OAAO;AACf,MAAA;;AAEA,MAAM,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG;AACtC,MAAM,MAAM,IAAI,GAAG,IAAI,CAAC;;AAExB;AACA;AACA,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE;AACzB,QAAQ,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC;AACpC,UAAU,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK;AACvC,MAAA;;AAEA,MAAM,IAAI,CAAC,GAAG,GAAG;AACjB,MAAM,IAAI,CAAC,MAAM,GAAG;AACpB,MAAM,IAAI,CAAC,KAAK,GAAG;AACnB,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC;AACjC,MAAM,IAAI,CAAC,MAAM,GAAG;AACpB,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG;AAClB,MAAM,IAAI,CAAC,IAAI;AACf,MAAM,OAAO;AACb,IAAA;;AAEA,IAAI,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM;;AAEtD;AACA,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE;AAChC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC;AACvB,QAAQ,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK;;AAEhC,MAAM,OAAO;AACb,IAAA;;AAEA,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;AACxB,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,GAAG;AAC9B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI;AAC5C,IAAI,IAAI,CAAC,IAAI;AACb,IAAI,OAAO;AACX,EAAA;;AAEA,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE;AACZ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO;AACtC,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACrC,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG;AAC7B,EAAA;;AAEA,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE;AACZ,IAAI,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI;AAC9B,EAAA;;AAEA,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;AACb,IAAI,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK;AAC/B,EAAA;;AAEA,EAAE,GAAG,CAAC,GAAG;AACT,IAAI,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;AAChC,IAAI,IAAI,CAAC,IAAI;AACb,MAAM,OAAO;;AAEb,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI;AAClB,IAAI,OAAO,IAAI,CAAC;AAChB,EAAA;;AAEA,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE;AACZ,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;AAClC,EAAA;;AAEA,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE;AACb;AACA,IAAI,IAAI,CAAC,KAAK;;AAEd,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG;AACxB;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9C,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;AACvB,MAAM,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,IAAI;AACjC,MAAM,IAAI,SAAS,KAAK,CAAC;AACzB;AACA,QAAQ,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC7B,WAAW;AACX,QAAQ,MAAM,MAAM,GAAG,SAAS,GAAG;AACnC;AACA,QAAQ,IAAI,MAAM,GAAG,CAAC,EAAE;AACxB,UAAU,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM;AACvC,QAAA;AACA,MAAA;AACA,IAAA;AACA,EAAA;;AAEA,EAAE,KAAK,CAAC,GAAG;AACX,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC;AAC7D,EAAA;AACA;;AAEA,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,KAAK;AAClC,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG;AAClC,EAAE,IAAI,IAAI,EAAE;AACZ,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AAC5B,MAAM,GAAG,CAAC,IAAI,EAAE,IAAI;AACpB,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;AAC5B,QAAQ,OAAO;AACf,IAAA,CAAK,MAAM;AACX,MAAM,IAAI,KAAK,EAAE;AACjB,QAAQ,IAAI,IAAI,CAAC,iBAAiB,CAAC;AACnC,UAAU,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG;AACnC,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAC,WAAW,CAAC,IAAI;AACvC,MAAA;AACA,IAAA;AACA,IAAI,OAAO,GAAG,CAAC;AACf,EAAA;AACA;;AAEA,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK;AAC/B,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC7C,IAAI,OAAO;;AAEX,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC;AAChC,EAAE,OAAO,GAAG,CAAC,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC;AACjC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;AAC5C;;AAEA,MAAM,IAAI,GAAG,IAAI,IAAI;AACrB,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE;AAChC,IAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI;AACzC,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,KAAK,IAAI,GAAG;AACpD;AACA;AACA;AACA,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAC1B,MAAM,GAAG,CAAC,IAAI,EAAE,MAAM;AACtB,MAAM,MAAM,GAAG;AACf,IAAA;AACA,EAAA;AACA;;AAEA,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK;AAC5B,EAAE,IAAI,IAAI,EAAE;AACZ,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC;AACrB,MAAM,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK;;AAEtC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;AACxB,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;AAC9B,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,IAAI;AAClC,EAAA;AACA;;AAEA,MAAM,KAAK,CAAC;AACZ,EAAE,WAAW,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE;AAChD,IAAI,IAAI,CAAC,GAAG,GAAG;AACf,IAAI,IAAI,CAAC,KAAK,GAAG;AACjB,IAAI,IAAI,CAAC,MAAM,GAAG;AAClB,IAAI,IAAI,CAAC,GAAG,GAAG;AACf,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI;AAC5B,EAAA;AACA;;AAEA,MAAM,WAAW,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK;AAC/C,EAAE,IAAI,GAAG,GAAG,IAAI,CAAC;AACjB,EAAE,IAAI,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE;AAC1B,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI;AAClB,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;AAC1B,MAAM,GAAG,GAAG;AACZ,EAAA;AACA,EAAE,IAAI,GAAG;AACT,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI;AAC3C;;AAEA,IAAA,QAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/esm/node_modules/@dbmx/semver/node_modules/yallist/iterator.js

@@ -0,0 +1,18 @@
+var iterator;
+var hasRequiredIterator;
+
+function requireIterator () {
+	if (hasRequiredIterator) return iterator;
+	hasRequiredIterator = 1;
+	iterator = function (Yallist) {
+	  Yallist.prototype[Symbol.iterator] = function* () {
+	    for (let walker = this.head; walker; walker = walker.next) {
+	      yield walker.value;
+	    }
+	  };
+	};
+	return iterator;
+}
+
+export { requireIterator as __require };
+//# sourceMappingURL=iterator.js.map

package/esm/node_modules/@dbmx/semver/node_modules/yallist/iterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.js","sources":["../../../../../../node_modules/@dbmx/semver/node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;AACA,CAAA,QAAc,GAAG,UAAU,OAAO,EAAE;GAClC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,aAAa;AACpD,KAAI,KAAK,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE;OACzD,MAAM,MAAM,CAAC;AACnB,KAAA;AACA,GAAA;AACA,CAAA;;;;;;","x_google_ignoreList":[0]}