archive-gh-me/rollup-plugin-typescript2
1
0
Fork 0
mirror of https://github.com/ezolenko/rollup-plugin-typescript2.git synced 2025-12-08 19:06:16 +00:00
Code Issues Projects Releases Wiki Activity

- updating dependencies

Browse Source
This commit is contained in:
ezolenko 2022-04-21 11:30:01 -06:00
parent bfd27a9180
commit f84afe983b
6 changed files with 319 additions and 303 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

220
dist/rollup-plugin-typescript2.cjs.js vendored
View File

@ -25264,7 +25264,7 @@ const SEMVER_SPEC_VERSION = '2.0.0';
const MAX_LENGTH$2 = 256;
const MAX_SAFE_INTEGER$1 = Number.MAX_SAFE_INTEGER ||
/* istanbul ignore next */ 9007199254740991;
/* istanbul ignore next */ 9007199254740991;
// Max safe segment length for coercion.
const MAX_SAFE_COMPONENT_LENGTH = 16;
@ -25273,7 +25273,7 @@ var constants = {
SEMVER_SPEC_VERSION,
MAX_LENGTH: MAX_LENGTH$2,
MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$1,
MAX_SAFE_COMPONENT_LENGTH
MAX_SAFE_COMPONENT_LENGTH,
};
const debug = (
@ -25299,7 +25299,7 @@ let R = 0;
const createToken = (name, value, isGlobal) => {
const index = R++;
debug_1(index, value);
debug_1(name, index, value);
t[name] = index;
src[index] = value;
re[index] = new RegExp(value, isGlobal ? 'g' : undefined);
@ -25467,8 +25467,8 @@ createToken('HYPHENRANGELOOSE', `^\\s*(${src[t.XRANGEPLAINLOOSE]})` +
// Star ranges basically just allow anything at all.
createToken('STAR', '(<|>)?=?\\s*\\*');
// >=0.0.0 is like a star
createToken('GTE0', '^\\s*>=\\s*0\.0\.0\\s*$');
createToken('GTE0PRE', '^\\s*>=\\s*0\.0\.0-0\\s*$');
createToken('GTE0', '^\\s*>=\\s*0\\.0\\.0\\s*$');
createToken('GTE0PRE', '^\\s*>=\\s*0\\.0\\.0-0\\s*$');
});
// parse out just the options we care about so we always get a consistent
@ -25477,9 +25477,9 @@ const opts = ['includePrerelease', 'loose', 'rtl'];
const parseOptions = options =>
!options ? {}
: typeof options !== 'object' ? { loose: true }
: opts.filter(k => options[k]).reduce((options, k) => {
options[k] = true;
return options
: opts.filter(k => options[k]).reduce((o, k) => {
o[k] = true;
return o
}, {});
var parseOptions_1 = parseOptions;
@ -25504,7 +25504,7 @@ const rcompareIdentifiers = (a, b) => compareIdentifiers$1(b, a);
var identifiers = {
compareIdentifiers: compareIdentifiers$1,
rcompareIdentifiers
rcompareIdentifiers,
};
const { MAX_LENGTH: MAX_LENGTH$1, MAX_SAFE_INTEGER } = constants;
@ -25773,7 +25773,7 @@ class SemVer {
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 (compareIdentifiers(this.prerelease[0], identifier) === 0) {
if (isNaN(this.prerelease[1])) {
this.prerelease = [identifier, 0];
}
@ -25794,7 +25794,7 @@ class SemVer {
var semver$2 = SemVer;
const {MAX_LENGTH} = constants;
const { MAX_LENGTH } = constants;
const { re: re$3, t: t$3 } = re_1;
@ -25847,7 +25847,10 @@ const inc = (version, release, options, identifier) => {
}
try {
return new semver$2(version, options).inc(release, identifier).version
return new semver$2(
version instanceof semver$2 ? version.version : version,
options
).inc(release, identifier).version
} catch (er) {
return null
}
@ -25935,17 +25938,21 @@ var lte_1 = lte;
const cmp = (a, op, b, loose) => {
switch (op) {
case '===':
if (typeof a === 'object')
if (typeof a === 'object') {
a = a.version;
if (typeof b === 'object')
}
if (typeof b === 'object') {
b = b.version;
}
return a === b
case '!==':
if (typeof a === 'object')
if (typeof a === 'object') {
a = a.version;
if (typeof b === 'object')
}
if (typeof b === 'object') {
b = b.version;
}
return a !== b
case '':
@ -25974,7 +25981,7 @@ const cmp = (a, op, b, loose) => {
};
var cmp_1 = cmp;
const {re: re$2, t: t$2} = re_1;
const { re: re$2, t: t$2 } = re_1;
const coerce = (version, options) => {
if (version instanceof semver$2) {
@ -26017,8 +26024,9 @@ const coerce = (version, options) => {
re$2[t$2.COERCERTL].lastIndex = -1;
}
if (match === null)
if (match === null) {
return null
}
return parse_1(`${match[2]}.${match[3] || '0'}.${match[4] || '0'}`, options)
};
@ -26822,9 +26830,9 @@ class Range {
// First, split based on boolean or ||
this.raw = range;
this.set = range
.split(/\s*\|\|\s*/)
.split('||')
// map the range to a 2d array of comparators
.map(range => this.parseRange(range.trim()))
.map(r => this.parseRange(r.trim()))
// throw out any comparator lists that are empty
// this generally means that it was not a valid range, which is allowed
// in loose mode, but will still throw if the WHOLE range is invalid.
@ -26839,9 +26847,9 @@ class Range {
// keep the first one, in case they're all null sets
const first = this.set[0];
this.set = this.set.filter(c => !isNullSet(c[0]));
if (this.set.length === 0)
if (this.set.length === 0) {
this.set = [first];
else if (this.set.length > 1) {
} else if (this.set.length > 1) {
// if we have any that are *, then the range is just *
for (const c of this.set) {
if (c.length === 1 && isAny(c[0])) {
@ -26877,8 +26885,9 @@ class Range {
const memoOpts = Object.keys(this.options).join(',');
const memoKey = `parseRange:${memoOpts}:${range}`;
const cached = cache.get(memoKey);
if (cached)
if (cached) {
return cached
}
const loose = this.options.loose;
// `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`
@ -26887,7 +26896,7 @@ class Range {
debug_1('hyphen replace', range);
// `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
range = range.replace(re$1[t$1.COMPARATORTRIM], comparatorTrimReplace);
debug_1('comparator trim', range, re$1[t$1.COMPARATORTRIM]);
debug_1('comparator trim', range);
// `~ 1.2.3` => `~1.2.3`
range = range.replace(re$1[t$1.TILDETRIM], tildeTrimReplace);
@ -26901,30 +26910,37 @@ class Range {
// At this point, the range is completely trimmed and
// ready to be split into comparators.
const compRe = loose ? re$1[t$1.COMPARATORLOOSE] : re$1[t$1.COMPARATOR];
const rangeList = range
let rangeList = range
.split(' ')
.map(comp => parseComparator(comp, this.options))
.join(' ')
.split(/\s+/)
// >=0.0.0 is equivalent to *
.map(comp => replaceGTE0(comp, this.options))
.map(comp => replaceGTE0(comp, this.options));
if (loose) {
// in loose mode, throw out any that are not valid comparators
.filter(this.options.loose ? comp => !!comp.match(compRe) : () => true)
.map(comp => new comparator(comp, this.options));
rangeList = rangeList.filter(comp => {
debug_1('loose invalid filter', comp, this.options);
return !!comp.match(re$1[t$1.COMPARATORLOOSE])
});
}
debug_1('range list', rangeList);
// if any comparators are the null set, then replace with JUST null set
// if more than one comparator, remove any * comparators
// also, don't include the same comparator more than once
rangeList.length;
const rangeMap = new Map();
for (const comp of rangeList) {
if (isNullSet(comp))
const comparators = rangeList.map(comp => new comparator(comp, this.options));
for (const comp of comparators) {
if (isNullSet(comp)) {
return [comp]
}
rangeMap.set(comp.value, comp);
}
if (rangeMap.size > 1 && rangeMap.has(''))
if (rangeMap.size > 1 && rangeMap.has('')) {
rangeMap.delete('');
}
const result = [...rangeMap.values()];
cache.set(memoKey, result);
@ -26989,7 +27005,7 @@ const {
t: t$1,
comparatorTrimReplace,
tildeTrimReplace,
caretTrimReplace
caretTrimReplace,
} = re_1;
const isNullSet = c => c.value === '<0.0.0-0';
@ -27038,8 +27054,8 @@ const isX = id => !id || id.toLowerCase() === 'x' || id === '*';
// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0
// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0
const replaceTildes = (comp, options) =>
comp.trim().split(/\s+/).map((comp) => {
return replaceTilde(comp, options)
comp.trim().split(/\s+/).map((c) => {
return replaceTilde(c, options)
}).join(' ');
const replaceTilde = (comp, options) => {
@ -27077,8 +27093,8 @@ const replaceTilde = (comp, options) => {
// ^1.2.3 --> >=1.2.3 <2.0.0-0
// ^1.2.0 --> >=1.2.0 <2.0.0-0
const replaceCarets = (comp, options) =>
comp.trim().split(/\s+/).map((comp) => {
return replaceCaret(comp, options)
comp.trim().split(/\s+/).map((c) => {
return replaceCaret(c, options)
}).join(' ');
const replaceCaret = (comp, options) => {
@ -27136,8 +27152,8 @@ const replaceCaret = (comp, options) => {
const replaceXRanges = (comp, options) => {
debug_1('replaceXRanges', comp, options);
return comp.split(/\s+/).map((comp) => {
return replaceXRange(comp, options)
return comp.split(/\s+/).map((c) => {
return replaceXRange(c, options)
}).join(' ')
};
@ -27198,8 +27214,9 @@ const replaceXRange = (comp, options) => {
}
}
if (gtlt === '<')
if (gtlt === '<') {
pr = '-0';
}
ret = `${gtlt + M}.${m}.${p}${pr}`;
} else if (xm) {
@ -27308,6 +27325,7 @@ class Comparator {
static get ANY () {
return ANY$2
}
constructor (comp, options) {
options = parseOptions_1(options);
@ -27384,7 +27402,7 @@ class Comparator {
if (!options || typeof options !== 'object') {
options = {
loose: !!options,
includePrerelease: false
includePrerelease: false,
};
}
@ -27432,7 +27450,7 @@ class Comparator {
var comparator = Comparator;
const {re, t} = re_1;
const { re, t } = re_1;
const satisfies = (version, range$1, options) => {
try {
@ -27542,8 +27560,9 @@ const minVersion = (range$1, loose) => {
throw new Error(`Unexpected operation: ${comparator.operator}`)
}
});
if (setMin && (!minver || gt_1(minver, setMin)))
if (setMin && (!minver || gt_1(minver, setMin))) {
minver = setMin;
}
}
if (minver && range$1.test(minver)) {
@ -27565,7 +27584,7 @@ const validRange = (range$1, options) => {
};
var valid = validRange;
const {ANY: ANY$1} = comparator;
const { ANY: ANY$1 } = comparator;
@ -27667,38 +27686,41 @@ var intersects_1 = intersects;
var simplify = (versions, range, options) => {
const set = [];
let min = null;
let first = null;
let prev = null;
const v = versions.sort((a, b) => compare_1(a, b, options));
for (const version of v) {
const included = satisfies_1(version, range, options);
if (included) {
prev = version;
if (!min)
min = version;
if (!first) {
first = version;
}
} else {
if (prev) {
set.push([min, prev]);
set.push([first, prev]);
}
prev = null;
min = null;
first = null;
}
}
if (min)
set.push([min, null]);
if (first) {
set.push([first, null]);
}
const ranges = [];
for (const [min, max] of set) {
if (min === max)
if (min === max) {
ranges.push(min);
else if (!max && min === v[0])
} else if (!max && min === v[0]) {
ranges.push('*');
else if (!max)
} else if (!max) {
ranges.push(`>=${min}`);
else if (min === v[0])
} else if (min === v[0]) {
ranges.push(`<=${max}`);
else
} else {
ranges.push(`${min} - ${max}`);
}
}
const simplified = ranges.join(' || ');
const original = typeof range.raw === 'string' ? range.raw : String(range);
@ -27746,8 +27768,9 @@ const { ANY } = comparator;
// - Else return true
const subset = (sub, dom, options = {}) => {
if (sub === dom)
if (sub === dom) {
return true
}
sub = new range(sub, options);
dom = new range(dom, options);
@ -27757,73 +27780,84 @@ const subset = (sub, dom, options = {}) => {
for (const simpleDom of dom.set) {
const isSub = simpleSubset(simpleSub, simpleDom, options);
sawNonNull = sawNonNull || isSub !== null;
if (isSub)
if (isSub) {
continue OUTER
}
}
// the null set is a subset of everything, but null simple ranges in
// a complex range should be ignored. so if we saw a non-null range,
// then we know this isn't a subset, but if EVERY simple range was null,
// then it is a subset.
if (sawNonNull)
if (sawNonNull) {
return false
}
}
return true
};
const simpleSubset = (sub, dom, options) => {
if (sub === dom)
if (sub === dom) {
return true
}
if (sub.length === 1 && sub[0].semver === ANY) {
if (dom.length === 1 && dom[0].semver === ANY)
if (dom.length === 1 && dom[0].semver === ANY) {
return true
else if (options.includePrerelease)
sub = [ new comparator('>=0.0.0-0') ];
else
sub = [ new comparator('>=0.0.0') ];
} else if (options.includePrerelease) {
sub = [new comparator('>=0.0.0-0')];
} else {
sub = [new comparator('>=0.0.0')];
}
}
if (dom.length === 1 && dom[0].semver === ANY) {
if (options.includePrerelease)
if (options.includePrerelease) {
return true
else
dom = [ new comparator('>=0.0.0') ];
} else {
dom = [new comparator('>=0.0.0')];
}
}
const eqSet = new Set();
let gt, lt;
for (const c of sub) {
if (c.operator === '>' || c.operator === '>=')
if (c.operator === '>' || c.operator === '>=') {
gt = higherGT(gt, c, options);
else if (c.operator === '<' || c.operator === '<=')
} else if (c.operator === '<' || c.operator === '<=') {
lt = lowerLT(lt, c, options);
else
} else {
eqSet.add(c.semver);
}
}
if (eqSet.size > 1)
if (eqSet.size > 1) {
return null
}
let gtltComp;
if (gt && lt) {
gtltComp = compare_1(gt.semver, lt.semver, options);
if (gtltComp > 0)
if (gtltComp > 0) {
return null
else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<='))
} else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {
return null
}
}
// will iterate one or zero times
for (const eq of eqSet) {
if (gt && !satisfies_1(eq, String(gt), options))
if (gt && !satisfies_1(eq, String(gt), options)) {
return null
}
if (lt && !satisfies_1(eq, String(lt), options))
if (lt && !satisfies_1(eq, String(lt), options)) {
return null
}
for (const c of dom) {
if (!satisfies_1(eq, String(c), options))
if (!satisfies_1(eq, String(c), options)) {
return false
}
}
return true
@ -27859,10 +27893,12 @@ const simpleSubset = (sub, dom, options) => {
}
if (c.operator === '>' || c.operator === '>=') {
higher = higherGT(gt, c, options);
if (higher === c && higher !== gt)
if (higher === c && higher !== gt) {
return false
} else if (gt.operator === '>=' && !satisfies_1(gt.semver, String(c), options))
}
} else if (gt.operator === '>=' && !satisfies_1(gt.semver, String(c), options)) {
return false
}
}
if (lt) {
if (needDomLTPre) {
@ -27875,37 +27911,44 @@ const simpleSubset = (sub, dom, options) => {
}
if (c.operator === '<' || c.operator === '<=') {
lower = lowerLT(lt, c, options);
if (lower === c && lower !== lt)
if (lower === c && lower !== lt) {
return false
} else if (lt.operator === '<=' && !satisfies_1(lt.semver, String(c), options))
}
} else if (lt.operator === '<=' && !satisfies_1(lt.semver, String(c), options)) {
return false
}
}
if (!c.operator && (lt || gt) && gtltComp !== 0)
if (!c.operator && (lt || gt) && gtltComp !== 0) {
return false
}
}
// if there was a < or >, and nothing in the dom, then must be false
// UNLESS it was limited by another range in the other direction.
// Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
if (gt && hasDomLT && !lt && gtltComp !== 0)
if (gt && hasDomLT && !lt && gtltComp !== 0) {
return false
}
if (lt && hasDomGT && !gt && gtltComp !== 0)
if (lt && hasDomGT && !gt && gtltComp !== 0) {
return false
}
// we needed a prerelease range in a specific tuple, but didn't get one
// then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,
// because it includes prereleases in the 1.2.3 tuple
if (needDomGTPre || needDomLTPre)
if (needDomGTPre || needDomLTPre) {
return false
}
return true
};
// >=1.2.3 is lower than >1.2.3
const higherGT = (a, b, options) => {
if (!a)
if (!a) {
return b
}
const comp = compare_1(a.semver, b.semver, options);
return comp > 0 ? a
: comp < 0 ? b
@ -27915,8 +27958,9 @@ const higherGT = (a, b, options) => {
// <=1.2.3 is higher than <1.2.3
const lowerLT = (a, b, options) => {
if (!a)
if (!a) {
return b
}
const comp = compare_1(a.semver, b.semver, options);
return comp < 0 ? a
: comp > 0 ? b

2
dist/rollup-plugin-typescript2.cjs.js.map vendored
View File

File diff suppressed because one or more lines are too long

220
dist/rollup-plugin-typescript2.es.js vendored
View File

@ -25233,7 +25233,7 @@ const SEMVER_SPEC_VERSION = '2.0.0';
const MAX_LENGTH$2 = 256;
const MAX_SAFE_INTEGER$1 = Number.MAX_SAFE_INTEGER ||
/* istanbul ignore next */ 9007199254740991;
/* istanbul ignore next */ 9007199254740991;
// Max safe segment length for coercion.
const MAX_SAFE_COMPONENT_LENGTH = 16;
@ -25242,7 +25242,7 @@ var constants = {
SEMVER_SPEC_VERSION,
MAX_LENGTH: MAX_LENGTH$2,
MAX_SAFE_INTEGER: MAX_SAFE_INTEGER$1,
MAX_SAFE_COMPONENT_LENGTH
MAX_SAFE_COMPONENT_LENGTH,
};
const debug = (
@ -25268,7 +25268,7 @@ let R = 0;
const createToken = (name, value, isGlobal) => {
const index = R++;
debug_1(index, value);
debug_1(name, index, value);
t[name] = index;
src[index] = value;
re[index] = new RegExp(value, isGlobal ? 'g' : undefined);
@ -25436,8 +25436,8 @@ createToken('HYPHENRANGELOOSE', `^\\s*(${src[t.XRANGEPLAINLOOSE]})` +
// Star ranges basically just allow anything at all.
createToken('STAR', '(<|>)?=?\\s*\\*');
// >=0.0.0 is like a star
createToken('GTE0', '^\\s*>=\\s*0\.0\.0\\s*$');
createToken('GTE0PRE', '^\\s*>=\\s*0\.0\.0-0\\s*$');
createToken('GTE0', '^\\s*>=\\s*0\\.0\\.0\\s*$');
createToken('GTE0PRE', '^\\s*>=\\s*0\\.0\\.0-0\\s*$');
});
// parse out just the options we care about so we always get a consistent
@ -25446,9 +25446,9 @@ const opts = ['includePrerelease', 'loose', 'rtl'];
const parseOptions = options =>
!options ? {}
: typeof options !== 'object' ? { loose: true }
: opts.filter(k => options[k]).reduce((options, k) => {
options[k] = true;
return options
: opts.filter(k => options[k]).reduce((o, k) => {
o[k] = true;
return o
}, {});
var parseOptions_1 = parseOptions;
@ -25473,7 +25473,7 @@ const rcompareIdentifiers = (a, b) => compareIdentifiers$1(b, a);
var identifiers = {
compareIdentifiers: compareIdentifiers$1,
rcompareIdentifiers
rcompareIdentifiers,
};
const { MAX_LENGTH: MAX_LENGTH$1, MAX_SAFE_INTEGER } = constants;
@ -25742,7 +25742,7 @@ class SemVer {
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 (compareIdentifiers(this.prerelease[0], identifier) === 0) {
if (isNaN(this.prerelease[1])) {
this.prerelease = [identifier, 0];
}
@ -25763,7 +25763,7 @@ class SemVer {
var semver$2 = SemVer;
const {MAX_LENGTH} = constants;
const { MAX_LENGTH } = constants;
const { re: re$3, t: t$3 } = re_1;
@ -25816,7 +25816,10 @@ const inc = (version, release, options, identifier) => {
}
try {
return new semver$2(version, options).inc(release, identifier).version
return new semver$2(
version instanceof semver$2 ? version.version : version,
options
).inc(release, identifier).version
} catch (er) {
return null
}
@ -25904,17 +25907,21 @@ var lte_1 = lte;
const cmp = (a, op, b, loose) => {
switch (op) {
case '===':
if (typeof a === 'object')
if (typeof a === 'object') {
a = a.version;
if (typeof b === 'object')
}
if (typeof b === 'object') {
b = b.version;
}
return a === b
case '!==':
if (typeof a === 'object')
if (typeof a === 'object') {
a = a.version;
if (typeof b === 'object')
}
if (typeof b === 'object') {
b = b.version;
}
return a !== b
case '':
@ -25943,7 +25950,7 @@ const cmp = (a, op, b, loose) => {
};
var cmp_1 = cmp;
const {re: re$2, t: t$2} = re_1;
const { re: re$2, t: t$2 } = re_1;
const coerce = (version, options) => {
if (version instanceof semver$2) {
@ -25986,8 +25993,9 @@ const coerce = (version, options) => {
re$2[t$2.COERCERTL].lastIndex = -1;
}
if (match === null)
if (match === null) {
return null
}
return parse_1(`${match[2]}.${match[3] || '0'}.${match[4] || '0'}`, options)
};
@ -26791,9 +26799,9 @@ class Range {
// First, split based on boolean or ||
this.raw = range;
this.set = range
.split(/\s*\|\|\s*/)
.split('||')
// map the range to a 2d array of comparators
.map(range => this.parseRange(range.trim()))
.map(r => this.parseRange(r.trim()))
// throw out any comparator lists that are empty
// this generally means that it was not a valid range, which is allowed
// in loose mode, but will still throw if the WHOLE range is invalid.
@ -26808,9 +26816,9 @@ class Range {
// keep the first one, in case they're all null sets
const first = this.set[0];
this.set = this.set.filter(c => !isNullSet(c[0]));
if (this.set.length === 0)
if (this.set.length === 0) {
this.set = [first];
else if (this.set.length > 1) {
} else if (this.set.length > 1) {
// if we have any that are *, then the range is just *
for (const c of this.set) {
if (c.length === 1 && isAny(c[0])) {
@ -26846,8 +26854,9 @@ class Range {
const memoOpts = Object.keys(this.options).join(',');
const memoKey = `parseRange:${memoOpts}:${range}`;
const cached = cache.get(memoKey);
if (cached)
if (cached) {
return cached
}
const loose = this.options.loose;
// `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`
@ -26856,7 +26865,7 @@ class Range {
debug_1('hyphen replace', range);
// `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
range = range.replace(re$1[t$1.COMPARATORTRIM], comparatorTrimReplace);
debug_1('comparator trim', range, re$1[t$1.COMPARATORTRIM]);
debug_1('comparator trim', range);
// `~ 1.2.3` => `~1.2.3`
range = range.replace(re$1[t$1.TILDETRIM], tildeTrimReplace);
@ -26870,30 +26879,37 @@ class Range {
// At this point, the range is completely trimmed and
// ready to be split into comparators.
const compRe = loose ? re$1[t$1.COMPARATORLOOSE] : re$1[t$1.COMPARATOR];
const rangeList = range
let rangeList = range
.split(' ')
.map(comp => parseComparator(comp, this.options))
.join(' ')
.split(/\s+/)
// >=0.0.0 is equivalent to *
.map(comp => replaceGTE0(comp, this.options))
.map(comp => replaceGTE0(comp, this.options));
if (loose) {
// in loose mode, throw out any that are not valid comparators
.filter(this.options.loose ? comp => !!comp.match(compRe) : () => true)
.map(comp => new comparator(comp, this.options));
rangeList = rangeList.filter(comp => {
debug_1('loose invalid filter', comp, this.options);
return !!comp.match(re$1[t$1.COMPARATORLOOSE])
});
}
debug_1('range list', rangeList);
// if any comparators are the null set, then replace with JUST null set
// if more than one comparator, remove any * comparators
// also, don't include the same comparator more than once
rangeList.length;
const rangeMap = new Map();
for (const comp of rangeList) {
if (isNullSet(comp))
const comparators = rangeList.map(comp => new comparator(comp, this.options));
for (const comp of comparators) {
if (isNullSet(comp)) {
return [comp]
}
rangeMap.set(comp.value, comp);
}
if (rangeMap.size > 1 && rangeMap.has(''))
if (rangeMap.size > 1 && rangeMap.has('')) {
rangeMap.delete('');
}
const result = [...rangeMap.values()];
cache.set(memoKey, result);
@ -26958,7 +26974,7 @@ const {
t: t$1,
comparatorTrimReplace,
tildeTrimReplace,
caretTrimReplace
caretTrimReplace,
} = re_1;
const isNullSet = c => c.value === '<0.0.0-0';
@ -27007,8 +27023,8 @@ const isX = id => !id || id.toLowerCase() === 'x' || id === '*';
// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0
// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0
const replaceTildes = (comp, options) =>
comp.trim().split(/\s+/).map((comp) => {
return replaceTilde(comp, options)
comp.trim().split(/\s+/).map((c) => {
return replaceTilde(c, options)
}).join(' ');
const replaceTilde = (comp, options) => {
@ -27046,8 +27062,8 @@ const replaceTilde = (comp, options) => {
// ^1.2.3 --> >=1.2.3 <2.0.0-0
// ^1.2.0 --> >=1.2.0 <2.0.0-0
const replaceCarets = (comp, options) =>
comp.trim().split(/\s+/).map((comp) => {
return replaceCaret(comp, options)
comp.trim().split(/\s+/).map((c) => {
return replaceCaret(c, options)
}).join(' ');
const replaceCaret = (comp, options) => {
@ -27105,8 +27121,8 @@ const replaceCaret = (comp, options) => {
const replaceXRanges = (comp, options) => {
debug_1('replaceXRanges', comp, options);
return comp.split(/\s+/).map((comp) => {
return replaceXRange(comp, options)
return comp.split(/\s+/).map((c) => {
return replaceXRange(c, options)
}).join(' ')
};
@ -27167,8 +27183,9 @@ const replaceXRange = (comp, options) => {
}
}
if (gtlt === '<')
if (gtlt === '<') {
pr = '-0';
}
ret = `${gtlt + M}.${m}.${p}${pr}`;
} else if (xm) {
@ -27277,6 +27294,7 @@ class Comparator {
static get ANY () {
return ANY$2
}
constructor (comp, options) {
options = parseOptions_1(options);
@ -27353,7 +27371,7 @@ class Comparator {
if (!options || typeof options !== 'object') {
options = {
loose: !!options,
includePrerelease: false
includePrerelease: false,
};
}
@ -27401,7 +27419,7 @@ class Comparator {
var comparator = Comparator;
const {re, t} = re_1;
const { re, t } = re_1;
const satisfies = (version, range$1, options) => {
try {
@ -27511,8 +27529,9 @@ const minVersion = (range$1, loose) => {
throw new Error(`Unexpected operation: ${comparator.operator}`)
}
});
if (setMin && (!minver || gt_1(minver, setMin)))
if (setMin && (!minver || gt_1(minver, setMin))) {
minver = setMin;
}
}
if (minver && range$1.test(minver)) {
@ -27534,7 +27553,7 @@ const validRange = (range$1, options) => {
};
var valid = validRange;
const {ANY: ANY$1} = comparator;
const { ANY: ANY$1 } = comparator;
@ -27636,38 +27655,41 @@ var intersects_1 = intersects;
var simplify = (versions, range, options) => {
const set = [];
let min = null;
let first = null;
let prev = null;
const v = versions.sort((a, b) => compare_1(a, b, options));
for (const version of v) {
const included = satisfies_1(version, range, options);
if (included) {
prev = version;
if (!min)
min = version;
if (!first) {
first = version;
}
} else {
if (prev) {
set.push([min, prev]);
set.push([first, prev]);
}
prev = null;
min = null;
first = null;
}
}
if (min)
set.push([min, null]);
if (first) {
set.push([first, null]);
}
const ranges = [];
for (const [min, max] of set) {
if (min === max)
if (min === max) {
ranges.push(min);
else if (!max && min === v[0])
} else if (!max && min === v[0]) {
ranges.push('*');
else if (!max)
} else if (!max) {
ranges.push(`>=${min}`);
else if (min === v[0])
} else if (min === v[0]) {
ranges.push(`<=${max}`);
else
} else {
ranges.push(`${min} - ${max}`);
}
}
const simplified = ranges.join(' || ');
const original = typeof range.raw === 'string' ? range.raw : String(range);
@ -27715,8 +27737,9 @@ const { ANY } = comparator;
// - Else return true
const subset = (sub, dom, options = {}) => {
if (sub === dom)
if (sub === dom) {
return true
}
sub = new range(sub, options);
dom = new range(dom, options);
@ -27726,73 +27749,84 @@ const subset = (sub, dom, options = {}) => {
for (const simpleDom of dom.set) {
const isSub = simpleSubset(simpleSub, simpleDom, options);
sawNonNull = sawNonNull || isSub !== null;
if (isSub)
if (isSub) {
continue OUTER
}
}
// the null set is a subset of everything, but null simple ranges in
// a complex range should be ignored. so if we saw a non-null range,
// then we know this isn't a subset, but if EVERY simple range was null,
// then it is a subset.
if (sawNonNull)
if (sawNonNull) {
return false
}
}
return true
};
const simpleSubset = (sub, dom, options) => {
if (sub === dom)
if (sub === dom) {
return true
}
if (sub.length === 1 && sub[0].semver === ANY) {
if (dom.length === 1 && dom[0].semver === ANY)
if (dom.length === 1 && dom[0].semver === ANY) {
return true
else if (options.includePrerelease)
sub = [ new comparator('>=0.0.0-0') ];
else
sub = [ new comparator('>=0.0.0') ];
} else if (options.includePrerelease) {
sub = [new comparator('>=0.0.0-0')];
} else {
sub = [new comparator('>=0.0.0')];
}
}
if (dom.length === 1 && dom[0].semver === ANY) {
if (options.includePrerelease)
if (options.includePrerelease) {
return true
else
dom = [ new comparator('>=0.0.0') ];
} else {
dom = [new comparator('>=0.0.0')];
}
}
const eqSet = new Set();
let gt, lt;
for (const c of sub) {
if (c.operator === '>' || c.operator === '>=')
if (c.operator === '>' || c.operator === '>=') {
gt = higherGT(gt, c, options);
else if (c.operator === '<' || c.operator === '<=')
} else if (c.operator === '<' || c.operator === '<=') {
lt = lowerLT(lt, c, options);
else
} else {
eqSet.add(c.semver);
}
}
if (eqSet.size > 1)
if (eqSet.size > 1) {
return null
}
let gtltComp;
if (gt && lt) {
gtltComp = compare_1(gt.semver, lt.semver, options);
if (gtltComp > 0)
if (gtltComp > 0) {
return null
else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<='))
} else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {
return null
}
}
// will iterate one or zero times
for (const eq of eqSet) {
if (gt && !satisfies_1(eq, String(gt), options))
if (gt && !satisfies_1(eq, String(gt), options)) {
return null
}
if (lt && !satisfies_1(eq, String(lt), options))
if (lt && !satisfies_1(eq, String(lt), options)) {
return null
}
for (const c of dom) {
if (!satisfies_1(eq, String(c), options))
if (!satisfies_1(eq, String(c), options)) {
return false
}
}
return true
@ -27828,10 +27862,12 @@ const simpleSubset = (sub, dom, options) => {
}
if (c.operator === '>' || c.operator === '>=') {
higher = higherGT(gt, c, options);
if (higher === c && higher !== gt)
if (higher === c && higher !== gt) {
return false
} else if (gt.operator === '>=' && !satisfies_1(gt.semver, String(c), options))
}
} else if (gt.operator === '>=' && !satisfies_1(gt.semver, String(c), options)) {
return false
}
}
if (lt) {
if (needDomLTPre) {
@ -27844,37 +27880,44 @@ const simpleSubset = (sub, dom, options) => {
}
if (c.operator === '<' || c.operator === '<=') {
lower = lowerLT(lt, c, options);
if (lower === c && lower !== lt)
if (lower === c && lower !== lt) {
return false
} else if (lt.operator === '<=' && !satisfies_1(lt.semver, String(c), options))
}
} else if (lt.operator === '<=' && !satisfies_1(lt.semver, String(c), options)) {
return false
}
}
if (!c.operator && (lt || gt) && gtltComp !== 0)
if (!c.operator && (lt || gt) && gtltComp !== 0) {
return false
}
}
// if there was a < or >, and nothing in the dom, then must be false
// UNLESS it was limited by another range in the other direction.
// Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
if (gt && hasDomLT && !lt && gtltComp !== 0)
if (gt && hasDomLT && !lt && gtltComp !== 0) {
return false
}
if (lt && hasDomGT && !gt && gtltComp !== 0)
if (lt && hasDomGT && !gt && gtltComp !== 0) {
return false
}
// we needed a prerelease range in a specific tuple, but didn't get one
// then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,
// because it includes prereleases in the 1.2.3 tuple
if (needDomGTPre || needDomLTPre)
if (needDomGTPre || needDomLTPre) {
return false
}
return true
};
// >=1.2.3 is lower than >1.2.3
const higherGT = (a, b, options) => {
if (!a)
if (!a) {
return b
}
const comp = compare_1(a.semver, b.semver, options);
return comp > 0 ? a
: comp < 0 ? b
@ -27884,8 +27927,9 @@ const higherGT = (a, b, options) => {
// <=1.2.3 is higher than <1.2.3
const lowerLT = (a, b, options) => {
if (!a)
if (!a) {
return b
}
const comp = compare_1(a.semver, b.semver, options);
return comp < 0 ? a
: comp > 0 ? b

2
dist/rollup-plugin-typescript2.es.js.map vendored
View File

File diff suppressed because one or more lines are too long

170
package-lock.json generated
View File

@ -1,12 +1,12 @@
{
"name": "rollup-plugin-typescript2",
"version": "0.31.2",
"version": "0.31.3",
"lockfileVersion": 2,
"requires": true,
"packages": {
"": {
"name": "rollup-plugin-typescript2",
"version": "0.31.2",
"version": "0.31.3",
"license": "MIT",
"dependencies": {
"@rollup/pluginutils": "^4.1.2",
@ -18,7 +18,7 @@
},
"devDependencies": {
"@rollup/plugin-commonjs": "17.1.0",
"@rollup/plugin-node-resolve": "11.2.0",
"@rollup/plugin-node-resolve": "13.2.1",
"@types/colors": "1.2.1",
"@types/find-cache-dir": "^2.0.0",
"@types/fs-extra": "8.0.1",
@ -35,10 +35,10 @@
"rimraf": "3.0.2",
"rollup": "^2.48.0",
"rollup-plugin-re": "1.0.7",
"rollup-plugin-typescript2": "0.31.1",
"semver": "7.3.5",
"rollup-plugin-typescript2": "0.31.2",
"semver": "7.3.7",
"tslint": "6.1.3",
"typescript": "^4.5.4"
"typescript": "^4.6.3"
},
"peerDependencies": {
"rollup": ">=1.26.3",
@ -122,9 +122,9 @@
"dev": true
},
"node_modules/@rollup/plugin-node-resolve": {
"version": "11.2.0",
"resolved": "https://registry.npmjs.org/@rollup/plugin-node-resolve/-/plugin-node-resolve-11.2.0.tgz",
"integrity": "sha512-qHjNIKYt5pCcn+5RUBQxK8krhRvf1HnyVgUCcFFcweDS7fhkOLZeYh0mhHK6Ery8/bb9tvN/ubPzmfF0qjDCTA==",
"version": "13.2.1",
"resolved": "https://registry.npmjs.org/@rollup/plugin-node-resolve/-/plugin-node-resolve-13.2.1.tgz",
"integrity": "sha512-btX7kzGvp1JwShQI9V6IM841YKNPYjKCvUbNrQ2EcVYbULtUd/GH6wZ/qdqH13j9pOHBER+EZXNN2L8RSJhVRA==",
"dev": true,
"dependencies": {
"@rollup/pluginutils": "^3.1.0",
@ -138,7 +138,7 @@
"node": ">= 10.0.0"
},
"peerDependencies": {
"rollup": "^1.20.0||^2.0.0"
"rollup": "^2.42.0"
}
},
"node_modules/@rollup/plugin-node-resolve/node_modules/@rollup/pluginutils": {
@ -794,9 +794,9 @@
}
},
"node_modules/minimist": {
"version": "1.2.5",
"resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.5.tgz",
"integrity": "sha512-FM9nNUYrRBAELZQT3xeZQ7fmMOBg6nWNmJKTcgsJeaLstP/UODVpGsr5OhXhhXg6f+qtJ8uiZ+PUxkDWcgIXLw==",
"version": "1.2.6",
"resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.6.tgz",
"integrity": "sha512-Jsjnk4bw3YJqYzbdyBiNsPWHPfO++UGG749Cxs6peCu5Xg4nrena6OVxOYxrQTqww0Jmwt+Ref8rggumkTLz9Q==",
"dev": true
},
"node_modules/mkdirp": {
@ -984,61 +984,23 @@
}
},
"node_modules/rollup-plugin-typescript2": {
"version": "0.31.1",
"resolved": "https://registry.npmjs.org/rollup-plugin-typescript2/-/rollup-plugin-typescript2-0.31.1.tgz",
"integrity": "sha512-sklqXuQwQX+stKi4kDfEkneVESPi3YM/2S899vfRdF9Yi40vcC50Oq4A4cSZJNXsAQE/UsBZl5fAOsBLziKmjw==",
"version": "0.31.2",
"resolved": "https://registry.npmjs.org/rollup-plugin-typescript2/-/rollup-plugin-typescript2-0.31.2.tgz",
"integrity": "sha512-hRwEYR1C8xDGVVMFJQdEVnNAeWRvpaY97g5mp3IeLnzhNXzSVq78Ye/BJ9PAaUfN4DXa/uDnqerifMOaMFY54Q==",
"dev": true,
"dependencies": {
"@rollup/pluginutils": "^4.1.0",
"@yarn-tool/resolve-package": "^1.0.36",
"find-cache-dir": "^3.3.1",
"fs-extra": "8.1.0",
"resolve": "1.20.0",
"tslib": "2.2.0"
"@rollup/pluginutils": "^4.1.2",
"@yarn-tool/resolve-package": "^1.0.40",
"find-cache-dir": "^3.3.2",
"fs-extra": "^10.0.0",
"resolve": "^1.20.0",
"tslib": "^2.3.1"
},
"peerDependencies": {
"rollup": ">=1.26.3",
"typescript": ">=2.4.0"
}
},
"node_modules/rollup-plugin-typescript2/node_modules/fs-extra": {
"version": "8.1.0",
"resolved": "https://registry.npmjs.org/fs-extra/-/fs-extra-8.1.0.tgz",
"integrity": "sha512-yhlQgA6mnOJUKOsRUFsgJdQCvkKhcz8tlZG5HBQfReYZy46OwLcY+Zia0mtdHsOo9y/hP+CxMN0TU9QxoOtG4g==",
"dev": true,
"dependencies": {
"graceful-fs": "^4.2.0",
"jsonfile": "^4.0.0",
"universalify": "^0.1.0"
},
"engines": {
"node": ">=6 <7 || >=8"
}
},
"node_modules/rollup-plugin-typescript2/node_modules/jsonfile": {
"version": "4.0.0",
"resolved": "https://registry.npmjs.org/jsonfile/-/jsonfile-4.0.0.tgz",
"integrity": "sha1-h3Gq4HmbZAdrdmQPygWPnBDjPss=",
"dev": true,
"optionalDependencies": {
"graceful-fs": "^4.1.6"
}
},
"node_modules/rollup-plugin-typescript2/node_modules/tslib": {
"version": "2.2.0",
"resolved": "https://registry.npmjs.org/tslib/-/tslib-2.2.0.tgz",
"integrity": "sha512-gS9GVHRU+RGn5KQM2rllAlR3dU6m7AcpJKdtH8gFvQiC4Otgk98XnmMU+nZenHt/+VhnBPWwgrJsyrdcw6i23w==",
"dev": true
},
"node_modules/rollup-plugin-typescript2/node_modules/universalify": {
"version": "0.1.2",
"resolved": "https://registry.npmjs.org/universalify/-/universalify-0.1.2.tgz",
"integrity": "sha512-rBJeI5CXAlmy1pV+617WB9J63U6XcazHHF2f2dbJix4XzpUF0RS3Zbj0FGIOCAva5P/d/GBOYaACQ1w+0azUkg==",
"dev": true,
"engines": {
"node": ">= 4.0.0"
}
},
"node_modules/rollup-pluginutils": {
"version": "2.8.2",
"resolved": "https://registry.npmjs.org/rollup-pluginutils/-/rollup-pluginutils-2.8.2.tgz",
@ -1049,9 +1011,9 @@
}
},
"node_modules/semver": {
"version": "7.3.5",
"resolved": "https://registry.npmjs.org/semver/-/semver-7.3.5.tgz",
"integrity": "sha512-PoeGJYh8HK4BTO/a9Tf6ZG3veo/A7ZVsYrSA6J8ny9nb3B1VrpkuN+z9OE5wfE5p6H4LchYZsegiQgbJD94ZFQ==",
"version": "7.3.7",
"resolved": "https://registry.npmjs.org/semver/-/semver-7.3.7.tgz",
"integrity": "sha512-QlYTucUYOews+WeEujDoEGziz4K6c47V/Bd+LjSSYcA94p+DmINdf7ncaUinThfvZyu13lN9OY1XDxt8C0Tw0g==",
"dev": true,
"dependencies": {
"lru-cache": "^6.0.0"
@ -1177,9 +1139,9 @@
"integrity": "sha512-Ka0DBegjuV9IPYFT1h0Qqk5U4pccebNIJCGl8C5uU7xtOs+jpJvKGAY4fHGK25hTmXZOEUl9Cnsg5cS6K/b5DA=="
},
"node_modules/typescript": {
"version": "4.5.4",
"resolved": "https://registry.npmjs.org/typescript/-/typescript-4.5.4.tgz",
"integrity": "sha512-VgYs2A2QIRuGphtzFV7aQJduJ2gyfTljngLzjpfW9FoYZF6xuw1W0vW9ghCKLfcWrCFxK81CSGRAvS1pn4fIUg==",
"version": "4.6.3",
"resolved": "https://registry.npmjs.org/typescript/-/typescript-4.6.3.tgz",
"integrity": "sha512-yNIatDa5iaofVozS/uQJEl3JRWLKKGJKh6Yaiv0GLGSuhpFJe7P3SbHZ8/yjAHRQwKRoA6YZqlfjXWmVzoVSMw==",
"dev": true,
"bin": {
"tsc": "bin/tsc",
@ -1297,9 +1259,9 @@
}
},
"@rollup/plugin-node-resolve": {
"version": "11.2.0",
"resolved": "https://registry.npmjs.org/@rollup/plugin-node-resolve/-/plugin-node-resolve-11.2.0.tgz",
"integrity": "sha512-qHjNIKYt5pCcn+5RUBQxK8krhRvf1HnyVgUCcFFcweDS7fhkOLZeYh0mhHK6Ery8/bb9tvN/ubPzmfF0qjDCTA==",
"version": "13.2.1",
"resolved": "https://registry.npmjs.org/@rollup/plugin-node-resolve/-/plugin-node-resolve-13.2.1.tgz",
"integrity": "sha512-btX7kzGvp1JwShQI9V6IM841YKNPYjKCvUbNrQ2EcVYbULtUd/GH6wZ/qdqH13j9pOHBER+EZXNN2L8RSJhVRA==",
"dev": true,
"requires": {
"@rollup/pluginutils": "^3.1.0",
@ -1840,9 +1802,9 @@
}
},
"minimist": {
"version": "1.2.5",
"resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.5.tgz",
"integrity": "sha512-FM9nNUYrRBAELZQT3xeZQ7fmMOBg6nWNmJKTcgsJeaLstP/UODVpGsr5OhXhhXg6f+qtJ8uiZ+PUxkDWcgIXLw==",
"version": "1.2.6",
"resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.6.tgz",
"integrity": "sha512-Jsjnk4bw3YJqYzbdyBiNsPWHPfO++UGG749Cxs6peCu5Xg4nrena6OVxOYxrQTqww0Jmwt+Ref8rggumkTLz9Q==",
"dev": true
},
"mkdirp": {
@ -1984,51 +1946,17 @@
}
},
"rollup-plugin-typescript2": {
"version": "0.31.1",
"resolved": "https://registry.npmjs.org/rollup-plugin-typescript2/-/rollup-plugin-typescript2-0.31.1.tgz",
"integrity": "sha512-sklqXuQwQX+stKi4kDfEkneVESPi3YM/2S899vfRdF9Yi40vcC50Oq4A4cSZJNXsAQE/UsBZl5fAOsBLziKmjw==",
"version": "0.31.2",
"resolved": "https://registry.npmjs.org/rollup-plugin-typescript2/-/rollup-plugin-typescript2-0.31.2.tgz",
"integrity": "sha512-hRwEYR1C8xDGVVMFJQdEVnNAeWRvpaY97g5mp3IeLnzhNXzSVq78Ye/BJ9PAaUfN4DXa/uDnqerifMOaMFY54Q==",
"dev": true,
"requires": {
"@rollup/pluginutils": "^4.1.0",
"@yarn-tool/resolve-package": "^1.0.36",
"find-cache-dir": "^3.3.1",
"fs-extra": "8.1.0",
"resolve": "1.20.0",
"tslib": "2.2.0"
},
"dependencies": {
"fs-extra": {
"version": "8.1.0",
"resolved": "https://registry.npmjs.org/fs-extra/-/fs-extra-8.1.0.tgz",
"integrity": "sha512-yhlQgA6mnOJUKOsRUFsgJdQCvkKhcz8tlZG5HBQfReYZy46OwLcY+Zia0mtdHsOo9y/hP+CxMN0TU9QxoOtG4g==",
"dev": true,
"requires": {
"graceful-fs": "^4.2.0",
"jsonfile": "^4.0.0",
"universalify": "^0.1.0"
}
},
"jsonfile": {
"version": "4.0.0",
"resolved": "https://registry.npmjs.org/jsonfile/-/jsonfile-4.0.0.tgz",
"integrity": "sha1-h3Gq4HmbZAdrdmQPygWPnBDjPss=",
"dev": true,
"requires": {
"graceful-fs": "^4.1.6"
}
},
"tslib": {
"version": "2.2.0",
"resolved": "https://registry.npmjs.org/tslib/-/tslib-2.2.0.tgz",
"integrity": "sha512-gS9GVHRU+RGn5KQM2rllAlR3dU6m7AcpJKdtH8gFvQiC4Otgk98XnmMU+nZenHt/+VhnBPWwgrJsyrdcw6i23w==",
"dev": true
},
"universalify": {
"version": "0.1.2",
"resolved": "https://registry.npmjs.org/universalify/-/universalify-0.1.2.tgz",
"integrity": "sha512-rBJeI5CXAlmy1pV+617WB9J63U6XcazHHF2f2dbJix4XzpUF0RS3Zbj0FGIOCAva5P/d/GBOYaACQ1w+0azUkg==",
"dev": true
}
"@rollup/pluginutils": "^4.1.2",
"@yarn-tool/resolve-package": "^1.0.40",
"find-cache-dir": "^3.3.2",
"fs-extra": "^10.0.0",
"resolve": "^1.20.0",
"tslib": "^2.3.1"
}
},
"rollup-pluginutils": {
@ -2041,9 +1969,9 @@
}
},
"semver": {
"version": "7.3.5",
"resolved": "https://registry.npmjs.org/semver/-/semver-7.3.5.tgz",
"integrity": "sha512-PoeGJYh8HK4BTO/a9Tf6ZG3veo/A7ZVsYrSA6J8ny9nb3B1VrpkuN+z9OE5wfE5p6H4LchYZsegiQgbJD94ZFQ==",
"version": "7.3.7",
"resolved": "https://registry.npmjs.org/semver/-/semver-7.3.7.tgz",
"integrity": "sha512-QlYTucUYOews+WeEujDoEGziz4K6c47V/Bd+LjSSYcA94p+DmINdf7ncaUinThfvZyu13lN9OY1XDxt8C0Tw0g==",
"dev": true,
"requires": {
"lru-cache": "^6.0.0"
@ -2145,9 +2073,9 @@
"integrity": "sha512-Ka0DBegjuV9IPYFT1h0Qqk5U4pccebNIJCGl8C5uU7xtOs+jpJvKGAY4fHGK25hTmXZOEUl9Cnsg5cS6K/b5DA=="
},
"typescript": {
"version": "4.5.4",
"resolved": "https://registry.npmjs.org/typescript/-/typescript-4.5.4.tgz",
"integrity": "sha512-VgYs2A2QIRuGphtzFV7aQJduJ2gyfTljngLzjpfW9FoYZF6xuw1W0vW9ghCKLfcWrCFxK81CSGRAvS1pn4fIUg==",
"version": "4.6.3",
"resolved": "https://registry.npmjs.org/typescript/-/typescript-4.6.3.tgz",
"integrity": "sha512-yNIatDa5iaofVozS/uQJEl3JRWLKKGJKh6Yaiv0GLGSuhpFJe7P3SbHZ8/yjAHRQwKRoA6YZqlfjXWmVzoVSMw==",
"dev": true
},
"universalify": {

8
package.json
View File

@ -57,12 +57,12 @@
"rimraf": "3.0.2",
"rollup": "^2.48.0",
"@rollup/plugin-commonjs": "17.1.0",
"@rollup/plugin-node-resolve": "11.2.0",
"@rollup/plugin-node-resolve": "13.2.1",
"rollup-plugin-re": "1.0.7",
"rollup-plugin-typescript2": "0.31.1",
"semver": "7.3.5",
"rollup-plugin-typescript2": "0.31.2",
"semver": "7.3.7",
"tslint": "6.1.3",
"typescript": "^4.5.4"
"typescript": "^4.6.3"
},
"repository": {
"type": "git",