swc/crates/swc_bundler/tests/.cache/deno/96ffc1e38aa910376b9584f63a3fe04af09d4fe7.ts

1814 lines
45 KiB
TypeScript
Raw Normal View History

// Loaded from https://deno.land/x/semver@v1.0.0/mod.ts
export type ReleaseType =
| "pre"
| "major"
| "premajor"
| "minor"
| "preminor"
| "patch"
| "prepatch"
| "prerelease";
export type Operator =
| "==="
| "!=="
| ""
| "="
| "=="
| "!="
| ">"
| ">="
| "<"
| "<=";
export interface Options {
loose?: boolean;
includePrerelease?: boolean;
}
// Note: this is the semver.org version of the spec that it implements
// Not necessarily the package version of this code.
export const SEMVER_SPEC_VERSION = "2.0.0";
const MAX_LENGTH: number = 256;
// Max safe segment length for coercion.
const MAX_SAFE_COMPONENT_LENGTH: number = 16;
// The actual regexps
const re: RegExp[] = [];
const src: string[] = [];
let R: number = 0;
// The following Regular Expressions can be used for tokenizing,
// validating, and parsing SemVer version strings.
// ## Numeric Identifier
// A single `0`, or a non-zero digit followed by zero or more digits.
const NUMERICIDENTIFIER: number = R++;
src[NUMERICIDENTIFIER] = "0|[1-9]\\d*";
const NUMERICIDENTIFIERLOOSE: number = R++;
src[NUMERICIDENTIFIERLOOSE] = "[0-9]+";
// ## Non-numeric Identifier
// Zero or more digits, followed by a letter or hyphen, and then zero or
// more letters, digits, or hyphens.
const NONNUMERICIDENTIFIER: number = R++;
src[NONNUMERICIDENTIFIER] = "\\d*[a-zA-Z-][a-zA-Z0-9-]*";
// ## Main Version
// Three dot-separated numeric identifiers.
const MAINVERSION: number = R++;
const nid = src[NUMERICIDENTIFIER];
src[MAINVERSION] = `(${nid})\\.(${nid})\\.(${nid})`;
const MAINVERSIONLOOSE: number = R++;
const nidl = src[NUMERICIDENTIFIERLOOSE];
src[MAINVERSIONLOOSE] = `(${nidl})\\.(${nidl})\\.(${nidl})`;
// ## Pre-release Version Identifier
// A numeric identifier, or a non-numeric identifier.
const PRERELEASEIDENTIFIER: number = R++;
src[PRERELEASEIDENTIFIER] =
"(?:" + src[NUMERICIDENTIFIER] + "|" + src[NONNUMERICIDENTIFIER] + ")";
const PRERELEASEIDENTIFIERLOOSE: number = R++;
src[PRERELEASEIDENTIFIERLOOSE] =
"(?:" + src[NUMERICIDENTIFIERLOOSE] + "|" + src[NONNUMERICIDENTIFIER] + ")";
// ## Pre-release Version
// Hyphen, followed by one or more dot-separated pre-release version
// identifiers.
const PRERELEASE: number = R++;
src[PRERELEASE] =
"(?:-(" +
src[PRERELEASEIDENTIFIER] +
"(?:\\." +
src[PRERELEASEIDENTIFIER] +
")*))";
const PRERELEASELOOSE: number = R++;
src[PRERELEASELOOSE] =
"(?:-?(" +
src[PRERELEASEIDENTIFIERLOOSE] +
"(?:\\." +
src[PRERELEASEIDENTIFIERLOOSE] +
")*))";
// ## Build Metadata Identifier
// Any combination of digits, letters, or hyphens.
const BUILDIDENTIFIER: number = R++;
src[BUILDIDENTIFIER] = "[0-9A-Za-z-]+";
// ## Build Metadata
// Plus sign, followed by one or more period-separated build metadata
// identifiers.
const BUILD: number = R++;
src[BUILD] =
"(?:\\+(" + src[BUILDIDENTIFIER] + "(?:\\." + src[BUILDIDENTIFIER] + ")*))";
// ## Full Version String
// A main version, followed optionally by a pre-release version and
// build metadata.
// Note that the only major, minor, patch, and pre-release sections of
// the version string are capturing groups. The build metadata is not a
// capturing group, because it should not ever be used in version
// comparison.
const FULL: number = R++;
const FULLPLAIN =
"v?" + src[MAINVERSION] + src[PRERELEASE] + "?" + src[BUILD] + "?";
src[FULL] = "^" + FULLPLAIN + "$";
// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.
// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty
// common in the npm registry.
const LOOSEPLAIN: string =
"[v=\\s]*" +
src[MAINVERSIONLOOSE] +
src[PRERELEASELOOSE] +
"?" +
src[BUILD] +
"?";
const LOOSE: number = R++;
src[LOOSE] = "^" + LOOSEPLAIN + "$";
const GTLT: number = R++;
src[GTLT] = "((?:<|>)?=?)";
// Something like "2.*" or "1.2.x".
// Note that "x.x" is a valid xRange identifer, meaning "any version"
// Only the first item is strictly required.
const XRANGEIDENTIFIERLOOSE: number = R++;
src[XRANGEIDENTIFIERLOOSE] = src[NUMERICIDENTIFIERLOOSE] + "|x|X|\\*";
const XRANGEIDENTIFIER: number = R++;
src[XRANGEIDENTIFIER] = src[NUMERICIDENTIFIER] + "|x|X|\\*";
const XRANGEPLAIN: number = R++;
src[XRANGEPLAIN] =
"[v=\\s]*(" +
src[XRANGEIDENTIFIER] +
")" +
"(?:\\.(" +
src[XRANGEIDENTIFIER] +
")" +
"(?:\\.(" +
src[XRANGEIDENTIFIER] +
")" +
"(?:" +
src[PRERELEASE] +
")?" +
src[BUILD] +
"?" +
")?)?";
const XRANGEPLAINLOOSE: number = R++;
src[XRANGEPLAINLOOSE] =
"[v=\\s]*(" +
src[XRANGEIDENTIFIERLOOSE] +
")" +
"(?:\\.(" +
src[XRANGEIDENTIFIERLOOSE] +
")" +
"(?:\\.(" +
src[XRANGEIDENTIFIERLOOSE] +
")" +
"(?:" +
src[PRERELEASELOOSE] +
")?" +
src[BUILD] +
"?" +
")?)?";
const XRANGE: number = R++;
src[XRANGE] = "^" + src[GTLT] + "\\s*" + src[XRANGEPLAIN] + "$";
const XRANGELOOSE = R++;
src[XRANGELOOSE] = "^" + src[GTLT] + "\\s*" + src[XRANGEPLAINLOOSE] + "$";
// Coercion.
// Extract anything that could conceivably be a part of a valid semver
const COERCE: number = R++;
src[COERCE] =
"(?:^|[^\\d])" +
"(\\d{1," +
MAX_SAFE_COMPONENT_LENGTH +
"})" +
"(?:\\.(\\d{1," +
MAX_SAFE_COMPONENT_LENGTH +
"}))?" +
"(?:\\.(\\d{1," +
MAX_SAFE_COMPONENT_LENGTH +
"}))?" +
"(?:$|[^\\d])";
// Tilde ranges.
// Meaning is "reasonably at or greater than"
const LONETILDE: number = R++;
src[LONETILDE] = "(?:~>?)";
const TILDETRIM: number = R++;
src[TILDETRIM] = "(\\s*)" + src[LONETILDE] + "\\s+";
re[TILDETRIM] = new RegExp(src[TILDETRIM], "g");
const tildeTrimReplace: string = "$1~";
const TILDE: number = R++;
src[TILDE] = "^" + src[LONETILDE] + src[XRANGEPLAIN] + "$";
const TILDELOOSE: number = R++;
src[TILDELOOSE] = "^" + src[LONETILDE] + src[XRANGEPLAINLOOSE] + "$";
// Caret ranges.
// Meaning is "at least and backwards compatible with"
const LONECARET: number = R++;
src[LONECARET] = "(?:\\^)";
const CARETTRIM: number = R++;
src[CARETTRIM] = "(\\s*)" + src[LONECARET] + "\\s+";
re[CARETTRIM] = new RegExp(src[CARETTRIM], "g");
const caretTrimReplace: string = "$1^";
const CARET: number = R++;
src[CARET] = "^" + src[LONECARET] + src[XRANGEPLAIN] + "$";
const CARETLOOSE: number = R++;
src[CARETLOOSE] = "^" + src[LONECARET] + src[XRANGEPLAINLOOSE] + "$";
// A simple gt/lt/eq thing, or just "" to indicate "any version"
const COMPARATORLOOSE: number = R++;
src[COMPARATORLOOSE] = "^" + src[GTLT] + "\\s*(" + LOOSEPLAIN + ")$|^$";
const COMPARATOR: number = R++;
src[COMPARATOR] = "^" + src[GTLT] + "\\s*(" + FULLPLAIN + ")$|^$";
// An expression to strip any whitespace between the gtlt and the thing
// it modifies, so that `> 1.2.3` ==> `>1.2.3`
const COMPARATORTRIM: number = R++;
src[COMPARATORTRIM] =
"(\\s*)" + src[GTLT] + "\\s*(" + LOOSEPLAIN + "|" + src[XRANGEPLAIN] + ")";
// this one has to use the /g flag
re[COMPARATORTRIM] = new RegExp(src[COMPARATORTRIM], "g");
const comparatorTrimReplace: string = "$1$2$3";
// Something like `1.2.3 - 1.2.4`
// Note that these all use the loose form, because they'll be
// checked against either the strict or loose comparator form
// later.
const HYPHENRANGE: number = R++;
src[HYPHENRANGE] =
"^\\s*(" +
src[XRANGEPLAIN] +
")" +
"\\s+-\\s+" +
"(" +
src[XRANGEPLAIN] +
")" +
"\\s*$";
const HYPHENRANGELOOSE: number = R++;
src[HYPHENRANGELOOSE] =
"^\\s*(" +
src[XRANGEPLAINLOOSE] +
")" +
"\\s+-\\s+" +
"(" +
src[XRANGEPLAINLOOSE] +
")" +
"\\s*$";
// Star ranges basically just allow anything at all.
const STAR: number = R++;
src[STAR] = "(<|>)?=?\\s*\\*";
// Compile to actual regexp objects.
// All are flag-free, unless they were created above with a flag.
for (let i: number = 0; i < R; i++) {
if (!re[i]) {
re[i] = new RegExp(src[i]);
}
}
export function parse(
version: string | SemVer | null,
optionsOrLoose?: boolean | Options,
): SemVer | null {
if (!optionsOrLoose || typeof optionsOrLoose !== "object") {
optionsOrLoose = {
loose: !!optionsOrLoose,
includePrerelease: false,
};
}
if (version instanceof SemVer) {
return version;
}
if (typeof version !== "string") {
return null;
}
if (version.length > MAX_LENGTH) {
return null;
}
const r: RegExp = optionsOrLoose.loose ? re[LOOSE] : re[FULL];
if (!r.test(version)) {
return null;
}
try {
return new SemVer(version, optionsOrLoose);
} catch (er) {
return null;
}
}
export function valid(
version: string | SemVer | null,
optionsOrLoose?: boolean | Options,
): string | null {
if (version === null) return null;
const v: SemVer | null = parse(version, optionsOrLoose);
return v ? v.version : null;
}
export function clean(
version: string,
optionsOrLoose?: boolean | Options,
): string | null {
const s: SemVer | null = parse(
version.trim().replace(/^[=v]+/, ""),
optionsOrLoose,
);
return s ? s.version : null;
}
export class SemVer {
raw!: string;
loose!: boolean;
options!: Options;
major!: number;
minor!: number;
patch!: number;
version!: string;
build!: ReadonlyArray<string>;
prerelease!: Array<string | number>;
constructor(version: string | SemVer, optionsOrLoose?: boolean | Options) {
if (!optionsOrLoose || typeof optionsOrLoose !== "object") {
optionsOrLoose = {
loose: !!optionsOrLoose,
includePrerelease: false,
};
}
if (version instanceof SemVer) {
if (version.loose === optionsOrLoose.loose) {
return version;
} else {
version = version.version;
}
} else if (typeof version !== "string") {
throw new TypeError("Invalid Version: " + version);
}
if (version.length > MAX_LENGTH) {
throw new TypeError(
"version is longer than " + MAX_LENGTH + " characters",
);
}
if (!(this instanceof SemVer)) {
return new SemVer(version, optionsOrLoose);
}
this.options = optionsOrLoose;
this.loose = !!optionsOrLoose.loose;
const m = version.trim().match(optionsOrLoose.loose ? re[LOOSE] : re[FULL]);
if (!m) {
throw new TypeError("Invalid Version: " + version);
}
this.raw = version;
// these are actually numbers
this.major = +m[1];
this.minor = +m[2];
this.patch = +m[3];
if (this.major > Number.MAX_SAFE_INTEGER || this.major < 0) {
throw new TypeError("Invalid major version");
}
if (this.minor > Number.MAX_SAFE_INTEGER || this.minor < 0) {
throw new TypeError("Invalid minor version");
}
if (this.patch > Number.MAX_SAFE_INTEGER || this.patch < 0) {
throw new TypeError("Invalid patch version");
}
// numberify any prerelease numeric ids
if (!m[4]) {
this.prerelease = [];
} else {
this.prerelease = m[4].split(".").map((id: string) => {
if (/^[0-9]+$/.test(id)) {
const num: number = +id;
if (num >= 0 && num < Number.MAX_SAFE_INTEGER) {
return num;
}
}
return id;
});
}
this.build = m[5] ? m[5].split(".") : [];
this.format();
}
format(): string {
this.version = this.major + "." + this.minor + "." + this.patch;
if (this.prerelease.length) {
this.version += "-" + this.prerelease.join(".");
}
return this.version;
}
compare(other: string | SemVer): 1 | 0 | -1 {
if (!(other instanceof SemVer)) {
other = new SemVer(other, this.options);
}
return this.compareMain(other) || this.comparePre(other);
}
compareMain(other: string | SemVer): 1 | 0 | -1 {
if (!(other instanceof SemVer)) {
other = new SemVer(other, this.options);
}
return (
compareIdentifiers(this.major, other.major) ||
compareIdentifiers(this.minor, other.minor) ||
compareIdentifiers(this.patch, other.patch)
);
}
comparePre(other: string | SemVer): 1 | 0 | -1 {
if (!(other instanceof SemVer)) {
other = new SemVer(other, this.options);
}
// NOT having a prerelease is > having one
if (this.prerelease.length && !other.prerelease.length) {
return -1;
} else if (!this.prerelease.length && other.prerelease.length) {
return 1;
} else if (!this.prerelease.length && !other.prerelease.length) {
return 0;
}
let i: number = 0;
do {
const a: string | number = this.prerelease[i];
const b: string | number = other.prerelease[i];
if (a === undefined && b === undefined) {
return 0;
} else if (b === undefined) {
return 1;
} else if (a === undefined) {
return -1;
} else if (a === b) {
continue;
} else {
return compareIdentifiers(a, b);
}
} while (++i);
return 1;
}
compareBuild(other: string | SemVer): 1 | 0 | -1 {
if (!(other instanceof SemVer)) {
other = new SemVer(other, this.options);
}
let i: number = 0;
do {
const a: string = this.build[i];
const b: string = other.build[i];
if (a === undefined && b === undefined) {
return 0;
} else if (b === undefined) {
return 1;
} else if (a === undefined) {
return -1;
} else if (a === b) {
continue;
} else {
return compareIdentifiers(a, b);
}
} while (++i);
return 1;
}
inc(release: ReleaseType, identifier?: string): SemVer {
switch (release) {
case "premajor":
this.prerelease.length = 0;
this.patch = 0;
this.minor = 0;
this.major++;
this.inc("pre", identifier);
break;
case "preminor":
this.prerelease.length = 0;
this.patch = 0;
this.minor++;
this.inc("pre", identifier);
break;
case "prepatch":
// If this is already a prerelease, it will bump to the next version
// drop any prereleases that might already exist, since they are not
// relevant at this point.
this.prerelease.length = 0;
this.inc("patch", identifier);
this.inc("pre", identifier);
break;
// If the input is a non-prerelease version, this acts the same as
// prepatch.
case "prerelease":
if (this.prerelease.length === 0) {
this.inc("patch", identifier);
}
this.inc("pre", identifier);
break;
case "major":
// If this is a pre-major version, bump up to the same major version.
// Otherwise increment major.
// 1.0.0-5 bumps to 1.0.0
// 1.1.0 bumps to 2.0.0
if (
this.minor !== 0 ||
this.patch !== 0 ||
this.prerelease.length === 0
) {
this.major++;
}
this.minor = 0;
this.patch = 0;
this.prerelease = [];
break;
case "minor":
// If this is a pre-minor version, bump up to the same minor version.
// Otherwise increment minor.
// 1.2.0-5 bumps to 1.2.0
// 1.2.1 bumps to 1.3.0
if (this.patch !== 0 || this.prerelease.length === 0) {
this.minor++;
}
this.patch = 0;
this.prerelease = [];
break;
case "patch":
// If this is not a pre-release version, it will increment the patch.
// If it is a pre-release it will bump up to the same patch version.
// 1.2.0-5 patches to 1.2.0
// 1.2.0 patches to 1.2.1
if (this.prerelease.length === 0) {
this.patch++;
}
this.prerelease = [];
break;
// This probably shouldn't be used publicly.
// 1.0.0 "pre" would become 1.0.0-0 which is the wrong direction.
case "pre":
if (this.prerelease.length === 0) {
this.prerelease = [0];
} else {
let i: number = this.prerelease.length;
while (--i >= 0) {
if (typeof this.prerelease[i] === "number") {
(this.prerelease[i] as number)++;
i = -2;
}
}
if (i === -1) {
// didn't increment anything
this.prerelease.push(0);
}
}
if (identifier) {
// 1.2.0-beta.1 bumps to 1.2.0-beta.2,
// 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0
if (this.prerelease[0] === identifier) {
if (isNaN(this.prerelease[1] as number)) {
this.prerelease = [identifier, 0];
}
} else {
this.prerelease = [identifier, 0];
}
}
break;
default:
throw new Error("invalid increment argument: " + release);
}
this.format();
this.raw = this.version;
return this;
}
toString(): string {
return this.version;
}
}
/**
* Return the version incremented by the release type (major, minor, patch, or prerelease), or null if it's not valid.
*/
export function inc(
version: string | SemVer,
release: ReleaseType,
optionsOrLoose?: boolean | Options,
identifier?: string,
): string | null {
if (typeof optionsOrLoose === "string") {
identifier = optionsOrLoose;
optionsOrLoose = undefined;
}
try {
return new SemVer(version, optionsOrLoose).inc(release, identifier).version;
} catch (er) {
return null;
}
}
export function diff(
version1: string | SemVer,
version2: string | SemVer,
optionsOrLoose?: boolean | Options,
): ReleaseType | null {
if (eq(version1, version2, optionsOrLoose)) {
return null;
} else {
const v1: SemVer | null = parse(version1);
const v2: SemVer | null = parse(version2);
let prefix: string = "";
let defaultResult: ReleaseType | null = null;
if (v1 && v2) {
if (v1.prerelease.length || v2.prerelease.length) {
prefix = "pre";
defaultResult = "prerelease";
}
for (const key in v1) {
if (key === "major" || key === "minor" || key === "patch") {
if (v1[key] !== v2[key]) {
return (prefix + key) as ReleaseType;
}
}
}
}
return defaultResult; // may be undefined
}
}
const numeric: RegExp = /^[0-9]+$/;
export function compareIdentifiers(
a: string | number | null,
b: string | number | null,
): 1 | 0 | -1 {
const anum: boolean = numeric.test(a as string);
const bnum: boolean = numeric.test(b as string);
if (a === null || b === null) throw "Comparison against null invalid";
if (anum && bnum) {
a = +a;
b = +b;
}
return a === b ? 0 : anum && !bnum ? -1 : bnum && !anum ? 1 : a < b ? -1 : 1;
}
export function rcompareIdentifiers(
a: string | null,
b: string | null,
): 1 | 0 | -1 {
return compareIdentifiers(b, a);
}
/**
* Return the major version number.
*/
export function major(
v: string | SemVer,
optionsOrLoose?: boolean | Options,
): number {
return new SemVer(v, optionsOrLoose).major;
}
/**
* Return the minor version number.
*/
export function minor(
v: string | SemVer,
optionsOrLoose?: boolean | Options,
): number {
return new SemVer(v, optionsOrLoose).minor;
}
/**
* Return the patch version number.
*/
export function patch(
v: string | SemVer,
optionsOrLoose?: boolean | Options,
): number {
return new SemVer(v, optionsOrLoose).patch;
}
export function compare(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): 1 | 0 | -1 {
return new SemVer(v1, optionsOrLoose).compare(new SemVer(v2, optionsOrLoose));
}
export function compareLoose(
a: string | SemVer,
b: string | SemVer,
): 1 | 0 | -1 {
return compare(a, b, true);
}
export function compareBuild(
a: string | SemVer,
b: string | SemVer,
loose?: boolean | Options,
): 1 | 0 | -1 {
var versionA = new SemVer(a, loose);
var versionB = new SemVer(b, loose);
return versionA.compare(versionB) || versionA.compareBuild(versionB);
}
export function rcompare(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): 1 | 0 | -1 {
return compare(v2, v1, optionsOrLoose);
}
export function sort<T extends string | SemVer>(
list: T[],
optionsOrLoose?: boolean | Options,
): T[] {
return list.sort((a, b) => {
return compareBuild(a, b, optionsOrLoose);
});
}
export function rsort<T extends string | SemVer>(
list: T[],
optionsOrLoose?: boolean | Options,
): T[] {
return list.sort((a, b) => {
return compareBuild(b, a, optionsOrLoose);
});
}
export function gt(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
return compare(v1, v2, optionsOrLoose) > 0;
}
export function lt(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
return compare(v1, v2, optionsOrLoose) < 0;
}
export function eq(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
return compare(v1, v2, optionsOrLoose) === 0;
}
export function neq(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
return compare(v1, v2, optionsOrLoose) !== 0;
}
export function gte(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
return compare(v1, v2, optionsOrLoose) >= 0;
}
export function lte(
v1: string | SemVer,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
return compare(v1, v2, optionsOrLoose) <= 0;
}
export function cmp(
v1: string | SemVer,
operator: Operator,
v2: string | SemVer,
optionsOrLoose?: boolean | Options,
): boolean {
switch (operator) {
case "===":
if (typeof v1 === "object") v1 = v1.version;
if (typeof v2 === "object") v2 = v2.version;
return v1 === v2;
case "!==":
if (typeof v1 === "object") v1 = v1.version;
if (typeof v2 === "object") v2 = v2.version;
return v1 !== v2;
case "":
case "=":
case "==":
return eq(v1, v2, optionsOrLoose);
case "!=":
return neq(v1, v2, optionsOrLoose);
case ">":
return gt(v1, v2, optionsOrLoose);
case ">=":
return gte(v1, v2, optionsOrLoose);
case "<":
return lt(v1, v2, optionsOrLoose);
case "<=":
return lte(v1, v2, optionsOrLoose);
default:
throw new TypeError("Invalid operator: " + operator);
}
}
const ANY: SemVer = {} as SemVer;
export class Comparator {
semver!: SemVer;
operator!: "" | "=" | "<" | ">" | "<=" | ">=";
value!: string;
loose!: boolean;
options!: Options;
constructor(comp: string | Comparator, optionsOrLoose?: boolean | Options) {
if (!optionsOrLoose || typeof optionsOrLoose !== "object") {
optionsOrLoose = {
loose: !!optionsOrLoose,
includePrerelease: false,
};
}
if (comp instanceof Comparator) {
if (comp.loose === !!optionsOrLoose.loose) {
return comp;
} else {
comp = comp.value;
}
}
if (!(this instanceof Comparator)) {
return new Comparator(comp, optionsOrLoose);
}
this.options = optionsOrLoose;
this.loose = !!optionsOrLoose.loose;
this.parse(comp);
if (this.semver === ANY) {
this.value = "";
} else {
this.value = this.operator + this.semver.version;
}
}
parse(comp: string): void {
const r = this.options.loose ? re[COMPARATORLOOSE] : re[COMPARATOR];
const m = comp.match(r);
if (!m) {
throw new TypeError("Invalid comparator: " + comp);
}
const m1 = m[1] as "" | "=" | "<" | ">" | "<=" | ">=";
this.operator = m1 !== undefined ? m1 : "";
if (this.operator === "=") {
this.operator = "";
}
// if it literally is just '>' or '' then allow anything.
if (!m[2]) {
this.semver = ANY;
} else {
this.semver = new SemVer(m[2], this.options.loose);
}
}
test(version: string | SemVer): boolean {
if (this.semver === ANY || version === ANY) {
return true;
}
if (typeof version === "string") {
version = new SemVer(version, this.options);
}
return cmp(version, this.operator, this.semver, this.options);
}
intersects(comp: Comparator, optionsOrLoose?: boolean | Options): boolean {
if (!(comp instanceof Comparator)) {
throw new TypeError("a Comparator is required");
}
if (!optionsOrLoose || typeof optionsOrLoose !== "object") {
optionsOrLoose = {
loose: !!optionsOrLoose,
includePrerelease: false,
};
}
let rangeTmp: Range;
if (this.operator === "") {
if (this.value === "") {
return true;
}
rangeTmp = new Range(comp.value, optionsOrLoose);
return satisfies(this.value, rangeTmp, optionsOrLoose);
} else if (comp.operator === "") {
if (comp.value === "") {
return true;
}
rangeTmp = new Range(this.value, optionsOrLoose);
return satisfies(comp.semver, rangeTmp, optionsOrLoose);
}
const sameDirectionIncreasing: boolean =
(this.operator === ">=" || this.operator === ">") &&
(comp.operator === ">=" || comp.operator === ">");
const sameDirectionDecreasing: boolean =
(this.operator === "<=" || this.operator === "<") &&
(comp.operator === "<=" || comp.operator === "<");
const sameSemVer: boolean = this.semver.version === comp.semver.version;
const differentDirectionsInclusive: boolean =
(this.operator === ">=" || this.operator === "<=") &&
(comp.operator === ">=" || comp.operator === "<=");
const oppositeDirectionsLessThan: boolean =
cmp(this.semver, "<", comp.semver, optionsOrLoose) &&
(this.operator === ">=" || this.operator === ">") &&
(comp.operator === "<=" || comp.operator === "<");
const oppositeDirectionsGreaterThan: boolean =
cmp(this.semver, ">", comp.semver, optionsOrLoose) &&
(this.operator === "<=" || this.operator === "<") &&
(comp.operator === ">=" || comp.operator === ">");
return (
sameDirectionIncreasing ||
sameDirectionDecreasing ||
(sameSemVer && differentDirectionsInclusive) ||
oppositeDirectionsLessThan ||
oppositeDirectionsGreaterThan
);
}
toString(): string {
return this.value;
}
}
export class Range {
range!: string;
raw!: string;
loose!: boolean;
options!: Options;
includePrerelease!: boolean;
set!: ReadonlyArray<ReadonlyArray<Comparator>>;
constructor(
range: string | Range | Comparator,
optionsOrLoose?: boolean | Options,
) {
if (!optionsOrLoose || typeof optionsOrLoose !== "object") {
optionsOrLoose = {
loose: !!optionsOrLoose,
includePrerelease: false,
};
}
if (range instanceof Range) {
if (
range.loose === !!optionsOrLoose.loose &&
range.includePrerelease === !!optionsOrLoose.includePrerelease
) {
return range;
} else {
return new Range(range.raw, optionsOrLoose);
}
}
if (range instanceof Comparator) {
return new Range(range.value, optionsOrLoose);
}
if (!(this instanceof Range)) {
return new Range(range, optionsOrLoose);
}
this.options = optionsOrLoose;
this.loose = !!optionsOrLoose.loose;
this.includePrerelease = !!optionsOrLoose.includePrerelease;
// First, split based on boolean or ||
this.raw = range;
this.set = range
.split(/\s*\|\|\s*/)
.map(range => this.parseRange(range.trim()))
.filter(c => {
// throw out any that are not relevant for whatever reason
return c.length;
});
if (!this.set.length) {
throw new TypeError("Invalid SemVer Range: " + range);
}
this.format();
}
format(): string {
this.range = this.set
.map(comps => comps.join(" ").trim())
.join("||")
.trim();
return this.range;
}
parseRange(range: string): ReadonlyArray<Comparator> {
const loose = this.options.loose;
range = range.trim();
// `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`
const hr: RegExp = loose ? re[HYPHENRANGELOOSE] : re[HYPHENRANGE];
range = range.replace(hr, hyphenReplace);
// `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
range = range.replace(re[COMPARATORTRIM], comparatorTrimReplace);
// `~ 1.2.3` => `~1.2.3`
range = range.replace(re[TILDETRIM], tildeTrimReplace);
// `^ 1.2.3` => `^1.2.3`
range = range.replace(re[CARETTRIM], caretTrimReplace);
// normalize spaces
range = range.split(/\s+/).join(" ");
// At this point, the range is completely trimmed and
// ready to be split into comparators.
const compRe: RegExp = loose ? re[COMPARATORLOOSE] : re[COMPARATOR];
let set: string[] = range
.split(" ")
.map(comp => parseComparator(comp, this.options))
.join(" ")
.split(/\s+/);
if (this.options.loose) {
// in loose mode, throw out any that are not valid comparators
set = set.filter(comp => {
return !!comp.match(compRe);
});
}
return set.map(comp => new Comparator(comp, this.options));
}
test(version: string | SemVer): boolean {
if (typeof version === "string") {
version = new SemVer(version, this.options);
}
for (var i = 0; i < this.set.length; i++) {
if (testSet(this.set[i], version, this.options)) {
return true;
}
}
return false;
}
intersects(range?: Range, optionsOrLoose?: boolean | Options): boolean {
if (!(range instanceof Range)) {
throw new TypeError("a Range is required");
}
return this.set.some(thisComparators => {
return (
isSatisfiable(thisComparators, optionsOrLoose) &&
range.set.some(rangeComparators => {
return (
isSatisfiable(rangeComparators, optionsOrLoose) &&
thisComparators.every(thisComparator => {
return rangeComparators.every(rangeComparator => {
return thisComparator.intersects(
rangeComparator,
optionsOrLoose,
);
});
})
);
})
);
});
}
toString(): string {
return this.range;
}
}
function testSet(
set: ReadonlyArray<Comparator>,
version: SemVer,
options: Options,
): boolean {
for (let i: number = 0; i < set.length; i++) {
if (!set[i].test(version)) {
return false;
}
}
if (version.prerelease.length && !options.includePrerelease) {
// Find the set of versions that are allowed to have prereleases
// For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0
// That should allow `1.2.3-pr.2` to pass.
// However, `1.2.4-alpha.notready` should NOT be allowed,
// even though it's within the range set by the comparators.
for (let i: number = 0; i < set.length; i++) {
if (set[i].semver === ANY) {
continue;
}
if (set[i].semver.prerelease.length > 0) {
const allowed: SemVer = set[i].semver;
if (
allowed.major === version.major &&
allowed.minor === version.minor &&
allowed.patch === version.patch
) {
return true;
}
}
}
// Version has a -pre, but it's not one of the ones we like.
return false;
}
return true;
}
// take a set of comparators and determine whether there
// exists a version which can satisfy it
function isSatisfiable(
comparators: readonly Comparator[],
options?: boolean | Options,
): boolean {
let result: boolean = true;
const remainingComparators: Comparator[] = comparators.slice();
let testComparator = remainingComparators.pop();
while (result && remainingComparators.length) {
result = remainingComparators.every(otherComparator => {
return testComparator?.intersects(otherComparator, options);
});
testComparator = remainingComparators.pop();
}
return result;
}
// Mostly just for testing and legacy API reasons
export function toComparators(
range: string | Range,
optionsOrLoose?: boolean | Options,
): string[][] {
return new Range(range, optionsOrLoose).set.map(comp => {
return comp
.map(c => c.value)
.join(" ")
.trim()
.split(" ");
});
}
// comprised of xranges, tildes, stars, and gtlt's at this point.
// already replaced the hyphen ranges
// turn into a set of JUST comparators.
function parseComparator(comp: string, options: Options): string {
comp = replaceCarets(comp, options);
comp = replaceTildes(comp, options);
comp = replaceXRanges(comp, options);
comp = replaceStars(comp, options);
return comp;
}
function isX(id: string): boolean {
return !id || id.toLowerCase() === "x" || id === "*";
}
// ~, ~> --> * (any, kinda silly)
// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0
// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0
// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0
// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0
// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0
function replaceTildes(comp: string, options: Options): string {
return comp
.trim()
.split(/\s+/)
.map(comp => replaceTilde(comp, options))
.join(" ");
}
function replaceTilde(comp: string, options: Options): string {
const r: RegExp = options.loose ? re[TILDELOOSE] : re[TILDE];
return comp.replace(
r,
(_: string, M: string, m: string, p: string, pr: string) => {
let ret: string;
if (isX(M)) {
ret = "";
} else if (isX(m)) {
ret = ">=" + M + ".0.0 <" + (+M + 1) + ".0.0";
} else if (isX(p)) {
// ~1.2 == >=1.2.0 <1.3.0
ret = ">=" + M + "." + m + ".0 <" + M + "." + (+m + 1) + ".0";
} else if (pr) {
ret =
">=" +
M +
"." +
m +
"." +
p +
"-" +
pr +
" <" +
M +
"." +
(+m + 1) +
".0";
} else {
// ~1.2.3 == >=1.2.3 <1.3.0
ret = ">=" + M + "." + m + "." + p + " <" + M + "." + (+m + 1) + ".0";
}
return ret;
},
);
}
// ^ --> * (any, kinda silly)
// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0
// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0
// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0
// ^1.2.3 --> >=1.2.3 <2.0.0
// ^1.2.0 --> >=1.2.0 <2.0.0
function replaceCarets(comp: string, options: Options): string {
return comp
.trim()
.split(/\s+/)
.map(comp => replaceCaret(comp, options))
.join(" ");
}
function replaceCaret(comp: string, options: Options): string {
const r: RegExp = options.loose ? re[CARETLOOSE] : re[CARET];
return comp.replace(r, (_: string, M, m, p, pr) => {
let ret: string;
if (isX(M)) {
ret = "";
} else if (isX(m)) {
ret = ">=" + M + ".0.0 <" + (+M + 1) + ".0.0";
} else if (isX(p)) {
if (M === "0") {
ret = ">=" + M + "." + m + ".0 <" + M + "." + (+m + 1) + ".0";
} else {
ret = ">=" + M + "." + m + ".0 <" + (+M + 1) + ".0.0";
}
} else if (pr) {
if (M === "0") {
if (m === "0") {
ret =
">=" +
M +
"." +
m +
"." +
p +
"-" +
pr +
" <" +
M +
"." +
m +
"." +
(+p + 1);
} else {
ret =
">=" +
M +
"." +
m +
"." +
p +
"-" +
pr +
" <" +
M +
"." +
(+m + 1) +
".0";
}
} else {
ret =
">=" + M + "." + m + "." + p + "-" + pr + " <" + (+M + 1) + ".0.0";
}
} else {
if (M === "0") {
if (m === "0") {
ret =
">=" + M + "." + m + "." + p + " <" + M + "." + m + "." + (+p + 1);
} else {
ret = ">=" + M + "." + m + "." + p + " <" + M + "." + (+m + 1) + ".0";
}
} else {
ret = ">=" + M + "." + m + "." + p + " <" + (+M + 1) + ".0.0";
}
}
return ret;
});
}
function replaceXRanges(comp: string, options: Options): string {
return comp
.split(/\s+/)
.map(comp => replaceXRange(comp, options))
.join(" ");
}
function replaceXRange(comp: string, options: Options): string {
comp = comp.trim();
const r: RegExp = options.loose ? re[XRANGELOOSE] : re[XRANGE];
return comp.replace(r, (ret: string, gtlt, M, m, p, pr) => {
const xM: boolean = isX(M);
const xm: boolean = xM || isX(m);
const xp: boolean = xm || isX(p);
const anyX: boolean = xp;
if (gtlt === "=" && anyX) {
gtlt = "";
}
if (xM) {
if (gtlt === ">" || gtlt === "<") {
// nothing is allowed
ret = "<0.0.0";
} else {
// nothing is forbidden
ret = "*";
}
} else if (gtlt && anyX) {
// we know patch is an x, because we have any x at all.
// replace X with 0
if (xm) {
m = 0;
}
p = 0;
if (gtlt === ">") {
// >1 => >=2.0.0
// >1.2 => >=1.3.0
// >1.2.3 => >= 1.2.4
gtlt = ">=";
if (xm) {
M = +M + 1;
m = 0;
p = 0;
} else {
m = +m + 1;
p = 0;
}
} else if (gtlt === "<=") {
// <=0.7.x is actually <0.8.0, since any 0.7.x should
// pass. Similarly, <=7.x is actually <8.0.0, etc.
gtlt = "<";
if (xm) {
M = +M + 1;
} else {
m = +m + 1;
}
}
ret = gtlt + M + "." + m + "." + p;
} else if (xm) {
ret = ">=" + M + ".0.0 <" + (+M + 1) + ".0.0";
} else if (xp) {
ret = ">=" + M + "." + m + ".0 <" + M + "." + (+m + 1) + ".0";
}
return ret;
});
}
// Because * is AND-ed with everything else in the comparator,
// and '' means "any version", just remove the *s entirely.
function replaceStars(comp: string, options: Options): string {
// Looseness is ignored here. star is always as loose as it gets!
return comp.trim().replace(re[STAR], "");
}
// This function is passed to string.replace(re[HYPHENRANGE])
// M, m, patch, prerelease, build
// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5
// 1.2.3 - 3.4 => >=1.2.0 <3.5.0 Any 3.4.x will do
// 1.2 - 3.4 => >=1.2.0 <3.5.0
function hyphenReplace(
$0: any,
from: any,
fM: any,
fm: any,
fp: any,
fpr: any,
fb: any,
to: any,
tM: any,
tm: any,
tp: any,
tpr: any,
tb: any,
) {
if (isX(fM)) {
from = "";
} else if (isX(fm)) {
from = ">=" + fM + ".0.0";
} else if (isX(fp)) {
from = ">=" + fM + "." + fm + ".0";
} else {
from = ">=" + from;
}
if (isX(tM)) {
to = "";
} else if (isX(tm)) {
to = "<" + (+tM + 1) + ".0.0";
} else if (isX(tp)) {
to = "<" + tM + "." + (+tm + 1) + ".0";
} else if (tpr) {
to = "<=" + tM + "." + tm + "." + tp + "-" + tpr;
} else {
to = "<=" + to;
}
return (from + " " + to).trim();
}
export function satisfies(
version: string | SemVer,
range: string | Range,
optionsOrLoose?: boolean | Options,
): boolean {
try {
range = new Range(range, optionsOrLoose);
} catch (er) {
return false;
}
return range.test(version);
}
export function maxSatisfying<T extends string | SemVer>(
versions: ReadonlyArray<T>,
range: string | Range,
optionsOrLoose?: boolean | Options,
): T | null {
//todo
var max: T | SemVer | null = null;
var maxSV: SemVer | null = null;
try {
var rangeObj = new Range(range, optionsOrLoose);
} catch (er) {
return null;
}
versions.forEach(v => {
if (rangeObj.test(v)) {
// satisfies(v, range, options)
if (!max || (maxSV && maxSV.compare(v) === -1)) {
// compare(max, v, true)
max = v;
maxSV = new SemVer(max, optionsOrLoose);
}
}
});
return max;
}
export function minSatisfying<T extends string | SemVer>(
versions: ReadonlyArray<T>,
range: string | Range,
optionsOrLoose?: boolean | Options,
): T | null {
//todo
var min: any = null;
var minSV: any = null;
try {
var rangeObj = new Range(range, optionsOrLoose);
} catch (er) {
return null;
}
versions.forEach(v => {
if (rangeObj.test(v)) {
// satisfies(v, range, options)
if (!min || minSV.compare(v) === 1) {
// compare(min, v, true)
min = v;
minSV = new SemVer(min, optionsOrLoose);
}
}
});
return min;
}
export function minVersion(
range: string | Range,
optionsOrLoose?: boolean | Options,
): SemVer | null {
range = new Range(range, optionsOrLoose);
var minver: SemVer | null = new SemVer("0.0.0");
if (range.test(minver)) {
return minver;
}
minver = new SemVer("0.0.0-0");
if (range.test(minver)) {
return minver;
}
minver = null;
for (var i = 0; i < range.set.length; ++i) {
var comparators = range.set[i];
comparators.forEach(comparator => {
// Clone to avoid manipulating the comparator's semver object.
var compver = new SemVer(comparator.semver.version);
switch (comparator.operator) {
case ">":
if (compver.prerelease.length === 0) {
compver.patch++;
} else {
compver.prerelease.push(0);
}
compver.raw = compver.format();
/* fallthrough */
case "":
case ">=":
if (!minver || gt(minver, compver)) {
minver = compver;
}
break;
case "<":
case "<=":
/* Ignore maximum versions */
break;
/* istanbul ignore next */
default:
throw new Error("Unexpected operation: " + comparator.operator);
}
});
}
if (minver && range.test(minver)) {
return minver;
}
return null;
}
export function validRange(
range: string | Range | null,
optionsOrLoose?: boolean | Options,
): string | null {
try {
if (range === null) return null;
// Return '*' instead of '' so that truthiness works.
// This will throw if it's invalid anyway
return new Range(range, optionsOrLoose).range || "*";
} catch (er) {
return null;
}
}
/**
* Return true if version is less than all the versions possible in the range.
*/
export function ltr(
version: string | SemVer,
range: string | Range,
optionsOrLoose?: boolean | Options,
): boolean {
return outside(version, range, "<", optionsOrLoose);
}
/**
* Return true if version is greater than all the versions possible in the range.
*/
export function gtr(
version: string | SemVer,
range: string | Range,
optionsOrLoose?: boolean | Options,
): boolean {
return outside(version, range, ">", optionsOrLoose);
}
/**
* Return true if the version is outside the bounds of the range in either the high or low direction.
* The hilo argument must be either the string '>' or '<'. (This is the function called by gtr and ltr.)
*/
export function outside(
version: string | SemVer,
range: string | Range,
hilo: ">" | "<",
optionsOrLoose?: boolean | Options,
): boolean {
version = new SemVer(version, optionsOrLoose);
range = new Range(range, optionsOrLoose);
let gtfn: typeof gt;
let ltefn: typeof lte;
let ltfn: typeof lt;
let comp: string;
let ecomp: string;
switch (hilo) {
case ">":
gtfn = gt;
ltefn = lte;
ltfn = lt;
comp = ">";
ecomp = ">=";
break;
case "<":
gtfn = lt;
ltefn = gte;
ltfn = gt;
comp = "<";
ecomp = "<=";
break;
default:
throw new TypeError('Must provide a hilo val of "<" or ">"');
}
// If it satisifes the range it is not outside
if (satisfies(version, range, optionsOrLoose)) {
return false;
}
// From now on, variable terms are as if we're in "gtr" mode.
// but note that everything is flipped for the "ltr" function.
for (let i: number = 0; i < range.set.length; ++i) {
const comparators: readonly Comparator[] = range.set[i];
let high: Comparator | null = null;
let low: Comparator | null = null;
comparators.forEach(comparator => {
if (comparator.semver === ANY) {
comparator = new Comparator(">=0.0.0");
}
high = high || comparator;
low = low || comparator;
if (gtfn(comparator.semver, high.semver, optionsOrLoose)) {
high = comparator;
} else if (ltfn(comparator.semver, low.semver, optionsOrLoose)) {
low = comparator;
}
});
if (high === null || low === null) return true;
// If the edge version comparator has a operator then our version
// isn't outside it
if (high!.operator === comp || high!.operator === ecomp) {
return false;
}
// If the lowest version comparator has an operator and our version
// is less than it then it isn't higher than the range
if (
(!low!.operator || low!.operator === comp) &&
ltefn(version, low!.semver)
) {
return false;
} else if (low!.operator === ecomp && ltfn(version, low!.semver)) {
return false;
}
}
return true;
}
export function prerelease(
version: string | SemVer,
optionsOrLoose?: boolean | Options,
): ReadonlyArray<string | number> | null {
var parsed = parse(version, optionsOrLoose);
return parsed && parsed.prerelease.length ? parsed.prerelease : null;
}
/**
* Return true if any of the ranges comparators intersect
*/
export function intersects(
range1: string | Range | Comparator,
range2: string | Range | Comparator,
optionsOrLoose?: boolean | Options,
): boolean {
range1 = new Range(range1, optionsOrLoose);
range2 = new Range(range2, optionsOrLoose);
return range1.intersects(range2);
}
/**
* Coerces a string to semver if possible
*/
export function coerce(
version: string | SemVer,
optionsOrLoose?: boolean | Options,
): SemVer | null {
if (version instanceof SemVer) {
return version;
}
if (typeof version !== "string") {
return null;
}
const match = version.match(re[COERCE]);
if (match == null) {
return null;
}
return parse(
match[1] + "." + (match[2] || "0") + "." + (match[3] || "0"),
optionsOrLoose,
);
}
export default SemVer;