setup-cpp/dist/library/assets/actions_python-B1irFGVe.mjs.map

Install all the tools required for building and testing C++/C projects.

{"version":3,"file":"actions_python-B1irFGVe.mjs","sources":["../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/clean.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/inc.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/diff.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/minor.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/patch.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/prerelease.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/rcompare.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/compare-loose.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/compare-build.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/sort.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/functions/rsort.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/to-comparators.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/max-satisfying.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/min-satisfying.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/min-version.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/valid.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/outside.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/gtr.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/ltr.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/intersects.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/simplify.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/ranges/subset.js","../../../node_modules/.pnpm/semver@7.7.2/node_modules/semver/index.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/parser.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/create-datetime.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/format-num.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/create-datetime-float.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/create-date.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/create-time.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/lib/toml-parser.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/parse-pretty-error.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/parse-string.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/parse-async.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/parse-stream.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/parse.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/stringify.js","../../../node_modules/.pnpm/@iarna+toml@3.0.0/node_modules/@iarna/toml/toml.js","../../../node_modules/.pnpm/setup-python@https+++codelo_eeb6e527c322ef24d136a9322faedeba/node_modules/setup-python/src/utils.ts","../../../node_modules/.pnpm/setup-python@https+++codelo_eeb6e527c322ef24d136a9322faedeba/node_modules/setup-python/src/install-pypy.ts","../../../node_modules/.pnpm/setup-python@https+++codelo_eeb6e527c322ef24d136a9322faedeba/node_modules/setup-python/src/find-pypy.ts","../../../node_modules/.pnpm/setup-python@https+++codelo_eeb6e527c322ef24d136a9322faedeba/node_modules/setup-python/src/install-python.ts","../../../node_modules/.pnpm/setup-python@https+++codelo_eeb6e527c322ef24d136a9322faedeba/node_modules/setup-python/src/find-python.ts","../../../src/python/actions_python.ts"],"sourcesContent":["'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n  const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n  return s ? s.version : null\n}\nmodule.exports = clean\n","'use strict'\n\nconst 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","'use strict'\n\nconst 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    // If the main part has no difference\n    if (lowVersion.compareMain(highVersion) === 0) {\n      if (lowVersion.minor && !lowVersion.patch) {\n        return 'minor'\n      }\n      return 'patch'\n    }\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","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n","'use strict'\n\nconst 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","'use strict'\n\nconst compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n","'use strict'\n\nconst compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n","'use strict'\n\nconst 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","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n","'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n  new Range(range, options).set\n    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n  let max = null\n  let maxSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!max || maxSV.compare(v) === -1) {\n        // compare(max, v, true)\n        max = v\n        maxSV = new SemVer(max, options)\n      }\n    }\n  })\n  return max\n}\nmodule.exports = maxSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n  let min = null\n  let minSV = null\n  let rangeObj = null\n  try {\n    rangeObj = new Range(range, options)\n  } catch (er) {\n    return null\n  }\n  versions.forEach((v) => {\n    if (rangeObj.test(v)) {\n      // satisfies(v, range, options)\n      if (!min || minSV.compare(v) === 1) {\n        // compare(min, v, true)\n        min = v\n        minSV = new SemVer(min, options)\n      }\n    }\n  })\n  return min\n}\nmodule.exports = minSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n  range = new Range(range, loose)\n\n  let minver = new SemVer('0.0.0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = new SemVer('0.0.0-0')\n  if (range.test(minver)) {\n    return minver\n  }\n\n  minver = null\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let setMin = null\n    comparators.forEach((comparator) => {\n      // Clone to avoid manipulating the comparator's semver object.\n      const compver = new SemVer(comparator.semver.version)\n      switch (comparator.operator) {\n        case '>':\n          if (compver.prerelease.length === 0) {\n            compver.patch++\n          } else {\n            compver.prerelease.push(0)\n          }\n          compver.raw = compver.format()\n          /* fallthrough */\n        case '':\n        case '>=':\n          if (!setMin || gt(compver, setMin)) {\n            setMin = compver\n          }\n          break\n        case '<':\n        case '<=':\n          /* Ignore maximum versions */\n          break\n        /* istanbul ignore next */\n        default:\n          throw new Error(`Unexpected operation: ${comparator.operator}`)\n      }\n    })\n    if (setMin && (!minver || gt(minver, setMin))) {\n      minver = setMin\n    }\n  }\n\n  if (minver && range.test(minver)) {\n    return minver\n  }\n\n  return null\n}\nmodule.exports = minVersion\n","'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n  try {\n    // Return '*' instead of '' so that truthiness works.\n    // This will throw if it's invalid anyway\n    return new Range(range, options).range || '*'\n  } catch (er) {\n    return null\n  }\n}\nmodule.exports = validRange\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n  version = new SemVer(version, options)\n  range = new Range(range, options)\n\n  let gtfn, ltefn, ltfn, comp, ecomp\n  switch (hilo) {\n    case '>':\n      gtfn = gt\n      ltefn = lte\n      ltfn = lt\n      comp = '>'\n      ecomp = '>='\n      break\n    case '<':\n      gtfn = lt\n      ltefn = gte\n      ltfn = gt\n      comp = '<'\n      ecomp = '<='\n      break\n    default:\n      throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n  }\n\n  // If it satisfies the range it is not outside\n  if (satisfies(version, range, options)) {\n    return false\n  }\n\n  // From now on, variable terms are as if we're in \"gtr\" mode.\n  // but note that everything is flipped for the \"ltr\" function.\n\n  for (let i = 0; i < range.set.length; ++i) {\n    const comparators = range.set[i]\n\n    let high = null\n    let low = null\n\n    comparators.forEach((comparator) => {\n      if (comparator.semver === ANY) {\n        comparator = new Comparator('>=0.0.0')\n      }\n      high = high || comparator\n      low = low || comparator\n      if (gtfn(comparator.semver, high.semver, options)) {\n        high = comparator\n      } else if (ltfn(comparator.semver, low.semver, options)) {\n        low = comparator\n      }\n    })\n\n    // If the edge version comparator has a operator then our version\n    // isn't outside it\n    if (high.operator === comp || high.operator === ecomp) {\n      return false\n    }\n\n    // If the lowest version comparator has an operator and our version\n    // is less than it then it isn't higher than the range\n    if ((!low.operator || low.operator === comp) &&\n        ltefn(version, low.semver)) {\n      return false\n    } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n      return false\n    }\n  }\n  return true\n}\n\nmodule.exports = outside\n","'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n","'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n","'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n  r1 = new Range(r1, options)\n  r2 = new Range(r2, options)\n  return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n","'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n  const set = []\n  let first = null\n  let prev = null\n  const v = versions.sort((a, b) => compare(a, b, options))\n  for (const version of v) {\n    const included = satisfies(version, range, options)\n    if (included) {\n      prev = version\n      if (!first) {\n        first = version\n      }\n    } else {\n      if (prev) {\n        set.push([first, prev])\n      }\n      prev = null\n      first = null\n    }\n  }\n  if (first) {\n    set.push([first, null])\n  }\n\n  const ranges = []\n  for (const [min, max] of set) {\n    if (min === max) {\n      ranges.push(min)\n    } else if (!max && min === v[0]) {\n      ranges.push('*')\n    } else if (!max) {\n      ranges.push(`>=${min}`)\n    } else if (min === v[0]) {\n      ranges.push(`<=${max}`)\n    } else {\n      ranges.push(`${min} - ${max}`)\n    }\n  }\n  const simplified = ranges.join(' || ')\n  const original = typeof range.raw === 'string' ? range.raw : String(range)\n  return simplified.length < original.length ? simplified : range\n}\n","'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n//   some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n//   - If C is only the ANY comparator, return true\n//   - Else if in prerelease mode, return false\n//   - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n//   - if in prerelease mode, return true\n//   - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n//   - If GT, and EQ does not satisfy GT, return true (null set)\n//   - If LT, and EQ does not satisfy LT, return true (null set)\n//   - If EQ satisfies every C, return true\n//   - Else return false\n// - If GT\n//   - If GT.semver is lower than any > or >= comp in C, return false\n//   - If GT is >=, and GT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n//   - If LT.semver is greater than any < or <= comp in C, return false\n//   - If LT is <=, and LT.semver does not satisfy every C, return false\n//   - If GT.semver has a prerelease, and not in prerelease mode\n//     - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n  if (sub === dom) {\n    return true\n  }\n\n  sub = new Range(sub, options)\n  dom = new Range(dom, options)\n  let sawNonNull = false\n\n  OUTER: for (const simpleSub of sub.set) {\n    for (const simpleDom of dom.set) {\n      const isSub = simpleSubset(simpleSub, simpleDom, options)\n      sawNonNull = sawNonNull || isSub !== null\n      if (isSub) {\n        continue OUTER\n      }\n    }\n    // the null set is a subset of everything, but null simple ranges in\n    // a complex range should be ignored.  so if we saw a non-null range,\n    // then we know this isn't a subset, but if EVERY simple range was null,\n    // then it is a subset.\n    if (sawNonNull) {\n      return false\n    }\n  }\n  return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n  if (sub === dom) {\n    return true\n  }\n\n  if (sub.length === 1 && sub[0].semver === ANY) {\n    if (dom.length === 1 && dom[0].semver === ANY) {\n      return true\n    } else if (options.includePrerelease) {\n      sub = minimumVersionWithPreRelease\n    } else {\n      sub = minimumVersion\n    }\n  }\n\n  if (dom.length === 1 && dom[0].semver === ANY) {\n    if (options.includePrerelease) {\n      return true\n    } else {\n      dom = minimumVersion\n    }\n  }\n\n  const eqSet = new Set()\n  let gt, lt\n  for (const c of sub) {\n    if (c.operator === '>' || c.operator === '>=') {\n      gt = higherGT(gt, c, options)\n    } else if (c.operator === '<' || c.operator === '<=') {\n      lt = lowerLT(lt, c, options)\n    } else {\n      eqSet.add(c.semver)\n    }\n  }\n\n  if (eqSet.size > 1) {\n    return null\n  }\n\n  let gtltComp\n  if (gt && lt) {\n    gtltComp = compare(gt.semver, lt.semver, options)\n    if (gtltComp > 0) {\n      return null\n    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n      return null\n    }\n  }\n\n  // will iterate one or zero times\n  for (const eq of eqSet) {\n    if (gt && !satisfies(eq, String(gt), options)) {\n      return null\n    }\n\n    if (lt && !satisfies(eq, String(lt), options)) {\n      return null\n    }\n\n    for (const c of dom) {\n      if (!satisfies(eq, String(c), options)) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  let higher, lower\n  let hasDomLT, hasDomGT\n  // if the subset has a prerelease, we need a comparator in the superset\n  // with the same tuple and a prerelease, or it's not a subset\n  let needDomLTPre = lt &&\n    !options.includePrerelease &&\n    lt.semver.prerelease.length ? lt.semver : false\n  let needDomGTPre = gt &&\n    !options.includePrerelease &&\n    gt.semver.prerelease.length ? gt.semver : false\n  // exception: <1.2.3-0 is the same as <1.2.3\n  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n    needDomLTPre = false\n  }\n\n  for (const c of dom) {\n    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n    if (gt) {\n      if (needDomGTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomGTPre.major &&\n            c.semver.minor === needDomGTPre.minor &&\n            c.semver.patch === needDomGTPre.patch) {\n          needDomGTPre = false\n        }\n      }\n      if (c.operator === '>' || c.operator === '>=') {\n        higher = higherGT(gt, c, options)\n        if (higher === c && higher !== gt) {\n          return false\n        }\n      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (lt) {\n      if (needDomLTPre) {\n        if (c.semver.prerelease && c.semver.prerelease.length &&\n            c.semver.major === needDomLTPre.major &&\n            c.semver.minor === needDomLTPre.minor &&\n            c.semver.patch === needDomLTPre.patch) {\n          needDomLTPre = false\n        }\n      }\n      if (c.operator === '<' || c.operator === '<=') {\n        lower = lowerLT(lt, c, options)\n        if (lower === c && lower !== lt) {\n          return false\n        }\n      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {\n        return false\n      }\n    }\n    if (!c.operator && (lt || gt) && gtltComp !== 0) {\n      return false\n    }\n  }\n\n  // if there was a < or >, and nothing in the dom, then must be false\n  // UNLESS it was limited by another range in the other direction.\n  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n  if (gt && hasDomLT && !lt && gtltComp !== 0) {\n    return false\n  }\n\n  if (lt && hasDomGT && !gt && gtltComp !== 0) {\n    return false\n  }\n\n  // we needed a prerelease range in a specific tuple, but didn't get one\n  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,\n  // because it includes prereleases in the 1.2.3 tuple\n  if (needDomGTPre || needDomLTPre) {\n    return false\n  }\n\n  return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp > 0 ? a\n    : comp < 0 ? b\n    : b.operator === '>' && a.operator === '>=' ? b\n    : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n  if (!a) {\n    return b\n  }\n  const comp = compare(a.semver, b.semver, options)\n  return comp < 0 ? a\n    : comp > 0 ? b\n    : b.operator === '<' && a.operator === '<=' ? b\n    : a\n}\n\nmodule.exports = subset\n","'use strict'\n\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","'use strict'\nconst ParserEND = 0x110000\nclass ParserError extends Error {\n  /* istanbul ignore next */\n  constructor (msg, filename, linenumber) {\n    super('[ParserError] ' + msg, filename, linenumber)\n    this.name = 'ParserError'\n    this.code = 'ParserError'\n    if (Error.captureStackTrace) Error.captureStackTrace(this, ParserError)\n  }\n}\nclass State {\n  constructor (parser) {\n    this.parser = parser\n    this.buf = ''\n    this.returned = null\n    this.result = null\n    this.resultTable = null\n    this.resultArr = null\n  }\n}\nclass Parser {\n  constructor () {\n    this.pos = 0\n    this.col = 0\n    this.line = 0\n    this.obj = {}\n    this.ctx = this.obj\n    this.stack = []\n    this._buf = ''\n    this.char = null\n    this.ii = 0\n    this.state = new State(this.parseStart)\n  }\n\n  parse (str) {\n    /* istanbul ignore next */\n    if (str.length === 0 || str.length == null) return\n\n    this._buf = String(str)\n    this.ii = -1\n    this.char = -1\n    let getNext\n    while (getNext === false || this.nextChar()) {\n      getNext = this.runOne()\n    }\n    this._buf = null\n  }\n  nextChar () {\n    if (this.char === 0x0A) {\n      ++this.line\n      this.col = -1\n    }\n    ++this.ii\n    this.char = this._buf.codePointAt(this.ii)\n    ++this.pos\n    ++this.col\n    return this.haveBuffer()\n  }\n  haveBuffer () {\n    return this.ii < this._buf.length\n  }\n  runOne () {\n    return this.state.parser.call(this, this.state.returned)\n  }\n  finish () {\n    this.char = ParserEND\n    let last\n    do {\n      last = this.state.parser\n      this.runOne()\n    } while (this.state.parser !== last)\n\n    this.ctx = null\n    this.state = null\n    this._buf = null\n\n    return this.obj\n  }\n  next (fn) {\n    /* istanbul ignore next */\n    if (typeof fn !== 'function') throw new ParserError('Tried to set state to non-existent state: ' + JSON.stringify(fn))\n    this.state.parser = fn\n  }\n  goto (fn) {\n    this.next(fn)\n    return this.runOne()\n  }\n  call (fn, returnWith) {\n    if (returnWith) this.next(returnWith)\n    this.stack.push(this.state)\n    this.state = new State(fn)\n  }\n  callNow (fn, returnWith) {\n    this.call(fn, returnWith)\n    return this.runOne()\n  }\n  return (value) {\n    /* istanbul ignore next */\n    if (this.stack.length === 0) throw this.error(new ParserError('Stack underflow'))\n    if (value === undefined) value = this.state.buf\n    this.state = this.stack.pop()\n    this.state.returned = value\n  }\n  returnNow (value) {\n    this.return(value)\n    return this.runOne()\n  }\n  consume () {\n    /* istanbul ignore next */\n    if (this.char === ParserEND) throw this.error(new ParserError('Unexpected end-of-buffer'))\n    this.state.buf += this._buf[this.ii]\n  }\n  error (err) {\n    err.line = this.line\n    err.col = this.col\n    err.pos = this.pos\n    return err\n  }\n  /* istanbul ignore next */\n  parseStart () {\n    throw new ParserError('Must declare a parseStart method')\n  }\n}\nParser.END = ParserEND\nParser.Error = ParserError\nmodule.exports = Parser\n","'use strict'\nmodule.exports = value => {\n  const date = new Date(value)\n  /* istanbul ignore if */\n  if (isNaN(date)) {\n    throw new TypeError('Invalid Datetime')\n  } else {\n    return date\n  }\n}\n","'use strict'\nmodule.exports = (d, num) => {\n  num = String(num)\n  while (num.length < d) num = '0' + num\n  return num\n}\n","'use strict'\nconst f = require('./format-num.js')\n\nclass FloatingDateTime extends Date {\n  constructor (value) {\n    super(value + 'Z')\n    this.isFloating = true\n  }\n  toISOString () {\n    const date = `${this.getUTCFullYear()}-${f(2, this.getUTCMonth() + 1)}-${f(2, this.getUTCDate())}`\n    const time = `${f(2, this.getUTCHours())}:${f(2, this.getUTCMinutes())}:${f(2, this.getUTCSeconds())}.${f(3, this.getUTCMilliseconds())}`\n    return `${date}T${time}`\n  }\n}\n\nmodule.exports = value => {\n  const date = new FloatingDateTime(value)\n  /* istanbul ignore if */\n  if (isNaN(date)) {\n    throw new TypeError('Invalid Datetime')\n  } else {\n    return date\n  }\n}\n","'use strict'\nconst f = require('./format-num.js')\nconst DateTime = global.Date\n\nclass Date extends DateTime {\n  constructor (value) {\n    super(value)\n    this.isDate = true\n  }\n  toISOString () {\n    return `${this.getUTCFullYear()}-${f(2, this.getUTCMonth() + 1)}-${f(2, this.getUTCDate())}`\n  }\n}\n\nmodule.exports = value => {\n  const date = new Date(value)\n  /* istanbul ignore if */\n  if (isNaN(date)) {\n    throw new TypeError('Invalid Datetime')\n  } else {\n    return date\n  }\n}\n","'use strict'\nconst f = require('./format-num.js')\n\nclass Time extends Date {\n  constructor (value) {\n    super(`0000-01-01T${value}Z`)\n    this.isTime = true\n  }\n  toISOString () {\n    return `${f(2, this.getUTCHours())}:${f(2, this.getUTCMinutes())}:${f(2, this.getUTCSeconds())}.${f(3, this.getUTCMilliseconds())}`\n  }\n}\n\nmodule.exports = value => {\n  const date = new Time(value)\n  /* istanbul ignore if */\n  if (isNaN(date)) {\n    throw new TypeError('Invalid Datetime')\n  } else {\n    return date\n  }\n}\n","'use strict'\n/* eslint-disable no-new-wrappers, no-eval, camelcase, operator-linebreak */\nmodule.exports = makeParserClass(require('./parser.js'))\nmodule.exports.makeParserClass = makeParserClass\n\nclass TomlError extends Error {\n  constructor (msg) {\n    super(msg)\n    this.name = 'TomlError'\n    /* istanbul ignore next */\n    if (Error.captureStackTrace) Error.captureStackTrace(this, TomlError)\n    this.fromTOML = true\n    this.wrapped = null\n  }\n}\nTomlError.wrap = err => {\n  const terr = new TomlError(err.message)\n  terr.code = err.code\n  terr.wrapped = err\n  return terr\n}\nmodule.exports.TomlError = TomlError\n\nconst createDateTime = require('./create-datetime.js')\nconst createDateTimeFloat = require('./create-datetime-float.js')\nconst createDate = require('./create-date.js')\nconst createTime = require('./create-time.js')\n\nconst CTRL_I = 0x09\nconst CTRL_J = 0x0A\nconst CTRL_M = 0x0D\nconst CTRL_CHAR_BOUNDARY = 0x1F // the last non-character in the latin1 region of unicode, except DEL\nconst CHAR_SP = 0x20\nconst CHAR_QUOT = 0x22\nconst CHAR_NUM = 0x23\nconst CHAR_APOS = 0x27\nconst CHAR_PLUS = 0x2B\nconst CHAR_COMMA = 0x2C\nconst CHAR_HYPHEN = 0x2D\nconst CHAR_PERIOD = 0x2E\nconst CHAR_0 = 0x30\nconst CHAR_1 = 0x31\nconst CHAR_7 = 0x37\nconst CHAR_9 = 0x39\nconst CHAR_COLON = 0x3A\nconst CHAR_EQUALS = 0x3D\nconst CHAR_A = 0x41\nconst CHAR_E = 0x45\nconst CHAR_F = 0x46\nconst CHAR_T = 0x54\nconst CHAR_U = 0x55\nconst CHAR_Z = 0x5A\nconst CHAR_LOWBAR = 0x5F\nconst CHAR_a = 0x61\nconst CHAR_b = 0x62\nconst CHAR_e = 0x65\nconst CHAR_f = 0x66\nconst CHAR_i = 0x69\nconst CHAR_l = 0x6C\nconst CHAR_n = 0x6E\nconst CHAR_o = 0x6F\nconst CHAR_r = 0x72\nconst CHAR_s = 0x73\nconst CHAR_t = 0x74\nconst CHAR_u = 0x75\nconst CHAR_x = 0x78\nconst CHAR_z = 0x7A\nconst CHAR_LCUB = 0x7B\nconst CHAR_RCUB = 0x7D\nconst CHAR_LSQB = 0x5B\nconst CHAR_BSOL = 0x5C\nconst CHAR_RSQB = 0x5D\nconst CHAR_DEL = 0x7F\nconst SURROGATE_FIRST = 0xD800\nconst SURROGATE_LAST = 0xDFFF\n\nconst escapes = {\n  [CHAR_b]: '\\u0008',\n  [CHAR_t]: '\\u0009',\n  [CHAR_n]: '\\u000A',\n  [CHAR_f]: '\\u000C',\n  [CHAR_r]: '\\u000D',\n  [CHAR_QUOT]: '\\u0022',\n  [CHAR_BSOL]: '\\u005C'\n}\n\nfunction isDigit (cp) {\n  return cp >= CHAR_0 && cp <= CHAR_9\n}\nfunction isHexit (cp) {\n  return (cp >= CHAR_A && cp <= CHAR_F) || (cp >= CHAR_a && cp <= CHAR_f) || (cp >= CHAR_0 && cp <= CHAR_9)\n}\nfunction isBit (cp) {\n  return cp === CHAR_1 || cp === CHAR_0\n}\nfunction isOctit (cp) {\n  return (cp >= CHAR_0 && cp <= CHAR_7)\n}\nfunction isAlphaNumQuoteHyphen (cp) {\n  return (cp >= CHAR_A && cp <= CHAR_Z)\n      || (cp >= CHAR_a && cp <= CHAR_z)\n      || (cp >= CHAR_0 && cp <= CHAR_9)\n      || cp === CHAR_APOS\n      || cp === CHAR_QUOT\n      || cp === CHAR_LOWBAR\n      || cp === CHAR_HYPHEN\n}\nfunction isAlphaNumHyphen (cp) {\n  return (cp >= CHAR_A && cp <= CHAR_Z)\n      || (cp >= CHAR_a && cp <= CHAR_z)\n      || (cp >= CHAR_0 && cp <= CHAR_9)\n      || cp === CHAR_LOWBAR\n      || cp === CHAR_HYPHEN\n}\nconst _type = Symbol('type')\nconst _declared = Symbol('declared')\n\nconst hasOwnProperty = Object.prototype.hasOwnProperty\nconst defineProperty = Object.defineProperty\nconst descriptor = {configurable: true, enumerable: true, writable: true, value: undefined}\n\nfunction hasKey (obj, key) {\n  if (hasOwnProperty.call(obj, key)) return true\n  if (key === '__proto__') defineProperty(obj, '__proto__', descriptor)\n  return false\n}\n\nconst INLINE_TABLE = Symbol('inline-table')\nfunction InlineTable () {\n  return Object.defineProperties({}, {\n    [_type]: {value: INLINE_TABLE}\n  })\n}\nfunction isInlineTable (obj) {\n  if (obj === null || typeof (obj) !== 'object') return false\n  return obj[_type] === INLINE_TABLE\n}\n\nconst TABLE = Symbol('table')\nfunction Table () {\n  return Object.defineProperties({}, {\n    [_type]: {value: TABLE},\n    [_declared]: {value: false, writable: true}\n  })\n}\nfunction isTable (obj) {\n  if (obj === null || typeof (obj) !== 'object') return false\n  return obj[_type] === TABLE\n}\n\nconst _contentType = Symbol('content-type')\nconst INLINE_LIST = Symbol('inline-list')\nfunction InlineList (type) {\n  return Object.defineProperties([], {\n    [_type]: {value: INLINE_LIST},\n    [_contentType]: {value: type}\n  })\n}\nfunction isInlineList (obj) {\n  if (obj === null || typeof (obj) !== 'object') return false\n  return obj[_type] === INLINE_LIST\n}\n\nconst LIST = Symbol('list')\nfunction List () {\n  return Object.defineProperties([], {\n    [_type]: {value: LIST}\n  })\n}\nfunction isList (obj) {\n  if (obj === null || typeof (obj) !== 'object') return false\n  return obj[_type] === LIST\n}\n\n// in an eval, to let bundlers not slurp in a util proxy\nlet _custom\ntry {\n  const utilInspect = eval(\"require('util').inspect\")\n  _custom = utilInspect.custom\n} catch (_) {\n  /* eval require not available in transpiled bundle */\n}\n/* istanbul ignore next */\nconst _inspect = _custom || 'inspect'\n\nclass BoxedBigInt {\n  constructor (value) {\n    try {\n      this.value = global.BigInt.asIntN(64, value)\n    } catch (_) {\n      /* istanbul ignore next */\n      this.value = null\n    }\n    Object.defineProperty(this, _type, {value: INTEGER})\n  }\n  isNaN () {\n    return this.value === null\n  }\n  /* istanbul ignore next */\n  toString () {\n    return String(this.value)\n  }\n  /* istanbul ignore next */\n  [_inspect] () {\n    return `[BigInt: ${this.toString()}]}`\n  }\n  valueOf () {\n    return this.value\n  }\n}\n\nconst INTEGER = Symbol('integer')\nfunction Integer (value) {\n  let num = Number(value)\n  // -0 is a float thing, not an int thing\n  if (Object.is(num, -0)) num = 0\n  /* istanbul ignore else */\n  if (global.BigInt && !Number.isSafeInteger(num)) {\n    return new BoxedBigInt(value)\n  } else {\n    /* istanbul ignore next */\n    return Object.defineProperties(new Number(num), {\n      isNaN: {value: function () { return isNaN(this) }},\n      [_type]: {value: INTEGER},\n      [_inspect]: {value: () => `[Integer: ${value}]`}\n    })\n  }\n}\nfunction isInteger (obj) {\n  if (obj === null || typeof (obj) !== 'object') return false\n  return obj[_type] === INTEGER\n}\n\nconst FLOAT = Symbol('float')\nfunction Float (value) {\n  /* istanbul ignore next */\n  return Object.defineProperties(new Number(value), {\n    [_type]: {value: FLOAT},\n    [_inspect]: {value: () => `[Float: ${value}]`}\n  })\n}\nfunction isFloat (obj) {\n  if (obj === null || typeof (obj) !== 'object') return false\n  return obj[_type] === FLOAT\n}\n\nfunction tomlType (value) {\n  const type = typeof value\n  if (type === 'object') {\n    /* istanbul ignore if */\n    if (value === null) return 'null'\n    if (value instanceof Date) return 'datetime'\n    /* istanbul ignore else */\n    if (_type in value) {\n      switch (value[_type]) {\n        case INLINE_TABLE: return 'inline-table'\n        case INLINE_LIST: return 'inline-list'\n        /* istanbul ignore next */\n        case TABLE: return 'table'\n        /* istanbul ignore next */\n        case LIST: return 'list'\n        case FLOAT: return 'float'\n        case INTEGER: return 'integer'\n      }\n    }\n  }\n  return type\n}\n\nfunction makeParserClass (Parser) {\n  class TOMLParser extends Parser {\n    constructor () {\n      super()\n      this.ctx = this.obj = Table()\n    }\n\n    /* MATCH HELPER */\n    atEndOfWord () {\n      return this.char === CHAR_NUM || this.char === CTRL_I || this.char === CHAR_SP || this.atEndOfLine()\n    }\n    atEndOfLine () {\n      return this.char === Parser.END || this.char === CTRL_J || this.char === CTRL_M\n    }\n\n    parseStart () {\n      if (this.char === Parser.END) {\n        return null\n      } else if (this.char === CHAR_LSQB) {\n        return this.call(this.parseTableOrList)\n      } else if (this.char === CHAR_NUM) {\n        return this.call(this.parseComment)\n      } else if (this.char === CTRL_J || this.char === CHAR_SP || this.char === CTRL_I || this.char === CTRL_M) {\n        return null\n      } else if (isAlphaNumQuoteHyphen(this.char)) {\n        return this.callNow(this.parseAssignStatement)\n      } else {\n        throw this.error(new TomlError(`Unknown character \"${this.char}\"`))\n      }\n    }\n\n    // HELPER, this strips any whitespace and comments to the end of the line\n    // then RETURNS. Last state in a production.\n    parseWhitespaceToEOL () {\n      if (this.char === CHAR_SP || this.char === CTRL_I || this.char === CTRL_M) {\n        return null\n      } else if (this.char === CHAR_NUM) {\n        return this.goto(this.parseComment)\n      } else if (this.char === Parser.END || this.char === CTRL_J) {\n        return this.return()\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected only whitespace or comments till end of line'))\n      }\n    }\n\n    /* ASSIGNMENT: key = value */\n    parseAssignStatement () {\n      return this.callNow(this.parseAssign, this.recordAssignStatement)\n    }\n    recordAssignStatement (kv) {\n      let target = this.ctx\n      let finalKey = kv.key.pop()\n      for (let kw of kv.key) {\n        if (hasKey(target, kw) && !isTable(target[kw])) {\n          throw this.error(new TomlError(\"Can't redefine existing key\"))\n        }\n        target = target[kw] = target[kw] || Table()\n      }\n      if (hasKey(target, finalKey)) {\n        throw this.error(new TomlError(\"Can't redefine existing key\"))\n      }\n      target[_declared] = true\n      // unbox our numbers\n      if (isInteger(kv.value) || isFloat(kv.value)) {\n        target[finalKey] = kv.value.valueOf()\n      } else {\n        target[finalKey] = kv.value\n      }\n      return this.goto(this.parseWhitespaceToEOL)\n    }\n\n    /* ASSSIGNMENT expression, key = value possibly inside an inline table */\n    parseAssign () {\n      return this.callNow(this.parseKeyword, this.recordAssignKeyword)\n    }\n    recordAssignKeyword (key) {\n      if (this.state.resultTable) {\n        this.state.resultTable.push(key)\n      } else {\n        this.state.resultTable = [key]\n      }\n      return this.goto(this.parseAssignKeywordPreDot)\n    }\n    parseAssignKeywordPreDot () {\n      if (this.char === CHAR_PERIOD) {\n        return this.next(this.parseAssignKeywordPostDot)\n      } else if (this.char !== CHAR_SP && this.char !== CTRL_I) {\n        return this.goto(this.parseAssignEqual)\n      }\n    }\n    parseAssignKeywordPostDot () {\n      if (this.char !== CHAR_SP && this.char !== CTRL_I) {\n        return this.callNow(this.parseKeyword, this.recordAssignKeyword)\n      }\n    }\n\n    parseAssignEqual () {\n      if (this.char === CHAR_EQUALS) {\n        return this.next(this.parseAssignPreValue)\n      } else {\n        throw this.error(new TomlError('Invalid character, expected \"=\"'))\n      }\n    }\n    parseAssignPreValue () {\n      if (this.char === CHAR_SP || this.char === CTRL_I) {\n        return null\n      } else {\n        return this.callNow(this.parseValue, this.recordAssignValue)\n      }\n    }\n    recordAssignValue (value) {\n      return this.returnNow({key: this.state.resultTable, value: value})\n    }\n\n    /* COMMENTS: #...eol */\n    parseComment () {\n      do {\n        if (this.char === Parser.END || this.char === CTRL_J) {\n          return this.return()\n        } else if (this.char === CHAR_DEL || (this.char <= CTRL_CHAR_BOUNDARY && this.char !== CTRL_I)) {\n          throw this.errorControlCharIn('comments')\n        }\n      } while (this.nextChar())\n    }\n\n    /* TABLES AND LISTS, [foo] and [[foo]] */\n    parseTableOrList () {\n      if (this.char === CHAR_LSQB) {\n        this.next(this.parseList)\n      } else {\n        return this.goto(this.parseTable)\n      }\n    }\n\n    /* TABLE [foo.bar.baz] */\n    parseTable () {\n      this.ctx = this.obj\n      return this.goto(this.parseTableNext)\n    }\n    parseTableNext () {\n      if (this.char === CHAR_SP || this.char === CTRL_I) {\n        return null\n      } else {\n        return this.callNow(this.parseKeyword, this.parseTableMore)\n      }\n    }\n    parseTableMore (keyword) {\n      if (this.char === CHAR_SP || this.char === CTRL_I) {\n        return null\n      } else if (this.char === CHAR_RSQB) {\n        if (hasKey(this.ctx, keyword) && (!isTable(this.ctx[keyword]) || this.ctx[keyword][_declared])) {\n          throw this.error(new TomlError(\"Can't redefine existing key\"))\n        } else {\n          this.ctx = this.ctx[keyword] = this.ctx[keyword] || Table()\n          this.ctx[_declared] = true\n        }\n        return this.next(this.parseWhitespaceToEOL)\n      } else if (this.char === CHAR_PERIOD) {\n        if (!hasKey(this.ctx, keyword)) {\n          this.ctx = this.ctx[keyword] = Table()\n        } else if (isTable(this.ctx[keyword])) {\n          this.ctx = this.ctx[keyword]\n        } else if (isList(this.ctx[keyword])) {\n          this.ctx = this.ctx[keyword][this.ctx[keyword].length - 1]\n        } else {\n          throw this.error(new TomlError(\"Can't redefine existing key\"))\n        }\n        return this.next(this.parseTableNext)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected whitespace, . or ]'))\n      }\n    }\n\n    /* LIST [[a.b.c]] */\n    parseList () {\n      this.ctx = this.obj\n      return this.goto(this.parseListNext)\n    }\n    parseListNext () {\n      if (this.char === CHAR_SP || this.char === CTRL_I) {\n        return null\n      } else {\n        return this.callNow(this.parseKeyword, this.parseListMore)\n      }\n    }\n    parseListMore (keyword) {\n      if (this.char === CHAR_SP || this.char === CTRL_I) {\n        return null\n      } else if (this.char === CHAR_RSQB) {\n        if (!hasKey(this.ctx, keyword)) {\n          this.ctx[keyword] = List()\n        }\n        if (isInlineList(this.ctx[keyword])) {\n          throw this.error(new TomlError(\"Can't extend an inline array\"))\n        } else if (isList(this.ctx[keyword])) {\n          const next = Table()\n          this.ctx[keyword].push(next)\n          this.ctx = next\n        } else {\n          throw this.error(new TomlError(\"Can't redefine an existing key\"))\n        }\n        return this.next(this.parseListEnd)\n      } else if (this.char === CHAR_PERIOD) {\n        if (!hasKey(this.ctx, keyword)) {\n          this.ctx = this.ctx[keyword] = Table()\n        } else if (isInlineList(this.ctx[keyword])) {\n          throw this.error(new TomlError(\"Can't extend an inline array\"))\n        } else if (isInlineTable(this.ctx[keyword])) {\n          throw this.error(new TomlError(\"Can't extend an inline table\"))\n        } else if (isList(this.ctx[keyword])) {\n          this.ctx = this.ctx[keyword][this.ctx[keyword].length - 1]\n        } else if (isTable(this.ctx[keyword])) {\n          this.ctx = this.ctx[keyword]\n        } else {\n          throw this.error(new TomlError(\"Can't redefine an existing key\"))\n        }\n        return this.next(this.parseListNext)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected whitespace, . or ]'))\n      }\n    }\n    parseListEnd (keyword) {\n      if (this.char === CHAR_RSQB) {\n        return this.next(this.parseWhitespaceToEOL)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected whitespace, . or ]'))\n      }\n    }\n\n    /* VALUE string, number, boolean, inline list, inline object */\n    parseValue () {\n      if (this.char === Parser.END) {\n        throw this.error(new TomlError('Key without value'))\n      } else if (this.char === CHAR_QUOT) {\n        return this.next(this.parseDoubleString)\n      } if (this.char === CHAR_APOS) {\n        return this.next(this.parseSingleString)\n      } else if (this.char === CHAR_HYPHEN || this.char === CHAR_PLUS) {\n        return this.goto(this.parseNumberSign)\n      } else if (this.char === CHAR_i) {\n        return this.next(this.parseInf)\n      } else if (this.char === CHAR_n) {\n        return this.next(this.parseNan)\n      } else if (isDigit(this.char)) {\n        return this.goto(this.parseNumberOrDateTime)\n      } else if (this.char === CHAR_t || this.char === CHAR_f) {\n        return this.goto(this.parseBoolean)\n      } else if (this.char === CHAR_LSQB) {\n        return this.call(this.parseInlineList, this.recordValue)\n      } else if (this.char === CHAR_LCUB) {\n        return this.call(this.parseInlineTable, this.recordValue)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expecting string, number, datetime, boolean, inline array or inline table'))\n      }\n    }\n    recordValue (value) {\n      return this.returnNow(value)\n    }\n\n    parseInf () {\n      if (this.char === CHAR_n) {\n        return this.next(this.parseInf2)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected \"inf\", \"+inf\" or \"-inf\"'))\n      }\n    }\n    parseInf2 () {\n      if (this.char === CHAR_f) {\n        if (this.state.buf === '-') {\n          return this.return(-Infinity)\n        } else {\n          return this.return(Infinity)\n        }\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected \"inf\", \"+inf\" or \"-inf\"'))\n      }\n    }\n\n    parseNan () {\n      if (this.char === CHAR_a) {\n        return this.next(this.parseNan2)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected \"nan\"'))\n      }\n    }\n    parseNan2 () {\n      if (this.char === CHAR_n) {\n        return this.return(NaN)\n      } else {\n        throw this.error(new TomlError('Unexpected character, expected \"nan\"'))\n      }\n    }\n\n    /* KEYS, barewords or basic, literal, or dotted */\n    parseKeyword () {\n      if (this.char === CHAR_QUOT) {\n        return this.next(this.parseBasicString)\n      } else if (this.char === CHAR_APOS) {\n        return this.next(this.parseLiteralString)\n      } else {\n        return this.goto(this.parseBareKey)\n      }\n    }\n\n    /* KEYS: barewords */\n    parseBareKey () {\n      do {\n        if (this.char === Parser.END) {\n          throw this.error(new TomlError('Key ended without value'))\n        } else if (isAlphaNumHyphen(this.char)) {\n          this.consume()\n        } else if (this.state.buf.length === 0) {\n          throw this.error(new TomlError('Empty bare keys are not allowed'))\n        } else {\n          return this.returnNow()\n        }\n      } while (this.nextChar())\n    }\n\n    /* STRINGS, single quoted (literal) */\n    parseSingleString () {\n      if (this.char === CHAR_APOS) {\n        return this.next(this.parseLiteralMultiStringMaybe)\n      } else {\n        retur