@rango-dev/provider-ledger 0.30.1 → 0.30.2-next.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (6) hide show
  1. package/CHANGELOG.md +4 -0
  2. package/dist/{TransportWebHID-JLT4ETY3.js → TransportWebHID-MELLZRNW.js} +1 -1
  3. package/dist/{TransportWebHID-JLT4ETY3.js.map → TransportWebHID-MELLZRNW.js.map} +1 -1
  4. package/dist/mod.js +1 -1
  5. package/dist/provider-ledger.build.json +1 -1
  6. package/package.json +5 -5
package/dist/{TransportWebHID-JLT4ETY3.js.map → TransportWebHID-MELLZRNW.js.map} RENAMED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "version": 3,
3
- "sources": ["../../../node_modules/semver/internal/constants.js", "../../../node_modules/semver/internal/debug.js", "../../../node_modules/semver/internal/re.js", "../../../node_modules/semver/internal/parse-options.js", "../../../node_modules/semver/internal/identifiers.js", "../../../node_modules/semver/classes/semver.js", "../../../node_modules/semver/functions/parse.js", "../../../node_modules/semver/functions/valid.js", "../../../node_modules/semver/functions/clean.js", "../../../node_modules/semver/functions/inc.js", "../../../node_modules/semver/functions/diff.js", "../../../node_modules/semver/functions/major.js", "../../../node_modules/semver/functions/minor.js", "../../../node_modules/semver/functions/patch.js", "../../../node_modules/semver/functions/prerelease.js", "../../../node_modules/semver/functions/compare.js", "../../../node_modules/semver/functions/rcompare.js", "../../../node_modules/semver/functions/compare-loose.js", "../../../node_modules/semver/functions/compare-build.js", "../../../node_modules/semver/functions/sort.js", "../../../node_modules/semver/functions/rsort.js", "../../../node_modules/semver/functions/gt.js", "../../../node_modules/semver/functions/lt.js", "../../../node_modules/semver/functions/eq.js", "../../../node_modules/semver/functions/neq.js", "../../../node_modules/semver/functions/gte.js", "../../../node_modules/semver/functions/lte.js", "../../../node_modules/semver/functions/cmp.js", "../../../node_modules/semver/functions/coerce.js", "../../../node_modules/yallist/iterator.js", "../../../node_modules/yallist/yallist.js", "../../../node_modules/lru-cache/index.js", "../../../node_modules/semver/classes/range.js", "../../../node_modules/semver/classes/comparator.js", "../../../node_modules/semver/functions/satisfies.js", "../../../node_modules/semver/ranges/to-comparators.js", "../../../node_modules/semver/ranges/max-satisfying.js", "../../../node_modules/semver/ranges/min-satisfying.js", "../../../node_modules/semver/ranges/min-version.js", "../../../node_modules/semver/ranges/valid.js", "../../../node_modules/semver/ranges/outside.js", "../../../node_modules/semver/ranges/gtr.js", "../../../node_modules/semver/ranges/ltr.js", "../../../node_modules/semver/ranges/intersects.js", "../../../node_modules/semver/ranges/simplify.js", "../../../node_modules/semver/ranges/subset.js", "../../../node_modules/semver/index.js", "../../../node_modules/@jspm/core/nodelibs/browser/chunk-4bd36a8f.js", "node-modules-polyfills:events", "../../../node_modules/@ledgerhq/hw-transport/src/Transport.ts", "../../../node_modules/@ledgerhq/devices/src/hid-framing.ts", "../../../node_modules/@ledgerhq/devices/src/index.ts", "../../../node_modules/@ledgerhq/hw-transport-webhid/src/TransportWebHID.ts"],
3
+ "sources": ["../../../node_modules/@ledgerhq/devices/node_modules/semver/internal/constants.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/internal/debug.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/internal/re.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/internal/parse-options.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/internal/identifiers.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/classes/semver.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/parse.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/valid.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/clean.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/inc.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/diff.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/major.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/minor.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/patch.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/prerelease.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/compare.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/rcompare.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/compare-loose.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/compare-build.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/sort.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/rsort.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/gt.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/lt.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/eq.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/neq.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/gte.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/lte.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/cmp.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/coerce.js", "../../../node_modules/yallist/iterator.js", "../../../node_modules/yallist/yallist.js", "../../../node_modules/lru-cache/index.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/classes/range.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/classes/comparator.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/functions/satisfies.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/to-comparators.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/max-satisfying.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/min-satisfying.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/min-version.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/valid.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/outside.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/gtr.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/ltr.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/intersects.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/simplify.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/ranges/subset.js", "../../../node_modules/@ledgerhq/devices/node_modules/semver/index.js", "../../../node_modules/@jspm/core/nodelibs/browser/chunk-4bd36a8f.js", "node-modules-polyfills:events", "../../../node_modules/@ledgerhq/hw-transport/src/Transport.ts", "../../../node_modules/@ledgerhq/devices/src/hid-framing.ts", "../../../node_modules/@ledgerhq/devices/src/index.ts", "../../../node_modules/@ledgerhq/hw-transport-webhid/src/TransportWebHID.ts"],
4
4
  "sourcesContent": ["// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n 'major',\n 'premajor',\n 'minor',\n 'preminor',\n 'patch',\n 'prepatch',\n 'prerelease',\n]\n\nmodule.exports = {\n MAX_LENGTH,\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_SAFE_INTEGER,\n RELEASE_TYPES,\n SEMVER_SPEC_VERSION,\n FLAG_INCLUDE_PRERELEASE: 0b001,\n FLAG_LOOSE: 0b010,\n}\n", "const debug = (\n typeof process === 'object' &&\n process.env &&\n process.env.NODE_DEBUG &&\n /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n : () => {}\n\nmodule.exports = debug\n", "const {\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 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 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\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NUMERICIDENTIFIER]\n}|${src[t.NONNUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NUMERICIDENTIFIERLOOSE]\n}|${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]\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('COERCE', `${'(^|[^\\\\d])' +\n '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], 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", "// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n if (!options) {\n return emptyOpts\n }\n\n if (typeof options !== 'object') {\n return looseOption\n }\n\n return options\n}\nmodule.exports = parseOptions\n", "const numeric = /^[0-9]+$/\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\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n compareIdentifiers,\n rcompareIdentifiers,\n}\n", "const debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\nclass SemVer {\n constructor (version, options) {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n if (version.loose === !!options.loose &&\n version.includePrerelease === !!options.includePrerelease) {\n return version\n } else {\n version = version.version\n }\n } else if (typeof version !== 'string') {\n throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n }\n\n if (version.length > MAX_LENGTH) {\n throw new TypeError(\n `version is longer than ${MAX_LENGTH} characters`\n )\n }\n\n debug('SemVer', version, options)\n this.options = options\n this.loose = !!options.loose\n // this isn't actually relevant for versions, but keep it so that we\n // don't run into trouble passing this.options around.\n this.includePrerelease = !!options.includePrerelease\n\n const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n if (!m) {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n this.raw = version\n\n // these are actually numbers\n this.major = +m[1]\n this.minor = +m[2]\n this.patch = +m[3]\n\n if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n throw new TypeError('Invalid major version')\n }\n\n if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n throw new TypeError('Invalid minor version')\n }\n\n if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n throw new TypeError('Invalid patch version')\n }\n\n // numberify any prerelease numeric ids\n if (!m[4]) {\n this.prerelease = []\n } else {\n this.prerelease = m[4].split('.').map((id) => {\n if (/^[0-9]+$/.test(id)) {\n const num = +id\n if (num >= 0 && num < MAX_SAFE_INTEGER) {\n return num\n }\n }\n return id\n })\n }\n\n this.build = m[5] ? m[5].split('.') : []\n this.format()\n }\n\n format () {\n this.version = `${this.major}.${this.minor}.${this.patch}`\n if (this.prerelease.length) {\n this.version += `-${this.prerelease.join('.')}`\n }\n return this.version\n }\n\n toString () {\n return this.version\n }\n\n compare (other) {\n debug('SemVer.compare', this.version, this.options, other)\n if (!(other instanceof SemVer)) {\n if (typeof other === 'string' && other === this.version) {\n return 0\n }\n other = new SemVer(other, this.options)\n }\n\n if (other.version === this.version) {\n return 0\n }\n\n return this.compareMain(other) || this.comparePre(other)\n }\n\n compareMain (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n return (\n compareIdentifiers(this.major, other.major) ||\n compareIdentifiers(this.minor, other.minor) ||\n compareIdentifiers(this.patch, other.patch)\n )\n }\n\n comparePre (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n // NOT having a prerelease is > having one\n if (this.prerelease.length && !other.prerelease.length) {\n return -1\n } else if (!this.prerelease.length && other.prerelease.length) {\n return 1\n } else if (!this.prerelease.length && !other.prerelease.length) {\n return 0\n }\n\n let i = 0\n do {\n const a = this.prerelease[i]\n const b = other.prerelease[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n compareBuild (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n let i = 0\n do {\n const a = this.build[i]\n const b = other.build[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n // preminor will bump the version up to the next minor release, and immediately\n // down to pre-release. premajor and prepatch work the same way.\n inc (release, identifier, identifierBase) {\n switch (release) {\n case 'premajor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor = 0\n this.major++\n this.inc('pre', identifier, identifierBase)\n break\n case 'preminor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor++\n this.inc('pre', identifier, identifierBase)\n break\n case 'prepatch':\n // If this is already a prerelease, it will bump to the next version\n // drop any prereleases that might already exist, since they are not\n // relevant at this point.\n this.prerelease.length = 0\n this.inc('patch', identifier, identifierBase)\n this.inc('pre', identifier, identifierBase)\n break\n // If the input is a non-prerelease version, this acts the same as\n // prepatch.\n case 'prerelease':\n if (this.prerelease.length === 0) {\n this.inc('patch', identifier, identifierBase)\n }\n this.inc('pre', identifier, identifierBase)\n break\n\n case 'major':\n // If this is a pre-major version, bump up to the same major version.\n // Otherwise increment major.\n // 1.0.0-5 bumps to 1.0.0\n // 1.1.0 bumps to 2.0.0\n if (\n this.minor !== 0 ||\n this.patch !== 0 ||\n this.prerelease.length === 0\n ) {\n this.major++\n }\n this.minor = 0\n this.patch = 0\n this.prerelease = []\n break\n case 'minor':\n // If this is a pre-minor version, bump up to the same minor version.\n // Otherwise increment minor.\n // 1.2.0-5 bumps to 1.2.0\n // 1.2.1 bumps to 1.3.0\n if (this.patch !== 0 || this.prerelease.length === 0) {\n this.minor++\n }\n this.patch = 0\n this.prerelease = []\n break\n case 'patch':\n // If this is not a pre-release version, it will increment the patch.\n // If it is a pre-release it will bump up to the same patch version.\n // 1.2.0-5 patches to 1.2.0\n // 1.2.0 patches to 1.2.1\n if (this.prerelease.length === 0) {\n this.patch++\n }\n this.prerelease = []\n break\n // This probably shouldn't be used publicly.\n // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n case 'pre': {\n const base = Number(identifierBase) ? 1 : 0\n\n if (!identifier && identifierBase === false) {\n throw new Error('invalid increment argument: identifier is empty')\n }\n\n if (this.prerelease.length === 0) {\n this.prerelease = [base]\n } else {\n let i = this.prerelease.length\n while (--i >= 0) {\n if (typeof this.prerelease[i] === 'number') {\n this.prerelease[i]++\n i = -2\n }\n }\n if (i === -1) {\n // didn't increment anything\n if (identifier === this.prerelease.join('.') && identifierBase === false) {\n throw new Error('invalid increment argument: identifier already exists')\n }\n this.prerelease.push(base)\n }\n }\n if (identifier) {\n // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n let prerelease = [identifier, base]\n if (identifierBase === false) {\n prerelease = [identifier]\n }\n if (compareIdentifiers(this.prerelease[0], identifier) === 0) {\n if (isNaN(this.prerelease[1])) {\n this.prerelease = prerelease\n }\n } else {\n this.prerelease = prerelease\n }\n }\n break\n }\n default:\n throw new Error(`invalid increment argument: ${release}`)\n }\n this.raw = this.format()\n if (this.build.length) {\n this.raw += `+${this.build.join('.')}`\n }\n return this\n }\n}\n\nmodule.exports = SemVer\n", "const SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n if (version instanceof SemVer) {\n return version\n }\n try {\n return new SemVer(version, options)\n } catch (er) {\n if (!throwErrors) {\n return null\n }\n throw er\n }\n}\n\nmodule.exports = parse\n", "const parse = require('./parse')\nconst valid = (version, options) => {\n const v = parse(version, options)\n return v ? v.version : null\n}\nmodule.exports = valid\n", "const parse = require('./parse')\nconst clean = (version, options) => {\n const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n return s ? s.version : null\n}\nmodule.exports = clean\n", "const SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n if (typeof (options) === 'string') {\n identifierBase = identifier\n identifier = options\n options = undefined\n }\n\n try {\n return new SemVer(\n version instanceof SemVer ? version.version : version,\n options\n ).inc(release, identifier, identifierBase).version\n } catch (er) {\n return null\n }\n}\nmodule.exports = inc\n", "const parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n const v1 = parse(version1, null, true)\n const v2 = parse(version2, null, true)\n const comparison = v1.compare(v2)\n\n if (comparison === 0) {\n return null\n }\n\n const v1Higher = comparison > 0\n const highVersion = v1Higher ? v1 : v2\n const lowVersion = v1Higher ? v2 : v1\n const highHasPre = !!highVersion.prerelease.length\n const lowHasPre = !!lowVersion.prerelease.length\n\n if (lowHasPre && !highHasPre) {\n // Going from prerelease -> no prerelease requires some special casing\n\n // If the low version has only a major, then it will always be a major\n // Some examples:\n // 1.0.0-1 -> 1.0.0\n // 1.0.0-1 -> 1.1.1\n // 1.0.0-1 -> 2.0.0\n if (!lowVersion.patch && !lowVersion.minor) {\n return 'major'\n }\n\n // Otherwise it can be determined by checking the high version\n\n if (highVersion.patch) {\n // anything higher than a patch bump would result in the wrong version\n return 'patch'\n }\n\n if (highVersion.minor) {\n // anything higher than a minor bump would result in the wrong version\n return 'minor'\n }\n\n // bumping major/minor/patch all have same result\n return 'major'\n }\n\n // add the `pre` prefix if we are going to a prerelease version\n const prefix = highHasPre ? 'pre' : ''\n\n if (v1.major !== v2.major) {\n return prefix + 'major'\n }\n\n if (v1.minor !== v2.minor) {\n return prefix + 'minor'\n }\n\n if (v1.patch !== v2.patch) {\n return prefix + 'patch'\n }\n\n // high and low are preleases\n return 'prerelease'\n}\n\nmodule.exports = diff\n", "const SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n", "const SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n", "const SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n", "const parse = require('./parse')\nconst prerelease = (version, options) => {\n const parsed = parse(version, options)\n return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n", "const SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n", "const compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n", "const compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n", "const SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n const versionA = new SemVer(a, loose)\n const versionB = new SemVer(b, loose)\n return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n", "const compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n", "const compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n", "const compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n", "const compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n", "const compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n", "const compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n", "const compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n", "const compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n", "const eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n switch (op) {\n case '===':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a === b\n\n case '!==':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a !== b\n\n case '':\n case '=':\n case '==':\n return eq(a, b, loose)\n\n case '!=':\n return neq(a, b, loose)\n\n case '>':\n return gt(a, b, loose)\n\n case '>=':\n return gte(a, b, loose)\n\n case '<':\n return lt(a, b, loose)\n\n case '<=':\n return lte(a, b, loose)\n\n default:\n throw new TypeError(`Invalid operator: ${op}`)\n }\n}\nmodule.exports = cmp\n", "const SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version === 'number') {\n version = String(version)\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n options = options || {}\n\n let match = null\n if (!options.rtl) {\n match = version.match(re[t.COERCE])\n } else {\n // Find the right-most coercible string that does not share\n // a terminus with a more left-ward coercible string.\n // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n //\n // Walk through the string checking with a /g regexp\n // Manually set the index so as to pick up overlapping matches.\n // Stop when we get a match that ends at the string end, since no\n // coercible string can be more right-ward without the same terminus.\n let next\n while ((next = re[t.COERCERTL].exec(version)) &&\n (!match || match.index + match[0].length !== version.length)\n ) {\n if (!match ||\n next.index + next[0].length !== match.index + match[0].length) {\n match = next\n }\n re[t.COERCERTL].lastIndex = next.index + next[1].length + next[2].length\n }\n // leave it in a clean state\n re[t.COERCERTL].lastIndex = -1\n }\n\n if (match === null) {\n return null\n }\n\n return parse(`${match[2]}.${match[3] || '0'}.${match[4] || '0'}`, options)\n}\nmodule.exports = coerce\n", "'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", "'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n var self = this\n if (!(self instanceof Yallist)) {\n self = new Yallist()\n }\n\n self.tail = null\n self.head = null\n self.length = 0\n\n if (list && typeof list.forEach === 'function') {\n list.forEach(function (item) {\n self.push(item)\n })\n } else if (arguments.length > 0) {\n for (var i = 0, l = arguments.length; i < l; i++) {\n self.push(arguments[i])\n }\n }\n\n return self\n}\n\nYallist.prototype.removeNode = function (node) {\n if (node.list !== this) {\n throw new Error('removing node which does not belong to this list')\n }\n\n var next = node.next\n var prev = node.prev\n\n if (next) {\n next.prev = prev\n }\n\n if (prev) {\n prev.next = next\n }\n\n if (node === this.head) {\n this.head = next\n }\n if (node === this.tail) {\n this.tail = prev\n }\n\n node.list.length--\n node.next = null\n node.prev = null\n node.list = null\n\n return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n if (node === this.head) {\n return\n }\n\n if (node.list) {\n node.list.removeNode(node)\n }\n\n var head = this.head\n node.list = this\n node.next = head\n if (head) {\n head.prev = node\n }\n\n this.head = node\n if (!this.tail) {\n this.tail = node\n }\n this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n if (node === this.tail) {\n return\n }\n\n if (node.list) {\n node.list.removeNode(node)\n }\n\n var tail = this.tail\n node.list = this\n node.prev = tail\n if (tail) {\n tail.next = node\n }\n\n this.tail = node\n if (!this.head) {\n this.head = node\n }\n this.length++\n}\n\nYallist.prototype.push = function () {\n for (var i = 0, l = arguments.length; i < l; i++) {\n push(this, arguments[i])\n }\n return this.length\n}\n\nYallist.prototype.unshift = function () {\n for (var i = 0, l = arguments.length; i < l; i++) {\n unshift(this, arguments[i])\n }\n return this.length\n}\n\nYallist.prototype.pop = function () {\n if (!this.tail) {\n return undefined\n }\n\n var res = this.tail.value\n this.tail = this.tail.prev\n if (this.tail) {\n this.tail.next = null\n } else {\n this.head = null\n }\n this.length--\n return res\n}\n\nYallist.prototype.shift = function () {\n if (!this.head) {\n return undefined\n }\n\n var res = this.head.value\n this.head = this.head.next\n if (this.head) {\n this.head.prev = null\n } else {\n this.tail = null\n }\n this.length--\n return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n thisp = thisp || this\n for (var walker = this.head, i = 0; walker !== null; i++) {\n fn.call(thisp, walker.value, i, this)\n walker = walker.next\n }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n thisp = thisp || this\n for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n fn.call(thisp, walker.value, i, this)\n walker = walker.prev\n }\n}\n\nYallist.prototype.get = function (n) {\n for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n // abort out of the list early if we hit a cycle\n walker = walker.next\n }\n if (i === n && walker !== null) {\n return walker.value\n }\n}\n\nYallist.prototype.getReverse = function (n) {\n for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n // abort out of the list early if we hit a cycle\n walker = walker.prev\n }\n if (i === n && walker !== null) {\n return walker.value\n }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n thisp = thisp || this\n var res = new Yallist()\n for (var walker = this.head; walker !== null;) {\n res.push(fn.call(thisp, walker.value, this))\n walker = walker.next\n }\n return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n thisp = thisp || this\n var res = new Yallist()\n for (var walker = this.tail; walker !== null;) {\n res.push(fn.call(thisp, walker.value, this))\n walker = walker.prev\n }\n return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n var acc\n var walker = this.head\n if (arguments.length > 1) {\n acc = initial\n } else if (this.head) {\n walker = this.head.next\n acc = this.head.value\n } else {\n throw new TypeError('Reduce of empty list with no initial value')\n }\n\n for (var i = 0; walker !== null; i++) {\n acc = fn(acc, walker.value, i)\n walker = walker.next\n }\n\n return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n var acc\n var walker = this.tail\n if (arguments.length > 1) {\n acc = initial\n } else if (this.tail) {\n walker = this.tail.prev\n acc = this.tail.value\n } else {\n throw new TypeError('Reduce of empty list with no initial value')\n }\n\n for (var i = this.length - 1; walker !== null; i--) {\n acc = fn(acc, walker.value, i)\n walker = walker.prev\n }\n\n return acc\n}\n\nYallist.prototype.toArray = function () {\n var arr = new Array(this.length)\n for (var i = 0, walker = this.head; walker !== null; i++) {\n arr[i] = walker.value\n walker = walker.next\n }\n return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n var arr = new Array(this.length)\n for (var i = 0, walker = this.tail; walker !== null; i++) {\n arr[i] = walker.value\n walker = walker.prev\n }\n return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n to = to || this.length\n if (to < 0) {\n to += this.length\n }\n from = from || 0\n if (from < 0) {\n from += this.length\n }\n var ret = new Yallist()\n if (to < from || to < 0) {\n return ret\n }\n if (from < 0) {\n from = 0\n }\n if (to > this.length) {\n to = this.length\n }\n for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n walker = walker.next\n }\n for (; walker !== null && i < to; i++, walker = walker.next) {\n ret.push(walker.value)\n }\n return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n to = to || this.length\n if (to < 0) {\n to += this.length\n }\n from = from || 0\n if (from < 0) {\n from += this.length\n }\n var ret = new Yallist()\n if (to < from || to < 0) {\n return ret\n }\n if (from < 0) {\n from = 0\n }\n if (to > this.length) {\n to = this.length\n }\n for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n walker = walker.prev\n }\n for (; walker !== null && i > from; i--, walker = walker.prev) {\n ret.push(walker.value)\n }\n return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n if (start > this.length) {\n start = this.length - 1\n }\n if (start < 0) {\n start = this.length + start;\n }\n\n for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n walker = walker.next\n }\n\n var ret = []\n for (var i = 0; walker && i < deleteCount; i++) {\n ret.push(walker.value)\n walker = this.removeNode(walker)\n }\n if (walker === null) {\n walker = this.tail\n }\n\n if (walker !== this.head && walker !== this.tail) {\n walker = walker.prev\n }\n\n for (var i = 0; i < nodes.length; i++) {\n walker = insert(this, walker, nodes[i])\n }\n return ret;\n}\n\nYallist.prototype.reverse = function () {\n var head = this.head\n var tail = this.tail\n for (var walker = head; walker !== null; walker = walker.prev) {\n var p = walker.prev\n walker.prev = walker.next\n walker.next = p\n }\n this.head = tail\n this.tail = head\n return this\n}\n\nfunction insert (self, node, value) {\n var inserted = node === self.head ?\n new Node(value, null, node, self) :\n new Node(value, node, node.next, self)\n\n if (inserted.next === null) {\n self.tail = inserted\n }\n if (inserted.prev === null) {\n self.head = inserted\n }\n\n self.length++\n\n return inserted\n}\n\nfunction push (self, item) {\n self.tail = new Node(item, self.tail, null, self)\n if (!self.head) {\n self.head = self.tail\n }\n self.length++\n}\n\nfunction unshift (self, item) {\n self.head = new Node(item, null, self.head, self)\n if (!self.tail) {\n self.tail = self.head\n }\n self.length++\n}\n\nfunction Node (value, prev, next, list) {\n if (!(this instanceof Node)) {\n return new Node(value, prev, next, list)\n }\n\n this.list = list\n this.value = value\n\n if (prev) {\n prev.next = this\n this.prev = prev\n } else {\n this.prev = null\n }\n\n if (next) {\n next.prev = this\n this.next = next\n } else {\n this.next = null\n }\n}\n\ntry {\n // add if support for Symbol.iterator is present\n require('./iterator.js')(Yallist)\n} catch (er) {}\n", "'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", "// hoisted class for cyclic dependency\nclass Range {\n constructor (range, options) {\n options = parseOptions(options)\n\n if (range instanceof Range) {\n if (\n range.loose === !!options.loose &&\n range.includePrerelease === !!options.includePrerelease\n ) {\n return range\n } else {\n return new Range(range.raw, options)\n }\n }\n\n if (range instanceof Comparator) {\n // just put it in the set and return\n this.raw = range.value\n this.set = [[range]]\n this.format()\n return this\n }\n\n this.options = options\n this.loose = !!options.loose\n this.includePrerelease = !!options.includePrerelease\n\n // First reduce all whitespace as much as possible so we do not have to rely\n // on potentially slow regexes like \\s*. This is then stored and used for\n // future error messages as well.\n this.raw = range\n .trim()\n .split(/\\s+/)\n .join(' ')\n\n // First, split on ||\n this.set = this.raw\n .split('||')\n // map the range to a 2d array of comparators\n .map(r => this.parseRange(r.trim()))\n // throw out any comparator lists that are empty\n // this generally means that it was not a valid range, which is allowed\n // in loose mode, but will still throw if the WHOLE range is invalid.\n .filter(c => c.length)\n\n if (!this.set.length) {\n throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n }\n\n // if we have any that are not the null set, throw out null sets.\n if (this.set.length > 1) {\n // keep the first one, in case they're all null sets\n const first = this.set[0]\n this.set = this.set.filter(c => !isNullSet(c[0]))\n if (this.set.length === 0) {\n this.set = [first]\n } else if (this.set.length > 1) {\n // if we have any that are *, then the range is just *\n for (const c of this.set) {\n if (c.length === 1 && isAny(c[0])) {\n this.set = [c]\n break\n }\n }\n }\n }\n\n this.format()\n }\n\n format () {\n this.range = this.set\n .map((comps) => comps.join(' ').trim())\n .join('||')\n .trim()\n return this.range\n }\n\n toString () {\n return this.range\n }\n\n parseRange (range) {\n // memoize range parsing for performance.\n // this is a very hot path, and fully deterministic.\n const memoOpts =\n (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n (this.options.loose && FLAG_LOOSE)\n const memoKey = memoOpts + ':' + range\n const cached = cache.get(memoKey)\n if (cached) {\n return cached\n }\n\n const loose = this.options.loose\n // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n debug('hyphen replace', range)\n\n // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n debug('comparator trim', range)\n\n // `~ 1.2.3` => `~1.2.3`\n range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n debug('tilde trim', range)\n\n // `^ 1.2.3` => `^1.2.3`\n range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n debug('caret trim', range)\n\n // At this point, the range is completely trimmed and\n // ready to be split into comparators.\n\n let rangeList = range\n .split(' ')\n .map(comp => parseComparator(comp, this.options))\n .join(' ')\n .split(/\\s+/)\n // >=0.0.0 is equivalent to *\n .map(comp => replaceGTE0(comp, this.options))\n\n if (loose) {\n // in loose mode, throw out any that are not valid comparators\n rangeList = rangeList.filter(comp => {\n debug('loose invalid filter', comp, this.options)\n return !!comp.match(re[t.COMPARATORLOOSE])\n })\n }\n debug('range list', rangeList)\n\n // if any comparators are the null set, then replace with JUST null set\n // if more than one comparator, remove any * comparators\n // also, don't include the same comparator more than once\n const rangeMap = new Map()\n const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n for (const comp of comparators) {\n if (isNullSet(comp)) {\n return [comp]\n }\n rangeMap.set(comp.value, comp)\n }\n if (rangeMap.size > 1 && rangeMap.has('')) {\n rangeMap.delete('')\n }\n\n const result = [...rangeMap.values()]\n cache.set(memoKey, result)\n return result\n }\n\n intersects (range, options) {\n if (!(range instanceof Range)) {\n throw new TypeError('a Range is required')\n }\n\n return this.set.some((thisComparators) => {\n return (\n isSatisfiable(thisComparators, options) &&\n range.set.some((rangeComparators) => {\n return (\n isSatisfiable(rangeComparators, options) &&\n thisComparators.every((thisComparator) => {\n return rangeComparators.every((rangeComparator) => {\n return thisComparator.intersects(rangeComparator, options)\n })\n })\n )\n })\n )\n })\n }\n\n // if ANY of the sets match ALL of its comparators, then pass\n test (version) {\n if (!version) {\n return false\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n for (let i = 0; i < this.set.length; i++) {\n if (testSet(this.set[i], version, this.options)) {\n return true\n }\n }\n return false\n }\n}\n\nmodule.exports = Range\n\nconst LRU = require('lru-cache')\nconst cache = new LRU({ max: 1000 })\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n safeRe: re,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n let result = true\n const remainingComparators = comparators.slice()\n let testComparator = remainingComparators.pop()\n\n while (result && remainingComparators.length) {\n result = remainingComparators.every((otherComparator) => {\n return testComparator.intersects(otherComparator, options)\n })\n\n testComparator = remainingComparators.pop()\n }\n\n return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n debug('comp', comp, options)\n comp = replaceCarets(comp, options)\n debug('caret', comp)\n comp = replaceTildes(comp, options)\n debug('tildes', comp)\n comp = replaceXRanges(comp, options)\n debug('xrange', comp)\n comp = replaceStars(comp, options)\n debug('stars', comp)\n return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceTilde(c, options))\n .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('tilde', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0 <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n // ~1.2 == >=1.2.0 <1.3.0-0\n ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`\n } else if (pr) {\n debug('replaceTilde pr', pr)\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n } else {\n // ~1.2.3 == >=1.2.3 <1.3.0-0\n ret = `>=${M}.${m}.${p\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('tilde return', ret)\n return ret\n })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceCaret(c, options))\n .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n debug('caret', comp, options)\n const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n const z = options.includePrerelease ? '-0' : ''\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('caret', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n if (M === '0') {\n ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n } else {\n ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n }\n } else if (pr) {\n debug('replaceCaret pr', pr)\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${+M + 1}.0.0-0`\n }\n } else {\n debug('no pr')\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p\n }${z} <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p\n } <${+M + 1}.0.0-0`\n }\n }\n\n debug('caret return', ret)\n return ret\n })\n}\n\nconst replaceXRanges = (comp, options) => {\n debug('replaceXRanges', comp, options)\n return comp\n .split(/\\s+/)\n .map((c) => replaceXRange(c, options))\n .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n comp = comp.trim()\n const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n debug('xRange', comp, ret, gtlt, M, m, p, pr)\n const xM = isX(M)\n const xm = xM || isX(m)\n const xp = xm || isX(p)\n const anyX = xp\n\n if (gtlt === '=' && anyX) {\n gtlt = ''\n }\n\n // if we're including prereleases in the match, then we need\n // to fix this to -0, the lowest possible prerelease value\n pr = options.includePrerelease ? '-0' : ''\n\n if (xM) {\n if (gtlt === '>' || gtlt === '<') {\n // nothing is allowed\n ret = '<0.0.0-0'\n } else {\n // nothing is forbidden\n ret = '*'\n }\n } else if (gtlt && anyX) {\n // we know patch is an x, because we have any x at all.\n // replace X with 0\n if (xm) {\n m = 0\n }\n p = 0\n\n if (gtlt === '>') {\n // >1 => >=2.0.0\n // >1.2 => >=1.3.0\n gtlt = '>='\n if (xm) {\n M = +M + 1\n m = 0\n p = 0\n } else {\n m = +m + 1\n p = 0\n }\n } else if (gtlt === '<=') {\n // <=0.7.x is actually <0.8.0, since any 0.7.x should\n // pass. Similarly, <=7.x is actually <8.0.0, etc.\n gtlt = '<'\n if (xm) {\n M = +M + 1\n } else {\n m = +m + 1\n }\n }\n\n if (gtlt === '<') {\n pr = '-0'\n }\n\n ret = `${gtlt + M}.${m}.${p}${pr}`\n } else if (xm) {\n ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n } else if (xp) {\n ret = `>=${M}.${m}.0${pr\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('xRange return', ret)\n\n return ret\n })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n debug('replaceStars', comp, options)\n // Looseness is ignored here. star is always as loose as it gets!\n return comp\n .trim()\n .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n debug('replaceGTE0', comp, options)\n return comp\n .trim()\n .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\nconst hyphenReplace = incPr => ($0,\n from, fM, fm, fp, fpr, fb,\n to, tM, tm, tp, tpr, tb) => {\n if (isX(fM)) {\n from = ''\n } else if (isX(fm)) {\n from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n } else if (isX(fp)) {\n from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n } else if (fpr) {\n from = `>=${from}`\n } else {\n from = `>=${from}${incPr ? '-0' : ''}`\n }\n\n if (isX(tM)) {\n to = ''\n } else if (isX(tm)) {\n to = `<${+tM + 1}.0.0-0`\n } else if (isX(tp)) {\n to = `<${tM}.${+tm + 1}.0-0`\n } else if (tpr) {\n to = `<=${tM}.${tm}.${tp}-${tpr}`\n } else if (incPr) {\n to = `<${tM}.${tm}.${+tp + 1}-0`\n } else {\n to = `<=${to}`\n }\n\n return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n for (let i = 0; i < set.length; i++) {\n if (!set[i].test(version)) {\n return false\n }\n }\n\n if (version.prerelease.length && !options.includePrerelease) {\n // Find the set of versions that are allowed to have prereleases\n // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n // That should allow `1.2.3-pr.2` to pass.\n // However, `1.2.4-alpha.notready` should NOT be allowed,\n // even though it's within the range set by the comparators.\n for (let i = 0; i < set.length; i++) {\n debug(set[i].semver)\n if (set[i].semver === Comparator.ANY) {\n continue\n }\n\n if (set[i].semver.prerelease.length > 0) {\n const allowed = set[i].semver\n if (allowed.major === version.major &&\n allowed.minor === version.minor &&\n allowed.patch === version.patch) {\n return true\n }\n }\n }\n\n // Version has a -pre, but it's not one of the ones we like.\n return false\n }\n\n return true\n}\n", "const ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n static get ANY () {\n return ANY\n }\n\n constructor (comp, options) {\n options = parseOptions(options)\n\n if (comp instanceof Comparator) {\n if (comp.loose === !!options.loose) {\n return comp\n } else {\n comp = comp.value\n }\n }\n\n comp = comp.trim().split(/\\s+/).join(' ')\n debug('comparator', comp, options)\n this.options = options\n this.loose = !!options.loose\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 debug('comp', this)\n }\n\n parse (comp) {\n const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n const m = comp.match(r)\n\n if (!m) {\n throw new TypeError(`Invalid comparator: ${comp}`)\n }\n\n this.operator = m[1] !== undefined ? m[1] : ''\n if (this.operator === '=') {\n this.operator = ''\n }\n\n // if it literally is just '>' or '' then allow anything.\n if (!m[2]) {\n this.semver = ANY\n } else {\n this.semver = new SemVer(m[2], this.options.loose)\n }\n }\n\n toString () {\n return this.value\n }\n\n test (version) {\n debug('Comparator.test', version, this.options.loose)\n\n if (this.semver === ANY || version === ANY) {\n return true\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n return cmp(version, this.operator, this.semver, this.options)\n }\n\n intersects (comp, options) {\n if (!(comp instanceof Comparator)) {\n throw new TypeError('a Comparator is required')\n }\n\n if (this.operator === '') {\n if (this.value === '') {\n return true\n }\n return new Range(comp.value, options).test(this.value)\n } else if (comp.operator === '') {\n if (comp.value === '') {\n return true\n }\n return new Range(this.value, options).test(comp.semver)\n }\n\n options = parseOptions(options)\n\n // Special cases where nothing can possibly be lower\n if (options.includePrerelease &&\n (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n return false\n }\n if (!options.includePrerelease &&\n (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n return false\n }\n\n // Same direction increasing (> or >=)\n if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n return true\n }\n // Same direction decreasing (< or <=)\n if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n return true\n }\n // same SemVer and both sides are inclusive (<= or >=)\n if (\n (this.semver.version === comp.semver.version) &&\n this.operator.includes('=') && comp.operator.includes('=')) {\n return true\n }\n // opposite directions less than\n if (cmp(this.semver, '<', comp.semver, options) &&\n this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n return true\n }\n // opposite directions greater than\n if (cmp(this.semver, '>', comp.semver, options) &&\n this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n return true\n }\n return false\n }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n", "const Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n try {\n range = new Range(range, options)\n } catch (er) {\n return false\n }\n return range.test(version)\n}\nmodule.exports = satisfies\n", "const 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", "const 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", "const 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", "const 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", "const 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", "const 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", "// 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", "const 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", "const 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", "// 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", "const 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", "// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n parse,\n valid,\n clean,\n inc,\n diff,\n major,\n minor,\n patch,\n prerelease,\n compare,\n rcompare,\n compareLoose,\n compareBuild,\n sort,\n rsort,\n gt,\n lt,\n eq,\n neq,\n gte,\n lte,\n cmp,\n coerce,\n Comparator,\n Range,\n satisfies,\n toComparators,\n maxSatisfying,\n minSatisfying,\n minVersion,\n validRange,\n outside,\n gtr,\n ltr,\n intersects,\n simplifyRange,\n subset,\n SemVer,\n re: internalRe.re,\n src: internalRe.src,\n tokens: internalRe.t,\n SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n RELEASE_TYPES: constants.RELEASE_TYPES,\n compareIdentifiers: identifiers.compareIdentifiers,\n rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n", "var e,t,n=\"object\"==typeof Reflect?Reflect:null,r=n&&\"function\"==typeof n.apply?n.apply:function(e,t,n){return Function.prototype.apply.call(e,t,n)};t=n&&\"function\"==typeof n.ownKeys?n.ownKeys:Object.getOwnPropertySymbols?function(e){return Object.getOwnPropertyNames(e).concat(Object.getOwnPropertySymbols(e))}:function(e){return Object.getOwnPropertyNames(e)};var i=Number.isNaN||function(e){return e!=e};function o(){o.init.call(this);}e=o,o.EventEmitter=o,o.prototype._events=void 0,o.prototype._eventsCount=0,o.prototype._maxListeners=void 0;var s=10;function u(e){if(\"function\"!=typeof e)throw new TypeError('The \"listener\" argument must be of type Function. Received type '+typeof e)}function f(e){return void 0===e._maxListeners?o.defaultMaxListeners:e._maxListeners}function v(e,t,n,r){var i,o,s,v;if(u(n),void 0===(o=e._events)?(o=e._events=Object.create(null),e._eventsCount=0):(void 0!==o.newListener&&(e.emit(\"newListener\",t,n.listener?n.listener:n),o=e._events),s=o[t]),void 0===s)s=o[t]=n,++e._eventsCount;else if(\"function\"==typeof s?s=o[t]=r?[n,s]:[s,n]:r?s.unshift(n):s.push(n),(i=f(e))>0&&s.length>i&&!s.warned){s.warned=!0;var a=new Error(\"Possible EventEmitter memory leak detected. \"+s.length+\" \"+String(t)+\" listeners added. Use emitter.setMaxListeners() to increase limit\");a.name=\"MaxListenersExceededWarning\",a.emitter=e,a.type=t,a.count=s.length,v=a,console&&console.warn&&console.warn(v);}return e}function a(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function l(e,t,n){var r={fired:!1,wrapFn:void 0,target:e,type:t,listener:n},i=a.bind(r);return i.listener=n,r.wrapFn=i,i}function h(e,t,n){var r=e._events;if(void 0===r)return [];var i=r[t];return void 0===i?[]:\"function\"==typeof i?n?[i.listener||i]:[i]:n?function(e){for(var t=new Array(e.length),n=0;n<t.length;++n)t[n]=e[n].listener||e[n];return t}(i):c(i,i.length)}function p(e){var t=this._events;if(void 0!==t){var n=t[e];if(\"function\"==typeof n)return 1;if(void 0!==n)return n.length}return 0}function c(e,t){for(var n=new Array(t),r=0;r<t;++r)n[r]=e[r];return n}Object.defineProperty(o,\"defaultMaxListeners\",{enumerable:!0,get:function(){return s},set:function(e){if(\"number\"!=typeof e||e<0||i(e))throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received '+e+\".\");s=e;}}),o.init=function(){void 0!==this._events&&this._events!==Object.getPrototypeOf(this)._events||(this._events=Object.create(null),this._eventsCount=0),this._maxListeners=this._maxListeners||void 0;},o.prototype.setMaxListeners=function(e){if(\"number\"!=typeof e||e<0||i(e))throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received '+e+\".\");return this._maxListeners=e,this},o.prototype.getMaxListeners=function(){return f(this)},o.prototype.emit=function(e){for(var t=[],n=1;n<arguments.length;n++)t.push(arguments[n]);var i=\"error\"===e,o=this._events;if(void 0!==o)i=i&&void 0===o.error;else if(!i)return !1;if(i){var s;if(t.length>0&&(s=t[0]),s instanceof Error)throw s;var u=new Error(\"Unhandled error.\"+(s?\" (\"+s.message+\")\":\"\"));throw u.context=s,u}var f=o[e];if(void 0===f)return !1;if(\"function\"==typeof f)r(f,this,t);else {var v=f.length,a=c(f,v);for(n=0;n<v;++n)r(a[n],this,t);}return !0},o.prototype.addListener=function(e,t){return v(this,e,t,!1)},o.prototype.on=o.prototype.addListener,o.prototype.prependListener=function(e,t){return v(this,e,t,!0)},o.prototype.once=function(e,t){return u(t),this.on(e,l(this,e,t)),this},o.prototype.prependOnceListener=function(e,t){return u(t),this.prependListener(e,l(this,e,t)),this},o.prototype.removeListener=function(e,t){var n,r,i,o,s;if(u(t),void 0===(r=this._events))return this;if(void 0===(n=r[e]))return this;if(n===t||n.listener===t)0==--this._eventsCount?this._events=Object.create(null):(delete r[e],r.removeListener&&this.emit(\"removeListener\",e,n.listener||t));else if(\"function\"!=typeof n){for(i=-1,o=n.length-1;o>=0;o--)if(n[o]===t||n[o].listener===t){s=n[o].listener,i=o;break}if(i<0)return this;0===i?n.shift():!function(e,t){for(;t+1<e.length;t++)e[t]=e[t+1];e.pop();}(n,i),1===n.length&&(r[e]=n[0]),void 0!==r.removeListener&&this.emit(\"removeListener\",e,s||t);}return this},o.prototype.off=o.prototype.removeListener,o.prototype.removeAllListeners=function(e){var t,n,r;if(void 0===(n=this._events))return this;if(void 0===n.removeListener)return 0===arguments.length?(this._events=Object.create(null),this._eventsCount=0):void 0!==n[e]&&(0==--this._eventsCount?this._events=Object.create(null):delete n[e]),this;if(0===arguments.length){var i,o=Object.keys(n);for(r=0;r<o.length;++r)\"removeListener\"!==(i=o[r])&&this.removeAllListeners(i);return this.removeAllListeners(\"removeListener\"),this._events=Object.create(null),this._eventsCount=0,this}if(\"function\"==typeof(t=n[e]))this.removeListener(e,t);else if(void 0!==t)for(r=t.length-1;r>=0;r--)this.removeListener(e,t[r]);return this},o.prototype.listeners=function(e){return h(this,e,!0)},o.prototype.rawListeners=function(e){return h(this,e,!1)},o.listenerCount=function(e,t){return \"function\"==typeof e.listenerCount?e.listenerCount(t):p.call(e,t)},o.prototype.listenerCount=p,o.prototype.eventNames=function(){return this._eventsCount>0?t(this._events):[]};var y=e;y.EventEmitter;y.defaultMaxListeners;y.init;y.listenerCount;\n\ny.EventEmitter;\ny.defaultMaxListeners;\ny.init;\ny.listenerCount;\n\nexport { y };\n", "import { y } from './chunk-4bd36a8f.js';\nexport { y as default } from './chunk-4bd36a8f.js';\n\n// https://github.com/denoland/deno_std/blob/d005433c709054af87aca54f57a446b4f7966f11/node/events.ts#L501-L638\r\ny.once = function (emitter, event) {\r\n return new Promise((resolve, reject) => {\r\n function eventListener(...args) {\r\n if (errorListener !== undefined) {\r\n emitter.removeListener('error', errorListener);\r\n }\r\n resolve(args);\r\n }\r\n let errorListener;\r\n if (event !== 'error') {\r\n // deno-lint-ignore no-explicit-any\r\n errorListener = (err) => {\r\n emitter.removeListener(name, eventListener);\r\n reject(err);\r\n };\r\n\r\n emitter.once('error', errorListener);\r\n }\r\n\r\n emitter.once(event, eventListener);\r\n });\r\n};\r\ny.on = function (emitter, event) {\r\n const unconsumedEventValues = [];\r\n const unconsumedPromises = [];\r\n let error = null;\r\n let finished = false;\r\n\r\n const iterator = {\r\n async next() {\r\n const value = unconsumedEventValues.shift();\r\n if (value) {\r\n return createIterResult(value, false);\r\n }\r\n\r\n if (error) {\r\n const p = Promise.reject(error);\r\n error = null;\r\n return p;\r\n }\r\n\r\n if (finished) {\r\n return createIterResult(undefined, true);\r\n }\r\n\r\n return new Promise((resolve, reject) => unconsumedPromises.push({ resolve, reject }));\r\n },\r\n async return() {\r\n emitter.removeListener(event, eventHandler);\r\n emitter.removeListener('error', errorHandler);\r\n finished = true;\r\n\r\n for (const promise of unconsumedPromises) {\r\n promise.resolve(createIterResult(undefined, true));\r\n }\r\n\r\n return createIterResult(undefined, true);\r\n },\r\n throw(err) {\r\n error = err;\r\n emitter.removeListener(event, eventHandler);\r\n emitter.removeListener('error', errorHandler);\r\n },\r\n [Symbol.asyncIterator]() {\r\n return this;\r\n },\r\n };\r\n\r\n emitter.on(event, eventHandler);\r\n emitter.on('error', errorHandler);\r\n\r\n return iterator;\r\n\r\n function eventHandler(...args) {\r\n const promise = unconsumedPromises.shift();\r\n if (promise) {\r\n promise.resolve(createIterResult(args, false));\r\n } else {\r\n unconsumedEventValues.push(args);\r\n }\r\n }\r\n\r\n function errorHandler(err) {\r\n finished = true;\r\n const toError = unconsumedPromises.shift();\r\n if (toError) {\r\n toError.reject(err);\r\n } else {\r\n error = err;\r\n }\r\n iterator.return();\r\n }\r\n};\r\nconst {\r\n EventEmitter,\r\n defaultMaxListeners,\r\n init,\r\n listenerCount,\r\n on,\r\n once,\r\n} = y;\n\nexport { EventEmitter, defaultMaxListeners, init, listenerCount, on, once };\n", "import EventEmitter from \"events\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport {\n TransportPendingOperation,\n TransportError,\n StatusCodes,\n getAltStatusMessage,\n TransportStatusError,\n} from \"@ledgerhq/errors\";\nimport { LocalTracer, TraceContext, LogType } from \"@ledgerhq/logs\";\nexport { TransportError, TransportStatusError, StatusCodes, getAltStatusMessage };\n\nconst DEFAULT_LOG_TYPE = \"transport\";\n\n/**\n */\nexport type Subscription = {\n unsubscribe: () => void;\n};\n\n/**\n */\nexport type Device = any; // Should be a union type of all possible Device object's shape\n\nexport type DescriptorEventType = \"add\" | \"remove\";\n/**\n * A \"descriptor\" is a parameter that is specific to the implementation, and can be an ID, file path, or URL.\n * type: add or remove event\n * descriptor: a parameter that can be passed to open(descriptor)\n * deviceModel: device info on the model (is it a nano s, nano x, ...)\n * device: transport specific device info\n */\nexport interface DescriptorEvent<Descriptor> {\n type: DescriptorEventType;\n descriptor: Descriptor;\n deviceModel?: DeviceModel | null | undefined;\n device?: Device;\n}\n\n/**\n * Observer generic type, following the Observer pattern\n */\nexport type Observer<EventType, EventError = unknown> = Readonly<{\n next: (event: EventType) => unknown;\n error: (e: EventError) => unknown;\n complete: () => unknown;\n}>;\n\n/**\n * The Transport class defines a generic interface for communicating with a Ledger hardware wallet.\n * There are different kind of transports based on the technology (channels like U2F, HID, Bluetooth, Webusb) and environment (Node, Web,...).\n * It is an abstract class that needs to be implemented.\n */\nexport default class Transport {\n exchangeTimeout = 30000;\n unresponsiveTimeout = 15000;\n deviceModel: DeviceModel | null | undefined = null;\n tracer: LocalTracer;\n\n constructor({ context, logType }: { context?: TraceContext; logType?: LogType } = {}) {\n this.tracer = new LocalTracer(logType ?? DEFAULT_LOG_TYPE, context);\n }\n\n /**\n * Check if the transport is supported on the current platform/browser.\n * @returns {Promise<boolean>} A promise that resolves with a boolean indicating support.\n */\n static readonly isSupported: () => Promise<boolean>;\n\n /**\n * List all available descriptors for the transport.\n * For a better granularity, checkout `listen()`.\n *\n * @returns {Promise<Array<any>>} A promise that resolves with an array of descriptors.\n * @example\n * TransportFoo.list().then(descriptors => ...)\n */\n static readonly list: () => Promise<Array<any>>;\n\n /**\n * Listen for device events for the transport. The method takes an observer of DescriptorEvent and returns a Subscription.\n * A DescriptorEvent is an object containing a \"descriptor\" and a \"type\" field. The \"type\" field can be \"add\" or \"remove\", and the \"descriptor\" field can be passed to the \"open\" method.\n * The \"listen\" method will first emit all currently connected devices and then will emit events as they occur, such as when a USB device is plugged in or a Bluetooth device becomes discoverable.\n * @param {Observer<DescriptorEvent<any>>} observer - An object with \"next\", \"error\", and \"complete\" functions, following the observer pattern.\n * @returns {Subscription} A Subscription object on which you can call \".unsubscribe()\" to stop listening to descriptors.\n * @example\n const sub = TransportFoo.listen({\n next: e => {\n if (e.type===\"add\") {\n sub.unsubscribe();\n const transport = await TransportFoo.open(e.descriptor);\n ...\n }\n },\n error: error => {},\n complete: () => {}\n })\n */\n static readonly listen: (observer: Observer<DescriptorEvent<any>>) => Subscription;\n\n /**\n * Attempt to create a Transport instance with a specific descriptor.\n * @param {any} descriptor - The descriptor to open the transport with.\n * @param {number} timeout - An optional timeout for the transport connection.\n * @param {TraceContext} context Optional tracing/log context\n * @returns {Promise<Transport>} A promise that resolves with a Transport instance.\n * @example\n TransportFoo.open(descriptor).then(transport => ...)\n */\n static readonly open: (\n descriptor?: any,\n timeoutMs?: number,\n context?: TraceContext,\n ) => Promise<Transport>;\n\n /**\n * Send data to the device using a low level API.\n * It's recommended to use the \"send\" method for a higher level API.\n * @param {Buffer} apdu - The data to send.\n * @param {Object} options - Contains optional options for the exchange function\n * - abortTimeoutMs: stop the exchange after a given timeout. Another timeout exists\n * to detect unresponsive device (see `unresponsiveTimeout`). This timeout aborts the exchange.\n * @returns {Promise<Buffer>} A promise that resolves with the response data from the device.\n */\n exchange(\n _apdu: Buffer,\n { abortTimeoutMs: _abortTimeoutMs }: { abortTimeoutMs?: number } = {},\n ): Promise<Buffer> {\n throw new Error(\"exchange not implemented\");\n }\n\n /**\n * Send apdus in batch to the device using a low level API.\n * The default implementation is to call exchange for each apdu.\n * @param {Array<Buffer>} apdus - array of apdus to send.\n * @param {Observer<Buffer>} observer - an observer that will receive the response of each apdu.\n * @returns {Subscription} A Subscription object on which you can call \".unsubscribe()\" to stop sending apdus.\n */\n exchangeBulk(apdus: Buffer[], observer: Observer<Buffer>): Subscription {\n let unsubscribed = false;\n const unsubscribe = () => {\n unsubscribed = true;\n };\n\n const main = async () => {\n if (unsubscribed) return;\n for (const apdu of apdus) {\n const r = await this.exchange(apdu);\n if (unsubscribed) return;\n const status = r.readUInt16BE(r.length - 2);\n if (status !== StatusCodes.OK) {\n throw new TransportStatusError(status);\n }\n observer.next(r);\n }\n };\n\n main().then(\n () => !unsubscribed && observer.complete(),\n e => !unsubscribed && observer.error(e),\n );\n\n return { unsubscribe };\n }\n\n /**\n * Set the \"scramble key\" for the next data exchanges with the device.\n * Each app can have a different scramble key and it is set internally during instantiation.\n * @param {string} key - The scramble key to set.\n * deprecated This method is no longer needed for modern transports and should be migrated away from.\n * no @ before deprecated as it breaks documentationjs on version 14.0.2\n * https://github.com/documentationjs/documentation/issues/1596\n */\n setScrambleKey(_key: string) {}\n\n /**\n * Close the connection with the device.\n *\n * Note: for certain transports (hw-transport-node-hid-singleton for ex), once the promise resolved,\n * the transport instance is actually still cached, and the device is disconnected only after a defined timeout.\n * But for the consumer of the Transport, this does not matter and it can consider the transport to be closed.\n *\n * @returns {Promise<void>} A promise that resolves when the transport is closed.\n */\n close(): Promise<void> {\n return Promise.resolve();\n }\n\n _events = new EventEmitter();\n\n /**\n * Listen for an event on the transport instance.\n * Transport implementations may have specific events. Common events include:\n * \"disconnect\" : triggered when the transport is disconnected.\n * @param {string} eventName - The name of the event to listen for.\n * @param {(...args: Array<any>) => any} cb - The callback function to be invoked when the event occurs.\n */\n on(eventName: string, cb: (...args: Array<any>) => any): void {\n this._events.on(eventName, cb);\n }\n\n /**\n * Stop listening to an event on an instance of transport.\n */\n off(eventName: string, cb: (...args: Array<any>) => any): void {\n this._events.removeListener(eventName, cb);\n }\n\n emit(event: string, ...args: any): void {\n this._events.emit(event, ...args);\n }\n\n /**\n * Enable or not logs of the binary exchange\n */\n setDebugMode() {\n console.warn(\n \"setDebugMode is deprecated. use @ledgerhq/logs instead. No logs are emitted in this anymore.\",\n );\n }\n\n /**\n * Set a timeout (in milliseconds) for the exchange call. Only some transport might implement it. (e.g. U2F)\n */\n setExchangeTimeout(exchangeTimeout: number): void {\n this.exchangeTimeout = exchangeTimeout;\n }\n\n /**\n * Define the delay before emitting \"unresponsive\" on an exchange that does not respond\n */\n setExchangeUnresponsiveTimeout(unresponsiveTimeout: number): void {\n this.unresponsiveTimeout = unresponsiveTimeout;\n }\n\n /**\n * Send data to the device using the higher level API.\n *\n * @param {number} cla - The instruction class for the command.\n * @param {number} ins - The instruction code for the command.\n * @param {number} p1 - The first parameter for the instruction.\n * @param {number} p2 - The second parameter for the instruction.\n * @param {Buffer} data - The data to be sent. Defaults to an empty buffer.\n * @param {Array<number>} statusList - A list of acceptable status codes for the response. Defaults to [StatusCodes.OK].\n * @param {Object} options - Contains optional options for the exchange function\n * - abortTimeoutMs: stop the send after a given timeout. Another timeout exists\n * to detect unresponsive device (see `unresponsiveTimeout`). This timeout aborts the exchange.\n * @returns {Promise<Buffer>} A promise that resolves with the response data from the device.\n */\n send = async (\n cla: number,\n ins: number,\n p1: number,\n p2: number,\n data: Buffer = Buffer.alloc(0),\n statusList: Array<number> = [StatusCodes.OK],\n { abortTimeoutMs }: { abortTimeoutMs?: number } = {},\n ): Promise<Buffer> => {\n const tracer = this.tracer.withUpdatedContext({ function: \"send\" });\n\n if (data.length >= 256) {\n tracer.trace(\"data.length exceeded 256 bytes limit\", { dataLength: data.length });\n throw new TransportError(\n \"data.length exceed 256 bytes limit. Got: \" + data.length,\n \"DataLengthTooBig\",\n );\n }\n\n tracer.trace(\"Starting an exchange\", { abortTimeoutMs });\n const response = await this.exchange(\n // The size of the data is added in 1 byte just before `data`\n Buffer.concat([Buffer.from([cla, ins, p1, p2]), Buffer.from([data.length]), data]),\n { abortTimeoutMs },\n );\n tracer.trace(\"Received response from exchange\");\n const sw = response.readUInt16BE(response.length - 2);\n\n if (!statusList.some(s => s === sw)) {\n throw new TransportStatusError(sw);\n }\n\n return response;\n };\n\n /**\n * create() allows to open the first descriptor available or\n * throw if there is none or if timeout is reached.\n * This is a light helper, alternative to using listen() and open() (that you may need for any more advanced usecase)\n * @example\n TransportFoo.create().then(transport => ...)\n */\n static create(openTimeout = 3000, listenTimeout?: number): Promise<Transport> {\n return new Promise((resolve, reject) => {\n let found = false;\n const sub = this.listen({\n next: e => {\n found = true;\n if (sub) sub.unsubscribe();\n if (listenTimeoutId) clearTimeout(listenTimeoutId);\n this.open(e.descriptor, openTimeout).then(resolve, reject);\n },\n error: e => {\n if (listenTimeoutId) clearTimeout(listenTimeoutId);\n reject(e);\n },\n complete: () => {\n if (listenTimeoutId) clearTimeout(listenTimeoutId);\n\n if (!found) {\n reject(new TransportError(this.ErrorMessage_NoDeviceFound, \"NoDeviceFound\"));\n }\n },\n });\n const listenTimeoutId = listenTimeout\n ? setTimeout(() => {\n sub.unsubscribe();\n reject(new TransportError(this.ErrorMessage_ListenTimeout, \"ListenTimeout\"));\n }, listenTimeout)\n : null;\n });\n }\n\n // Blocks other exchange to happen concurrently\n exchangeBusyPromise: Promise<void> | null | undefined;\n\n /**\n * Wrapper to make an exchange \"atomic\" (blocking any other exchange)\n *\n * It also handles \"unresponsiveness\" by emitting \"unresponsive\" and \"responsive\" events.\n *\n * @param f The exchange job, using the transport to run\n * @returns a Promise resolving with the output of the given job\n */\n async exchangeAtomicImpl<Output>(f: () => Promise<Output>): Promise<Output> {\n const tracer = this.tracer.withUpdatedContext({\n function: \"exchangeAtomicImpl\",\n unresponsiveTimeout: this.unresponsiveTimeout,\n });\n\n if (this.exchangeBusyPromise) {\n tracer.trace(\"Atomic exchange is already busy\");\n throw new TransportPendingOperation(\n \"An action was already pending on the Ledger device. Please deny or reconnect.\",\n );\n }\n\n // Sets the atomic guard\n let resolveBusy;\n const busyPromise: Promise<void> = new Promise(r => {\n resolveBusy = r;\n });\n this.exchangeBusyPromise = busyPromise;\n\n // The device unresponsiveness handler\n let unresponsiveReached = false;\n const timeout = setTimeout(() => {\n tracer.trace(`Timeout reached, emitting Transport event \"unresponsive\"`, {\n unresponsiveTimeout: this.unresponsiveTimeout,\n });\n unresponsiveReached = true;\n this.emit(\"unresponsive\");\n }, this.unresponsiveTimeout);\n\n try {\n const res = await f();\n\n if (unresponsiveReached) {\n tracer.trace(\"Device was unresponsive, emitting responsive\");\n this.emit(\"responsive\");\n }\n\n return res;\n } finally {\n tracer.trace(\"Finalize, clearing busy guard\");\n\n clearTimeout(timeout);\n if (resolveBusy) resolveBusy();\n this.exchangeBusyPromise = null;\n }\n }\n\n decorateAppAPIMethods(self: Record<string, any>, methods: Array<string>, scrambleKey: string) {\n for (const methodName of methods) {\n self[methodName] = this.decorateAppAPIMethod(methodName, self[methodName], self, scrambleKey);\n }\n }\n\n _appAPIlock: string | null = null;\n\n decorateAppAPIMethod<R, A extends any[]>(\n methodName: string,\n f: (...args: A) => Promise<R>,\n ctx: any,\n scrambleKey: string,\n ): (...args: A) => Promise<R> {\n return async (...args) => {\n const { _appAPIlock } = this;\n\n if (_appAPIlock) {\n return Promise.reject(\n new TransportError(\"Ledger Device is busy (lock \" + _appAPIlock + \")\", \"TransportLocked\"),\n );\n }\n\n try {\n this._appAPIlock = methodName;\n this.setScrambleKey(scrambleKey);\n return await f.apply(ctx, args);\n } finally {\n this._appAPIlock = null;\n }\n };\n }\n\n /**\n * Sets the context used by the logging/tracing mechanism\n *\n * Useful when re-using (cached) the same Transport instance,\n * but with a new tracing context.\n *\n * @param context A TraceContext, that can undefined to reset the context\n */\n setTraceContext(context?: TraceContext) {\n this.tracer = this.tracer.withContext(context);\n }\n\n /**\n * Updates the context used by the logging/tracing mechanism\n *\n * The update only overrides the key-value that are already defined in the current context.\n *\n * @param contextToAdd A TraceContext that will be added to the current context\n */\n updateTraceContext(contextToAdd: TraceContext) {\n this.tracer.updateContext(contextToAdd);\n }\n\n /**\n * Gets the tracing context of the transport instance\n */\n getTraceContext(): TraceContext | undefined {\n return this.tracer.getContext();\n }\n\n static ErrorMessage_ListenTimeout = \"No Ledger device found (timeout)\";\n static ErrorMessage_NoDeviceFound = \"No Ledger device found\";\n}\n", "import { TransportError } from \"@ledgerhq/errors\";\n\n// Represents a response message from the device being reduced from HID USB frames/packets\nexport type ResponseAcc =\n | {\n data: Buffer;\n dataLength: number;\n // The current frame id/number\n sequence: number;\n }\n | null\n | undefined;\n\nconst Tag = 0x05;\n\nfunction asUInt16BE(value) {\n const b = Buffer.alloc(2);\n b.writeUInt16BE(value, 0);\n return b;\n}\n\nconst initialAcc = {\n data: Buffer.alloc(0),\n dataLength: 0,\n sequence: 0,\n};\n\n/**\n * Object to handle HID frames (encoding and decoding)\n *\n * @param channel\n * @param packetSize The HID protocol packet size in bytes (usually 64)\n */\nconst createHIDframing = (channel: number, packetSize: number) => {\n return {\n /**\n * Frames/encodes an APDU message into HID USB packets/frames\n *\n * @param apdu The APDU message to send, in a Buffer containing [cla, ins, p1, p2, data length, data(if not empty)]\n * @returns an array of HID USB frames ready to be sent\n */\n makeBlocks(apdu: Buffer): Buffer[] {\n // Encodes the APDU length in 2 bytes before the APDU itself.\n // The length is measured as the number of bytes.\n // As the size of the APDU `data` should have been added in 1 byte just before `data`,\n // the minimum size of an APDU is 5 bytes.\n let data = Buffer.concat([asUInt16BE(apdu.length), apdu]);\n\n const blockSize = packetSize - 5;\n const nbBlocks = Math.ceil(data.length / blockSize);\n\n // Fills data with 0-padding\n data = Buffer.concat([data, Buffer.alloc(nbBlocks * blockSize - data.length + 1).fill(0)]);\n\n const blocks: Buffer[] = [];\n\n for (let i = 0; i < nbBlocks; i++) {\n const head = Buffer.alloc(5);\n head.writeUInt16BE(channel, 0);\n head.writeUInt8(Tag, 2);\n head.writeUInt16BE(i, 3);\n\n // `slice` and not `subarray`: this might not be a Node Buffer, but probably only a Uint8Array\n const chunk = data.slice(i * blockSize, (i + 1) * blockSize);\n\n blocks.push(Buffer.concat([head, chunk]));\n }\n\n return blocks;\n },\n\n /**\n * Reduces HID USB packets/frames to one response.\n *\n * @param acc The value resulting from (accumulating) the previous call of reduceResponse.\n * On first call initialized to `initialAcc`. The accumulator enables handling multi-frames messages.\n * @param chunk Current chunk to reduce into accumulator\n * @returns An accumulator value updated with the current chunk\n */\n reduceResponse(acc: ResponseAcc, chunk: Buffer): ResponseAcc {\n let { data, dataLength, sequence } = acc || initialAcc;\n\n if (chunk.readUInt16BE(0) !== channel) {\n throw new TransportError(\"Invalid channel\", \"InvalidChannel\");\n }\n\n if (chunk.readUInt8(2) !== Tag) {\n throw new TransportError(\"Invalid tag\", \"InvalidTag\");\n }\n\n if (chunk.readUInt16BE(3) !== sequence) {\n throw new TransportError(\"Invalid sequence\", \"InvalidSequence\");\n }\n\n // Gets the total length of the response from the 1st frame\n if (!acc) {\n dataLength = chunk.readUInt16BE(5);\n }\n\n sequence++;\n // The total length on the 1st frame takes 2 more bytes\n const chunkData = chunk.slice(acc ? 5 : 7);\n data = Buffer.concat([data, chunkData]);\n\n // Removes any 0 padding\n if (data.length > dataLength) {\n data = data.slice(0, dataLength);\n }\n\n return {\n data,\n dataLength,\n sequence,\n };\n },\n\n /**\n * Returns the response message that has been reduced from the HID USB frames\n *\n * @param acc The accumulator\n * @returns A Buffer containing the cleaned response message, or null if no response message, or undefined if the\n * accumulator is incorrect (message length is not valid)\n */\n getReducedResult(acc: ResponseAcc): Buffer | null | undefined {\n if (acc && acc.dataLength === acc.data.length) {\n return acc.data;\n }\n },\n };\n};\n\nexport default createHIDframing;\n", "import semver from \"semver\";\n\n/**\n * The USB product IDs will be defined as MMII, encoding a model (MM) and an interface bitfield (II)\n *\n ** Model\n * Ledger Nano S : 0x10\n * Ledger Blue : 0x00\n * Ledger Nano X : 0x40\n *\n ** Interface support bitfield\n * Generic HID : 0x01\n * Keyboard HID : 0x02\n * U2F : 0x04\n * CCID : 0x08\n * WebUSB : 0x10\n */\nexport const IIGenericHID = 0x01;\nexport const IIKeyboardHID = 0x02;\nexport const IIU2F = 0x04;\nexport const IICCID = 0x08;\nexport const IIWebUSB = 0x10;\n\nexport enum DeviceModelId {\n blue = \"blue\",\n nanoS = \"nanoS\",\n nanoSP = \"nanoSP\",\n nanoX = \"nanoX\",\n stax = \"stax\",\n europa = \"europa\",\n}\n\nconst devices: { [key in DeviceModelId]: DeviceModel } = {\n [DeviceModelId.blue]: {\n id: DeviceModelId.blue,\n productName: \"Ledger\u00A0Blue\",\n productIdMM: 0x00,\n legacyUsbProductId: 0x0000,\n usbOnly: true,\n memorySize: 480 * 1024,\n masks: [0x31000000, 0x31010000],\n getBlockSize: (_firwareVersion: string): number => 4 * 1024,\n },\n [DeviceModelId.nanoS]: {\n id: DeviceModelId.nanoS,\n productName: \"Ledger\u00A0Nano\u00A0S\",\n productIdMM: 0x10,\n legacyUsbProductId: 0x0001,\n usbOnly: true,\n memorySize: 320 * 1024,\n masks: [0x31100000],\n getBlockSize: (firmwareVersion: string): number =>\n semver.lt(semver.coerce(firmwareVersion) ?? \"\", \"2.0.0\") ? 4 * 1024 : 2 * 1024,\n },\n [DeviceModelId.nanoX]: {\n id: DeviceModelId.nanoX,\n productName: \"Ledger\u00A0Nano\u00A0X\",\n productIdMM: 0x40,\n legacyUsbProductId: 0x0004,\n usbOnly: false,\n memorySize: 2 * 1024 * 1024,\n masks: [0x33000000],\n getBlockSize: (_firwareVersion: string): number => 4 * 1024,\n bluetoothSpec: [\n {\n serviceUuid: \"13d63400-2c97-0004-0000-4c6564676572\",\n notifyUuid: \"13d63400-2c97-0004-0001-4c6564676572\",\n writeUuid: \"13d63400-2c97-0004-0002-4c6564676572\",\n writeCmdUuid: \"13d63400-2c97-0004-0003-4c6564676572\",\n },\n ],\n },\n [DeviceModelId.nanoSP]: {\n id: DeviceModelId.nanoSP,\n productName: \"Ledger Nano S Plus\",\n productIdMM: 0x50,\n legacyUsbProductId: 0x0005,\n usbOnly: true,\n memorySize: 1533 * 1024,\n masks: [0x33100000],\n getBlockSize: (_firmwareVersion: string): number => 32,\n },\n [DeviceModelId.stax]: {\n id: DeviceModelId.stax,\n productName: \"Ledger\u00A0Stax\",\n productIdMM: 0x60,\n legacyUsbProductId: 0x0006,\n usbOnly: false,\n memorySize: 1533 * 1024,\n masks: [0x33200000],\n getBlockSize: (_firmwareVersion: string): number => 32,\n bluetoothSpec: [\n {\n serviceUuid: \"13d63400-2c97-6004-0000-4c6564676572\",\n notifyUuid: \"13d63400-2c97-6004-0001-4c6564676572\",\n writeUuid: \"13d63400-2c97-6004-0002-4c6564676572\",\n writeCmdUuid: \"13d63400-2c97-6004-0003-4c6564676572\",\n },\n ],\n },\n [DeviceModelId.europa]: {\n id: DeviceModelId.europa, // TODO: change to the real product's name one day\n productName: \"Ledger Europa\", // TODO: change to the real product's name one day\n productIdMM: 0x70,\n legacyUsbProductId: 0x0007,\n usbOnly: false,\n memorySize: 1533 * 1024,\n masks: [0x33300000],\n getBlockSize: (_firmwareVersion: string): number => 32,\n bluetoothSpec: [\n {\n serviceUuid: \"13d63400-2c97-3004-0000-4c6564676572\",\n notifyUuid: \"13d63400-2c97-3004-0001-4c6564676572\",\n writeUuid: \"13d63400-2c97-3004-0002-4c6564676572\",\n writeCmdUuid: \"13d63400-2c97-3004-0003-4c6564676572\",\n },\n ],\n },\n};\n\nconst productMap = {\n Blue: DeviceModelId.blue,\n \"Nano S\": DeviceModelId.nanoS,\n \"Nano S Plus\": DeviceModelId.nanoSP,\n \"Nano X\": DeviceModelId.nanoX,\n Stax: DeviceModelId.stax,\n Europa: DeviceModelId.europa,\n};\n\nconst devicesList: DeviceModel[] = Object.values(devices);\n\n/**\n *\n */\nexport const ledgerUSBVendorId = 0x2c97;\n\n/**\n *\n */\nexport const getDeviceModel = (id: DeviceModelId): DeviceModel => {\n const info = devices[id];\n if (!info) throw new Error(\"device '\" + id + \"' does not exist\");\n return info;\n};\n\n/**\n * Given a `targetId`, return the deviceModel associated to it,\n * based on the first two bytes.\n */\nexport const identifyTargetId = (targetId: number): DeviceModel | null | undefined => {\n const deviceModel = devicesList.find(({ masks }) =>\n masks.find(mask => (targetId & 0xffff0000) === mask),\n );\n\n return deviceModel;\n};\n\n/**\n * From a given USB product id, return the deviceModel associated to it.\n *\n * The mapping from the product id is only based on the 2 most significant bytes.\n * For example, Stax is defined with a product id of 0x60ii, a product id 0x6011 would be mapped to it.\n */\nexport const identifyUSBProductId = (usbProductId: number): DeviceModel | null | undefined => {\n const legacy = devicesList.find(d => d.legacyUsbProductId === usbProductId);\n if (legacy) return legacy;\n const mm = usbProductId >> 8;\n const deviceModel = devicesList.find(d => d.productIdMM === mm);\n return deviceModel;\n};\n\nexport const identifyProductName = (productName: string): DeviceModel | null | undefined => {\n const deviceModel = devicesList.find(d => d.id === productMap[productName]);\n return deviceModel;\n};\n\nconst bluetoothServices: string[] = [];\nconst serviceUuidToInfos: Record<string, BluetoothInfos> = {};\n\nfor (const id in devices) {\n const deviceModel = devices[id];\n const { bluetoothSpec } = deviceModel;\n if (bluetoothSpec) {\n for (let i = 0; i < bluetoothSpec.length; i++) {\n const spec = bluetoothSpec[i];\n bluetoothServices.push(spec.serviceUuid);\n serviceUuidToInfos[spec.serviceUuid] = serviceUuidToInfos[\n spec.serviceUuid.replace(/-/g, \"\")\n ] = {\n deviceModel,\n ...spec,\n };\n }\n }\n}\n\n/**\n *\n */\nexport const getBluetoothServiceUuids = (): string[] => bluetoothServices;\n\n/**\n *\n */\nexport const getInfosForServiceUuid = (uuid: string): BluetoothInfos | undefined =>\n serviceUuidToInfos[uuid.toLowerCase()];\n\n/**\n *\n */\nexport interface DeviceModel {\n id: DeviceModelId;\n productName: string;\n productIdMM: number;\n legacyUsbProductId: number;\n usbOnly: boolean;\n memorySize: number;\n masks: number[];\n // blockSize: number, // THIS FIELD IS DEPRECATED, use getBlockSize\n getBlockSize: (firmwareVersion: string) => number;\n bluetoothSpec?: {\n serviceUuid: string;\n writeUuid: string;\n writeCmdUuid: string;\n notifyUuid: string;\n }[];\n}\n\n/**\n *\n */\nexport interface BluetoothInfos {\n deviceModel: DeviceModel;\n serviceUuid: string;\n writeUuid: string;\n writeCmdUuid: string;\n notifyUuid: string;\n}\n", "import Transport from \"@ledgerhq/hw-transport\";\nimport type { Observer, DescriptorEvent, Subscription } from \"@ledgerhq/hw-transport\";\nimport hidFraming from \"@ledgerhq/devices/hid-framing\";\nimport { identifyUSBProductId, ledgerUSBVendorId } from \"@ledgerhq/devices\";\nimport type { DeviceModel } from \"@ledgerhq/devices\";\nimport { log } from \"@ledgerhq/logs\";\nimport {\n TransportOpenUserCancelled,\n DisconnectedDeviceDuringOperation,\n DisconnectedDevice,\n TransportError,\n} from \"@ledgerhq/errors\";\n\nconst ledgerDevices = [\n {\n vendorId: ledgerUSBVendorId,\n },\n];\n\nconst isSupported = () => Promise.resolve(!!(window.navigator && window.navigator.hid));\n\nconst getHID = (): HID => {\n // $FlowFixMe\n const { hid } = navigator;\n if (!hid) throw new TransportError(\"navigator.hid is not supported\", \"HIDNotSupported\");\n return hid;\n};\n\nasync function requestLedgerDevices(): Promise<HIDDevice[]> {\n const device = await getHID().requestDevice({\n filters: ledgerDevices,\n });\n if (Array.isArray(device)) return device;\n return [device];\n}\n\nasync function getLedgerDevices(): Promise<HIDDevice[]> {\n const devices = await getHID().getDevices();\n return devices.filter(d => d.vendorId === ledgerUSBVendorId);\n}\n\nasync function getFirstLedgerDevice(): Promise<HIDDevice> {\n const existingDevices = await getLedgerDevices();\n if (existingDevices.length > 0) return existingDevices[0];\n const devices = await requestLedgerDevices();\n return devices[0];\n}\n/**\n * WebHID Transport implementation\n * @example\n * import TransportWebHID from \"@ledgerhq/hw-transport-webhid\";\n * ...\n * TransportWebHID.create().then(transport => ...)\n */\n\nexport default class TransportWebHID extends Transport {\n device: HIDDevice;\n deviceModel: DeviceModel | null | undefined;\n channel = Math.floor(Math.random() * 0xffff);\n packetSize = 64;\n\n constructor(device: HIDDevice) {\n super();\n this.device = device;\n this.deviceModel =\n typeof device.productId === \"number\" ? identifyUSBProductId(device.productId) : undefined;\n device.addEventListener(\"inputreport\", this.onInputReport);\n }\n\n inputs: Buffer[] = [];\n inputCallback: ((arg0: Buffer) => void) | null | undefined;\n read = (): Promise<Buffer> => {\n if (this.inputs.length) {\n return Promise.resolve(this.inputs.shift() as unknown as Buffer);\n }\n\n return new Promise(success => {\n this.inputCallback = success;\n });\n };\n onInputReport = (e: HIDInputReportEvent) => {\n const buffer = Buffer.from(e.data.buffer);\n\n if (this.inputCallback) {\n this.inputCallback(buffer);\n this.inputCallback = null;\n } else {\n this.inputs.push(buffer);\n }\n };\n\n /**\n * Check if WebUSB transport is supported.\n */\n static isSupported = isSupported;\n\n /**\n * List the WebUSB devices that was previously authorized by the user.\n */\n static list = getLedgerDevices;\n\n /**\n * Actively listen to WebUSB devices and emit ONE device\n * that was either accepted before, if not it will trigger the native permission UI.\n *\n * Important: it must be called in the context of a UI click!\n */\n static listen = (observer: Observer<DescriptorEvent<HIDDevice>>): Subscription => {\n let unsubscribed = false;\n getFirstLedgerDevice().then(\n device => {\n if (!device) {\n observer.error(new TransportOpenUserCancelled(\"Access denied to use Ledger device\"));\n } else if (!unsubscribed) {\n const deviceModel =\n typeof device.productId === \"number\"\n ? identifyUSBProductId(device.productId)\n : undefined;\n observer.next({\n type: \"add\",\n descriptor: device,\n deviceModel,\n });\n observer.complete();\n }\n },\n error => {\n observer.error(new TransportOpenUserCancelled(error.message));\n },\n );\n\n function unsubscribe() {\n unsubscribed = true;\n }\n\n return {\n unsubscribe,\n };\n };\n\n /**\n * Similar to create() except it will always display the device permission (even if some devices are already accepted).\n */\n static async request() {\n const [device] = await requestLedgerDevices();\n return TransportWebHID.open(device);\n }\n\n /**\n * Similar to create() except it will never display the device permission (it returns a Promise<?Transport>, null if it fails to find a device).\n */\n static async openConnected() {\n const devices = await getLedgerDevices();\n if (devices.length === 0) return null;\n return TransportWebHID.open(devices[0]);\n }\n\n /**\n * Create a Ledger transport with a HIDDevice\n */\n static async open(device: HIDDevice) {\n await device.open();\n const transport = new TransportWebHID(device);\n\n const onDisconnect = e => {\n if (device === e.device) {\n getHID().removeEventListener(\"disconnect\", onDisconnect);\n\n transport._emitDisconnect(new DisconnectedDevice());\n }\n };\n\n getHID().addEventListener(\"disconnect\", onDisconnect);\n return transport;\n }\n\n _disconnectEmitted = false;\n _emitDisconnect = (e: Error) => {\n if (this._disconnectEmitted) return;\n this._disconnectEmitted = true;\n this.emit(\"disconnect\", e);\n };\n\n /**\n * Release the transport device\n */\n async close(): Promise<void> {\n await this.exchangeBusyPromise;\n this.device.removeEventListener(\"inputreport\", this.onInputReport);\n await this.device.close();\n }\n\n /**\n * Exchange with the device using APDU protocol.\n * @param apdu\n * @returns a promise of apdu response\n */\n exchange = async (apdu: Buffer): Promise<Buffer> => {\n const b = await this.exchangeAtomicImpl(async () => {\n const { channel, packetSize } = this;\n log(\"apdu\", \"=> \" + apdu.toString(\"hex\"));\n const framing = hidFraming(channel, packetSize);\n // Write...\n const blocks = framing.makeBlocks(apdu);\n\n for (let i = 0; i < blocks.length; i++) {\n await this.device.sendReport(0, blocks[i]);\n }\n\n // Read...\n let result;\n let acc;\n\n while (!(result = framing.getReducedResult(acc))) {\n const buffer = await this.read();\n acc = framing.reduceResponse(acc, buffer);\n }\n\n log(\"apdu\", \"<= \" + result.toString(\"hex\"));\n return result;\n }).catch(e => {\n if (e && e.message && e.message.includes(\"write\")) {\n this._emitDisconnect(e);\n\n throw new DisconnectedDeviceDuringOperation(e.message);\n }\n\n throw e;\n });\n return b as Buffer;\n };\n\n setScrambleKey() {}\n}\n"],
5
5
  "mappings": "+JAAA,IAAAA,EAAAC,EAAA,CAAAC,GAAAC,KAAA,CAEA,IAAMC,GAAsB,QAGtBC,GAAmB,OAAO,kBACL,iBAGrBC,GAA4B,GAI5BC,GAAwB,IAExBC,GAAgB,CACpB,QACA,WACA,QACA,WACA,QACA,WACA,YACF,EAEAL,GAAO,QAAU,CACf,eACA,0BAAAG,GACA,sBAAAC,GACA,iBAAAF,GACA,cAAAG,GACA,oBAAAJ,GACA,wBAAyB,EACzB,WAAY,CACd,IClCA,IAAAK,EAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GACJ,OAAO,SAAY,UACnB,QAAQ,KACR,QAAQ,IAAI,YACZ,cAAc,KAAK,QAAQ,IAAI,UAAU,EACvC,IAAIC,IAAS,QAAQ,MAAM,SAAU,GAAGA,CAAI,EAC5C,IAAM,CAAC,EAEXF,GAAO,QAAUC,KCRjB,IAAAE,EAAAC,EAAA,CAAAC,EAAAC,KAAA,IAAM,CACJ,0BAAAC,GACA,sBAAAC,GACA,WAAAC,EACF,EAAI,IACEC,GAAQ,IACdL,EAAUC,GAAO,QAAU,CAAC,EAG5B,IAAMK,GAAKN,EAAQ,GAAK,CAAC,EACnBO,GAASP,EAAQ,OAAS,CAAC,EAC3BQ,EAAMR,EAAQ,IAAM,CAAC,EACrBS,EAAIT,EAAQ,EAAI,CAAC,EACnBU,GAAI,EAEFC,GAAmB,eAQnBC,GAAwB,CAC5B,CAAC,MAAO,CAAC,EACT,CAAC,MAAOR,EAAU,EAClB,CAACO,GAAkBR,EAAqB,CAC1C,EAEMU,GAAgBC,EAACC,GAAU,CAC/B,OAAW,CAACC,EAAOC,CAAG,IAAKL,GACzBG,EAAQA,EACL,MAAM,GAAGC,CAAK,GAAG,EAAE,KAAK,GAAGA,CAAK,MAAMC,CAAG,GAAG,EAC5C,MAAM,GAAGD,CAAK,GAAG,EAAE,KAAK,GAAGA,CAAK,MAAMC,CAAG,GAAG,EAEjD,OAAOF,CACT,EAPsB,iBAShBG,EAAcJ,EAAA,CAACK,EAAMJ,EAAOK,IAAa,CAC7C,IAAMC,EAAOR,GAAcE,CAAK,EAC1BO,EAAQZ,KACdL,GAAMc,EAAMG,EAAOP,CAAK,EACxBN,EAAEU,CAAI,EAAIG,EACVd,EAAIc,CAAK,EAAIP,EACbT,GAAGgB,CAAK,EAAI,IAAI,OAAOP,EAAOK,EAAW,IAAM,MAAS,EACxDb,GAAOe,CAAK,EAAI,IAAI,OAAOD,EAAMD,EAAW,IAAM,MAAS,CAC7D,EARoB,eAgBpBF,EAAY,oBAAqB,aAAa,EAC9CA,EAAY,yBAA0B,MAAM,EAM5CA,EAAY,uBAAwB,gBAAgBP,EAAgB,GAAG,EAKvEO,EAAY,cAAe,IAAIV,EAAIC,EAAE,iBAAiB,CAAC,QAChCD,EAAIC,EAAE,iBAAiB,CAAC,QACxBD,EAAIC,EAAE,iBAAiB,CAAC,GAAG,EAElDS,EAAY,mBAAoB,IAAIV,EAAIC,EAAE,sBAAsB,CAAC,QACrCD,EAAIC,EAAE,sBAAsB,CAAC,QAC7BD,EAAIC,EAAE,sBAAsB,CAAC,GAAG,EAK5DS,EAAY,uBAAwB,MAAMV,EAAIC,EAAE,iBAAiB,CACjE,IAAID,EAAIC,EAAE,oBAAoB,CAAC,GAAG,EAElCS,EAAY,4BAA6B,MAAMV,EAAIC,EAAE,sBAAsB,CAC3E,IAAID,EAAIC,EAAE,oBAAoB,CAAC,GAAG,EAMlCS,EAAY,aAAc,QAAQV,EAAIC,EAAE,oBAAoB,CAC5D,SAASD,EAAIC,EAAE,oBAAoB,CAAC,MAAM,EAE1CS,EAAY,kBAAmB,SAASV,EAAIC,EAAE,yBAAyB,CACvE,SAASD,EAAIC,EAAE,yBAAyB,CAAC,MAAM,EAK/CS,EAAY,kBAAmB,GAAGP,EAAgB,GAAG,EAMrDO,EAAY,QAAS,UAAUV,EAAIC,EAAE,eAAe,CACpD,SAASD,EAAIC,EAAE,eAAe,CAAC,MAAM,EAWrCS,EAAY,YAAa,KAAKV,EAAIC,EAAE,WAAW,CAC/C,GAAGD,EAAIC,EAAE,UAAU,CAAC,IAClBD,EAAIC,EAAE,KAAK,CAAC,GAAG,EAEjBS,EAAY,OAAQ,IAAIV,EAAIC,EAAE,SAAS,CAAC,GAAG,EAK3CS,EAAY,aAAc,WAAWV,EAAIC,EAAE,gBAAgB,CAC3D,GAAGD,EAAIC,EAAE,eAAe,CAAC,IACvBD,EAAIC,EAAE,KAAK,CAAC,GAAG,EAEjBS,EAAY,QAAS,IAAIV,EAAIC,EAAE,UAAU,CAAC,GAAG,EAE7CS,EAAY,OAAQ,cAAc,EAKlCA,EAAY,wBAAyB,GAAGV,EAAIC,EAAE,sBAAsB,CAAC,UAAU,EAC/ES,EAAY,mBAAoB,GAAGV,EAAIC,EAAE,iBAAiB,CAAC,UAAU,EAErES,EAAY,cAAe,YAAYV,EAAIC,EAAE,gBAAgB,CAAC,WACjCD,EAAIC,EAAE,gBAAgB,CAAC,WACvBD,EAAIC,EAAE,gBAAgB,CAAC,OAC3BD,EAAIC,EAAE,UAAU,CAAC,KACrBD,EAAIC,EAAE,KAAK,CAAC,OACR,EAEzBS,EAAY,mBAAoB,YAAYV,EAAIC,EAAE,qBAAqB,CAAC,WACtCD,EAAIC,EAAE,qBAAqB,CAAC,WAC5BD,EAAIC,EAAE,qBAAqB,CAAC,OAChCD,EAAIC,EAAE,eAAe,CAAC,KAC1BD,EAAIC,EAAE,KAAK,CAAC,OACR,EAE9BS,EAAY,SAAU,IAAIV,EAAIC,EAAE,IAAI,CAAC,OAAOD,EAAIC,EAAE,WAAW,CAAC,GAAG,EACjES,EAAY,cAAe,IAAIV,EAAIC,EAAE,IAAI,CAAC,OAAOD,EAAIC,EAAE,gBAAgB,CAAC,GAAG,EAI3ES,EAAY,SAAU,oBACIhB,EAAyB,kBACrBA,EAAyB,oBACzBA,EAAyB,kBAC3B,EAC5BgB,EAAY,YAAaV,EAAIC,EAAE,MAAM,EAAG,EAAI,EAI5CS,EAAY,YAAa,SAAS,EAElCA,EAAY,YAAa,SAASV,EAAIC,EAAE,SAAS,CAAC,OAAQ,EAAI,EAC9DT,EAAQ,iBAAmB,MAE3BkB,EAAY,QAAS,IAAIV,EAAIC,EAAE,SAAS,CAAC,GAAGD,EAAIC,EAAE,WAAW,CAAC,GAAG,EACjES,EAAY,aAAc,IAAIV,EAAIC,EAAE,SAAS,CAAC,GAAGD,EAAIC,EAAE,gBAAgB,CAAC,GAAG,EAI3ES,EAAY,YAAa,SAAS,EAElCA,EAAY,YAAa,SAASV,EAAIC,EAAE,SAAS,CAAC,OAAQ,EAAI,EAC9DT,EAAQ,iBAAmB,MAE3BkB,EAAY,QAAS,IAAIV,EAAIC,EAAE,SAAS,CAAC,GAAGD,EAAIC,EAAE,WAAW,CAAC,GAAG,EACjES,EAAY,aAAc,IAAIV,EAAIC,EAAE,SAAS,CAAC,GAAGD,EAAIC,EAAE,gBAAgB,CAAC,GAAG,EAG3ES,EAAY,kBAAmB,IAAIV,EAAIC,EAAE,IAAI,CAAC,QAAQD,EAAIC,EAAE,UAAU,CAAC,OAAO,EAC9ES,EAAY,aAAc,IAAIV,EAAIC,EAAE,IAAI,CAAC,QAAQD,EAAIC,EAAE,SAAS,CAAC,OAAO,EAIxES,EAAY,iBAAkB,SAASV,EAAIC,EAAE,IAAI,CACjD,QAAQD,EAAIC,EAAE,UAAU,CAAC,IAAID,EAAIC,EAAE,WAAW,CAAC,IAAK,EAAI,EACxDT,EAAQ,sBAAwB,SAMhCkB,EAAY,cAAe,SAASV,EAAIC,EAAE,WAAW,CAAC,cAE/BD,EAAIC,EAAE,WAAW,CAAC,QACf,EAE1BS,EAAY,mBAAoB,SAASV,EAAIC,EAAE,gBAAgB,CAAC,cAEpCD,EAAIC,EAAE,gBAAgB,CAAC,QACpB,EAG/BS,EAAY,OAAQ,iBAAiB,EAErCA,EAAY,OAAQ,2BAA2B,EAC/CA,EAAY,UAAW,6BAA6B,ICnNpD,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CACA,IAAMC,GAAc,OAAO,OAAO,CAAE,MAAO,EAAK,CAAC,EAC3CC,GAAY,OAAO,OAAO,CAAE,CAAC,EAC7BC,GAAeC,EAAAC,GACdA,EAID,OAAOA,GAAY,SACdJ,GAGFI,EAPEH,GAFU,gBAWrBF,GAAO,QAAUG,KCdjB,IAAAG,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,WACVC,GAAqBC,EAAA,CAACC,EAAGC,IAAM,CACnC,IAAMC,EAAOL,GAAQ,KAAKG,CAAC,EACrBG,EAAON,GAAQ,KAAKI,CAAC,EAE3B,OAAIC,GAAQC,IACVH,EAAI,CAACA,EACLC,EAAI,CAACA,GAGAD,IAAMC,EAAI,EACZC,GAAQ,CAACC,EAAQ,GACjBA,GAAQ,CAACD,EAAQ,EAClBF,EAAIC,EAAI,GACR,CACN,EAd2B,sBAgBrBG,GAAsBL,EAAA,CAACC,EAAGC,IAAMH,GAAmBG,EAAGD,CAAC,EAAjC,uBAE5BJ,GAAO,QAAU,CACf,mBAAAE,GACA,oBAAAM,EACF,ICtBA,IAAAC,EAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACR,CAAE,WAAAC,GAAY,iBAAAC,EAAiB,EAAI,IACnC,CAAE,OAAQC,GAAI,EAAAC,EAAE,EAAI,IAEpBC,GAAe,KACf,CAAE,mBAAAC,CAAmB,EAAI,KACzBC,GAAN,MAAMC,CAAO,CANb,MAMa,CAAAC,EAAA,eACX,YAAaC,EAASC,EAAS,CAG7B,GAFAA,EAAUN,GAAaM,CAAO,EAE1BD,aAAmBF,EAAQ,CAC7B,GAAIE,EAAQ,QAAU,CAAC,CAACC,EAAQ,OAC5BD,EAAQ,oBAAsB,CAAC,CAACC,EAAQ,kBAC1C,OAAOD,EAEPA,EAAUA,EAAQ,OAEtB,SAAW,OAAOA,GAAY,SAC5B,MAAM,IAAI,UAAU,gDAAgD,OAAOA,CAAO,IAAI,EAGxF,GAAIA,EAAQ,OAAST,GACnB,MAAM,IAAI,UACR,0BAA0BA,EAAU,aACtC,EAGFD,GAAM,SAAUU,EAASC,CAAO,EAChC,KAAK,QAAUA,EACf,KAAK,MAAQ,CAAC,CAACA,EAAQ,MAGvB,KAAK,kBAAoB,CAAC,CAACA,EAAQ,kBAEnC,IAAMC,EAAIF,EAAQ,KAAK,EAAE,MAAMC,EAAQ,MAAQR,GAAGC,GAAE,KAAK,EAAID,GAAGC,GAAE,IAAI,CAAC,EAEvE,GAAI,CAACQ,EACH,MAAM,IAAI,UAAU,oBAAoBF,CAAO,EAAE,EAUnD,GAPA,KAAK,IAAMA,EAGX,KAAK,MAAQ,CAACE,EAAE,CAAC,EACjB,KAAK,MAAQ,CAACA,EAAE,CAAC,EACjB,KAAK,MAAQ,CAACA,EAAE,CAAC,EAEb,KAAK,MAAQV,IAAoB,KAAK,MAAQ,EAChD,MAAM,IAAI,UAAU,uBAAuB,EAG7C,GAAI,KAAK,MAAQA,IAAoB,KAAK,MAAQ,EAChD,MAAM,IAAI,UAAU,uBAAuB,EAG7C,GAAI,KAAK,MAAQA,IAAoB,KAAK,MAAQ,EAChD,MAAM,IAAI,UAAU,uBAAuB,EAIxCU,EAAE,CAAC,EAGN,KAAK,WAAaA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,IAAKC,GAAO,CAC5C,GAAI,WAAW,KAAKA,CAAE,EAAG,CACvB,IAAMC,EAAM,CAACD,EACb,GAAIC,GAAO,GAAKA,EAAMZ,GACpB,OAAOY,CAEX,CACA,OAAOD,CACT,CAAC,EAVD,KAAK,WAAa,CAAC,EAarB,KAAK,MAAQD,EAAE,CAAC,EAAIA,EAAE,CAAC,EAAE,MAAM,GAAG,EAAI,CAAC,EACvC,KAAK,OAAO,CACd,CAEA,QAAU,CACR,YAAK,QAAU,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,GACpD,KAAK,WAAW,SAClB,KAAK,SAAW,IAAI,KAAK,WAAW,KAAK,GAAG,CAAC,IAExC,KAAK,OACd,CAEA,UAAY,CACV,OAAO,KAAK,OACd,CAEA,QAASG,EAAO,CAEd,GADAf,GAAM,iBAAkB,KAAK,QAAS,KAAK,QAASe,CAAK,EACrD,EAAEA,aAAiBP,GAAS,CAC9B,GAAI,OAAOO,GAAU,UAAYA,IAAU,KAAK,QAC9C,MAAO,GAETA,EAAQ,IAAIP,EAAOO,EAAO,KAAK,OAAO,CACxC,CAEA,OAAIA,EAAM,UAAY,KAAK,QAClB,EAGF,KAAK,YAAYA,CAAK,GAAK,KAAK,WAAWA,CAAK,CACzD,CAEA,YAAaA,EAAO,CAClB,OAAMA,aAAiBP,IACrBO,EAAQ,IAAIP,EAAOO,EAAO,KAAK,OAAO,GAItCT,EAAmB,KAAK,MAAOS,EAAM,KAAK,GAC1CT,EAAmB,KAAK,MAAOS,EAAM,KAAK,GAC1CT,EAAmB,KAAK,MAAOS,EAAM,KAAK,CAE9C,CAEA,WAAYA,EAAO,CAMjB,GALMA,aAAiBP,IACrBO,EAAQ,IAAIP,EAAOO,EAAO,KAAK,OAAO,GAIpC,KAAK,WAAW,QAAU,CAACA,EAAM,WAAW,OAC9C,MAAO,GACF,GAAI,CAAC,KAAK,WAAW,QAAUA,EAAM,WAAW,OACrD,MAAO,GACF,GAAI,CAAC,KAAK,WAAW,QAAU,CAACA,EAAM,WAAW,OACtD,MAAO,GAGT,IAAIC,EAAI,EACR,EAAG,CACD,IAAMC,EAAI,KAAK,WAAWD,CAAC,EACrBE,EAAIH,EAAM,WAAWC,CAAC,EAE5B,GADAhB,GAAM,qBAAsBgB,EAAGC,EAAGC,CAAC,EAC/BD,IAAM,QAAaC,IAAM,OAC3B,MAAO,GACF,GAAIA,IAAM,OACf,MAAO,GACF,GAAID,IAAM,OACf,MAAO,GACF,GAAIA,IAAMC,EACf,SAEA,OAAOZ,EAAmBW,EAAGC,CAAC,CAElC,OAAS,EAAEF,EACb,CAEA,aAAcD,EAAO,CACbA,aAAiBP,IACrBO,EAAQ,IAAIP,EAAOO,EAAO,KAAK,OAAO,GAGxC,IAAIC,EAAI,EACR,EAAG,CACD,IAAMC,EAAI,KAAK,MAAMD,CAAC,EAChBE,EAAIH,EAAM,MAAMC,CAAC,EAEvB,GADAhB,GAAM,qBAAsBgB,EAAGC,EAAGC,CAAC,EAC/BD,IAAM,QAAaC,IAAM,OAC3B,MAAO,GACF,GAAIA,IAAM,OACf,MAAO,GACF,GAAID,IAAM,OACf,MAAO,GACF,GAAIA,IAAMC,EACf,SAEA,OAAOZ,EAAmBW,EAAGC,CAAC,CAElC,OAAS,EAAEF,EACb,CAIA,IAAKG,EAASC,EAAYC,EAAgB,CACxC,OAAQF,EAAS,CACf,IAAK,WACH,KAAK,WAAW,OAAS,EACzB,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,QACL,KAAK,IAAI,MAAOC,EAAYC,CAAc,EAC1C,MACF,IAAK,WACH,KAAK,WAAW,OAAS,EACzB,KAAK,MAAQ,EACb,KAAK,QACL,KAAK,IAAI,MAAOD,EAAYC,CAAc,EAC1C,MACF,IAAK,WAIH,KAAK,WAAW,OAAS,EACzB,KAAK,IAAI,QAASD,EAAYC,CAAc,EAC5C,KAAK,IAAI,MAAOD,EAAYC,CAAc,EAC1C,MAGF,IAAK,aACC,KAAK,WAAW,SAAW,GAC7B,KAAK,IAAI,QAASD,EAAYC,CAAc,EAE9C,KAAK,IAAI,MAAOD,EAAYC,CAAc,EAC1C,MAEF,IAAK,SAMD,KAAK,QAAU,GACf,KAAK,QAAU,GACf,KAAK,WAAW,SAAW,IAE3B,KAAK,QAEP,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,WAAa,CAAC,EACnB,MACF,IAAK,SAKC,KAAK,QAAU,GAAK,KAAK,WAAW,SAAW,IACjD,KAAK,QAEP,KAAK,MAAQ,EACb,KAAK,WAAa,CAAC,EACnB,MACF,IAAK,QAKC,KAAK,WAAW,SAAW,GAC7B,KAAK,QAEP,KAAK,WAAa,CAAC,EACnB,MAGF,IAAK,MAAO,CACV,IAAMC,EAAO,OAAOD,CAAc,EAAI,EAAI,EAE1C,GAAI,CAACD,GAAcC,IAAmB,GACpC,MAAM,IAAI,MAAM,iDAAiD,EAGnE,GAAI,KAAK,WAAW,SAAW,EAC7B,KAAK,WAAa,CAACC,CAAI,MAClB,CACL,IAAI,EAAI,KAAK,WAAW,OACxB,KAAO,EAAE,GAAK,GACR,OAAO,KAAK,WAAW,CAAC,GAAM,WAChC,KAAK,WAAW,CAAC,IACjB,EAAI,IAGR,GAAI,IAAM,GAAI,CAEZ,GAAIF,IAAe,KAAK,WAAW,KAAK,GAAG,GAAKC,IAAmB,GACjE,MAAM,IAAI,MAAM,uDAAuD,EAEzE,KAAK,WAAW,KAAKC,CAAI,CAC3B,CACF,CACA,GAAIF,EAAY,CAGd,IAAIG,EAAa,CAACH,EAAYE,CAAI,EAC9BD,IAAmB,KACrBE,EAAa,CAACH,CAAU,GAEtBd,EAAmB,KAAK,WAAW,CAAC,EAAGc,CAAU,IAAM,EACrD,MAAM,KAAK,WAAW,CAAC,CAAC,IAC1B,KAAK,WAAaG,GAGpB,KAAK,WAAaA,CAEtB,CACA,KACF,CACA,QACE,MAAM,IAAI,MAAM,+BAA+BJ,CAAO,EAAE,CAC5D,CACA,YAAK,IAAM,KAAK,OAAO,EACnB,KAAK,MAAM,SACb,KAAK,KAAO,IAAI,KAAK,MAAM,KAAK,GAAG,CAAC,IAE/B,IACT,CACF,EAEApB,GAAO,QAAUQ,KC7SjB,IAAAiB,EAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQC,EAAA,CAACC,EAASC,EAASC,EAAc,KAAU,CACvD,GAAIF,aAAmBH,GACrB,OAAOG,EAET,GAAI,CACF,OAAO,IAAIH,GAAOG,EAASC,CAAO,CACpC,OAASE,EAAI,CACX,GAAI,CAACD,EACH,OAAO,KAET,MAAMC,CACR,CACF,EAZc,SAcdP,GAAO,QAAUE,KCfjB,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAQC,EAAA,CAACC,EAASC,IAAY,CAClC,IAAMC,EAAIL,GAAMG,EAASC,CAAO,EAChC,OAAOC,EAAIA,EAAE,QAAU,IACzB,EAHc,SAIdN,GAAO,QAAUE,KCLjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAQC,EAAA,CAACC,EAASC,IAAY,CAClC,IAAMC,EAAIL,GAAMG,EAAQ,KAAK,EAAE,QAAQ,SAAU,EAAE,EAAGC,CAAO,EAC7D,OAAOC,EAAIA,EAAE,QAAU,IACzB,EAHc,SAIdN,GAAO,QAAUE,KCLjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IAETC,GAAMC,EAAA,CAACC,EAASC,EAASC,EAASC,EAAYC,IAAmB,CACjE,OAAQF,GAAa,WACvBE,EAAiBD,EACjBA,EAAaD,EACbA,EAAU,QAGZ,GAAI,CACF,OAAO,IAAIL,GACTG,aAAmBH,GAASG,EAAQ,QAAUA,EAC9CE,CACF,EAAE,IAAID,EAASE,EAAYC,CAAc,EAAE,OAC7C,MAAa,CACX,OAAO,IACT,CACF,EAfY,OAgBZR,GAAO,QAAUE,KClBjB,IAAAO,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IAERC,GAAOC,EAAA,CAACC,EAAUC,IAAa,CACnC,IAAMC,EAAKL,GAAMG,EAAU,KAAM,EAAI,EAC/BG,EAAKN,GAAMI,EAAU,KAAM,EAAI,EAC/BG,EAAaF,EAAG,QAAQC,CAAE,EAEhC,GAAIC,IAAe,EACjB,OAAO,KAGT,IAAMC,EAAWD,EAAa,EACxBE,EAAcD,EAAWH,EAAKC,EAC9BI,EAAaF,EAAWF,EAAKD,EAC7BM,EAAa,CAAC,CAACF,EAAY,WAAW,OAG5C,GAFkB,CAAC,CAACC,EAAW,WAAW,QAEzB,CAACC,EAQhB,MAAI,CAACD,EAAW,OAAS,CAACA,EAAW,MAC5B,QAKLD,EAAY,MAEP,QAGLA,EAAY,MAEP,QAIF,QAIT,IAAMG,EAASD,EAAa,MAAQ,GAEpC,OAAIN,EAAG,QAAUC,EAAG,MACXM,EAAS,QAGdP,EAAG,QAAUC,EAAG,MACXM,EAAS,QAGdP,EAAG,QAAUC,EAAG,MACXM,EAAS,QAIX,YACT,EA5Da,QA8Dbb,GAAO,QAAUE,KChEjB,IAAAY,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQC,EAAA,CAACC,EAAGC,IAAU,IAAIJ,GAAOG,EAAGC,CAAK,EAAE,MAAnC,SACdL,GAAO,QAAUE,KCFjB,IAAAI,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQC,EAAA,CAACC,EAAGC,IAAU,IAAIJ,GAAOG,EAAGC,CAAK,EAAE,MAAnC,SACdL,GAAO,QAAUE,KCFjB,IAAAI,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQC,EAAA,CAACC,EAAGC,IAAU,IAAIJ,GAAOG,EAAGC,CAAK,EAAE,MAAnC,SACdL,GAAO,QAAUE,KCFjB,IAAAI,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAaC,EAAA,CAACC,EAASC,IAAY,CACvC,IAAMC,EAASL,GAAMG,EAASC,CAAO,EACrC,OAAQC,GAAUA,EAAO,WAAW,OAAUA,EAAO,WAAa,IACpE,EAHmB,cAInBN,GAAO,QAAUE,KCLjB,IAAAK,EAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAUC,EAAA,CAACC,EAAGC,EAAGC,IACrB,IAAIL,GAAOG,EAAGE,CAAK,EAAE,QAAQ,IAAIL,GAAOI,EAAGC,CAAK,CAAC,EADnC,WAGhBN,GAAO,QAAUE,KCJjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAWC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQI,EAAGD,EAAGE,CAAK,EAApC,YACjBN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAeC,EAAA,CAACC,EAAGC,IAAMJ,GAAQG,EAAGC,EAAG,EAAI,EAA5B,gBACrBL,GAAO,QAAUE,KCFjB,IAAAI,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAeC,EAAA,CAACC,EAAGC,EAAGC,IAAU,CACpC,IAAMC,EAAW,IAAIN,GAAOG,EAAGE,CAAK,EAC9BE,EAAW,IAAIP,GAAOI,EAAGC,CAAK,EACpC,OAAOC,EAAS,QAAQC,CAAQ,GAAKD,EAAS,aAAaC,CAAQ,CACrE,EAJqB,gBAKrBR,GAAO,QAAUE,KCNjB,IAAAO,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAe,KACfC,GAAOC,EAAA,CAACC,EAAMC,IAAUD,EAAK,KAAK,CAACE,EAAGC,IAAMN,GAAaK,EAAGC,EAAGF,CAAK,CAAC,EAA9D,QACbL,GAAO,QAAUE,KCFjB,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAe,KACfC,GAAQC,EAAA,CAACC,EAAMC,IAAUD,EAAK,KAAK,CAACE,EAAGC,IAAMN,GAAaM,EAAGD,EAAGD,CAAK,CAAC,EAA9D,SACdL,GAAO,QAAUE,KCFjB,IAAAM,EAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAKC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQG,EAAGC,EAAGC,CAAK,EAAI,EAAxC,MACXN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAKC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQG,EAAGC,EAAGC,CAAK,EAAI,EAAxC,MACXN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAKC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQG,EAAGC,EAAGC,CAAK,IAAM,EAA1C,MACXN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAMC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQG,EAAGC,EAAGC,CAAK,IAAM,EAA1C,OACZN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAMC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQG,EAAGC,EAAGC,CAAK,GAAK,EAAzC,OACZN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,IACVC,GAAMC,EAAA,CAACC,EAAGC,EAAGC,IAAUL,GAAQG,EAAGC,EAAGC,CAAK,GAAK,EAAzC,OACZN,GAAO,QAAUE,KCFjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAK,KACLC,GAAM,KACNC,GAAK,IACLC,GAAM,KACNC,GAAK,KACLC,GAAM,KAENC,GAAMC,EAAA,CAACC,EAAGC,EAAIC,EAAGC,IAAU,CAC/B,OAAQF,EAAI,CACV,IAAK,MACH,OAAI,OAAOD,GAAM,WACfA,EAAIA,EAAE,SAEJ,OAAOE,GAAM,WACfA,EAAIA,EAAE,SAEDF,IAAME,EAEf,IAAK,MACH,OAAI,OAAOF,GAAM,WACfA,EAAIA,EAAE,SAEJ,OAAOE,GAAM,WACfA,EAAIA,EAAE,SAEDF,IAAME,EAEf,IAAK,GACL,IAAK,IACL,IAAK,KACH,OAAOV,GAAGQ,EAAGE,EAAGC,CAAK,EAEvB,IAAK,KACH,OAAOV,GAAIO,EAAGE,EAAGC,CAAK,EAExB,IAAK,IACH,OAAOT,GAAGM,EAAGE,EAAGC,CAAK,EAEvB,IAAK,KACH,OAAOR,GAAIK,EAAGE,EAAGC,CAAK,EAExB,IAAK,IACH,OAAOP,GAAGI,EAAGE,EAAGC,CAAK,EAEvB,IAAK,KACH,OAAON,GAAIG,EAAGE,EAAGC,CAAK,EAExB,QACE,MAAM,IAAI,UAAU,qBAAqBF,CAAE,EAAE,CACjD,CACF,EA3CY,OA4CZV,GAAO,QAAUO,KCnDjB,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQ,IACR,CAAE,OAAQC,GAAI,EAAAC,EAAE,EAAI,IAEpBC,GAASC,EAAA,CAACC,EAASC,IAAY,CACnC,GAAID,aAAmBN,GACrB,OAAOM,EAOT,GAJI,OAAOA,GAAY,WACrBA,EAAU,OAAOA,CAAO,GAGtB,OAAOA,GAAY,SACrB,OAAO,KAGTC,EAAUA,GAAW,CAAC,EAEtB,IAAIC,EAAQ,KACZ,GAAI,CAACD,EAAQ,IACXC,EAAQF,EAAQ,MAAMJ,GAAGC,GAAE,MAAM,CAAC,MAC7B,CASL,IAAIM,EACJ,MAAQA,EAAOP,GAAGC,GAAE,SAAS,EAAE,KAAKG,CAAO,KACtC,CAACE,GAASA,EAAM,MAAQA,EAAM,CAAC,EAAE,SAAWF,EAAQ,UAEnD,CAACE,GACCC,EAAK,MAAQA,EAAK,CAAC,EAAE,SAAWD,EAAM,MAAQA,EAAM,CAAC,EAAE,UAC3DA,EAAQC,GAEVP,GAAGC,GAAE,SAAS,EAAE,UAAYM,EAAK,MAAQA,EAAK,CAAC,EAAE,OAASA,EAAK,CAAC,EAAE,OAGpEP,GAAGC,GAAE,SAAS,EAAE,UAAY,EAC9B,CAEA,OAAIK,IAAU,KACL,KAGFP,GAAM,GAAGO,EAAM,CAAC,CAAC,IAAIA,EAAM,CAAC,GAAK,GAAG,IAAIA,EAAM,CAAC,GAAK,GAAG,GAAID,CAAO,CAC3E,EA9Ce,UA+CfR,GAAO,QAAUK,KCnDjB,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cACAA,GAAO,QAAU,SAAUC,EAAS,CAClCA,EAAQ,UAAU,OAAO,QAAQ,EAAI,WAAa,CAChD,QAASC,EAAS,KAAK,KAAMA,EAAQA,EAASA,EAAO,KACnD,MAAMA,EAAO,KAEjB,CACF,ICPA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cACAA,GAAO,QAAUC,EAEjBA,EAAQ,KAAOC,EACfD,EAAQ,OAASA,EAEjB,SAASA,EAASE,EAAM,CACtB,IAAIC,EAAO,KASX,GARMA,aAAgBH,IACpBG,EAAO,IAAIH,GAGbG,EAAK,KAAO,KACZA,EAAK,KAAO,KACZA,EAAK,OAAS,EAEVD,GAAQ,OAAOA,EAAK,SAAY,WAClCA,EAAK,QAAQ,SAAUE,EAAM,CAC3BD,EAAK,KAAKC,CAAI,CAChB,CAAC,UACQ,UAAU,OAAS,EAC5B,QAASC,EAAI,EAAGC,EAAI,UAAU,OAAQD,EAAIC,EAAGD,IAC3CF,EAAK,KAAK,UAAUE,CAAC,CAAC,EAI1B,OAAOF,CACT,CArBSI,EAAAP,EAAA,WAuBTA,EAAQ,UAAU,WAAa,SAAUQ,EAAM,CAC7C,GAAIA,EAAK,OAAS,KAChB,MAAM,IAAI,MAAM,kDAAkD,EAGpE,IAAIC,EAAOD,EAAK,KACZE,EAAOF,EAAK,KAEhB,OAAIC,IACFA,EAAK,KAAOC,GAGVA,IACFA,EAAK,KAAOD,GAGVD,IAAS,KAAK,OAChB,KAAK,KAAOC,GAEVD,IAAS,KAAK,OAChB,KAAK,KAAOE,GAGdF,EAAK,KAAK,SACVA,EAAK,KAAO,KACZA,EAAK,KAAO,KACZA,EAAK,KAAO,KAELC,CACT,EAEAT,EAAQ,UAAU,YAAc,SAAUQ,EAAM,CAC9C,GAAIA,IAAS,KAAK,KAIlB,CAAIA,EAAK,MACPA,EAAK,KAAK,WAAWA,CAAI,EAG3B,IAAIG,EAAO,KAAK,KAChBH,EAAK,KAAO,KACZA,EAAK,KAAOG,EACRA,IACFA,EAAK,KAAOH,GAGd,KAAK,KAAOA,EACP,KAAK,OACR,KAAK,KAAOA,GAEd,KAAK,SACP,EAEAR,EAAQ,UAAU,SAAW,SAAUQ,EAAM,CAC3C,GAAIA,IAAS,KAAK,KAIlB,CAAIA,EAAK,MACPA,EAAK,KAAK,WAAWA,CAAI,EAG3B,IAAII,EAAO,KAAK,KAChBJ,EAAK,KAAO,KACZA,EAAK,KAAOI,EACRA,IACFA,EAAK,KAAOJ,GAGd,KAAK,KAAOA,EACP,KAAK,OACR,KAAK,KAAOA,GAEd,KAAK,SACP,EAEAR,EAAQ,UAAU,KAAO,UAAY,CACnC,QAASK,EAAI,EAAGC,EAAI,UAAU,OAAQD,EAAIC,EAAGD,IAC3CQ,GAAK,KAAM,UAAUR,CAAC,CAAC,EAEzB,OAAO,KAAK,MACd,EAEAL,EAAQ,UAAU,QAAU,UAAY,CACtC,QAASK,EAAI,EAAGC,EAAI,UAAU,OAAQD,EAAIC,EAAGD,IAC3CS,GAAQ,KAAM,UAAUT,CAAC,CAAC,EAE5B,OAAO,KAAK,MACd,EAEAL,EAAQ,UAAU,IAAM,UAAY,CAClC,GAAK,KAAK,KAIV,KAAIe,EAAM,KAAK,KAAK,MACpB,YAAK,KAAO,KAAK,KAAK,KAClB,KAAK,KACP,KAAK,KAAK,KAAO,KAEjB,KAAK,KAAO,KAEd,KAAK,SACEA,EACT,EAEAf,EAAQ,UAAU,MAAQ,UAAY,CACpC,GAAK,KAAK,KAIV,KAAIe,EAAM,KAAK,KAAK,MACpB,YAAK,KAAO,KAAK,KAAK,KAClB,KAAK,KACP,KAAK,KAAK,KAAO,KAEjB,KAAK,KAAO,KAEd,KAAK,SACEA,EACT,EAEAf,EAAQ,UAAU,QAAU,SAAUgB,EAAIC,EAAO,CAC/CA,EAAQA,GAAS,KACjB,QAASC,EAAS,KAAK,KAAMb,EAAI,EAAGa,IAAW,KAAMb,IACnDW,EAAG,KAAKC,EAAOC,EAAO,MAAOb,EAAG,IAAI,EACpCa,EAASA,EAAO,IAEpB,EAEAlB,EAAQ,UAAU,eAAiB,SAAUgB,EAAIC,EAAO,CACtDA,EAAQA,GAAS,KACjB,QAASC,EAAS,KAAK,KAAMb,EAAI,KAAK,OAAS,EAAGa,IAAW,KAAMb,IACjEW,EAAG,KAAKC,EAAOC,EAAO,MAAOb,EAAG,IAAI,EACpCa,EAASA,EAAO,IAEpB,EAEAlB,EAAQ,UAAU,IAAM,SAAUmB,EAAG,CACnC,QAASd,EAAI,EAAGa,EAAS,KAAK,KAAMA,IAAW,MAAQb,EAAIc,EAAGd,IAE5Da,EAASA,EAAO,KAElB,GAAIb,IAAMc,GAAKD,IAAW,KACxB,OAAOA,EAAO,KAElB,EAEAlB,EAAQ,UAAU,WAAa,SAAUmB,EAAG,CAC1C,QAASd,EAAI,EAAGa,EAAS,KAAK,KAAMA,IAAW,MAAQb,EAAIc,EAAGd,IAE5Da,EAASA,EAAO,KAElB,GAAIb,IAAMc,GAAKD,IAAW,KACxB,OAAOA,EAAO,KAElB,EAEAlB,EAAQ,UAAU,IAAM,SAAUgB,EAAIC,EAAO,CAC3CA,EAAQA,GAAS,KAEjB,QADIF,EAAM,IAAIf,EACLkB,EAAS,KAAK,KAAMA,IAAW,MACtCH,EAAI,KAAKC,EAAG,KAAKC,EAAOC,EAAO,MAAO,IAAI,CAAC,EAC3CA,EAASA,EAAO,KAElB,OAAOH,CACT,EAEAf,EAAQ,UAAU,WAAa,SAAUgB,EAAIC,EAAO,CAClDA,EAAQA,GAAS,KAEjB,QADIF,EAAM,IAAIf,EACLkB,EAAS,KAAK,KAAMA,IAAW,MACtCH,EAAI,KAAKC,EAAG,KAAKC,EAAOC,EAAO,MAAO,IAAI,CAAC,EAC3CA,EAASA,EAAO,KAElB,OAAOH,CACT,EAEAf,EAAQ,UAAU,OAAS,SAAUgB,EAAII,EAAS,CAChD,IAAIC,EACAH,EAAS,KAAK,KAClB,GAAI,UAAU,OAAS,EACrBG,EAAMD,UACG,KAAK,KACdF,EAAS,KAAK,KAAK,KACnBG,EAAM,KAAK,KAAK,UAEhB,OAAM,IAAI,UAAU,4CAA4C,EAGlE,QAAShB,EAAI,EAAGa,IAAW,KAAMb,IAC/BgB,EAAML,EAAGK,EAAKH,EAAO,MAAOb,CAAC,EAC7Ba,EAASA,EAAO,KAGlB,OAAOG,CACT,EAEArB,EAAQ,UAAU,cAAgB,SAAUgB,EAAII,EAAS,CACvD,IAAIC,EACAH,EAAS,KAAK,KAClB,GAAI,UAAU,OAAS,EACrBG,EAAMD,UACG,KAAK,KACdF,EAAS,KAAK,KAAK,KACnBG,EAAM,KAAK,KAAK,UAEhB,OAAM,IAAI,UAAU,4CAA4C,EAGlE,QAAShB,EAAI,KAAK,OAAS,EAAGa,IAAW,KAAMb,IAC7CgB,EAAML,EAAGK,EAAKH,EAAO,MAAOb,CAAC,EAC7Ba,EAASA,EAAO,KAGlB,OAAOG,CACT,EAEArB,EAAQ,UAAU,QAAU,UAAY,CAEtC,QADIsB,EAAM,IAAI,MAAM,KAAK,MAAM,EACtBjB,EAAI,EAAGa,EAAS,KAAK,KAAMA,IAAW,KAAMb,IACnDiB,EAAIjB,CAAC,EAAIa,EAAO,MAChBA,EAASA,EAAO,KAElB,OAAOI,CACT,EAEAtB,EAAQ,UAAU,eAAiB,UAAY,CAE7C,QADIsB,EAAM,IAAI,MAAM,KAAK,MAAM,EACtBjB,EAAI,EAAGa,EAAS,KAAK,KAAMA,IAAW,KAAMb,IACnDiB,EAAIjB,CAAC,EAAIa,EAAO,MAChBA,EAASA,EAAO,KAElB,OAAOI,CACT,EAEAtB,EAAQ,UAAU,MAAQ,SAAUuB,EAAMC,EAAI,CAC5CA,EAAKA,GAAM,KAAK,OACZA,EAAK,IACPA,GAAM,KAAK,QAEbD,EAAOA,GAAQ,EACXA,EAAO,IACTA,GAAQ,KAAK,QAEf,IAAIE,EAAM,IAAIzB,EACd,GAAIwB,EAAKD,GAAQC,EAAK,EACpB,OAAOC,EAELF,EAAO,IACTA,EAAO,GAELC,EAAK,KAAK,SACZA,EAAK,KAAK,QAEZ,QAASnB,EAAI,EAAGa,EAAS,KAAK,KAAMA,IAAW,MAAQb,EAAIkB,EAAMlB,IAC/Da,EAASA,EAAO,KAElB,KAAOA,IAAW,MAAQb,EAAImB,EAAInB,IAAKa,EAASA,EAAO,KACrDO,EAAI,KAAKP,EAAO,KAAK,EAEvB,OAAOO,CACT,EAEAzB,EAAQ,UAAU,aAAe,SAAUuB,EAAMC,EAAI,CACnDA,EAAKA,GAAM,KAAK,OACZA,EAAK,IACPA,GAAM,KAAK,QAEbD,EAAOA,GAAQ,EACXA,EAAO,IACTA,GAAQ,KAAK,QAEf,IAAIE,EAAM,IAAIzB,EACd,GAAIwB,EAAKD,GAAQC,EAAK,EACpB,OAAOC,EAELF,EAAO,IACTA,EAAO,GAELC,EAAK,KAAK,SACZA,EAAK,KAAK,QAEZ,QAASnB,EAAI,KAAK,OAAQa,EAAS,KAAK,KAAMA,IAAW,MAAQb,EAAImB,EAAInB,IACvEa,EAASA,EAAO,KAElB,KAAOA,IAAW,MAAQb,EAAIkB,EAAMlB,IAAKa,EAASA,EAAO,KACvDO,EAAI,KAAKP,EAAO,KAAK,EAEvB,OAAOO,CACT,EAEAzB,EAAQ,UAAU,OAAS,SAAU0B,EAAOC,KAAgBC,EAAO,CAC7DF,EAAQ,KAAK,SACfA,EAAQ,KAAK,OAAS,GAEpBA,EAAQ,IACVA,EAAQ,KAAK,OAASA,GAGxB,QAASrB,EAAI,EAAGa,EAAS,KAAK,KAAMA,IAAW,MAAQb,EAAIqB,EAAOrB,IAChEa,EAASA,EAAO,KAIlB,QADIO,EAAM,CAAC,EACFpB,EAAI,EAAGa,GAAUb,EAAIsB,EAAatB,IACzCoB,EAAI,KAAKP,EAAO,KAAK,EACrBA,EAAS,KAAK,WAAWA,CAAM,EAE7BA,IAAW,OACbA,EAAS,KAAK,MAGZA,IAAW,KAAK,MAAQA,IAAW,KAAK,OAC1CA,EAASA,EAAO,MAGlB,QAASb,EAAI,EAAGA,EAAIuB,EAAM,OAAQvB,IAChCa,EAASW,GAAO,KAAMX,EAAQU,EAAMvB,CAAC,CAAC,EAExC,OAAOoB,CACT,EAEAzB,EAAQ,UAAU,QAAU,UAAY,CAGtC,QAFIW,EAAO,KAAK,KACZC,EAAO,KAAK,KACPM,EAASP,EAAMO,IAAW,KAAMA,EAASA,EAAO,KAAM,CAC7D,IAAIY,EAAIZ,EAAO,KACfA,EAAO,KAAOA,EAAO,KACrBA,EAAO,KAAOY,CAChB,CACA,YAAK,KAAOlB,EACZ,KAAK,KAAOD,EACL,IACT,EAEA,SAASkB,GAAQ1B,EAAMK,EAAMuB,EAAO,CAClC,IAAIC,EAAWxB,IAASL,EAAK,KAC3B,IAAIF,EAAK8B,EAAO,KAAMvB,EAAML,CAAI,EAChC,IAAIF,EAAK8B,EAAOvB,EAAMA,EAAK,KAAML,CAAI,EAEvC,OAAI6B,EAAS,OAAS,OACpB7B,EAAK,KAAO6B,GAEVA,EAAS,OAAS,OACpB7B,EAAK,KAAO6B,GAGd7B,EAAK,SAEE6B,CACT,CAfSzB,EAAAsB,GAAA,UAiBT,SAAShB,GAAMV,EAAMC,EAAM,CACzBD,EAAK,KAAO,IAAIF,EAAKG,EAAMD,EAAK,KAAM,KAAMA,CAAI,EAC3CA,EAAK,OACRA,EAAK,KAAOA,EAAK,MAEnBA,EAAK,QACP,CANSI,EAAAM,GAAA,QAQT,SAASC,GAASX,EAAMC,EAAM,CAC5BD,EAAK,KAAO,IAAIF,EAAKG,EAAM,KAAMD,EAAK,KAAMA,CAAI,EAC3CA,EAAK,OACRA,EAAK,KAAOA,EAAK,MAEnBA,EAAK,QACP,CANSI,EAAAO,GAAA,WAQT,SAASb,EAAM8B,EAAOrB,EAAMD,EAAMP,EAAM,CACtC,GAAI,EAAE,gBAAgBD,GACpB,OAAO,IAAIA,EAAK8B,EAAOrB,EAAMD,EAAMP,CAAI,EAGzC,KAAK,KAAOA,EACZ,KAAK,MAAQ6B,EAETrB,GACFA,EAAK,KAAO,KACZ,KAAK,KAAOA,GAEZ,KAAK,KAAO,KAGVD,GACFA,EAAK,KAAO,KACZ,KAAK,KAAOA,GAEZ,KAAK,KAAO,IAEhB,CArBSF,EAAAN,EAAA,QAuBT,GAAI,CAEF,KAAyBD,CAAO,CAClC,MAAa,CAAC,ICzad,IAAAiC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAGA,IAAMC,GAAU,KAEVC,EAAM,OAAO,KAAK,EAClBC,EAAS,OAAO,QAAQ,EACxBC,EAAoB,OAAO,kBAAkB,EAC7CC,EAAc,OAAO,YAAY,EACjCC,EAAU,OAAO,QAAQ,EACzBC,EAAU,OAAO,SAAS,EAC1BC,GAAoB,OAAO,gBAAgB,EAC3CC,EAAW,OAAO,SAAS,EAC3BC,EAAQ,OAAO,OAAO,EACtBC,GAAoB,OAAO,gBAAgB,EAE3CC,GAAcC,EAAA,IAAM,EAAN,eAUdC,GAAN,KAAe,CA1Bf,MA0Be,CAAAD,EAAA,iBACb,YAAaE,EAAS,CAOpB,GANI,OAAOA,GAAY,WACrBA,EAAU,CAAE,IAAKA,CAAQ,GAEtBA,IACHA,EAAU,CAAC,GAETA,EAAQ,MAAQ,OAAOA,EAAQ,KAAQ,UAAYA,EAAQ,IAAM,GACnE,MAAM,IAAI,UAAU,mCAAmC,EAEzD,IAAMC,EAAM,KAAKd,CAAG,EAAIa,EAAQ,KAAO,IAEjCE,EAAKF,EAAQ,QAAUH,GAG7B,GAFA,KAAKR,CAAiB,EAAK,OAAOa,GAAO,WAAcL,GAAcK,EACrE,KAAKZ,CAAW,EAAIU,EAAQ,OAAS,GACjCA,EAAQ,QAAU,OAAOA,EAAQ,QAAW,SAC9C,MAAM,IAAI,UAAU,yBAAyB,EAC/C,KAAKT,CAAO,EAAIS,EAAQ,QAAU,EAClC,KAAKR,CAAO,EAAIQ,EAAQ,QACxB,KAAKP,EAAiB,EAAIO,EAAQ,gBAAkB,GACpD,KAAKJ,EAAiB,EAAII,EAAQ,gBAAkB,GACpD,KAAK,MAAM,CACb,CAGA,IAAI,IAAKG,EAAI,CACX,GAAI,OAAOA,GAAO,UAAYA,EAAK,EACjC,MAAM,IAAI,UAAU,mCAAmC,EAEzD,KAAKhB,CAAG,EAAIgB,GAAM,IAClBC,EAAK,IAAI,CACX,CACA,IAAI,KAAO,CACT,OAAO,KAAKjB,CAAG,CACjB,CAEA,IAAI,WAAYkB,EAAY,CAC1B,KAAKf,CAAW,EAAI,CAAC,CAACe,CACxB,CACA,IAAI,YAAc,CAChB,OAAO,KAAKf,CAAW,CACzB,CAEA,IAAI,OAAQgB,EAAI,CACd,GAAI,OAAOA,GAAO,SAChB,MAAM,IAAI,UAAU,sCAAsC,EAE5D,KAAKf,CAAO,EAAIe,EAChBF,EAAK,IAAI,CACX,CACA,IAAI,QAAU,CACZ,OAAO,KAAKb,CAAO,CACrB,CAGA,IAAI,iBAAkBgB,EAAI,CACpB,OAAOA,GAAO,aAChBA,EAAKV,IAEHU,IAAO,KAAKlB,CAAiB,IAC/B,KAAKA,CAAiB,EAAIkB,EAC1B,KAAKnB,CAAM,EAAI,EACf,KAAKM,CAAQ,EAAE,QAAQc,GAAO,CAC5BA,EAAI,OAAS,KAAKnB,CAAiB,EAAEmB,EAAI,MAAOA,EAAI,GAAG,EACvD,KAAKpB,CAAM,GAAKoB,EAAI,MACtB,CAAC,GAEHJ,EAAK,IAAI,CACX,CACA,IAAI,kBAAoB,CAAE,OAAO,KAAKf,CAAiB,CAAE,CAEzD,IAAI,QAAU,CAAE,OAAO,KAAKD,CAAM,CAAE,CACpC,IAAI,WAAa,CAAE,OAAO,KAAKM,CAAQ,EAAE,MAAO,CAEhD,SAAUe,EAAIC,EAAO,CACnBA,EAAQA,GAAS,KACjB,QAASC,EAAS,KAAKjB,CAAQ,EAAE,KAAMiB,IAAW,MAAO,CACvD,IAAMC,EAAOD,EAAO,KACpBE,GAAY,KAAMJ,EAAIE,EAAQD,CAAK,EACnCC,EAASC,CACX,CACF,CAEA,QAASH,EAAIC,EAAO,CAClBA,EAAQA,GAAS,KACjB,QAASC,EAAS,KAAKjB,CAAQ,EAAE,KAAMiB,IAAW,MAAO,CACvD,IAAMG,EAAOH,EAAO,KACpBE,GAAY,KAAMJ,EAAIE,EAAQD,CAAK,EACnCC,EAASG,CACX,CACF,CAEA,MAAQ,CACN,OAAO,KAAKpB,CAAQ,EAAE,QAAQ,EAAE,IAAIqB,GAAKA,EAAE,GAAG,CAChD,CAEA,QAAU,CACR,OAAO,KAAKrB,CAAQ,EAAE,QAAQ,EAAE,IAAIqB,GAAKA,EAAE,KAAK,CAClD,CAEA,OAAS,CACH,KAAKvB,CAAO,GACZ,KAAKE,CAAQ,GACb,KAAKA,CAAQ,EAAE,QACjB,KAAKA,CAAQ,EAAE,QAAQc,GAAO,KAAKhB,CAAO,EAAEgB,EAAI,IAAKA,EAAI,KAAK,CAAC,EAGjE,KAAKb,CAAK,EAAI,IAAI,IAClB,KAAKD,CAAQ,EAAI,IAAIR,GACrB,KAAKE,CAAM,EAAI,CACjB,CAEA,MAAQ,CACN,OAAO,KAAKM,CAAQ,EAAE,IAAIc,GACxBQ,GAAQ,KAAMR,CAAG,EAAI,GAAQ,CAC3B,EAAGA,EAAI,IACP,EAAGA,EAAI,MACP,EAAGA,EAAI,KAAOA,EAAI,QAAU,EAC9B,CAAC,EAAE,QAAQ,EAAE,OAAOS,GAAKA,CAAC,CAC9B,CAEA,SAAW,CACT,OAAO,KAAKvB,CAAQ,CACtB,CAEA,IAAKwB,EAAKC,EAAOC,EAAQ,CAGvB,GAFAA,EAASA,GAAU,KAAK7B,CAAO,EAE3B6B,GAAU,OAAOA,GAAW,SAC9B,MAAM,IAAI,UAAU,yBAAyB,EAE/C,IAAMC,EAAMD,EAAS,KAAK,IAAI,EAAI,EAC5BE,EAAM,KAAKjC,CAAiB,EAAE8B,EAAOD,CAAG,EAE9C,GAAI,KAAKvB,CAAK,EAAE,IAAIuB,CAAG,EAAG,CACxB,GAAII,EAAM,KAAKnC,CAAG,EAChB,OAAAoC,EAAI,KAAM,KAAK5B,CAAK,EAAE,IAAIuB,CAAG,CAAC,EACvB,GAIT,IAAMM,EADO,KAAK7B,CAAK,EAAE,IAAIuB,CAAG,EACd,MAIlB,OAAI,KAAK1B,CAAO,IACT,KAAKC,EAAiB,GACzB,KAAKD,CAAO,EAAE0B,EAAKM,EAAK,KAAK,GAGjCA,EAAK,IAAMH,EACXG,EAAK,OAASJ,EACdI,EAAK,MAAQL,EACb,KAAK/B,CAAM,GAAKkC,EAAME,EAAK,OAC3BA,EAAK,OAASF,EACd,KAAK,IAAIJ,CAAG,EACZd,EAAK,IAAI,EACF,EACT,CAEA,IAAMI,EAAM,IAAIiB,GAAMP,EAAKC,EAAOG,EAAKD,EAAKD,CAAM,EAGlD,OAAIZ,EAAI,OAAS,KAAKrB,CAAG,GACnB,KAAKK,CAAO,GACd,KAAKA,CAAO,EAAE0B,EAAKC,CAAK,EAEnB,KAGT,KAAK/B,CAAM,GAAKoB,EAAI,OACpB,KAAKd,CAAQ,EAAE,QAAQc,CAAG,EAC1B,KAAKb,CAAK,EAAE,IAAIuB,EAAK,KAAKxB,CAAQ,EAAE,IAAI,EACxCU,EAAK,IAAI,EACF,GACT,CAEA,IAAKc,EAAK,CACR,GAAI,CAAC,KAAKvB,CAAK,EAAE,IAAIuB,CAAG,EAAG,MAAO,GAClC,IAAMV,EAAM,KAAKb,CAAK,EAAE,IAAIuB,CAAG,EAAE,MACjC,MAAO,CAACF,GAAQ,KAAMR,CAAG,CAC3B,CAEA,IAAKU,EAAK,CACR,OAAOQ,GAAI,KAAMR,EAAK,EAAI,CAC5B,CAEA,KAAMA,EAAK,CACT,OAAOQ,GAAI,KAAMR,EAAK,EAAK,CAC7B,CAEA,KAAO,CACL,IAAMS,EAAO,KAAKjC,CAAQ,EAAE,KAC5B,OAAKiC,GAGLJ,EAAI,KAAMI,CAAI,EACPA,EAAK,OAHH,IAIX,CAEA,IAAKT,EAAK,CACRK,EAAI,KAAM,KAAK5B,CAAK,EAAE,IAAIuB,CAAG,CAAC,CAChC,CAEA,KAAMU,EAAK,CAET,KAAK,MAAM,EAEX,IAAMP,EAAM,KAAK,IAAI,EAErB,QAASQ,EAAID,EAAI,OAAS,EAAGC,GAAK,EAAGA,IAAK,CACxC,IAAMrB,EAAMoB,EAAIC,CAAC,EACXC,EAAYtB,EAAI,GAAK,EAC3B,GAAIsB,IAAc,EAEhB,KAAK,IAAItB,EAAI,EAAGA,EAAI,CAAC,MAClB,CACH,IAAMY,EAASU,EAAYT,EAEvBD,EAAS,GACX,KAAK,IAAIZ,EAAI,EAAGA,EAAI,EAAGY,CAAM,CAEjC,CACF,CACF,CAEA,OAAS,CACP,KAAKzB,CAAK,EAAE,QAAQ,CAACwB,EAAOD,IAAQQ,GAAI,KAAMR,EAAK,EAAK,CAAC,CAC3D,CACF,EAEMQ,GAAM5B,EAAA,CAACiC,EAAMb,EAAKc,IAAU,CAChC,IAAML,EAAOI,EAAKpC,CAAK,EAAE,IAAIuB,CAAG,EAChC,GAAIS,EAAM,CACR,IAAMnB,EAAMmB,EAAK,MACjB,GAAIX,GAAQe,EAAMvB,CAAG,GAEnB,GADAe,EAAIQ,EAAMJ,CAAI,EACV,CAACI,EAAKzC,CAAW,EACnB,YAEE0C,IACED,EAAKnC,EAAiB,IACxB+B,EAAK,MAAM,IAAM,KAAK,IAAI,GAC5BI,EAAKrC,CAAQ,EAAE,YAAYiC,CAAI,GAGnC,OAAOnB,EAAI,KACb,CACF,EAjBY,OAmBNQ,GAAUlB,EAAA,CAACiC,EAAMvB,IAAQ,CAC7B,GAAI,CAACA,GAAQ,CAACA,EAAI,QAAU,CAACuB,EAAKxC,CAAO,EACvC,MAAO,GAET,IAAM0C,EAAO,KAAK,IAAI,EAAIzB,EAAI,IAC9B,OAAOA,EAAI,OAASyB,EAAOzB,EAAI,OAC3BuB,EAAKxC,CAAO,GAAM0C,EAAOF,EAAKxC,CAAO,CAC3C,EAPgB,WASVa,EAAON,EAAAiC,GAAQ,CACnB,GAAIA,EAAK3C,CAAM,EAAI2C,EAAK5C,CAAG,EACzB,QAASwB,EAASoB,EAAKrC,CAAQ,EAAE,KAC/BqC,EAAK3C,CAAM,EAAI2C,EAAK5C,CAAG,GAAKwB,IAAW,MAAO,CAI9C,IAAMC,EAAOD,EAAO,KACpBY,EAAIQ,EAAMpB,CAAM,EAChBA,EAASC,CACX,CAEJ,EAZa,QAcPW,EAAMzB,EAAA,CAACiC,EAAMJ,IAAS,CAC1B,GAAIA,EAAM,CACR,IAAMnB,EAAMmB,EAAK,MACbI,EAAKvC,CAAO,GACduC,EAAKvC,CAAO,EAAEgB,EAAI,IAAKA,EAAI,KAAK,EAElCuB,EAAK3C,CAAM,GAAKoB,EAAI,OACpBuB,EAAKpC,CAAK,EAAE,OAAOa,EAAI,GAAG,EAC1BuB,EAAKrC,CAAQ,EAAE,WAAWiC,CAAI,CAChC,CACF,EAVY,OAYNF,GAAN,KAAY,CAxTZ,MAwTY,CAAA3B,EAAA,cACV,YAAaoB,EAAKC,EAAOe,EAAQb,EAAKD,EAAQ,CAC5C,KAAK,IAAMF,EACX,KAAK,MAAQC,EACb,KAAK,OAASe,EACd,KAAK,IAAMb,EACX,KAAK,OAASD,GAAU,CAC1B,CACF,EAEMP,GAAcf,EAAA,CAACiC,EAAMtB,EAAIkB,EAAMjB,IAAU,CAC7C,IAAIF,EAAMmB,EAAK,MACXX,GAAQe,EAAMvB,CAAG,IACnBe,EAAIQ,EAAMJ,CAAI,EACTI,EAAKzC,CAAW,IACnBkB,EAAM,SAENA,GACFC,EAAG,KAAKC,EAAOF,EAAI,MAAOA,EAAI,IAAKuB,CAAI,CAC3C,EAToB,eAWpB9C,GAAO,QAAUc,KC7UjB,IAAAoC,EAAAC,EAAA,CAAAC,GAAAC,KAAA,CACA,IAAMC,GAAN,MAAMC,CAAM,CADZ,MACY,CAAAC,EAAA,cACV,YAAaC,EAAOC,EAAS,CAG3B,GAFAA,EAAUC,GAAaD,CAAO,EAE1BD,aAAiBF,EACnB,OACEE,EAAM,QAAU,CAAC,CAACC,EAAQ,OAC1BD,EAAM,oBAAsB,CAAC,CAACC,EAAQ,kBAE/BD,EAEA,IAAIF,EAAME,EAAM,IAAKC,CAAO,EAIvC,GAAID,aAAiBG,GAEnB,YAAK,IAAMH,EAAM,MACjB,KAAK,IAAM,CAAC,CAACA,CAAK,CAAC,EACnB,KAAK,OAAO,EACL,KAyBT,GAtBA,KAAK,QAAUC,EACf,KAAK,MAAQ,CAAC,CAACA,EAAQ,MACvB,KAAK,kBAAoB,CAAC,CAACA,EAAQ,kBAKnC,KAAK,IAAMD,EACR,KAAK,EACL,MAAM,KAAK,EACX,KAAK,GAAG,EAGX,KAAK,IAAM,KAAK,IACb,MAAM,IAAI,EAEV,IAAII,GAAK,KAAK,WAAWA,EAAE,KAAK,CAAC,CAAC,EAIlC,OAAOC,GAAKA,EAAE,MAAM,EAEnB,CAAC,KAAK,IAAI,OACZ,MAAM,IAAI,UAAU,yBAAyB,KAAK,GAAG,EAAE,EAIzD,GAAI,KAAK,IAAI,OAAS,EAAG,CAEvB,IAAMC,EAAQ,KAAK,IAAI,CAAC,EAExB,GADA,KAAK,IAAM,KAAK,IAAI,OAAOD,GAAK,CAACE,GAAUF,EAAE,CAAC,CAAC,CAAC,EAC5C,KAAK,IAAI,SAAW,EACtB,KAAK,IAAM,CAACC,CAAK,UACR,KAAK,IAAI,OAAS,GAE3B,QAAWD,KAAK,KAAK,IACnB,GAAIA,EAAE,SAAW,GAAKG,GAAMH,EAAE,CAAC,CAAC,EAAG,CACjC,KAAK,IAAM,CAACA,CAAC,EACb,KACF,EAGN,CAEA,KAAK,OAAO,CACd,CAEA,QAAU,CACR,YAAK,MAAQ,KAAK,IACf,IAAKI,GAAUA,EAAM,KAAK,GAAG,EAAE,KAAK,CAAC,EACrC,KAAK,IAAI,EACT,KAAK,EACD,KAAK,KACd,CAEA,UAAY,CACV,OAAO,KAAK,KACd,CAEA,WAAYT,EAAO,CAMjB,IAAMU,IAFH,KAAK,QAAQ,mBAAqBC,KAClC,KAAK,QAAQ,OAASC,KACE,IAAMZ,EAC3Ba,EAASC,GAAM,IAAIJ,CAAO,EAChC,GAAIG,EACF,OAAOA,EAGT,IAAME,EAAQ,KAAK,QAAQ,MAErBC,EAAKD,EAAQE,EAAGC,EAAE,gBAAgB,EAAID,EAAGC,EAAE,WAAW,EAC5DlB,EAAQA,EAAM,QAAQgB,EAAIG,GAAc,KAAK,QAAQ,iBAAiB,CAAC,EACvEC,EAAM,iBAAkBpB,CAAK,EAG7BA,EAAQA,EAAM,QAAQiB,EAAGC,EAAE,cAAc,EAAGG,EAAqB,EACjED,EAAM,kBAAmBpB,CAAK,EAG9BA,EAAQA,EAAM,QAAQiB,EAAGC,EAAE,SAAS,EAAGI,EAAgB,EACvDF,EAAM,aAAcpB,CAAK,EAGzBA,EAAQA,EAAM,QAAQiB,EAAGC,EAAE,SAAS,EAAGK,EAAgB,EACvDH,EAAM,aAAcpB,CAAK,EAKzB,IAAIwB,EAAYxB,EACb,MAAM,GAAG,EACT,IAAIyB,GAAQC,GAAgBD,EAAM,KAAK,OAAO,CAAC,EAC/C,KAAK,GAAG,EACR,MAAM,KAAK,EAEX,IAAIA,GAAQE,GAAYF,EAAM,KAAK,OAAO,CAAC,EAE1CV,IAEFS,EAAYA,EAAU,OAAOC,IAC3BL,EAAM,uBAAwBK,EAAM,KAAK,OAAO,EACzC,CAAC,CAACA,EAAK,MAAMR,EAAGC,EAAE,eAAe,CAAC,EAC1C,GAEHE,EAAM,aAAcI,CAAS,EAK7B,IAAMI,EAAW,IAAI,IACfC,EAAcL,EAAU,IAAIC,GAAQ,IAAItB,GAAWsB,EAAM,KAAK,OAAO,CAAC,EAC5E,QAAWA,KAAQI,EAAa,CAC9B,GAAItB,GAAUkB,CAAI,EAChB,MAAO,CAACA,CAAI,EAEdG,EAAS,IAAIH,EAAK,MAAOA,CAAI,CAC/B,CACIG,EAAS,KAAO,GAAKA,EAAS,IAAI,EAAE,GACtCA,EAAS,OAAO,EAAE,EAGpB,IAAME,EAAS,CAAC,GAAGF,EAAS,OAAO,CAAC,EACpC,OAAAd,GAAM,IAAIJ,EAASoB,CAAM,EAClBA,CACT,CAEA,WAAY9B,EAAOC,EAAS,CAC1B,GAAI,EAAED,aAAiBF,GACrB,MAAM,IAAI,UAAU,qBAAqB,EAG3C,OAAO,KAAK,IAAI,KAAMiC,GAElBC,GAAcD,EAAiB9B,CAAO,GACtCD,EAAM,IAAI,KAAMiC,GAEZD,GAAcC,EAAkBhC,CAAO,GACvC8B,EAAgB,MAAOG,GACdD,EAAiB,MAAOE,GACtBD,EAAe,WAAWC,EAAiBlC,CAAO,CAC1D,CACF,CAEJ,CAEJ,CACH,CAGA,KAAMmC,EAAS,CACb,GAAI,CAACA,EACH,MAAO,GAGT,GAAI,OAAOA,GAAY,SACrB,GAAI,CACFA,EAAU,IAAIC,GAAOD,EAAS,KAAK,OAAO,CAC5C,MAAa,CACX,MAAO,EACT,CAGF,QAASE,EAAI,EAAGA,EAAI,KAAK,IAAI,OAAQA,IACnC,GAAIC,GAAQ,KAAK,IAAID,CAAC,EAAGF,EAAS,KAAK,OAAO,EAC5C,MAAO,GAGX,MAAO,EACT,CACF,EAEAxC,GAAO,QAAUC,GAEjB,IAAM2C,GAAM,KACN1B,GAAQ,IAAI0B,GAAI,CAAE,IAAK,GAAK,CAAC,EAE7BtC,GAAe,KACfC,GAAa,IACbiB,EAAQ,IACRiB,GAAS,IACT,CACJ,OAAQpB,EACR,EAAAC,EACA,sBAAAG,GACA,iBAAAC,GACA,iBAAAC,EACF,EAAI,IACE,CAAE,wBAAAZ,GAAyB,WAAAC,EAAW,EAAI,IAE1CL,GAAYR,EAAAM,GAAKA,EAAE,QAAU,WAAjB,aACZG,GAAQT,EAAAM,GAAKA,EAAE,QAAU,GAAjB,SAIR2B,GAAgBjC,EAAA,CAAC8B,EAAa5B,IAAY,CAC9C,IAAI6B,EAAS,GACPW,EAAuBZ,EAAY,MAAM,EAC3Ca,EAAiBD,EAAqB,IAAI,EAE9C,KAAOX,GAAUW,EAAqB,QACpCX,EAASW,EAAqB,MAAOE,GAC5BD,EAAe,WAAWC,EAAiB1C,CAAO,CAC1D,EAEDyC,EAAiBD,EAAqB,IAAI,EAG5C,OAAOX,CACT,EAdsB,iBAmBhBJ,GAAkB3B,EAAA,CAAC0B,EAAMxB,KAC7BmB,EAAM,OAAQK,EAAMxB,CAAO,EAC3BwB,EAAOmB,GAAcnB,EAAMxB,CAAO,EAClCmB,EAAM,QAASK,CAAI,EACnBA,EAAOoB,GAAcpB,EAAMxB,CAAO,EAClCmB,EAAM,SAAUK,CAAI,EACpBA,EAAOqB,GAAerB,EAAMxB,CAAO,EACnCmB,EAAM,SAAUK,CAAI,EACpBA,EAAOsB,GAAatB,EAAMxB,CAAO,EACjCmB,EAAM,QAASK,CAAI,EACZA,GAVe,mBAalBuB,EAAMjD,EAAAkD,GAAM,CAACA,GAAMA,EAAG,YAAY,IAAM,KAAOA,IAAO,IAAhD,OASNJ,GAAgB9C,EAAA,CAAC0B,EAAMxB,IACpBwB,EACJ,KAAK,EACL,MAAM,KAAK,EACX,IAAKpB,GAAM6C,GAAa7C,EAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,EALS,iBAQhBiD,GAAenD,EAAA,CAAC0B,EAAMxB,IAAY,CACtC,IAAM,EAAIA,EAAQ,MAAQgB,EAAGC,EAAE,UAAU,EAAID,EAAGC,EAAE,KAAK,EACvD,OAAOO,EAAK,QAAQ,EAAG,CAAC0B,EAAGC,EAAGC,EAAGC,EAAGC,IAAO,CACzCnC,EAAM,QAASK,EAAM0B,EAAGC,EAAGC,EAAGC,EAAGC,CAAE,EACnC,IAAIC,EAEJ,OAAIR,EAAII,CAAC,EACPI,EAAM,GACGR,EAAIK,CAAC,EACdG,EAAM,KAAKJ,CAAC,SAAS,CAACA,EAAI,CAAC,SAClBJ,EAAIM,CAAC,EAEdE,EAAM,KAAKJ,CAAC,IAAIC,CAAC,OAAOD,CAAC,IAAI,CAACC,EAAI,CAAC,OAC1BE,GACTnC,EAAM,kBAAmBmC,CAAE,EAC3BC,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAC1B,KAAKH,CAAC,IAAI,CAACC,EAAI,CAAC,QAGhBG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CACrB,KAAKF,CAAC,IAAI,CAACC,EAAI,CAAC,OAGlBjC,EAAM,eAAgBoC,CAAG,EAClBA,CACT,CAAC,CACH,EA1BqB,gBAoCfZ,GAAgB7C,EAAA,CAAC0B,EAAMxB,IACpBwB,EACJ,KAAK,EACL,MAAM,KAAK,EACX,IAAKpB,GAAMoD,GAAapD,EAAGJ,CAAO,CAAC,EACnC,KAAK,GAAG,EALS,iBAQhBwD,GAAe1D,EAAA,CAAC0B,EAAMxB,IAAY,CACtCmB,EAAM,QAASK,EAAMxB,CAAO,EAC5B,IAAM,EAAIA,EAAQ,MAAQgB,EAAGC,EAAE,UAAU,EAAID,EAAGC,EAAE,KAAK,EACjDwC,EAAIzD,EAAQ,kBAAoB,KAAO,GAC7C,OAAOwB,EAAK,QAAQ,EAAG,CAAC0B,EAAGC,EAAGC,EAAGC,EAAGC,IAAO,CACzCnC,EAAM,QAASK,EAAM0B,EAAGC,EAAGC,EAAGC,EAAGC,CAAE,EACnC,IAAIC,EAEJ,OAAIR,EAAII,CAAC,EACPI,EAAM,GACGR,EAAIK,CAAC,EACdG,EAAM,KAAKJ,CAAC,OAAOM,CAAC,KAAK,CAACN,EAAI,CAAC,SACtBJ,EAAIM,CAAC,EACVF,IAAM,IACRI,EAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAKN,CAAC,IAAI,CAACC,EAAI,CAAC,OAEvCG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKK,CAAC,KAAK,CAACN,EAAI,CAAC,SAE3BG,GACTnC,EAAM,kBAAmBmC,CAAE,EACvBH,IAAM,IACJC,IAAM,IACRG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAC1B,KAAKH,CAAC,IAAIC,CAAC,IAAI,CAACC,EAAI,CAAC,KAErBE,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAC1B,KAAKH,CAAC,IAAI,CAACC,EAAI,CAAC,OAGlBG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CAAC,IAAIC,CAC1B,KAAK,CAACH,EAAI,CAAC,WAGbhC,EAAM,OAAO,EACTgC,IAAM,IACJC,IAAM,IACRG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CACrB,GAAGI,CAAC,KAAKN,CAAC,IAAIC,CAAC,IAAI,CAACC,EAAI,CAAC,KAEzBE,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CACrB,GAAGI,CAAC,KAAKN,CAAC,IAAI,CAACC,EAAI,CAAC,OAGtBG,EAAM,KAAKJ,CAAC,IAAIC,CAAC,IAAIC,CACrB,KAAK,CAACF,EAAI,CAAC,UAIfhC,EAAM,eAAgBoC,CAAG,EAClBA,CACT,CAAC,CACH,EAnDqB,gBAqDfV,GAAiB/C,EAAA,CAAC0B,EAAMxB,KAC5BmB,EAAM,iBAAkBK,EAAMxB,CAAO,EAC9BwB,EACJ,MAAM,KAAK,EACX,IAAKpB,GAAMsD,GAActD,EAAGJ,CAAO,CAAC,EACpC,KAAK,GAAG,GALU,kBAQjB0D,GAAgB5D,EAAA,CAAC0B,EAAMxB,IAAY,CACvCwB,EAAOA,EAAK,KAAK,EACjB,IAAM,EAAIxB,EAAQ,MAAQgB,EAAGC,EAAE,WAAW,EAAID,EAAGC,EAAE,MAAM,EACzD,OAAOO,EAAK,QAAQ,EAAG,CAAC+B,EAAKI,EAAMR,EAAGC,EAAGC,EAAGC,IAAO,CACjDnC,EAAM,SAAUK,EAAM+B,EAAKI,EAAMR,EAAGC,EAAGC,EAAGC,CAAE,EAC5C,IAAMM,EAAKb,EAAII,CAAC,EACVU,EAAKD,GAAMb,EAAIK,CAAC,EAChBU,EAAKD,GAAMd,EAAIM,CAAC,EAChBU,EAAOD,EAEb,OAAIH,IAAS,KAAOI,IAClBJ,EAAO,IAKTL,EAAKtD,EAAQ,kBAAoB,KAAO,GAEpC4D,EACED,IAAS,KAAOA,IAAS,IAE3BJ,EAAM,WAGNA,EAAM,IAECI,GAAQI,GAGbF,IACFT,EAAI,GAENC,EAAI,EAEAM,IAAS,KAGXA,EAAO,KACHE,GACFV,EAAI,CAACA,EAAI,EACTC,EAAI,EACJC,EAAI,IAEJD,EAAI,CAACA,EAAI,EACTC,EAAI,IAEGM,IAAS,OAGlBA,EAAO,IACHE,EACFV,EAAI,CAACA,EAAI,EAETC,EAAI,CAACA,EAAI,GAITO,IAAS,MACXL,EAAK,MAGPC,EAAM,GAAGI,EAAOR,CAAC,IAAIC,CAAC,IAAIC,CAAC,GAAGC,CAAE,IACvBO,EACTN,EAAM,KAAKJ,CAAC,OAAOG,CAAE,KAAK,CAACH,EAAI,CAAC,SACvBW,IACTP,EAAM,KAAKJ,CAAC,IAAIC,CAAC,KAAKE,CACtB,KAAKH,CAAC,IAAI,CAACC,EAAI,CAAC,QAGlBjC,EAAM,gBAAiBoC,CAAG,EAEnBA,CACT,CAAC,CACH,EAzEsB,iBA6EhBT,GAAehD,EAAA,CAAC0B,EAAMxB,KAC1BmB,EAAM,eAAgBK,EAAMxB,CAAO,EAE5BwB,EACJ,KAAK,EACL,QAAQR,EAAGC,EAAE,IAAI,EAAG,EAAE,GALN,gBAQfS,GAAc5B,EAAA,CAAC0B,EAAMxB,KACzBmB,EAAM,cAAeK,EAAMxB,CAAO,EAC3BwB,EACJ,KAAK,EACL,QAAQR,EAAGhB,EAAQ,kBAAoBiB,EAAE,QAAUA,EAAE,IAAI,EAAG,EAAE,GAJ/C,eAYdC,GAAgBpB,EAAAkE,GAAS,CAACC,EAC9BC,EAAMC,EAAIC,EAAIC,EAAIC,EAAKC,EACvBC,EAAIC,EAAIC,EAAIC,EAAIC,EAAKC,KACjB9B,EAAIoB,CAAE,EACRD,EAAO,GACEnB,EAAIqB,CAAE,EACfF,EAAO,KAAKC,CAAE,OAAOH,EAAQ,KAAO,EAAE,GAC7BjB,EAAIsB,CAAE,EACfH,EAAO,KAAKC,CAAE,IAAIC,CAAE,KAAKJ,EAAQ,KAAO,EAAE,GACjCM,EACTJ,EAAO,KAAKA,CAAI,GAEhBA,EAAO,KAAKA,CAAI,GAAGF,EAAQ,KAAO,EAAE,GAGlCjB,EAAI0B,CAAE,EACRD,EAAK,GACIzB,EAAI2B,CAAE,EACfF,EAAK,IAAI,CAACC,EAAK,CAAC,SACP1B,EAAI4B,CAAE,EACfH,EAAK,IAAIC,CAAE,IAAI,CAACC,EAAK,CAAC,OACbE,EACTJ,EAAK,KAAKC,CAAE,IAAIC,CAAE,IAAIC,CAAE,IAAIC,CAAG,GACtBZ,EACTQ,EAAK,IAAIC,CAAE,IAAIC,CAAE,IAAI,CAACC,EAAK,CAAC,KAE5BH,EAAK,KAAKA,CAAE,GAGP,GAAGN,CAAI,IAAIM,CAAE,GAAG,KAAK,GA7BR,iBAgChBlC,GAAUxC,EAAA,CAACgF,EAAK3C,EAASnC,IAAY,CACzC,QAASqC,EAAI,EAAGA,EAAIyC,EAAI,OAAQzC,IAC9B,GAAI,CAACyC,EAAIzC,CAAC,EAAE,KAAKF,CAAO,EACtB,MAAO,GAIX,GAAIA,EAAQ,WAAW,QAAU,CAACnC,EAAQ,kBAAmB,CAM3D,QAASqC,EAAI,EAAGA,EAAIyC,EAAI,OAAQzC,IAE9B,GADAlB,EAAM2D,EAAIzC,CAAC,EAAE,MAAM,EACfyC,EAAIzC,CAAC,EAAE,SAAWnC,GAAW,KAI7B4E,EAAIzC,CAAC,EAAE,OAAO,WAAW,OAAS,EAAG,CACvC,IAAM0C,EAAUD,EAAIzC,CAAC,EAAE,OACvB,GAAI0C,EAAQ,QAAU5C,EAAQ,OAC1B4C,EAAQ,QAAU5C,EAAQ,OAC1B4C,EAAQ,QAAU5C,EAAQ,MAC5B,MAAO,EAEX,CAIF,MAAO,EACT,CAEA,MAAO,EACT,EAlCgB,aCxfhB,IAAA6C,EAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAM,OAAO,YAAY,EAEzBC,GAAN,MAAMC,CAAW,CAFjB,MAEiB,CAAAC,EAAA,mBACf,WAAW,KAAO,CAChB,OAAOH,EACT,CAEA,YAAaI,EAAMC,EAAS,CAG1B,GAFAA,EAAUC,GAAaD,CAAO,EAE1BD,aAAgBF,EAAY,CAC9B,GAAIE,EAAK,QAAU,CAAC,CAACC,EAAQ,MAC3B,OAAOD,EAEPA,EAAOA,EAAK,KAEhB,CAEAA,EAAOA,EAAK,KAAK,EAAE,MAAM,KAAK,EAAE,KAAK,GAAG,EACxCG,GAAM,aAAcH,EAAMC,CAAO,EACjC,KAAK,QAAUA,EACf,KAAK,MAAQ,CAAC,CAACA,EAAQ,MACvB,KAAK,MAAMD,CAAI,EAEX,KAAK,SAAWJ,GAClB,KAAK,MAAQ,GAEb,KAAK,MAAQ,KAAK,SAAW,KAAK,OAAO,QAG3CO,GAAM,OAAQ,IAAI,CACpB,CAEA,MAAOH,EAAM,CACX,IAAM,EAAI,KAAK,QAAQ,MAAQI,GAAGC,GAAE,eAAe,EAAID,GAAGC,GAAE,UAAU,EAChEC,EAAIN,EAAK,MAAM,CAAC,EAEtB,GAAI,CAACM,EACH,MAAM,IAAI,UAAU,uBAAuBN,CAAI,EAAE,EAGnD,KAAK,SAAWM,EAAE,CAAC,IAAM,OAAYA,EAAE,CAAC,EAAI,GACxC,KAAK,WAAa,MACpB,KAAK,SAAW,IAIbA,EAAE,CAAC,EAGN,KAAK,OAAS,IAAIC,GAAOD,EAAE,CAAC,EAAG,KAAK,QAAQ,KAAK,EAFjD,KAAK,OAASV,EAIlB,CAEA,UAAY,CACV,OAAO,KAAK,KACd,CAEA,KAAMY,EAAS,CAGb,GAFAL,GAAM,kBAAmBK,EAAS,KAAK,QAAQ,KAAK,EAEhD,KAAK,SAAWZ,IAAOY,IAAYZ,GACrC,MAAO,GAGT,GAAI,OAAOY,GAAY,SACrB,GAAI,CACFA,EAAU,IAAID,GAAOC,EAAS,KAAK,OAAO,CAC5C,MAAa,CACX,MAAO,EACT,CAGF,OAAOC,GAAID,EAAS,KAAK,SAAU,KAAK,OAAQ,KAAK,OAAO,CAC9D,CAEA,WAAYR,EAAMC,EAAS,CACzB,GAAI,EAAED,aAAgBF,GACpB,MAAM,IAAI,UAAU,0BAA0B,EAGhD,OAAI,KAAK,WAAa,GAChB,KAAK,QAAU,GACV,GAEF,IAAIY,GAAMV,EAAK,MAAOC,CAAO,EAAE,KAAK,KAAK,KAAK,EAC5CD,EAAK,WAAa,GACvBA,EAAK,QAAU,GACV,GAEF,IAAIU,GAAM,KAAK,MAAOT,CAAO,EAAE,KAAKD,EAAK,MAAM,GAGxDC,EAAUC,GAAaD,CAAO,EAG1BA,EAAQ,oBACT,KAAK,QAAU,YAAcD,EAAK,QAAU,aAG3C,CAACC,EAAQ,oBACV,KAAK,MAAM,WAAW,QAAQ,GAAKD,EAAK,MAAM,WAAW,QAAQ,GAC3D,GAIL,QAAK,SAAS,WAAW,GAAG,GAAKA,EAAK,SAAS,WAAW,GAAG,GAI7D,KAAK,SAAS,WAAW,GAAG,GAAKA,EAAK,SAAS,WAAW,GAAG,GAK9D,KAAK,OAAO,UAAYA,EAAK,OAAO,SACrC,KAAK,SAAS,SAAS,GAAG,GAAKA,EAAK,SAAS,SAAS,GAAG,GAIvDS,GAAI,KAAK,OAAQ,IAAKT,EAAK,OAAQC,CAAO,GAC5C,KAAK,SAAS,WAAW,GAAG,GAAKD,EAAK,SAAS,WAAW,GAAG,GAI3DS,GAAI,KAAK,OAAQ,IAAKT,EAAK,OAAQC,CAAO,GAC5C,KAAK,SAAS,WAAW,GAAG,GAAKD,EAAK,SAAS,WAAW,GAAG,GAIjE,CACF,EAEAL,GAAO,QAAUE,GAEjB,IAAMK,GAAe,KACf,CAAE,OAAQE,GAAI,EAAAC,EAAE,EAAI,IACpBI,GAAM,KACNN,GAAQ,IACRI,GAAS,IACTG,GAAQ,MC5Id,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAYC,EAAA,CAACC,EAASC,EAAOC,IAAY,CAC7C,GAAI,CACFD,EAAQ,IAAIJ,GAAMI,EAAOC,CAAO,CAClC,MAAa,CACX,MAAO,EACT,CACA,OAAOD,EAAM,KAAKD,CAAO,CAC3B,EAPkB,aAQlBJ,GAAO,QAAUE,KCTjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IAGRC,GAAgBC,EAAA,CAACC,EAAOC,IAC5B,IAAIJ,GAAMG,EAAOC,CAAO,EAAE,IACvB,IAAIC,GAAQA,EAAK,IAAIC,GAAKA,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAF7C,iBAItBP,GAAO,QAAUE,KCPjB,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQ,IAERC,GAAgBC,EAAA,CAACC,EAAUC,EAAOC,IAAY,CAClD,IAAIC,EAAM,KACNC,EAAQ,KACRC,EAAW,KACf,GAAI,CACFA,EAAW,IAAIR,GAAMI,EAAOC,CAAO,CACrC,MAAa,CACX,OAAO,IACT,CACA,OAAAF,EAAS,QAASM,GAAM,CAClBD,EAAS,KAAKC,CAAC,IAEb,CAACH,GAAOC,EAAM,QAAQE,CAAC,IAAM,MAE/BH,EAAMG,EACNF,EAAQ,IAAIR,GAAOO,EAAKD,CAAO,EAGrC,CAAC,EACMC,CACT,EApBsB,iBAqBtBR,GAAO,QAAUG,KCxBjB,IAAAS,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQ,IACRC,GAAgBC,EAAA,CAACC,EAAUC,EAAOC,IAAY,CAClD,IAAIC,EAAM,KACNC,EAAQ,KACRC,EAAW,KACf,GAAI,CACFA,EAAW,IAAIR,GAAMI,EAAOC,CAAO,CACrC,MAAa,CACX,OAAO,IACT,CACA,OAAAF,EAAS,QAASM,GAAM,CAClBD,EAAS,KAAKC,CAAC,IAEb,CAACH,GAAOC,EAAM,QAAQE,CAAC,IAAM,KAE/BH,EAAMG,EACNF,EAAQ,IAAIR,GAAOO,EAAKD,CAAO,EAGrC,CAAC,EACMC,CACT,EApBsB,iBAqBtBR,GAAO,QAAUG,KCvBjB,IAAAS,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAQ,IACRC,GAAK,IAELC,GAAaC,EAAA,CAACC,EAAOC,IAAU,CACnCD,EAAQ,IAAIJ,GAAMI,EAAOC,CAAK,EAE9B,IAAIC,EAAS,IAAIP,GAAO,OAAO,EAM/B,GALIK,EAAM,KAAKE,CAAM,IAIrBA,EAAS,IAAIP,GAAO,SAAS,EACzBK,EAAM,KAAKE,CAAM,GACnB,OAAOA,EAGTA,EAAS,KACT,QAASC,EAAI,EAAGA,EAAIH,EAAM,IAAI,OAAQ,EAAEG,EAAG,CACzC,IAAMC,EAAcJ,EAAM,IAAIG,CAAC,EAE3BE,EAAS,KACbD,EAAY,QAASE,GAAe,CAElC,IAAMC,EAAU,IAAIZ,GAAOW,EAAW,OAAO,OAAO,EACpD,OAAQA,EAAW,SAAU,CAC3B,IAAK,IACCC,EAAQ,WAAW,SAAW,EAChCA,EAAQ,QAERA,EAAQ,WAAW,KAAK,CAAC,EAE3BA,EAAQ,IAAMA,EAAQ,OAAO,EAE/B,IAAK,GACL,IAAK,MACC,CAACF,GAAUR,GAAGU,EAASF,CAAM,KAC/BA,EAASE,GAEX,MACF,IAAK,IACL,IAAK,KAEH,MAEF,QACE,MAAM,IAAI,MAAM,yBAAyBD,EAAW,QAAQ,EAAE,CAClE,CACF,CAAC,EACGD,IAAW,CAACH,GAAUL,GAAGK,EAAQG,CAAM,KACzCH,EAASG,EAEb,CAEA,OAAIH,GAAUF,EAAM,KAAKE,CAAM,EACtBA,EAGF,IACT,EAvDmB,cAwDnBR,GAAO,QAAUI,KC5DjB,IAAAU,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAaC,EAAA,CAACC,EAAOC,IAAY,CACrC,GAAI,CAGF,OAAO,IAAIJ,GAAMG,EAAOC,CAAO,EAAE,OAAS,GAC5C,MAAa,CACX,OAAO,IACT,CACF,EARmB,cASnBL,GAAO,QAAUE,KCVjB,IAAAI,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAS,IACTC,GAAa,IACb,CAAE,IAAAC,EAAI,EAAID,GACVE,GAAQ,IACRC,GAAY,KACZC,GAAK,IACLC,GAAK,KACLC,GAAM,KACNC,GAAM,KAENC,GAAUC,EAAA,CAACC,EAASC,EAAOC,EAAMC,IAAY,CACjDH,EAAU,IAAIX,GAAOW,EAASG,CAAO,EACrCF,EAAQ,IAAIT,GAAMS,EAAOE,CAAO,EAEhC,IAAIC,EAAMC,EAAOC,EAAMC,EAAMC,EAC7B,OAAQN,EAAM,CACZ,IAAK,IACHE,EAAOV,GACPW,EAAQT,GACRU,EAAOX,GACPY,EAAO,IACPC,EAAQ,KACR,MACF,IAAK,IACHJ,EAAOT,GACPU,EAAQR,GACRS,EAAOZ,GACPa,EAAO,IACPC,EAAQ,KACR,MACF,QACE,MAAM,IAAI,UAAU,uCAAuC,CAC/D,CAGA,GAAIf,GAAUO,EAASC,EAAOE,CAAO,EACnC,MAAO,GAMT,QAASM,EAAI,EAAGA,EAAIR,EAAM,IAAI,OAAQ,EAAEQ,EAAG,CACzC,IAAMC,EAAcT,EAAM,IAAIQ,CAAC,EAE3BE,EAAO,KACPC,EAAM,KAuBV,GArBAF,EAAY,QAASG,GAAe,CAC9BA,EAAW,SAAWtB,KACxBsB,EAAa,IAAIvB,GAAW,SAAS,GAEvCqB,EAAOA,GAAQE,EACfD,EAAMA,GAAOC,EACTT,EAAKS,EAAW,OAAQF,EAAK,OAAQR,CAAO,EAC9CQ,EAAOE,EACEP,EAAKO,EAAW,OAAQD,EAAI,OAAQT,CAAO,IACpDS,EAAMC,EAEV,CAAC,EAIGF,EAAK,WAAaJ,GAAQI,EAAK,WAAaH,IAM3C,CAACI,EAAI,UAAYA,EAAI,WAAaL,IACnCF,EAAML,EAASY,EAAI,MAAM,EAC3B,MAAO,GACF,GAAIA,EAAI,WAAaJ,GAASF,EAAKN,EAASY,EAAI,MAAM,EAC3D,MAAO,EAEX,CACA,MAAO,EACT,EAnEgB,WAqEhBxB,GAAO,QAAUU,KC/EjB,IAAAgB,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CACA,IAAMC,GAAU,KACVC,GAAMC,EAAA,CAACC,EAASC,EAAOC,IAAYL,GAAQG,EAASC,EAAO,IAAKC,CAAO,EAAjE,OACZN,GAAO,QAAUE,KCHjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAU,KAEVC,GAAMC,EAAA,CAACC,EAASC,EAAOC,IAAYL,GAAQG,EAASC,EAAO,IAAKC,CAAO,EAAjE,OACZN,GAAO,QAAUE,KCHjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAaC,EAAA,CAACC,EAAIC,EAAIC,KAC1BF,EAAK,IAAIH,GAAMG,EAAIE,CAAO,EAC1BD,EAAK,IAAIJ,GAAMI,EAAIC,CAAO,EACnBF,EAAG,WAAWC,EAAIC,CAAO,GAHf,cAKnBN,GAAO,QAAUE,KCNjB,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CAGA,IAAMC,GAAY,KACZC,GAAU,IAChBF,GAAO,QAAU,CAACG,EAAUC,EAAOC,IAAY,CAC7C,IAAMC,EAAM,CAAC,EACTC,EAAQ,KACRC,EAAO,KACLC,EAAIN,EAAS,KAAK,CAACO,EAAGC,IAAMT,GAAQQ,EAAGC,EAAGN,CAAO,CAAC,EACxD,QAAWO,KAAWH,EACHR,GAAUW,EAASR,EAAOC,CAAO,GAEhDG,EAAOI,EACFL,IACHA,EAAQK,KAGNJ,GACFF,EAAI,KAAK,CAACC,EAAOC,CAAI,CAAC,EAExBA,EAAO,KACPD,EAAQ,MAGRA,GACFD,EAAI,KAAK,CAACC,EAAO,IAAI,CAAC,EAGxB,IAAMM,EAAS,CAAC,EAChB,OAAW,CAACC,EAAKC,CAAG,IAAKT,EACnBQ,IAAQC,EACVF,EAAO,KAAKC,CAAG,EACN,CAACC,GAAOD,IAAQL,EAAE,CAAC,EAC5BI,EAAO,KAAK,GAAG,EACLE,EAEDD,IAAQL,EAAE,CAAC,EACpBI,EAAO,KAAK,KAAKE,CAAG,EAAE,EAEtBF,EAAO,KAAK,GAAGC,CAAG,MAAMC,CAAG,EAAE,EAJ7BF,EAAO,KAAK,KAAKC,CAAG,EAAE,EAO1B,IAAME,EAAaH,EAAO,KAAK,MAAM,EAC/BI,EAAW,OAAOb,EAAM,KAAQ,SAAWA,EAAM,IAAM,OAAOA,CAAK,EACzE,OAAOY,EAAW,OAASC,EAAS,OAASD,EAAaZ,CAC5D,IC9CA,IAAAc,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAMC,GAAQ,IACRC,GAAa,IACb,CAAE,IAAAC,EAAI,EAAID,GACVE,GAAY,KACZC,GAAU,IAsCVC,GAASC,EAAA,CAACC,EAAKC,EAAKC,EAAU,CAAC,IAAM,CACzC,GAAIF,IAAQC,EACV,MAAO,GAGTD,EAAM,IAAIP,GAAMO,EAAKE,CAAO,EAC5BD,EAAM,IAAIR,GAAMQ,EAAKC,CAAO,EAC5B,IAAIC,EAAa,GAEjBC,EAAO,QAAWC,KAAaL,EAAI,IAAK,CACtC,QAAWM,KAAaL,EAAI,IAAK,CAC/B,IAAMM,EAAQC,GAAaH,EAAWC,EAAWJ,CAAO,EAExD,GADAC,EAAaA,GAAcI,IAAU,KACjCA,EACF,SAASH,CAEb,CAKA,GAAID,EACF,MAAO,EAEX,CACA,MAAO,EACT,EA1Be,UA4BTM,GAA+B,CAAC,IAAIf,GAAW,WAAW,CAAC,EAC3DgB,GAAiB,CAAC,IAAIhB,GAAW,SAAS,CAAC,EAE3Cc,GAAeT,EAAA,CAACC,EAAKC,EAAKC,IAAY,CAC1C,GAAIF,IAAQC,EACV,MAAO,GAGT,GAAID,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,SAAWL,GAAK,CAC7C,GAAIM,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,SAAWN,GACxC,MAAO,GACEO,EAAQ,kBACjBF,EAAMS,GAENT,EAAMU,EAEV,CAEA,GAAIT,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,SAAWN,GAAK,CAC7C,GAAIO,EAAQ,kBACV,MAAO,GAEPD,EAAMS,EAEV,CAEA,IAAMC,EAAQ,IAAI,IACdC,EAAIC,EACR,QAAWC,KAAKd,EACVc,EAAE,WAAa,KAAOA,EAAE,WAAa,KACvCF,EAAKG,GAASH,EAAIE,EAAGZ,CAAO,EACnBY,EAAE,WAAa,KAAOA,EAAE,WAAa,KAC9CD,EAAKG,GAAQH,EAAIC,EAAGZ,CAAO,EAE3BS,EAAM,IAAIG,EAAE,MAAM,EAItB,GAAIH,EAAM,KAAO,EACf,OAAO,KAGT,IAAIM,EACJ,GAAIL,GAAMC,EAAI,CAEZ,GADAI,EAAWpB,GAAQe,EAAG,OAAQC,EAAG,OAAQX,CAAO,EAC5Ce,EAAW,EACb,OAAO,KACF,GAAIA,IAAa,IAAML,EAAG,WAAa,MAAQC,EAAG,WAAa,MACpE,OAAO,IAEX,CAGA,QAAWK,KAAMP,EAAO,CAKtB,GAJIC,GAAM,CAAChB,GAAUsB,EAAI,OAAON,CAAE,EAAGV,CAAO,GAIxCW,GAAM,CAACjB,GAAUsB,EAAI,OAAOL,CAAE,EAAGX,CAAO,EAC1C,OAAO,KAGT,QAAWY,MAAKb,EACd,GAAI,CAACL,GAAUsB,EAAI,OAAOJ,EAAC,EAAGZ,CAAO,EACnC,MAAO,GAIX,MAAO,EACT,CAEA,IAAIiB,EAAQC,EACRC,EAAUC,EAGVC,EAAeV,GACjB,CAACX,EAAQ,mBACTW,EAAG,OAAO,WAAW,OAASA,EAAG,OAAS,GACxCW,EAAeZ,GACjB,CAACV,EAAQ,mBACTU,EAAG,OAAO,WAAW,OAASA,EAAG,OAAS,GAExCW,GAAgBA,EAAa,WAAW,SAAW,GACnDV,EAAG,WAAa,KAAOU,EAAa,WAAW,CAAC,IAAM,IACxDA,EAAe,IAGjB,QAAWT,KAAKb,EAAK,CAGnB,GAFAqB,EAAWA,GAAYR,EAAE,WAAa,KAAOA,EAAE,WAAa,KAC5DO,EAAWA,GAAYP,EAAE,WAAa,KAAOA,EAAE,WAAa,KACxDF,GASF,GARIY,GACEV,EAAE,OAAO,YAAcA,EAAE,OAAO,WAAW,QAC3CA,EAAE,OAAO,QAAUU,EAAa,OAChCV,EAAE,OAAO,QAAUU,EAAa,OAChCV,EAAE,OAAO,QAAUU,EAAa,QAClCA,EAAe,IAGfV,EAAE,WAAa,KAAOA,EAAE,WAAa,MAEvC,GADAK,EAASJ,GAASH,EAAIE,EAAGZ,CAAO,EAC5BiB,IAAWL,GAAKK,IAAWP,EAC7B,MAAO,WAEAA,EAAG,WAAa,MAAQ,CAAChB,GAAUgB,EAAG,OAAQ,OAAOE,CAAC,EAAGZ,CAAO,EACzE,MAAO,GAGX,GAAIW,GASF,GARIU,GACET,EAAE,OAAO,YAAcA,EAAE,OAAO,WAAW,QAC3CA,EAAE,OAAO,QAAUS,EAAa,OAChCT,EAAE,OAAO,QAAUS,EAAa,OAChCT,EAAE,OAAO,QAAUS,EAAa,QAClCA,EAAe,IAGfT,EAAE,WAAa,KAAOA,EAAE,WAAa,MAEvC,GADAM,EAAQJ,GAAQH,EAAIC,EAAGZ,CAAO,EAC1BkB,IAAUN,GAAKM,IAAUP,EAC3B,MAAO,WAEAA,EAAG,WAAa,MAAQ,CAACjB,GAAUiB,EAAG,OAAQ,OAAOC,CAAC,EAAGZ,CAAO,EACzE,MAAO,GAGX,GAAI,CAACY,EAAE,WAAaD,GAAMD,IAAOK,IAAa,EAC5C,MAAO,EAEX,CAgBA,MAXI,EAAAL,GAAMS,GAAY,CAACR,GAAMI,IAAa,GAItCJ,GAAMS,GAAY,CAACV,GAAMK,IAAa,GAOtCO,GAAgBD,EAKtB,EAnJqB,gBAsJfR,GAAWhB,EAAA,CAAC0B,EAAGC,EAAGxB,IAAY,CAClC,GAAI,CAACuB,EACH,OAAOC,EAET,IAAMC,EAAO9B,GAAQ4B,EAAE,OAAQC,EAAE,OAAQxB,CAAO,EAChD,OAAOyB,EAAO,EAAIF,EACdE,EAAO,GACPD,EAAE,WAAa,KAAOD,EAAE,WAAa,KAD1BC,EAEXD,CACN,EATiB,YAYXT,GAAUjB,EAAA,CAAC0B,EAAGC,EAAGxB,IAAY,CACjC,GAAI,CAACuB,EACH,OAAOC,EAET,IAAMC,EAAO9B,GAAQ4B,EAAE,OAAQC,EAAE,OAAQxB,CAAO,EAChD,OAAOyB,EAAO,EAAIF,EACdE,EAAO,GACPD,EAAE,WAAa,KAAOD,EAAE,WAAa,KAD1BC,EAEXD,CACN,EATgB,WAWhBjC,GAAO,QAAUM,KCtPjB,IAAA8B,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CACA,IAAMC,GAAa,IACbC,GAAY,IACZC,GAAS,IACTC,GAAc,KACdC,GAAQ,IACRC,GAAQ,KACRC,GAAQ,KACRC,GAAM,KACNC,GAAO,KACPC,GAAQ,KACRC,GAAQ,KACRC,GAAQ,KACRC,GAAa,KACbC,GAAU,IACVC,GAAW,KACXC,GAAe,KACfC,GAAe,KACfC,GAAO,KACPC,GAAQ,KACRC,GAAK,IACLC,GAAK,KACLC,GAAK,KACLC,GAAM,KACNC,GAAM,KACNC,GAAM,KACNC,GAAM,KACNC,GAAS,KACTC,GAAa,IACbC,GAAQ,IACRC,GAAY,KACZC,GAAgB,KAChBC,GAAgB,KAChBC,GAAgB,KAChBC,GAAa,KACbC,GAAa,KACbC,GAAU,KACVC,GAAM,KACNC,GAAM,KACNC,GAAa,KACbC,GAAgB,KAChBC,GAAS,KACfzC,GAAO,QAAU,CACf,MAAAK,GACA,MAAAC,GACA,MAAAC,GACA,IAAAC,GACA,KAAAC,GACA,MAAAC,GACA,MAAAC,GACA,MAAAC,GACA,WAAAC,GACA,QAAAC,GACA,SAAAC,GACA,aAAAC,GACA,aAAAC,GACA,KAAAC,GACA,MAAAC,GACA,GAAAC,GACA,GAAAC,GACA,GAAAC,GACA,IAAAC,GACA,IAAAC,GACA,IAAAC,GACA,IAAAC,GACA,OAAAC,GACA,WAAAC,GACA,MAAAC,GACA,UAAAC,GACA,cAAAC,GACA,cAAAC,GACA,cAAAC,GACA,WAAAC,GACA,WAAAC,GACA,QAAAC,GACA,IAAAC,GACA,IAAAC,GACA,WAAAC,GACA,cAAAC,GACA,OAAAC,GACA,OAAAtC,GACA,GAAIF,GAAW,GACf,IAAKA,GAAW,IAChB,OAAQA,GAAW,EACnB,oBAAqBC,GAAU,oBAC/B,cAAeA,GAAU,cACzB,mBAAoBE,GAAY,mBAChC,oBAAqBA,GAAY,mBACnC,ICxFA,IAAIsC,GAAEC,GAAEC,EAAY,OAAO,SAAjB,SAAyB,QAAQ,KAAKC,GAAED,GAAe,OAAOA,EAAE,OAArB,WAA2BA,EAAE,MAAM,SAASF,EAAEC,EAAEC,EAAE,CAAC,OAAO,SAAS,UAAU,MAAM,KAAKF,EAAEC,EAAEC,CAAC,CAAC,EAAED,GAAEC,GAAe,OAAOA,EAAE,SAArB,WAA6BA,EAAE,QAAQ,OAAO,sBAAsB,SAASF,EAAE,CAAC,OAAO,OAAO,oBAAoBA,CAAC,EAAE,OAAO,OAAO,sBAAsBA,CAAC,CAAC,CAAC,EAAE,SAASA,EAAE,CAAC,OAAO,OAAO,oBAAoBA,CAAC,CAAC,EAAE,IAAII,GAAE,OAAO,OAAO,SAASJ,EAAE,CAAC,OAAOA,GAAGA,CAAC,EAAE,SAASK,GAAG,CAACA,EAAE,KAAK,KAAK,IAAI,CAAE,CAAtBC,EAAAD,EAAA,KAAuBL,GAAEK,EAAEA,EAAE,aAAaA,EAAEA,EAAE,UAAU,QAAQ,OAAOA,EAAE,UAAU,aAAa,EAAEA,EAAE,UAAU,cAAc,OAAO,IAAIE,GAAE,GAAG,SAASC,GAAER,EAAE,CAAC,GAAe,OAAOA,GAAnB,WAAqB,MAAM,IAAI,UAAU,mEAAmE,OAAOA,CAAC,CAAC,CAA7HM,EAAAE,GAAA,KAA8H,SAASC,GAAET,EAAE,CAAC,OAAgBA,EAAE,gBAAX,OAAyBK,EAAE,oBAAoBL,EAAE,aAAa,CAA1EM,EAAAG,GAAA,KAA2E,SAASC,GAAEV,EAAEC,EAAEC,EAAEC,EAAE,CAAC,IAAIC,EAAEC,EAAEE,EAAEG,EAAE,GAAGF,GAAEN,CAAC,GAAYG,EAAEL,EAAE,WAAd,QAAwBK,EAAEL,EAAE,QAAQ,OAAO,OAAO,IAAI,EAAEA,EAAE,aAAa,IAAaK,EAAE,cAAX,SAAyBL,EAAE,KAAK,cAAcC,EAAEC,EAAE,SAASA,EAAE,SAASA,CAAC,EAAEG,EAAEL,EAAE,SAASO,EAAEF,EAAEJ,CAAC,GAAYM,IAAT,OAAWA,EAAEF,EAAEJ,CAAC,EAAEC,EAAE,EAAEF,EAAE,qBAAiC,OAAOO,GAAnB,WAAqBA,EAAEF,EAAEJ,CAAC,EAAEE,EAAE,CAACD,EAAEK,CAAC,EAAE,CAACA,EAAEL,CAAC,EAAEC,EAAEI,EAAE,QAAQL,CAAC,EAAEK,EAAE,KAAKL,CAAC,GAAGE,EAAEK,GAAET,CAAC,GAAG,GAAGO,EAAE,OAAOH,GAAG,CAACG,EAAE,OAAO,CAACA,EAAE,OAAO,GAAG,IAAII,EAAE,IAAI,MAAM,+CAA+CJ,EAAE,OAAO,IAAI,OAAON,CAAC,EAAE,mEAAmE,EAAEU,EAAE,KAAK,8BAA8BA,EAAE,QAAQX,EAAEW,EAAE,KAAKV,EAAEU,EAAE,MAAMJ,EAAE,OAAOG,EAAEC,EAAE,SAAS,QAAQ,MAAM,QAAQ,KAAKD,CAAC,CAAE,CAAC,OAAOV,CAAC,CAAjoBM,EAAAI,GAAA,KAAkoB,SAASC,IAAG,CAAC,GAAG,CAAC,KAAK,MAAM,OAAO,KAAK,OAAO,eAAe,KAAK,KAAK,KAAK,MAAM,EAAE,KAAK,MAAM,GAAO,UAAU,SAAd,EAAqB,KAAK,SAAS,KAAK,KAAK,MAAM,EAAE,KAAK,SAAS,MAAM,KAAK,OAAO,SAAS,CAAC,CAAzLL,EAAAK,GAAA,KAA0L,SAASC,GAAEZ,EAAEC,EAAEC,EAAE,CAAC,IAAIC,EAAE,CAAC,MAAM,GAAG,OAAO,OAAO,OAAOH,EAAE,KAAKC,EAAE,SAASC,CAAC,EAAEE,EAAEO,GAAE,KAAKR,CAAC,EAAE,OAAOC,EAAE,SAASF,EAAEC,EAAE,OAAOC,EAAEA,CAAC,CAA/GE,EAAAM,GAAA,KAAgH,SAASC,GAAEb,EAAEC,EAAEC,EAAE,CAAC,IAAIC,EAAEH,EAAE,QAAQ,GAAYG,IAAT,OAAW,MAAO,CAAC,EAAE,IAAIC,EAAED,EAAEF,CAAC,EAAE,OAAgBG,IAAT,OAAW,CAAC,EAAc,OAAOA,GAAnB,WAAqBF,EAAE,CAACE,EAAE,UAAUA,CAAC,EAAE,CAACA,CAAC,EAAEF,EAAE,SAASF,EAAE,CAAC,QAAQC,EAAE,IAAI,MAAMD,EAAE,MAAM,EAAEE,EAAE,EAAEA,EAAED,EAAE,OAAO,EAAEC,EAAED,EAAEC,CAAC,EAAEF,EAAEE,CAAC,EAAE,UAAUF,EAAEE,CAAC,EAAE,OAAOD,CAAC,EAAEG,CAAC,EAAEU,GAAEV,EAAEA,EAAE,MAAM,CAAC,CAA9OE,EAAAO,GAAA,KAA+O,SAASE,GAAEf,EAAE,CAAC,IAAIC,EAAE,KAAK,QAAQ,GAAYA,IAAT,OAAW,CAAC,IAAIC,EAAED,EAAED,CAAC,EAAE,GAAe,OAAOE,GAAnB,WAAqB,MAAO,GAAE,GAAYA,IAAT,OAAW,OAAOA,EAAE,MAAM,CAAC,MAAO,EAAC,CAAzHI,EAAAS,GAAA,KAA0H,SAASD,GAAEd,EAAEC,EAAE,CAAC,QAAQC,EAAE,IAAI,MAAMD,CAAC,EAAEE,EAAE,EAAEA,EAAEF,EAAE,EAAEE,EAAED,EAAEC,CAAC,EAAEH,EAAEG,CAAC,EAAE,OAAOD,CAAC,CAA5DI,EAAAQ,GAAA,KAA6D,OAAO,eAAeT,EAAE,sBAAsB,CAAC,WAAW,GAAG,IAAI,UAAU,CAAC,OAAOE,EAAC,EAAE,IAAI,SAASP,EAAE,CAAC,GAAa,OAAOA,GAAjB,UAAoBA,EAAE,GAAGI,GAAEJ,CAAC,EAAE,MAAM,IAAI,WAAW,kGAAkGA,EAAE,GAAG,EAAEO,GAAEP,CAAE,CAAC,CAAC,EAAEK,EAAE,KAAK,UAAU,CAAU,KAAK,UAAd,QAAuB,KAAK,UAAU,OAAO,eAAe,IAAI,EAAE,UAAU,KAAK,QAAQ,OAAO,OAAO,IAAI,EAAE,KAAK,aAAa,GAAG,KAAK,cAAc,KAAK,eAAe,MAAO,EAAEA,EAAE,UAAU,gBAAgB,SAASL,EAAE,CAAC,GAAa,OAAOA,GAAjB,UAAoBA,EAAE,GAAGI,GAAEJ,CAAC,EAAE,MAAM,IAAI,WAAW,gFAAgFA,EAAE,GAAG,EAAE,OAAO,KAAK,cAAcA,EAAE,IAAI,EAAEK,EAAE,UAAU,gBAAgB,UAAU,CAAC,OAAOI,GAAE,IAAI,CAAC,EAAEJ,EAAE,UAAU,KAAK,SAASL,EAAE,CAAC,QAAQC,EAAE,CAAC,EAAEC,EAAE,EAAEA,EAAE,UAAU,OAAOA,IAAID,EAAE,KAAK,UAAUC,CAAC,CAAC,EAAE,IAAIE,EAAYJ,IAAV,QAAYK,EAAE,KAAK,QAAQ,GAAYA,IAAT,OAAWD,EAAEA,GAAYC,EAAE,QAAX,eAAyB,CAACD,EAAE,MAAO,GAAG,GAAGA,EAAE,CAAC,IAAIG,EAAE,GAAGN,EAAE,OAAO,IAAIM,EAAEN,EAAE,CAAC,GAAGM,aAAa,MAAM,MAAMA,EAAE,IAAI,EAAE,IAAI,MAAM,oBAAoBA,EAAE,KAAKA,EAAE,QAAQ,IAAI,GAAG,EAAE,MAAM,EAAE,QAAQA,EAAE,CAAC,CAAC,IAAIE,EAAEJ,EAAEL,CAAC,EAAE,GAAYS,IAAT,OAAW,MAAO,GAAG,GAAe,OAAOA,GAAnB,WAAqBN,GAAEM,EAAE,KAAKR,CAAC,MAAO,CAAC,IAAIS,EAAED,EAAE,OAAOE,EAAEG,GAAEL,EAAEC,CAAC,EAAE,IAAIR,EAAE,EAAEA,EAAEQ,EAAE,EAAER,EAAEC,GAAEQ,EAAET,CAAC,EAAE,KAAKD,CAAC,CAAE,CAAC,MAAO,EAAE,EAAEI,EAAE,UAAU,YAAY,SAASL,EAAEC,EAAE,CAAC,OAAOS,GAAE,KAAKV,EAAEC,EAAE,EAAE,CAAC,EAAEI,EAAE,UAAU,GAAGA,EAAE,UAAU,YAAYA,EAAE,UAAU,gBAAgB,SAASL,EAAEC,EAAE,CAAC,OAAOS,GAAE,KAAKV,EAAEC,EAAE,EAAE,CAAC,EAAEI,EAAE,UAAU,KAAK,SAASL,EAAEC,EAAE,CAAC,OAAOO,GAAEP,CAAC,EAAE,KAAK,GAAGD,EAAEY,GAAE,KAAKZ,EAAEC,CAAC,CAAC,EAAE,IAAI,EAAEI,EAAE,UAAU,oBAAoB,SAASL,EAAEC,EAAE,CAAC,OAAOO,GAAEP,CAAC,EAAE,KAAK,gBAAgBD,EAAEY,GAAE,KAAKZ,EAAEC,CAAC,CAAC,EAAE,IAAI,EAAEI,EAAE,UAAU,eAAe,SAASL,EAAEC,EAAE,CAAC,IAAIC,EAAEC,EAAEC,EAAEC,EAAEE,EAAE,GAAGC,GAAEP,CAAC,GAAYE,EAAE,KAAK,WAAjB,OAA0B,OAAO,KAAK,IAAaD,EAAEC,EAAEH,CAAC,KAAf,OAAkB,OAAO,KAAK,GAAGE,IAAID,GAAGC,EAAE,WAAWD,EAAK,EAAE,KAAK,cAAV,EAAuB,KAAK,QAAQ,OAAO,OAAO,IAAI,GAAG,OAAOE,EAAEH,CAAC,EAAEG,EAAE,gBAAgB,KAAK,KAAK,iBAAiBH,EAAEE,EAAE,UAAUD,CAAC,WAAuB,OAAOC,GAAnB,WAAqB,CAAC,IAAIE,EAAE,GAAGC,EAAEH,EAAE,OAAO,EAAEG,GAAG,EAAEA,IAAI,GAAGH,EAAEG,CAAC,IAAIJ,GAAGC,EAAEG,CAAC,EAAE,WAAWJ,EAAE,CAACM,EAAEL,EAAEG,CAAC,EAAE,SAASD,EAAEC,EAAE,KAAK,CAAC,GAAGD,EAAE,EAAE,OAAO,KAASA,IAAJ,EAAMF,EAAE,MAAM,EAAG,SAASF,EAAEC,EAAE,CAAC,KAAKA,EAAE,EAAED,EAAE,OAAOC,IAAID,EAAEC,CAAC,EAAED,EAAEC,EAAE,CAAC,EAAED,EAAE,IAAI,CAAE,EAAEE,EAAEE,CAAC,EAAMF,EAAE,SAAN,IAAeC,EAAEH,CAAC,EAAEE,EAAE,CAAC,GAAYC,EAAE,iBAAX,QAA2B,KAAK,KAAK,iBAAiBH,EAAEO,GAAGN,CAAC,CAAE,CAAC,OAAO,IAAI,EAAEI,EAAE,UAAU,IAAIA,EAAE,UAAU,eAAeA,EAAE,UAAU,mBAAmB,SAASL,EAAE,CAAC,IAAIC,EAAEC,EAAEC,EAAE,IAAaD,EAAE,KAAK,WAAjB,OAA0B,OAAO,KAAK,GAAYA,EAAE,iBAAX,OAA0B,OAAW,UAAU,SAAd,GAAsB,KAAK,QAAQ,OAAO,OAAO,IAAI,EAAE,KAAK,aAAa,GAAYA,EAAEF,CAAC,IAAZ,SAAmB,EAAE,KAAK,cAAV,EAAuB,KAAK,QAAQ,OAAO,OAAO,IAAI,EAAE,OAAOE,EAAEF,CAAC,GAAG,KAAK,GAAO,UAAU,SAAd,EAAqB,CAAC,IAAII,EAAEC,EAAE,OAAO,KAAKH,CAAC,EAAE,IAAIC,EAAE,EAAEA,EAAEE,EAAE,OAAO,EAAEF,GAAsBC,EAAEC,EAAEF,CAAC,KAAzB,kBAA6B,KAAK,mBAAmBC,CAAC,EAAE,OAAO,KAAK,mBAAmB,gBAAgB,EAAE,KAAK,QAAQ,OAAO,OAAO,IAAI,EAAE,KAAK,aAAa,EAAE,IAAI,CAAC,GAAe,OAAOH,EAAEC,EAAEF,CAAC,IAAxB,WAA2B,KAAK,eAAeA,EAAEC,CAAC,UAAmBA,IAAT,OAAW,IAAIE,EAAEF,EAAE,OAAO,EAAEE,GAAG,EAAEA,IAAI,KAAK,eAAeH,EAAEC,EAAEE,CAAC,CAAC,EAAE,OAAO,IAAI,EAAEE,EAAE,UAAU,UAAU,SAASL,EAAE,CAAC,OAAOa,GAAE,KAAKb,EAAE,EAAE,CAAC,EAAEK,EAAE,UAAU,aAAa,SAASL,EAAE,CAAC,OAAOa,GAAE,KAAKb,EAAE,EAAE,CAAC,EAAEK,EAAE,cAAc,SAASL,EAAEC,EAAE,CAAC,OAAmB,OAAOD,EAAE,eAArB,WAAmCA,EAAE,cAAcC,CAAC,EAAEc,GAAE,KAAKf,EAAEC,CAAC,CAAC,EAAEI,EAAE,UAAU,cAAcU,GAAEV,EAAE,UAAU,WAAW,UAAU,CAAC,OAAO,KAAK,aAAa,EAAEJ,GAAE,KAAK,OAAO,EAAE,CAAC,CAAC,EAAE,IAAIe,EAAEhB,GAAEgB,EAAE,aAAaA,EAAE,oBAAoBA,EAAE,KAAKA,EAAE,cAE7zKA,EAAE,aACFA,EAAE,oBACFA,EAAE,KACFA,EAAE,cCDFC,EAAE,KAAO,SAAUC,EAASC,EAAO,CACjC,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtC,SAASC,KAAiBC,EAAM,CAC1BC,IAAkB,QACpBN,EAAQ,eAAe,QAASM,CAAa,EAE/CJ,EAAQG,CAAI,CACd,CALSE,EAAAH,EAAA,iBAMT,IAAIE,EACAL,IAAU,UAEZK,EAAgBC,EAACC,GAAQ,CACvBR,EAAQ,eAAe,KAAMI,CAAa,EAC1CD,EAAOK,CAAG,CACZ,EAHgB,iBAKhBR,EAAQ,KAAK,QAASM,CAAa,GAGrCN,EAAQ,KAAKC,EAAOG,CAAa,CACnC,CAAC,CACH,EACAL,EAAE,GAAK,SAAUC,EAASC,EAAO,CAC/B,IAAMQ,EAAwB,CAAC,EACzBC,EAAqB,CAAC,EACxBC,EAAQ,KACRC,EAAW,GAETC,EAAW,CACf,MAAM,MAAO,CACX,IAAMC,EAAQL,EAAsB,MAAM,EAC1C,GAAIK,EACF,OAAO,iBAAiBA,EAAO,EAAK,EAGtC,GAAIH,EAAO,CACT,IAAMI,EAAI,QAAQ,OAAOJ,CAAK,EAC9B,OAAAA,EAAQ,KACDI,CACT,CAEA,OAAIH,EACK,iBAAiB,OAAW,EAAI,EAGlC,IAAI,QAAQ,CAACV,EAASC,IAAWO,EAAmB,KAAK,CAAE,QAAAR,EAAS,OAAAC,CAAO,CAAC,CAAC,CACtF,EACA,MAAM,QAAS,CACbH,EAAQ,eAAeC,EAAOe,CAAY,EAC1ChB,EAAQ,eAAe,QAASiB,CAAY,EAC5CL,EAAW,GAEX,QAAWM,KAAWR,EACpBQ,EAAQ,QAAQ,iBAAiB,OAAW,EAAI,CAAC,EAGnD,OAAO,iBAAiB,OAAW,EAAI,CACzC,EACA,MAAMV,EAAK,CACTG,EAAQH,EACRR,EAAQ,eAAeC,EAAOe,CAAY,EAC1ChB,EAAQ,eAAe,QAASiB,CAAY,CAC9C,EACA,CAAC,OAAO,aAAa,GAAI,CACvB,OAAO,IACT,CACF,EAEA,OAAAjB,EAAQ,GAAGC,EAAOe,CAAY,EAC9BhB,EAAQ,GAAG,QAASiB,CAAY,EAEzBJ,EAEP,SAASG,KAAgBX,EAAM,CAC7B,IAAMa,EAAUR,EAAmB,MAAM,EACrCQ,EACFA,EAAQ,QAAQ,iBAAiBb,EAAM,EAAK,CAAC,EAE7CI,EAAsB,KAAKJ,CAAI,CAEnC,CAPSE,EAAAS,EAAA,gBAST,SAASC,EAAaT,EAAK,CACzBI,EAAW,GACX,IAAMO,EAAUT,EAAmB,MAAM,EACrCS,EACFA,EAAQ,OAAOX,CAAG,EAElBG,EAAQH,EAEVK,EAAS,OAAO,CAClB,CATSN,EAAAU,EAAA,eAUX,EACA,GAAM,CACJ,aAAAG,GACA,oBAAAC,GACA,KAAAC,GACA,cAAAC,GACA,GAAAC,GACA,KAAAC,EACF,EAAI1B,iXC5FJ,IAAM2B,GAAmB,YAyCJC,EAArB,KAA8B,OAAA,CAAAC,EAAA,kBAM5B,YAAY,CAAE,QAAAC,EAAS,QAAAC,CAAO,EAAoD,CAAA,EAAE,CALpF,KAAA,gBAAkB,IAClB,KAAA,oBAAsB,KACtB,KAAA,YAA8C,KAoI9C,KAAA,QAAU,IAAIC,EA6Dd,KAAA,KAAO,CACLC,EACAC,EACAC,EACAC,EACAC,EAAe,OAAO,MAAM,CAAC,EAC7BC,EAA4B,CAACC,GAAY,EAAE,EAC3C,CAAE,eAAAC,CAAc,EAAkC,CAAA,IAC/BC,GAAA,KAAA,OAAA,OAAA,WAAA,CACnB,IAAMC,EAAS,KAAK,OAAO,mBAAmB,CAAE,SAAU,MAAM,CAAE,EAElE,GAAIL,EAAK,QAAU,IACjB,MAAAK,EAAO,MAAM,uCAAwC,CAAE,WAAYL,EAAK,MAAM,CAAE,EAC1E,IAAIM,EACR,4CAA8CN,EAAK,OACnD,kBAAkB,EAItBK,EAAO,MAAM,uBAAwB,CAAE,eAAAF,CAAc,CAAE,EACvD,IAAMI,EAAW,MAAM,KAAK,SAE1B,OAAO,OAAO,CAAC,OAAO,KAAK,CAACX,EAAKC,EAAKC,EAAIC,CAAE,CAAC,EAAG,OAAO,KAAK,CAACC,EAAK,MAAM,CAAC,EAAGA,CAAI,CAAC,EACjF,CAAE,eAAAG,CAAc,CAAE,EAEpBE,EAAO,MAAM,iCAAiC,EAC9C,IAAMG,EAAKD,EAAS,aAAaA,EAAS,OAAS,CAAC,EAEpD,GAAI,CAACN,EAAW,KAAKQ,GAAKA,IAAMD,CAAE,EAChC,MAAM,IAAIE,GAAqBF,CAAE,EAGnC,OAAOD,CACT,CAAC,EAyGD,KAAA,YAA6B,KAvU3B,KAAK,OAAS,IAAII,GAAYjB,GAAWJ,GAAkBG,CAAO,CACpE,CA+DA,SACEmB,EACA,CAAE,eAAgBC,CAAe,EAAkC,CAAA,EAAE,CAErE,MAAM,IAAI,MAAM,0BAA0B,CAC5C,CASA,aAAaC,EAAiBC,EAA0B,CACtD,IAAIC,EAAe,GACbC,EAAczB,EAAA,IAAK,CACvBwB,EAAe,EACjB,EAFoB,eAiBpB,OAbaxB,EAAA,IAAWY,GAAA,KAAA,OAAA,OAAA,WAAA,CACtB,GAAI,CAAAY,EACJ,QAAWE,KAAQJ,EAAO,CACxB,IAAMK,EAAI,MAAM,KAAK,SAASD,CAAI,EAClC,GAAIF,EAAc,OAClB,IAAMI,EAASD,EAAE,aAAaA,EAAE,OAAS,CAAC,EAC1C,GAAIC,IAAWlB,GAAY,GACzB,MAAM,IAAIQ,GAAqBU,CAAM,EAEvCL,EAAS,KAAKI,CAAC,EAEnB,CAAC,EAXY,QAaT,EAAG,KACL,IAAM,CAACH,GAAgBD,EAAS,SAAQ,EACxCM,GAAK,CAACL,GAAgBD,EAAS,MAAMM,CAAC,CAAC,EAGlC,CAAE,YAAAJ,CAAW,CACtB,CAUA,eAAeK,EAAY,CAAG,CAW9B,OAAK,CACH,OAAO,QAAQ,QAAO,CACxB,CAWA,GAAGC,EAAmBC,EAAgC,CACpD,KAAK,QAAQ,GAAGD,EAAWC,CAAE,CAC/B,CAKA,IAAID,EAAmBC,EAAgC,CACrD,KAAK,QAAQ,eAAeD,EAAWC,CAAE,CAC3C,CAEA,KAAKC,KAAkBC,EAAS,CAC9B,KAAK,QAAQ,KAAKD,EAAO,GAAGC,CAAI,CAClC,CAKA,cAAY,CACV,QAAQ,KACN,8FAA8F,CAElG,CAKA,mBAAmBC,EAAuB,CACxC,KAAK,gBAAkBA,CACzB,CAKA,+BAA+BC,EAA2B,CACxD,KAAK,oBAAsBA,CAC7B,CA0DA,OAAO,OAAOC,EAAc,IAAMC,EAAsB,CACtD,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAU,CACrC,IAAIC,EAAQ,GACNC,EAAM,KAAK,OAAO,CACtB,KAAMb,GAAI,CACRY,EAAQ,GACJC,GAAKA,EAAI,YAAW,EACpBC,GAAiB,aAAaA,CAAe,EACjD,KAAK,KAAKd,EAAE,WAAYQ,CAAW,EAAE,KAAKE,EAASC,CAAM,CAC3D,EACA,MAAOX,GAAI,CACLc,GAAiB,aAAaA,CAAe,EACjDH,EAAOX,CAAC,CACV,EACA,SAAU,IAAK,CACTc,GAAiB,aAAaA,CAAe,EAE5CF,GACHD,EAAO,IAAI1B,EAAe,KAAK,2BAA4B,eAAe,CAAC,CAE/E,EACD,EACK6B,EAAkBL,EACpB,WAAW,IAAK,CACdI,EAAI,YAAW,EACfF,EAAO,IAAI1B,EAAe,KAAK,2BAA4B,eAAe,CAAC,CAC7E,EAAGwB,CAAa,EAChB,IACN,CAAC,CACH,CAaM,mBAA2BM,EAAwB,0CACvD,IAAM/B,EAAS,KAAK,OAAO,mBAAmB,CAC5C,SAAU,qBACV,oBAAqB,KAAK,oBAC3B,EAED,GAAI,KAAK,oBACP,MAAAA,EAAO,MAAM,iCAAiC,EACxC,IAAIgC,GACR,+EAA+E,EAKnF,IAAIC,EACEC,EAA6B,IAAI,QAAQpB,GAAI,CACjDmB,EAAcnB,CAChB,CAAC,EACD,KAAK,oBAAsBoB,EAG3B,IAAIC,EAAsB,GACpBC,EAAU,WAAW,IAAK,CAC9BpC,EAAO,MAAM,2DAA4D,CACvE,oBAAqB,KAAK,oBAC3B,EACDmC,EAAsB,GACtB,KAAK,KAAK,cAAc,CAC1B,EAAG,KAAK,mBAAmB,EAE3B,GAAI,CACF,IAAME,EAAM,MAAMN,EAAC,EAEnB,OAAII,IACFnC,EAAO,MAAM,8CAA8C,EAC3D,KAAK,KAAK,YAAY,GAGjBqC,UAEPrC,EAAO,MAAM,+BAA+B,EAE5C,aAAaoC,CAAO,EAChBH,GAAaA,EAAW,EAC5B,KAAK,oBAAsB,KAE/B,CAAC,EAED,sBAAsBK,EAA2BC,EAAwBC,EAAmB,CAC1F,QAAWC,KAAcF,EACvBD,EAAKG,CAAU,EAAI,KAAK,qBAAqBA,EAAYH,EAAKG,CAAU,EAAGH,EAAME,CAAW,CAEhG,CAIA,qBACEC,EACAV,EACAW,EACAF,EAAmB,CAEnB,MAAO,IAAUnB,IAAQtB,GAAA,KAAA,OAAA,OAAA,WAAA,CACvB,GAAM,CAAE,YAAA4C,CAAW,EAAK,KAExB,GAAIA,EACF,OAAO,QAAQ,OACb,IAAI1C,EAAe,+BAAiC0C,EAAc,IAAK,iBAAiB,CAAC,EAI7F,GAAI,CACF,YAAK,YAAcF,EACnB,KAAK,eAAeD,CAAW,EACxB,MAAMT,EAAE,MAAMW,EAAKrB,CAAI,UAE9B,KAAK,YAAc,KAEvB,CAAC,CACH,CAUA,gBAAgBjC,EAAsB,CACpC,KAAK,OAAS,KAAK,OAAO,YAAYA,CAAO,CAC/C,CASA,mBAAmBwD,EAA0B,CAC3C,KAAK,OAAO,cAAcA,CAAY,CACxC,CAKA,iBAAe,CACb,OAAO,KAAK,OAAO,WAAU,CAC/B,GAEO1D,EAAA,2BAA6B,mCAC7BA,EAAA,2BAA6B,gCAxYjBA,ECxCrB,IAAM2D,GAAM,EAEZ,SAASC,GAAWC,EAAK,CACvB,IAAMC,EAAI,OAAO,MAAM,CAAC,EACxB,OAAAA,EAAE,cAAcD,EAAO,CAAC,EACjBC,CACT,CAJSC,EAAAH,GAAA,cAMT,IAAMI,GAAa,CACjB,KAAM,OAAO,MAAM,CAAC,EACpB,WAAY,EACZ,SAAU,GASNC,GAAmBF,EAAA,CAACG,EAAiBC,KAClC,CAOL,WAAWC,EAAY,CAKrB,IAAIC,EAAO,OAAO,OAAO,CAACT,GAAWQ,EAAK,MAAM,EAAGA,CAAI,CAAC,EAElDE,EAAYH,EAAa,EACzBI,EAAW,KAAK,KAAKF,EAAK,OAASC,CAAS,EAGlDD,EAAO,OAAO,OAAO,CAACA,EAAM,OAAO,MAAME,EAAWD,EAAYD,EAAK,OAAS,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAEzF,IAAMG,EAAmB,CAAA,EAEzB,QAASC,EAAI,EAAGA,EAAIF,EAAUE,IAAK,CACjC,IAAMC,EAAO,OAAO,MAAM,CAAC,EAC3BA,EAAK,cAAcR,EAAS,CAAC,EAC7BQ,EAAK,WAAWf,GAAK,CAAC,EACtBe,EAAK,cAAcD,EAAG,CAAC,EAGvB,IAAME,EAAQN,EAAK,MAAMI,EAAIH,GAAYG,EAAI,GAAKH,CAAS,EAE3DE,EAAO,KAAK,OAAO,OAAO,CAACE,EAAMC,CAAK,CAAC,CAAC,EAG1C,OAAOH,CACT,EAUA,eAAeI,EAAkBD,EAAa,CAC5C,GAAI,CAAE,KAAAN,EAAM,WAAAQ,EAAY,SAAAC,CAAQ,EAAKF,GAAOZ,GAE5C,GAAIW,EAAM,aAAa,CAAC,IAAMT,EAC5B,MAAM,IAAIa,EAAe,kBAAmB,gBAAgB,EAG9D,GAAIJ,EAAM,UAAU,CAAC,IAAMhB,GACzB,MAAM,IAAIoB,EAAe,cAAe,YAAY,EAGtD,GAAIJ,EAAM,aAAa,CAAC,IAAMG,EAC5B,MAAM,IAAIC,EAAe,mBAAoB,iBAAiB,EAI3DH,IACHC,EAAaF,EAAM,aAAa,CAAC,GAGnCG,IAEA,IAAME,EAAYL,EAAM,MAAMC,EAAM,EAAI,CAAC,EACzC,OAAAP,EAAO,OAAO,OAAO,CAACA,EAAMW,CAAS,CAAC,EAGlCX,EAAK,OAASQ,IAChBR,EAAOA,EAAK,MAAM,EAAGQ,CAAU,GAG1B,CACL,KAAAR,EACA,WAAAQ,EACA,SAAAC,EAEJ,EASA,iBAAiBF,EAAgB,CAC/B,GAAIA,GAAOA,EAAI,aAAeA,EAAI,KAAK,OACrC,OAAOA,EAAI,IAEf,IA9FqB,oBAkGzBK,GAAehB,GCnIf,IAAAiB,GAAmB,SAuBnB,IAAYC,GAAZ,SAAYA,EAAa,CACvBA,EAAA,KAAA,OACAA,EAAA,MAAA,QACAA,EAAA,OAAA,SACAA,EAAA,MAAA,QACAA,EAAA,KAAA,OACAA,EAAA,OAAA,QACF,GAPYA,IAAAA,EAAa,CAAA,EAAA,EASzB,IAAMC,GAAmD,CACvD,CAACD,EAAc,IAAI,EAAG,CACpB,GAAIA,EAAc,KAClB,YAAa,iBACb,YAAa,EACb,mBAAoB,EACpB,QAAS,GACT,WAAY,IAAM,KAClB,MAAO,CAAC,UAAY,SAAU,EAC9B,aAAeE,GAAoC,EAAI,MAEzD,CAACF,EAAc,KAAK,EAAG,CACrB,GAAIA,EAAc,MAClB,YAAa,sBACb,YAAa,GACb,mBAAoB,EACpB,QAAS,GACT,WAAY,IAAM,KAClB,MAAO,CAAC,SAAU,EAClB,aAAeG,GAAmC,CAAA,IAAAC,EAChD,OAAA,GAAAC,QAAO,IAAGD,EAAA,GAAAC,QAAO,OAAOF,CAAe,KAAC,MAAAC,IAAA,OAAAA,EAAI,GAAI,OAAO,EAAI,EAAI,KAAO,EAAI,IAAI,GAElF,CAACJ,EAAc,KAAK,EAAG,CACrB,GAAIA,EAAc,MAClB,YAAa,sBACb,YAAa,GACb,mBAAoB,EACpB,QAAS,GACT,WAAY,EAAI,KAAO,KACvB,MAAO,CAAC,SAAU,EAClB,aAAeE,GAAoC,EAAI,KACvD,cAAe,CACb,CACE,YAAa,uCACb,WAAY,uCACZ,UAAW,uCACX,aAAc,0CAIpB,CAACF,EAAc,MAAM,EAAG,CACtB,GAAIA,EAAc,OAClB,YAAa,qBACb,YAAa,GACb,mBAAoB,EACpB,QAAS,GACT,WAAY,KAAO,KACnB,MAAO,CAAC,SAAU,EAClB,aAAeM,GAAqC,IAEtD,CAACN,EAAc,IAAI,EAAG,CACpB,GAAIA,EAAc,KAClB,YAAa,iBACb,YAAa,GACb,mBAAoB,EACpB,QAAS,GACT,WAAY,KAAO,KACnB,MAAO,CAAC,SAAU,EAClB,aAAeM,GAAqC,GACpD,cAAe,CACb,CACE,YAAa,uCACb,WAAY,uCACZ,UAAW,uCACX,aAAc,0CAIpB,CAACN,EAAc,MAAM,EAAG,CACtB,GAAIA,EAAc,OAClB,YAAa,gBACb,YAAa,IACb,mBAAoB,EACpB,QAAS,GACT,WAAY,KAAO,KACnB,MAAO,CAAC,SAAU,EAClB,aAAeM,GAAqC,GACpD,cAAe,CACb,CACE,YAAa,uCACb,WAAY,uCACZ,UAAW,uCACX,aAAc,2CAMhBC,GAAa,CACjB,KAAMP,EAAc,KACpB,SAAUA,EAAc,MACxB,cAAeA,EAAc,OAC7B,SAAUA,EAAc,MACxB,KAAMA,EAAc,KACpB,OAAQA,EAAc,QAGlBQ,GAA6B,OAAO,OAAOP,EAAO,EAK3CQ,GAAoB,MA6B1B,IAAMC,GAAuBC,EAACC,GAAwD,CAC3F,IAAMC,EAASC,GAAY,KAAKC,GAAKA,EAAE,qBAAuBH,CAAY,EAC1E,GAAIC,EAAQ,OAAOA,EACnB,IAAMG,EAAKJ,GAAgB,EAE3B,OADoBE,GAAY,KAAKC,GAAKA,EAAE,cAAgBC,CAAE,CAEhE,EANoC,wBAapC,IAAMC,GAA8B,CAAA,EAC9BC,GAAqD,CAAA,EAE3D,QAAWC,KAAMC,GAAS,CACxB,IAAMC,EAAcD,GAAQD,CAAE,EACxB,CAAE,cAAAG,CAAa,EAAKD,EAC1B,GAAIC,EACF,QAASC,EAAI,EAAGA,EAAID,EAAc,OAAQC,IAAK,CAC7C,IAAMC,EAAOF,EAAcC,CAAC,EAC5BN,GAAkB,KAAKO,EAAK,WAAW,EACvCN,GAAmBM,EAAK,WAAW,EAAIN,GACrCM,EAAK,YAAY,QAAQ,KAAM,EAAE,CAAC,EACnC,OAAA,OAAA,CACC,YAAAH,CAAW,EACRG,CAAI,iXCjLTC,GAAgB,CACpB,CACE,SAAUC,KAIRC,GAAcC,EAAA,IAAM,QAAQ,QAAQ,CAAC,EAAE,OAAO,WAAa,OAAO,UAAU,IAAI,EAAlE,eAEdC,GAASD,EAAA,IAAU,CAEvB,GAAM,CAAE,IAAAE,CAAG,EAAK,UAChB,GAAI,CAACA,EAAK,MAAM,IAAIC,EAAe,iCAAkC,iBAAiB,EACtF,OAAOD,CACT,EALe,UAOf,SAAeE,IAAoB,yCACjC,IAAMC,EAAS,MAAMJ,GAAM,EAAG,cAAc,CAC1C,QAASJ,GACV,EACD,OAAI,MAAM,QAAQQ,CAAM,EAAUA,EAC3B,CAACA,CAAM,CAChB,CAAC,EANcL,EAAAI,GAAA,wBAQf,SAAeE,IAAgB,yCAE7B,OADgB,MAAML,GAAM,EAAG,WAAU,GAC1B,OAAOM,GAAKA,EAAE,WAAaT,EAAiB,CAC7D,CAAC,EAHcE,EAAAM,GAAA,oBAKf,SAAeE,IAAoB,yCACjC,IAAMC,EAAkB,MAAMH,GAAgB,EAC9C,OAAIG,EAAgB,OAAS,EAAUA,EAAgB,CAAC,GACxC,MAAML,GAAoB,GAC3B,CAAC,CAClB,CAAC,EALcJ,EAAAQ,GAAA,wBAcf,IAAqBE,EAArB,MAAqBC,UAAwBC,EAAS,OAAA,CAAAZ,EAAA,wBAMpD,YAAYK,EAAiB,CAC3B,MAAK,EAJP,KAAA,QAAU,KAAK,MAAM,KAAK,OAAM,EAAK,KAAM,EAC3C,KAAA,WAAa,GAUb,KAAA,OAAmB,CAAA,EAEnB,KAAA,KAAO,IACD,KAAK,OAAO,OACP,QAAQ,QAAQ,KAAK,OAAO,MAAK,CAAuB,EAG1D,IAAI,QAAQQ,GAAU,CAC3B,KAAK,cAAgBA,CACvB,CAAC,EAEH,KAAA,cAAiBC,GAA0B,CACzC,IAAMC,EAAS,OAAO,KAAKD,EAAE,KAAK,MAAM,EAEpC,KAAK,eACP,KAAK,cAAcC,CAAM,EACzB,KAAK,cAAgB,MAErB,KAAK,OAAO,KAAKA,CAAM,CAE3B,EAuFA,KAAA,mBAAqB,GACrB,KAAA,gBAAmBD,GAAY,CACzB,KAAK,qBACT,KAAK,mBAAqB,GAC1B,KAAK,KAAK,aAAcA,CAAC,EAC3B,EAgBA,KAAA,SAAkBE,GAAiCC,EAAA,KAAA,OAAA,OAAA,WAAA,CAgCjD,OA/BU,MAAM,KAAK,mBAAmB,IAAWA,EAAA,KAAA,OAAA,OAAA,WAAA,CACjD,GAAM,CAAE,QAAAC,EAAS,WAAAC,CAAU,EAAK,KAChCC,GAAI,OAAQ,MAAQJ,EAAK,SAAS,KAAK,CAAC,EACxC,IAAMK,EAAUC,GAAWJ,EAASC,CAAU,EAExCI,EAASF,EAAQ,WAAWL,CAAI,EAEtC,QAASQ,EAAI,EAAGA,EAAID,EAAO,OAAQC,IACjC,MAAM,KAAK,OAAO,WAAW,EAAGD,EAAOC,CAAC,CAAC,EAI3C,IAAIC,EACAC,EAEJ,KAAO,EAAED,EAASJ,EAAQ,iBAAiBK,CAAG,IAAI,CAChD,IAAMX,EAAS,MAAM,KAAK,KAAI,EAC9BW,EAAML,EAAQ,eAAeK,EAAKX,CAAM,EAG1C,OAAAK,GAAI,OAAQ,MAAQK,EAAO,SAAS,KAAK,CAAC,EACnCA,CACT,CAAC,CAAA,EAAE,MAAMX,GAAI,CACX,MAAIA,GAAKA,EAAE,SAAWA,EAAE,QAAQ,SAAS,OAAO,GAC9C,KAAK,gBAAgBA,CAAC,EAEhB,IAAIa,GAAkCb,EAAE,OAAO,GAGjDA,CACR,CAAC,CAEH,CAAC,EAvKC,KAAK,OAAST,EACd,KAAK,YACH,OAAOA,EAAO,WAAc,SAAWuB,GAAqBvB,EAAO,SAAS,EAAI,OAClFA,EAAO,iBAAiB,cAAe,KAAK,aAAa,CAC3D,CA4EA,OAAa,SAAO,yCAClB,GAAM,CAACA,CAAM,EAAI,MAAMD,GAAoB,EAC3C,OAAOO,EAAgB,KAAKN,CAAM,CACpC,CAAC,EAKD,OAAa,eAAa,yCACxB,IAAMwB,EAAU,MAAMvB,GAAgB,EACtC,OAAIuB,EAAQ,SAAW,EAAU,KAC1BlB,EAAgB,KAAKkB,EAAQ,CAAC,CAAC,CACxC,CAAC,EAKD,OAAa,KAAKxB,EAAiB,yCACjC,MAAMA,EAAO,KAAI,EACjB,IAAMyB,EAAY,IAAInB,EAAgBN,CAAM,EAEtC0B,EAAe/B,EAAAc,GAAI,CACnBT,IAAWS,EAAE,SACfb,GAAM,EAAG,oBAAoB,aAAc8B,CAAY,EAEvDD,EAAU,gBAAgB,IAAIE,EAAoB,EAEtD,EANqB,gBAQrB,OAAA/B,GAAM,EAAG,iBAAiB,aAAc8B,CAAY,EAC7CD,CACT,CAAC,EAYK,OAAK,yCACT,MAAM,KAAK,oBACX,KAAK,OAAO,oBAAoB,cAAe,KAAK,aAAa,EACjE,MAAM,KAAK,OAAO,MAAK,CACzB,CAAC,EA0CD,gBAAc,CAAI,GA1IXpB,EAAA,YAAcX,GAKdW,EAAA,KAAOJ,GAQPI,EAAA,OAAUuB,GAAgE,CAC/E,IAAIC,EAAe,GACnB1B,GAAoB,EAAG,KACrBH,GAAS,CACP,GAAI,CAACA,EACH4B,EAAS,MAAM,IAAIE,GAA2B,oCAAoC,CAAC,UAC1E,CAACD,EAAc,CACxB,IAAME,EACJ,OAAO/B,EAAO,WAAc,SACxBuB,GAAqBvB,EAAO,SAAS,EACrC,OACN4B,EAAS,KAAK,CACZ,KAAM,MACN,WAAY5B,EACZ,YAAA+B,EACD,EACDH,EAAS,SAAQ,EAErB,EACAI,GAAQ,CACNJ,EAAS,MAAM,IAAIE,GAA2BE,EAAM,OAAO,CAAC,CAC9D,CAAC,EAGH,SAASC,GAAW,CAClBJ,EAAe,EACjB,CAFS,OAAAlC,EAAAsC,EAAA,eAIF,CACL,YAAAA,EAEJ,SAnFmB5B",
6
6
  "names": ["require_constants", "__commonJSMin", "exports", "module", "SEMVER_SPEC_VERSION", "MAX_SAFE_INTEGER", "MAX_SAFE_COMPONENT_LENGTH", "MAX_SAFE_BUILD_LENGTH", "RELEASE_TYPES", "require_debug", "__commonJSMin", "exports", "module", "debug", "args", "require_re", "__commonJSMin", "exports", "module", "MAX_SAFE_COMPONENT_LENGTH", "MAX_SAFE_BUILD_LENGTH", "MAX_LENGTH", "debug", "re", "safeRe", "src", "t", "R", "LETTERDASHNUMBER", "safeRegexReplacements", "makeSafeRegex", "__name", "value", "token", "max", "createToken", "name", "isGlobal", "safe", "index", "require_parse_options", "__commonJSMin", "exports", "module", "looseOption", "emptyOpts", "parseOptions", "__name", "options", "require_identifiers", "__commonJSMin", "exports", "module", "numeric", "compareIdentifiers", "__name", "a", "b", "anum", "bnum", "rcompareIdentifiers", "require_semver", "__commonJSMin", "exports", "module", "debug", "MAX_LENGTH", "MAX_SAFE_INTEGER", "re", "t", "parseOptions", "compareIdentifiers", "SemVer", "_SemVer", "__name", "version", "options", "m", "id", "num", "other", "i", "a", "b", "release", "identifier", "identifierBase", "base", "prerelease", "require_parse", "__commonJSMin", "exports", "module", "SemVer", "parse", "__name", "version", "options", "throwErrors", "er", "require_valid", "__commonJSMin", "exports", "module", "parse", "valid", "__name", "version", "options", "v", "require_clean", "__commonJSMin", "exports", "module", "parse", "clean", "__name", "version", "options", "s", "require_inc", "__commonJSMin", "exports", "module", "SemVer", "inc", "__name", "version", "release", "options", "identifier", "identifierBase", "require_diff", "__commonJSMin", "exports", "module", "parse", "diff", "__name", "version1", "version2", "v1", "v2", "comparison", "v1Higher", "highVersion", "lowVersion", "highHasPre", "prefix", "require_major", "__commonJSMin", "exports", "module", "SemVer", "major", "__name", "a", "loose", "require_minor", "__commonJSMin", "exports", "module", "SemVer", "minor", "__name", "a", "loose", "require_patch", "__commonJSMin", "exports", "module", "SemVer", "patch", "__name", "a", "loose", "require_prerelease", "__commonJSMin", "exports", "module", "parse", "prerelease", "__name", "version", "options", "parsed", "require_compare", "__commonJSMin", "exports", "module", "SemVer", "compare", "__name", "a", "b", "loose", "require_rcompare", "__commonJSMin", "exports", "module", "compare", "rcompare", "__name", "a", "b", "loose", "require_compare_loose", "__commonJSMin", "exports", "module", "compare", "compareLoose", "__name", "a", "b", "require_compare_build", "__commonJSMin", "exports", "module", "SemVer", "compareBuild", "__name", "a", "b", "loose", "versionA", "versionB", "require_sort", "__commonJSMin", "exports", "module", "compareBuild", "sort", "__name", "list", "loose", "a", "b", "require_rsort", "__commonJSMin", "exports", "module", "compareBuild", "rsort", "__name", "list", "loose", "a", "b", "require_gt", "__commonJSMin", "exports", "module", "compare", "gt", "__name", "a", "b", "loose", "require_lt", "__commonJSMin", "exports", "module", "compare", "lt", "__name", "a", "b", "loose", "require_eq", "__commonJSMin", "exports", "module", "compare", "eq", "__name", "a", "b", "loose", "require_neq", "__commonJSMin", "exports", "module", "compare", "neq", "__name", "a", "b", "loose", "require_gte", "__commonJSMin", "exports", "module", "compare", "gte", "__name", "a", "b", "loose", "require_lte", "__commonJSMin", "exports", "module", "compare", "lte", "__name", "a", "b", "loose", "require_cmp", "__commonJSMin", "exports", "module", "eq", "neq", "gt", "gte", "lt", "lte", "cmp", "__name", "a", "op", "b", "loose", "require_coerce", "__commonJSMin", "exports", "module", "SemVer", "parse", "re", "t", "coerce", "__name", "version", "options", "match", "next", "require_iterator", "__commonJSMin", "exports", "module", "Yallist", "walker", "require_yallist", "__commonJSMin", "exports", "module", "Yallist", "Node", "list", "self", "item", "i", "l", "__name", "node", "next", "prev", "head", "tail", "push", "unshift", "res", "fn", "thisp", "walker", "n", "initial", "acc", "arr", "from", "to", "ret", "start", "deleteCount", "nodes", "insert", "p", "value", "inserted", "require_lru_cache", "__commonJSMin", "exports", "module", "Yallist", "MAX", "LENGTH", "LENGTH_CALCULATOR", "ALLOW_STALE", "MAX_AGE", "DISPOSE", "NO_DISPOSE_ON_SET", "LRU_LIST", "CACHE", "UPDATE_AGE_ON_GET", "naiveLength", "__name", "LRUCache", "options", "max", "lc", "mL", "trim", "allowStale", "mA", "lC", "hit", "fn", "thisp", "walker", "prev", "forEachStep", "next", "k", "isStale", "h", "key", "value", "maxAge", "now", "len", "del", "item", "Entry", "get", "node", "arr", "l", "expiresAt", "self", "doUse", "diff", "length", "require_range", "__commonJSMin", "exports", "module", "Range", "_Range", "__name", "range", "options", "parseOptions", "Comparator", "r", "c", "first", "isNullSet", "isAny", "comps", "memoKey", "FLAG_INCLUDE_PRERELEASE", "FLAG_LOOSE", "cached", "cache", "loose", "hr", "re", "t", "hyphenReplace", "debug", "comparatorTrimReplace", "tildeTrimReplace", "caretTrimReplace", "rangeList", "comp", "parseComparator", "replaceGTE0", "rangeMap", "comparators", "result", "thisComparators", "isSatisfiable", "rangeComparators", "thisComparator", "rangeComparator", "version", "SemVer", "i", "testSet", "LRU", "remainingComparators", "testComparator", "otherComparator", "replaceCarets", "replaceTildes", "replaceXRanges", "replaceStars", "isX", "id", "replaceTilde", "_", "M", "m", "p", "pr", "ret", "replaceCaret", "z", "replaceXRange", "gtlt", "xM", "xm", "xp", "anyX", "incPr", "$0", "from", "fM", "fm", "fp", "fpr", "fb", "to", "tM", "tm", "tp", "tpr", "tb", "set", "allowed", "require_comparator", "__commonJSMin", "exports", "module", "ANY", "Comparator", "_Comparator", "__name", "comp", "options", "parseOptions", "debug", "re", "t", "m", "SemVer", "version", "cmp", "Range", "require_satisfies", "__commonJSMin", "exports", "module", "Range", "satisfies", "__name", "version", "range", "options", "require_to_comparators", "__commonJSMin", "exports", "module", "Range", "toComparators", "__name", "range", "options", "comp", "c", "require_max_satisfying", "__commonJSMin", "exports", "module", "SemVer", "Range", "maxSatisfying", "__name", "versions", "range", "options", "max", "maxSV", "rangeObj", "v", "require_min_satisfying", "__commonJSMin", "exports", "module", "SemVer", "Range", "minSatisfying", "__name", "versions", "range", "options", "min", "minSV", "rangeObj", "v", "require_min_version", "__commonJSMin", "exports", "module", "SemVer", "Range", "gt", "minVersion", "__name", "range", "loose", "minver", "i", "comparators", "setMin", "comparator", "compver", "require_valid", "__commonJSMin", "exports", "module", "Range", "validRange", "__name", "range", "options", "require_outside", "__commonJSMin", "exports", "module", "SemVer", "Comparator", "ANY", "Range", "satisfies", "gt", "lt", "lte", "gte", "outside", "__name", "version", "range", "hilo", "options", "gtfn", "ltefn", "ltfn", "comp", "ecomp", "i", "comparators", "high", "low", "comparator", "require_gtr", "__commonJSMin", "exports", "module", "outside", "gtr", "__name", "version", "range", "options", "require_ltr", "__commonJSMin", "exports", "module", "outside", "ltr", "__name", "version", "range", "options", "require_intersects", "__commonJSMin", "exports", "module", "Range", "intersects", "__name", "r1", "r2", "options", "require_simplify", "__commonJSMin", "exports", "module", "satisfies", "compare", "versions", "range", "options", "set", "first", "prev", "v", "a", "b", "version", "ranges", "min", "max", "simplified", "original", "require_subset", "__commonJSMin", "exports", "module", "Range", "Comparator", "ANY", "satisfies", "compare", "subset", "__name", "sub", "dom", "options", "sawNonNull", "OUTER", "simpleSub", "simpleDom", "isSub", "simpleSubset", "minimumVersionWithPreRelease", "minimumVersion", "eqSet", "gt", "lt", "c", "higherGT", "lowerLT", "gtltComp", "eq", "higher", "lower", "hasDomLT", "hasDomGT", "needDomLTPre", "needDomGTPre", "a", "b", "comp", "require_semver", "__commonJSMin", "exports", "module", "internalRe", "constants", "SemVer", "identifiers", "parse", "valid", "clean", "inc", "diff", "major", "minor", "patch", "prerelease", "compare", "rcompare", "compareLoose", "compareBuild", "sort", "rsort", "gt", "lt", "eq", "neq", "gte", "lte", "cmp", "coerce", "Comparator", "Range", "satisfies", "toComparators", "maxSatisfying", "minSatisfying", "minVersion", "validRange", "outside", "gtr", "ltr", "intersects", "simplifyRange", "subset", "e", "t", "n", "r", "i", "o", "__name", "s", "u", "f", "v", "a", "l", "h", "c", "p", "y", "y", "emitter", "event", "resolve", "reject", "eventListener", "args", "errorListener", "__name", "err", "unconsumedEventValues", "unconsumedPromises", "error", "finished", "iterator", "value", "p", "eventHandler", "errorHandler", "promise", "toError", "EventEmitter", "defaultMaxListeners", "init", "listenerCount", "on", "once", "DEFAULT_LOG_TYPE", "Transport", "__name", "context", "logType", "y", "cla", "ins", "p1", "p2", "data", "statusList", "StatusCodes", "abortTimeoutMs", "__awaiter", "tracer", "TransportError", "response", "sw", "s", "TransportStatusError", "LocalTracer", "_apdu", "_abortTimeoutMs", "apdus", "observer", "unsubscribed", "unsubscribe", "apdu", "r", "status", "e", "_key", "eventName", "cb", "event", "args", "exchangeTimeout", "unresponsiveTimeout", "openTimeout", "listenTimeout", "resolve", "reject", "found", "sub", "listenTimeoutId", "f", "TransportPendingOperation", "resolveBusy", "busyPromise", "unresponsiveReached", "timeout", "res", "self", "methods", "scrambleKey", "methodName", "ctx", "_appAPIlock", "contextToAdd", "Tag", "asUInt16BE", "value", "b", "__name", "initialAcc", "createHIDframing", "channel", "packetSize", "apdu", "data", "blockSize", "nbBlocks", "blocks", "i", "head", "chunk", "acc", "dataLength", "sequence", "TransportError", "chunkData", "hid_framing_default", "import_semver", "DeviceModelId", "devices", "_firwareVersion", "firmwareVersion", "_a", "semver", "_firmwareVersion", "productMap", "devicesList", "ledgerUSBVendorId", "identifyUSBProductId", "__name", "usbProductId", "legacy", "devicesList", "d", "mm", "bluetoothServices", "serviceUuidToInfos", "id", "devices", "deviceModel", "bluetoothSpec", "i", "spec", "ledgerDevices", "ledgerUSBVendorId", "isSupported", "__name", "getHID", "hid", "TransportError", "requestLedgerDevices", "device", "getLedgerDevices", "d", "getFirstLedgerDevice", "existingDevices", "TransportWebHID", "_TransportWebHID", "Transport_default", "success", "e", "buffer", "apdu", "__awaiter", "channel", "packetSize", "log", "framing", "hid_framing_default", "blocks", "i", "result", "acc", "DisconnectedDeviceDuringOperation", "identifyUSBProductId", "devices", "transport", "onDisconnect", "DisconnectedDevice", "observer", "unsubscribed", "TransportOpenUserCancelled", "deviceModel", "error", "unsubscribe"]