foster/denoland-deno
1
0
Fork 0
mirror of https://github.com/denoland/deno.git synced 2024-12-22 07:14:47 -05:00
Code Issues Packages 1 Wiki Activity

feat: bump TypeScript to 4.0.3 (#7637)

Browse source
This commit is contained in:
Trivikram Kamat 2020-09-22 21:36:03 -07:00 committed by GitHub
parent ffd08a2249
commit 49807ac4ac
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 18 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
cli/tsc/00_typescript.js vendored
View file

@ -288,7 +288,7 @@ var ts;
// If changing the text in this section, be sure to test `configurePrerelease` too. // If changing the text in this section, be sure to test `configurePrerelease` too.
ts.versionMajorMinor = "4.0"; ts.versionMajorMinor = "4.0";
/** The version of the TypeScript compiler release */ /** The version of the TypeScript compiler release */
ts.version = "4.0.2"; ts.version = "4.0.3";
/* @internal */ /* @internal */
var Comparison; var Comparison;
(function (Comparison) { (function (Comparison) {
@ -6368,6 +6368,10 @@ var ts;
return ts.matchFiles(path, extensions, excludes, includes, useCaseSensitiveFileNames, process.cwd(), depth, getAccessibleFileSystemEntries, realpath); return ts.matchFiles(path, extensions, excludes, includes, useCaseSensitiveFileNames, process.cwd(), depth, getAccessibleFileSystemEntries, realpath);
} }
function fileSystemEntryExists(path, entryKind) { function fileSystemEntryExists(path, entryKind) {
// Since the error thrown by fs.statSync isn't used, we can avoid collecting a stack trace to improve
// the CPU time performance.
var originalStackTraceLimit = Error.stackTraceLimit;
Error.stackTraceLimit = 0;
try { try {
var stat = _fs.statSync(path); var stat = _fs.statSync(path);
switch (entryKind) { switch (entryKind) {
@ -6379,6 +6383,9 @@ var ts;
catch (e) { catch (e) {
return false; return false;
} }
finally {
Error.stackTraceLimit = originalStackTraceLimit;
}
} }
function fileExists(path) { function fileExists(path) {
return fileSystemEntryExists(path, 0 /* File */); return fileSystemEntryExists(path, 0 /* File */);
@ -70736,13 +70743,10 @@ var ts;
function checkTupleType(node) { function checkTupleType(node) {
var elementTypes = node.elements; var elementTypes = node.elements;
var seenOptionalElement = false; var seenOptionalElement = false;
var seenNamedElement = false; var hasNamedElement = ts.some(elementTypes, ts.isNamedTupleMember);
for (var i = 0; i < elementTypes.length; i++) { for (var i = 0; i < elementTypes.length; i++) {
var e = elementTypes[i]; var e = elementTypes[i];
if (e.kind === 191 /* NamedTupleMember */) { if (e.kind !== 191 /* NamedTupleMember */ && hasNamedElement) {
seenNamedElement = true;
}
else if (seenNamedElement) {
grammarErrorOnNode(e, ts.Diagnostics.Tuple_members_must_all_have_names_or_all_not_have_names); grammarErrorOnNode(e, ts.Diagnostics.Tuple_members_must_all_have_names_or_all_not_have_names);
break; break;
} }
@ -112965,7 +112969,10 @@ var ts;
var newImport = sortedNewImports_1[_i]; var newImport = sortedNewImports_1[_i];
var insertionIndex = ts.OrganizeImports.getImportDeclarationInsertionIndex(existingImportStatements, newImport); var insertionIndex = ts.OrganizeImports.getImportDeclarationInsertionIndex(existingImportStatements, newImport);
if (insertionIndex === 0) { if (insertionIndex === 0) {
changes.insertNodeBefore(sourceFile, existingImportStatements[0], newImport, /*blankLineBetween*/ false); // If the first import is top-of-file, insert after the leading comment which is likely the header.
var options = existingImportStatements[0] === sourceFile.statements[0] ?
{ leadingTriviaOption: ts.textChanges.LeadingTriviaOption.Exclude } : {};
changes.insertNodeBefore(sourceFile, existingImportStatements[0], newImport, /*blankLineBetween*/ false, options);
} }
else { else {
var prevImport = existingImportStatements[insertionIndex - 1]; var prevImport = existingImportStatements[insertionIndex - 1];
@ -130093,9 +130100,10 @@ var ts;
this.insertNodeAt(sourceFile, parameters.pos, newParam); this.insertNodeAt(sourceFile, parameters.pos, newParam);
} }
}; };
ChangeTracker.prototype.insertNodeBefore = function (sourceFile, before, newNode, blankLineBetween) { ChangeTracker.prototype.insertNodeBefore = function (sourceFile, before, newNode, blankLineBetween, options) {
if (blankLineBetween === void 0) { blankLineBetween = false; } if (blankLineBetween === void 0) { blankLineBetween = false; }
this.insertNodeAt(sourceFile, getAdjustedStartPosition(sourceFile, before, {}), newNode, this.getOptionsForInsertNodeBefore(before, newNode, blankLineBetween)); if (options === void 0) { options = {}; }
this.insertNodeAt(sourceFile, getAdjustedStartPosition(sourceFile, before, options), newNode, this.getOptionsForInsertNodeBefore(before, newNode, blankLineBetween));
}; };
ChangeTracker.prototype.insertModifierBefore = function (sourceFile, modifier, before) { ChangeTracker.prototype.insertModifierBefore = function (sourceFile, modifier, before) {
var pos = before.getStart(sourceFile); var pos = before.getStart(sourceFile);
@ -133963,7 +133971,7 @@ var ts;
else if (existingSpecifiers === null || existingSpecifiers === void 0 ? void 0 : existingSpecifiers.length) { else if (existingSpecifiers === null || existingSpecifiers === void 0 ? void 0 : existingSpecifiers.length) {
for (var _b = 0, newSpecifiers_2 = newSpecifiers; _b < newSpecifiers_2.length; _b++) { for (var _b = 0, newSpecifiers_2 = newSpecifiers; _b < newSpecifiers_2.length; _b++) {
var spec = newSpecifiers_2[_b]; var spec = newSpecifiers_2[_b];
changes.insertNodeAtEndOfList(sourceFile, existingSpecifiers, spec); changes.insertNodeInListAfter(sourceFile, ts.last(existingSpecifiers), spec, existingSpecifiers);
} }
} }
else { else {