| 'use strict'; |
| |
| const has = Object.hasOwn || Function.call.bind({}.hasOwnProperty); |
|
|
| const VERSION_PATTERN = /(\d+)(?:\.(\d+))?(?:\.(\d+))?/; |
|
|
| class SemVer { |
| constructor(input) { |
| const match = VERSION_PATTERN.exec(input); |
| if (!match) throw new TypeError(`Invalid version: ${ input }`); |
| const [, $major, $minor, $patch] = match; |
| this.major = +$major; |
| this.minor = $minor ? +$minor : 0; |
| this.patch = $patch ? +$patch : 0; |
| } |
| toString() { |
| return `${ this.major }.${ this.minor }.${ this.patch }`; |
| } |
| } |
|
|
| function semver(input) { |
| return input instanceof SemVer ? input : new SemVer(input); |
| } |
|
|
| function compare($a, operator, $b) { |
| const a = semver($a); |
| const b = semver($b); |
| for (const component of ['major', 'minor', 'patch']) { |
| if (a[component] < b[component]) return operator === '<' || operator === '<=' || operator === '!='; |
| if (a[component] > b[component]) return operator === '>' || operator === '>=' || operator === '!='; |
| } return operator === '==' || operator === '<=' || operator === '>='; |
| } |
|
|
| function filterOutStabilizedProposals(modules) { |
| const modulesSet = new Set(modules); |
|
|
| for (const $module of modulesSet) { |
| if ($module.startsWith('esnext.') && modulesSet.has($module.replace(/^esnext\./, 'es.'))) { |
| modulesSet.delete($module); |
| } |
| } |
|
|
| return [...modulesSet]; |
| } |
|
|
| function intersection(list, order) { |
| const set = list instanceof Set ? list : new Set(list); |
| return order.filter(name => set.has(name)); |
| } |
|
|
| function sortObjectByKey(object, fn) { |
| return Object.keys(object).sort(fn).reduce((memo, key) => { |
| memo[key] = object[key]; |
| return memo; |
| }, {}); |
| } |
|
|
| module.exports = { |
| compare, |
| filterOutStabilizedProposals, |
| has, |
| intersection, |
| semver, |
| sortObjectByKey, |
| }; |
|
|